{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012320547,0.00005344102,0.99708635,0.000026324933,0.000027267033,0.00004233605,0.000048977,0.0006930582,0.00079026027],"genre_scores_gemma":[0.0646617,0.00012517374,0.9306446,0.00011215184,0.000059019778,0.0002375369,0.0006171758,0.00044255145,0.003100168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894065,0.00017168405,0.00006490535,0.00029513772,0.00045615368,0.00007140318],"domain_scores_gemma":[0.999006,0.00038812778,0.00006302851,0.00018684722,0.00032582786,0.00003019613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009869594,0.0016121254,0.0020871765,0.0018305924,0.0007764051,0.0013540341,0.0022761011,0.0017118312,0.00901442],"category_scores_gemma":[0.0031022057,0.0008462814,0.0015700317,0.0017395945,0.00062552997,0.0012839485,0.0015866652,0.0025112843,0.0038196777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013441015,0.00015006123,0.0003880735,0.00018726893,0.000053626278,0.000093649054,0.000049796727,0.3644134,0.009616735,0.0098512145,0.0061855656,0.60887617],"study_design_scores_gemma":[0.0000075505004,0.000018313358,0.00005134291,0.000006801432,0.000007701808,0.000022371692,0.000006847798,0.99544144,0.0010539409,0.0021350458,0.00124323,0.0000054075463],"about_ca_topic_score_codex":0.00559417,"about_ca_topic_score_gemma":0.0065160384,"teacher_disagreement_score":0.00901442,"about_ca_system_score_codex":0.0005947092,"about_ca_system_score_gemma":0.0011291014,"threshold_uncertainty_score":0.030156255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4452396,0.0010405448,0.4489715,0.0012788011,0.00007875945,0.0012164069,0.00034523202,0.001429645,0.100399405],"genre_scores_gemma":[0.7650415,0.000505331,0.2184466,0.00010343419,0.000018814433,0.0003468913,0.00025286927,0.0001307582,0.01515388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988555,0.00056497817,0.00003263922,0.000089714,0.00032217315,0.00013503083],"domain_scores_gemma":[0.9991872,0.00038024219,0.000046654513,0.00014338568,0.00016485596,0.00007761916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010618824,0.0005263441,0.00031601844,0.0005454526,0.0010796285,0.0010607005,0.00097155396,0.0014510743,0.004537458],"category_scores_gemma":[0.0022284035,0.0002631861,0.0004770133,0.000933517,0.00088256015,0.0006972515,0.00092205236,0.00063486444,0.0005389921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025922118,0.00039472454,0.005449693,0.00046438296,0.000044263477,0.0025128452,0.00097505614,0.7519921,0.01051414,0.053779334,0.005617277,0.16799685],"study_design_scores_gemma":[0.0001638625,0.00074935454,0.002198528,0.000064303335,0.000049250586,0.0010347366,0.0010414891,0.90748006,0.012089172,0.0147448005,0.060345754,0.000038532602],"about_ca_topic_score_codex":0.016936542,"about_ca_topic_score_gemma":0.023862181,"teacher_disagreement_score":0.016936542,"about_ca_system_score_codex":0.0019054635,"about_ca_system_score_gemma":0.0022570535,"threshold_uncertainty_score":0.03367591},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11874141,0.0033437966,0.47089684,0.0041397284,0.0006341581,0.00009257101,0.0012417657,0.0005737572,0.400336],"genre_scores_gemma":[0.93941474,0.0018797126,0.03386493,0.00039581506,0.00057830213,0.00013117674,0.0011590092,0.00028090118,0.0222955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991792,0.00020518976,0.000048979036,0.00018063071,0.00026091392,0.00012509871],"domain_scores_gemma":[0.9950895,0.003267418,0.0003929665,0.0007097862,0.00026070955,0.00027963222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096449105,0.0009426528,0.0007541458,0.001793296,0.0014615343,0.0025651776,0.0013801608,0.0016051182,0.02236733],"category_scores_gemma":[0.0075915116,0.00051319407,0.0009543329,0.0017582697,0.0028900097,0.00802287,0.002327376,0.0040142643,0.0016413846],"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.000049539212,0.000026375948,0.0003130252,0.000097961914,0.0000142703675,0.00011540577,0.000085608575,0.005312345,0.0008469093,0.98437864,0.0026298214,0.0061300513],"study_design_scores_gemma":[0.000010146332,0.0000105592135,0.0001727429,0.000020078516,0.00001170467,0.00007269672,0.000044925837,0.009571802,0.00052616297,0.9869478,0.002603063,0.000008276868],"about_ca_topic_score_codex":0.0013826735,"about_ca_topic_score_gemma":0.0018067422,"teacher_disagreement_score":0.02236733,"about_ca_system_score_codex":0.0012987506,"about_ca_system_score_gemma":0.0006592888,"threshold_uncertainty_score":0.07482618},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76472396,0.0034473932,0.20130202,0.00028940855,0.0003512947,0.00006925578,0.0012016456,0.007956304,0.020658663],"genre_scores_gemma":[0.9618433,0.0005765717,0.031625085,0.000043557066,0.000056634504,0.00004189665,0.0008207782,0.00038722338,0.004604871],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990558,0.0001231284,0.00002818858,0.00012797091,0.00054216146,0.00012279549],"domain_scores_gemma":[0.9976272,0.00097299076,0.00013849253,0.00073666236,0.0004285849,0.00009598331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042714624,0.00060994324,0.0005863025,0.0011693375,0.0003892512,0.0004898578,0.0012229845,0.0005095372,0.0034478959],"category_scores_gemma":[0.003008821,0.0004201725,0.00018723404,0.0017278255,0.0004504725,0.0017308021,0.00042358605,0.0009538443,0.00090250175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016657738,0.0007549988,0.013467774,0.0006765685,0.00014325214,0.0001979415,0.00038484196,0.08512661,0.50888705,0.022743786,0.015836958,0.35011443],"study_design_scores_gemma":[0.000062111765,0.001114172,0.027150193,0.000051108804,0.000085865344,0.0006061763,0.00012354096,0.34904987,0.6015282,0.008880735,0.011268257,0.00007984905],"about_ca_topic_score_codex":0.000597797,"about_ca_topic_score_gemma":0.00060670683,"teacher_disagreement_score":0.0034478959,"about_ca_system_score_codex":0.00053918996,"about_ca_system_score_gemma":0.00029224946,"threshold_uncertainty_score":0.011534333},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021480743,0.00022526733,0.89903224,0.000100818834,0.00011731001,0.000100697274,0.00032369024,0.096337266,0.0016146743],"genre_scores_gemma":[0.16094857,0.0003862993,0.8056574,0.0004260744,0.0002196012,0.00050133263,0.0016450876,0.024845205,0.0053704106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926152,0.002038308,0.0006053305,0.0015661807,0.0024631822,0.00071182934],"domain_scores_gemma":[0.98561525,0.006452877,0.0010931557,0.004931413,0.0016066547,0.00030060147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062814523,0.0032523707,0.0029753027,0.0024847894,0.001504705,0.005743348,0.0073050875,0.0027180407,0.01633156],"category_scores_gemma":[0.024227306,0.0032675068,0.0037039695,0.0013087734,0.0029995863,0.008061335,0.0041810726,0.0053806696,0.0055009173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003012498,0.00048325112,0.0052747754,0.00262135,0.00083825673,0.00062110357,0.0007078551,0.12093362,0.0501659,0.21213865,0.070982024,0.53222084],"study_design_scores_gemma":[0.00036183032,0.00021322048,0.00062195584,0.00027272615,0.0003950949,0.00027864252,0.0000845932,0.7675243,0.08544644,0.09425823,0.050299816,0.00024317288],"about_ca_topic_score_codex":0.0064553586,"about_ca_topic_score_gemma":0.008739302,"teacher_disagreement_score":0.01633156,"about_ca_system_score_codex":0.002705371,"about_ca_system_score_gemma":0.005057464,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84293294,0.0028031573,0.13389103,0.0016322215,0.00035344233,0.0001403334,0.00019232497,0.0028223754,0.015232292],"genre_scores_gemma":[0.969014,0.00027171403,0.028710151,0.00014445659,0.0000458503,0.000042227275,0.00012956577,0.0002447973,0.0013972555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978618,0.00065776205,0.00014944804,0.0003174635,0.00069229136,0.00032120047],"domain_scores_gemma":[0.993028,0.0027111403,0.00097172934,0.0018056703,0.001057997,0.00042541928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018368879,0.00056532066,0.0007062864,0.00055200676,0.0014644223,0.0017750654,0.0014288471,0.0007021965,0.0027174319],"category_scores_gemma":[0.016155532,0.00046683004,0.0002956052,0.0012789712,0.0008472117,0.0031527996,0.0013986382,0.0011008258,0.0009057813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027397901,0.00059660996,0.049037017,0.00074564584,0.00027551615,0.000869923,0.0017038876,0.44528356,0.08771924,0.03933036,0.011976633,0.35972187],"study_design_scores_gemma":[0.0001943343,0.0008547978,0.013698674,0.000075937394,0.00015670755,0.00056501967,0.00053024426,0.8688517,0.074110895,0.025949718,0.014923451,0.00008842087],"about_ca_topic_score_codex":0.0021640295,"about_ca_topic_score_gemma":0.0027526794,"teacher_disagreement_score":0.0027174319,"about_ca_system_score_codex":0.0013939077,"about_ca_system_score_gemma":0.0013386562,"threshold_uncertainty_score":0.010113597},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0701453,0.0027563712,0.22865099,0.0066990624,0.0045143953,0.000121897974,0.0013134885,0.0008189461,0.68497956],"genre_scores_gemma":[0.7369666,0.0018856958,0.07995943,0.0035831435,0.0027216088,0.00018624502,0.0007938936,0.0006712668,0.17323211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992157,0.00018321512,0.000025195166,0.00015327771,0.00026247656,0.00015994639],"domain_scores_gemma":[0.9991404,0.00020093862,0.00010555449,0.00013763696,0.00027192826,0.00014358587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049166376,0.0006215945,0.0004960619,0.0013541062,0.0012329844,0.002109733,0.0008797898,0.00085590594,0.03745981],"category_scores_gemma":[0.0029158345,0.00024179352,0.0004715325,0.0010046713,0.002475419,0.0024605163,0.0013869017,0.002481101,0.008890965],"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.00003584433,0.000015861684,0.0000648935,0.000046191242,0.00000468152,0.00009617089,0.00006740563,0.0003646584,0.0007764336,0.974037,0.012241132,0.012249826],"study_design_scores_gemma":[0.000017507538,0.000029490922,0.00023616431,0.00002105351,0.0000045251554,0.00043694925,0.0000703151,0.0030995114,0.0011756097,0.9478136,0.047075234,0.00002005632],"about_ca_topic_score_codex":0.0015179146,"about_ca_topic_score_gemma":0.0013955096,"teacher_disagreement_score":0.03745981,"about_ca_system_score_codex":0.0007133268,"about_ca_system_score_gemma":0.0007778743,"threshold_uncertainty_score":0.1253156},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21924654,0.0007983824,0.7543026,0.00029537923,0.00022054894,0.00016725693,0.00039824584,0.010323025,0.01424801],"genre_scores_gemma":[0.7903669,0.00022418561,0.2038807,0.00010284837,0.00004139549,0.00018252985,0.0006734898,0.00064979144,0.003878129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999529,0.00013851907,0.000032929667,0.000086305976,0.00012214512,0.000091227455],"domain_scores_gemma":[0.9993412,0.0001877596,0.000071390125,0.00020799511,0.0001291237,0.000062568535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048131536,0.0004597939,0.00034146916,0.0005221927,0.0004941351,0.00073876354,0.0011414347,0.00026079963,0.0033349856],"category_scores_gemma":[0.0018020158,0.0003846368,0.0003279027,0.0006954084,0.00035703956,0.0008351742,0.0004456955,0.00057864137,0.000715781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086965814,0.00027498754,0.0038302965,0.0003511676,0.00007198764,0.00036433665,0.00019138609,0.59684527,0.0687803,0.052104004,0.016056037,0.26026046],"study_design_scores_gemma":[0.0000507704,0.00011834658,0.0010110886,0.000018192202,0.000016972932,0.00006940769,0.00003078464,0.9677554,0.013511235,0.010260668,0.0071361335,0.00002102568],"about_ca_topic_score_codex":0.0029576172,"about_ca_topic_score_gemma":0.0043078247,"teacher_disagreement_score":0.0033349856,"about_ca_system_score_codex":0.00090469065,"about_ca_system_score_gemma":0.0010710525,"threshold_uncertainty_score":0.011156678},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009624601,0.00028141335,0.8336195,0.00015830391,0.00012160952,0.000070967566,0.0018135315,0.15579237,0.007179826],"genre_scores_gemma":[0.0715157,0.0010930483,0.7800584,0.0009027053,0.00033474827,0.00097199454,0.007992749,0.108936444,0.028194211],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982133,0.00034546427,0.00020040994,0.00029750564,0.00074740144,0.00019594564],"domain_scores_gemma":[0.99727005,0.0013486288,0.00019059394,0.0004770921,0.00063297874,0.000080732876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015315119,0.002657819,0.0012484435,0.002094849,0.000838706,0.0030173238,0.003416662,0.0010956998,0.08903304],"category_scores_gemma":[0.006997372,0.0016176698,0.002136888,0.001590813,0.0009243358,0.0032541195,0.0020593482,0.0027933617,0.033738647],"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.0007394204,0.00018819659,0.001727139,0.0016391224,0.00030028805,0.00049330905,0.00046183908,0.038574044,0.018844571,0.1258062,0.28270066,0.52852523],"study_design_scores_gemma":[0.00034735064,0.00014474732,0.00090688386,0.0006036953,0.00018273943,0.0008592159,0.00013216927,0.31860328,0.059251357,0.16141553,0.457328,0.00022510071],"about_ca_topic_score_codex":0.0030818118,"about_ca_topic_score_gemma":0.005070995,"teacher_disagreement_score":0.08903304,"about_ca_system_score_codex":0.0010541691,"about_ca_system_score_gemma":0.0018749981,"threshold_uncertainty_score":0.29784518},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012846825,0.0023574142,0.8429294,0.0011450468,0.0015235185,0.0007764188,0.021024935,0.06664103,0.062317405],"genre_scores_gemma":[0.014195863,0.0027409666,0.8356581,0.00089477346,0.0006259994,0.0038842882,0.044792663,0.02402252,0.07318494],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989354,0.00024652615,0.00007161339,0.00008964377,0.0005530812,0.00010375521],"domain_scores_gemma":[0.99845886,0.00044655814,0.00009667716,0.0003813376,0.00047006347,0.00014659284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013924238,0.0018758534,0.0021999164,0.0016142074,0.0007163013,0.0018739214,0.0029940398,0.0011793127,0.13957027],"category_scores_gemma":[0.0038262897,0.0010031506,0.0012349738,0.0018896798,0.0006367566,0.002110498,0.002794746,0.004396467,0.08523193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012601199,0.00011692287,0.00037435984,0.00077487057,0.0001410121,0.00023445438,0.00017015602,0.012139246,0.004434389,0.09294976,0.70271355,0.18582521],"study_design_scores_gemma":[0.00033353388,0.00006238413,0.00059440196,0.00017859101,0.000054784647,0.00033354043,0.000026217564,0.06649722,0.0039929156,0.047612257,0.8802484,0.00006570498],"about_ca_topic_score_codex":0.0020189246,"about_ca_topic_score_gemma":0.0017786463,"teacher_disagreement_score":0.13957027,"about_ca_system_score_codex":0.0006903053,"about_ca_system_score_gemma":0.0020913521,"threshold_uncertainty_score":0.46690905},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9038678,0.0027362136,0.064412616,0.00055271474,0.00014929954,0.00006591165,0.0009749452,0.0009780397,0.026262458],"genre_scores_gemma":[0.9773397,0.00027975047,0.018457107,0.0000659696,0.000019393472,0.000034824192,0.00027359187,0.000035686047,0.0034940075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999248,0.000011195051,0.0000048637967,0.000011964214,0.000018005792,0.000029202436],"domain_scores_gemma":[0.9997937,0.000039683866,0.00002989303,0.00004653819,0.000061377876,0.000028797127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000091863185,0.00011933156,0.00019131068,0.0003214065,0.00045585592,0.00068552105,0.00066896086,0.00020009454,0.0044944803],"category_scores_gemma":[0.00047610115,0.000121332305,0.00018131641,0.0006451753,0.0001725245,0.00067449064,0.00038318548,0.0002349189,0.00041724675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002125187,0.00040572093,0.015925411,0.00056409865,0.00010830884,0.00072384084,0.0006954819,0.2538822,0.08804455,0.26471165,0.033093672,0.33971995],"study_design_scores_gemma":[0.00014150456,0.00045656716,0.009011862,0.000048272774,0.000092873735,0.00038956886,0.0007628577,0.8571497,0.028141452,0.079667486,0.024094256,0.00004360666],"about_ca_topic_score_codex":0.0020442477,"about_ca_topic_score_gemma":0.006554471,"teacher_disagreement_score":0.0044944803,"about_ca_system_score_codex":0.00051840575,"about_ca_system_score_gemma":0.0005871377,"threshold_uncertainty_score":0.01503557},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010858811,0.0010435643,0.954813,0.00034061543,0.0003926536,0.00015339437,0.00060029066,0.016137118,0.015660474],"genre_scores_gemma":[0.14486627,0.000923267,0.8279464,0.0005106122,0.0003293778,0.0005338511,0.0022945981,0.004315594,0.018280024],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989492,0.000195748,0.00009562275,0.0001580215,0.00045599663,0.00014547477],"domain_scores_gemma":[0.99796754,0.00075111905,0.00011142838,0.0008759007,0.00025496582,0.000039021223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065896177,0.0011773042,0.0009687218,0.0011563804,0.0008512338,0.0014256748,0.0019778681,0.00095707556,0.018853644],"category_scores_gemma":[0.0032109334,0.0008990664,0.00091086765,0.0023629395,0.0014689876,0.003177467,0.0018709743,0.00232242,0.0045505394],"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.00039277988,0.0001384968,0.00044008775,0.0005105818,0.00003778619,0.00017731503,0.0002533267,0.01576008,0.018372206,0.29239252,0.046849716,0.62467515],"study_design_scores_gemma":[0.00017610792,0.00028463037,0.00054635014,0.00025070738,0.00012468226,0.00033853564,0.00012541785,0.18849988,0.07349985,0.5900374,0.1460328,0.00008356143],"about_ca_topic_score_codex":0.0008799931,"about_ca_topic_score_gemma":0.0013747867,"teacher_disagreement_score":0.018853644,"about_ca_system_score_codex":0.0007266018,"about_ca_system_score_gemma":0.0012558707,"threshold_uncertainty_score":0.06307167},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2988292,0.0028598194,0.6660501,0.0005692074,0.00025531513,0.00027601974,0.0004994175,0.009861404,0.020799464],"genre_scores_gemma":[0.6972825,0.0003384529,0.2952691,0.00011434562,0.000047974958,0.00015736234,0.00043094342,0.00014029467,0.0062191766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997434,0.000039035975,0.00003212739,0.000027137909,0.000112276226,0.000046020188],"domain_scores_gemma":[0.9993586,0.00012523877,0.00006338741,0.00023696436,0.00018469346,0.000031215837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003117955,0.00022916691,0.00026859343,0.00065046304,0.000535,0.00063300144,0.0010614672,0.00036499643,0.004048629],"category_scores_gemma":[0.0009023233,0.00021527246,0.00014404282,0.0007215697,0.00019725892,0.001568486,0.00093002716,0.00046390557,0.0008204444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013910615,0.0003124563,0.0025496716,0.000554347,0.00007699752,0.00052059843,0.0005120969,0.07646619,0.22599259,0.08198015,0.025223942,0.58441997],"study_design_scores_gemma":[0.0003626394,0.0010798314,0.0023963894,0.000107859785,0.00006799433,0.0008751378,0.0002878736,0.69888157,0.20613752,0.02103773,0.068660215,0.000105245825],"about_ca_topic_score_codex":0.0006281419,"about_ca_topic_score_gemma":0.0026611253,"teacher_disagreement_score":0.004048629,"about_ca_system_score_codex":0.00052918686,"about_ca_system_score_gemma":0.00067021605,"threshold_uncertainty_score":0.013543963},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08404931,0.0012674605,0.88309735,0.00087174523,0.00027271023,0.00012327197,0.00010325752,0.009697483,0.020517373],"genre_scores_gemma":[0.7686847,0.00095691753,0.21158734,0.00029522835,0.00024637723,0.0002569074,0.00021447719,0.003479224,0.014278843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972402,0.00060802046,0.00015088894,0.00029440553,0.0013885128,0.00031800487],"domain_scores_gemma":[0.99164563,0.0037272805,0.00048043267,0.0032782978,0.00073931005,0.00012903962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018668283,0.0006522531,0.00073880656,0.00060243043,0.0009832062,0.0020131087,0.0023958394,0.0010925438,0.0026634182],"category_scores_gemma":[0.010354715,0.0008624783,0.000875295,0.0006305781,0.0036708133,0.002972352,0.0029426378,0.0027068546,0.0009869392],"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.00043807493,0.000076929544,0.001654833,0.0005873585,0.000051019273,0.00061782624,0.001318143,0.105283804,0.04392858,0.6576545,0.008821163,0.17956765],"study_design_scores_gemma":[0.000106989944,0.00018965849,0.0005910146,0.00015195928,0.00006625719,0.0006621263,0.0001121077,0.3198689,0.15053366,0.48979557,0.037845958,0.00007582571],"about_ca_topic_score_codex":0.000943009,"about_ca_topic_score_gemma":0.000513332,"teacher_disagreement_score":0.0026634182,"about_ca_system_score_codex":0.0009937785,"about_ca_system_score_gemma":0.0019122325,"threshold_uncertainty_score":0.009872854},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00784796,0.0018962184,0.9224214,0.002665112,0.0027866361,0.00013972193,0.0003049303,0.0076826443,0.054255344],"genre_scores_gemma":[0.11768053,0.0026306321,0.7323617,0.0022360776,0.0010532317,0.00015780586,0.0007774732,0.0057914075,0.13731125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907327,0.00009629603,0.000069812086,0.00020559519,0.00045987742,0.000095229894],"domain_scores_gemma":[0.9982718,0.00020592731,0.00008111039,0.0010863866,0.00028361139,0.00007113482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010462238,0.0015559759,0.0012807869,0.0009247115,0.0011877278,0.002403692,0.002092417,0.00202211,0.03210112],"category_scores_gemma":[0.0039295517,0.00084391626,0.0011843471,0.0008483038,0.0020292182,0.0069172224,0.0031595163,0.0054969825,0.022047322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025369457,0.00006653342,0.0002606606,0.0003109914,0.000058657166,0.00021521785,0.00022019033,0.003994108,0.021189008,0.19138125,0.046685807,0.7353639],"study_design_scores_gemma":[0.000102953956,0.00020933658,0.00062393665,0.00023818575,0.0000884837,0.0018573479,0.00031996059,0.038335357,0.049114604,0.4433335,0.46557927,0.00019707669],"about_ca_topic_score_codex":0.00052537624,"about_ca_topic_score_gemma":0.00076920865,"teacher_disagreement_score":0.03210112,"about_ca_system_score_codex":0.00049434096,"about_ca_system_score_gemma":0.0005315322,"threshold_uncertainty_score":0.10738897},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0141416,0.04357027,0.62658167,0.029806295,0.05246701,0.00052205595,0.0018451213,0.004498436,0.22656763],"genre_scores_gemma":[0.1598039,0.04270046,0.3570105,0.004084411,0.017408414,0.00095706293,0.014392711,0.004115366,0.39952716],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975272,0.00080152706,0.00020357837,0.00034898458,0.00090093404,0.00021785978],"domain_scores_gemma":[0.9960069,0.0011361483,0.0000891263,0.00094430195,0.0014225163,0.00040098056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043158866,0.0015803131,0.0019020467,0.0015083108,0.0015695094,0.0062019825,0.0025038098,0.0022369588,0.04778497],"category_scores_gemma":[0.007816777,0.0007180575,0.0013990966,0.0016311475,0.0017088677,0.004310429,0.003505345,0.004033589,0.019057147],"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.0007618175,0.00027834336,0.0010063023,0.0007354388,0.00018430543,0.0005565664,0.0007251038,0.01226383,0.005918085,0.09847055,0.52290946,0.35619023],"study_design_scores_gemma":[0.0000819069,0.00011406632,0.0008220721,0.0004373501,0.00009966182,0.00049582234,0.00023007489,0.039818462,0.005120625,0.06417354,0.88853514,0.0000712361],"about_ca_topic_score_codex":0.0027487448,"about_ca_topic_score_gemma":0.0041245697,"teacher_disagreement_score":0.04778497,"about_ca_system_score_codex":0.0017509534,"about_ca_system_score_gemma":0.0031884778,"threshold_uncertainty_score":0.15985662},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021223843,0.00096423674,0.77494425,0.0004033447,0.00036966777,0.0006970667,0.0008378899,0.18249722,0.018062541],"genre_scores_gemma":[0.20464224,0.0014875948,0.7257866,0.000595295,0.00027344815,0.0010956855,0.009022142,0.03221358,0.02488334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985863,0.00016067002,0.00011780412,0.00025853823,0.0007010192,0.00017569745],"domain_scores_gemma":[0.99881905,0.00016288305,0.00010341517,0.0005038657,0.00022940704,0.00018127507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017993434,0.0008131391,0.0005958658,0.0008899817,0.00061690866,0.0016889193,0.0043293354,0.0011159962,0.004379564],"category_scores_gemma":[0.0043409886,0.001212809,0.00093182904,0.0005725954,0.00074480224,0.0030074383,0.002913728,0.003123105,0.002732353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014481323,0.0006503769,0.0056680185,0.0010564324,0.00025988094,0.0014375605,0.0018367523,0.07089604,0.17413491,0.078427345,0.13654278,0.5276418],"study_design_scores_gemma":[0.0006152418,0.000515447,0.0048079225,0.00022224305,0.00015946406,0.0011003702,0.000107380176,0.25040138,0.043452855,0.021813702,0.676478,0.0003259927],"about_ca_topic_score_codex":0.0022194267,"about_ca_topic_score_gemma":0.0016568067,"teacher_disagreement_score":0.004379564,"about_ca_system_score_codex":0.000538251,"about_ca_system_score_gemma":0.0011546243,"threshold_uncertainty_score":0.01465112},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064536564,0.00030571717,0.9260426,0.00016568362,0.00009656004,0.00019529193,0.000040362997,0.0026076846,0.0060095005],"genre_scores_gemma":[0.5987213,0.000253117,0.3954918,0.00008575467,0.000042716834,0.000300399,0.00015269298,0.0003017101,0.0046504335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993962,0.00015680704,0.000036823167,0.000081236525,0.00022127258,0.00010769309],"domain_scores_gemma":[0.99923265,0.00027421472,0.00008535452,0.00017583615,0.00012581085,0.00010614896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007639527,0.00087354117,0.00060916704,0.00057674665,0.00087520375,0.0009193811,0.0018403726,0.00035164587,0.0026844735],"category_scores_gemma":[0.0020917014,0.0003373406,0.00048137203,0.0007481702,0.000836608,0.000989141,0.0012560814,0.001080712,0.00053514895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009845211,0.00048402787,0.0027015128,0.00029792872,0.00012494002,0.00046941717,0.00046157924,0.6508005,0.05411622,0.09789663,0.006205017,0.1854576],"study_design_scores_gemma":[0.000035781515,0.000058838672,0.00012459117,0.000005510647,0.000011385323,0.00003092515,0.000017136574,0.98234785,0.0067813704,0.008461969,0.0021125386,0.0000122008505],"about_ca_topic_score_codex":0.0047384263,"about_ca_topic_score_gemma":0.006387507,"teacher_disagreement_score":0.0047384263,"about_ca_system_score_codex":0.0009800722,"about_ca_system_score_gemma":0.0012833732,"threshold_uncertainty_score":0.009421706},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0126418695,0.021342924,0.830804,0.0047247056,0.0016917739,0.00006565183,0.00019893449,0.0009704335,0.12755959],"genre_scores_gemma":[0.499353,0.035736274,0.37053752,0.0025778278,0.004258222,0.00061865745,0.00054767897,0.003195505,0.08317535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846184,0.00024022993,0.00007308671,0.00021717376,0.0008720535,0.00013562718],"domain_scores_gemma":[0.9957514,0.003020536,0.00009732674,0.0006575112,0.00038668496,0.00008645017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019162201,0.0013355974,0.0010954373,0.00066823664,0.0008864069,0.003819059,0.0027122537,0.0014570049,0.0083978865],"category_scores_gemma":[0.010745032,0.00085918256,0.00072823046,0.0011367422,0.0023830056,0.0067469035,0.001985267,0.007550803,0.0022785899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101988844,0.000057778492,0.00011818012,0.00042470318,0.000030877352,0.000037779697,0.00017138869,0.073425174,0.0037833764,0.8094464,0.0105177155,0.101884566],"study_design_scores_gemma":[0.000022294911,0.000024221034,0.000117856864,0.00015908122,0.000017180098,0.00007420497,0.00003194232,0.22805867,0.0033316452,0.73960817,0.028535271,0.000019337227],"about_ca_topic_score_codex":0.00078292267,"about_ca_topic_score_gemma":0.0006181396,"teacher_disagreement_score":0.0083978865,"about_ca_system_score_codex":0.0016459894,"about_ca_system_score_gemma":0.001195598,"threshold_uncertainty_score":0.028093696},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080340214,0.0005268621,0.8642616,0.00030437412,0.00035930416,0.0001302103,0.00018496945,0.009579261,0.044313256],"genre_scores_gemma":[0.414549,0.0001786129,0.56076753,0.0001799597,0.00007926171,0.00027361818,0.00038337507,0.0009270523,0.022661647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997824,0.000044570315,0.000014809843,0.00003528123,0.000080528895,0.0000423864],"domain_scores_gemma":[0.99960905,0.000102474165,0.00001662829,0.00008246777,0.0001526897,0.0000367542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022207902,0.00051217416,0.00075387204,0.0004461278,0.0008136833,0.00087898,0.0016384231,0.0005699513,0.011066341],"category_scores_gemma":[0.0009925682,0.00026507408,0.00043197436,0.0008335619,0.00023387567,0.00077436276,0.00094802096,0.0007022069,0.0021118843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011915416,0.00036764573,0.0019627502,0.000466873,0.00013737827,0.00047200933,0.0003339561,0.24052587,0.030291757,0.022187367,0.024485912,0.6775769],"study_design_scores_gemma":[0.00011005192,0.00013850203,0.00043905302,0.000017638677,0.000030227387,0.000079395286,0.000050560073,0.9796179,0.006409179,0.00459251,0.008496849,0.000018158402],"about_ca_topic_score_codex":0.005121114,"about_ca_topic_score_gemma":0.008025481,"teacher_disagreement_score":0.011066341,"about_ca_system_score_codex":0.00042374237,"about_ca_system_score_gemma":0.00071407703,"threshold_uncertainty_score":0.037020624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028180271,0.0009958763,0.9614675,0.00024775072,0.00019459255,0.00008837084,0.00010765767,0.004637692,0.0040802993],"genre_scores_gemma":[0.4271857,0.00036887295,0.56661487,0.00021380381,0.00012343389,0.00014016441,0.00029533062,0.0009941289,0.004063661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998906,0.00032404883,0.0000808647,0.00017798423,0.00029495812,0.0002160818],"domain_scores_gemma":[0.99601763,0.0021829654,0.00017191921,0.0010187806,0.00044688623,0.0001618229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019643276,0.0008666451,0.0012313941,0.0009117354,0.000888631,0.0012013962,0.0025328526,0.001034209,0.007061846],"category_scores_gemma":[0.007092502,0.00080517086,0.00092672074,0.0012681313,0.00095684436,0.0022861266,0.0020505043,0.0023330462,0.001054455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013672569,0.0002784984,0.0018168746,0.00032545393,0.00015224506,0.00011146276,0.00030191048,0.33839205,0.012188871,0.07911903,0.017009834,0.54893655],"study_design_scores_gemma":[0.00006365575,0.0000546741,0.0001218669,0.000017386754,0.000027796701,0.000021181795,0.00002634265,0.9507194,0.0028139022,0.044410586,0.0017072976,0.000015959287],"about_ca_topic_score_codex":0.0036468494,"about_ca_topic_score_gemma":0.0074920324,"teacher_disagreement_score":0.007061846,"about_ca_system_score_codex":0.0012783617,"about_ca_system_score_gemma":0.002454557,"threshold_uncertainty_score":0.023624182},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010087165,0.0004100259,0.9452775,0.00015114999,0.000120129196,0.00017212915,0.0005207876,0.036293093,0.006967971],"genre_scores_gemma":[0.06562087,0.00020268651,0.9159091,0.00017256431,0.00007052471,0.00027458393,0.0011477744,0.0047063893,0.011895604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994622,0.0000803553,0.000041210118,0.00013907369,0.00019848639,0.000078635625],"domain_scores_gemma":[0.9992176,0.0003244227,0.00003912999,0.00020662665,0.00016292428,0.000049124537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006936398,0.0015561366,0.0012500559,0.0010005921,0.0009224719,0.0013169396,0.0025187226,0.00094645866,0.02560993],"category_scores_gemma":[0.0017950585,0.00095778296,0.0010545232,0.0013920624,0.00044568846,0.002175314,0.0014440006,0.0015189456,0.0071803173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012664573,0.00026726618,0.0005098858,0.00042398638,0.00012405892,0.00016114069,0.00021438688,0.04908172,0.044499177,0.02344683,0.052837487,0.82716763],"study_design_scores_gemma":[0.00059718266,0.00021191103,0.0005627046,0.000063024694,0.0001126196,0.00021109612,0.00008428008,0.8499079,0.05240746,0.05444412,0.04131204,0.000085567226],"about_ca_topic_score_codex":0.003477616,"about_ca_topic_score_gemma":0.007724284,"teacher_disagreement_score":0.02560993,"about_ca_system_score_codex":0.0009931428,"about_ca_system_score_gemma":0.0015291548,"threshold_uncertainty_score":0.08567381},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019445572,0.00022236635,0.93338174,0.00009568347,0.0001893801,0.00008582287,0.00013521677,0.040316693,0.006127568],"genre_scores_gemma":[0.19414933,0.00040179424,0.7706832,0.00016589843,0.00009203483,0.0002252207,0.0012545657,0.0159312,0.017096734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995977,0.000042818498,0.000038590693,0.00009940002,0.00015699217,0.00006448583],"domain_scores_gemma":[0.99904984,0.00028165476,0.0000627416,0.00033104132,0.00022775409,0.000046986846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039371985,0.00069506984,0.00069395057,0.000550614,0.0006145507,0.0008476541,0.0012763949,0.00051812315,0.005829464],"category_scores_gemma":[0.0017188633,0.00082646,0.00069815223,0.0006965874,0.00046160852,0.0011506276,0.0010323235,0.001557783,0.0031482845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003707115,0.00031124704,0.0018448202,0.00046181725,0.00008459285,0.00047129983,0.0005949788,0.049954347,0.10417506,0.02292418,0.030330537,0.78847647],"study_design_scores_gemma":[0.00023755261,0.00023338932,0.002606225,0.00020578278,0.00018135949,0.00063384225,0.00013133735,0.5774132,0.27247137,0.052596394,0.09317207,0.00011735575],"about_ca_topic_score_codex":0.0018148671,"about_ca_topic_score_gemma":0.002328375,"teacher_disagreement_score":0.005829464,"about_ca_system_score_codex":0.00044792882,"about_ca_system_score_gemma":0.00086452963,"threshold_uncertainty_score":0.019501448},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1570106,0.00471182,0.79489416,0.0014873615,0.00037713055,0.00011998135,0.00024324635,0.011446856,0.029708879],"genre_scores_gemma":[0.61514217,0.0016158837,0.3707816,0.00047351565,0.00033369457,0.00008574874,0.0003849936,0.001588357,0.009594067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743783,0.00074437197,0.0001555954,0.00036424922,0.0009101147,0.00038772996],"domain_scores_gemma":[0.9871023,0.006799252,0.0009598912,0.0036415905,0.0011807607,0.00031621687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019943747,0.0011112378,0.0009525143,0.0024173246,0.00083875307,0.0012140186,0.0023815008,0.0008594962,0.008083698],"category_scores_gemma":[0.0122743035,0.0007876997,0.0009687528,0.0021592202,0.0012270316,0.00421744,0.0032757714,0.0022292484,0.001680893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069227384,0.000436733,0.0035507074,0.00058773474,0.00009535856,0.00021072976,0.0006773184,0.07969416,0.050611384,0.045444418,0.010515364,0.80748373],"study_design_scores_gemma":[0.00019245481,0.0007895223,0.0037789214,0.00037888577,0.00038628734,0.00081353093,0.0006880119,0.6943866,0.12285755,0.13337924,0.042199787,0.0001492616],"about_ca_topic_score_codex":0.0010065099,"about_ca_topic_score_gemma":0.002283621,"teacher_disagreement_score":0.008083698,"about_ca_system_score_codex":0.0005693986,"about_ca_system_score_gemma":0.0018516354,"threshold_uncertainty_score":0.027042687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42491573,0.00082671683,0.52290994,0.00038890002,0.00035268907,0.000082620405,0.0006562701,0.018254668,0.03161244],"genre_scores_gemma":[0.8679585,0.00014942011,0.12406979,0.00010617079,0.00003918699,0.00006744167,0.00045944823,0.0010352216,0.0061147725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970144,0.00006803594,0.000012767906,0.000026727366,0.00013356484,0.000057367623],"domain_scores_gemma":[0.9993426,0.00026052122,0.00004336404,0.00014354948,0.0001820383,0.000027910966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036031945,0.00071275875,0.000480406,0.00046657288,0.00039080068,0.00066391524,0.001531469,0.00043662984,0.0063610924],"category_scores_gemma":[0.0011792425,0.00033995666,0.0003578533,0.00051402044,0.00031255532,0.0008552269,0.000506132,0.00067135366,0.00055106287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007565035,0.00015238153,0.0024592662,0.00028028508,0.00011444097,0.0003200971,0.0003243202,0.79602164,0.03197245,0.02303367,0.013120715,0.13144422],"study_design_scores_gemma":[0.00002215309,0.000050317336,0.00030747475,0.000008344394,0.000012843217,0.000025219597,0.000020040465,0.98247206,0.012428459,0.0024453155,0.002199146,0.000008568744],"about_ca_topic_score_codex":0.0037946862,"about_ca_topic_score_gemma":0.0068662814,"teacher_disagreement_score":0.0063610924,"about_ca_system_score_codex":0.0006860515,"about_ca_system_score_gemma":0.00086908956,"threshold_uncertainty_score":0.02127999},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07088958,0.00031813525,0.9147978,0.00012225105,0.000057553778,0.00010566848,0.00033496067,0.009189979,0.004184063],"genre_scores_gemma":[0.55708104,0.0001911294,0.4357315,0.0000935302,0.00003571164,0.0003067433,0.00069550733,0.0010783472,0.0047865426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997098,0.00009113743,0.000023406807,0.000047765643,0.00009681564,0.000031199987],"domain_scores_gemma":[0.99917346,0.00041791817,0.00008376006,0.00017000189,0.00013567868,0.000019162093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037458344,0.0004747056,0.00035422525,0.00040124208,0.0003055228,0.0004080093,0.00075562735,0.00047947522,0.0032722172],"category_scores_gemma":[0.0018973235,0.00032935172,0.00031201998,0.00040511027,0.00027875716,0.0007407167,0.00029916078,0.0004873895,0.0005902655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078727136,0.00014689723,0.0025223815,0.00044862716,0.00006888791,0.0008650246,0.00021479148,0.35239047,0.19811434,0.058231965,0.01146565,0.37474364],"study_design_scores_gemma":[0.00017374195,0.0003180293,0.00047435693,0.000039244776,0.000036410096,0.0006744769,0.000022948565,0.87046605,0.09008491,0.015183446,0.022477109,0.00004933743],"about_ca_topic_score_codex":0.00041516553,"about_ca_topic_score_gemma":0.0009592893,"teacher_disagreement_score":0.0032722172,"about_ca_system_score_codex":0.0003955752,"about_ca_system_score_gemma":0.00042320302,"threshold_uncertainty_score":0.010946631},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5099665,0.00055283285,0.4627304,0.00036442978,0.000079119935,0.00019232921,0.0001133196,0.008389934,0.017611166],"genre_scores_gemma":[0.8260118,0.00016585943,0.17049545,0.00006915263,0.00001776093,0.00008959655,0.00014917194,0.00027041291,0.0027307833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998254,0.000032991087,0.000008574772,0.000024350447,0.00008068288,0.000027994365],"domain_scores_gemma":[0.99972326,0.00008466959,0.000021805545,0.0000707588,0.000078355275,0.00002124694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021029795,0.0003357252,0.00023009721,0.0003025641,0.00033560855,0.0004889579,0.0006137596,0.00020596007,0.001304303],"category_scores_gemma":[0.00083831756,0.00015106036,0.00027551517,0.0002649591,0.00026026013,0.0005178546,0.00039976035,0.00048074496,0.00024216356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005922449,0.00024880958,0.0039419937,0.00026571206,0.00006951711,0.00059652317,0.00035866868,0.39216727,0.30332136,0.025258098,0.005726939,0.26745287],"study_design_scores_gemma":[0.00005418044,0.00014142557,0.0013549142,0.000009685406,0.000020379919,0.00009127072,0.00003234515,0.9109326,0.0775974,0.0033484753,0.006403528,0.000013840058],"about_ca_topic_score_codex":0.0024034167,"about_ca_topic_score_gemma":0.0034066106,"teacher_disagreement_score":0.0024034167,"about_ca_system_score_codex":0.000547377,"about_ca_system_score_gemma":0.0006776333,"threshold_uncertainty_score":0.0047789216},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45503557,0.0016140786,0.51267344,0.00092566875,0.00060524914,0.00011721474,0.00026044017,0.0068675806,0.021900864],"genre_scores_gemma":[0.9475469,0.00024805975,0.042847805,0.00013075408,0.000057033936,0.000028640254,0.000118504904,0.00026909407,0.008753259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994702,0.00006703741,0.000024160201,0.00009117164,0.00019384471,0.00015365252],"domain_scores_gemma":[0.9992685,0.00019746699,0.00005183572,0.00022823404,0.00019546894,0.00005858456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044871747,0.00089826284,0.00092485995,0.00034678282,0.0010248569,0.001366537,0.002247474,0.0004267679,0.0029313485],"category_scores_gemma":[0.0011391416,0.00044052774,0.0004947103,0.0006431739,0.00056257285,0.0012106708,0.0009604435,0.0011001738,0.0003403299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0063919784,0.00070454803,0.008767306,0.00044100758,0.00026533077,0.0013594675,0.000597925,0.5097457,0.08032713,0.09161465,0.022884596,0.27690035],"study_design_scores_gemma":[0.0000820121,0.00017274493,0.0006749596,0.000011426364,0.00008255544,0.00022490342,0.000114635346,0.9543987,0.020905374,0.020906366,0.0023973493,0.000028921673],"about_ca_topic_score_codex":0.006229269,"about_ca_topic_score_gemma":0.010068358,"teacher_disagreement_score":0.006229269,"about_ca_system_score_codex":0.0011268433,"about_ca_system_score_gemma":0.0018093919,"threshold_uncertainty_score":0.012386024},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026533275,0.015535455,0.38043055,0.0027029621,0.0049689626,0.00027318925,0.0023646583,0.013346373,0.5777246],"genre_scores_gemma":[0.06449626,0.014593226,0.23863469,0.0011095495,0.002400534,0.00069153507,0.00603331,0.0039043555,0.6681366],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99907196,0.000098970144,0.0000451776,0.00018322596,0.0005410891,0.000059601796],"domain_scores_gemma":[0.9992749,0.00008890599,0.000018079856,0.00038522074,0.00019972472,0.00003305916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061479997,0.0013969777,0.0019255475,0.0012980087,0.001006953,0.0032856164,0.0017379327,0.0010989911,0.08102149],"category_scores_gemma":[0.0020074598,0.00082695746,0.0006990763,0.0021510392,0.0009449116,0.0023071987,0.0020382253,0.0019070866,0.06730362],"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.00006392929,0.000054760116,0.00018586726,0.0003768483,0.00004778385,0.0000624821,0.000060950475,0.008484458,0.002584255,0.20499682,0.30787265,0.47520918],"study_design_scores_gemma":[0.000028558487,0.000040088988,0.0002543102,0.00012564045,0.00003758355,0.00020209685,0.00002622767,0.038739618,0.0048278454,0.16891918,0.78677356,0.000025356107],"about_ca_topic_score_codex":0.0011338936,"about_ca_topic_score_gemma":0.0014332619,"teacher_disagreement_score":0.08102149,"about_ca_system_score_codex":0.0008044377,"about_ca_system_score_gemma":0.0012072858,"threshold_uncertainty_score":0.2710439},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010600285,0.0011010838,0.9599183,0.0019974185,0.00016771519,0.00008619163,0.000044432094,0.0009743412,0.02511026],"genre_scores_gemma":[0.29359624,0.0037919213,0.6865609,0.000724532,0.00030652527,0.0004819515,0.00016513429,0.0007844712,0.013588315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99820673,0.00074734096,0.00007838511,0.00022712912,0.0006438369,0.00009647244],"domain_scores_gemma":[0.9979286,0.0010604749,0.000049702197,0.0005739125,0.0003047473,0.00008253195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002805722,0.000926057,0.0006329498,0.00060645357,0.001068664,0.002977285,0.002217607,0.001142831,0.0043692617],"category_scores_gemma":[0.0054979054,0.00081000396,0.00067725976,0.001296539,0.0033197936,0.0062452205,0.0016133353,0.00348905,0.0015199742],"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.00018335381,0.00007486431,0.0005026609,0.0002545885,0.000031273987,0.00015071689,0.0007912063,0.092334464,0.004152933,0.8154766,0.010090761,0.075956635],"study_design_scores_gemma":[0.00008752182,0.00016276767,0.00013985518,0.000078910736,0.000028460929,0.00024389739,0.00013251115,0.36312184,0.007668317,0.53234386,0.09594988,0.0000422249],"about_ca_topic_score_codex":0.001620606,"about_ca_topic_score_gemma":0.0010119346,"teacher_disagreement_score":0.0043692617,"about_ca_system_score_codex":0.0017779616,"about_ca_system_score_gemma":0.0015172224,"threshold_uncertainty_score":0.014838278},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044244304,0.0003383082,0.94106126,0.0003909964,0.00004909418,0.000103126324,0.000022415945,0.0012600771,0.012530387],"genre_scores_gemma":[0.65473616,0.0004270058,0.33574542,0.00017998056,0.00003897293,0.0002450425,0.00007340007,0.0003649015,0.008189107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993488,0.00021980795,0.000048136477,0.000053031996,0.00022032886,0.00010994932],"domain_scores_gemma":[0.99885213,0.00045784516,0.00006630212,0.0002965394,0.0002785714,0.000048575996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084937393,0.0005469632,0.00040547928,0.0005525861,0.0006371263,0.0015181719,0.001388469,0.00071859383,0.0046382165],"category_scores_gemma":[0.0036469537,0.00043741468,0.00035930084,0.00055605575,0.0006156402,0.001669255,0.0009790643,0.000903761,0.00082432583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027467593,0.00022563261,0.0013607388,0.00032374612,0.000079456884,0.0002898576,0.0008908944,0.13555287,0.027120622,0.4356126,0.0060810638,0.3921878],"study_design_scores_gemma":[0.00008338521,0.0001461661,0.00027882284,0.000046951354,0.00007705306,0.00015900018,0.00016373416,0.81485546,0.016550686,0.15354107,0.01406701,0.00003065962],"about_ca_topic_score_codex":0.0012847792,"about_ca_topic_score_gemma":0.0023559772,"teacher_disagreement_score":0.0046382165,"about_ca_system_score_codex":0.0004854001,"about_ca_system_score_gemma":0.00097305555,"threshold_uncertainty_score":0.0155164},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07256023,0.008058657,0.540146,0.002896486,0.003071457,0.0003420374,0.00062064815,0.0041368315,0.3681676],"genre_scores_gemma":[0.7735705,0.0039343876,0.0971767,0.000696743,0.0010573462,0.0003805483,0.0010847141,0.00056447624,0.12153462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991341,0.00016138534,0.00005523928,0.00016855056,0.0003325901,0.00014813464],"domain_scores_gemma":[0.9986929,0.00023202969,0.0000955624,0.00047981754,0.0003541835,0.00014540569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006969098,0.0005735316,0.0005295655,0.0005825387,0.0015081944,0.0026487038,0.0019091935,0.00065702596,0.026245441],"category_scores_gemma":[0.0021970063,0.00023028748,0.00037853018,0.0009953429,0.0007565305,0.0030171562,0.0031225143,0.00085819134,0.004562996],"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.00038198655,0.00013065079,0.0009900553,0.00029555068,0.000056934015,0.00034534186,0.0006543439,0.036375344,0.013825839,0.6407171,0.038140036,0.26808685],"study_design_scores_gemma":[0.00014305967,0.00028072993,0.00084662257,0.000185098,0.00007549347,0.00068505603,0.00040249788,0.1415324,0.019991687,0.2751077,0.56065416,0.00009552083],"about_ca_topic_score_codex":0.0014844842,"about_ca_topic_score_gemma":0.0008288279,"teacher_disagreement_score":0.026245441,"about_ca_system_score_codex":0.0012788824,"about_ca_system_score_gemma":0.0012272181,"threshold_uncertainty_score":0.08779979},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14615744,0.0020881158,0.8414395,0.0002088802,0.00019564255,0.00004759181,0.00014441676,0.0037592703,0.0059590614],"genre_scores_gemma":[0.8825778,0.00056327594,0.114460886,0.000056526456,0.00006654286,0.000031894775,0.00016331003,0.0003480759,0.0017317142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974746,0.000062569685,0.000011778188,0.00005180896,0.00008347204,0.00004291551],"domain_scores_gemma":[0.9995115,0.00020000665,0.000063156745,0.00011433843,0.00008274308,0.000028317161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003264853,0.00060974556,0.0005543034,0.00041719785,0.00039253128,0.00055238075,0.0006809014,0.00026377293,0.00067553663],"category_scores_gemma":[0.0013668421,0.0004819395,0.00030137337,0.0008247764,0.00020417356,0.00082512276,0.00048430724,0.0005427434,0.0002451789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009916719,0.0001715815,0.003908788,0.0002280666,0.00010580563,0.00012968523,0.00019170274,0.3856627,0.26065508,0.0052313437,0.005110601,0.337613],"study_design_scores_gemma":[0.000012707041,0.00010804766,0.0019654462,0.0000115415805,0.000035993755,0.000104187246,0.000036064263,0.93447477,0.05525751,0.00505913,0.0029024985,0.000032097087],"about_ca_topic_score_codex":0.0013435506,"about_ca_topic_score_gemma":0.0032254737,"teacher_disagreement_score":0.0013435506,"about_ca_system_score_codex":0.00031707744,"about_ca_system_score_gemma":0.00043488477,"threshold_uncertainty_score":0.0026714802},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69640636,0.00081444584,0.29324538,0.0005665651,0.000047157253,0.00016947891,0.00009949743,0.0043722442,0.0042787995],"genre_scores_gemma":[0.8046801,0.00016762064,0.1924763,0.00011911398,0.000024130224,0.00009105384,0.0002457209,0.00052732683,0.0016686472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968477,0.0009471528,0.00022184005,0.00053242093,0.00096814096,0.00048272824],"domain_scores_gemma":[0.9859536,0.0075442996,0.0017501886,0.003396298,0.001158928,0.00019669981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029860525,0.00064345653,0.0009028143,0.0010484757,0.0009808261,0.0012046689,0.0017028099,0.0012171153,0.0015542413],"category_scores_gemma":[0.011866683,0.00082258345,0.00075399346,0.0013557579,0.0011708334,0.003044523,0.0017656292,0.0009280068,0.00052176556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001814406,0.00048450395,0.07138383,0.0006441053,0.000107937674,0.0013276123,0.0015595965,0.09575836,0.18040374,0.04822025,0.0057211835,0.5925744],"study_design_scores_gemma":[0.00020848193,0.0008168752,0.012980917,0.000097200376,0.00018434504,0.0014197256,0.00081432005,0.6375233,0.2693594,0.059640035,0.01681607,0.00013932437],"about_ca_topic_score_codex":0.0010792809,"about_ca_topic_score_gemma":0.0016210759,"teacher_disagreement_score":0.0029860525,"about_ca_system_score_codex":0.00062183157,"about_ca_system_score_gemma":0.0017260737,"threshold_uncertainty_score":0.015791953},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014106629,0.00017048499,0.9419541,0.00015646654,0.00012932488,0.000053689135,0.00021480612,0.034902472,0.008312009],"genre_scores_gemma":[0.21783124,0.00019485185,0.7501758,0.00028455714,0.00008451521,0.00018636229,0.0006804982,0.012961967,0.017600274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994217,0.00007880135,0.000057379966,0.00008401843,0.00027820945,0.00007981384],"domain_scores_gemma":[0.9986939,0.00047627292,0.000088751476,0.00039619184,0.00030598138,0.000038972838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046243693,0.0009927691,0.0005402265,0.00067300326,0.00067463046,0.0011574108,0.0018063423,0.0005936439,0.017316412],"category_scores_gemma":[0.0025990608,0.0009486877,0.000843019,0.0010146145,0.0007041862,0.0020297281,0.0013771141,0.0015160735,0.004389368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008533683,0.00018516708,0.0022155123,0.00060648646,0.00010520783,0.00048508483,0.0007713015,0.05960046,0.10503898,0.10198611,0.04641321,0.68173903],"study_design_scores_gemma":[0.00025609595,0.0003082268,0.0013381459,0.00014680682,0.00013846075,0.0006304648,0.000127277,0.5915247,0.23215492,0.07825594,0.09498469,0.00013425144],"about_ca_topic_score_codex":0.0021172764,"about_ca_topic_score_gemma":0.005515046,"teacher_disagreement_score":0.017316412,"about_ca_system_score_codex":0.00085563323,"about_ca_system_score_gemma":0.0015113306,"threshold_uncertainty_score":0.05792916},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9061267,0.019941755,0.026113965,0.0032066924,0.0008502977,0.000023362447,0.00020057334,0.0010576047,0.04247903],"genre_scores_gemma":[0.9875344,0.0011197065,0.004162407,0.00016683363,0.00014872833,0.000009922917,0.00010069597,0.00012535234,0.006631914],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994234,0.00013328799,0.00002041472,0.000060397306,0.0002042624,0.00015843143],"domain_scores_gemma":[0.9957202,0.0026421952,0.00019956198,0.00040212792,0.00083355344,0.00020244071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006266339,0.0003357508,0.00048666855,0.0004576458,0.000956058,0.0013368852,0.0009358101,0.00082369335,0.008236004],"category_scores_gemma":[0.0052014496,0.00035581648,0.00017211965,0.0015126826,0.00048442226,0.0021892334,0.0006969616,0.0009714452,0.0009386306],"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.00574986,0.0007900002,0.02242007,0.001646885,0.00025348447,0.0013129793,0.0010048157,0.25049207,0.19276811,0.15212561,0.049240317,0.3221958],"study_design_scores_gemma":[0.00025512135,0.0015231945,0.024229024,0.00015896697,0.00038264212,0.00110908,0.00097009377,0.7105072,0.11639529,0.11983053,0.024512114,0.00012675123],"about_ca_topic_score_codex":0.0016646303,"about_ca_topic_score_gemma":0.0034145245,"teacher_disagreement_score":0.008236004,"about_ca_system_score_codex":0.0008165731,"about_ca_system_score_gemma":0.0006277714,"threshold_uncertainty_score":0.027552128},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035438593,0.0005473198,0.9501195,0.00063969137,0.00016568541,0.000424695,0.00036904123,0.0025416787,0.009753836],"genre_scores_gemma":[0.1463612,0.00026995485,0.8438617,0.00027332146,0.00016627708,0.0006165406,0.0011398977,0.00050558493,0.006805638],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992293,0.00021967334,0.00003723122,0.00015855103,0.0002441803,0.00011099978],"domain_scores_gemma":[0.99659204,0.0019330579,0.00020876009,0.0006234166,0.00041461666,0.00022819002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012076768,0.0016504436,0.00139833,0.0023445417,0.0014898124,0.0014469429,0.0035690304,0.0017234269,0.014039429],"category_scores_gemma":[0.0055776024,0.0011428267,0.0010985788,0.002839384,0.0012159784,0.0032085765,0.0030264752,0.0018447452,0.0017966802],"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.00074832304,0.0004305825,0.0012004317,0.0005739562,0.00013427855,0.00020274661,0.00022015632,0.30507562,0.008806925,0.061438743,0.024432713,0.5967356],"study_design_scores_gemma":[0.00029789386,0.0001713549,0.00042385233,0.00004010426,0.00007107,0.00012725299,0.000070810805,0.92728573,0.002892141,0.06303388,0.005560133,0.00002576932],"about_ca_topic_score_codex":0.0032774266,"about_ca_topic_score_gemma":0.0066782883,"teacher_disagreement_score":0.014039429,"about_ca_system_score_codex":0.0012146553,"about_ca_system_score_gemma":0.0022634852,"threshold_uncertainty_score":0.046966553},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081686206,0.003033318,0.8728125,0.0020782081,0.00070646073,0.00044974074,0.00046358097,0.018351516,0.02041847],"genre_scores_gemma":[0.22308087,0.002734149,0.7448083,0.0004948641,0.00029468845,0.00040411518,0.0021214709,0.008358649,0.017702758],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99628925,0.0010282014,0.00028435033,0.00028042684,0.0016059674,0.0005117762],"domain_scores_gemma":[0.99284667,0.0025759186,0.0003971935,0.0022124476,0.0017066658,0.0002610449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052684085,0.00091057864,0.00093367224,0.0008862258,0.0008624385,0.00412912,0.0021583913,0.0009413119,0.0047972677],"category_scores_gemma":[0.009464679,0.0012806851,0.0010568987,0.0014823928,0.0012344674,0.0033227627,0.0016940621,0.0027727147,0.0019525031],"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.00097129395,0.0012768392,0.005745308,0.0011899396,0.00015532183,0.00018243947,0.00084722287,0.051204305,0.043284096,0.11962527,0.049676377,0.72584164],"study_design_scores_gemma":[0.00066774024,0.00078024325,0.008756231,0.00044928017,0.00046486926,0.0005909913,0.00050360267,0.39361176,0.25338075,0.11318418,0.22738738,0.00022302098],"about_ca_topic_score_codex":0.0045240936,"about_ca_topic_score_gemma":0.0048725684,"teacher_disagreement_score":0.0052684085,"about_ca_system_score_codex":0.0014361625,"about_ca_system_score_gemma":0.0043628127,"threshold_uncertainty_score":0.02786237},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004630622,0.0003616049,0.98225594,0.00021120507,0.00015353324,0.0000353309,0.00012379665,0.0010743364,0.011153602],"genre_scores_gemma":[0.30213967,0.0013199825,0.6341618,0.0004509134,0.00045683375,0.00028179467,0.0009520847,0.0017755142,0.058461465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868745,0.00027648764,0.000060113063,0.00026914332,0.00049918034,0.00020760726],"domain_scores_gemma":[0.99852294,0.0007214254,0.0000669452,0.00044462687,0.0001906642,0.00005340947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016884907,0.0010668692,0.0010152071,0.0013006099,0.00095804944,0.0017852249,0.0029463994,0.0006831666,0.010026446],"category_scores_gemma":[0.0033674622,0.00083770556,0.0016875748,0.0017459024,0.002027553,0.0046527423,0.003290154,0.0047070766,0.003054388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013245949,0.000036508405,0.00031081846,0.00012969117,0.000035991827,0.00007502306,0.00013787461,0.010403387,0.0039203563,0.89226025,0.0060455557,0.086512126],"study_design_scores_gemma":[0.000020354983,0.000022393042,0.0001570891,0.000032400632,0.000043991968,0.00005937604,0.000023575401,0.041964803,0.007854317,0.9310828,0.018720351,0.000018555193],"about_ca_topic_score_codex":0.00077163766,"about_ca_topic_score_gemma":0.00095475675,"teacher_disagreement_score":0.010026446,"about_ca_system_score_codex":0.0015362609,"about_ca_system_score_gemma":0.0011346693,"threshold_uncertainty_score":0.03354186},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07914987,0.0068348777,0.8826944,0.00039574815,0.00040807118,0.000049864713,0.0001612598,0.003098439,0.027207373],"genre_scores_gemma":[0.7937653,0.0034002508,0.17287771,0.00024830285,0.00015307083,0.000056836518,0.00028824297,0.00042087393,0.028789345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999522,0.0000056286176,0.0000018712319,0.000008402755,0.000019432171,0.00001242067],"domain_scores_gemma":[0.9999372,0.000021007845,0.0000075658036,0.000012325872,0.000016906572,0.000005016999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007526155,0.00036964793,0.00022513047,0.00018986237,0.00014841699,0.0002714407,0.00077188876,0.00020299276,0.0035482142],"category_scores_gemma":[0.00017494756,0.00021386553,0.0001491098,0.00036136364,0.00013380426,0.0004629629,0.0003105945,0.0004209035,0.00043772208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033860136,0.0001490546,0.0005613464,0.0004423974,0.000049661157,0.00015287759,0.00009365991,0.106699765,0.3040566,0.034658294,0.016504996,0.5362928],"study_design_scores_gemma":[0.00006776064,0.00052428944,0.0014790824,0.00007874703,0.00008754422,0.00040958924,0.00004211163,0.74558616,0.14885508,0.04805203,0.05479004,0.000027581082],"about_ca_topic_score_codex":0.00030156883,"about_ca_topic_score_gemma":0.0012856654,"teacher_disagreement_score":0.0035482142,"about_ca_system_score_codex":0.00016620161,"about_ca_system_score_gemma":0.00027739498,"threshold_uncertainty_score":0.011869907},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52010965,0.00073649164,0.4695503,0.00057398085,0.00020624652,0.00012640982,0.00019973186,0.003078225,0.0054189814],"genre_scores_gemma":[0.9069949,0.0001603894,0.08880572,0.000082392435,0.00007141033,0.00008452604,0.00024205676,0.00029668814,0.0032619627],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990208,0.00025488413,0.00006424733,0.00013094048,0.0003788654,0.00015031555],"domain_scores_gemma":[0.9940904,0.0020044926,0.00045523813,0.0023884892,0.00085421815,0.00020707912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013666748,0.00035945655,0.0007390227,0.0009453182,0.0010476705,0.0010903546,0.0016786883,0.0004581205,0.0028233686],"category_scores_gemma":[0.008299644,0.00064704166,0.00027129994,0.002269204,0.0008772735,0.003950468,0.0016839547,0.00090795534,0.0005212302],"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.0047063706,0.0006753356,0.013388969,0.00034490597,0.00017049791,0.00036844407,0.0013441889,0.1845027,0.089965895,0.06801559,0.012423408,0.6240937],"study_design_scores_gemma":[0.00020469702,0.00062055845,0.0021860497,0.000024632904,0.00012221992,0.00023670343,0.00041224627,0.8570461,0.06682162,0.066331916,0.0059387297,0.00005452175],"about_ca_topic_score_codex":0.0015543337,"about_ca_topic_score_gemma":0.0042638467,"teacher_disagreement_score":0.0028233686,"about_ca_system_score_codex":0.0004465337,"about_ca_system_score_gemma":0.0011546039,"threshold_uncertainty_score":0.009445131},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34258986,0.001102139,0.39575902,0.0016144693,0.0008710177,0.0011598787,0.015549005,0.015826885,0.22552772],"genre_scores_gemma":[0.6878985,0.0008345079,0.2681212,0.00043232285,0.000087673136,0.0020995007,0.0069183074,0.0014192322,0.03218872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998745,0.000023013145,0.0000055632886,0.000023885674,0.000047116897,0.000025926443],"domain_scores_gemma":[0.999762,0.0000770978,0.00002169142,0.000049347203,0.000056310393,0.000033601103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028475103,0.00045196828,0.0007224191,0.00033272195,0.00052612566,0.0006818027,0.0014943563,0.0008169034,0.013912286],"category_scores_gemma":[0.00089864165,0.0003286137,0.000575348,0.00041287937,0.00029004776,0.00054221414,0.00051290845,0.0010996682,0.002104312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027081382,0.00010415543,0.0021514904,0.00020658622,0.00010865916,0.00017633926,0.00008291665,0.9206021,0.009915472,0.032811124,0.009331376,0.024238983],"study_design_scores_gemma":[0.000125418,0.000051544,0.0005586704,0.000008851334,0.000019710022,0.00004511889,0.000017322207,0.9719183,0.0032441593,0.0028730666,0.02111872,0.000019039897],"about_ca_topic_score_codex":0.0056272415,"about_ca_topic_score_gemma":0.004494907,"teacher_disagreement_score":0.013912286,"about_ca_system_score_codex":0.000782411,"about_ca_system_score_gemma":0.0014044377,"threshold_uncertainty_score":0.046541274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016794018,0.00013043011,0.8355493,0.0001252945,0.00004533916,0.000117947,0.0010337747,0.15931846,0.0020000837],"genre_scores_gemma":[0.07943188,0.0003765858,0.8716011,0.00043886597,0.000085135835,0.00078356755,0.0066603688,0.03689727,0.003725243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976025,0.0004658361,0.00027785162,0.00048217442,0.00091106136,0.00026062172],"domain_scores_gemma":[0.99552476,0.0019951512,0.00040688872,0.000927493,0.00095737976,0.00018826575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027219118,0.0024525588,0.0010493391,0.0019977677,0.0007005606,0.0025881208,0.003926889,0.0012366852,0.014910902],"category_scores_gemma":[0.01269279,0.001554931,0.0024656514,0.0009776442,0.0013576484,0.0034383181,0.002850518,0.0035807176,0.008557101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012936034,0.0003947059,0.0077438764,0.0014701784,0.0002791138,0.0008462548,0.0013754221,0.17312948,0.030760417,0.09807848,0.13642147,0.5482069],"study_design_scores_gemma":[0.00017450572,0.00018765237,0.0011849364,0.00028693228,0.000059490692,0.00044400102,0.00014525538,0.8042724,0.037464745,0.06097039,0.09462488,0.00018475826],"about_ca_topic_score_codex":0.006184907,"about_ca_topic_score_gemma":0.00851542,"teacher_disagreement_score":0.014910902,"about_ca_system_score_codex":0.0014983403,"about_ca_system_score_gemma":0.0028299463,"threshold_uncertainty_score":0.049881935},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06745136,0.00042127608,0.8852275,0.00022682661,0.00017801092,0.00024893862,0.001751989,0.0300435,0.014450666],"genre_scores_gemma":[0.6182203,0.0006012967,0.36474538,0.00016748873,0.000046201498,0.0006782155,0.0030532945,0.0023933244,0.010094546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981624,0.00004009485,0.000011868642,0.000023059081,0.0000880649,0.000020669886],"domain_scores_gemma":[0.99966764,0.00012489446,0.000037727754,0.00008259555,0.00006164648,0.000025461888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030334367,0.00046453686,0.00041251545,0.0005448132,0.0002210837,0.0005120229,0.0014838425,0.00044654007,0.0029938607],"category_scores_gemma":[0.0010982545,0.00037127128,0.00036204883,0.0005113844,0.00034262138,0.00062171335,0.00060993363,0.00080036453,0.00050333055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042180897,0.00018007406,0.0030515918,0.00028240366,0.00010714388,0.00024785014,0.0001246043,0.8275824,0.04348958,0.03503213,0.009274352,0.08020614],"study_design_scores_gemma":[0.000036252757,0.00006604627,0.00016892259,0.000006816006,0.000012839848,0.00004434264,0.000007171583,0.97998476,0.009112917,0.0032494764,0.0072985766,0.000011818136],"about_ca_topic_score_codex":0.0018851857,"about_ca_topic_score_gemma":0.0021791188,"teacher_disagreement_score":0.0029938607,"about_ca_system_score_codex":0.00041399297,"about_ca_system_score_gemma":0.0011882966,"threshold_uncertainty_score":0.010015428},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81721854,0.0006254595,0.15894416,0.00043262856,0.00018271328,0.0008626861,0.00051886274,0.007833663,0.013381212],"genre_scores_gemma":[0.89081734,0.00013058698,0.104675874,0.00008532806,0.000014014381,0.00016790438,0.00024897105,0.00010343618,0.003756598],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996588,0.00009272739,0.000023818362,0.00005590106,0.000107075604,0.000061574145],"domain_scores_gemma":[0.9992091,0.00023734706,0.000064455846,0.00013967705,0.00028935523,0.000060076243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043780118,0.00033145587,0.00033912668,0.00024187972,0.0002119688,0.00048242186,0.0023187425,0.0005528769,0.0046750014],"category_scores_gemma":[0.0010838928,0.00019734696,0.00019313564,0.0002720218,0.00025764556,0.0007753134,0.00026745145,0.00039632915,0.0005258843],"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.0024045953,0.0012043454,0.0033479508,0.001109714,0.00018359703,0.0010143191,0.000455992,0.020895714,0.78334004,0.007851686,0.006878878,0.17131327],"study_design_scores_gemma":[0.0009287793,0.011735838,0.005469471,0.000067585075,0.00018309524,0.0010755133,0.00019184119,0.17638607,0.78029287,0.00086476555,0.022742035,0.00006208175],"about_ca_topic_score_codex":0.00091810705,"about_ca_topic_score_gemma":0.0008714354,"teacher_disagreement_score":0.0046750014,"about_ca_system_score_codex":0.0004921066,"about_ca_system_score_gemma":0.00047956407,"threshold_uncertainty_score":0.015639424},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9932352,0.000120208606,0.0052111293,0.000043309778,0.0000062238305,0.000029874014,0.00007044561,0.00017547187,0.0011081742],"genre_scores_gemma":[0.99563605,0.00004939884,0.003964753,0.000008855929,0.0000037308812,0.000015816486,0.000053705196,0.000022880828,0.00024483452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995147,0.00021010719,0.000029331048,0.00006403081,0.00011791634,0.000063859334],"domain_scores_gemma":[0.9974015,0.0016914742,0.00019907062,0.0003178216,0.00028925433,0.000100911406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008069694,0.00045256407,0.00033810962,0.00039859134,0.00039445885,0.0005310468,0.0004888803,0.0005032619,0.0013077783],"category_scores_gemma":[0.004063594,0.00020471429,0.00023609596,0.00067591085,0.00040638185,0.0010056673,0.0004386636,0.00048441437,0.00017894451],"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.0014450554,0.0005310649,0.022904608,0.00026259653,0.00015425922,0.00037159192,0.00028165407,0.85067785,0.08544056,0.0032929652,0.00064268545,0.03399516],"study_design_scores_gemma":[0.000054016615,0.0011642757,0.010504587,0.0000073487563,0.000043066128,0.000068184745,0.00010447105,0.9533378,0.033558287,0.0006833822,0.00044923573,0.0000253643],"about_ca_topic_score_codex":0.0024346297,"about_ca_topic_score_gemma":0.0016023071,"teacher_disagreement_score":0.0024346297,"about_ca_system_score_codex":0.0005248094,"about_ca_system_score_gemma":0.00037035145,"threshold_uncertainty_score":0.004840851},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08833064,0.00076439494,0.84589887,0.000744796,0.00054421887,0.00046885302,0.00020520798,0.024558032,0.03848496],"genre_scores_gemma":[0.5533649,0.00077288854,0.3910131,0.00040898027,0.00033852956,0.00035242218,0.0012771136,0.0010990661,0.05137299],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991246,0.00008919237,0.00007109558,0.00013287646,0.000456155,0.00012611915],"domain_scores_gemma":[0.99890876,0.00012619802,0.0000753731,0.00042505286,0.0002607759,0.00020378821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001037476,0.0004757405,0.00036954702,0.00037808457,0.0006705304,0.0015195155,0.0017431031,0.0007318639,0.0027965659],"category_scores_gemma":[0.0014514764,0.00046839972,0.00036997919,0.00052605144,0.00062629324,0.0021358908,0.0019152856,0.0015937528,0.002595069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011193944,0.0013205222,0.007863904,0.00032315144,0.0001478048,0.0014863046,0.00086587336,0.039636824,0.30917484,0.11526456,0.051263217,0.4715336],"study_design_scores_gemma":[0.00020445493,0.000712648,0.004163585,0.000053888147,0.00012331415,0.001795608,0.00013874542,0.48498118,0.11754195,0.021422867,0.36864644,0.0002153235],"about_ca_topic_score_codex":0.001884476,"about_ca_topic_score_gemma":0.0016487318,"teacher_disagreement_score":0.0027965659,"about_ca_system_score_codex":0.00048278458,"about_ca_system_score_gemma":0.0012763118,"threshold_uncertainty_score":0.009355426},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002720391,0.00034658296,0.8796195,0.00093163573,0.00094567443,0.0003298887,0.0056955563,0.0791145,0.030296378],"genre_scores_gemma":[0.04708588,0.0008697758,0.84859633,0.0011416611,0.00049892557,0.00070917635,0.010281494,0.040674545,0.05014226],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99786264,0.00056680694,0.00022584149,0.00030854682,0.0008873103,0.00014885416],"domain_scores_gemma":[0.9908895,0.0045107096,0.00032387857,0.0018952403,0.0020050243,0.000375681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002741381,0.0017782307,0.0010806951,0.002253915,0.0009338639,0.0046230624,0.0031462424,0.0012512607,0.0633877],"category_scores_gemma":[0.017828546,0.0008603721,0.00110702,0.0017453665,0.00093260803,0.0034233576,0.0035189278,0.003207038,0.016551422],"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.0008117917,0.00014509595,0.0007033704,0.0015009156,0.00007476924,0.0016212184,0.0028285084,0.008005555,0.045747116,0.07542517,0.48278898,0.38034755],"study_design_scores_gemma":[0.00012232625,0.0000630411,0.00038160136,0.00020829681,0.00002955923,0.00093488826,0.00019989267,0.020199412,0.025793752,0.032763463,0.91921145,0.00009228987],"about_ca_topic_score_codex":0.0011677786,"about_ca_topic_score_gemma":0.0012613799,"teacher_disagreement_score":0.0633877,"about_ca_system_score_codex":0.00073843525,"about_ca_system_score_gemma":0.0011190153,"threshold_uncertainty_score":0.21205294},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3297767,0.0009788019,0.65678227,0.000711548,0.00015275608,0.0005315992,0.0018727592,0.0054048975,0.0037886521],"genre_scores_gemma":[0.61611617,0.00028496864,0.37755424,0.00017138313,0.00006761531,0.0004468462,0.004077054,0.00028343216,0.0009983422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900764,0.00034561113,0.0000716679,0.0002576677,0.0002126609,0.00010467641],"domain_scores_gemma":[0.9918452,0.0057931244,0.00039288675,0.00085115654,0.0009904853,0.000127177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022932452,0.0010424068,0.0010535151,0.0016380738,0.0006174607,0.0008937253,0.0014099074,0.0009255048,0.0016899745],"category_scores_gemma":[0.011791848,0.0007732589,0.0007707106,0.0013832143,0.0008075171,0.00144391,0.0005857925,0.0018259066,0.00052792305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048246633,0.0003314237,0.003395214,0.00018966245,0.00004559506,0.000071953014,0.00009961593,0.81390595,0.0028371972,0.004228831,0.005424223,0.16898786],"study_design_scores_gemma":[0.000053278298,0.00006907228,0.00025730956,0.00000914318,0.000010347014,0.000009837418,0.000014209909,0.99241537,0.0018200648,0.004777704,0.00055744173,0.000006278846],"about_ca_topic_score_codex":0.004413982,"about_ca_topic_score_gemma":0.007614181,"teacher_disagreement_score":0.004413982,"about_ca_system_score_codex":0.0018358844,"about_ca_system_score_gemma":0.0031980614,"threshold_uncertainty_score":0.013320327},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93991345,0.00036673178,0.05307474,0.00011641919,0.000024360705,0.000083613886,0.00005664876,0.0027452474,0.0036188692],"genre_scores_gemma":[0.95466274,0.00010838034,0.04247709,0.00004447713,0.000007726238,0.00007669685,0.00015690312,0.00020767224,0.0022583043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874926,0.00038765022,0.00008990151,0.00019895768,0.00033609173,0.00023813525],"domain_scores_gemma":[0.9979956,0.0008258891,0.00028380644,0.00043797246,0.00030498987,0.00015160337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014903941,0.000765834,0.00046077542,0.0002982586,0.0006040801,0.000891294,0.0015449874,0.00038351363,0.0014644935],"category_scores_gemma":[0.0028499002,0.000428718,0.00020624955,0.0007241612,0.0007519026,0.0016136196,0.0013152588,0.0006490407,0.00036055155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035028565,0.0013936079,0.015222268,0.0005761657,0.00014133066,0.0006221628,0.001478713,0.6029517,0.15208834,0.016115434,0.0069307075,0.19897671],"study_design_scores_gemma":[0.00049967814,0.0011756527,0.0031882958,0.000021052067,0.000044792763,0.0001314964,0.00041021852,0.8718496,0.1136036,0.0046815197,0.0043567806,0.00003723685],"about_ca_topic_score_codex":0.0029218283,"about_ca_topic_score_gemma":0.004687276,"teacher_disagreement_score":0.0029218283,"about_ca_system_score_codex":0.0011158463,"about_ca_system_score_gemma":0.0015274566,"threshold_uncertainty_score":0.008096039},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07022701,0.014087133,0.8698229,0.0014342464,0.00179527,0.00023271049,0.0003625876,0.004014664,0.038023345],"genre_scores_gemma":[0.5671265,0.0037756504,0.39545697,0.0012126297,0.00057160144,0.00042167748,0.00079118425,0.00014663623,0.030497165],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998416,0.00002129705,0.000011232982,0.000037177375,0.00006438498,0.000024304256],"domain_scores_gemma":[0.9998006,0.000023888351,0.000018148636,0.000044092292,0.00008842481,0.000024810552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014237293,0.00028134414,0.00037619687,0.00033827455,0.00053539715,0.00096917374,0.001596058,0.00086603675,0.0037658787],"category_scores_gemma":[0.00033142173,0.00014129948,0.00028739855,0.0006875212,0.00021461336,0.0015759517,0.00067656045,0.0005382005,0.0009735336],"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.00052895123,0.00031515284,0.0019505591,0.0011375573,0.00022629037,0.0014681255,0.00017652276,0.027578369,0.22736251,0.16059355,0.04259659,0.5360658],"study_design_scores_gemma":[0.00031084515,0.0010601417,0.0010104325,0.00015395365,0.00029739394,0.005106049,0.00012088523,0.50621367,0.1327183,0.029134016,0.32375434,0.000119939476],"about_ca_topic_score_codex":0.00034342878,"about_ca_topic_score_gemma":0.00077077816,"teacher_disagreement_score":0.0037658787,"about_ca_system_score_codex":0.00032702106,"about_ca_system_score_gemma":0.0005413701,"threshold_uncertainty_score":0.012598157},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026683355,0.00050916406,0.9103286,0.00034080894,0.00015462039,0.0001182599,0.0006328177,0.0020262557,0.05920613],"genre_scores_gemma":[0.42620838,0.0013856201,0.50221264,0.00038896568,0.00024824473,0.00021280213,0.003886841,0.0026079377,0.062848546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995378,0.000051252122,0.00001877757,0.00008375601,0.00020258027,0.000105818865],"domain_scores_gemma":[0.9991003,0.00023687918,0.000058417718,0.00023549864,0.0003078261,0.00006107738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041183847,0.00072744983,0.00066426245,0.002038014,0.0008047815,0.0020683361,0.0013233557,0.00066405226,0.015155974],"category_scores_gemma":[0.0023944199,0.0004379663,0.0009918418,0.0027488389,0.00072893803,0.0027520368,0.001275741,0.001852026,0.0042427834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010728407,0.00012776507,0.0017494597,0.00013908822,0.000032044398,0.00014495918,0.00018418502,0.025751302,0.0071846386,0.69120926,0.022234602,0.2511354],"study_design_scores_gemma":[0.00001808977,0.000040133065,0.0010989468,0.00006186822,0.000052554467,0.00027192463,0.00015583883,0.29473296,0.008972991,0.6641456,0.030419994,0.000029053048],"about_ca_topic_score_codex":0.0028758121,"about_ca_topic_score_gemma":0.0039120372,"teacher_disagreement_score":0.015155974,"about_ca_system_score_codex":0.0010131423,"about_ca_system_score_gemma":0.0010636309,"threshold_uncertainty_score":0.050701797},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096111156,0.040731672,0.6688386,0.0033749745,0.0051881173,0.00016734912,0.00032776245,0.004986752,0.18027355],"genre_scores_gemma":[0.5644502,0.014754966,0.29037794,0.00057360716,0.0016226857,0.00019091877,0.0009786173,0.00047190656,0.12657915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978167,0.00005466894,0.000011553615,0.000038625814,0.000076344244,0.00003704201],"domain_scores_gemma":[0.9996779,0.00007540776,0.000019423302,0.00011318028,0.00007534731,0.000038749014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003362906,0.0004693403,0.0003823779,0.00032156776,0.000586882,0.0016417197,0.0014387723,0.0006485735,0.0061252564],"category_scores_gemma":[0.0008376421,0.00039356246,0.00035739917,0.0010393353,0.00055684417,0.0028648817,0.0013948007,0.0008808475,0.0013096055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003315259,0.000099152065,0.0012966,0.00066297245,0.00012828954,0.00036276618,0.0002952741,0.08092132,0.018277593,0.3695162,0.08684361,0.44126466],"study_design_scores_gemma":[0.00006297162,0.00032598866,0.0013794978,0.0001455944,0.00011720448,0.0010683691,0.0001951011,0.21550499,0.01327456,0.3017472,0.46611705,0.00006137168],"about_ca_topic_score_codex":0.00057673076,"about_ca_topic_score_gemma":0.0013413095,"teacher_disagreement_score":0.0061252564,"about_ca_system_score_codex":0.00045097328,"about_ca_system_score_gemma":0.00051885634,"threshold_uncertainty_score":0.020491004},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065368876,0.0007235485,0.90225667,0.0001482088,0.00016811772,0.00017212158,0.00007821227,0.014450429,0.016633837],"genre_scores_gemma":[0.5050918,0.00024773582,0.48361838,0.00017745871,0.000075370706,0.00034659248,0.0001592887,0.001655018,0.008628299],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930894,0.00019281387,0.000050481252,0.00013992502,0.00021902789,0.000088676315],"domain_scores_gemma":[0.99865156,0.00033509813,0.00011819703,0.0005734764,0.00020509645,0.00011657415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008421667,0.0007064608,0.0003938982,0.0003810826,0.00046931056,0.0011902698,0.0013892495,0.00049065857,0.0038132402],"category_scores_gemma":[0.0030475091,0.00057336356,0.00039090653,0.00034697878,0.00064357364,0.0015239633,0.001708452,0.0011067205,0.0009794324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025381474,0.00038667684,0.01155066,0.0007470994,0.00018157763,0.00092418736,0.0015609486,0.053994764,0.10283544,0.24172613,0.01698131,0.56657314],"study_design_scores_gemma":[0.00026032623,0.0005124898,0.0013427752,0.00014477181,0.00013559828,0.0006893102,0.000106883934,0.75056094,0.08371431,0.085413344,0.07701541,0.00010384285],"about_ca_topic_score_codex":0.0005718768,"about_ca_topic_score_gemma":0.0011448975,"teacher_disagreement_score":0.0038132402,"about_ca_system_score_codex":0.0002590251,"about_ca_system_score_gemma":0.000783029,"threshold_uncertainty_score":0.0127565265},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98722005,0.00091400446,0.0061959103,0.00012702026,0.000035015655,0.00005368143,0.00070223596,0.001336916,0.0034151606],"genre_scores_gemma":[0.99057406,0.00033909996,0.0059851045,0.000047797435,0.000025538293,0.000062959305,0.0016377838,0.00031150132,0.0010161669],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9966085,0.00059531006,0.00020723377,0.00052507024,0.001559069,0.00050488795],"domain_scores_gemma":[0.9793985,0.012929069,0.0019721708,0.0030074248,0.0022615232,0.00043131126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013878404,0.0010356692,0.00045552882,0.001336935,0.00040592536,0.0007024853,0.00085297535,0.00049279426,0.0016333199],"category_scores_gemma":[0.011689175,0.000371988,0.0005655292,0.0019404349,0.000802485,0.0016685305,0.0004566407,0.00083430763,0.000546385],"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.0034014864,0.0011046402,0.04309066,0.0013870926,0.0003235928,0.00042651608,0.00041990317,0.12178054,0.5954444,0.002400532,0.005045269,0.22517538],"study_design_scores_gemma":[0.00017365569,0.00807084,0.1971301,0.00008728675,0.00034902187,0.0008807566,0.00046403185,0.20257539,0.5796819,0.0019203939,0.008494925,0.00017162795],"about_ca_topic_score_codex":0.001528579,"about_ca_topic_score_gemma":0.0019718336,"teacher_disagreement_score":0.0016333199,"about_ca_system_score_codex":0.00061040116,"about_ca_system_score_gemma":0.000658192,"threshold_uncertainty_score":0.0073396564},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024826579,0.00072588807,0.95165795,0.0007991591,0.00013517556,0.00008255296,0.00032723893,0.0017759997,0.019669393],"genre_scores_gemma":[0.649278,0.0011117909,0.32296085,0.0004331833,0.00027804938,0.0005912622,0.00068648765,0.0011140733,0.023546316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957985,0.00008707039,0.00002013836,0.000058962152,0.00017761867,0.00007627403],"domain_scores_gemma":[0.9990239,0.00036157423,0.000075164,0.00029495635,0.00018042258,0.00006399558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005176656,0.0006718052,0.00081746175,0.00058621285,0.00071608904,0.0017226967,0.0027516806,0.0013038141,0.009839296],"category_scores_gemma":[0.0031143911,0.0005237036,0.0007522861,0.00097449956,0.0009645319,0.003386787,0.001466818,0.0019390566,0.0014768534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011487809,0.00007781963,0.0002314459,0.000122054524,0.000024363693,0.00009177529,0.000080460595,0.6077715,0.003941432,0.35447702,0.006425666,0.02664165],"study_design_scores_gemma":[0.000009648912,0.000008653056,0.000023734747,0.000004473829,0.000004728136,0.0000097920965,0.000005500228,0.92562765,0.00039654758,0.07281214,0.0010931189,0.0000039626852],"about_ca_topic_score_codex":0.0030955458,"about_ca_topic_score_gemma":0.0035087848,"teacher_disagreement_score":0.009839296,"about_ca_system_score_codex":0.0010809111,"about_ca_system_score_gemma":0.0012528265,"threshold_uncertainty_score":0.03291571},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01584734,0.0012707292,0.9666836,0.00042678887,0.00006535757,0.00024084061,0.000033854165,0.0012967007,0.014134687],"genre_scores_gemma":[0.14997692,0.0013764735,0.838036,0.00014873415,0.00007107842,0.00049630273,0.00013186895,0.0004235034,0.009339128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866223,0.0005053765,0.000108025604,0.00012198717,0.00046523244,0.00013719912],"domain_scores_gemma":[0.9987961,0.00051355246,0.00009257892,0.000279967,0.00024870833,0.00006895994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002170429,0.0010538569,0.0007209153,0.0011754995,0.0012082953,0.0026458572,0.0015704796,0.00086852786,0.0048203547],"category_scores_gemma":[0.004513999,0.00069643307,0.0005272379,0.0012581947,0.0012933243,0.0027470957,0.001518626,0.0010081562,0.001969986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021213786,0.00015788882,0.00060385506,0.00025505314,0.000067709,0.00025403203,0.00062900607,0.17227669,0.008772961,0.6423424,0.0059464253,0.16848186],"study_design_scores_gemma":[0.00016306379,0.000084526866,0.00014794999,0.000057378777,0.00005729998,0.00013445216,0.00013783053,0.5850284,0.0055767708,0.375384,0.033201728,0.000026489823],"about_ca_topic_score_codex":0.0013393282,"about_ca_topic_score_gemma":0.0021956249,"teacher_disagreement_score":0.0048203547,"about_ca_system_score_codex":0.0013684378,"about_ca_system_score_gemma":0.0014037357,"threshold_uncertainty_score":0.016125679},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050348775,0.0017597179,0.96077764,0.0006240547,0.0006383611,0.00010192058,0.0007463624,0.013057267,0.017259657],"genre_scores_gemma":[0.26663724,0.0030467517,0.66647726,0.0012758422,0.0013153094,0.0007054627,0.0038792791,0.014114644,0.042548284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973968,0.0005388611,0.00018030644,0.00043685292,0.0010590781,0.00038820595],"domain_scores_gemma":[0.99673176,0.0015157241,0.00013872392,0.0010394728,0.0004857244,0.000088520195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018940865,0.0020636506,0.0016534667,0.0022448665,0.0014248644,0.002697156,0.0038399692,0.0010733886,0.020171512],"category_scores_gemma":[0.007037966,0.0014781675,0.0025091816,0.0025216138,0.002175998,0.007933136,0.0033484735,0.0044057984,0.005382538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004741756,0.00013895675,0.0009367178,0.00111911,0.00014065186,0.00022980053,0.00034991238,0.04723059,0.0114950705,0.48420888,0.06108313,0.39259306],"study_design_scores_gemma":[0.00006471139,0.00006363667,0.00037702348,0.0002393613,0.000112719594,0.00018756856,0.00006444319,0.20246223,0.015836388,0.72502995,0.055481672,0.00008033542],"about_ca_topic_score_codex":0.0017711881,"about_ca_topic_score_gemma":0.0020858163,"teacher_disagreement_score":0.020171512,"about_ca_system_score_codex":0.0016098592,"about_ca_system_score_gemma":0.0019513413,"threshold_uncertainty_score":0.067480445},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24915898,0.0010179128,0.72692275,0.003040512,0.0008176227,0.00013050696,0.00035700967,0.0032164091,0.015338242],"genre_scores_gemma":[0.83009756,0.000526776,0.16106671,0.0006192172,0.00025275783,0.00016539093,0.0003998994,0.0010242882,0.0058474652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978023,0.00060725666,0.00014998823,0.0003242262,0.0006790897,0.00043707114],"domain_scores_gemma":[0.97719383,0.008403996,0.0019371394,0.0095293615,0.0024171995,0.00051853765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042592497,0.0005391902,0.0011701549,0.0006190098,0.001343009,0.0023736197,0.002815578,0.0018197517,0.00312075],"category_scores_gemma":[0.02642178,0.0014169166,0.0008600115,0.0012798858,0.0026480616,0.007418117,0.001283671,0.0027829052,0.00075322646],"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.0014775378,0.00039913596,0.0070326934,0.0003452128,0.000129204,0.00035918076,0.0008249139,0.083967,0.013669026,0.7591341,0.009870005,0.12279197],"study_design_scores_gemma":[0.00020538054,0.00019317908,0.0010032905,0.000059448637,0.00010202633,0.00010882449,0.0002324775,0.1466935,0.019254334,0.82283443,0.009269997,0.000043203963],"about_ca_topic_score_codex":0.0020121674,"about_ca_topic_score_gemma":0.0031439266,"teacher_disagreement_score":0.0042592497,"about_ca_system_score_codex":0.0007375874,"about_ca_system_score_gemma":0.0032441914,"threshold_uncertainty_score":0.02252531},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14298533,0.004609558,0.8244233,0.00076953555,0.0003693318,0.00023831733,0.00081062946,0.013997428,0.011796603],"genre_scores_gemma":[0.7595179,0.0015614873,0.22396845,0.00047853994,0.00016312336,0.00016788016,0.0012429147,0.00020993708,0.012689749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981326,0.000024998686,0.000013269197,0.00003598644,0.000085728316,0.00002684419],"domain_scores_gemma":[0.99961984,0.00008442821,0.00005275176,0.0000699773,0.00014100473,0.00003200145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030598565,0.000395264,0.00034097943,0.0007202218,0.00038462525,0.00094188785,0.0029254896,0.000486216,0.003840183],"category_scores_gemma":[0.0006305255,0.0002925486,0.00020735711,0.0011880876,0.00028109585,0.0020169434,0.000499056,0.0005374582,0.00071769767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023496686,0.000499918,0.005430113,0.0006856791,0.00017599303,0.00078666967,0.0002261009,0.14987895,0.20315495,0.03878269,0.038380597,0.5596487],"study_design_scores_gemma":[0.00030265542,0.0010004173,0.0011879457,0.000047968995,0.00016870568,0.0005730866,0.00004564126,0.88441974,0.08062726,0.0069737458,0.024565045,0.00008769881],"about_ca_topic_score_codex":0.0027302008,"about_ca_topic_score_gemma":0.005492514,"teacher_disagreement_score":0.003840183,"about_ca_system_score_codex":0.0005377608,"about_ca_system_score_gemma":0.001212048,"threshold_uncertainty_score":0.012846649},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09417465,0.006586427,0.85570186,0.0015611242,0.00083169126,0.00019669364,0.00026140708,0.0024952786,0.038190838],"genre_scores_gemma":[0.7918256,0.0019150504,0.17701387,0.00025799064,0.0005651584,0.00032046324,0.00047901674,0.00070956576,0.026913377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980459,0.00048852974,0.00013687198,0.00035092531,0.00061849505,0.00035936412],"domain_scores_gemma":[0.99554694,0.0018021711,0.0003473572,0.0015123523,0.00060790346,0.0001832385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002488514,0.0006215264,0.0011268815,0.0007481813,0.001822136,0.0030495364,0.0026170027,0.0011184445,0.003766376],"category_scores_gemma":[0.008141888,0.0010242673,0.00051344896,0.0017430625,0.0017429016,0.003862795,0.0017658736,0.0023395435,0.00051585486],"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.0009982147,0.00017248205,0.0018077367,0.0003576386,0.00008365238,0.00032360438,0.00074703095,0.14186203,0.0103092,0.6694866,0.019071814,0.15478002],"study_design_scores_gemma":[0.00019818329,0.00014403148,0.0011329417,0.00005411152,0.00010791256,0.00028208844,0.0002082134,0.3838895,0.014349328,0.57150054,0.028076146,0.000056952867],"about_ca_topic_score_codex":0.004683476,"about_ca_topic_score_gemma":0.004437368,"teacher_disagreement_score":0.004683476,"about_ca_system_score_codex":0.0014132289,"about_ca_system_score_gemma":0.0023343496,"threshold_uncertainty_score":0.013160646},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0496291,0.0026938147,0.9092862,0.0009460829,0.0005366402,0.00009579861,0.00018847924,0.001419621,0.035204325],"genre_scores_gemma":[0.6152905,0.0026201163,0.37044242,0.00020003015,0.00023246165,0.00019192422,0.0001624403,0.00035901606,0.010501102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998165,0.000059199032,0.000010136718,0.000027614591,0.00006856201,0.000018128287],"domain_scores_gemma":[0.99948007,0.00033506058,0.000020115429,0.000064237276,0.000075469885,0.000025093717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038140026,0.0006268029,0.0008772747,0.00033075004,0.00058613176,0.0006773224,0.0011521752,0.00085020263,0.0033509012],"category_scores_gemma":[0.0015779057,0.00048252626,0.00058101467,0.0009099048,0.00057430455,0.0004344756,0.0007506132,0.0011031149,0.00051322096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008941011,0.000055621458,0.0004265349,0.000111913556,0.0000491746,0.00016590668,0.000075601834,0.9170973,0.003912899,0.027128529,0.0024023582,0.04848473],"study_design_scores_gemma":[0.000012594479,0.000011539963,0.000080019694,0.000004509454,0.000005801723,0.000028014352,0.000005348974,0.98279977,0.000964414,0.0143627245,0.0017213692,0.0000039787365],"about_ca_topic_score_codex":0.003810202,"about_ca_topic_score_gemma":0.002241233,"teacher_disagreement_score":0.003810202,"about_ca_system_score_codex":0.00042894503,"about_ca_system_score_gemma":0.00057349773,"threshold_uncertainty_score":0.011209905},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31694707,0.0130474055,0.63063604,0.00096878415,0.00036236504,0.00007814595,0.00026081287,0.0055864295,0.032113012],"genre_scores_gemma":[0.8727877,0.002393837,0.10248422,0.00038999185,0.00014636667,0.00004579938,0.0002615681,0.000735861,0.020754518],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997992,0.000031387426,0.000012672202,0.000032439286,0.000074988755,0.00004934113],"domain_scores_gemma":[0.9996369,0.00014398435,0.000042391144,0.00009446101,0.00006966128,0.000012567457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015526578,0.00073942746,0.00050731876,0.00037788137,0.00028021177,0.00054822234,0.0012118332,0.00030581886,0.0046221633],"category_scores_gemma":[0.0007352382,0.00028079827,0.00031692692,0.0008410593,0.00028035234,0.0013515597,0.00054096564,0.00055952184,0.0008458344],"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.00075442565,0.00024048246,0.0013669003,0.00078419957,0.00012373936,0.0002662817,0.00018143431,0.11997984,0.21142891,0.027178276,0.009030431,0.6286651],"study_design_scores_gemma":[0.00012365945,0.0013533717,0.0028899377,0.00014354903,0.00038507633,0.00092762377,0.0001294648,0.5137178,0.37745935,0.0642922,0.03852622,0.000051827243],"about_ca_topic_score_codex":0.00032920792,"about_ca_topic_score_gemma":0.0008418979,"teacher_disagreement_score":0.0046221633,"about_ca_system_score_codex":0.00034431164,"about_ca_system_score_gemma":0.00045509893,"threshold_uncertainty_score":0.015462697},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048833564,0.03980417,0.107284606,0.010521898,0.026506525,0.000493696,0.007504294,0.008325101,0.7946763],"genre_scores_gemma":[0.0039284094,0.011993696,0.010037449,0.00033198216,0.0006107187,0.000057528214,0.003402277,0.0007389553,0.96889883],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993407,0.000051926305,0.00002249433,0.00010476335,0.000421013,0.00005900755],"domain_scores_gemma":[0.998485,0.00012018875,0.000025360125,0.00010715693,0.0010263082,0.000236034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009938679,0.0017093673,0.0013081876,0.0011359795,0.0019587611,0.0045268023,0.001515173,0.0011436462,0.18080589],"category_scores_gemma":[0.0016553025,0.00065333187,0.00036429495,0.0029958482,0.0007314417,0.0017077251,0.000990515,0.0022568323,0.12672395],"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.000081217724,0.000037349266,0.00023584648,0.00015224809,0.000014488796,0.000076384866,0.000074230295,0.00055250496,0.0009983513,0.0027746914,0.88041294,0.11458982],"study_design_scores_gemma":[0.000014635937,0.000020207824,0.00078049704,0.00007765623,0.000013335605,0.00013705355,0.00006615005,0.0017966178,0.0006852962,0.001537688,0.9948596,0.000011328689],"about_ca_topic_score_codex":0.09292149,"about_ca_topic_score_gemma":0.20110856,"teacher_disagreement_score":0.9070785,"about_ca_system_score_codex":0.002776368,"about_ca_system_score_gemma":0.0063858787,"threshold_uncertainty_score":0.60485595},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098343454,0.002592058,0.8679017,0.0006273851,0.00064524804,0.00018615692,0.0005712144,0.019088272,0.010044554],"genre_scores_gemma":[0.49233767,0.00079665036,0.48760897,0.00027114333,0.00034919073,0.0003833073,0.0015001951,0.0006008972,0.016151937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996537,0.0000530057,0.000033056716,0.00005079049,0.00013051138,0.00007901691],"domain_scores_gemma":[0.9992461,0.000111523055,0.00005840023,0.0003031075,0.00018693473,0.0000939611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004080818,0.00045157035,0.00064271735,0.00086168846,0.0012009667,0.001275664,0.002808486,0.0005975438,0.0048303017],"category_scores_gemma":[0.0009943694,0.00042236032,0.00029201803,0.0013159428,0.0003950297,0.0021404447,0.002065641,0.00072036695,0.0013221425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002198888,0.00044132367,0.0023569574,0.0010843922,0.00013953628,0.0004257603,0.00044595645,0.0615557,0.15490438,0.099703796,0.08184649,0.59489685],"study_design_scores_gemma":[0.00041181347,0.0010097299,0.0013308127,0.00007445073,0.00019920172,0.0005852944,0.00018145653,0.77346486,0.07432544,0.051953793,0.096324995,0.00013815022],"about_ca_topic_score_codex":0.0013108236,"about_ca_topic_score_gemma":0.004031055,"teacher_disagreement_score":0.0048303017,"about_ca_system_score_codex":0.00072461856,"about_ca_system_score_gemma":0.0010742045,"threshold_uncertainty_score":0.016158938},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00876729,0.00025443098,0.953586,0.00013027611,0.00015800372,0.00021423538,0.00029299548,0.030301657,0.0062951823],"genre_scores_gemma":[0.15472497,0.00068519084,0.8175483,0.00042020826,0.00009148747,0.00034831074,0.0021333366,0.0053772014,0.018670892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989779,0.00013833541,0.00011233854,0.00014796719,0.0005115739,0.00011189716],"domain_scores_gemma":[0.99927443,0.00020104052,0.000049742324,0.00023806877,0.00018517929,0.00005144255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018333931,0.00072814344,0.00061431003,0.00059844175,0.0003605225,0.0018413108,0.0029550917,0.00095586944,0.0047990438],"category_scores_gemma":[0.002637272,0.00076950085,0.0009917681,0.00035849767,0.00092496746,0.002415389,0.002060493,0.001918925,0.002675383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011921899,0.00043971482,0.003960826,0.0011530245,0.00020918496,0.0011214343,0.0009957055,0.11480613,0.10376902,0.3851374,0.037254352,0.34996107],"study_design_scores_gemma":[0.00017363629,0.00023352083,0.00063477183,0.0001676971,0.000117263415,0.00063541386,0.000087092914,0.6881975,0.061491348,0.060468152,0.18766727,0.00012629622],"about_ca_topic_score_codex":0.0020875582,"about_ca_topic_score_gemma":0.0020969014,"teacher_disagreement_score":0.0047990438,"about_ca_system_score_codex":0.00048741832,"about_ca_system_score_gemma":0.0014591272,"threshold_uncertainty_score":0.016054392},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59060067,0.0056377435,0.30954114,0.0017902773,0.0007219928,0.00012396112,0.0008010763,0.0017536682,0.0890294],"genre_scores_gemma":[0.94863975,0.0007609608,0.028871732,0.00014685896,0.000074841155,0.000030823554,0.00014289483,0.00011810457,0.021213902],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997129,0.000042376465,0.00001425079,0.000040367166,0.0001385764,0.000051485],"domain_scores_gemma":[0.99968195,0.00012659584,0.000031127907,0.00007125228,0.00006802618,0.000021082513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002332319,0.00033928172,0.000794777,0.0003065676,0.0004989533,0.0011413874,0.0020304632,0.0006032648,0.0055835405],"category_scores_gemma":[0.00053644204,0.00021275708,0.0003489795,0.00066364574,0.0003372766,0.0015247596,0.0005749881,0.0005374318,0.0011968149],"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.0018680331,0.00044771863,0.0026357574,0.00084303465,0.00018001476,0.00088473293,0.00033173407,0.17286628,0.5112584,0.18186258,0.013391571,0.11343015],"study_design_scores_gemma":[0.0001161411,0.0009676703,0.0030974548,0.00010790886,0.00014520047,0.00075205084,0.00012552855,0.79633373,0.14997163,0.02490411,0.023372473,0.00010620641],"about_ca_topic_score_codex":0.00060880923,"about_ca_topic_score_gemma":0.0009857325,"teacher_disagreement_score":0.0055835405,"about_ca_system_score_codex":0.00060116686,"about_ca_system_score_gemma":0.0002513938,"threshold_uncertainty_score":0.018678844},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94368964,0.00036995625,0.04877233,0.00017808634,0.000017408187,0.000037567563,0.00013696519,0.0003198909,0.006478144],"genre_scores_gemma":[0.99160576,0.00005934704,0.0074882987,0.000018765386,0.000004914534,0.000014233566,0.000063294,0.000024948165,0.0007203658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996946,0.000037872538,0.000012595576,0.00006683207,0.00010791002,0.000080244856],"domain_scores_gemma":[0.99880934,0.00057529565,0.00013925562,0.00017063793,0.00026641693,0.00003894977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035519525,0.00050381676,0.00018331203,0.0006444848,0.00026032366,0.00053086714,0.000612766,0.00036299526,0.0025028738],"category_scores_gemma":[0.0025057255,0.00014388729,0.00020888727,0.0008051946,0.00029872014,0.00089549366,0.00023821488,0.000377341,0.000341148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061130535,0.00031076182,0.018572768,0.00023817654,0.00008658503,0.0004339919,0.00016226474,0.5378855,0.3359823,0.009119571,0.0013960097,0.0952008],"study_design_scores_gemma":[0.00001065557,0.00039053158,0.009349025,0.000013322727,0.000034782082,0.00020349977,0.00008465183,0.9062126,0.080405846,0.0020480861,0.0012231687,0.000023811268],"about_ca_topic_score_codex":0.001428073,"about_ca_topic_score_gemma":0.0031120426,"teacher_disagreement_score":0.0025028738,"about_ca_system_score_codex":0.0006072642,"about_ca_system_score_gemma":0.00037703774,"threshold_uncertainty_score":0.008373022},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023483163,0.82874364,0.110012,0.00146273,0.00048419423,0.0001644175,0.00034320762,0.0009893173,0.034317277],"genre_scores_gemma":[0.15429437,0.7397786,0.09101956,0.00094275526,0.0020991336,0.00031687794,0.0010284485,0.00038559173,0.010134709],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980926,0.0003726559,0.00019024481,0.00031883933,0.00084301597,0.00018272386],"domain_scores_gemma":[0.99704164,0.0017218372,0.0002499222,0.00030421838,0.0006043174,0.000078121324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012992969,0.00082828075,0.0015784266,0.0033627765,0.0009612953,0.0029609883,0.0019191863,0.0012976805,0.0035720004],"category_scores_gemma":[0.0038762304,0.0010549854,0.0007377252,0.009383761,0.00080673944,0.0053724786,0.0011740352,0.0011242153,0.0012663553],"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.00018678971,0.00020772005,0.003900782,0.00929512,0.00010971547,0.0002432464,0.00056464376,0.01848036,0.0037714406,0.07386253,0.020140575,0.8692372],"study_design_scores_gemma":[0.000053259573,0.00066830794,0.007040684,0.004245726,0.0002979853,0.00177657,0.0005829369,0.073016405,0.009708609,0.088102944,0.81434995,0.00015669856],"about_ca_topic_score_codex":0.002208266,"about_ca_topic_score_gemma":0.0012754439,"teacher_disagreement_score":0.0035720004,"about_ca_system_score_codex":0.0014328217,"about_ca_system_score_gemma":0.0020312027,"threshold_uncertainty_score":0.01194948},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11462208,0.00026003076,0.8793235,0.00013972944,0.000037239566,0.00011281069,0.000113297916,0.00074721745,0.0046441047],"genre_scores_gemma":[0.5404359,0.00033369206,0.45576066,0.00006103347,0.00003392634,0.00022374661,0.0002717268,0.0004103819,0.0024688765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925786,0.00021114781,0.00004289695,0.00011986747,0.00023773698,0.00013045648],"domain_scores_gemma":[0.9987471,0.0005329404,0.00026151966,0.00022559027,0.00017084776,0.00006194415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010653436,0.00058789505,0.00052737835,0.00065955776,0.00041736988,0.00071438536,0.0008494828,0.00030940495,0.0019431915],"category_scores_gemma":[0.0032629068,0.0003949092,0.00043750645,0.00060891395,0.00045191636,0.0010419601,0.00052393397,0.0005115114,0.00034519954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019061267,0.000075341726,0.00061944313,0.00012444137,0.000021218548,0.00006947494,0.00011686038,0.86646724,0.022000752,0.031129982,0.00094038184,0.078244284],"study_design_scores_gemma":[0.000038560378,0.00016205183,0.00024128665,0.000014060554,0.000017523225,0.000036338377,0.000035357196,0.9665648,0.01369164,0.016767783,0.0024167662,0.000013880188],"about_ca_topic_score_codex":0.001885182,"about_ca_topic_score_gemma":0.002642314,"teacher_disagreement_score":0.0019431915,"about_ca_system_score_codex":0.0007960428,"about_ca_system_score_gemma":0.001628849,"threshold_uncertainty_score":0.0065006614},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46593633,0.0029643187,0.5134576,0.0005220247,0.00010023983,0.00008856365,0.00012416391,0.004165198,0.012641542],"genre_scores_gemma":[0.8076685,0.00035351748,0.18526804,0.000108290704,0.000047706042,0.00006806803,0.00014202815,0.0005729857,0.0057709287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972326,0.000076962286,0.000013807372,0.000035756468,0.000102711405,0.00004746925],"domain_scores_gemma":[0.99905914,0.0005646091,0.00005770112,0.00007434479,0.0002118492,0.00003234228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046881803,0.00052396016,0.00035555215,0.00065122166,0.00034418088,0.00044478232,0.00049682095,0.00033538864,0.0037704543],"category_scores_gemma":[0.0022210535,0.00022008638,0.00023356614,0.00063458073,0.00022849403,0.00068873406,0.00037954736,0.00038964543,0.00034513077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024237463,0.00038151938,0.002208883,0.0002769493,0.00007323743,0.000090181915,0.00017035716,0.31610504,0.15733647,0.007634322,0.004176441,0.50912285],"study_design_scores_gemma":[0.00013200442,0.00046703342,0.0008498103,0.000018442213,0.000057807432,0.000044361823,0.000023011604,0.94725984,0.045059774,0.0041445056,0.0019286178,0.00001483436],"about_ca_topic_score_codex":0.0015519306,"about_ca_topic_score_gemma":0.0049954564,"teacher_disagreement_score":0.0037704543,"about_ca_system_score_codex":0.0003719731,"about_ca_system_score_gemma":0.0007812246,"threshold_uncertainty_score":0.012613356},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25600454,0.0004174354,0.7145727,0.00087021344,0.0002217908,0.00015541796,0.00032443946,0.0010658413,0.026367538],"genre_scores_gemma":[0.9617088,0.00015945923,0.034171395,0.0000752009,0.000026239672,0.00013703549,0.00020312786,0.00016530219,0.0033534372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995658,0.00020244534,0.0000134741895,0.00004222976,0.00007948268,0.00009657818],"domain_scores_gemma":[0.99894994,0.0005591373,0.00009603489,0.00011346539,0.00020186404,0.00007964929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079918903,0.00058716204,0.000826123,0.00043170003,0.0007542885,0.0011968742,0.0018210557,0.0011806424,0.0024829237],"category_scores_gemma":[0.003097203,0.0004868126,0.0007519277,0.00045652475,0.0009148669,0.0014416244,0.000930508,0.0012034596,0.00026357433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001196511,0.0000074243967,0.00016707754,0.0000056988,0.0000067249975,0.000015765354,0.0000142665995,0.9949768,0.000144726,0.0039732223,0.00010617421,0.00057008193],"study_design_scores_gemma":[0.0000036693648,0.00000312522,0.00002680381,8.660886e-7,0.00000171318,0.0000022883116,0.0000040093314,0.9986349,0.00007392756,0.0011322869,0.000114880124,0.000001524779],"about_ca_topic_score_codex":0.014682931,"about_ca_topic_score_gemma":0.008254584,"teacher_disagreement_score":0.014682931,"about_ca_system_score_codex":0.0013212438,"about_ca_system_score_gemma":0.0013254685,"threshold_uncertainty_score":0.029194891},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03721761,0.0009804196,0.9436742,0.00062046887,0.0003282905,0.00011816609,0.00016336977,0.0004236758,0.016473845],"genre_scores_gemma":[0.75292474,0.0008505574,0.23681548,0.00022557503,0.00020866298,0.00012606203,0.00020174687,0.00014350322,0.008503648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939144,0.00017038864,0.000020630094,0.00012840088,0.00015532182,0.0001338151],"domain_scores_gemma":[0.9995419,0.00022169288,0.00005548568,0.000048865084,0.00008636448,0.000045663568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005363137,0.00066561,0.0008495828,0.00052759907,0.00046742335,0.0009815202,0.0009121569,0.0006017321,0.0040153055],"category_scores_gemma":[0.0019058172,0.00035749134,0.0003671413,0.000765359,0.0005600802,0.00096040464,0.0005857808,0.00059239677,0.00036759235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031145135,0.000102441445,0.00032209908,0.00017583549,0.00003557736,0.00008790227,0.000068340225,0.8309994,0.005713205,0.0606885,0.007478858,0.09401636],"study_design_scores_gemma":[0.000043024644,0.000054881362,0.00009744634,0.000009228222,0.000009046952,0.0000307681,0.000017068547,0.9756139,0.0008277104,0.020602237,0.0026876435,0.000007117442],"about_ca_topic_score_codex":0.0031406602,"about_ca_topic_score_gemma":0.0027794456,"teacher_disagreement_score":0.0040153055,"about_ca_system_score_codex":0.0009213225,"about_ca_system_score_gemma":0.0017566744,"threshold_uncertainty_score":0.013432503},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0098626055,0.0005707135,0.97628456,0.00018099473,0.00011101475,0.0002240298,0.000079533274,0.008073943,0.004612637],"genre_scores_gemma":[0.18013862,0.00064729823,0.8054978,0.00026986288,0.00007245563,0.0005241536,0.0003989246,0.0017492468,0.010701716],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992859,0.00015108302,0.00006614141,0.00012168469,0.0002692668,0.00010600802],"domain_scores_gemma":[0.99940836,0.00012650943,0.000052068423,0.00016113678,0.00017022958,0.000081719896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010081116,0.0004197141,0.00052061304,0.0005006457,0.00048655117,0.002137061,0.0033350568,0.00088540453,0.005444217],"category_scores_gemma":[0.001750077,0.0008591482,0.00043970416,0.00055760815,0.00058857346,0.0017690506,0.0010481398,0.0013132516,0.0023624764],"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.0011669172,0.0005671696,0.00556605,0.0010554194,0.0001896719,0.000704339,0.0008838646,0.05842306,0.08277709,0.1434495,0.030322134,0.6748948],"study_design_scores_gemma":[0.00049437274,0.0006783366,0.0022454201,0.00022109391,0.00014744909,0.0010525342,0.00016296552,0.65986603,0.12108276,0.032604538,0.1812212,0.00022338115],"about_ca_topic_score_codex":0.0010221564,"about_ca_topic_score_gemma":0.0011140847,"teacher_disagreement_score":0.005444217,"about_ca_system_score_codex":0.0007121406,"about_ca_system_score_gemma":0.0009665765,"threshold_uncertainty_score":0.018212736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118953325,0.00082018744,0.86731374,0.00019007787,0.00008299826,0.00018129851,0.00030068823,0.00984715,0.0023106085],"genre_scores_gemma":[0.64983433,0.00032481703,0.3441095,0.0001492823,0.00011112641,0.00020370467,0.0007542067,0.0006444643,0.003868506],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99925405,0.00010405212,0.00008615947,0.0002037502,0.0002529775,0.00009894005],"domain_scores_gemma":[0.9984137,0.0004257085,0.00030152555,0.0006184454,0.00020127714,0.000039426362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003889055,0.00094597315,0.00060647004,0.001111862,0.00061556627,0.0007023956,0.0012073254,0.00036374593,0.0036014756],"category_scores_gemma":[0.0023802558,0.00034098118,0.00044601999,0.0013859109,0.00062201946,0.002585118,0.0009630325,0.0007602485,0.000742023],"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.0010675358,0.0001635264,0.0036310796,0.00022461262,0.00007656065,0.00023056871,0.00023834418,0.03204317,0.2077919,0.012405808,0.004405041,0.73772186],"study_design_scores_gemma":[0.00012726945,0.000748862,0.0027440186,0.000050538612,0.00015856288,0.001001607,0.00016140846,0.34251758,0.6116364,0.009582825,0.031084515,0.0001863544],"about_ca_topic_score_codex":0.0009137444,"about_ca_topic_score_gemma":0.0012146061,"teacher_disagreement_score":0.0036014756,"about_ca_system_score_codex":0.0007642952,"about_ca_system_score_gemma":0.00093459117,"threshold_uncertainty_score":0.012048066},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034776147,0.00015708798,0.66506815,0.00027592646,0.00038296593,0.0004857505,0.001094641,0.27959996,0.018159408],"genre_scores_gemma":[0.29729527,0.00034131785,0.5795602,0.0007571005,0.00009944542,0.0010929174,0.0059728194,0.09454526,0.020335669],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987337,0.0002485685,0.0000959969,0.00018271364,0.00058213715,0.00015687669],"domain_scores_gemma":[0.99431396,0.0027066749,0.00023328156,0.0013850294,0.0011184094,0.00024262325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020832978,0.0017544224,0.0006386939,0.0010075954,0.00079315825,0.0022516823,0.0030329595,0.0012793891,0.018925082],"category_scores_gemma":[0.010614526,0.001519996,0.0009769556,0.0006705757,0.00092138053,0.003490171,0.0019752148,0.0027453885,0.006238642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034335929,0.0010690057,0.0071033323,0.001515459,0.0003118734,0.0016638245,0.0019329853,0.1099826,0.10413455,0.04693751,0.17190239,0.5500129],"study_design_scores_gemma":[0.0007421783,0.00035008256,0.00093413686,0.00017594748,0.00015220407,0.00041731584,0.00018336029,0.7174141,0.12813097,0.018822404,0.13252907,0.00014832492],"about_ca_topic_score_codex":0.003575981,"about_ca_topic_score_gemma":0.0047556534,"teacher_disagreement_score":0.018925082,"about_ca_system_score_codex":0.0014684441,"about_ca_system_score_gemma":0.0012586981,"threshold_uncertainty_score":0.06331068},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008424279,0.00090279477,0.98183155,0.0003340921,0.0003806131,0.00004329356,0.000105791776,0.0023563325,0.005621153],"genre_scores_gemma":[0.27619362,0.0006950664,0.6973109,0.00054411805,0.0004873428,0.00013680548,0.00049685145,0.0005100086,0.02362527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930525,0.00016501291,0.000031527103,0.00011936687,0.00029598773,0.000082740444],"domain_scores_gemma":[0.99903727,0.00034195866,0.000039671097,0.00020696461,0.0003159432,0.000058252645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093354064,0.0007264567,0.0013126101,0.000660085,0.0005602343,0.0013550861,0.002498013,0.00108104,0.010678795],"category_scores_gemma":[0.0034223462,0.00046134106,0.00050644233,0.0011882575,0.00038471396,0.0017520606,0.000998606,0.0024608287,0.002982409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006021964,0.00030708968,0.00075944274,0.00016118832,0.00012459718,0.000086856526,0.00004589168,0.14296785,0.010398717,0.024367334,0.0132816,0.8068973],"study_design_scores_gemma":[0.00003160045,0.000051012783,0.00012052147,0.000013555925,0.00002450862,0.000028643208,0.0000067041447,0.98728704,0.0022494795,0.0077378084,0.0024399364,0.000009174829],"about_ca_topic_score_codex":0.0026742318,"about_ca_topic_score_gemma":0.009920552,"teacher_disagreement_score":0.010678795,"about_ca_system_score_codex":0.0004586547,"about_ca_system_score_gemma":0.0013488136,"threshold_uncertainty_score":0.035724163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033484478,0.00085159374,0.95482975,0.00017940108,0.00029888793,0.000090140245,0.00006742815,0.0047433376,0.0054550306],"genre_scores_gemma":[0.7423568,0.0003591451,0.24635543,0.0001339392,0.0000946897,0.00020662889,0.00019592953,0.00064087915,0.009656502],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988865,0.00023861244,0.000071954084,0.00023094182,0.00042086543,0.00015124389],"domain_scores_gemma":[0.99750453,0.0008887827,0.00018596314,0.0008844806,0.0003762532,0.00016002676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011750517,0.0008487894,0.0014084667,0.0008844584,0.0009831098,0.0019044825,0.0033778884,0.0008747656,0.0047566397],"category_scores_gemma":[0.0043036276,0.0007884973,0.00035820043,0.0011403674,0.00075655465,0.0026865555,0.002527792,0.001991302,0.0010420647],"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.004861148,0.00058088923,0.0032087006,0.0007615087,0.00032931642,0.00045102843,0.0012252952,0.1868362,0.15954402,0.20446861,0.01845182,0.41928148],"study_design_scores_gemma":[0.00037116613,0.00031610677,0.00045368474,0.000048797243,0.0001371164,0.00016819891,0.00010011771,0.8666897,0.08294379,0.03391839,0.014760395,0.0000926736],"about_ca_topic_score_codex":0.0014086101,"about_ca_topic_score_gemma":0.002164192,"teacher_disagreement_score":0.0047566397,"about_ca_system_score_codex":0.000860694,"about_ca_system_score_gemma":0.0012884671,"threshold_uncertainty_score":0.015912533},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023635687,0.0011276545,0.9414021,0.00037050783,0.0007702985,0.00022751106,0.0003571212,0.010338148,0.021770991],"genre_scores_gemma":[0.55485576,0.00042779572,0.41763848,0.0005236329,0.00025193894,0.00024762802,0.0007384887,0.00093433604,0.024381856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909186,0.00016175155,0.0000612195,0.00020359828,0.0002668005,0.00021483682],"domain_scores_gemma":[0.9990752,0.00027199974,0.000059275597,0.00033541746,0.00017456675,0.00008342872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012347614,0.00090980594,0.0013035684,0.0007958289,0.0012576645,0.001784744,0.00261421,0.0009352971,0.015576019],"category_scores_gemma":[0.0027132663,0.00052676944,0.0005081299,0.0012205795,0.0006029917,0.0020172978,0.0018337885,0.0015987098,0.0027355044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022127575,0.0004304368,0.0005289351,0.00038691613,0.00010806587,0.00020078858,0.00012846659,0.13085905,0.022737738,0.0715828,0.03876233,0.7320617],"study_design_scores_gemma":[0.00012262669,0.00019203739,0.00020980062,0.000029650115,0.000042457857,0.00012845382,0.000041713072,0.9073715,0.0223452,0.05179661,0.017667707,0.000052226747],"about_ca_topic_score_codex":0.00370312,"about_ca_topic_score_gemma":0.004836664,"teacher_disagreement_score":0.015576019,"about_ca_system_score_codex":0.0011160981,"about_ca_system_score_gemma":0.0020096581,"threshold_uncertainty_score":0.052106917},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48903722,0.007348006,0.315161,0.017256726,0.0007218865,0.00077190733,0.00077783695,0.0076824385,0.16124298],"genre_scores_gemma":[0.9122914,0.0012590874,0.070000455,0.001037519,0.00024259789,0.0002756426,0.00018172654,0.0006034226,0.014108031],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938467,0.0021374666,0.00031851136,0.00070873107,0.0020619598,0.00092668354],"domain_scores_gemma":[0.97813845,0.00901404,0.0024642593,0.0043070256,0.004708145,0.001368114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009649224,0.00067357655,0.0005902486,0.0024068684,0.0014770573,0.004540455,0.001640668,0.0012848299,0.010160662],"category_scores_gemma":[0.031916406,0.00059890596,0.00071650307,0.00256995,0.0012245231,0.0033554095,0.0017816739,0.002745625,0.0019287016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019891965,0.00063828233,0.027576966,0.00060063635,0.00023113129,0.00026550383,0.0014682341,0.07305277,0.04327212,0.22126491,0.027429048,0.6022112],"study_design_scores_gemma":[0.0005909479,0.0012671478,0.051338308,0.0006752175,0.000370677,0.0009947394,0.0025976615,0.49859792,0.074948594,0.16543682,0.2029473,0.00023467433],"about_ca_topic_score_codex":0.0043087555,"about_ca_topic_score_gemma":0.0062322724,"teacher_disagreement_score":0.010160662,"about_ca_system_score_codex":0.00329809,"about_ca_system_score_gemma":0.0029596623,"threshold_uncertainty_score":0.051030576},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019235745,0.00014187863,0.88795054,0.00034212208,0.0008344812,0.0005180631,0.001702051,0.013526766,0.07574834],"genre_scores_gemma":[0.22791003,0.000229665,0.6832977,0.00033801384,0.0002817784,0.0006915483,0.0035772282,0.008789258,0.07488487],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989832,0.00018337138,0.000066895045,0.00023285847,0.00038767298,0.00014603755],"domain_scores_gemma":[0.9985525,0.00033044448,0.00005037526,0.000570076,0.0004443683,0.00005227299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000715794,0.0012497813,0.0009935123,0.001231614,0.0013287301,0.0016753721,0.0016433039,0.000855191,0.069021046],"category_scores_gemma":[0.004391309,0.00081697165,0.0011551243,0.0014303671,0.00089125667,0.0023816389,0.0028335415,0.0013059623,0.022502009],"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.00035908708,0.00016004167,0.0007484514,0.0005303419,0.000052501746,0.0006279886,0.0005303114,0.010602055,0.018570907,0.37473965,0.08114853,0.51193005],"study_design_scores_gemma":[0.00013976762,0.00016134755,0.00048003747,0.00012600656,0.00010580341,0.0008921784,0.00027762796,0.09967492,0.045850206,0.6248734,0.22730789,0.00011078905],"about_ca_topic_score_codex":0.0004638837,"about_ca_topic_score_gemma":0.0010919976,"teacher_disagreement_score":0.069021046,"about_ca_system_score_codex":0.0005767195,"about_ca_system_score_gemma":0.001034692,"threshold_uncertainty_score":0.23089838},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39086047,0.010210522,0.56306595,0.0013115203,0.00092349085,0.00012737198,0.00060870755,0.013253025,0.01963889],"genre_scores_gemma":[0.86150014,0.0009754364,0.12515634,0.00032916534,0.00017322702,0.000086849366,0.00041770452,0.0003864364,0.010974576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998054,0.000024868898,0.000014365874,0.000042790038,0.0000655077,0.000047031306],"domain_scores_gemma":[0.9993599,0.0002780477,0.00006963959,0.00013297306,0.00012806054,0.00003128788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020046844,0.000945157,0.00056242547,0.00053398847,0.0005601747,0.000961983,0.0021545752,0.0004846559,0.0069405898],"category_scores_gemma":[0.0009467843,0.00051027373,0.00033410336,0.0012891239,0.00022865662,0.0022940342,0.0006076362,0.00082498114,0.0007385478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016753491,0.0006033768,0.0038972225,0.00048709312,0.0001607766,0.0003165443,0.00015608035,0.17279236,0.2113859,0.014303293,0.021350391,0.5728716],"study_design_scores_gemma":[0.00014392762,0.0009927163,0.0017482965,0.0000703355,0.00023408596,0.00032354426,0.000078110585,0.7839583,0.1847299,0.012899062,0.0147487605,0.00007296784],"about_ca_topic_score_codex":0.0019402131,"about_ca_topic_score_gemma":0.006260141,"teacher_disagreement_score":0.0069405898,"about_ca_system_score_codex":0.00068916415,"about_ca_system_score_gemma":0.00095808686,"threshold_uncertainty_score":0.023218632},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012026718,0.00035877916,0.94484234,0.0002650831,0.00023502488,0.000042591677,0.0001654992,0.010509226,0.031554747],"genre_scores_gemma":[0.26223165,0.0005120447,0.6870057,0.00050124375,0.00020015676,0.00014941236,0.00079892384,0.0066566295,0.0419443],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915516,0.00015966054,0.00005417773,0.00017106581,0.00029515015,0.0001647911],"domain_scores_gemma":[0.99884003,0.0004855401,0.00005054238,0.00036375833,0.00021329259,0.000046979894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005444475,0.0015897516,0.00086542586,0.0005071104,0.0005730076,0.0014002182,0.0013767148,0.00058337575,0.02812581],"category_scores_gemma":[0.0035871372,0.00049397,0.0008900228,0.00068586937,0.00086158916,0.0021134336,0.0017658712,0.0015804854,0.013102299],"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.0006278517,0.0001865382,0.0010706474,0.00049583975,0.00011034267,0.0003811095,0.0002677812,0.063307114,0.026684167,0.08997504,0.043894295,0.7729992],"study_design_scores_gemma":[0.0002836649,0.0003371982,0.0010964731,0.000111230846,0.00013688703,0.0008730556,0.0001748284,0.6884505,0.06932895,0.14120668,0.09792044,0.00008010504],"about_ca_topic_score_codex":0.0019967488,"about_ca_topic_score_gemma":0.0044710236,"teacher_disagreement_score":0.02812581,"about_ca_system_score_codex":0.0005506334,"about_ca_system_score_gemma":0.0010787566,"threshold_uncertainty_score":0.09409022},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017299174,0.0000736628,0.987978,0.00016797095,0.00010140243,0.00012925513,0.0002516505,0.008450981,0.0011170986],"genre_scores_gemma":[0.043527007,0.000120463796,0.9478019,0.00030422528,0.00008194831,0.00038240146,0.0009837098,0.0024152952,0.0043830713],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9904703,0.0023930322,0.0015948405,0.0019616932,0.0028685743,0.000711542],"domain_scores_gemma":[0.9766183,0.0047731414,0.0013987215,0.011981248,0.0046408055,0.0005878232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009803663,0.0014679212,0.0016447032,0.0049137995,0.0022351514,0.0052766693,0.0049090195,0.0028425555,0.0140637],"category_scores_gemma":[0.025283147,0.0013091635,0.0013995884,0.0034730202,0.0027268531,0.010663079,0.0072773728,0.0045110644,0.007342687],"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.001152774,0.0002673131,0.0025445006,0.0007192007,0.0000837965,0.0005241528,0.0018632022,0.008847944,0.05371142,0.30326763,0.03741012,0.58960795],"study_design_scores_gemma":[0.00027392016,0.0005034337,0.0010098426,0.00043373724,0.00019761967,0.0016640744,0.00060724735,0.16472563,0.24874887,0.24795708,0.33334112,0.0005374447],"about_ca_topic_score_codex":0.0016322993,"about_ca_topic_score_gemma":0.0013241015,"teacher_disagreement_score":0.0140637,"about_ca_system_score_codex":0.0018585746,"about_ca_system_score_gemma":0.0029980638,"threshold_uncertainty_score":0.0518474},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8858868,0.0014613429,0.09994699,0.0004963432,0.000081520295,0.00017800592,0.0007304126,0.0011214564,0.010097224],"genre_scores_gemma":[0.9816807,0.00035584354,0.015064613,0.000038366834,0.000049596747,0.00011410239,0.00079456426,0.00016221736,0.0017399002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9980958,0.0004132752,0.00011610731,0.0001956791,0.0010165323,0.00016255476],"domain_scores_gemma":[0.9891165,0.006232403,0.001879751,0.0006762581,0.0018558572,0.00023921656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011883384,0.0004950466,0.00034863365,0.0009582379,0.00057174114,0.0008491304,0.00047418394,0.0005384594,0.0012188014],"category_scores_gemma":[0.012316518,0.00021067704,0.0002118696,0.0015453913,0.00033957168,0.0013159511,0.0004953688,0.0004701647,0.00042407916],"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.0012758359,0.00041021168,0.22533914,0.0015113946,0.0002277423,0.001255392,0.0020863314,0.29156065,0.2241726,0.018439183,0.007911817,0.2258097],"study_design_scores_gemma":[0.000067832494,0.0009458639,0.15931973,0.00009920091,0.00020405767,0.003708077,0.0013437176,0.6119921,0.16580445,0.016020412,0.040343255,0.00015134068],"about_ca_topic_score_codex":0.0011223892,"about_ca_topic_score_gemma":0.0010513053,"teacher_disagreement_score":0.0012188014,"about_ca_system_score_codex":0.00046697535,"about_ca_system_score_gemma":0.00059920165,"threshold_uncertainty_score":0.0062845945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05390303,0.0006217892,0.9364009,0.00012796323,0.00008382738,0.00015848585,0.00008903894,0.00445347,0.00416141],"genre_scores_gemma":[0.27058524,0.0002907721,0.72279173,0.00018222381,0.00004674461,0.00023122669,0.00045895277,0.00038376066,0.005029307],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947935,0.000078188445,0.000045626715,0.0001494438,0.00018512386,0.000062236635],"domain_scores_gemma":[0.99924195,0.00031091354,0.00009361948,0.00019024804,0.00013593433,0.00002736249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004881246,0.0007132775,0.00063712173,0.0010281174,0.00047082079,0.0007053588,0.0014806476,0.00070609123,0.0032647126],"category_scores_gemma":[0.0016589517,0.00035813043,0.00051005784,0.00076099474,0.00043092194,0.0011963727,0.0009308086,0.0010843503,0.00088463543],"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.00057992083,0.00025084877,0.0023882939,0.0002459784,0.000047442725,0.00021817535,0.00011001107,0.095143065,0.10418944,0.014065309,0.004474015,0.7782875],"study_design_scores_gemma":[0.00008593753,0.00034796502,0.0010143027,0.000063600055,0.00005194767,0.00057857693,0.000055447297,0.84695786,0.11523321,0.014367513,0.021181602,0.000061976214],"about_ca_topic_score_codex":0.00045659917,"about_ca_topic_score_gemma":0.0009562602,"teacher_disagreement_score":0.0032647126,"about_ca_system_score_codex":0.0005020059,"about_ca_system_score_gemma":0.0009834676,"threshold_uncertainty_score":0.0109215975},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11077904,0.0005409202,0.87974834,0.00036865647,0.00004586203,0.00009180682,0.00008236804,0.0020794645,0.0062635327],"genre_scores_gemma":[0.6069344,0.0006458222,0.38749006,0.00011725493,0.00009629677,0.0001712751,0.00036176303,0.0010917512,0.0030913292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990337,0.00018921061,0.00007132094,0.00015908503,0.00043021812,0.00011656984],"domain_scores_gemma":[0.99331194,0.0043767495,0.0006023318,0.0009887916,0.0006343378,0.00008579476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009153412,0.00083080394,0.0007144571,0.001219108,0.00052281725,0.001157596,0.00080115045,0.00048820907,0.0031896604],"category_scores_gemma":[0.01219689,0.000510757,0.0005631437,0.0012098702,0.0008077733,0.002923778,0.00114683,0.0008775928,0.00043832042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005744352,0.00014505525,0.003776456,0.00030191138,0.000073938456,0.00025543763,0.00041511233,0.5320005,0.07696225,0.04893357,0.0018037963,0.3347575],"study_design_scores_gemma":[0.00008598729,0.00022819756,0.0020478745,0.000034951936,0.00009859489,0.00020408031,0.00006809139,0.8711232,0.0706648,0.047456276,0.007948498,0.000039402257],"about_ca_topic_score_codex":0.0015142715,"about_ca_topic_score_gemma":0.0023729107,"teacher_disagreement_score":0.0031896604,"about_ca_system_score_codex":0.0010789637,"about_ca_system_score_gemma":0.0010316746,"threshold_uncertainty_score":0.0106704235},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010164792,0.0010797727,0.9216615,0.00082392665,0.00046884562,0.00021684598,0.0002524383,0.0013169714,0.06401492],"genre_scores_gemma":[0.17394374,0.0011385028,0.7777504,0.00056686206,0.0004672716,0.00028505435,0.0011688699,0.0008207135,0.043858614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973417,0.0006506191,0.00022600015,0.00057078415,0.0010537979,0.00015712126],"domain_scores_gemma":[0.996588,0.001306415,0.0001463511,0.001120956,0.00076062966,0.00007767165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022926629,0.0009595137,0.0007218159,0.0013127145,0.0012535045,0.0027673063,0.0019788549,0.00084704824,0.017879399],"category_scores_gemma":[0.008843559,0.00042849348,0.0011776086,0.0019569863,0.0016389232,0.005148682,0.0021184394,0.002085343,0.005024915],"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.000105810206,0.00009484278,0.00040819836,0.00019681307,0.000042739044,0.000037624563,0.00008169193,0.018949706,0.0013458803,0.7250203,0.009664046,0.24405234],"study_design_scores_gemma":[0.000040443483,0.0000419297,0.00019043493,0.00003525404,0.000023646333,0.00011307931,0.000037123784,0.16162054,0.0034860438,0.7871078,0.04729213,0.000011562271],"about_ca_topic_score_codex":0.0008755419,"about_ca_topic_score_gemma":0.001210288,"teacher_disagreement_score":0.017879399,"about_ca_system_score_codex":0.0014652677,"about_ca_system_score_gemma":0.0013781211,"threshold_uncertainty_score":0.059812546},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9757817,0.00070868834,0.0063665695,0.0002761543,0.0002444716,0.00009518168,0.00097138557,0.0062668226,0.009289057],"genre_scores_gemma":[0.9559796,0.00047009587,0.030358749,0.00018920723,0.00008506647,0.00011921217,0.0045152297,0.0016167607,0.006666144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99833006,0.00035738936,0.00015201734,0.000374207,0.0005020399,0.00028438793],"domain_scores_gemma":[0.993929,0.0025210707,0.0002823151,0.0014298311,0.0015046879,0.00033311677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001457281,0.0019083632,0.0009807331,0.0012416762,0.0010011537,0.00068285875,0.0024504915,0.0009970987,0.0038588154],"category_scores_gemma":[0.005345499,0.00075635535,0.0007010879,0.0027908697,0.0007666817,0.0013937976,0.00086692016,0.0012062237,0.0011735315],"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.0091042835,0.006856386,0.008100754,0.0019286905,0.00063796464,0.000978587,0.0007778662,0.43065968,0.19519562,0.0023184936,0.051830396,0.29161134],"study_design_scores_gemma":[0.0018055054,0.0055199824,0.011060414,0.000056623943,0.0003219737,0.00036417795,0.0005686191,0.7255497,0.242503,0.0020106363,0.010110862,0.00012851643],"about_ca_topic_score_codex":0.012322688,"about_ca_topic_score_gemma":0.010034244,"teacher_disagreement_score":0.012322688,"about_ca_system_score_codex":0.00069612317,"about_ca_system_score_gemma":0.0008831734,"threshold_uncertainty_score":0.02450192},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27841398,0.0014529668,0.49562192,0.007182518,0.0017857504,0.00023361837,0.00066595705,0.009749017,0.20489426],"genre_scores_gemma":[0.80063564,0.0004398778,0.15527754,0.0009079802,0.00042525056,0.00007653434,0.00042120996,0.0026093193,0.039206654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851304,0.000523987,0.00009373935,0.000270854,0.0003586799,0.00023964113],"domain_scores_gemma":[0.99322915,0.0036279373,0.00043592267,0.0015797946,0.0007894176,0.00033773115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001758915,0.0008199504,0.00057494536,0.00053679466,0.0007579416,0.0022064426,0.0009383373,0.00089768437,0.027977258],"category_scores_gemma":[0.015553955,0.00038691933,0.00035799798,0.0005564688,0.00046285058,0.0047135325,0.00091852434,0.0011151709,0.004216939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024093431,0.00037615286,0.004091752,0.00026579073,0.000054950855,0.00054947374,0.0006194229,0.02810546,0.018421141,0.120582074,0.06710583,0.7574185],"study_design_scores_gemma":[0.00038273918,0.0011138596,0.0034514677,0.0003161134,0.00020784198,0.0010225972,0.000816462,0.45513546,0.068198286,0.29582536,0.17339517,0.000134654],"about_ca_topic_score_codex":0.00049064524,"about_ca_topic_score_gemma":0.0015073767,"teacher_disagreement_score":0.027977258,"about_ca_system_score_codex":0.00041559522,"about_ca_system_score_gemma":0.00057480065,"threshold_uncertainty_score":0.09359324},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074385162,0.1320947,0.34911653,0.027330821,0.07879822,0.00067302113,0.005232811,0.0076605855,0.3916548],"genre_scores_gemma":[0.0970143,0.11674677,0.23299013,0.007855838,0.034972075,0.00124937,0.020972516,0.0031725576,0.48502657],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99634737,0.0009283262,0.00044120857,0.0005824042,0.0014300647,0.00027068288],"domain_scores_gemma":[0.9962203,0.0010152517,0.00012619274,0.0010799732,0.0011887923,0.00036949912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034070264,0.001810479,0.0024873104,0.0022240947,0.0014379122,0.008295022,0.0020121809,0.0019171478,0.08470555],"category_scores_gemma":[0.007593366,0.00054157857,0.0019743876,0.0025853675,0.0022832723,0.0048948447,0.0039049122,0.0048106266,0.037286352],"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.00023855452,0.00008659034,0.00064783165,0.0008619483,0.00017940995,0.00026990217,0.000454987,0.0039101792,0.002479397,0.18466163,0.49711955,0.30908996],"study_design_scores_gemma":[0.000023939152,0.00004393512,0.0002645289,0.00023043397,0.00003479096,0.00017105711,0.000050113988,0.0046707676,0.00054604275,0.053034782,0.9409054,0.000024242],"about_ca_topic_score_codex":0.0019945796,"about_ca_topic_score_gemma":0.002125224,"teacher_disagreement_score":0.08470555,"about_ca_system_score_codex":0.0021646174,"about_ca_system_score_gemma":0.0038447801,"threshold_uncertainty_score":0.2833683},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18158567,0.0032678223,0.78621787,0.00052815606,0.00023140974,0.00015066608,0.00023974296,0.0045161,0.023262585],"genre_scores_gemma":[0.45821267,0.0008844554,0.5279253,0.000178273,0.00009177627,0.00020646353,0.00061719125,0.00017553158,0.011708319],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984396,0.000019890742,0.000010016079,0.000012884335,0.00009909112,0.000014244885],"domain_scores_gemma":[0.999863,0.000026664979,0.000019309684,0.00002828725,0.000052651543,0.000009984473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010882414,0.00029347997,0.00023098546,0.00037509337,0.00017780498,0.00039754418,0.00092355633,0.00021332013,0.0023855974],"category_scores_gemma":[0.00037849246,0.00017608542,0.00023777488,0.00042115475,0.00014880528,0.00045418492,0.00024304786,0.00068015914,0.0007899179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054635445,0.0002775751,0.0014147833,0.00062487944,0.00009223813,0.00035451932,0.00012797852,0.116810665,0.35813698,0.05868396,0.011753163,0.4511769],"study_design_scores_gemma":[0.00021084741,0.0019198031,0.0029244928,0.000104429615,0.00013816032,0.0006438899,0.000043248412,0.76466566,0.13351306,0.019571483,0.076203674,0.00006126688],"about_ca_topic_score_codex":0.00038835238,"about_ca_topic_score_gemma":0.0009188583,"teacher_disagreement_score":0.0023855974,"about_ca_system_score_codex":0.00026908633,"about_ca_system_score_gemma":0.0004699617,"threshold_uncertainty_score":0.007980585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013147559,0.00051662617,0.76010036,0.0005696926,0.0004608463,0.00072787836,0.0012710717,0.20420139,0.019004622],"genre_scores_gemma":[0.21763435,0.0012507566,0.7017518,0.0008384127,0.0004720542,0.0013382174,0.013869894,0.026019236,0.036825247],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99777204,0.00022113789,0.00026662444,0.0004581524,0.0009503112,0.0003315721],"domain_scores_gemma":[0.99594927,0.00032137916,0.00016578418,0.0024792575,0.0006547181,0.00042957818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003476362,0.0008794545,0.0007785655,0.0016374352,0.0008576624,0.003313243,0.0055967094,0.0014078672,0.012237677],"category_scores_gemma":[0.007826805,0.0015878909,0.001219752,0.0012848305,0.0009262806,0.0059220516,0.0075716353,0.0037820819,0.010687792],"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.00080999715,0.00081885845,0.005475274,0.0006839692,0.00014741693,0.0005730382,0.0010572821,0.015158169,0.06874141,0.08064405,0.13283408,0.6930564],"study_design_scores_gemma":[0.00042038882,0.0005385551,0.0050241984,0.0003528823,0.00020020237,0.0012457249,0.0002176395,0.19744165,0.04235668,0.09375863,0.658113,0.00033036325],"about_ca_topic_score_codex":0.0016841183,"about_ca_topic_score_gemma":0.0012313841,"teacher_disagreement_score":0.012237677,"about_ca_system_score_codex":0.0006718689,"about_ca_system_score_gemma":0.0023556869,"threshold_uncertainty_score":0.040939093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04416691,0.001053919,0.9420222,0.00041593538,0.00011211438,0.000053051335,0.00019308347,0.0017346666,0.010248231],"genre_scores_gemma":[0.73254,0.0005957305,0.25118425,0.00010388183,0.00011413584,0.00016967116,0.00042032558,0.000811811,0.0140602365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974877,0.000046467358,0.000013433824,0.00003639218,0.000094466806,0.00006033929],"domain_scores_gemma":[0.99944407,0.00029427838,0.00003605311,0.000098362805,0.000101296144,0.000025862051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054550305,0.0005601526,0.0008187349,0.0004714713,0.0005251802,0.0008013914,0.0012255885,0.00042396176,0.006108779],"category_scores_gemma":[0.0018655085,0.0003392654,0.00043522363,0.0010013707,0.00047026397,0.0016536533,0.0008180189,0.00063510804,0.00038563157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003842226,0.00010231372,0.00033471338,0.00020649933,0.000029535111,0.000033533863,0.000074107236,0.70941395,0.010408508,0.05770556,0.00828249,0.21302454],"study_design_scores_gemma":[0.000015743552,0.000026701116,0.0000821626,0.0000067515894,0.0000053180747,0.000009767528,0.000008231864,0.96104014,0.0040710787,0.03348072,0.001247944,0.0000054355773],"about_ca_topic_score_codex":0.0024989103,"about_ca_topic_score_gemma":0.0032178082,"teacher_disagreement_score":0.006108779,"about_ca_system_score_codex":0.0010200891,"about_ca_system_score_gemma":0.0010873703,"threshold_uncertainty_score":0.02043593},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008116753,0.0006504804,0.96219486,0.00036169327,0.00029884608,0.00007989032,0.0003860369,0.0114070745,0.016504353],"genre_scores_gemma":[0.21682939,0.0007018558,0.7587204,0.00051142677,0.00013843062,0.00027089342,0.0010282184,0.002075508,0.01972378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997286,0.00005092516,0.00001264317,0.000050697894,0.00010884235,0.000048352744],"domain_scores_gemma":[0.9997019,0.0000975663,0.000023859084,0.000083931525,0.00006602711,0.000026735182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039350544,0.0007924745,0.0006611115,0.00047465265,0.00049509096,0.0008609216,0.0017264738,0.0007368511,0.0073269494],"category_scores_gemma":[0.0011232798,0.0003591433,0.00045536476,0.00086021883,0.0004967523,0.000897651,0.001052563,0.0013273079,0.0016667219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051758485,0.00021320964,0.0004349265,0.00035994386,0.00006402661,0.0000937436,0.000055441706,0.28012842,0.014345388,0.0674662,0.09829082,0.53803027],"study_design_scores_gemma":[0.00006705423,0.00005911745,0.000089190566,0.000020481613,0.00001912898,0.00008000849,0.0000142685985,0.9288755,0.008460801,0.047714934,0.0145856785,0.000013725445],"about_ca_topic_score_codex":0.0019296802,"about_ca_topic_score_gemma":0.003864496,"teacher_disagreement_score":0.0073269494,"about_ca_system_score_codex":0.00049515493,"about_ca_system_score_gemma":0.0012138422,"threshold_uncertainty_score":0.024511099},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047732983,0.00024418664,0.9306412,0.00043431268,0.00009565123,0.00010326772,0.00007912496,0.00080983405,0.019859524],"genre_scores_gemma":[0.6986891,0.0003930911,0.28860357,0.00012667221,0.0000736444,0.00042420387,0.0002379389,0.00046980978,0.010982013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992095,0.00042230394,0.00003058305,0.00006847851,0.00020003166,0.00006904246],"domain_scores_gemma":[0.9976974,0.0015016934,0.00011035879,0.00032558918,0.00028671417,0.000078218785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011236934,0.0006859178,0.0007642501,0.00050395966,0.00060196815,0.0014293935,0.0010827421,0.0009781776,0.0076231756],"category_scores_gemma":[0.008100175,0.00048316648,0.0005979363,0.0006189187,0.0011885002,0.0017266505,0.0016380013,0.0012054065,0.0010260023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085896914,0.00004957389,0.0005080085,0.000052881358,0.000014387474,0.000042912405,0.000055834833,0.9355822,0.00092459534,0.0493078,0.0007774087,0.012598551],"study_design_scores_gemma":[0.00001599709,0.000009452777,0.000019291205,0.0000045604356,0.0000020320704,0.0000059478834,0.0000053076224,0.988074,0.0004840295,0.010690505,0.00068700936,0.0000018036122],"about_ca_topic_score_codex":0.0020030967,"about_ca_topic_score_gemma":0.00174916,"teacher_disagreement_score":0.0076231756,"about_ca_system_score_codex":0.00068402174,"about_ca_system_score_gemma":0.0009476236,"threshold_uncertainty_score":0.025502026},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9866349,0.00045631707,0.008693306,0.00010373721,0.000072325274,0.00004662542,0.00008346059,0.0024140116,0.0014952284],"genre_scores_gemma":[0.9871982,0.00007256352,0.011866248,0.000042208867,0.000015784188,0.000020792691,0.0001515809,0.0001306922,0.00050208834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9970048,0.00081341836,0.0002792294,0.00046063142,0.0009113964,0.0005306575],"domain_scores_gemma":[0.99236625,0.0038433704,0.00093265297,0.001316532,0.0011577315,0.00038348892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020800014,0.0012264041,0.00055237254,0.00092671195,0.00076296506,0.0013755241,0.0024766559,0.0008502476,0.0022663127],"category_scores_gemma":[0.0066754892,0.00055512163,0.0003306539,0.0013273912,0.0007864374,0.0025003904,0.00094576774,0.0010626155,0.00033412184],"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.01208268,0.004706223,0.06271735,0.00127725,0.0006742822,0.00073883426,0.000961072,0.3952198,0.26238495,0.004952715,0.009564592,0.24472028],"study_design_scores_gemma":[0.00024440853,0.0030172323,0.0075622043,0.000021129765,0.00012782948,0.00014457529,0.00015399694,0.8502039,0.13620457,0.0003830075,0.0018693674,0.00006782153],"about_ca_topic_score_codex":0.0080520185,"about_ca_topic_score_gemma":0.0074375262,"teacher_disagreement_score":0.0080520185,"about_ca_system_score_codex":0.0020922339,"about_ca_system_score_gemma":0.0012040617,"threshold_uncertainty_score":0.016010284},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00844816,0.00016809457,0.98013294,0.00029991975,0.000053655338,0.00015443935,0.00036123412,0.0056224097,0.004759039],"genre_scores_gemma":[0.24154745,0.00025064463,0.7477272,0.00024258308,0.00020804434,0.00024433676,0.001108593,0.001235414,0.0074357814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966576,0.0005230417,0.00023279699,0.0004597913,0.0017681024,0.00035861382],"domain_scores_gemma":[0.9955628,0.0019723384,0.0002090112,0.0012865445,0.0008630025,0.000106241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019001467,0.0010870032,0.0011945427,0.0031724686,0.0017207888,0.0031227001,0.0022463342,0.001006135,0.012027663],"category_scores_gemma":[0.01091295,0.00087419734,0.0021262586,0.0025010412,0.0011005156,0.0051429546,0.003336114,0.0023547781,0.0024454577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077151216,0.00023655269,0.0030325921,0.0004268204,0.00014200169,0.0003259537,0.00041402676,0.03635926,0.022153322,0.15734866,0.0183653,0.7604241],"study_design_scores_gemma":[0.00008632818,0.0001303988,0.0011828705,0.00008242295,0.00012817678,0.0003044114,0.00019871538,0.6610182,0.026941227,0.2947503,0.015101893,0.00007501668],"about_ca_topic_score_codex":0.003484199,"about_ca_topic_score_gemma":0.003679619,"teacher_disagreement_score":0.012027663,"about_ca_system_score_codex":0.0013270077,"about_ca_system_score_gemma":0.0022464488,"threshold_uncertainty_score":0.040236473},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23036605,0.0043332977,0.73306686,0.0007630561,0.000078535646,0.00012817653,0.00020183506,0.0011531301,0.02990898],"genre_scores_gemma":[0.8163197,0.002052103,0.17295384,0.00027822747,0.0000648068,0.0001729695,0.0002994715,0.0003309438,0.0075278874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912494,0.00025930157,0.000040644954,0.000056201734,0.00036512341,0.00015372167],"domain_scores_gemma":[0.99873203,0.0007535618,0.00011431945,0.00010462668,0.00026991774,0.00002557935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074506097,0.00057892624,0.0003563209,0.0008824815,0.00043955477,0.0013809103,0.0006632345,0.00042707007,0.0031534648],"category_scores_gemma":[0.0024787325,0.00039419477,0.00072834955,0.000854923,0.00046461564,0.0013219417,0.00037156747,0.0006908341,0.00050730904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093166204,0.00016179371,0.003487378,0.00082013744,0.00009029427,0.00044665046,0.00042635214,0.44646084,0.060647074,0.1451855,0.005518707,0.33582366],"study_design_scores_gemma":[0.000067737485,0.0004756723,0.001784375,0.00007905904,0.0001233233,0.00033680457,0.00015522915,0.8873764,0.02325759,0.06828491,0.018017543,0.000041287218],"about_ca_topic_score_codex":0.0013005722,"about_ca_topic_score_gemma":0.0017548891,"teacher_disagreement_score":0.0031534648,"about_ca_system_score_codex":0.0006973134,"about_ca_system_score_gemma":0.0009864155,"threshold_uncertainty_score":0.010549426},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15711655,0.005443187,0.81451756,0.00071978965,0.00067771954,0.00008353366,0.00025756424,0.009575538,0.011608499],"genre_scores_gemma":[0.74159646,0.0012124992,0.23944059,0.0002105481,0.00020618392,0.00006343403,0.00044594804,0.00043715932,0.016387252],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99975234,0.000043465763,0.000012385071,0.000030207884,0.00012708368,0.000034551267],"domain_scores_gemma":[0.9991142,0.0003455804,0.00006958263,0.0001613835,0.00027192684,0.000037385038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028379867,0.00054543646,0.00054758525,0.00059500936,0.00041934798,0.0005552563,0.0011184515,0.00034462954,0.0042975126],"category_scores_gemma":[0.001936127,0.0003821795,0.00017570236,0.0008944661,0.00014379896,0.00086363335,0.00041330312,0.0009585927,0.0006167879],"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.000633552,0.000190546,0.003062435,0.00016256521,0.000069983806,0.00009230182,0.00008005759,0.0963016,0.032658372,0.003013085,0.011912682,0.8518228],"study_design_scores_gemma":[0.000058103044,0.00014554472,0.0018638058,0.000030348607,0.000063527164,0.000108049135,0.000026619633,0.95475614,0.034987994,0.0034909935,0.0044517787,0.000017073486],"about_ca_topic_score_codex":0.0024762824,"about_ca_topic_score_gemma":0.0143035315,"teacher_disagreement_score":0.0042975126,"about_ca_system_score_codex":0.0003082167,"about_ca_system_score_gemma":0.00086794,"threshold_uncertainty_score":0.01437664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013918512,0.0020036101,0.95821196,0.0005184393,0.00043917663,0.00005153286,0.00013051752,0.014577901,0.010148313],"genre_scores_gemma":[0.3350038,0.0018917854,0.62833095,0.00051631953,0.00042227705,0.00019808194,0.00055501476,0.0075559034,0.025525799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920267,0.00017275392,0.00007924087,0.00011110803,0.0003183925,0.00011585602],"domain_scores_gemma":[0.99850166,0.0005619989,0.00011128068,0.00054530916,0.00019983717,0.000079946796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00127962,0.0007892802,0.00066257274,0.0005886677,0.00072221155,0.0018942549,0.0022514712,0.0009156412,0.006213326],"category_scores_gemma":[0.0040238537,0.0009752059,0.0009598296,0.0008565709,0.0010475572,0.0035074577,0.0015006169,0.0026638769,0.001589092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090379175,0.00015198915,0.002363075,0.0005728729,0.0001035019,0.00038027833,0.00065452844,0.03582021,0.02977189,0.43539143,0.046732932,0.44715348],"study_design_scores_gemma":[0.00014330997,0.00019631349,0.0009483947,0.00015673105,0.00016206826,0.0006034248,0.00007346838,0.43680826,0.036686905,0.4153146,0.10877593,0.00013066613],"about_ca_topic_score_codex":0.0016136796,"about_ca_topic_score_gemma":0.0029714832,"teacher_disagreement_score":0.006213326,"about_ca_system_score_codex":0.00082169037,"about_ca_system_score_gemma":0.001472238,"threshold_uncertainty_score":0.02078569},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013393899,0.0011383094,0.94056726,0.00021150534,0.00038717798,0.00023954695,0.0005173247,0.021473939,0.022071],"genre_scores_gemma":[0.27927214,0.0010465698,0.6519145,0.0003626039,0.00017150382,0.0005918767,0.0014600734,0.0032908062,0.061889898],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966335,0.000058815724,0.000024305811,0.000037495447,0.00018243707,0.000033533863],"domain_scores_gemma":[0.9996979,0.00006130824,0.00002378919,0.00009093926,0.000089536385,0.00003651102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025319232,0.00065410754,0.00074873224,0.00063084293,0.0004659078,0.0009123173,0.0016999277,0.00050969113,0.028945606],"category_scores_gemma":[0.00095480814,0.00047096758,0.00027014024,0.0007491644,0.00029352363,0.0013899218,0.0010232764,0.00088182243,0.006407527],"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.0014847998,0.00012361698,0.00081772247,0.0013368776,0.000108498425,0.00023906116,0.00042386385,0.023502164,0.15817899,0.08654116,0.07357152,0.6536717],"study_design_scores_gemma":[0.00041781642,0.001060631,0.001288088,0.00015792003,0.00016090086,0.0014915231,0.000094156654,0.2984502,0.23287335,0.019202637,0.44464543,0.00015732311],"about_ca_topic_score_codex":0.00041103933,"about_ca_topic_score_gemma":0.0007207188,"teacher_disagreement_score":0.028945606,"about_ca_system_score_codex":0.00044767035,"about_ca_system_score_gemma":0.0005363408,"threshold_uncertainty_score":0.09683263},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51526767,0.006631027,0.41194472,0.0012752417,0.0014203413,0.00031140915,0.0024470994,0.035397954,0.025304569],"genre_scores_gemma":[0.8338275,0.00073685526,0.14699088,0.0006409133,0.00024557218,0.00019064703,0.0022586985,0.0017681584,0.013340736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989491,0.00011287385,0.00008221323,0.00022624178,0.00042600583,0.00020370318],"domain_scores_gemma":[0.99692243,0.0009296002,0.00035210096,0.00093995815,0.00076070207,0.00009513115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043157744,0.0011398607,0.0010410993,0.0023442896,0.0011053617,0.0017718989,0.0017199412,0.0009663933,0.0074513135],"category_scores_gemma":[0.0036319483,0.00054726435,0.00048228857,0.0025037907,0.000822832,0.002969691,0.001705112,0.0009475166,0.0026878498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002706141,0.00039822163,0.0105637945,0.0006149006,0.00012111715,0.0012649966,0.0005233551,0.011216792,0.11326183,0.014829659,0.025400614,0.81909865],"study_design_scores_gemma":[0.00022760846,0.00095190154,0.0066920216,0.0002336381,0.00033688912,0.002121857,0.0010954058,0.37337044,0.5110758,0.058155112,0.045549802,0.00018946239],"about_ca_topic_score_codex":0.0017070164,"about_ca_topic_score_gemma":0.0034287046,"teacher_disagreement_score":0.0074513135,"about_ca_system_score_codex":0.0006611437,"about_ca_system_score_gemma":0.0011631995,"threshold_uncertainty_score":0.02492714},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073462543,0.022617383,0.34952733,0.0077082124,0.027993383,0.00080212974,0.011566343,0.030758465,0.54168046],"genre_scores_gemma":[0.003584115,0.008646853,0.04198233,0.0004981283,0.0007010353,0.00011074353,0.007092881,0.0046909703,0.932693],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99947983,0.000044166514,0.00002347362,0.000068786576,0.0003298036,0.000053969376],"domain_scores_gemma":[0.99827003,0.00027389228,0.000042905907,0.00019508414,0.0008827155,0.00033525517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010254424,0.0017352229,0.0016912073,0.0011951949,0.0010757426,0.0048944056,0.0017622296,0.0008309527,0.16068228],"category_scores_gemma":[0.0017387534,0.001031907,0.0006858596,0.002261752,0.00077645056,0.002476842,0.0014043743,0.0023787166,0.11140754],"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.00008934218,0.00008491975,0.0001417621,0.00019556565,0.000010110417,0.000049873066,0.000091808324,0.001160592,0.0020170326,0.005615996,0.84106946,0.14947353],"study_design_scores_gemma":[0.00003063244,0.000039647675,0.00041824032,0.00010242199,0.000018656558,0.00014944166,0.00005877764,0.0035033063,0.0019903735,0.002937466,0.9907286,0.000022417757],"about_ca_topic_score_codex":0.0264964,"about_ca_topic_score_gemma":0.1069263,"teacher_disagreement_score":0.16068228,"about_ca_system_score_codex":0.0018720119,"about_ca_system_score_gemma":0.0043864413,"threshold_uncertainty_score":0.5375358},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0087419795,0.0019955381,0.96670043,0.0023512018,0.000297872,0.00010321311,0.000042669228,0.0005014945,0.019265573],"genre_scores_gemma":[0.13470048,0.0031433655,0.8567998,0.00030892697,0.0001783501,0.00022592636,0.0001667692,0.00030124278,0.0041751685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997758,0.0010784883,0.000114016424,0.00018931263,0.0007247205,0.00013552743],"domain_scores_gemma":[0.9956813,0.002161725,0.00016565867,0.0009520905,0.0007736002,0.0002655932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009224589,0.00087173475,0.00059719564,0.0018602365,0.0012495314,0.0032979602,0.002560503,0.0014638053,0.002716424],"category_scores_gemma":[0.009401672,0.0006297451,0.0017673495,0.0010917878,0.0052007088,0.0037270412,0.0023826938,0.0029105202,0.000594684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014837294,0.000039020295,0.0006638864,0.000077357654,0.000027255108,0.00006604149,0.00046483695,0.050064247,0.00072357076,0.91376865,0.00095815735,0.033132218],"study_design_scores_gemma":[0.00005600702,0.00009264975,0.00059097045,0.00023579465,0.000042542764,0.00024612978,0.00023811348,0.2274964,0.0015770382,0.5818225,0.1875264,0.000075413845],"about_ca_topic_score_codex":0.0053777792,"about_ca_topic_score_gemma":0.0032638607,"teacher_disagreement_score":0.009224589,"about_ca_system_score_codex":0.002965061,"about_ca_system_score_gemma":0.002240301,"threshold_uncertainty_score":0.04878491},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050971188,0.0011694831,0.788856,0.0053534494,0.0005269926,0.00013306517,0.0008597419,0.0011187673,0.1510114],"genre_scores_gemma":[0.8025377,0.00119422,0.1381908,0.000805103,0.00038206257,0.00025284186,0.0005957171,0.00037308707,0.055668406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992131,0.0001724471,0.000048003883,0.00018078918,0.00023031866,0.00015522527],"domain_scores_gemma":[0.9992539,0.00024564052,0.000059944785,0.00017413338,0.000154673,0.00011177885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00113215,0.0006857341,0.00094825035,0.000846156,0.002511418,0.0054306355,0.0023579167,0.0029889045,0.01336447],"category_scores_gemma":[0.0019667007,0.00073565624,0.0017224343,0.0011989407,0.0034880755,0.006009993,0.0022779591,0.0023859912,0.0023506293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014716661,0.000012141297,0.00004077507,0.000009159053,0.0000036939596,0.00008204444,0.00006198528,0.0037271648,0.00033305917,0.9943639,0.00036369797,0.0009877421],"study_design_scores_gemma":[0.000022175995,0.000007573702,0.000027031627,0.000008443566,0.00000838797,0.00005018342,0.00003380981,0.025115365,0.00028322055,0.96980673,0.004626007,0.000011114471],"about_ca_topic_score_codex":0.007074368,"about_ca_topic_score_gemma":0.0036045224,"teacher_disagreement_score":0.01336447,"about_ca_system_score_codex":0.0022672163,"about_ca_system_score_gemma":0.002491547,"threshold_uncertainty_score":0.04470861},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043862067,0.0033838393,0.77645975,0.0023787878,0.0013182465,0.00021161,0.0013372926,0.10671267,0.06433566],"genre_scores_gemma":[0.21877077,0.0015830096,0.72845197,0.0014937961,0.00072708185,0.00042184594,0.0032237913,0.015597804,0.029729975],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976261,0.0004576658,0.00016645764,0.0003458859,0.0011513225,0.00025251],"domain_scores_gemma":[0.99778795,0.00062493223,0.000119551165,0.00075298554,0.0006160552,0.000098599674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014703136,0.0013095788,0.0011519651,0.0013169377,0.00085800694,0.0025466161,0.0029790238,0.000921076,0.02276445],"category_scores_gemma":[0.007714613,0.00096669025,0.0013085576,0.001814368,0.0008813483,0.0051977076,0.003356867,0.0029155016,0.0083141355],"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.0019594242,0.00035743185,0.0021800573,0.0008558275,0.000119315126,0.000347869,0.00030990993,0.044555224,0.03461385,0.10954233,0.108083636,0.69707507],"study_design_scores_gemma":[0.0006008414,0.0004738429,0.001190097,0.0002803976,0.0001767459,0.00061277265,0.00014804436,0.5889725,0.06678921,0.08273824,0.25782564,0.00019168503],"about_ca_topic_score_codex":0.0032163358,"about_ca_topic_score_gemma":0.005804114,"teacher_disagreement_score":0.02276445,"about_ca_system_score_codex":0.0012216711,"about_ca_system_score_gemma":0.0021802657,"threshold_uncertainty_score":0.07615465},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030702246,0.00021523963,0.9634573,0.00017856948,0.000037574726,0.00007627753,0.00006898505,0.0015938889,0.0036698023],"genre_scores_gemma":[0.5799906,0.00048294256,0.4151186,0.00021107012,0.000046246827,0.00017033756,0.0002477898,0.00067798805,0.0030544852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984906,0.00028950226,0.00008287902,0.00013935263,0.00079989573,0.00019782143],"domain_scores_gemma":[0.9953015,0.0022613064,0.00050327484,0.001114683,0.00076179294,0.000057342062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013272334,0.0010432851,0.00046548585,0.0010834881,0.0005490012,0.0011549427,0.0012807638,0.0004913658,0.0025703632],"category_scores_gemma":[0.006951932,0.00057078013,0.00080307404,0.00073943735,0.0011341203,0.0031631887,0.001094944,0.0018854,0.00050522585],"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.00012438894,0.00014714133,0.0028660567,0.00021131002,0.0000620735,0.00019289914,0.00016867793,0.69570774,0.060080957,0.118418224,0.0015528993,0.12046769],"study_design_scores_gemma":[0.0000091035345,0.00005659869,0.00015756815,0.000019024908,0.000021127773,0.0000552637,0.000025977444,0.92598826,0.036850173,0.03461184,0.0021904064,0.00001459716],"about_ca_topic_score_codex":0.0020268192,"about_ca_topic_score_gemma":0.0034862477,"teacher_disagreement_score":0.0025703632,"about_ca_system_score_codex":0.0011831485,"about_ca_system_score_gemma":0.002114231,"threshold_uncertainty_score":0.008598685},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014271436,0.0002460205,0.6825879,0.00020223271,0.00014857494,0.00020103644,0.00082294625,0.29305792,0.008461929],"genre_scores_gemma":[0.23088749,0.0005834609,0.6471886,0.0004897767,0.000102645354,0.00081174576,0.0073986496,0.08867864,0.023859024],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99920565,0.00010042802,0.00006826269,0.00010176078,0.00039946195,0.00012444648],"domain_scores_gemma":[0.9986779,0.00043478762,0.00009792811,0.00031674834,0.0003712499,0.000101354206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008894836,0.0012530665,0.0007778906,0.0016270012,0.0008267309,0.0014344935,0.0038658157,0.0013279073,0.016173748],"category_scores_gemma":[0.004514895,0.0007395169,0.0011188814,0.0012782144,0.00057676976,0.0020149634,0.0021985518,0.0022017611,0.0046205944],"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.0011204131,0.0005453016,0.010073578,0.000983936,0.00029126147,0.0016499229,0.0015192664,0.047265213,0.06395281,0.03804459,0.21879293,0.6157609],"study_design_scores_gemma":[0.00037961252,0.00019511503,0.0024319934,0.00017963735,0.000073078525,0.0007308885,0.00012013067,0.7335463,0.080283,0.019418035,0.16245623,0.00018594868],"about_ca_topic_score_codex":0.0049625486,"about_ca_topic_score_gemma":0.0066752043,"teacher_disagreement_score":0.016173748,"about_ca_system_score_codex":0.0009458975,"about_ca_system_score_gemma":0.002165632,"threshold_uncertainty_score":0.054106593},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26807398,0.0051014395,0.6559928,0.0007962361,0.00011378607,0.00015717218,0.00036859474,0.0035096924,0.06588636],"genre_scores_gemma":[0.6510122,0.001313854,0.33770788,0.00018160974,0.00003420739,0.00025221493,0.000556705,0.00057008787,0.008371247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979883,0.000067072106,0.00000526935,0.000015708076,0.00007415446,0.0000389936],"domain_scores_gemma":[0.99981004,0.00010031105,0.000011283002,0.000038243506,0.000030154764,0.000009986163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021440064,0.0006001733,0.00053975097,0.00049529556,0.00042833504,0.0007540531,0.00077311485,0.00051900995,0.0037112988],"category_scores_gemma":[0.00087773585,0.00035846123,0.00046927767,0.00083925034,0.00035216255,0.0006795294,0.0009841055,0.00083242956,0.0007154943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028764002,0.00010179311,0.0011133148,0.00039041837,0.000066267865,0.00018381461,0.00025866527,0.5484744,0.015359123,0.032668028,0.011530924,0.3895657],"study_design_scores_gemma":[0.000039460403,0.00009311244,0.00026835376,0.000029604827,0.000018255816,0.000075233496,0.000054052143,0.95877784,0.0048661293,0.028886631,0.0068823225,0.000009019875],"about_ca_topic_score_codex":0.0012904044,"about_ca_topic_score_gemma":0.0026201932,"teacher_disagreement_score":0.0037112988,"about_ca_system_score_codex":0.0003471232,"about_ca_system_score_gemma":0.00061792874,"threshold_uncertainty_score":0.012415588},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011812913,0.00066080765,0.91955656,0.0009115789,0.00019282184,0.0002183331,0.00041786217,0.012767988,0.053461116],"genre_scores_gemma":[0.37729937,0.0014613161,0.5806291,0.0003849734,0.00015550238,0.00068334024,0.0013122028,0.0009374475,0.037136752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997204,0.00006571743,0.000019967725,0.000059734288,0.00010847628,0.000025631489],"domain_scores_gemma":[0.99978226,0.000052186846,0.000015854312,0.00006154617,0.000060221388,0.00002795546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030434012,0.0005511653,0.00024968252,0.00041292366,0.000611655,0.0015536981,0.0014667627,0.00077791954,0.015012695],"category_scores_gemma":[0.0009900394,0.00045489508,0.00041563975,0.0005696244,0.00090633647,0.0015670155,0.0010066518,0.00090335123,0.0033299983],"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.00037269984,0.000104582236,0.0009262527,0.00045745776,0.00010960709,0.00051918166,0.00035123125,0.23275335,0.01953955,0.46092728,0.047925696,0.23601313],"study_design_scores_gemma":[0.0001005894,0.00013223212,0.00038287524,0.00007610387,0.000056415047,0.00026104198,0.000046719746,0.60527354,0.009244883,0.16748922,0.21689257,0.000043920794],"about_ca_topic_score_codex":0.0049531274,"about_ca_topic_score_gemma":0.0063773342,"teacher_disagreement_score":0.015012695,"about_ca_system_score_codex":0.0010069502,"about_ca_system_score_gemma":0.001461409,"threshold_uncertainty_score":0.050222397},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004037594,0.00023286478,0.99468,0.00008859344,0.000022191152,0.000015907182,0.000023372724,0.00015114367,0.0007483256],"genre_scores_gemma":[0.6043175,0.0011720642,0.3881772,0.0003008732,0.00016631895,0.00034999647,0.0002923435,0.00043266837,0.0047910046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988223,0.00044874207,0.0000466826,0.00014390612,0.00041144263,0.00012687178],"domain_scores_gemma":[0.9948472,0.0037466409,0.00030872476,0.0003319754,0.00066380115,0.000101788944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029151067,0.00089564675,0.0010355331,0.0011601024,0.0005945771,0.0011656915,0.0017181279,0.0010775062,0.002424934],"category_scores_gemma":[0.0119049605,0.000541583,0.0011362842,0.0009774938,0.0010424461,0.0018402273,0.0010462068,0.0018115521,0.00040365622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002737963,0.000019690722,0.00066213927,0.000062478175,0.00002991641,0.000039458188,0.00004526976,0.93688595,0.0013689828,0.04598172,0.0006600486,0.014216943],"study_design_scores_gemma":[6.7373134e-7,0.0000021116891,0.000026786942,0.0000017373397,9.794641e-7,0.0000029446296,0.000001887698,0.9946808,0.00009546912,0.0050573633,0.00012785954,0.000001366132],"about_ca_topic_score_codex":0.0054287813,"about_ca_topic_score_gemma":0.0025411907,"teacher_disagreement_score":0.0054287813,"about_ca_system_score_codex":0.0014587381,"about_ca_system_score_gemma":0.0013481529,"threshold_uncertainty_score":0.015416682},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18070747,0.0009332976,0.67698455,0.0003775487,0.00023563078,0.00033705874,0.0005665262,0.12507313,0.014784804],"genre_scores_gemma":[0.53583306,0.0005806081,0.4066035,0.000483139,0.00016007929,0.00033813342,0.002569924,0.024058633,0.02937296],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992398,0.00013029309,0.000041377116,0.00016190961,0.00031447463,0.00011224365],"domain_scores_gemma":[0.9957783,0.0012746409,0.00027679765,0.0020262483,0.0004934316,0.00015050104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008831287,0.00092615007,0.0005593712,0.0008676705,0.0004900407,0.0010808607,0.0016278992,0.00049881777,0.006250863],"category_scores_gemma":[0.0048464998,0.0005469773,0.0005478374,0.0007312668,0.0005636136,0.0017055252,0.0013651152,0.0008994203,0.0039597247],"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.00072022213,0.00026406304,0.0045530014,0.00033616848,0.00007368146,0.00094274135,0.0006241744,0.024521982,0.14719503,0.012718274,0.014139873,0.79391074],"study_design_scores_gemma":[0.0002954193,0.00045087666,0.010621551,0.000094068186,0.00011215782,0.0014108687,0.0001574497,0.22424904,0.57752633,0.025739927,0.15920286,0.00013941158],"about_ca_topic_score_codex":0.00096949463,"about_ca_topic_score_gemma":0.00087100454,"teacher_disagreement_score":0.006250863,"about_ca_system_score_codex":0.00040116042,"about_ca_system_score_gemma":0.00065074116,"threshold_uncertainty_score":0.020911217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030974014,0.00047543034,0.9528952,0.00060512853,0.0002775259,0.0000881975,0.00051379047,0.0055771545,0.008593625],"genre_scores_gemma":[0.41509527,0.00037110588,0.57355934,0.000562239,0.000115864575,0.00025213187,0.0011098746,0.00081821094,0.008115897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789137,0.0003115124,0.00013545019,0.00034712304,0.0010083597,0.00030607046],"domain_scores_gemma":[0.9973597,0.0006678452,0.00017038964,0.0010891804,0.0006016362,0.00011130637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008071439,0.0005526746,0.0007612703,0.00051542337,0.00093159784,0.0021356307,0.0017076259,0.0007351748,0.009191922],"category_scores_gemma":[0.0052190563,0.00036386802,0.0006127727,0.0014532087,0.00090470834,0.0025927445,0.0019039016,0.0014192091,0.0017689401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014779264,0.00019552482,0.0033053774,0.000519671,0.00014388732,0.00018889541,0.0002245804,0.20193811,0.03194714,0.37086922,0.044295263,0.3448944],"study_design_scores_gemma":[0.00015323282,0.00013009935,0.00052358635,0.000028137836,0.000036747126,0.00014548609,0.000056655335,0.8016429,0.029554458,0.13016444,0.03752044,0.00004374751],"about_ca_topic_score_codex":0.0064793187,"about_ca_topic_score_gemma":0.009156344,"teacher_disagreement_score":0.009191922,"about_ca_system_score_codex":0.0016849057,"about_ca_system_score_gemma":0.002980045,"threshold_uncertainty_score":0.030750096},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12989043,0.0014531739,0.85048366,0.0010309529,0.0002512875,0.00010957751,0.000082195795,0.006107137,0.0105915265],"genre_scores_gemma":[0.4992951,0.00077995355,0.49393612,0.00025575544,0.000096627155,0.00008646466,0.0001484072,0.00097580196,0.004425749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994898,0.00013749748,0.000022260087,0.00008833706,0.00017862557,0.000083502826],"domain_scores_gemma":[0.99901974,0.00029104156,0.00011108218,0.00031019823,0.00021036433,0.000057561774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005228474,0.000874424,0.0005215341,0.00090431015,0.0009497983,0.00090578216,0.001222572,0.00051222055,0.0023317314],"category_scores_gemma":[0.0020671682,0.00037271032,0.0005626823,0.002131081,0.0007084129,0.001235579,0.00048597483,0.00091050274,0.0004613538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005044841,0.00055139145,0.0051517677,0.00030215303,0.00010994105,0.00025499082,0.00035903466,0.404598,0.14713292,0.034626573,0.008781544,0.3976272],"study_design_scores_gemma":[0.00006083817,0.00016858445,0.0011152341,0.000017324497,0.000039435396,0.00014117052,0.00007237152,0.93113714,0.049828064,0.008788894,0.008600923,0.000029934505],"about_ca_topic_score_codex":0.005528578,"about_ca_topic_score_gemma":0.008227382,"teacher_disagreement_score":0.005528578,"about_ca_system_score_codex":0.0009417861,"about_ca_system_score_gemma":0.0010526403,"threshold_uncertainty_score":0.010992765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008141324,0.00009747202,0.97375226,0.00021051124,0.00006176395,0.00019457935,0.00023582348,0.010315668,0.0069905454],"genre_scores_gemma":[0.10909193,0.00022775332,0.87313575,0.0005715576,0.00006425352,0.0006656921,0.0010285918,0.005334954,0.009879619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910957,0.00020427305,0.000057850986,0.00016024818,0.00030831195,0.00015959633],"domain_scores_gemma":[0.9986873,0.000395976,0.00011197306,0.00048545268,0.0002144535,0.00010483213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014060771,0.0010721684,0.00053149246,0.00048817883,0.0009398015,0.0018088355,0.0036839568,0.0011537672,0.0045200433],"category_scores_gemma":[0.0023027488,0.00068870885,0.0012686339,0.0005567133,0.0014955378,0.0023131466,0.00262231,0.002610263,0.0014041193],"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.0008103189,0.0003544597,0.004037589,0.00070022204,0.00017296706,0.00075040304,0.0010218049,0.22309269,0.03998649,0.5058362,0.0630617,0.16017528],"study_design_scores_gemma":[0.00019666446,0.00016032117,0.0006489303,0.00010143646,0.00005919655,0.00030696564,0.00010059067,0.7520786,0.031107554,0.081938386,0.13318689,0.000114486924],"about_ca_topic_score_codex":0.0052419263,"about_ca_topic_score_gemma":0.0072439034,"teacher_disagreement_score":0.0052419263,"about_ca_system_score_codex":0.00093342277,"about_ca_system_score_gemma":0.0024798207,"threshold_uncertainty_score":0.015120983},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07997777,0.0004080603,0.8926668,0.00027820768,0.0003691985,0.00016669018,0.00010591523,0.013502339,0.012525084],"genre_scores_gemma":[0.53286546,0.00029974006,0.44931045,0.0006919021,0.0000937737,0.00035428963,0.00064095133,0.0032752191,0.012468192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983187,0.00032006236,0.00015840051,0.00027621823,0.00059088256,0.0003358248],"domain_scores_gemma":[0.99764854,0.0005523229,0.00013827931,0.0010882072,0.00044262587,0.00012996311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00191249,0.0006963541,0.000536962,0.0005066654,0.000823523,0.0019199654,0.0031705494,0.000847907,0.0061759185],"category_scores_gemma":[0.004250936,0.0006314086,0.00084220286,0.00040680805,0.001401826,0.003015246,0.005452687,0.0024158715,0.0012231126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016402662,0.0005245114,0.017283708,0.0011996697,0.00038032958,0.0025339003,0.003968205,0.14833109,0.120201476,0.31640577,0.026158247,0.3613728],"study_design_scores_gemma":[0.00029724956,0.0007687674,0.0025080936,0.0002260588,0.00021565866,0.000707273,0.0006979629,0.48902035,0.21389799,0.08654032,0.20494936,0.00017091972],"about_ca_topic_score_codex":0.0018304364,"about_ca_topic_score_gemma":0.0025262032,"teacher_disagreement_score":0.0061759185,"about_ca_system_score_codex":0.0010390768,"about_ca_system_score_gemma":0.0012361913,"threshold_uncertainty_score":0.02066046},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02731985,0.0011125443,0.96342635,0.00026470213,0.000115935305,0.00003057923,0.000030106377,0.00056707894,0.007132802],"genre_scores_gemma":[0.40252477,0.0012974001,0.58556914,0.00013309294,0.00008401691,0.00013419797,0.00012044546,0.00033179365,0.009805128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99992454,0.000017810276,0.0000030891645,0.000014729262,0.000030089703,0.000009798609],"domain_scores_gemma":[0.9998616,0.00008396736,0.000010360978,0.000014353932,0.000021803633,0.000007825024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023514434,0.0005537386,0.000553703,0.0002946662,0.00031645017,0.00050043553,0.00082750653,0.0005320893,0.0017262225],"category_scores_gemma":[0.0005895619,0.00027632882,0.00050523307,0.00047842498,0.00042855312,0.0005592472,0.00035941784,0.000851654,0.00026288143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029057945,0.000032282125,0.0002044826,0.000049294264,0.000035468707,0.000041755462,0.00004054236,0.9099174,0.007872876,0.023491,0.0014555163,0.05683031],"study_design_scores_gemma":[0.000014069102,0.000016565647,0.00011573242,0.000004975328,0.000009136274,0.000020005742,0.000009983397,0.9789971,0.0011033649,0.01829851,0.0014055443,0.0000050215085],"about_ca_topic_score_codex":0.0021997239,"about_ca_topic_score_gemma":0.0034009877,"teacher_disagreement_score":0.0021997239,"about_ca_system_score_codex":0.0006529708,"about_ca_system_score_gemma":0.0004977325,"threshold_uncertainty_score":0.0057747364},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035832366,0.000090974245,0.99423885,0.000047370926,0.000026724325,0.000024857176,0.000052980515,0.0007460211,0.0011889932],"genre_scores_gemma":[0.30629033,0.00044796374,0.6860831,0.00008745293,0.00008331553,0.00016957347,0.0006059395,0.00064602296,0.005586287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949944,0.00011550767,0.000027317075,0.000112166425,0.00018236246,0.00006317954],"domain_scores_gemma":[0.9988243,0.0006368065,0.00006250041,0.00015972249,0.00025669704,0.00005994502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010809602,0.00087761914,0.00085918914,0.0010972872,0.0007165758,0.0012434182,0.0016019745,0.0005351484,0.005203162],"category_scores_gemma":[0.0027210913,0.0006519989,0.0011825997,0.0009265587,0.0007109034,0.0015513211,0.0010323093,0.001513643,0.000688892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019422383,0.000077932,0.00092202576,0.000117858115,0.000081997016,0.000061002105,0.00008059284,0.7943613,0.0063154004,0.068379626,0.0032556618,0.12615234],"study_design_scores_gemma":[0.0000032774317,0.0000038668077,0.000039796294,0.0000037479238,0.000004729505,0.0000056281892,0.0000038815497,0.9835675,0.0009576732,0.014873273,0.00053363567,0.0000029391713],"about_ca_topic_score_codex":0.0051941387,"about_ca_topic_score_gemma":0.005030685,"teacher_disagreement_score":0.005203162,"about_ca_system_score_codex":0.0010865062,"about_ca_system_score_gemma":0.0013547144,"threshold_uncertainty_score":0.017406285},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68234396,0.0014222617,0.30313873,0.0005910188,0.0001492955,0.00031353647,0.00025263522,0.0068531116,0.004935508],"genre_scores_gemma":[0.94166446,0.00015393115,0.056851972,0.000047504087,0.000029211316,0.00007169278,0.00022724614,0.000140765,0.00081320544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978149,0.0005945903,0.00018355176,0.00024953493,0.00090892747,0.00024857203],"domain_scores_gemma":[0.99392456,0.0015016242,0.00042256634,0.0024929997,0.0013629737,0.0002953876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025558406,0.00051581534,0.00069655385,0.000493236,0.0012729603,0.0014617306,0.0019941544,0.00092847995,0.0007053189],"category_scores_gemma":[0.0071699545,0.00035730857,0.00037777098,0.0009457326,0.0007133088,0.0024184023,0.0014001649,0.0008095622,0.00024499264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027562678,0.0012414437,0.015177564,0.0004877343,0.00028729,0.0014399562,0.00070044707,0.48285982,0.25266546,0.02120314,0.012703368,0.20847753],"study_design_scores_gemma":[0.00013549729,0.00035724734,0.0017014848,0.0000071187096,0.000046538436,0.0002756361,0.0001337353,0.96076035,0.031088514,0.0034827872,0.0019690623,0.000041968422],"about_ca_topic_score_codex":0.0055262474,"about_ca_topic_score_gemma":0.0075624646,"teacher_disagreement_score":0.0055262474,"about_ca_system_score_codex":0.00082537514,"about_ca_system_score_gemma":0.0018079411,"threshold_uncertainty_score":0.013516784},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5638905,0.0005539489,0.4232897,0.00028421887,0.00009573181,0.0001139781,0.00018634374,0.007728644,0.003856931],"genre_scores_gemma":[0.91961163,0.0001137869,0.07869204,0.000052249678,0.00002405245,0.00003186912,0.00015464085,0.00011775602,0.0012020016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952877,0.00008708944,0.000028314627,0.000071587005,0.00020800003,0.00007612857],"domain_scores_gemma":[0.997755,0.0010156097,0.00016461589,0.00050416385,0.00045426725,0.00010636086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083956594,0.00069085974,0.0005088814,0.0005979679,0.0002773299,0.0005335977,0.00087930623,0.00028793284,0.0007929867],"category_scores_gemma":[0.0028941184,0.00031522618,0.0002231124,0.00069488736,0.00029706524,0.00094170077,0.00066160224,0.0008196887,0.00028302424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074943603,0.00038091495,0.027922457,0.00017329692,0.00014255996,0.00031788307,0.00020238892,0.29979417,0.10018741,0.0023463727,0.0020430863,0.56574],"study_design_scores_gemma":[0.000032046682,0.00031597662,0.003651061,0.0000118283715,0.0000622543,0.000114449256,0.000030234665,0.9261687,0.06619317,0.0015622486,0.0018292322,0.00002883004],"about_ca_topic_score_codex":0.0026246407,"about_ca_topic_score_gemma":0.005110174,"teacher_disagreement_score":0.0026246407,"about_ca_system_score_codex":0.00022874166,"about_ca_system_score_gemma":0.0008467444,"threshold_uncertainty_score":0.0052186847},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11014057,0.0021406894,0.7381595,0.00088988285,0.0003860426,0.0010108381,0.0037474832,0.06083823,0.08268677],"genre_scores_gemma":[0.48555395,0.00050736073,0.45329842,0.00059564965,0.00011451675,0.00056785863,0.006466388,0.0010277337,0.051868163],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993548,0.00010512893,0.000034284283,0.00010283907,0.0002367877,0.00016615128],"domain_scores_gemma":[0.9994004,0.00005784614,0.000049374157,0.00018865742,0.00019290012,0.00011096586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052924914,0.00047621236,0.0005935472,0.0006063175,0.0009717192,0.0010640515,0.0026077267,0.0006389679,0.011632495],"category_scores_gemma":[0.00093048275,0.0003752273,0.00049264444,0.0008301317,0.00053530786,0.0015466787,0.0018122378,0.000703739,0.0030711915],"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.0031677696,0.00049611717,0.003241563,0.000637464,0.00025107295,0.0007036199,0.0004169458,0.11574424,0.06392636,0.0649034,0.19384046,0.552671],"study_design_scores_gemma":[0.0013088709,0.0015310001,0.0025665632,0.00008100041,0.00013253487,0.00052959804,0.00021044898,0.6121999,0.05996953,0.040090144,0.2811047,0.00027575053],"about_ca_topic_score_codex":0.006890424,"about_ca_topic_score_gemma":0.010769774,"teacher_disagreement_score":0.011632495,"about_ca_system_score_codex":0.0007457432,"about_ca_system_score_gemma":0.0016188703,"threshold_uncertainty_score":0.03891462},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72423047,0.0029755647,0.25815806,0.0010716335,0.00023050587,0.00027966537,0.00016961285,0.0010797584,0.0118046645],"genre_scores_gemma":[0.8371094,0.00057631754,0.15949239,0.00024164599,0.0000386555,0.00017706971,0.00024132035,0.00012356626,0.0019997577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860615,0.00072528253,0.000061979306,0.00013770278,0.0003011218,0.00016771529],"domain_scores_gemma":[0.9936521,0.0052569,0.00022997167,0.00023612524,0.00049108366,0.00013387686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030125913,0.0010646731,0.0010600317,0.0021594923,0.00049427967,0.00095745036,0.0012708077,0.0021224257,0.0010817322],"category_scores_gemma":[0.0076983203,0.000311717,0.00073188235,0.0014119678,0.0008057722,0.00084505574,0.00047577493,0.0008465649,0.00014915757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034322028,0.00019906565,0.0010931536,0.00007902774,0.00006744867,0.00004460879,0.00003141633,0.9590039,0.0009665797,0.0019053224,0.00039961236,0.035866596],"study_design_scores_gemma":[0.00005257488,0.00027698345,0.00044428156,0.0000104609335,0.000033598924,0.000022206643,0.000032275457,0.9969618,0.0010898958,0.000672542,0.00039367357,0.000009768598],"about_ca_topic_score_codex":0.0098630255,"about_ca_topic_score_gemma":0.0068237935,"teacher_disagreement_score":0.0098630255,"about_ca_system_score_codex":0.0018608662,"about_ca_system_score_gemma":0.0016893792,"threshold_uncertainty_score":0.01961124},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15676126,0.0024634793,0.8218133,0.0005284096,0.00033041494,0.0001056536,0.00027091568,0.009744904,0.0079818135],"genre_scores_gemma":[0.7687551,0.0006513633,0.22273421,0.000064202475,0.00015842255,0.00013361832,0.00057631277,0.00034567786,0.006581068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995821,0.00012228507,0.000025689216,0.00005683769,0.00012944473,0.00008362228],"domain_scores_gemma":[0.9989629,0.00045547826,0.000057963865,0.00031962412,0.00015797529,0.00004594034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057230843,0.0006375903,0.0007202966,0.0008163537,0.00086704775,0.00071970373,0.0015302546,0.0005748519,0.002381589],"category_scores_gemma":[0.0019161452,0.00044906986,0.00027874892,0.001280945,0.00038837275,0.0014503043,0.0008507866,0.0007539622,0.0005384068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013453319,0.00024532745,0.0021392526,0.000271831,0.000081020844,0.0001441386,0.00020881816,0.51248753,0.03619839,0.024469197,0.022001473,0.4004077],"study_design_scores_gemma":[0.000025708101,0.00008563183,0.00028877132,0.000007824857,0.000016585516,0.0000238913,0.000016010152,0.9762412,0.011161816,0.009938489,0.0021834564,0.0000106346115],"about_ca_topic_score_codex":0.0029780779,"about_ca_topic_score_gemma":0.0033672238,"teacher_disagreement_score":0.0029780779,"about_ca_system_score_codex":0.0005333658,"about_ca_system_score_gemma":0.0006710747,"threshold_uncertainty_score":0.007967234},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08272333,0.0015185057,0.8807287,0.00047577734,0.0004216107,0.000053759664,0.000094266245,0.0022747866,0.031709306],"genre_scores_gemma":[0.7904061,0.0011826744,0.1960626,0.00037466967,0.00017216767,0.00016973073,0.00017074363,0.0009458626,0.010515461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914837,0.00018664017,0.000053436805,0.00015045823,0.00036380332,0.00009728572],"domain_scores_gemma":[0.99632215,0.0019551874,0.00040550443,0.00071999186,0.0004934459,0.00010364872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010083632,0.00044449882,0.00037643613,0.00039342573,0.0005326188,0.000982372,0.00073933013,0.0004723294,0.00520252],"category_scores_gemma":[0.005499861,0.0003316164,0.00042993962,0.0003424059,0.0008235764,0.003081525,0.00094151916,0.0006691084,0.0009758682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080084155,0.00012957312,0.004026157,0.00088915083,0.00010763892,0.00023594058,0.00066049554,0.29490742,0.10130978,0.36992317,0.007778811,0.21923104],"study_design_scores_gemma":[0.00014073886,0.00055523944,0.0014730766,0.00010060312,0.00013359931,0.00036206457,0.00021950409,0.63175666,0.10611735,0.18881257,0.07026872,0.000059948907],"about_ca_topic_score_codex":0.00044946902,"about_ca_topic_score_gemma":0.00067389343,"teacher_disagreement_score":0.00520252,"about_ca_system_score_codex":0.00049227854,"about_ca_system_score_gemma":0.0003985395,"threshold_uncertainty_score":0.017404199},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043905945,0.8861781,0.026575673,0.007982617,0.0032766296,0.000033798642,0.00013186267,0.00046769518,0.07096303],"genre_scores_gemma":[0.073637016,0.8177003,0.055079073,0.0023636639,0.0055571455,0.000110787805,0.00033893055,0.00028662328,0.044926334],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995763,0.00008138478,0.000021422116,0.00007169323,0.00018674681,0.00006244965],"domain_scores_gemma":[0.9991301,0.00047697738,0.00003766599,0.000083187726,0.00018458732,0.0000874909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017300706,0.00065806555,0.0009189122,0.0009531294,0.00059416675,0.0029721188,0.0012322336,0.0011211429,0.008698588],"category_scores_gemma":[0.0015677812,0.0005325804,0.00049208687,0.0025719858,0.0014759395,0.004271494,0.0012869831,0.001942487,0.003643388],"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.0002117223,0.00026984815,0.00038821812,0.0020325382,0.000032010805,0.00005799007,0.00015176013,0.003581717,0.0017112122,0.15625808,0.059709862,0.77559495],"study_design_scores_gemma":[0.00006863772,0.0001751342,0.00041891524,0.0006788809,0.000028988576,0.00026409948,0.00008030135,0.0062628193,0.0015631544,0.16508195,0.8253512,0.00002591503],"about_ca_topic_score_codex":0.00065089285,"about_ca_topic_score_gemma":0.00074929505,"teacher_disagreement_score":0.008698588,"about_ca_system_score_codex":0.00089154835,"about_ca_system_score_gemma":0.0014926234,"threshold_uncertainty_score":0.029099643},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13859804,0.0011157497,0.8411887,0.001379077,0.00031452172,0.00013216826,0.00012034632,0.001431503,0.015719857],"genre_scores_gemma":[0.936344,0.0002442183,0.05843344,0.00012128982,0.00009826462,0.0001478552,0.00006544312,0.000074446936,0.004471115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860257,0.00058773457,0.000059964816,0.0001971454,0.00040598473,0.00014667842],"domain_scores_gemma":[0.9943575,0.0029446217,0.00045586776,0.001408143,0.00061114464,0.00022268033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020797944,0.00046780516,0.0005490245,0.00033191562,0.0008284982,0.0018542673,0.0016166175,0.0011909816,0.0037715305],"category_scores_gemma":[0.0062508513,0.00043318752,0.0004924996,0.00046642573,0.001679135,0.0027442663,0.0013557064,0.0017343698,0.00045832078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005367832,0.00020663618,0.003758756,0.00012062215,0.00007922417,0.0005724235,0.0004491911,0.6702146,0.009760295,0.28247428,0.0033121656,0.02851504],"study_design_scores_gemma":[0.000043810738,0.00005156921,0.000112044945,0.0000063686794,0.000014751695,0.000051391195,0.000019824995,0.951659,0.0014079906,0.044413853,0.0022123333,0.0000070729334],"about_ca_topic_score_codex":0.0022899474,"about_ca_topic_score_gemma":0.0018749001,"teacher_disagreement_score":0.0037715305,"about_ca_system_score_codex":0.0014941016,"about_ca_system_score_gemma":0.0014598825,"threshold_uncertainty_score":0.012617052},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02068732,0.0003071904,0.9666417,0.00020161108,0.00012307911,0.00008349772,0.00012901066,0.001130555,0.010695998],"genre_scores_gemma":[0.15054476,0.00033068247,0.8393167,0.00008918474,0.00007863742,0.00021174437,0.00040665639,0.001181787,0.007839901],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991536,0.00031546393,0.000044593628,0.00006620699,0.00035236505,0.000067860994],"domain_scores_gemma":[0.99860674,0.0006728937,0.000076004835,0.00029281483,0.00031417713,0.0000374174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012179299,0.0009174061,0.0012414231,0.0008231527,0.0010566878,0.0012684248,0.0018687653,0.00070464873,0.007493893],"category_scores_gemma":[0.003772862,0.00057008094,0.0008256198,0.0014492915,0.0010239991,0.0018058118,0.0014651513,0.001674586,0.0023491648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026335425,0.00019006268,0.00041594525,0.0004093475,0.000060365255,0.00014777244,0.00032634253,0.13686086,0.013533281,0.36024335,0.01624712,0.4713022],"study_design_scores_gemma":[0.000037127324,0.000060597507,0.00016257676,0.000032044478,0.000017452781,0.00005779289,0.000065028,0.78260034,0.009143356,0.19929557,0.008508188,0.000019824063],"about_ca_topic_score_codex":0.0016110314,"about_ca_topic_score_gemma":0.0033274072,"teacher_disagreement_score":0.007493893,"about_ca_system_score_codex":0.0006362349,"about_ca_system_score_gemma":0.0012028917,"threshold_uncertainty_score":0.025069535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19740123,0.0030588896,0.7313936,0.0008040146,0.00030397982,0.0003108954,0.0009012442,0.035865046,0.029961197],"genre_scores_gemma":[0.7596632,0.00079975027,0.22844642,0.00028488846,0.00006935583,0.0004014316,0.0013283659,0.0031573472,0.0058491677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993523,0.0001482843,0.000021675089,0.00008283862,0.0002722735,0.00012266198],"domain_scores_gemma":[0.9994566,0.00014812184,0.000037458463,0.0002016204,0.00009596968,0.00006031481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005784318,0.0007591202,0.00079349463,0.0006123789,0.0007294025,0.0014274102,0.0023051153,0.0006292324,0.0024024278],"category_scores_gemma":[0.0020295389,0.0004577545,0.0004271916,0.0012958173,0.00092372036,0.0013924497,0.0022656485,0.0013441631,0.0007919982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013808719,0.00033093296,0.0057937284,0.00058034697,0.00022972711,0.0006806499,0.00045865285,0.29940146,0.0760998,0.08494279,0.09754571,0.43255526],"study_design_scores_gemma":[0.00021232036,0.00014863344,0.0011736078,0.00003450116,0.000036962945,0.0001864473,0.0000617116,0.90204763,0.03763474,0.021280563,0.037121043,0.00006189077],"about_ca_topic_score_codex":0.003255795,"about_ca_topic_score_gemma":0.0038456167,"teacher_disagreement_score":0.003255795,"about_ca_system_score_codex":0.0006575681,"about_ca_system_score_gemma":0.0017212492,"threshold_uncertainty_score":0.0080369115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03270888,0.003477824,0.9265023,0.00033984787,0.00043242014,0.00005847389,0.00022101852,0.003279891,0.032979466],"genre_scores_gemma":[0.3840268,0.003374014,0.56888115,0.00020367779,0.00037370998,0.0001059547,0.0007003518,0.0013445864,0.04098979],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994925,0.000069434354,0.000043085474,0.00011308722,0.00018484368,0.00009699651],"domain_scores_gemma":[0.99942833,0.00015785171,0.00004373721,0.000254511,0.00008892345,0.000026695461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039172106,0.0007364794,0.0008240043,0.0009211484,0.000840965,0.0019804651,0.0011588146,0.00037634323,0.009292942],"category_scores_gemma":[0.0018776549,0.00055285,0.0005958229,0.0024050416,0.0010929389,0.0040372876,0.0020663233,0.0013329528,0.003464174],"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.0006418756,0.00009441031,0.000546083,0.00033945055,0.000048455677,0.00009858437,0.0002261121,0.019671101,0.015287793,0.341741,0.018622555,0.6026826],"study_design_scores_gemma":[0.00021527511,0.00024278865,0.0005660207,0.00014924689,0.00010514619,0.0006733622,0.00014357355,0.15727016,0.06524391,0.66824675,0.10705049,0.000093322866],"about_ca_topic_score_codex":0.0006607613,"about_ca_topic_score_gemma":0.0012713827,"teacher_disagreement_score":0.009292942,"about_ca_system_score_codex":0.0007068848,"about_ca_system_score_gemma":0.0007560728,"threshold_uncertainty_score":0.031087935},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043800075,0.001220908,0.52535826,0.0003708455,0.00069149287,0.0006261215,0.00453458,0.40680262,0.016595138],"genre_scores_gemma":[0.3300302,0.0014244275,0.51956403,0.00094317325,0.00039631367,0.0010485515,0.027880209,0.061728176,0.056984913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900585,0.000099107914,0.00011216762,0.00022155816,0.0003986153,0.00016267816],"domain_scores_gemma":[0.9971635,0.0007246348,0.00016476183,0.0012194946,0.0005906135,0.00013692743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008996376,0.0014859926,0.0014675718,0.0034081973,0.0009771776,0.0027392101,0.0028178524,0.0009043671,0.033049602],"category_scores_gemma":[0.005178816,0.0011202871,0.0014485898,0.0030042457,0.0005764716,0.0039244895,0.0032619766,0.0012674617,0.013372966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010304889,0.0003098719,0.0029422266,0.00063935894,0.00009258872,0.00064598676,0.00030166635,0.002894855,0.043723173,0.008478652,0.098949276,0.83999175],"study_design_scores_gemma":[0.0006473266,0.00044228957,0.0064572254,0.00029358946,0.00035612655,0.0021023515,0.0005010746,0.16001675,0.5201726,0.029474895,0.27908745,0.0004482771],"about_ca_topic_score_codex":0.0031058101,"about_ca_topic_score_gemma":0.0033807503,"teacher_disagreement_score":0.033049602,"about_ca_system_score_codex":0.0010913996,"about_ca_system_score_gemma":0.0013840233,"threshold_uncertainty_score":0.11056197},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016644321,0.0009757703,0.8403405,0.0002918099,0.000831377,0.00021991998,0.0012757054,0.11524678,0.02417388],"genre_scores_gemma":[0.13507135,0.00074837636,0.7910408,0.00042884157,0.00047274356,0.0005186121,0.005522938,0.016032543,0.05016377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949276,0.000054130538,0.000033269633,0.00008247516,0.00025156394,0.00008579398],"domain_scores_gemma":[0.99947184,0.00007423095,0.000022448097,0.00018950511,0.00016734313,0.00007463727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057707384,0.0009907122,0.00107341,0.00067394733,0.0009776228,0.0012452507,0.0033194718,0.0006893783,0.014900756],"category_scores_gemma":[0.0012311565,0.0009130764,0.0008046658,0.0012044355,0.00036582412,0.0011159346,0.0016204363,0.002161723,0.008602935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017684427,0.0005220831,0.0016011464,0.00053775165,0.00032686171,0.00037312874,0.00033758205,0.070550114,0.07352867,0.04542507,0.19292986,0.6120993],"study_design_scores_gemma":[0.00065656065,0.00034175607,0.0019588703,0.000056401932,0.00027457872,0.00027128326,0.00006434635,0.6742888,0.06260932,0.04078991,0.21851294,0.0001751696],"about_ca_topic_score_codex":0.0039662845,"about_ca_topic_score_gemma":0.0058665425,"teacher_disagreement_score":0.014900756,"about_ca_system_score_codex":0.0006576189,"about_ca_system_score_gemma":0.0017688189,"threshold_uncertainty_score":0.04984796},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30235854,0.009923567,0.64790505,0.0006135683,0.00039260392,0.0000498309,0.00021680098,0.003330247,0.035209805],"genre_scores_gemma":[0.90775496,0.0010523313,0.07600404,0.00014182452,0.000071187394,0.00005422313,0.00018209082,0.00041053354,0.014328769],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998043,0.000024783541,0.000009906324,0.000033614037,0.00007251406,0.000054961045],"domain_scores_gemma":[0.9996295,0.00010811456,0.00003647915,0.00009073423,0.000089828995,0.00004531581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002582417,0.00029268838,0.000419331,0.00033167744,0.0004527358,0.00078385806,0.0013037105,0.00028132537,0.0033137423],"category_scores_gemma":[0.00091118837,0.00032276096,0.00025550363,0.00085818605,0.0004559322,0.00096458255,0.0009155833,0.0008505175,0.00042526753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010420135,0.00025575058,0.004184535,0.0005493317,0.0001300147,0.00041460927,0.00075280084,0.30085987,0.094712585,0.15523143,0.020707918,0.42115918],"study_design_scores_gemma":[0.00004057263,0.00019897262,0.0012430057,0.000049023733,0.000045376095,0.00017434676,0.00012136742,0.9032226,0.025844932,0.05114146,0.017886207,0.000032206557],"about_ca_topic_score_codex":0.003114187,"about_ca_topic_score_gemma":0.008011998,"teacher_disagreement_score":0.0033137423,"about_ca_system_score_codex":0.000818665,"about_ca_system_score_gemma":0.00092815625,"threshold_uncertainty_score":0.01108557},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10104072,0.002881637,0.8149676,0.0031783567,0.00053485646,0.00017171606,0.00024386833,0.0054404116,0.071540885],"genre_scores_gemma":[0.7308619,0.0014527529,0.25522342,0.00072854164,0.00021360572,0.00017451722,0.00041644106,0.00049058447,0.010438251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994305,0.000088027315,0.000029006189,0.00008258998,0.00025169348,0.00011816982],"domain_scores_gemma":[0.9992855,0.00016382395,0.000039366594,0.00028926367,0.00013955605,0.00008246342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006951907,0.00054269214,0.00048325447,0.0003586638,0.0008342882,0.001986161,0.0012828276,0.0005162737,0.0036046167],"category_scores_gemma":[0.0016120203,0.00028807038,0.00036269828,0.00049121334,0.0007360784,0.0033268158,0.0029477389,0.0013097628,0.000981637],"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.00069616985,0.0002526112,0.0037009264,0.00039755044,0.00015189397,0.0010891485,0.0009419841,0.13923442,0.20334311,0.3160096,0.03682623,0.29735634],"study_design_scores_gemma":[0.00009836568,0.00022416638,0.0014503611,0.000087327855,0.00006721557,0.00056141894,0.00044214644,0.56919163,0.079394266,0.16236033,0.18602486,0.00009789037],"about_ca_topic_score_codex":0.0011141766,"about_ca_topic_score_gemma":0.0017529024,"teacher_disagreement_score":0.0036046167,"about_ca_system_score_codex":0.00062016485,"about_ca_system_score_gemma":0.0005316614,"threshold_uncertainty_score":0.012058675},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002820736,0.00021266646,0.9414178,0.0013251855,0.000332132,0.00015345002,0.000085215135,0.0025171116,0.051135667],"genre_scores_gemma":[0.072979674,0.00041802123,0.86012244,0.00065837294,0.00028167435,0.00041183506,0.00023431463,0.00133683,0.06355686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982804,0.00031549952,0.00006697024,0.00030670763,0.00081570674,0.00021472479],"domain_scores_gemma":[0.9985537,0.00032288034,0.000048100475,0.0007151243,0.00029093825,0.00006932297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001055291,0.0015465145,0.00086502807,0.0011683912,0.0023022583,0.0027658239,0.002440267,0.0013127244,0.03232716],"category_scores_gemma":[0.00429514,0.0008261884,0.00076656777,0.0017677702,0.0021215896,0.0039237477,0.0042377505,0.0034927956,0.009594855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018486648,0.00015752428,0.00027533283,0.00020819416,0.0000266102,0.00012414911,0.00026734982,0.007406032,0.007752401,0.671278,0.034568585,0.27775106],"study_design_scores_gemma":[0.0001054289,0.00010336518,0.00017607323,0.000076325305,0.00003791906,0.0005003238,0.00016798862,0.0859899,0.018286098,0.6956767,0.1988391,0.000040819134],"about_ca_topic_score_codex":0.0011647186,"about_ca_topic_score_gemma":0.002840479,"teacher_disagreement_score":0.03232716,"about_ca_system_score_codex":0.00089358917,"about_ca_system_score_gemma":0.001535437,"threshold_uncertainty_score":0.10814506},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11558932,0.0016896551,0.87509197,0.00027571342,0.00002630867,0.00006373894,0.000064913074,0.00041727477,0.006781081],"genre_scores_gemma":[0.8553683,0.00080861885,0.13964733,0.00004643837,0.00003084401,0.00007814806,0.00006913255,0.00017755986,0.0037737465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975246,0.000079062105,0.000008422898,0.00004117839,0.00008444457,0.000034326884],"domain_scores_gemma":[0.9995659,0.00026128363,0.00007309702,0.000028797978,0.000060172708,0.000010833841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052535394,0.00088246504,0.00041983658,0.00055042276,0.00032848874,0.0006006666,0.00054256,0.0003217597,0.0019202296],"category_scores_gemma":[0.0015856616,0.00031203905,0.00023102819,0.00062486087,0.00049192907,0.0012421014,0.00032325985,0.0003233671,0.00027023326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007267021,0.000029308043,0.0003274835,0.00008697991,0.000016479187,0.000022364786,0.00002646544,0.93168503,0.012868524,0.0062067322,0.00036601268,0.048291888],"study_design_scores_gemma":[0.000011223047,0.000053026793,0.00023712686,0.000005357018,0.0000105876625,0.000020109414,0.000009871338,0.9828876,0.008974202,0.0066881296,0.0010966768,0.000006017339],"about_ca_topic_score_codex":0.0014393212,"about_ca_topic_score_gemma":0.0028055909,"teacher_disagreement_score":0.0019202296,"about_ca_system_score_codex":0.00096366525,"about_ca_system_score_gemma":0.000504776,"threshold_uncertainty_score":0.0069918633},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016630554,0.00086119195,0.96336925,0.00015358739,0.00010133854,0.00012496322,0.00012840603,0.031694293,0.0019038578],"genre_scores_gemma":[0.047251232,0.0014865878,0.9364038,0.00025324358,0.00017553753,0.0005310463,0.0011504608,0.007992184,0.0047559016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682367,0.0007544764,0.00022557621,0.00047775687,0.001389644,0.00032894785],"domain_scores_gemma":[0.99696654,0.0011408338,0.0003215317,0.0006716671,0.0006190541,0.0002803893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004008669,0.0015117797,0.0014714104,0.0019631016,0.0011982049,0.0033252763,0.0056613362,0.0019554584,0.004849196],"category_scores_gemma":[0.009115269,0.0016639592,0.0018975134,0.0014316482,0.0022945462,0.0044764094,0.0027832016,0.0038355521,0.0038771897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069587765,0.0002752055,0.0019174104,0.0018583062,0.00019941438,0.00035602422,0.00060711964,0.07303986,0.041364435,0.26971722,0.049183622,0.5607855],"study_design_scores_gemma":[0.00035252454,0.00035667655,0.00084130734,0.0004806227,0.00013797163,0.0006490279,0.00008642653,0.51726544,0.05970053,0.100962155,0.31891844,0.0002489852],"about_ca_topic_score_codex":0.0044658626,"about_ca_topic_score_gemma":0.0031865796,"teacher_disagreement_score":0.0056613362,"about_ca_system_score_codex":0.0019750372,"about_ca_system_score_gemma":0.0039931447,"threshold_uncertainty_score":0.02120012},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08574498,0.00050375995,0.8834399,0.00025435627,0.00015150013,0.0003019435,0.0030202977,0.023543676,0.0030395668],"genre_scores_gemma":[0.54531616,0.00039318026,0.44545254,0.00011634895,0.000106827385,0.0004384365,0.0047959564,0.0006401866,0.0027403012],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842167,0.00024535003,0.00016150961,0.0002682878,0.0007897049,0.00011345784],"domain_scores_gemma":[0.9940708,0.0012197258,0.001098113,0.0015508931,0.0018542227,0.00020619889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012480809,0.0014043768,0.0009285436,0.0027699498,0.00042627717,0.0007843045,0.0010073963,0.00061478274,0.001729058],"category_scores_gemma":[0.009504261,0.00034547973,0.00055939466,0.0023961985,0.00034823903,0.0013514361,0.00079287146,0.0011169757,0.0014207318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000872599,0.00040845855,0.03912833,0.00044273955,0.00017503065,0.00041257672,0.000213164,0.24320485,0.10336741,0.013849299,0.015815767,0.58210987],"study_design_scores_gemma":[0.00002040911,0.00014951908,0.0036539389,0.000017992263,0.000028690365,0.00020328313,0.000032312648,0.9317372,0.048681285,0.0069106175,0.008526856,0.000037920363],"about_ca_topic_score_codex":0.0027018583,"about_ca_topic_score_gemma":0.0018080935,"teacher_disagreement_score":0.0027699498,"about_ca_system_score_codex":0.00072291144,"about_ca_system_score_gemma":0.0016205882,"threshold_uncertainty_score":0.0066005588},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21372448,0.0024387527,0.7581179,0.00034987312,0.00027361914,0.00010565056,0.00015781676,0.018344877,0.0064870487],"genre_scores_gemma":[0.69306487,0.00038048392,0.29824996,0.00027449094,0.0000868552,0.000110330584,0.0003412041,0.0017153117,0.00577652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953679,0.0010349767,0.00024568907,0.0008393823,0.0018499382,0.00066209544],"domain_scores_gemma":[0.99478036,0.0013608747,0.00078744977,0.002017914,0.0007117911,0.00034168514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029178758,0.00086569344,0.0013391892,0.001564195,0.0014559882,0.004224583,0.0033749954,0.0012848385,0.0015885109],"category_scores_gemma":[0.007044574,0.00107611,0.00063767756,0.0014299422,0.0022208993,0.0063723717,0.004359119,0.0017766696,0.00096439733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002886678,0.000506543,0.035163116,0.0007451298,0.00021377867,0.0015793829,0.0029510248,0.07083375,0.13881682,0.21082665,0.016593557,0.51888365],"study_design_scores_gemma":[0.00013847974,0.0007246588,0.010115913,0.00022760751,0.00022081925,0.0015797977,0.00060935214,0.5637439,0.20786113,0.15419888,0.060228333,0.0003512197],"about_ca_topic_score_codex":0.0029713644,"about_ca_topic_score_gemma":0.0026867494,"teacher_disagreement_score":0.004224583,"about_ca_system_score_codex":0.0010848515,"about_ca_system_score_gemma":0.0020096037,"threshold_uncertainty_score":0.0154313445},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009407977,0.09371428,0.4301898,0.0139155695,0.09428839,0.0012134665,0.0029649818,0.014084395,0.34022114],"genre_scores_gemma":[0.04060813,0.057469673,0.24121,0.003477605,0.021402828,0.0010578797,0.010567463,0.007153397,0.6170529],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99729186,0.0005202268,0.00026482603,0.00043927287,0.0012890518,0.00019464409],"domain_scores_gemma":[0.9961655,0.00084199675,0.00017438384,0.0008116918,0.0015554088,0.00045108958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027496885,0.001910284,0.0017028756,0.0019779548,0.0012093253,0.0056183287,0.0022024894,0.0013846305,0.12898104],"category_scores_gemma":[0.006114105,0.0008526752,0.0016306255,0.0020905898,0.0011270344,0.0038448148,0.0022932135,0.004537111,0.06990568],"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.00027054924,0.00014719223,0.00066582527,0.0009424459,0.00017241469,0.00030828695,0.00017381832,0.0026703563,0.0064986176,0.02345263,0.54506814,0.41962972],"study_design_scores_gemma":[0.00003460079,0.00011833317,0.00064581505,0.00024435073,0.000049182658,0.0005450063,0.00004959838,0.0044954405,0.0022877199,0.011521988,0.9799778,0.000030121406],"about_ca_topic_score_codex":0.0013033864,"about_ca_topic_score_gemma":0.0015707703,"teacher_disagreement_score":0.12898104,"about_ca_system_score_codex":0.001017678,"about_ca_system_score_gemma":0.0022792642,"threshold_uncertainty_score":0.43148458},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073802806,0.003198183,0.34820646,0.0008346747,0.0012926129,0.00041812874,0.04838431,0.54016644,0.050118946],"genre_scores_gemma":[0.071870826,0.0040107225,0.49226153,0.003587452,0.00054732343,0.0032989073,0.14210267,0.20502648,0.07729411],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99839765,0.0001975894,0.00014399865,0.00040501592,0.0006509171,0.00020479984],"domain_scores_gemma":[0.99841106,0.00043494304,0.0001465819,0.0003436195,0.0005439612,0.00011985387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014825354,0.0022824144,0.001967873,0.0018951776,0.0016055423,0.003995192,0.00567943,0.0021088317,0.10687457],"category_scores_gemma":[0.004706433,0.0016641604,0.002458785,0.0013763136,0.0006122272,0.003466514,0.0031644157,0.0031381142,0.083665],"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.00089470885,0.00024803242,0.002749623,0.0028142247,0.00034561174,0.000479268,0.00042224218,0.008651628,0.030830389,0.03217252,0.7657375,0.15465426],"study_design_scores_gemma":[0.00024336534,0.000111157766,0.0014425047,0.0003866553,0.00014433834,0.0006512807,0.00011235722,0.04403132,0.03888224,0.022383703,0.8913927,0.00021841607],"about_ca_topic_score_codex":0.0040622223,"about_ca_topic_score_gemma":0.0041441275,"teacher_disagreement_score":0.10687457,"about_ca_system_score_codex":0.0011754541,"about_ca_system_score_gemma":0.0025680072,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6128128,0.024251757,0.28201768,0.0094766,0.00053089525,0.00010321819,0.00016900014,0.00069932465,0.069938675],"genre_scores_gemma":[0.9614732,0.0030525636,0.031261615,0.00026483627,0.000120940094,0.00004810821,0.000065333385,0.00024764208,0.003465711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985423,0.00060921686,0.000071307484,0.000092386515,0.00056912174,0.00011572117],"domain_scores_gemma":[0.98708457,0.011084412,0.00030741296,0.0008178723,0.00056401873,0.00014165542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00246993,0.00051614264,0.00076867046,0.0006368755,0.00092776946,0.001651526,0.0008196571,0.00082156155,0.0023432348],"category_scores_gemma":[0.01949689,0.0004152944,0.00026108723,0.0016020035,0.0014571921,0.0031796515,0.0014705788,0.0009628012,0.0003998459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008742855,0.0004794019,0.010327404,0.00058329024,0.00009646117,0.0002876756,0.0004992009,0.5966152,0.0129877115,0.13463667,0.0045532715,0.23805942],"study_design_scores_gemma":[0.000043163775,0.00011576611,0.0019099289,0.00005771243,0.000024456938,0.00008548465,0.00015887358,0.9362153,0.0060613705,0.051510368,0.0037958664,0.000021622232],"about_ca_topic_score_codex":0.0016806425,"about_ca_topic_score_gemma":0.0023143962,"teacher_disagreement_score":0.00246993,"about_ca_system_score_codex":0.00068973046,"about_ca_system_score_gemma":0.0006180197,"threshold_uncertainty_score":0.013062358},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9160025,0.00047812902,0.080669306,0.00006007725,0.00002501051,0.0001443843,0.00021510552,0.0015205874,0.0008848944],"genre_scores_gemma":[0.9595911,0.00021283873,0.03925223,0.00001288576,0.000012584117,0.0001319844,0.0002928096,0.00020214547,0.000291472],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.996653,0.0011411005,0.00026260808,0.00040019606,0.0012760125,0.00026706734],"domain_scores_gemma":[0.9729462,0.01658215,0.0026447477,0.004414541,0.003079443,0.00033286226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016901329,0.00074158434,0.0006752595,0.0015251,0.0004477339,0.0005323437,0.000839244,0.000546385,0.0007773434],"category_scores_gemma":[0.017270677,0.00032105707,0.00028961804,0.001008358,0.00056783855,0.0011286035,0.00055855553,0.0006635123,0.00010421641],"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.003535455,0.0008777121,0.037904114,0.0013409784,0.00028064605,0.0007911823,0.001113004,0.12517177,0.53669775,0.0027979955,0.00086979516,0.2886197],"study_design_scores_gemma":[0.0001732982,0.0045541143,0.0472764,0.00011278019,0.00029276946,0.0011374038,0.00038268892,0.30993497,0.6309075,0.0022008433,0.0028483747,0.0001789301],"about_ca_topic_score_codex":0.00057869294,"about_ca_topic_score_gemma":0.00057250046,"teacher_disagreement_score":0.0016901329,"about_ca_system_score_codex":0.000427491,"about_ca_system_score_gemma":0.0005889693,"threshold_uncertainty_score":0.008938372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0879349,0.0011320348,0.88002235,0.000288247,0.00015266737,0.00013150349,0.00043946278,0.017317913,0.012580917],"genre_scores_gemma":[0.55208975,0.00064213964,0.43058044,0.00033355967,0.00010486917,0.00018069395,0.0008520739,0.010047619,0.0051688286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973014,0.0006572613,0.00018867261,0.00032727266,0.0012032875,0.00032220304],"domain_scores_gemma":[0.99139893,0.0042823567,0.00077186764,0.0026653556,0.0007957726,0.00008574352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002204342,0.0015807027,0.00096640526,0.0013160908,0.00077937124,0.0018102679,0.0012767732,0.0008232975,0.0037858675],"category_scores_gemma":[0.008247003,0.0010165176,0.0015809136,0.0014206918,0.001000502,0.0029885932,0.0015423644,0.0019029315,0.0012244956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011119564,0.00036916204,0.012129902,0.0007773464,0.0002725953,0.00054564385,0.0007263778,0.16997835,0.23055552,0.041189045,0.009028528,0.5333156],"study_design_scores_gemma":[0.00013735182,0.00041710312,0.0075933584,0.00019936392,0.00038642323,0.0006058094,0.00012540922,0.48207858,0.39893612,0.07772395,0.0315517,0.0002448479],"about_ca_topic_score_codex":0.0010386478,"about_ca_topic_score_gemma":0.002177158,"teacher_disagreement_score":0.0037858675,"about_ca_system_score_codex":0.0007204706,"about_ca_system_score_gemma":0.0012084225,"threshold_uncertainty_score":0.012665033},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040997297,0.00011529308,0.9535281,0.000207322,0.000032528278,0.00008088088,0.000081298014,0.0005884706,0.004368772],"genre_scores_gemma":[0.43199357,0.00017694903,0.56327236,0.00021910324,0.000025371386,0.00031370742,0.00032723372,0.00016410231,0.0035076197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994622,0.00023634949,0.000026156627,0.00006762208,0.00015481889,0.00005281149],"domain_scores_gemma":[0.9987224,0.0008768274,0.00012612347,0.000118849835,0.00011893521,0.000036960933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064860407,0.000720053,0.0006200195,0.00039852486,0.00045220595,0.0007400136,0.0008440961,0.000851252,0.0019453096],"category_scores_gemma":[0.0023220973,0.0005114438,0.00062001735,0.00090906164,0.00073744263,0.0006906139,0.001189216,0.0008832096,0.00029927347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006612547,0.00004297625,0.0006079289,0.00010406608,0.000033425054,0.00015236737,0.00012622403,0.9173122,0.006602729,0.014290649,0.0017039196,0.058957465],"study_design_scores_gemma":[0.000021399714,0.000031115054,0.0000976891,0.0000047916124,0.0000059618133,0.000035550675,0.00003809374,0.9896818,0.002349502,0.0062025315,0.0015248464,0.000006809215],"about_ca_topic_score_codex":0.0029178385,"about_ca_topic_score_gemma":0.0040934277,"teacher_disagreement_score":0.0029178385,"about_ca_system_score_codex":0.0005020435,"about_ca_system_score_gemma":0.00078975875,"threshold_uncertainty_score":0.0065077543},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6604649,0.014489868,0.17124988,0.0042095073,0.0010015903,0.00007738202,0.00064150506,0.0060867677,0.14177866],"genre_scores_gemma":[0.9685988,0.0017831718,0.022122707,0.00020273839,0.00018599637,0.000029449397,0.00029662673,0.0004305946,0.006349878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992329,0.00015524712,0.000022227447,0.00008279262,0.00038936385,0.000117438176],"domain_scores_gemma":[0.99822,0.00084039336,0.00007660839,0.00026874474,0.0005201928,0.00007406264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089340855,0.0004933634,0.00039957312,0.00052224495,0.0005438689,0.0012588396,0.0007434563,0.00059301674,0.0054999604],"category_scores_gemma":[0.0053247246,0.0002561424,0.00015335796,0.00088158436,0.00049352855,0.002826048,0.00069133594,0.00090187887,0.001608053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021049199,0.0002470532,0.0076036705,0.00036501323,0.000094512805,0.00046651566,0.00035266607,0.41597882,0.055638503,0.11209034,0.037720457,0.36733752],"study_design_scores_gemma":[0.00008146328,0.00031044174,0.0040409556,0.000086953805,0.000075747914,0.00014707184,0.00008444233,0.91382426,0.027136398,0.03504421,0.01911733,0.000050780352],"about_ca_topic_score_codex":0.002406992,"about_ca_topic_score_gemma":0.002097591,"teacher_disagreement_score":0.0054999604,"about_ca_system_score_codex":0.00069333613,"about_ca_system_score_gemma":0.0006154748,"threshold_uncertainty_score":0.018399179},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20477325,0.0045535965,0.7806756,0.0007584298,0.00015375834,0.0001112123,0.000032225747,0.0013513449,0.007590706],"genre_scores_gemma":[0.8581809,0.0015867271,0.13641483,0.00012708757,0.00007293189,0.00009885025,0.00004419238,0.00012299155,0.0033515205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982315,0.00003637844,0.000013198789,0.00004402249,0.000058843412,0.000024395395],"domain_scores_gemma":[0.999622,0.000103619386,0.000077223274,0.0000763383,0.00009356965,0.00002726449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004550599,0.00028237226,0.0002505969,0.00028536798,0.00044586655,0.0006855335,0.00045276925,0.00021195124,0.00082193903],"category_scores_gemma":[0.0011472633,0.0001756407,0.00025535116,0.00027274867,0.00023831733,0.0006472533,0.00040856507,0.00043386678,0.00018208426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020159947,0.00018543878,0.004353019,0.00024690593,0.00006320631,0.00010575702,0.00040802895,0.314594,0.18879622,0.04143142,0.004126897,0.44548756],"study_design_scores_gemma":[0.000031736614,0.00021382264,0.0014131702,0.000035895617,0.000056473564,0.00009128529,0.000079852834,0.93967336,0.034152683,0.012045655,0.012181905,0.00002410674],"about_ca_topic_score_codex":0.0010172282,"about_ca_topic_score_gemma":0.0017374074,"teacher_disagreement_score":0.0010172282,"about_ca_system_score_codex":0.00052698166,"about_ca_system_score_gemma":0.0010036295,"threshold_uncertainty_score":0.0038235188},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077867615,0.000113593356,0.9644591,0.00020791327,0.00020305939,0.00026338804,0.00017786512,0.015971666,0.01081656],"genre_scores_gemma":[0.06748211,0.00025345,0.9048208,0.0005458271,0.000101257814,0.0006095631,0.0009703842,0.0052908123,0.019925766],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99825436,0.0003563394,0.00017943727,0.00027888644,0.00076611724,0.00016481674],"domain_scores_gemma":[0.99748695,0.00080471346,0.00023390305,0.00061568996,0.00069454504,0.00016416129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023398898,0.0007816408,0.000533373,0.0007503151,0.0007881844,0.001899709,0.0031488906,0.0007636244,0.0065001235],"category_scores_gemma":[0.0038444423,0.00078624074,0.00080585975,0.0005846301,0.0012344267,0.002239377,0.0025545075,0.0022025148,0.0030932878],"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.00094173546,0.00059114845,0.0035921792,0.0011390083,0.00024921648,0.00073307956,0.001682027,0.061269995,0.06807913,0.30460748,0.07963553,0.47747943],"study_design_scores_gemma":[0.00041010103,0.00044874873,0.0007820464,0.00015544776,0.0001335508,0.0006810672,0.00016083995,0.4175677,0.11989379,0.048404478,0.4112018,0.00016048188],"about_ca_topic_score_codex":0.0010202194,"about_ca_topic_score_gemma":0.0019583334,"teacher_disagreement_score":0.0065001235,"about_ca_system_score_codex":0.000654716,"about_ca_system_score_gemma":0.0022491994,"threshold_uncertainty_score":0.021745086},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15736915,0.0026534912,0.81886417,0.00032863475,0.00066212454,0.00027027034,0.0002564184,0.002900109,0.016695667],"genre_scores_gemma":[0.6197991,0.0009593511,0.3611931,0.00009836931,0.00022589919,0.00013628199,0.0004954187,0.0004630003,0.01662952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993349,0.00012908952,0.00003666459,0.00017030377,0.00015349274,0.00017558316],"domain_scores_gemma":[0.9985512,0.00031983203,0.00008739186,0.00058040355,0.00025521833,0.00020592149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011754637,0.00073527044,0.0010674665,0.0005209394,0.0009709473,0.001214925,0.002407536,0.0006121172,0.008485347],"category_scores_gemma":[0.0021525186,0.0006370418,0.0005175479,0.0013689935,0.00072078273,0.0018324789,0.0017141472,0.0008005568,0.0012012876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003693213,0.000379036,0.002460778,0.00047399433,0.00018217608,0.00055840454,0.0007464889,0.40006465,0.06809453,0.046497587,0.019392023,0.45745707],"study_design_scores_gemma":[0.00034304624,0.00073160866,0.0020867565,0.00006837788,0.00017931544,0.00043054033,0.00048337498,0.8802054,0.03040381,0.053542,0.031457443,0.00006836373],"about_ca_topic_score_codex":0.0049186232,"about_ca_topic_score_gemma":0.0065503675,"teacher_disagreement_score":0.008485347,"about_ca_system_score_codex":0.0011179135,"about_ca_system_score_gemma":0.0009981965,"threshold_uncertainty_score":0.028386295},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16591063,0.0014977908,0.78399193,0.0008831885,0.00041631275,0.00027574992,0.00038142139,0.008422403,0.03822061],"genre_scores_gemma":[0.77169925,0.00028023004,0.20997798,0.0003517768,0.00009865786,0.00009437642,0.00015282631,0.00013903757,0.017205942],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997328,0.000035281366,0.000017078535,0.000056075474,0.0001035396,0.000055262204],"domain_scores_gemma":[0.99972564,0.0000699843,0.000041284875,0.000039318784,0.00009988591,0.000023900619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021955986,0.00027749126,0.00028057347,0.0002505176,0.0005573948,0.0006087503,0.0010850856,0.00039080554,0.0043485714],"category_scores_gemma":[0.0004083877,0.00020486621,0.00018031575,0.00018813131,0.00029987496,0.00061253447,0.00040406644,0.00037892966,0.0014915442],"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.00089714845,0.00014609715,0.0013213987,0.00052824145,0.000054652373,0.00054812594,0.00018850024,0.03203108,0.61270607,0.027128853,0.012649936,0.31179994],"study_design_scores_gemma":[0.00025734943,0.001967962,0.0017612086,0.000062516236,0.00016581852,0.0016242664,0.0000914877,0.40454417,0.49052393,0.006018817,0.092861034,0.00012143545],"about_ca_topic_score_codex":0.0013148285,"about_ca_topic_score_gemma":0.0028929366,"teacher_disagreement_score":0.0043485714,"about_ca_system_score_codex":0.00054326066,"about_ca_system_score_gemma":0.00074770686,"threshold_uncertainty_score":0.014547408},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052002897,0.000117303105,0.98783,0.00029127614,0.00006295625,0.0001885512,0.00008204938,0.000974399,0.0052531534],"genre_scores_gemma":[0.12455882,0.0005730693,0.865538,0.00032879898,0.00007723314,0.0009084892,0.00037801353,0.0006145123,0.007023083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942305,0.002408634,0.0005936246,0.00050759426,0.001845197,0.00041445112],"domain_scores_gemma":[0.99502003,0.00244483,0.00035448308,0.0008828398,0.0010783707,0.00021937804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068567735,0.00081687386,0.0005289095,0.0008362732,0.0020685596,0.0030887653,0.0017309124,0.0013285347,0.005186848],"category_scores_gemma":[0.010554671,0.0012048928,0.0012185421,0.0011728677,0.0027745017,0.004848064,0.0031616748,0.002068353,0.00166927],"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.00008585357,0.000051855863,0.00057427,0.00037410323,0.000036340905,0.00043147642,0.0021102873,0.038309664,0.0075603114,0.90780526,0.003522829,0.039137803],"study_design_scores_gemma":[0.0001680767,0.00014757119,0.0001150426,0.00021322836,0.000087694156,0.00039097364,0.0007774242,0.2000546,0.028752856,0.60330963,0.16589704,0.00008589522],"about_ca_topic_score_codex":0.0039370395,"about_ca_topic_score_gemma":0.006108941,"teacher_disagreement_score":0.0068567735,"about_ca_system_score_codex":0.0013586481,"about_ca_system_score_gemma":0.0035315342,"threshold_uncertainty_score":0.036262512},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9596712,0.0003279376,0.031408973,0.0005620642,0.000031575022,0.000303304,0.00059756316,0.0015456448,0.005551709],"genre_scores_gemma":[0.92485034,0.00026258634,0.069165155,0.00012052523,0.000015139836,0.00017657851,0.0006495171,0.00034047925,0.0044197813],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998946,0.00035978257,0.000054153577,0.00013994331,0.00034878345,0.00015130555],"domain_scores_gemma":[0.99605954,0.0023486016,0.00025145168,0.00042811738,0.0006441505,0.0002681506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001319112,0.000710646,0.00033630262,0.0007213053,0.0011033829,0.00062025915,0.001302746,0.0011229246,0.0013798454],"category_scores_gemma":[0.0049219923,0.0002801271,0.00037302246,0.0013431106,0.0006706276,0.00094225,0.0006037177,0.0007997204,0.00035866446],"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.004828845,0.0048156413,0.11736897,0.0029195421,0.000292412,0.041841533,0.016267786,0.20979212,0.15731044,0.034430433,0.04320171,0.36693063],"study_design_scores_gemma":[0.00070537446,0.0046384563,0.0746336,0.00026016825,0.0002887376,0.013210456,0.008099754,0.55295753,0.22407535,0.012338373,0.10861343,0.00017878134],"about_ca_topic_score_codex":0.0065460466,"about_ca_topic_score_gemma":0.011617521,"teacher_disagreement_score":0.0065460466,"about_ca_system_score_codex":0.00073078356,"about_ca_system_score_gemma":0.000658526,"threshold_uncertainty_score":0.013015926},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04728313,0.0019661807,0.9127112,0.0053612753,0.00013900016,0.0002032683,0.0008794399,0.00034950738,0.031107066],"genre_scores_gemma":[0.8363093,0.0040054214,0.1356103,0.0014119671,0.0007760137,0.000932679,0.0015822974,0.00024589497,0.019126114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816376,0.0004727429,0.00009570634,0.0003586384,0.00060288835,0.00030625972],"domain_scores_gemma":[0.99449265,0.0040653218,0.00047435262,0.0005000458,0.00023460132,0.00023302573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013045942,0.0013370394,0.001383178,0.0009369432,0.0011790685,0.0024850671,0.0026320056,0.0027614974,0.006722607],"category_scores_gemma":[0.0065987115,0.00077075866,0.002255291,0.0015524058,0.0025375674,0.005666793,0.0023029242,0.003850865,0.0005373299],"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.00006678872,0.00010069515,0.0002971108,0.00024073043,0.000055023527,0.00029627708,0.00020309228,0.23417084,0.0008245328,0.751618,0.0038190333,0.008307771],"study_design_scores_gemma":[0.000031023785,0.000025391631,0.0001003507,0.000024012335,0.000017424172,0.000100859004,0.000042694297,0.24400169,0.00031888144,0.75211483,0.0032102407,0.00001268874],"about_ca_topic_score_codex":0.0022779992,"about_ca_topic_score_gemma":0.0019468756,"teacher_disagreement_score":0.006722607,"about_ca_system_score_codex":0.002116817,"about_ca_system_score_gemma":0.0010850246,"threshold_uncertainty_score":0.02248931},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046294253,0.2519181,0.5508045,0.012836907,0.009598768,0.0006114398,0.00089808885,0.0064242827,0.120613635],"genre_scores_gemma":[0.2878421,0.14080976,0.37811148,0.007087825,0.0073489007,0.0011265684,0.002238263,0.0017272984,0.17370783],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927205,0.0000705429,0.00003712538,0.00011066206,0.00040111973,0.00010849476],"domain_scores_gemma":[0.999062,0.00022224251,0.00009224597,0.00011326188,0.0003660178,0.00014419318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073243637,0.0006502638,0.00095199404,0.0008751166,0.0005975486,0.0023996616,0.0016659558,0.0013766171,0.022703016],"category_scores_gemma":[0.0019739603,0.0004482938,0.00053384673,0.0017751397,0.0004440175,0.0038797376,0.0018377501,0.0023558482,0.0059477496],"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.0004579403,0.00011626189,0.001570202,0.0010003672,0.000047374542,0.00021520577,0.0002642317,0.0028299724,0.040926114,0.066813596,0.07183705,0.81392175],"study_design_scores_gemma":[0.00007284208,0.0002888253,0.0016179498,0.00020589255,0.00008333914,0.00080408796,0.00011690126,0.01990785,0.015090152,0.025960982,0.93579996,0.000051222803],"about_ca_topic_score_codex":0.00054500595,"about_ca_topic_score_gemma":0.0011743881,"teacher_disagreement_score":0.022703016,"about_ca_system_score_codex":0.00076251914,"about_ca_system_score_gemma":0.00084718585,"threshold_uncertainty_score":0.07594919},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2943552,0.05640486,0.50551254,0.027718335,0.0006281899,0.0001167085,0.0004137571,0.0052104313,0.10964001],"genre_scores_gemma":[0.81928426,0.028245147,0.13494614,0.001693934,0.0002539727,0.000087991546,0.00046915282,0.0002931217,0.014726329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996886,0.000057365465,0.000011544015,0.000031534655,0.00017930135,0.000031595795],"domain_scores_gemma":[0.9992873,0.00027224954,0.00006604985,0.000079886406,0.00023611171,0.000058529313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004761649,0.00034994096,0.00028803686,0.0003451342,0.00027518254,0.0014021317,0.00088843453,0.00066767423,0.0033121235],"category_scores_gemma":[0.0015702103,0.0002133893,0.00020742377,0.0007892061,0.00093537604,0.0025875338,0.00036951512,0.0011594406,0.0005991617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038954135,0.00014043965,0.0060529606,0.0007105759,0.000029902894,0.00020531136,0.000510527,0.08577375,0.031903293,0.55197006,0.011120848,0.3111928],"study_design_scores_gemma":[0.000050762374,0.00068947114,0.0023884021,0.00025655233,0.000055526318,0.0006794729,0.0004910161,0.5023629,0.025367092,0.31347162,0.15412663,0.000060529117],"about_ca_topic_score_codex":0.0021028887,"about_ca_topic_score_gemma":0.002242678,"teacher_disagreement_score":0.0033121235,"about_ca_system_score_codex":0.0012336217,"about_ca_system_score_gemma":0.0013071931,"threshold_uncertainty_score":0.011080086},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00848024,0.00017625009,0.9794,0.00016781902,0.00008277931,0.00006383976,0.00009463238,0.0058379294,0.00569643],"genre_scores_gemma":[0.1426382,0.00039302916,0.84537417,0.0001501685,0.00010043163,0.00034695782,0.0005103942,0.001313111,0.009173443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988939,0.00018399522,0.00004437809,0.00012101632,0.0006129736,0.0001436248],"domain_scores_gemma":[0.99907035,0.00026101916,0.00006110322,0.00022542538,0.0003302758,0.000051938252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006892255,0.0006344951,0.00089615554,0.0008052694,0.0013231284,0.001026087,0.0017872842,0.0006529637,0.0041187857],"category_scores_gemma":[0.0028448042,0.0003996544,0.00076603616,0.0014122677,0.00066956866,0.0013871856,0.0021120934,0.0014351119,0.0021762054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036315867,0.00026104035,0.0025567077,0.0003247473,0.000223279,0.00058591814,0.0005298185,0.26678598,0.017780846,0.17085458,0.02363769,0.5160963],"study_design_scores_gemma":[0.00011271964,0.000082445666,0.00057422,0.00002866654,0.000045111185,0.00025954397,0.0000681293,0.8581821,0.017628329,0.07815748,0.0448,0.00006127139],"about_ca_topic_score_codex":0.003878809,"about_ca_topic_score_gemma":0.003950404,"teacher_disagreement_score":0.0041187857,"about_ca_system_score_codex":0.00043496874,"about_ca_system_score_gemma":0.0015244938,"threshold_uncertainty_score":0.013778746},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1152037,0.0073241717,0.8277973,0.0031805846,0.00043640047,0.00014873926,0.00031451805,0.0009795999,0.044614978],"genre_scores_gemma":[0.9137734,0.003439971,0.06844861,0.00042716536,0.00015396962,0.00020568293,0.0003588087,0.00021574367,0.012976671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951696,0.000110608664,0.000018636845,0.000069917,0.00019956895,0.0000843578],"domain_scores_gemma":[0.99872476,0.0005711567,0.00017300394,0.00023239828,0.00022475974,0.00007389058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006287915,0.0007523664,0.0005778317,0.00044606166,0.0004118475,0.0011373406,0.0011983408,0.0014524776,0.004024643],"category_scores_gemma":[0.0038374441,0.0005483666,0.00066172075,0.00047426307,0.00090519025,0.004989591,0.00075156736,0.0013911824,0.0008873639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000874059,0.000107346554,0.0025456988,0.00041554836,0.000119928714,0.00025282067,0.00033777705,0.7244588,0.013378233,0.23103257,0.0048346096,0.022429226],"study_design_scores_gemma":[0.000011105061,0.00004443253,0.000584019,0.000028535895,0.00001819309,0.000113629634,0.0000541275,0.86193234,0.0015555588,0.12818696,0.0074530235,0.00001809636],"about_ca_topic_score_codex":0.0033576093,"about_ca_topic_score_gemma":0.0026073733,"teacher_disagreement_score":0.004024643,"about_ca_system_score_codex":0.0010045331,"about_ca_system_score_gemma":0.0012003839,"threshold_uncertainty_score":0.013463795},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14062203,0.29226473,0.30426002,0.029029477,0.0016541578,0.00037020168,0.0010687626,0.0072851786,0.2234455],"genre_scores_gemma":[0.8017617,0.06110289,0.089323394,0.0019026152,0.0006443518,0.00015672809,0.000680624,0.0008278827,0.04359971],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972741,0.00078475865,0.0002259387,0.0002898837,0.0011848214,0.00024053804],"domain_scores_gemma":[0.9911911,0.0042774184,0.0011234155,0.0014859947,0.0016825765,0.00023937746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028530362,0.00083083636,0.0005381054,0.0043873475,0.0010927775,0.0027853504,0.0012004348,0.0014365577,0.0038298757],"category_scores_gemma":[0.021998815,0.0005563733,0.0003607188,0.004023063,0.0028575025,0.006411235,0.0029000607,0.0020466452,0.0007604909],"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.00016000068,0.00008175246,0.0091294665,0.00049621565,0.000023100702,0.00060027814,0.00456881,0.0045659505,0.0013212707,0.26865253,0.035319373,0.67508125],"study_design_scores_gemma":[0.00006153682,0.0001807147,0.012479557,0.0019300036,0.000111477144,0.0063721384,0.0038437946,0.024482874,0.0077349967,0.5862642,0.35642308,0.000115593335],"about_ca_topic_score_codex":0.0026411617,"about_ca_topic_score_gemma":0.0015275867,"teacher_disagreement_score":0.0043873475,"about_ca_system_score_codex":0.001456063,"about_ca_system_score_gemma":0.0011605213,"threshold_uncertainty_score":0.015088499},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12491224,0.00032552046,0.8666167,0.00014395156,0.000015864562,0.00006572205,0.000095402946,0.0006063044,0.0072184005],"genre_scores_gemma":[0.6524146,0.0002845233,0.3435029,0.000053047144,0.000008574285,0.0001546326,0.000098955235,0.00012231956,0.0033604628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997564,0.00008630627,0.000011210387,0.000039219063,0.000057051104,0.000049846207],"domain_scores_gemma":[0.9997501,0.00015278276,0.00003640625,0.000025419975,0.000025576086,0.000009720595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047263788,0.00049324706,0.00044786197,0.00058741757,0.00035223755,0.00082482083,0.00066636654,0.00044484364,0.0027302087],"category_scores_gemma":[0.0012057917,0.0004416893,0.0002812819,0.00069951743,0.0004603215,0.0013167997,0.000616323,0.0003309008,0.00023590626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016914695,0.000043969827,0.0005837287,0.00013522054,0.000018164661,0.00012848843,0.00007903624,0.8797578,0.012749746,0.031025492,0.0008471591,0.07446196],"study_design_scores_gemma":[0.00002398871,0.00006632414,0.00009966084,0.000011446595,0.000012628559,0.000035790967,0.000029592062,0.9752237,0.009666031,0.013077454,0.0017460659,0.000007308417],"about_ca_topic_score_codex":0.0016573273,"about_ca_topic_score_gemma":0.0027674155,"teacher_disagreement_score":0.0027302087,"about_ca_system_score_codex":0.0007858805,"about_ca_system_score_gemma":0.0007996392,"threshold_uncertainty_score":0.009133518},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03606163,0.00016514769,0.8734244,0.00033319354,0.00051442394,0.00021220435,0.0020014104,0.044796314,0.042491324],"genre_scores_gemma":[0.1595289,0.00024572856,0.7943303,0.00029322284,0.0001632529,0.000530509,0.005602953,0.006803911,0.032501154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994702,0.00009703968,0.00003542312,0.000090593545,0.00024028365,0.00006651902],"domain_scores_gemma":[0.9986381,0.0001644812,0.00007292004,0.00045380532,0.0006323847,0.00003821828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061871577,0.0009439825,0.00057090964,0.00043136624,0.0003744524,0.00064422726,0.0017900433,0.00034176485,0.017124383],"category_scores_gemma":[0.0024040388,0.00043698394,0.001170873,0.00076459395,0.00027209573,0.0008090606,0.001029644,0.001170771,0.0051841745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086933776,0.00032801283,0.005686792,0.00083018944,0.00015646027,0.0008711536,0.0004073237,0.18576974,0.064829,0.056841496,0.09879408,0.58461654],"study_design_scores_gemma":[0.00012289628,0.00015597629,0.002080263,0.000056233614,0.000046525813,0.00039052038,0.00002958235,0.7089694,0.055171527,0.0082988385,0.22463046,0.000047791436],"about_ca_topic_score_codex":0.004249027,"about_ca_topic_score_gemma":0.004553952,"teacher_disagreement_score":0.017124383,"about_ca_system_score_codex":0.00059634354,"about_ca_system_score_gemma":0.0011002126,"threshold_uncertainty_score":0.0572868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1613885,0.00058977184,0.82918334,0.00065695524,0.00004300925,0.00007675378,0.00016078229,0.00026276906,0.007638102],"genre_scores_gemma":[0.9419437,0.00041146326,0.053659864,0.00005316274,0.000030365,0.00015501643,0.00011953224,0.00011439038,0.0035124624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993222,0.0001705672,0.000022073404,0.00005716414,0.00032759257,0.000100444704],"domain_scores_gemma":[0.99812585,0.0012736641,0.00023816257,0.00010275198,0.000190394,0.000069091344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010535371,0.000745507,0.0005611577,0.0006098932,0.00037621355,0.0009808779,0.0010088149,0.0006735441,0.0021095183],"category_scores_gemma":[0.0049283295,0.00040050302,0.00045713465,0.0006730093,0.00084848295,0.0015655376,0.0004940609,0.0008075244,0.00015101803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003213008,0.000011137999,0.00013371994,0.000029511397,0.000007855334,0.000038286234,0.000017605613,0.96518356,0.00096099655,0.030362343,0.00017020608,0.0030526516],"study_design_scores_gemma":[0.000004186634,0.000008853559,0.000042371386,0.0000019882045,0.0000038223275,0.000008145212,0.000003900542,0.98725533,0.00043496228,0.0120375175,0.00019681042,0.0000021166045],"about_ca_topic_score_codex":0.0036967425,"about_ca_topic_score_gemma":0.0018215489,"teacher_disagreement_score":0.0036967425,"about_ca_system_score_codex":0.0016842225,"about_ca_system_score_gemma":0.0010369166,"threshold_uncertainty_score":0.012219906},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13478486,0.004003395,0.762728,0.00078465266,0.00069797336,0.00054617546,0.0015012902,0.04014571,0.054808002],"genre_scores_gemma":[0.44562235,0.00088241405,0.5021895,0.00093313295,0.0003096479,0.00036987587,0.0022234889,0.0011953912,0.046274167],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997806,0.000026195396,0.000013517555,0.000048808375,0.000084726955,0.0000461933],"domain_scores_gemma":[0.999863,0.000021279275,0.000014957269,0.000031374173,0.000049760376,0.000019701012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016418718,0.00050556543,0.0003138677,0.0003662558,0.00035222815,0.00057425746,0.0012991156,0.00031531454,0.015006176],"category_scores_gemma":[0.00027648616,0.0002984981,0.0001976072,0.00042197618,0.00014108581,0.0006489145,0.0003668404,0.00056366756,0.0059844926],"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.0007672951,0.00025348004,0.0016336258,0.00056203385,0.00006341072,0.0005189313,0.00010977381,0.0033760278,0.55121267,0.01628134,0.05628693,0.36893454],"study_design_scores_gemma":[0.00024772334,0.0023446102,0.00653628,0.000091687805,0.0001946449,0.0029309683,0.00008586723,0.10078565,0.5460002,0.0033762436,0.33725938,0.00014678352],"about_ca_topic_score_codex":0.00055662025,"about_ca_topic_score_gemma":0.0009242094,"teacher_disagreement_score":0.015006176,"about_ca_system_score_codex":0.0003850576,"about_ca_system_score_gemma":0.00034027378,"threshold_uncertainty_score":0.0502007},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8252683,0.000250249,0.16376485,0.00026924437,0.000019821022,0.0000820029,0.0009166232,0.0024650085,0.006964044],"genre_scores_gemma":[0.9815595,0.00008902976,0.01768496,0.000011873668,0.000004636644,0.000035156838,0.00030807251,0.00004062315,0.00026603136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966395,0.000056998626,0.000013929842,0.00005552591,0.00017308275,0.000036585625],"domain_scores_gemma":[0.999405,0.00013292137,0.00007262669,0.00015147994,0.00019048153,0.000047442645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003358177,0.00029033187,0.000219758,0.00055951625,0.00038743994,0.00044297392,0.00052754476,0.00036669036,0.0006586086],"category_scores_gemma":[0.0017891268,0.00018852817,0.00013519192,0.00074325857,0.00021811143,0.0008068444,0.00040419932,0.00043239645,0.00023824326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020435665,0.00020161846,0.031908162,0.0001413755,0.00005185605,0.00016004352,0.00024998264,0.77211756,0.12499634,0.009615941,0.0018487907,0.05850395],"study_design_scores_gemma":[0.0000074924683,0.000059371316,0.0088800015,0.000004605555,0.000006169217,0.000043490534,0.00002499062,0.9693717,0.018247494,0.0016035051,0.0017345069,0.00001677135],"about_ca_topic_score_codex":0.0036875478,"about_ca_topic_score_gemma":0.0031277568,"teacher_disagreement_score":0.0036875478,"about_ca_system_score_codex":0.00077400904,"about_ca_system_score_gemma":0.0005639645,"threshold_uncertainty_score":0.007332206},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09451538,0.00019253037,0.7968129,0.00026290547,0.00014074353,0.00019265011,0.0004036907,0.100161575,0.0073175733],"genre_scores_gemma":[0.57409656,0.00016730685,0.40349624,0.00038092228,0.000069966714,0.00037119462,0.0019712108,0.013885618,0.005560994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838865,0.00031838234,0.00016049351,0.00032981005,0.00050499046,0.0002977461],"domain_scores_gemma":[0.9958112,0.0011524403,0.00025022967,0.0014226411,0.0010739523,0.0002895358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017744403,0.001167475,0.00067564804,0.00074298884,0.001008711,0.0018955492,0.0044493764,0.000701416,0.0038345396],"category_scores_gemma":[0.0063997083,0.0008672556,0.00075118465,0.0007642257,0.0010458571,0.0022409651,0.0023977014,0.0018246389,0.001402147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002888749,0.00083554763,0.020073157,0.000654533,0.00019179584,0.0009833043,0.0019442077,0.24705058,0.18436162,0.035994347,0.064822026,0.4402001],"study_design_scores_gemma":[0.00021650484,0.00011602668,0.0013777964,0.000026591604,0.000026633788,0.00008731933,0.00010134283,0.9078927,0.060659293,0.014388467,0.015037412,0.00006997795],"about_ca_topic_score_codex":0.005811953,"about_ca_topic_score_gemma":0.011140714,"teacher_disagreement_score":0.005811953,"about_ca_system_score_codex":0.0025697115,"about_ca_system_score_gemma":0.0030945954,"threshold_uncertainty_score":0.01864463},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09367658,0.00014033401,0.8876166,0.00015619061,0.000053560478,0.00012455833,0.000062402556,0.0009666309,0.017203152],"genre_scores_gemma":[0.7857048,0.00013482192,0.19992839,0.00009001784,0.00007299516,0.00027481752,0.00011239039,0.00033506792,0.013346728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993272,0.00014435544,0.000051304938,0.00010632445,0.00027402185,0.00009676521],"domain_scores_gemma":[0.9985526,0.0006151686,0.00023773758,0.00026523086,0.00027799857,0.000051279647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064872677,0.00033126283,0.00035059446,0.00045711827,0.00047637688,0.00094028556,0.0003945553,0.0002985613,0.00330624],"category_scores_gemma":[0.0024465898,0.0002565386,0.0004160207,0.00034321132,0.001162617,0.0014667755,0.0010702314,0.00048474784,0.0004917385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019971227,0.00006644065,0.0023706283,0.0001787347,0.000040152016,0.0010899114,0.00082112645,0.08213493,0.032868017,0.81263167,0.0014899317,0.066108756],"study_design_scores_gemma":[0.00008288178,0.0001192012,0.0007715503,0.000041913612,0.000063844585,0.00059660705,0.00016333415,0.33530357,0.030503985,0.59685904,0.03546891,0.000025202484],"about_ca_topic_score_codex":0.0009729067,"about_ca_topic_score_gemma":0.001695419,"teacher_disagreement_score":0.00330624,"about_ca_system_score_codex":0.00037717988,"about_ca_system_score_gemma":0.00079929415,"threshold_uncertainty_score":0.011060476},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10651227,0.0009933482,0.8534992,0.00042706827,0.00032674806,0.00013015783,0.00021765592,0.02363991,0.014253698],"genre_scores_gemma":[0.30402997,0.00057221804,0.6759777,0.00021865651,0.00011180863,0.0001834316,0.000926239,0.007203905,0.010776126],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983885,0.0003089589,0.00012572134,0.0001816908,0.0007715238,0.00022363829],"domain_scores_gemma":[0.99844176,0.00030978824,0.0001872637,0.00045911712,0.00054494734,0.0000572381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010153014,0.00070555956,0.00046776724,0.0005583179,0.00052697764,0.0010465118,0.0010389269,0.00032764144,0.0024519907],"category_scores_gemma":[0.0035696388,0.0005228818,0.000660681,0.0011255972,0.0003552838,0.0016799899,0.0007028161,0.0012370646,0.00090301863],"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.00095280516,0.00047092146,0.006055578,0.00051432103,0.00012460987,0.0002577783,0.0005339617,0.12869358,0.3040809,0.052978534,0.025558494,0.47977847],"study_design_scores_gemma":[0.00019099478,0.00044372017,0.0057102274,0.000047386875,0.00014309854,0.00055756286,0.00014192512,0.5447221,0.34659624,0.016979052,0.084365584,0.00010218428],"about_ca_topic_score_codex":0.0020994004,"about_ca_topic_score_gemma":0.0026739202,"teacher_disagreement_score":0.0024519907,"about_ca_system_score_codex":0.00061665615,"about_ca_system_score_gemma":0.0016062143,"threshold_uncertainty_score":0.008202732},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9050443,0.0019512586,0.082020566,0.0008011929,0.00013610156,0.000098998724,0.00024703285,0.0022931446,0.0074074278],"genre_scores_gemma":[0.9772414,0.00024290188,0.020251883,0.00010285367,0.000035180445,0.000060834955,0.00017926129,0.00024673948,0.0016389716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973821,0.0006784577,0.00018789618,0.00026282977,0.00072593713,0.00076280325],"domain_scores_gemma":[0.9927165,0.0042183697,0.0006679732,0.001132253,0.001060874,0.00020404252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018502823,0.0005451678,0.0006418488,0.0007451245,0.0011147668,0.0014448424,0.0028795758,0.00084167975,0.0032606344],"category_scores_gemma":[0.009462051,0.0006624988,0.00046575416,0.0009247498,0.0005660243,0.003257824,0.0007087012,0.00083989685,0.0006692666],"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.004868912,0.00044142164,0.019116595,0.0010346975,0.00013420988,0.002089942,0.0011137587,0.42912352,0.32347032,0.04376152,0.008153952,0.16669112],"study_design_scores_gemma":[0.00044124626,0.0041456334,0.012561055,0.0001399649,0.00030333118,0.001687363,0.0008316671,0.6098489,0.32061228,0.020061504,0.02913912,0.00022787829],"about_ca_topic_score_codex":0.0019236129,"about_ca_topic_score_gemma":0.004125894,"teacher_disagreement_score":0.0032606344,"about_ca_system_score_codex":0.0011200359,"about_ca_system_score_gemma":0.0014088745,"threshold_uncertainty_score":0.010907948},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022526052,0.00013459551,0.9434436,0.00048587951,0.000093960036,0.00014196543,0.00008493214,0.02212129,0.01096779],"genre_scores_gemma":[0.19234152,0.00019957538,0.7912101,0.00038031608,0.00008137652,0.00024610054,0.00035562285,0.0057975715,0.009387827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951101,0.0018071351,0.00032358925,0.0006469767,0.0017331034,0.00037899666],"domain_scores_gemma":[0.98993146,0.0026794209,0.00044984304,0.0047721765,0.002008986,0.00015812782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032038474,0.0010151544,0.00072054856,0.0006370179,0.0008055937,0.0017760821,0.001612632,0.00066696195,0.0047566197],"category_scores_gemma":[0.011875801,0.00065056875,0.00061172206,0.0006676717,0.00076762185,0.0018692092,0.0022451314,0.0023999608,0.0025410785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007140228,0.00038879472,0.0064199576,0.0005255418,0.00010222155,0.00026939268,0.0015225341,0.0562951,0.15092662,0.08519801,0.04208067,0.6555571],"study_design_scores_gemma":[0.00028352404,0.00020865578,0.0018405196,0.00011324961,0.00008404062,0.00038710076,0.00025645478,0.6521888,0.16713834,0.06722317,0.11016091,0.00011522539],"about_ca_topic_score_codex":0.00071209,"about_ca_topic_score_gemma":0.0014266369,"teacher_disagreement_score":0.0047566197,"about_ca_system_score_codex":0.0005400762,"about_ca_system_score_gemma":0.002693567,"threshold_uncertainty_score":0.016943812},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11616195,0.0004934529,0.8755409,0.00038071309,0.000138062,0.00018570707,0.000130082,0.0020406626,0.004928558],"genre_scores_gemma":[0.34747553,0.000332814,0.6450059,0.00014482724,0.00010368643,0.00019297881,0.0004006882,0.0012112759,0.005132359],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981445,0.00059258967,0.0001257388,0.00017322278,0.00066065957,0.00030326803],"domain_scores_gemma":[0.9936699,0.0029975509,0.00039795676,0.0013180078,0.0013892719,0.00022733833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002328777,0.0013491401,0.0015271221,0.0014384873,0.00085141225,0.0013198063,0.0015084263,0.0007710955,0.004681085],"category_scores_gemma":[0.0117893815,0.00059622905,0.00088402786,0.0017784187,0.0011463953,0.0032781903,0.0016361215,0.0016407274,0.00091551524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001418176,0.00049597723,0.0031784724,0.00053286966,0.00010399867,0.00032932972,0.0005357119,0.11630128,0.055934463,0.09950356,0.011924224,0.70974195],"study_design_scores_gemma":[0.00009100347,0.00027055474,0.00074563094,0.000057775636,0.00011047542,0.00019649966,0.00019356709,0.86314994,0.043072585,0.08801824,0.004049466,0.000044292377],"about_ca_topic_score_codex":0.0016633802,"about_ca_topic_score_gemma":0.0048473505,"teacher_disagreement_score":0.004681085,"about_ca_system_score_codex":0.00069351384,"about_ca_system_score_gemma":0.0023790854,"threshold_uncertainty_score":0.01565975},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21068743,0.0013323578,0.77510244,0.0015922133,0.00010546931,0.00007329674,0.00007753152,0.0052186577,0.00581069],"genre_scores_gemma":[0.75198436,0.00054923317,0.24549763,0.00022606897,0.000073443625,0.0000669993,0.000111137975,0.0001751286,0.0013159672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994665,0.00021721033,0.000040291536,0.00007408019,0.00014595989,0.000056033918],"domain_scores_gemma":[0.9956273,0.0025057567,0.00039060047,0.0010943165,0.0003025569,0.000079546844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001128209,0.0003303599,0.00028290285,0.00045438606,0.00033485336,0.00063595263,0.00092979544,0.0003980309,0.0013173455],"category_scores_gemma":[0.0037680299,0.00032400372,0.0003256506,0.0005558968,0.00077021495,0.0014963647,0.00076659553,0.0006436132,0.000274276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009831254,0.0003307796,0.016637523,0.0005351972,0.00012770592,0.00041494594,0.0009844253,0.15025604,0.22877447,0.06422416,0.005322052,0.53140956],"study_design_scores_gemma":[0.00012688966,0.000417256,0.0014976774,0.000053979256,0.000091261856,0.00027390532,0.00010584793,0.82837653,0.09569884,0.053895015,0.019411579,0.000051204832],"about_ca_topic_score_codex":0.00094020355,"about_ca_topic_score_gemma":0.0018859073,"teacher_disagreement_score":0.0013173455,"about_ca_system_score_codex":0.000320283,"about_ca_system_score_gemma":0.00092752854,"threshold_uncertainty_score":0.0059666038},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071985506,0.019984253,0.87433696,0.0015182181,0.0003293381,0.0000854407,0.00045887224,0.0027542536,0.028547164],"genre_scores_gemma":[0.9310711,0.0066255503,0.05684055,0.00043386884,0.000521117,0.00026364962,0.0005636453,0.0005673695,0.0031131536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99508977,0.0010086632,0.00023340013,0.00056937,0.0021840308,0.0009147488],"domain_scores_gemma":[0.98462003,0.009436926,0.0013384464,0.0017392772,0.0024034549,0.00046184773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039487025,0.0020532755,0.0014979515,0.0020626679,0.0010984909,0.004803177,0.0018233949,0.001488936,0.003244023],"category_scores_gemma":[0.024898274,0.00076701096,0.00064120005,0.0020295456,0.0018148845,0.0050198613,0.0031134733,0.0033959232,0.0010673023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054318545,0.00011598326,0.0011978023,0.00045161173,0.0000955122,0.00016498778,0.00032057846,0.6695061,0.015680918,0.25564638,0.004254805,0.052022077],"study_design_scores_gemma":[0.000021016482,0.000095695046,0.0004464816,0.00015907623,0.000034969813,0.00009514514,0.00006050591,0.810633,0.0071943267,0.17695735,0.0042586005,0.000043898],"about_ca_topic_score_codex":0.0015630458,"about_ca_topic_score_gemma":0.00088417233,"teacher_disagreement_score":0.004803177,"about_ca_system_score_codex":0.0027105168,"about_ca_system_score_gemma":0.0011557422,"threshold_uncertainty_score":0.020882964},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031925257,0.0009367619,0.9206044,0.00027956517,0.0003547829,0.00015310304,0.00029369566,0.012269491,0.03318295],"genre_scores_gemma":[0.3771992,0.0007762075,0.5699601,0.00047775081,0.00023965383,0.00022519268,0.0009718948,0.0005289566,0.049621016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996014,0.00003546827,0.000024899038,0.00008829546,0.00019449314,0.00005543186],"domain_scores_gemma":[0.9997681,0.000034682937,0.000014216242,0.000052089003,0.00009202681,0.0000389507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003375764,0.00047850836,0.00060270703,0.00050397695,0.00081012055,0.0014620082,0.0012494618,0.00068248075,0.012754041],"category_scores_gemma":[0.0006688113,0.00029191226,0.00029640042,0.0006096924,0.00038808127,0.0011430276,0.0012908636,0.00061235996,0.004644422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000590479,0.00014826212,0.0009504131,0.00027545172,0.00006508834,0.0006283102,0.00026949745,0.02463308,0.23016368,0.09578253,0.020985711,0.62550753],"study_design_scores_gemma":[0.0002001615,0.00073597714,0.0017048763,0.00011037483,0.000086599,0.0025388934,0.00010437897,0.40025437,0.24325033,0.037436288,0.31343034,0.00014740303],"about_ca_topic_score_codex":0.0008686454,"about_ca_topic_score_gemma":0.000860578,"teacher_disagreement_score":0.012754041,"about_ca_system_score_codex":0.0005297061,"about_ca_system_score_gemma":0.0009702848,"threshold_uncertainty_score":0.042666554},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04381767,0.0003681997,0.94626296,0.0003126456,0.00006287901,0.000041336752,0.000045513338,0.0021876371,0.0069011278],"genre_scores_gemma":[0.60044193,0.00043998903,0.395539,0.0001495015,0.00009031726,0.00013415574,0.00016379333,0.00035825002,0.0026830253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986644,0.00036372768,0.00018563561,0.0001590382,0.00047891462,0.00014836494],"domain_scores_gemma":[0.99563783,0.0012585481,0.00051665044,0.0018544802,0.00058817264,0.00014425204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013339898,0.0004303505,0.00039809977,0.00041987596,0.00065586634,0.0014214903,0.0016731961,0.00045913734,0.0022510523],"category_scores_gemma":[0.0049335263,0.00065774267,0.0005812512,0.0007215466,0.0009842723,0.001969147,0.0012792508,0.0014677611,0.0003853106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040225429,0.00017957485,0.0058765355,0.00056667876,0.00012767118,0.0004965179,0.0005592495,0.2081567,0.082387604,0.5379782,0.0047526774,0.15851632],"study_design_scores_gemma":[0.00016600065,0.0002926285,0.0014562164,0.000061069215,0.00019043907,0.00054549356,0.000071995084,0.7725744,0.054491352,0.12592517,0.04414691,0.00007828868],"about_ca_topic_score_codex":0.00080094254,"about_ca_topic_score_gemma":0.0013229053,"teacher_disagreement_score":0.0022510523,"about_ca_system_score_codex":0.00061509595,"about_ca_system_score_gemma":0.0013322535,"threshold_uncertainty_score":0.00753057},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1939298,0.001517504,0.7916629,0.001281188,0.00023112739,0.0001531469,0.00085380726,0.0018280937,0.008542427],"genre_scores_gemma":[0.9056348,0.0008550382,0.08095772,0.000212723,0.00012233642,0.00033870427,0.0009257465,0.00045052834,0.010502365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991823,0.00019009395,0.000048726444,0.00015425404,0.00029857818,0.00012605947],"domain_scores_gemma":[0.99814606,0.0007594525,0.00018631003,0.00028570005,0.00052795466,0.00009448291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007102648,0.00065361,0.00085059047,0.000527355,0.0006620554,0.0010437449,0.0022281024,0.0010945189,0.0036043273],"category_scores_gemma":[0.0042952704,0.00045393128,0.00060327654,0.0009956686,0.0006966554,0.0022704406,0.00064963906,0.0012247564,0.001151024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017307515,0.00007872009,0.0029243503,0.0000723335,0.000030968462,0.00017865721,0.000095669,0.94049376,0.0037932086,0.029451445,0.0035797511,0.019128067],"study_design_scores_gemma":[0.0000036768483,0.000011928076,0.00009617738,0.000001878133,0.000002935434,0.000019984569,0.000004608776,0.99651366,0.00028240972,0.0027303235,0.0003293763,0.0000030767485],"about_ca_topic_score_codex":0.009101029,"about_ca_topic_score_gemma":0.0065620705,"teacher_disagreement_score":0.009101029,"about_ca_system_score_codex":0.00085763633,"about_ca_system_score_gemma":0.0012543907,"threshold_uncertainty_score":0.01809609},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27775675,0.0046329987,0.70556736,0.00077756424,0.0003112607,0.00028230684,0.00011369476,0.0016791767,0.008878987],"genre_scores_gemma":[0.86151165,0.0008223505,0.13554695,0.000105776184,0.000092813396,0.00011010664,0.00007590192,0.00010294848,0.0016315059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984895,0.00040788492,0.00011526568,0.00017766841,0.0006090946,0.00020066739],"domain_scores_gemma":[0.99705076,0.0012878544,0.0003676144,0.0005105086,0.0006082756,0.00017493476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015831112,0.00048270175,0.00053012284,0.00075101183,0.0010238152,0.0010415134,0.0013776578,0.00038034457,0.0011741437],"category_scores_gemma":[0.0056319847,0.00037108976,0.00031646076,0.0011885002,0.00068220537,0.0013195549,0.00091998046,0.00078351377,0.00014181455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002981718,0.00017213813,0.004378612,0.00032309067,0.00011382747,0.00026481005,0.00021836386,0.79103357,0.029165262,0.037564304,0.0031712933,0.13329656],"study_design_scores_gemma":[0.00002240082,0.00007379187,0.0007458691,0.000012647293,0.000022577673,0.00004548614,0.000034455414,0.98236775,0.0049888697,0.009210465,0.0024642125,0.000011431054],"about_ca_topic_score_codex":0.004640436,"about_ca_topic_score_gemma":0.006425064,"teacher_disagreement_score":0.004640436,"about_ca_system_score_codex":0.0014885446,"about_ca_system_score_gemma":0.001988256,"threshold_uncertainty_score":0.010800242},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41630664,0.00764975,0.5530865,0.0024272944,0.0007928708,0.00019057456,0.00014623228,0.0030627523,0.01633736],"genre_scores_gemma":[0.9323159,0.0009517282,0.06135014,0.00021869017,0.00025250134,0.00008276464,0.00013308553,0.00018011175,0.0045151375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989317,0.00027860978,0.00007873748,0.00010676432,0.0003115224,0.00029270042],"domain_scores_gemma":[0.9967884,0.0011569206,0.00028289354,0.0008351021,0.00066258496,0.0002740628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014325135,0.00053127314,0.0006716938,0.00060691446,0.0016511424,0.0019243694,0.002823209,0.0007632523,0.001982448],"category_scores_gemma":[0.005871979,0.00039792582,0.00029202524,0.0010138926,0.0007519829,0.0033828828,0.0021455195,0.0010212376,0.00033293452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015422557,0.0005471261,0.009390544,0.0007667138,0.00032219576,0.0011965744,0.0012265894,0.3322936,0.093415536,0.08288335,0.03342205,0.4429935],"study_design_scores_gemma":[0.00015053767,0.00026367174,0.0013770858,0.00004279666,0.00013609389,0.00023441386,0.00030646252,0.90353763,0.02977609,0.042307917,0.021808583,0.0000586685],"about_ca_topic_score_codex":0.0031864098,"about_ca_topic_score_gemma":0.008264361,"teacher_disagreement_score":0.0031864098,"about_ca_system_score_codex":0.00096075505,"about_ca_system_score_gemma":0.0017225624,"threshold_uncertainty_score":0.007575929},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18442751,0.00022034913,0.8039399,0.00020301722,0.000030807623,0.00007939403,0.00018096581,0.0023307514,0.008587355],"genre_scores_gemma":[0.83033663,0.00015733097,0.16690944,0.0000347688,0.000010233442,0.00012547681,0.00016294108,0.00027424569,0.0019889674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997254,0.00006277313,0.000012542957,0.00003084583,0.00014087271,0.000027618084],"domain_scores_gemma":[0.99949574,0.0001873979,0.000049595445,0.00010733908,0.00014521508,0.000014722158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028617855,0.00045493888,0.0004135786,0.0004345862,0.0003304522,0.0004572368,0.0010487675,0.0005113678,0.001042328],"category_scores_gemma":[0.0013530331,0.00029021146,0.0005116099,0.0005657891,0.00034175706,0.0006247977,0.0003390848,0.00043397263,0.0002484927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047456335,0.000050309405,0.0014006384,0.00005605466,0.000022762026,0.000050663577,0.0000718597,0.9620864,0.014790488,0.003857529,0.0005025697,0.017063335],"study_design_scores_gemma":[0.0000023273624,0.0000064384144,0.0001867766,0.0000010292075,0.0000019581057,0.0000061903866,0.0000031379434,0.9968966,0.002358946,0.00027157,0.00026232455,0.000002767435],"about_ca_topic_score_codex":0.008086276,"about_ca_topic_score_gemma":0.0062176464,"teacher_disagreement_score":0.008086276,"about_ca_system_score_codex":0.000638365,"about_ca_system_score_gemma":0.00064219965,"threshold_uncertainty_score":0.016078413},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05486378,0.00020161507,0.914437,0.00013832691,0.0000668339,0.00019643127,0.0004666546,0.024110327,0.0055189715],"genre_scores_gemma":[0.45669922,0.00016417139,0.5319177,0.00021010089,0.00013036974,0.00034421598,0.0014935024,0.0038089666,0.0052317283],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772733,0.0005268617,0.00021601566,0.00037407473,0.0007710253,0.00038471987],"domain_scores_gemma":[0.994443,0.0021506294,0.00061296497,0.0016213828,0.0010943938,0.00007760062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013348344,0.0010355539,0.0008364923,0.001963434,0.00062638044,0.0012040185,0.001616365,0.00033425854,0.0072021363],"category_scores_gemma":[0.0050466517,0.00046070426,0.0019866573,0.0015989268,0.0011235405,0.0022518644,0.0016844133,0.0016173642,0.0019120396],"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.0012526504,0.00032798445,0.02005955,0.000848765,0.00018054989,0.0006402838,0.0006054225,0.07349661,0.09183625,0.07917538,0.014062654,0.7175139],"study_design_scores_gemma":[0.000128507,0.0006840181,0.0061422,0.00012922497,0.0002487145,0.00060488394,0.00015222532,0.6281009,0.24969861,0.083385944,0.03058602,0.00013877123],"about_ca_topic_score_codex":0.0015596955,"about_ca_topic_score_gemma":0.0022525126,"teacher_disagreement_score":0.0072021363,"about_ca_system_score_codex":0.00078254304,"about_ca_system_score_gemma":0.0020157392,"threshold_uncertainty_score":0.024093568},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09111021,0.032312624,0.45693648,0.1872717,0.004476485,0.0005044431,0.0013744719,0.006639005,0.21937463],"genre_scores_gemma":[0.34109837,0.021521846,0.56657743,0.010052156,0.0010520974,0.00022280838,0.0017205267,0.00316202,0.05459276],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99730706,0.0004887023,0.0000863438,0.0002303951,0.001426453,0.00046108756],"domain_scores_gemma":[0.99455714,0.0010876347,0.00009668532,0.0005476993,0.0023022427,0.0014087158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005542453,0.0008428065,0.00073995435,0.000663623,0.0022045255,0.0051934537,0.0031350802,0.0020055147,0.006950443],"category_scores_gemma":[0.007910037,0.00049905747,0.0004265566,0.0012458024,0.0032968083,0.0073381355,0.003004053,0.0046034763,0.0026689554],"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.00027054077,0.00038275213,0.0060429485,0.0010947668,0.000077519515,0.0006626053,0.002192711,0.06326512,0.0059234933,0.18856713,0.21531273,0.5162077],"study_design_scores_gemma":[0.00015362901,0.00039248393,0.0026027446,0.0006560359,0.00005829526,0.00056258484,0.0031509101,0.052558307,0.012773179,0.10937369,0.8175557,0.00016243287],"about_ca_topic_score_codex":0.109123826,"about_ca_topic_score_gemma":0.12749659,"teacher_disagreement_score":0.109123826,"about_ca_system_score_codex":0.005497061,"about_ca_system_score_gemma":0.014963635,"threshold_uncertainty_score":0.2169773},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079123266,0.0016449336,0.50323117,0.000703919,0.0010195917,0.0004958889,0.0021492846,0.31655133,0.09508067],"genre_scores_gemma":[0.4298064,0.0011429786,0.47559348,0.0011891888,0.00026567938,0.0009763807,0.00993774,0.031027688,0.05006037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982034,0.00018602033,0.00016712311,0.00035507005,0.0007910332,0.00029737304],"domain_scores_gemma":[0.99823403,0.0004107202,0.0001932812,0.00063931424,0.00032045483,0.00020215247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015147063,0.0017800981,0.0008282563,0.0013051553,0.0006896487,0.0035662907,0.0032552285,0.0010927244,0.009145095],"category_scores_gemma":[0.0036765712,0.0011644063,0.000971428,0.0011336774,0.0010010512,0.0040298705,0.0029126618,0.0015837324,0.005227929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008646106,0.0013574742,0.008104728,0.0019101555,0.0002609312,0.001955088,0.0018280003,0.052288573,0.08615181,0.12447885,0.14804897,0.5649693],"study_design_scores_gemma":[0.0009306468,0.00049718586,0.004907399,0.0006168291,0.00020457238,0.0008700721,0.00021571755,0.432706,0.19366236,0.06364522,0.30137497,0.00036900933],"about_ca_topic_score_codex":0.0031725848,"about_ca_topic_score_gemma":0.0026141093,"teacher_disagreement_score":0.009145095,"about_ca_system_score_codex":0.0015131516,"about_ca_system_score_gemma":0.0018274941,"threshold_uncertainty_score":0.030593336},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029336398,0.00035481137,0.9636688,0.000109811386,0.00003625366,0.000037792546,0.0000167392,0.0032374754,0.0032018651],"genre_scores_gemma":[0.49544355,0.000471575,0.49836078,0.00012898244,0.00010591912,0.0001077779,0.00011437808,0.0008138223,0.00445325],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99943453,0.00013341909,0.00003680643,0.000088747875,0.00021970924,0.000086739165],"domain_scores_gemma":[0.9993654,0.00024160952,0.0000678746,0.00022919306,0.000066357956,0.000029563047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004654153,0.0005973889,0.0005058976,0.000432312,0.00023264955,0.00067805604,0.0009468054,0.00030650452,0.0015560937],"category_scores_gemma":[0.0011491714,0.000447827,0.00040214715,0.00040001346,0.0005452254,0.0011993496,0.0009444949,0.0007998343,0.00053039624],"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.00069650315,0.00015733881,0.0015616494,0.0003080509,0.000071450726,0.00060397875,0.00050544704,0.056745272,0.31083196,0.068380564,0.0032886383,0.5568491],"study_design_scores_gemma":[0.00023295493,0.00076884,0.0018839315,0.000061967614,0.00013422524,0.001218602,0.00011697991,0.6117937,0.2969143,0.04251098,0.04427447,0.00008908635],"about_ca_topic_score_codex":0.00032817447,"about_ca_topic_score_gemma":0.0005299614,"teacher_disagreement_score":0.0015560937,"about_ca_system_score_codex":0.00021904174,"about_ca_system_score_gemma":0.0006383945,"threshold_uncertainty_score":0.005205691},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009628102,0.00080103445,0.6079557,0.00046037722,0.0006073109,0.00037696998,0.005279426,0.31518102,0.059710097],"genre_scores_gemma":[0.081432186,0.00091391546,0.7197613,0.0008811624,0.00012903173,0.0008676593,0.019346863,0.07715382,0.099514],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99886405,0.00012967078,0.00009366541,0.00024584998,0.00051774905,0.00014901023],"domain_scores_gemma":[0.99896216,0.00027221133,0.00009810202,0.00030541894,0.00027929427,0.000082827435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011334221,0.0011300375,0.00073602225,0.00064393197,0.0006118964,0.0016198239,0.0026633218,0.00096691365,0.04013275],"category_scores_gemma":[0.0036078396,0.0013169334,0.0012274852,0.00053050596,0.0007548839,0.0025308223,0.002447089,0.0028452196,0.020896925],"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.0013720595,0.00022486252,0.0032510923,0.0017512236,0.00020684491,0.00035705118,0.0005950924,0.021831514,0.05721987,0.116889104,0.37013188,0.42616943],"study_design_scores_gemma":[0.00036923838,0.00021683172,0.0009998305,0.00020194135,0.00009174142,0.00044819125,0.00005693552,0.10556466,0.06692353,0.028112875,0.7968704,0.00014383251],"about_ca_topic_score_codex":0.0024843947,"about_ca_topic_score_gemma":0.0037295371,"teacher_disagreement_score":0.04013275,"about_ca_system_score_codex":0.0007245071,"about_ca_system_score_gemma":0.002731693,"threshold_uncertainty_score":0.13425744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26922816,0.007206827,0.7091748,0.0008209837,0.00032384854,0.00007461616,0.000109335066,0.0011768099,0.011884673],"genre_scores_gemma":[0.9035727,0.0007839253,0.08919588,0.00013347034,0.000107078115,0.00007144031,0.000081576494,0.00022356983,0.005830407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981683,0.000059518497,0.000009981526,0.000020802812,0.000059645437,0.00003320544],"domain_scores_gemma":[0.99966824,0.00016461538,0.000038571005,0.00003393514,0.00007760626,0.000016997847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033132,0.00045209622,0.00055836333,0.00032671724,0.0003769646,0.0005837813,0.0006644473,0.0004015882,0.0020955787],"category_scores_gemma":[0.0013818219,0.00022782705,0.0002431524,0.00051721255,0.0001734234,0.0005996693,0.0004189448,0.00047429043,0.00014254994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039540854,0.00018240357,0.0013508284,0.00014054815,0.000090140245,0.00007471834,0.000057118654,0.7730382,0.02885147,0.010703215,0.004656917,0.18045896],"study_design_scores_gemma":[0.000014048953,0.000045265497,0.00033348813,0.0000027364715,0.00001688244,0.000014420611,0.000008656934,0.9934285,0.0026693824,0.0026686443,0.00079409487,0.00000385663],"about_ca_topic_score_codex":0.0026646992,"about_ca_topic_score_gemma":0.006523519,"teacher_disagreement_score":0.0026646992,"about_ca_system_score_codex":0.00050926086,"about_ca_system_score_gemma":0.00068960467,"threshold_uncertainty_score":0.0070104003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.213156,0.00031795542,0.76366097,0.0001707389,0.000059822436,0.00013138985,0.00013386276,0.0068295468,0.015539745],"genre_scores_gemma":[0.8261179,0.00018514035,0.16747805,0.00005453362,0.00001500523,0.00016388719,0.00021396497,0.00059487,0.00517679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998723,0.00002427049,0.0000059988033,0.000019885922,0.000049362156,0.000028146316],"domain_scores_gemma":[0.9998468,0.00006432143,0.000024273922,0.000024420133,0.0000356246,0.0000045058428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013111216,0.0004373832,0.0002456349,0.0003118817,0.00019760737,0.0002784663,0.0003674946,0.00019142748,0.0025984107],"category_scores_gemma":[0.00054901274,0.00011954259,0.00032720258,0.00032875568,0.00020737352,0.0002399146,0.00029667723,0.0003063257,0.00030095445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023451984,0.00016013313,0.0008731063,0.00021008695,0.00004270989,0.00019299837,0.00013623622,0.6535004,0.092748955,0.014578781,0.0024971128,0.23482497],"study_design_scores_gemma":[0.000041712916,0.00014191803,0.00024088402,0.000006428323,0.000020197593,0.000060486756,0.00003264958,0.9441022,0.046966985,0.003188877,0.005191591,0.000006053866],"about_ca_topic_score_codex":0.0011950441,"about_ca_topic_score_gemma":0.0011317278,"teacher_disagreement_score":0.0025984107,"about_ca_system_score_codex":0.00021992528,"about_ca_system_score_gemma":0.00046246403,"threshold_uncertainty_score":0.008692503},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13330427,0.0013846129,0.8550733,0.0007559049,0.0001836861,0.00034905632,0.0003569055,0.002383857,0.006208527],"genre_scores_gemma":[0.59752077,0.00051990565,0.3966777,0.0002749489,0.00014443744,0.00031947537,0.00079792907,0.0002445726,0.00350028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992544,0.00028900156,0.00004887125,0.0001238635,0.00013134372,0.00015242808],"domain_scores_gemma":[0.99142295,0.0072590825,0.00023459201,0.00036650055,0.00049977656,0.00021709458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021641653,0.000990022,0.0019486183,0.001436538,0.00077801856,0.0010704084,0.002042861,0.0016122874,0.0041758344],"category_scores_gemma":[0.01032981,0.0010636512,0.000934061,0.0016073739,0.0010034116,0.0020013617,0.0009846457,0.0024675052,0.00042958895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031138942,0.0001984572,0.0008081196,0.00009352255,0.000043348045,0.000026186544,0.000069361144,0.87367374,0.00037312356,0.008102858,0.0035756263,0.11272427],"study_design_scores_gemma":[0.000055984685,0.000033098444,0.00007815377,0.000006160691,0.0000092094615,0.0000042927827,0.00000992801,0.9895084,0.00015392022,0.00985346,0.00028368746,0.0000037340121],"about_ca_topic_score_codex":0.019593304,"about_ca_topic_score_gemma":0.019834356,"teacher_disagreement_score":0.019593304,"about_ca_system_score_codex":0.0022161019,"about_ca_system_score_gemma":0.0040701106,"threshold_uncertainty_score":0.03895849},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004722347,0.00020982714,0.94557315,0.00013814302,0.00009172502,0.0001592487,0.00017265638,0.04596071,0.0029721742],"genre_scores_gemma":[0.14761098,0.0003824685,0.8240576,0.00039968034,0.00013215703,0.00090895896,0.0017510576,0.015313419,0.009443681],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976156,0.00048329367,0.00020261398,0.00039891145,0.0009282508,0.00037137556],"domain_scores_gemma":[0.9965133,0.00099931,0.00022988877,0.0009402043,0.0009056467,0.00041168174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031258275,0.0015325645,0.0011793701,0.0013114555,0.0016072004,0.0028535163,0.0077586854,0.0020197136,0.00950876],"category_scores_gemma":[0.006754081,0.0014938647,0.0018197517,0.0011958292,0.0022118904,0.0036218541,0.0058702477,0.003988465,0.0035541353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023093896,0.0008017258,0.0070965085,0.0012623398,0.00040859944,0.0014853451,0.00196095,0.22074345,0.047034223,0.15491907,0.10556135,0.45641708],"study_design_scores_gemma":[0.00066333544,0.00022231585,0.00074750744,0.00009505933,0.000059769176,0.00032997338,0.0001442533,0.8373796,0.02428576,0.05202857,0.08387853,0.00016539636],"about_ca_topic_score_codex":0.007437815,"about_ca_topic_score_gemma":0.0091347005,"teacher_disagreement_score":0.00950876,"about_ca_system_score_codex":0.0022003069,"about_ca_system_score_gemma":0.00304656,"threshold_uncertainty_score":0.031809986},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8054279,0.0005146176,0.1894407,0.00030346142,0.000069474336,0.000052037147,0.000054822933,0.0005823079,0.003554651],"genre_scores_gemma":[0.9790081,0.00007728704,0.02011191,0.00004054631,0.000013377476,0.00001256265,0.00003294808,0.000034883706,0.0006683513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965847,0.00009257856,0.000016858427,0.00006275587,0.00008834077,0.00008113186],"domain_scores_gemma":[0.99911577,0.00031833875,0.00016230304,0.00010732325,0.00016821492,0.00012803487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089937524,0.00032519762,0.00045184314,0.0003087805,0.00054841547,0.00069127436,0.0008653731,0.00027687894,0.0005567799],"category_scores_gemma":[0.0015751559,0.00025034545,0.00014828007,0.00045273665,0.00035270417,0.00058832724,0.00039708777,0.00044362512,0.00014763222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014735461,0.0005415727,0.0077742124,0.00017772571,0.00006465752,0.00034847317,0.0002522638,0.7556766,0.14119183,0.011609443,0.0031222147,0.077767506],"study_design_scores_gemma":[0.000028768547,0.00011110738,0.0008033496,0.0000027574629,0.000009031694,0.00003664261,0.00004433227,0.9870483,0.009251014,0.0021233263,0.00053113716,0.000010198532],"about_ca_topic_score_codex":0.001691601,"about_ca_topic_score_gemma":0.004220577,"teacher_disagreement_score":0.001691601,"about_ca_system_score_codex":0.00052829,"about_ca_system_score_gemma":0.0014014023,"threshold_uncertainty_score":0.004756391},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3617039,0.0051477733,0.5586286,0.0012592231,0.002498189,0.00040519008,0.0035910797,0.03648591,0.030280167],"genre_scores_gemma":[0.38166526,0.001495872,0.58687764,0.00061650755,0.0004595474,0.00020608747,0.008856897,0.0028518713,0.016970329],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982309,0.0003093193,0.00023659292,0.00027939607,0.0007070568,0.00023678501],"domain_scores_gemma":[0.9940929,0.0017526752,0.00035036707,0.0018402339,0.0017611088,0.00020269821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011346228,0.0011300278,0.0017138893,0.0030896186,0.001407459,0.003070682,0.002172641,0.0013688529,0.013999183],"category_scores_gemma":[0.009863682,0.00067327166,0.000763428,0.009103471,0.000631211,0.0062407656,0.0019835813,0.00095460156,0.006433142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024664847,0.00075980433,0.0035285389,0.0006320882,0.00014199663,0.0002928868,0.00041139845,0.032972332,0.033684313,0.034082953,0.046006598,0.8450206],"study_design_scores_gemma":[0.0008349061,0.0016357615,0.0034534617,0.00021540614,0.00039028193,0.0008310204,0.001057229,0.6145759,0.13067664,0.18289539,0.06319257,0.00024136055],"about_ca_topic_score_codex":0.003399842,"about_ca_topic_score_gemma":0.007168607,"teacher_disagreement_score":0.013999183,"about_ca_system_score_codex":0.0007840415,"about_ca_system_score_gemma":0.0027621067,"threshold_uncertainty_score":0.046831965},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0995219,0.00047217534,0.87378,0.00017985379,0.0000826257,0.00023031046,0.00042729144,0.017689258,0.007616604],"genre_scores_gemma":[0.38244885,0.00027909208,0.6083226,0.00018251894,0.00001963557,0.0004147424,0.0005668605,0.00150754,0.0062580444],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995515,0.00010666207,0.00004835072,0.00006897761,0.00017384488,0.000050583734],"domain_scores_gemma":[0.99820733,0.0010600516,0.00016097508,0.00028335163,0.000252951,0.00003526578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006404848,0.00061011565,0.00031703874,0.00050479115,0.00024923205,0.00075702416,0.0018826122,0.00077915774,0.0046783728],"category_scores_gemma":[0.0033200902,0.000431904,0.00026816662,0.0004546909,0.00035410334,0.0009944765,0.0006603682,0.000973056,0.00086742867],"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.0018642448,0.0003395913,0.002647436,0.001227437,0.00010356673,0.0011320292,0.0005418736,0.21809603,0.28101695,0.03196344,0.011485466,0.449582],"study_design_scores_gemma":[0.00038318554,0.000682833,0.0011859722,0.00014693449,0.00009115682,0.0007557934,0.00004570392,0.59227127,0.3520403,0.01627451,0.036024656,0.00009775336],"about_ca_topic_score_codex":0.0004904708,"about_ca_topic_score_gemma":0.0009677754,"teacher_disagreement_score":0.0046783728,"about_ca_system_score_codex":0.000305126,"about_ca_system_score_gemma":0.00048464688,"threshold_uncertainty_score":0.01565069},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51780516,0.00073966524,0.46247122,0.0006470638,0.00012800518,0.00020968166,0.00053021463,0.010174572,0.007294454],"genre_scores_gemma":[0.901552,0.00008415016,0.09680162,0.000078173405,0.000034832618,0.000050333434,0.0002692576,0.00019447703,0.00093512837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982377,0.0003758657,0.00014895869,0.00028271895,0.000733804,0.00022095686],"domain_scores_gemma":[0.993244,0.0029920815,0.0012295367,0.0010328093,0.0011906582,0.0003109583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001252084,0.0007240781,0.0007589419,0.0017484357,0.00044207645,0.0013940816,0.00059149915,0.0005596301,0.0013359103],"category_scores_gemma":[0.00870168,0.00058024353,0.0004063743,0.0010121746,0.00042146782,0.0016812314,0.0007279488,0.00085933536,0.0005017388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002996862,0.00047032177,0.14465381,0.00024817398,0.00030663013,0.0006221848,0.00047279877,0.109182045,0.22650826,0.009506399,0.007042945,0.49798954],"study_design_scores_gemma":[0.000045371497,0.00027486353,0.011142138,0.000027701179,0.00007268109,0.0002609523,0.00006919376,0.91449445,0.0640902,0.007273854,0.0021889354,0.000059601447],"about_ca_topic_score_codex":0.0019602869,"about_ca_topic_score_gemma":0.0050796974,"teacher_disagreement_score":0.0019602869,"about_ca_system_score_codex":0.0006593026,"about_ca_system_score_gemma":0.0010861652,"threshold_uncertainty_score":0.0066217184},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10632813,0.00066291285,0.8494192,0.0004858483,0.00011279726,0.00014542918,0.0007796637,0.0014553724,0.0406106],"genre_scores_gemma":[0.8799963,0.0007733158,0.094975956,0.00028285568,0.00005317824,0.00036552653,0.00089511444,0.00084369525,0.021813985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954164,0.00009152699,0.000023128301,0.00008214033,0.00019338992,0.00006817886],"domain_scores_gemma":[0.9994098,0.00020444574,0.000056920206,0.00012912863,0.00017675664,0.000022901499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043260778,0.00078644796,0.0005957394,0.00048568653,0.00043117156,0.0007497086,0.0018691772,0.0006412232,0.004423073],"category_scores_gemma":[0.002021043,0.00036026738,0.0008278855,0.0007736631,0.0003606342,0.0015623285,0.00059346657,0.00083738274,0.0008824239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023432836,0.000020549729,0.00052319694,0.000025509758,0.000013069967,0.00006135771,0.000026109748,0.97862154,0.002210674,0.009571422,0.0011590929,0.0077439398],"study_design_scores_gemma":[0.000003724026,0.000014657584,0.00014512683,0.0000026908886,0.000005366005,0.000015805987,0.0000061968894,0.9945491,0.00092613476,0.0026771906,0.001650857,0.0000030659894],"about_ca_topic_score_codex":0.0060936995,"about_ca_topic_score_gemma":0.0047260295,"teacher_disagreement_score":0.0060936995,"about_ca_system_score_codex":0.0007873834,"about_ca_system_score_gemma":0.00067273935,"threshold_uncertainty_score":0.014796674},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16260003,0.00090840843,0.81767064,0.00090557564,0.00016012508,0.00010684753,0.00010841861,0.0004436303,0.017096393],"genre_scores_gemma":[0.95698535,0.0001980657,0.040065367,0.000092684684,0.000049759416,0.000057697056,0.000059627244,0.00009305489,0.0023984597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934703,0.00024944282,0.000015046439,0.00007755107,0.00015109919,0.0001599096],"domain_scores_gemma":[0.9907161,0.0075162253,0.00042388155,0.00032309297,0.0006592882,0.00036151792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002794366,0.0006434044,0.0010292302,0.000634777,0.00047856887,0.0011446832,0.0010281383,0.0009884095,0.0046862527],"category_scores_gemma":[0.01814388,0.00035824312,0.00034558662,0.0005119245,0.0016324929,0.0011805035,0.0011985741,0.0015768133,0.00023240657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004655147,0.00013947644,0.0006026727,0.000101931095,0.000024327315,0.00007139007,0.00009309263,0.94629914,0.001126313,0.032540996,0.0017364805,0.016798602],"study_design_scores_gemma":[0.000014503631,0.000016456992,0.000036323057,0.0000041336607,0.0000019310105,0.0000049861037,0.000007926155,0.9954764,0.00010694516,0.004253701,0.000074834476,0.0000019316517],"about_ca_topic_score_codex":0.0076083387,"about_ca_topic_score_gemma":0.0038207632,"teacher_disagreement_score":0.0076083387,"about_ca_system_score_codex":0.0008884595,"about_ca_system_score_gemma":0.0018035329,"threshold_uncertainty_score":0.015677094},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010909519,0.53013796,0.06175777,0.13058071,0.06287521,0.00053874595,0.0007187833,0.0012705479,0.20121074],"genre_scores_gemma":[0.11694406,0.31619683,0.03051389,0.033416685,0.09600692,0.0007510838,0.0019282842,0.00061153417,0.40363073],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992119,0.00014356972,0.0000533042,0.000112628135,0.00033817533,0.0001403764],"domain_scores_gemma":[0.9991191,0.00039829852,0.00006997173,0.00005723292,0.00023392276,0.00012158273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002619346,0.00060801103,0.00032676925,0.0007911484,0.0009474299,0.0016729373,0.0011392663,0.003994922,0.00962029],"category_scores_gemma":[0.0018605023,0.0006236765,0.0003492278,0.0009270811,0.001181125,0.003786425,0.00086971006,0.0031516922,0.0036524746],"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.00022731452,0.000114078764,0.00051682076,0.0007541343,0.000021362848,0.00046727032,0.000168073,0.0022902037,0.0024425916,0.09963475,0.63606286,0.25730056],"study_design_scores_gemma":[0.000031592474,0.00019632094,0.0009156091,0.00019768302,0.000015628913,0.0002755696,0.000040840758,0.0018031647,0.0011249947,0.01649842,0.97888035,0.000019919957],"about_ca_topic_score_codex":0.005494812,"about_ca_topic_score_gemma":0.009431281,"teacher_disagreement_score":0.00962029,"about_ca_system_score_codex":0.0021765127,"about_ca_system_score_gemma":0.0014433512,"threshold_uncertainty_score":0.03218305},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054078553,0.0026282773,0.28768125,0.0010544994,0.0007957328,0.00043021646,0.0033462485,0.027353939,0.62263113],"genre_scores_gemma":[0.39353302,0.0024324334,0.18638463,0.0010384461,0.0002883317,0.00056582125,0.014157563,0.004632618,0.3969671],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997008,0.000024863544,0.00001318213,0.00007036174,0.00012873334,0.00006208608],"domain_scores_gemma":[0.9996315,0.00003882038,0.000020887332,0.000095558025,0.00016162083,0.000051617524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026931425,0.0004111328,0.00034452244,0.0005707785,0.00045195315,0.0012427837,0.0010707751,0.00046356415,0.060620904],"category_scores_gemma":[0.0007595663,0.00029484186,0.00027735106,0.00045000858,0.00030599674,0.0011495474,0.0012952954,0.0008207467,0.015574718],"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.001826253,0.00016150236,0.0022405218,0.00067451736,0.00005975765,0.00033122653,0.00034393006,0.012987821,0.07346311,0.11686421,0.1764734,0.61457384],"study_design_scores_gemma":[0.00023556942,0.00039292962,0.0016131691,0.00010422392,0.00003139087,0.0004242887,0.00007387123,0.040561613,0.027254857,0.016096959,0.9131699,0.00004116791],"about_ca_topic_score_codex":0.0013893923,"about_ca_topic_score_gemma":0.0030734683,"teacher_disagreement_score":0.060620904,"about_ca_system_score_codex":0.0005626718,"about_ca_system_score_gemma":0.00074456056,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012264329,0.00054146955,0.9655672,0.0008121322,0.00011168357,0.0004434527,0.000102907165,0.014116518,0.0060404167],"genre_scores_gemma":[0.096185975,0.0004486512,0.8945735,0.0003673868,0.00005682996,0.00022245372,0.0005041416,0.0030379663,0.0046031126],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99439704,0.0012720628,0.0004559413,0.0006920318,0.0024107657,0.0007721568],"domain_scores_gemma":[0.99637175,0.0007241188,0.0002325585,0.0012226518,0.0010724505,0.00037648456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007806838,0.0010498131,0.00077832886,0.000799571,0.0011983739,0.0033571238,0.0036317345,0.0015608512,0.0038768917],"category_scores_gemma":[0.0097270515,0.0014634667,0.0015225941,0.0005539749,0.0020056483,0.0058434806,0.004546135,0.0044424245,0.0028222918],"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.00094046246,0.00095291407,0.007845544,0.0016935065,0.00024951473,0.0020988346,0.0051151933,0.13745974,0.1651724,0.12962252,0.028867697,0.5199816],"study_design_scores_gemma":[0.00024141795,0.0009849236,0.00225685,0.00039218416,0.00022502692,0.0016850972,0.00088546844,0.53837335,0.12330565,0.032424867,0.29892218,0.00030304282],"about_ca_topic_score_codex":0.0048011625,"about_ca_topic_score_gemma":0.005498737,"teacher_disagreement_score":0.007806838,"about_ca_system_score_codex":0.0017160861,"about_ca_system_score_gemma":0.00439481,"threshold_uncertainty_score":0.041287005},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6250052,0.0004921787,0.35129672,0.00031119693,0.0000730498,0.00024610487,0.00017032356,0.0038020713,0.01860327],"genre_scores_gemma":[0.9114948,0.000107313994,0.08564313,0.0000851779,0.000015914473,0.0000728147,0.0001109302,0.00007020388,0.0023997389],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998554,0.00002092475,0.000008795314,0.000023718403,0.000063470165,0.000027599817],"domain_scores_gemma":[0.9997646,0.000069430665,0.000038839768,0.00004601221,0.00006278804,0.00001827292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014801549,0.00017719365,0.00015149976,0.00022747174,0.00019409189,0.0003820722,0.000458574,0.00020245947,0.0021317708],"category_scores_gemma":[0.0004539248,0.00013271542,0.00014659278,0.00016725309,0.00020025276,0.00035290222,0.00014311432,0.00031815722,0.00030860773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000486957,0.00022323515,0.005554087,0.00025324628,0.000060476195,0.0003984625,0.00026415975,0.3962119,0.42540142,0.017363373,0.0034055598,0.15037711],"study_design_scores_gemma":[0.000088448556,0.000901666,0.0026909073,0.000014431313,0.00005537588,0.00015360347,0.000035184385,0.8741995,0.11101021,0.0019328302,0.00889361,0.000024223327],"about_ca_topic_score_codex":0.0023344117,"about_ca_topic_score_gemma":0.0031399166,"teacher_disagreement_score":0.0023344117,"about_ca_system_score_codex":0.00041722547,"about_ca_system_score_gemma":0.0006499998,"threshold_uncertainty_score":0.0071314573},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19447045,0.0009613381,0.7989511,0.00012964927,0.00013753385,0.000086377964,0.000029959403,0.0018896168,0.0033438692],"genre_scores_gemma":[0.79554594,0.00020477702,0.2024612,0.00004236094,0.00002394546,0.00005576908,0.000028601897,0.00007442926,0.0015630111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997322,0.000071191,0.000020750902,0.00003440685,0.00009326537,0.00004813144],"domain_scores_gemma":[0.99938774,0.0002360895,0.00009980683,0.00011899289,0.00010995728,0.00004730236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005923669,0.00029004054,0.00023872349,0.00043839106,0.00033021666,0.00049540395,0.0005887617,0.00019250979,0.0013657205],"category_scores_gemma":[0.0012448664,0.00021536482,0.00016134721,0.0003209818,0.00027768817,0.00048079304,0.00031915217,0.0003497604,0.00018141966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001332877,0.00019397304,0.006901948,0.00026796883,0.00006891855,0.0003702584,0.00036225683,0.35584977,0.16826425,0.02400989,0.0033010088,0.43907684],"study_design_scores_gemma":[0.00009591158,0.000246619,0.0007611745,0.000019879224,0.000028831457,0.00007615829,0.00003111175,0.948745,0.040675145,0.0051510297,0.004154239,0.000015001492],"about_ca_topic_score_codex":0.0023990155,"about_ca_topic_score_gemma":0.004377232,"teacher_disagreement_score":0.0023990155,"about_ca_system_score_codex":0.0006114059,"about_ca_system_score_gemma":0.00082574243,"threshold_uncertainty_score":0.0047701},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3394139,0.001062206,0.6426596,0.0005032287,0.00017252458,0.000506893,0.00019256255,0.0035222997,0.011966776],"genre_scores_gemma":[0.47403497,0.00068079913,0.5169892,0.00020861939,0.000048816175,0.00020057822,0.0005442808,0.0005150568,0.0067777685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998129,0.000035001598,0.000016030186,0.000037799295,0.000050920906,0.000047431284],"domain_scores_gemma":[0.99933016,0.0002558099,0.00014803743,0.00013336088,0.00010871755,0.000023826431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022872597,0.0010253442,0.00060933805,0.00051379635,0.00028850988,0.0005305399,0.0006903862,0.0003906221,0.0035553155],"category_scores_gemma":[0.0010955809,0.00035202256,0.00045189072,0.0005470714,0.00028558954,0.00063331705,0.00024254089,0.0009184543,0.001077227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006163417,0.00043465602,0.0019108595,0.00049845566,0.000040989995,0.00031938372,0.00026178276,0.15823336,0.29962724,0.007809135,0.0033938794,0.52685386],"study_design_scores_gemma":[0.0002861058,0.0028589377,0.005475302,0.00011681184,0.00022363968,0.00077194255,0.00034204798,0.5869638,0.33515587,0.013837839,0.053875197,0.00009249809],"about_ca_topic_score_codex":0.0016486878,"about_ca_topic_score_gemma":0.0037676182,"teacher_disagreement_score":0.0035553155,"about_ca_system_score_codex":0.0003678411,"about_ca_system_score_gemma":0.0010540109,"threshold_uncertainty_score":0.011893749},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16489372,0.0017683342,0.8102943,0.00043259704,0.00021133159,0.00026623256,0.0002441897,0.012883838,0.009005441],"genre_scores_gemma":[0.5828959,0.00036840883,0.4118656,0.00015891601,0.00006585312,0.00023026047,0.00047984385,0.00036994583,0.0035653117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971586,0.00003582044,0.000018898234,0.000056762627,0.00013494043,0.000037672624],"domain_scores_gemma":[0.99955326,0.00006914872,0.00006833243,0.00016021112,0.00011401056,0.000035101202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003551023,0.00037405782,0.00028094233,0.00061200606,0.00038682934,0.00054303004,0.0011650714,0.00026473563,0.002540988],"category_scores_gemma":[0.00073010835,0.00033907173,0.00035780962,0.0006961792,0.00027903105,0.0007899924,0.0005831562,0.0006494911,0.00059245835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061488716,0.00027306486,0.0057294085,0.00032680866,0.00011184607,0.00028920968,0.00018074372,0.14472884,0.25965452,0.018375313,0.020596188,0.5491192],"study_design_scores_gemma":[0.00012388325,0.0005623742,0.002149615,0.000030094272,0.000042789557,0.00026210584,0.000036170757,0.9126726,0.06530318,0.004109849,0.014667136,0.0000401416],"about_ca_topic_score_codex":0.0015688146,"about_ca_topic_score_gemma":0.0036955047,"teacher_disagreement_score":0.002540988,"about_ca_system_score_codex":0.00058584305,"about_ca_system_score_gemma":0.0014645542,"threshold_uncertainty_score":0.008500397},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010225544,0.000259052,0.98190975,0.00016663483,0.000046666795,0.00010764418,0.00003931571,0.006244404,0.0010009758],"genre_scores_gemma":[0.1392099,0.0002392828,0.8577989,0.00011774682,0.000082561855,0.00029896176,0.000118062126,0.0008110577,0.0013234561],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987477,0.0002468037,0.00008878471,0.00022414266,0.0005085382,0.00018400303],"domain_scores_gemma":[0.9979873,0.00062604615,0.00023025603,0.0006533207,0.00038281642,0.00012031984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019981936,0.0012225109,0.0009228161,0.0011853114,0.0010608562,0.0012179201,0.002505753,0.0007987017,0.001539438],"category_scores_gemma":[0.0040692817,0.00086236,0.00086752576,0.0008249041,0.0012679223,0.0018114987,0.001342911,0.002144002,0.00057223946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037690622,0.0004955468,0.0016232076,0.00032471734,0.00008853267,0.00021496553,0.00044689258,0.35294953,0.078931026,0.08300683,0.008161868,0.47338],"study_design_scores_gemma":[0.00012592773,0.00032383864,0.0004584967,0.00004638126,0.00009003847,0.00018559584,0.000049786362,0.9066803,0.03954724,0.030703446,0.021701766,0.00008706628],"about_ca_topic_score_codex":0.0031523951,"about_ca_topic_score_gemma":0.0038901465,"teacher_disagreement_score":0.0031523951,"about_ca_system_score_codex":0.00097114255,"about_ca_system_score_gemma":0.0027181737,"threshold_uncertainty_score":0.0105676055},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084082864,0.0006796703,0.8984896,0.0017835031,0.00016716277,0.00012309858,0.000092214854,0.005991541,0.008590392],"genre_scores_gemma":[0.763847,0.0005914138,0.23128805,0.0007219068,0.00020136741,0.00015880419,0.00012089518,0.0010451936,0.0020254466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994224,0.0014217091,0.000469882,0.0008091864,0.0020743418,0.001000782],"domain_scores_gemma":[0.97473294,0.009842767,0.0029756657,0.009111045,0.002703526,0.0006340735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005893502,0.0010181357,0.0011416819,0.0014482395,0.0013400512,0.0041059344,0.0024293049,0.0017401843,0.0029366813],"category_scores_gemma":[0.03205939,0.0010001485,0.0012960216,0.00076479145,0.0053637517,0.009861955,0.005782149,0.004129577,0.0009740127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081598485,0.00049530773,0.012270555,0.0011791436,0.00019358043,0.0006235763,0.0016040389,0.08197211,0.102197215,0.6321016,0.007915539,0.15863134],"study_design_scores_gemma":[0.00013551468,0.0007033047,0.001978492,0.00038474667,0.00025534077,0.0008375153,0.00037682222,0.4290887,0.18861844,0.34985638,0.027554665,0.00021007027],"about_ca_topic_score_codex":0.0006917145,"about_ca_topic_score_gemma":0.0005813307,"teacher_disagreement_score":0.005893502,"about_ca_system_score_codex":0.0010257366,"about_ca_system_score_gemma":0.0028784985,"threshold_uncertainty_score":0.031168163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2771548,0.0023049195,0.70654684,0.00065417745,0.000329194,0.00006948481,0.00012794128,0.0049435343,0.007869112],"genre_scores_gemma":[0.82591045,0.00043989797,0.17070073,0.00033446113,0.0000937858,0.000055388107,0.00011854404,0.00014787017,0.0021989227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992681,0.00018833227,0.000049635295,0.00012581483,0.00025277465,0.000115290895],"domain_scores_gemma":[0.9978963,0.0006363004,0.00026345326,0.00062751054,0.00045192073,0.00012441186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069111196,0.0005561769,0.00030563146,0.0004528597,0.0003273717,0.0011164688,0.0015025937,0.00027618132,0.001308706],"category_scores_gemma":[0.0025963911,0.00034426208,0.0002480205,0.00037487046,0.00044851055,0.0018279785,0.0009326835,0.00091736286,0.00038723406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001495227,0.00031715448,0.01568966,0.000347994,0.0001579599,0.0003491863,0.00046032146,0.23359862,0.25505567,0.04399757,0.008101461,0.44042918],"study_design_scores_gemma":[0.00006496373,0.0005344722,0.0017085226,0.00005949673,0.000118845746,0.00032257073,0.000085620806,0.83312625,0.12328548,0.013392935,0.02724152,0.000059309616],"about_ca_topic_score_codex":0.0013977356,"about_ca_topic_score_gemma":0.0025796131,"teacher_disagreement_score":0.0015025937,"about_ca_system_score_codex":0.0006394245,"about_ca_system_score_gemma":0.0015583236,"threshold_uncertainty_score":0.004639387},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006576197,0.00031618832,0.9669262,0.00015664507,0.00008604489,0.000087402484,0.00017983116,0.009807967,0.015863486],"genre_scores_gemma":[0.11659358,0.00042438984,0.8697488,0.00030415485,0.00004733578,0.00024051752,0.0005487314,0.0027054737,0.009387066],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994809,0.000097652606,0.000035327954,0.0000618355,0.000261955,0.000062284955],"domain_scores_gemma":[0.99954873,0.00017576954,0.00003543219,0.000100534,0.00011761408,0.0000219852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051411474,0.0008202419,0.00037357764,0.00064792944,0.00033777358,0.0013222515,0.0010188256,0.0005017345,0.012129308],"category_scores_gemma":[0.0011714548,0.00056982966,0.0005913585,0.0004178442,0.00056337775,0.0009280263,0.0007303864,0.0011707218,0.0028761742],"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.00045607216,0.00019010383,0.0010286163,0.0009760565,0.000113240785,0.00043760258,0.0004022152,0.24705192,0.0960317,0.13894604,0.029469056,0.48489732],"study_design_scores_gemma":[0.00023548928,0.00033998402,0.00037660732,0.00022290829,0.000071947405,0.00028251327,0.00007225814,0.61126995,0.13238733,0.0771459,0.17751418,0.000080892874],"about_ca_topic_score_codex":0.0013846324,"about_ca_topic_score_gemma":0.002350002,"teacher_disagreement_score":0.012129308,"about_ca_system_score_codex":0.0005641768,"about_ca_system_score_gemma":0.0010476914,"threshold_uncertainty_score":0.040576577},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05778978,0.00067253277,0.91258883,0.00036893494,0.00060737587,0.00014778982,0.00020777465,0.0048030643,0.022813914],"genre_scores_gemma":[0.27946454,0.00035532098,0.70830506,0.00035182695,0.00028330428,0.00019191248,0.00047629795,0.0010467664,0.009524893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982615,0.00033952747,0.00015394048,0.0002685868,0.0007676468,0.00020868545],"domain_scores_gemma":[0.9971008,0.00089824246,0.0001936766,0.0008052446,0.000836296,0.0001658069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016373121,0.001426489,0.0011139266,0.0011735646,0.0009636272,0.0017805218,0.0023423755,0.0005214429,0.007681669],"category_scores_gemma":[0.00716209,0.0004098135,0.00067339424,0.0021622367,0.0007457549,0.0041758264,0.0024363038,0.0011016479,0.002660366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072592864,0.00019477909,0.0024756866,0.0005659682,0.00017842172,0.00031032632,0.0003015506,0.0804255,0.06328897,0.104921035,0.021401392,0.7252105],"study_design_scores_gemma":[0.00011962211,0.0005969401,0.000768914,0.000084039384,0.000115296796,0.0006826085,0.00021221157,0.7011477,0.14727503,0.111639656,0.037268396,0.00008953636],"about_ca_topic_score_codex":0.0008564134,"about_ca_topic_score_gemma":0.002548144,"teacher_disagreement_score":0.007681669,"about_ca_system_score_codex":0.0008492553,"about_ca_system_score_gemma":0.001804541,"threshold_uncertainty_score":0.025697768},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007118507,0.0007759624,0.88351685,0.001553079,0.0012879211,0.00063396385,0.001749288,0.0726159,0.030748451],"genre_scores_gemma":[0.022911467,0.0009798135,0.9277809,0.0007886617,0.000386901,0.00054890977,0.003307139,0.024253026,0.019043135],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981482,0.00033537493,0.00023639585,0.00033176006,0.00075225945,0.00019602258],"domain_scores_gemma":[0.99375373,0.0020582785,0.00028381933,0.0012549751,0.0023633672,0.00028581763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014215566,0.0021403823,0.0011748906,0.0015903361,0.0013193111,0.0028166398,0.002030592,0.0007053252,0.08582882],"category_scores_gemma":[0.015413404,0.00179406,0.0014677738,0.0012173424,0.0007238597,0.002392935,0.003355336,0.004038983,0.072265856],"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.0006226709,0.0003414051,0.0025801917,0.0014707099,0.00017486811,0.0014843058,0.0013455914,0.012759896,0.03385292,0.046494193,0.19198424,0.70688903],"study_design_scores_gemma":[0.00022945927,0.0004498342,0.0033429633,0.0011521515,0.00011706776,0.002387705,0.0006129158,0.037078325,0.06760849,0.065692395,0.82102317,0.00030557928],"about_ca_topic_score_codex":0.0021765854,"about_ca_topic_score_gemma":0.002940019,"teacher_disagreement_score":0.08582882,"about_ca_system_score_codex":0.00064548774,"about_ca_system_score_gemma":0.0020401564,"threshold_uncertainty_score":0.287126},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88899684,0.0014424172,0.083884865,0.0003270282,0.00010313486,0.00007787174,0.00026267357,0.0040868116,0.020818384],"genre_scores_gemma":[0.9749742,0.00019100464,0.021179805,0.0000327776,0.000015272655,0.000027722015,0.00016809194,0.00013426955,0.003276862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997459,0.000028422623,0.0000125940005,0.000043020344,0.00011715788,0.00005287139],"domain_scores_gemma":[0.99976414,0.00005828602,0.00002957304,0.00004289094,0.00008903573,0.000016053882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023637232,0.0005968738,0.0002126054,0.00035477406,0.00020313605,0.00043231674,0.0005707007,0.00014497514,0.002846543],"category_scores_gemma":[0.0010784453,0.00013890647,0.0001487023,0.00040189823,0.000119219745,0.0005309274,0.00024085314,0.0002787412,0.00034079727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083133153,0.00017038468,0.010055842,0.00035197855,0.000065982545,0.00021115862,0.00019256618,0.07986345,0.20060487,0.0022502288,0.0058906544,0.6995116],"study_design_scores_gemma":[0.0001530779,0.002050235,0.020847471,0.000057617788,0.0001453982,0.00039426202,0.00012114656,0.63083494,0.31446892,0.0023389512,0.028521555,0.00006637562],"about_ca_topic_score_codex":0.0021577186,"about_ca_topic_score_gemma":0.0054564998,"teacher_disagreement_score":0.002846543,"about_ca_system_score_codex":0.00045775008,"about_ca_system_score_gemma":0.00056432415,"threshold_uncertainty_score":0.009522617},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94252414,0.0007704025,0.054129545,0.00014350738,0.00001226679,0.000016282145,0.00008154796,0.00025121964,0.0020711438],"genre_scores_gemma":[0.99475867,0.00014228576,0.0045787417,0.000012241462,0.0000035959677,0.000016482492,0.00009707516,0.000045771518,0.00034514608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994599,0.000089693924,0.000018741095,0.000057984245,0.00024291979,0.00013070965],"domain_scores_gemma":[0.9948862,0.003508101,0.0007154952,0.00034768856,0.00045092465,0.00009160706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005080538,0.00047447963,0.00042841304,0.00067201623,0.000387139,0.00075343036,0.0010066422,0.0008031754,0.0016425704],"category_scores_gemma":[0.0065049566,0.0003355439,0.00026536157,0.001132193,0.00054950855,0.0026707724,0.00054671377,0.00073712535,0.00029418452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069467974,0.00015751585,0.016818797,0.00022936243,0.00007880124,0.00047995686,0.0001599921,0.9048655,0.052033048,0.0068871523,0.0004535585,0.017141795],"study_design_scores_gemma":[0.00005128955,0.0004214779,0.010571124,0.000018065004,0.000038516955,0.00021996055,0.00015267698,0.9179489,0.05943069,0.010136527,0.00096676656,0.000044026736],"about_ca_topic_score_codex":0.00095583755,"about_ca_topic_score_gemma":0.0010694748,"teacher_disagreement_score":0.0016425704,"about_ca_system_score_codex":0.0005705539,"about_ca_system_score_gemma":0.00039393763,"threshold_uncertainty_score":0.005495012},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1359908,0.0003715973,0.8557995,0.00025430092,0.000040608713,0.000065521555,0.00007080415,0.0028980724,0.004508825],"genre_scores_gemma":[0.76413673,0.00022974817,0.23316613,0.00008356906,0.000038473947,0.00007432219,0.00023033394,0.00029165603,0.001749032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992513,0.00019722532,0.000042365788,0.000095633884,0.00028551495,0.00012782041],"domain_scores_gemma":[0.9986035,0.0006719845,0.000092988324,0.0002895347,0.00027838573,0.000063567706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008092055,0.00074895314,0.0006369162,0.00040772912,0.00042423824,0.00081868685,0.000892349,0.00049222953,0.001255994],"category_scores_gemma":[0.0041051973,0.00024156399,0.0003623886,0.0010228164,0.0004989136,0.0017210379,0.00092624186,0.0007694774,0.0006003498],"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.00021476384,0.00016594288,0.0016346577,0.00006721754,0.000028572085,0.000060500195,0.000092528455,0.82325727,0.019024044,0.0121438885,0.001926038,0.14138459],"study_design_scores_gemma":[0.0000035766668,0.000015779384,0.00009051721,0.0000013759065,0.000002044197,0.000007716014,0.000006930879,0.99449193,0.0028662006,0.0022334077,0.00027823652,0.0000023368564],"about_ca_topic_score_codex":0.002491873,"about_ca_topic_score_gemma":0.003052617,"teacher_disagreement_score":0.002491873,"about_ca_system_score_codex":0.0007545933,"about_ca_system_score_gemma":0.001304029,"threshold_uncertainty_score":0.0054749846},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9656205,0.0006411635,0.021934217,0.0001839785,0.00006709605,0.0000636698,0.00024395608,0.0018619415,0.009383342],"genre_scores_gemma":[0.9790925,0.00021252537,0.017459001,0.00003276738,0.000015517868,0.000026431495,0.0002892085,0.000087523455,0.0027844969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996474,0.000062857966,0.00001811829,0.000049983482,0.00016199033,0.00005969291],"domain_scores_gemma":[0.9990963,0.00025121897,0.00006060471,0.000098967736,0.00042567748,0.00006722061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039562344,0.0004926353,0.00038563673,0.00039800094,0.0003202079,0.00043385662,0.00058963127,0.0003799095,0.0022738178],"category_scores_gemma":[0.001445605,0.0001941326,0.00016033836,0.0006165275,0.00023846327,0.0005941126,0.00027292606,0.0003062679,0.0005018756],"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.0031787073,0.00046379777,0.009314948,0.0006389419,0.00018424705,0.00054176105,0.00025983359,0.50007784,0.3389407,0.007844245,0.0077729123,0.13078204],"study_design_scores_gemma":[0.000117276184,0.0013793949,0.00275438,0.000020151936,0.000055617667,0.00016382619,0.000060545266,0.7704626,0.22024374,0.00069685886,0.0040118154,0.000033857326],"about_ca_topic_score_codex":0.003561145,"about_ca_topic_score_gemma":0.0031502873,"teacher_disagreement_score":0.003561145,"about_ca_system_score_codex":0.000848664,"about_ca_system_score_gemma":0.0008783746,"threshold_uncertainty_score":0.007606685},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48766774,0.0016849685,0.49763593,0.0003558007,0.000039432965,0.00011113805,0.00011948916,0.0007795158,0.011606065],"genre_scores_gemma":[0.84020704,0.00039655704,0.15781052,0.000073126226,0.000014886689,0.00014599945,0.00009108295,0.00007767975,0.0011829961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970967,0.0001286552,0.000017690742,0.000035843932,0.000072321774,0.000035861845],"domain_scores_gemma":[0.99947196,0.00032202632,0.00007532489,0.000051041792,0.000065326545,0.0000143830275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000596828,0.0006854205,0.0003428738,0.00052385783,0.00024043785,0.000548272,0.0005512297,0.00029274978,0.0019017707],"category_scores_gemma":[0.0012446891,0.00030691095,0.00027639864,0.0003732946,0.0002685384,0.00078945403,0.00028022248,0.00036314703,0.00021520411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071306,0.00018884407,0.003020131,0.0005090895,0.000082677405,0.0002361007,0.00018872786,0.5057354,0.18818149,0.015262038,0.0012200373,0.28466246],"study_design_scores_gemma":[0.000115276394,0.0012272502,0.0013968846,0.00007085669,0.000120711426,0.00028869015,0.00013544694,0.85438854,0.11537696,0.017959177,0.008873679,0.000046447327],"about_ca_topic_score_codex":0.0002985576,"about_ca_topic_score_gemma":0.00055919075,"teacher_disagreement_score":0.0019017707,"about_ca_system_score_codex":0.00029107326,"about_ca_system_score_gemma":0.0004540659,"threshold_uncertainty_score":0.0063620806},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040119577,0.002631232,0.47256792,0.002299725,0.002490317,0.0006449969,0.010619826,0.115981996,0.35264435],"genre_scores_gemma":[0.38130507,0.002094046,0.2902027,0.0030570012,0.0008412753,0.0008407973,0.033293225,0.01327017,0.27509558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992593,0.000078658806,0.00003580797,0.00014711246,0.0003589148,0.00012016569],"domain_scores_gemma":[0.99885154,0.00015992163,0.00005654576,0.0004824193,0.00035868897,0.000090848844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006481277,0.0007339239,0.00046479,0.0006142828,0.00059389713,0.0015192109,0.0018329177,0.000678142,0.067147896],"category_scores_gemma":[0.0019078336,0.0004617744,0.0005318406,0.0007607061,0.00039115833,0.0019817706,0.002089677,0.0011561116,0.029480934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011067945,0.00024658654,0.0032408002,0.00063853187,0.00012046166,0.00056094857,0.0001823023,0.012802952,0.02819946,0.053182684,0.43860677,0.46111166],"study_design_scores_gemma":[0.00019912815,0.00035227288,0.002094145,0.0000829997,0.000054315547,0.00070849044,0.00009208211,0.0693373,0.038593784,0.030259151,0.8581542,0.000072082235],"about_ca_topic_score_codex":0.00085224834,"about_ca_topic_score_gemma":0.0014762136,"teacher_disagreement_score":0.067147896,"about_ca_system_score_codex":0.00046450252,"about_ca_system_score_gemma":0.0009426524,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17244595,0.0001221798,0.82379186,0.00028282148,0.000033184388,0.000069738824,0.000073639494,0.00027198961,0.0029085944],"genre_scores_gemma":[0.61454767,0.00015779222,0.38192883,0.00006425495,0.000044416724,0.0001698533,0.00025957424,0.00015472343,0.002672968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994875,0.00012102658,0.000020532168,0.00010388406,0.00018939264,0.00007755184],"domain_scores_gemma":[0.99838626,0.0009864096,0.00020476489,0.00018267812,0.00014815526,0.00009173508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010898717,0.00049040536,0.0007994769,0.00074041606,0.00069121504,0.0007754475,0.0011057404,0.0006882417,0.0022330107],"category_scores_gemma":[0.0036265552,0.00030195402,0.00067673647,0.0008035881,0.0011541673,0.001910396,0.0012308699,0.0010402333,0.00021727702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038167494,0.00008501006,0.00098359,0.00016687377,0.00003349832,0.00022980008,0.00015824882,0.8787772,0.01323973,0.05975763,0.0013079263,0.044878703],"study_design_scores_gemma":[0.000018639701,0.000028450813,0.00009749633,0.0000039056217,0.0000030211927,0.00005308898,0.000022237113,0.96620166,0.0027993652,0.03030107,0.0004669813,0.0000041107774],"about_ca_topic_score_codex":0.0014853885,"about_ca_topic_score_gemma":0.0018350903,"teacher_disagreement_score":0.0022330107,"about_ca_system_score_codex":0.0009994459,"about_ca_system_score_gemma":0.00079144933,"threshold_uncertainty_score":0.007470131},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14415598,0.00093853706,0.83123267,0.0007515718,0.00004184868,0.000118346965,0.00017312102,0.0002538342,0.02233414],"genre_scores_gemma":[0.89795727,0.0009921868,0.092840366,0.00010563753,0.000045049233,0.0002484878,0.00009831947,0.00016791621,0.0075447625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990397,0.00029801132,0.00004279386,0.00012298713,0.00032695167,0.00016964374],"domain_scores_gemma":[0.9977471,0.0017060471,0.00017048996,0.00020206196,0.00011743736,0.000056898065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011441245,0.00090536627,0.0007120215,0.00079651625,0.0005407067,0.001613957,0.0015126582,0.0012447087,0.004066065],"category_scores_gemma":[0.0062787887,0.00068648736,0.0006736593,0.0015611902,0.0015519749,0.0037588708,0.0009378841,0.0009716802,0.00058569707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004723273,0.000031388827,0.00019157754,0.000024950883,0.0000073360284,0.000027955817,0.00002979911,0.94019556,0.0012235721,0.053862955,0.00014300247,0.0042146463],"study_design_scores_gemma":[0.000008564019,0.000016238946,0.000057744455,0.000002808501,0.00000392368,0.000012274014,0.000008315174,0.9659235,0.000366599,0.03325657,0.0003397705,0.000003629922],"about_ca_topic_score_codex":0.0027244242,"about_ca_topic_score_gemma":0.0037278256,"teacher_disagreement_score":0.004066065,"about_ca_system_score_codex":0.0019554286,"about_ca_system_score_gemma":0.0009793852,"threshold_uncertainty_score":0.014187753},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15565908,0.0013659569,0.7967022,0.0020427525,0.00071094796,0.0003210088,0.00021639657,0.02764569,0.015335986],"genre_scores_gemma":[0.8011341,0.00032810535,0.18955305,0.0016048882,0.00012777957,0.00013521386,0.00019270786,0.0012742077,0.0056499424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990515,0.00023415958,0.0000845968,0.00018759369,0.00028885965,0.00015339963],"domain_scores_gemma":[0.9971348,0.00037273508,0.00025697253,0.0015133263,0.00045106647,0.00027101178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012809865,0.00041713062,0.00031780437,0.000398196,0.000967114,0.0010805622,0.0010084829,0.00057974213,0.0018340382],"category_scores_gemma":[0.003714027,0.00034229783,0.00026672418,0.0002929466,0.00090293563,0.0014167569,0.0008967048,0.0011713745,0.00090594706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010541942,0.0007555647,0.01001354,0.00036574094,0.0001187318,0.00033620838,0.0014526951,0.062325243,0.17020862,0.0737102,0.030450843,0.64920837],"study_design_scores_gemma":[0.00033107665,0.00085217995,0.00590675,0.00016823875,0.00013032298,0.0007521358,0.00045472142,0.59812015,0.16741699,0.0740734,0.15152107,0.0002730066],"about_ca_topic_score_codex":0.0021342086,"about_ca_topic_score_gemma":0.0027922103,"teacher_disagreement_score":0.0021342086,"about_ca_system_score_codex":0.00059167505,"about_ca_system_score_gemma":0.0012458159,"threshold_uncertainty_score":0.0067746043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008387473,0.00015385858,0.9964401,0.000028817094,0.00003316021,0.000085837804,0.00014011227,0.0006010981,0.0016781155],"genre_scores_gemma":[0.06940075,0.0008150521,0.9220575,0.0001393725,0.000083452884,0.0008819166,0.00080260914,0.0006271269,0.0051922197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908066,0.0001423657,0.000064151376,0.00013061521,0.0005083756,0.0000738582],"domain_scores_gemma":[0.9989513,0.00023952966,0.00007228366,0.00029443132,0.0004202736,0.000022106242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007911477,0.00091973506,0.0007054893,0.0017373395,0.00054124754,0.0010673327,0.0020713797,0.00069956743,0.007254806],"category_scores_gemma":[0.002961046,0.00053395814,0.0008185882,0.0012970071,0.00046832586,0.0010730748,0.0011881653,0.0014043468,0.003310652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000659156,0.00014687791,0.0013346924,0.0008842418,0.00015039185,0.0003718647,0.00023225557,0.2541335,0.083809644,0.33690938,0.012349075,0.30961227],"study_design_scores_gemma":[0.00002839992,0.00011392039,0.00044237028,0.00008570343,0.00005247811,0.00040049793,0.000043346314,0.7973263,0.039861627,0.09534224,0.0662398,0.00006334019],"about_ca_topic_score_codex":0.0010903666,"about_ca_topic_score_gemma":0.0010198584,"teacher_disagreement_score":0.007254806,"about_ca_system_score_codex":0.00055793324,"about_ca_system_score_gemma":0.0014278915,"threshold_uncertainty_score":0.02426976},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68231356,0.0034822817,0.2673186,0.0007922654,0.00037031452,0.00016232002,0.0003841529,0.0066831214,0.03849331],"genre_scores_gemma":[0.9736636,0.000485377,0.020982139,0.000079904756,0.000049948452,0.00007525711,0.00014817483,0.0001236525,0.004392009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992924,0.00012446358,0.000040986823,0.0000622618,0.00020429466,0.0002755734],"domain_scores_gemma":[0.9982151,0.00036755612,0.00016388054,0.0007405525,0.00034755998,0.0001654247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050549605,0.00061326375,0.00057074043,0.0006526656,0.0012159577,0.00090936915,0.0011733767,0.00034677458,0.0038820454],"category_scores_gemma":[0.0027978227,0.00038204508,0.0003470236,0.0009126407,0.000688001,0.001987447,0.0022223387,0.00065487257,0.0006869523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003444913,0.00030577718,0.00688209,0.00089624827,0.00015596666,0.0013654279,0.0010073351,0.27493784,0.14012831,0.32783967,0.019549705,0.2234868],"study_design_scores_gemma":[0.00018374009,0.00071765785,0.0024183493,0.00010841379,0.00014388707,0.00036909708,0.0005402487,0.76604074,0.09330461,0.110284396,0.025773596,0.000115359224],"about_ca_topic_score_codex":0.0024246213,"about_ca_topic_score_gemma":0.0031040497,"teacher_disagreement_score":0.0038820454,"about_ca_system_score_codex":0.00084036664,"about_ca_system_score_gemma":0.00088503043,"threshold_uncertainty_score":0.012986779},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009029407,0.00090338034,0.843638,0.00039084154,0.00042619492,0.00042233497,0.0070641376,0.11879905,0.019326728],"genre_scores_gemma":[0.07395132,0.0019301173,0.83507806,0.0008129697,0.00026865228,0.004174788,0.023091417,0.040178664,0.02051404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99869496,0.00025109528,0.0000959518,0.00011874177,0.00065092783,0.00018833486],"domain_scores_gemma":[0.9988574,0.00033572924,0.000095850875,0.00026024473,0.0002966504,0.00015422446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016040555,0.0015125977,0.0020779308,0.0016415712,0.0014427224,0.0020978844,0.009134023,0.0024955631,0.031825915],"category_scores_gemma":[0.003790885,0.0018198211,0.002546174,0.0021669702,0.0007452122,0.0029409693,0.0038283316,0.004174853,0.013135722],"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.0009833581,0.00069818564,0.0031151285,0.002796783,0.00076711044,0.0012342181,0.0005868804,0.33929014,0.036040187,0.12797378,0.26976836,0.21674587],"study_design_scores_gemma":[0.0005193149,0.00015642079,0.0008790622,0.00016436685,0.0000857838,0.0003439727,0.000040063336,0.69030553,0.02467487,0.04064919,0.24192291,0.00025847292],"about_ca_topic_score_codex":0.0033262356,"about_ca_topic_score_gemma":0.004532905,"teacher_disagreement_score":0.031825915,"about_ca_system_score_codex":0.0012320423,"about_ca_system_score_gemma":0.0030849648,"threshold_uncertainty_score":0.10646832},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060487628,0.002710584,0.86592084,0.0031099059,0.00060156523,0.0006624369,0.00028687154,0.010961014,0.05525922],"genre_scores_gemma":[0.4698696,0.0020575412,0.5065263,0.000791548,0.00071314606,0.0011882758,0.000650382,0.0028914206,0.015311814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99037886,0.0028809106,0.0005513483,0.0008918493,0.004668936,0.0006281368],"domain_scores_gemma":[0.9868519,0.0056700455,0.00075873267,0.0036225477,0.0026419861,0.00045468746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054566604,0.0008206094,0.0009822362,0.0010926297,0.0019599192,0.002768545,0.002267278,0.0013228403,0.00504914],"category_scores_gemma":[0.025531322,0.0007712811,0.0008210365,0.0013585732,0.0019675237,0.005819237,0.0050932053,0.0029278009,0.0019355108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014086879,0.00055684807,0.010048897,0.001457515,0.00031189315,0.00053747767,0.003911112,0.18914568,0.058711976,0.32414824,0.041656762,0.36810488],"study_design_scores_gemma":[0.00034695037,0.00052913756,0.002483392,0.00027934107,0.00030886466,0.0005484861,0.0007738723,0.54460543,0.06880026,0.202077,0.17899053,0.00025668688],"about_ca_topic_score_codex":0.0019041708,"about_ca_topic_score_gemma":0.0017286456,"teacher_disagreement_score":0.0054566604,"about_ca_system_score_codex":0.0009561208,"about_ca_system_score_gemma":0.0018992254,"threshold_uncertainty_score":0.028857887},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00802964,0.0006243469,0.8770458,0.0021978377,0.00082302425,0.00046872176,0.0007431605,0.037487194,0.072580256],"genre_scores_gemma":[0.059717443,0.002220102,0.82330334,0.0018960837,0.0005700293,0.0011137736,0.0019676704,0.010541054,0.0986705],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939275,0.00011983678,0.00003847985,0.00009417227,0.00027931816,0.000075357144],"domain_scores_gemma":[0.9975338,0.0011421426,0.00015403584,0.00032739074,0.0004899288,0.00035275868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010130907,0.0010475572,0.00047560624,0.0008883948,0.00066231104,0.0014773062,0.001455146,0.00076779746,0.062033422],"category_scores_gemma":[0.0053556934,0.0006413302,0.0006453629,0.0008587685,0.0007945335,0.0032955455,0.0017402057,0.0027310422,0.027142508],"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.0002620075,0.0005911605,0.0012052046,0.0011030954,0.000019774081,0.0006380254,0.0026013963,0.0037405384,0.022766173,0.10916485,0.28236535,0.5755424],"study_design_scores_gemma":[0.000098611934,0.00036886366,0.0012525067,0.00048417738,0.000021090294,0.0013852719,0.00027853888,0.015682772,0.02150664,0.05983667,0.8990185,0.00006633759],"about_ca_topic_score_codex":0.0005853664,"about_ca_topic_score_gemma":0.0010635052,"teacher_disagreement_score":0.062033422,"about_ca_system_score_codex":0.0007040774,"about_ca_system_score_gemma":0.0015280996,"threshold_uncertainty_score":0.20752245},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019436682,0.0004258492,0.9745589,0.00018706913,0.00007116492,0.0000883091,0.00004513563,0.00029088595,0.004895907],"genre_scores_gemma":[0.30218312,0.00061443384,0.69144297,0.00009187662,0.0000693205,0.0004292468,0.00012348304,0.00014337976,0.0049022273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997125,0.00006280849,0.000017949513,0.00005959271,0.000104801824,0.000042308206],"domain_scores_gemma":[0.9996141,0.00020009073,0.000047567704,0.00003960529,0.00007926465,0.000019414916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062007527,0.0007245858,0.0004934728,0.0004252102,0.0005569227,0.00094418804,0.0012482242,0.0006073328,0.002565002],"category_scores_gemma":[0.002167325,0.00033443925,0.0005704122,0.0006769539,0.0006645711,0.0011914513,0.00078645686,0.00067727815,0.00045457127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007947647,0.000028352859,0.00032941264,0.00008845591,0.000020586405,0.00006455829,0.000082106766,0.88595825,0.002356142,0.08014674,0.0014636563,0.02938226],"study_design_scores_gemma":[0.00001856065,0.00001635883,0.00003526895,0.0000068169816,0.000004612851,0.000011759596,0.000011998397,0.9866796,0.0005881032,0.011343265,0.0012801123,0.0000035787937],"about_ca_topic_score_codex":0.004210347,"about_ca_topic_score_gemma":0.0039985157,"teacher_disagreement_score":0.004210347,"about_ca_system_score_codex":0.0011769303,"about_ca_system_score_gemma":0.0012562812,"threshold_uncertainty_score":0.008580744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011161036,0.0001410702,0.84921044,0.000117028394,0.00013833347,0.00037340424,0.0004897192,0.13267373,0.0056951633],"genre_scores_gemma":[0.21896048,0.0004729094,0.699353,0.0009220209,0.00021939636,0.0014447903,0.0050834455,0.050647836,0.022896215],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984421,0.00014213719,0.00024435704,0.0003401769,0.0005882786,0.00024286481],"domain_scores_gemma":[0.99700695,0.0007777573,0.0002057688,0.0008100376,0.000983763,0.00021581276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021920914,0.0012712562,0.0011423031,0.0010979035,0.000547829,0.002155658,0.0034248438,0.0007419353,0.010315877],"category_scores_gemma":[0.003959578,0.0011730024,0.0013010175,0.0008122161,0.0006609761,0.0025879326,0.0018366947,0.0019924424,0.0068625105],"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.0040326673,0.0013293773,0.011320874,0.0015271031,0.0004057679,0.0014583459,0.0010975152,0.017554535,0.24965693,0.050156243,0.07100331,0.5904573],"study_design_scores_gemma":[0.0008869277,0.0005702547,0.00529779,0.00015894111,0.00030533594,0.0013963728,0.000120573335,0.3456709,0.37743264,0.014814603,0.252918,0.0004276682],"about_ca_topic_score_codex":0.0013247752,"about_ca_topic_score_gemma":0.0011571082,"teacher_disagreement_score":0.010315877,"about_ca_system_score_codex":0.00066324085,"about_ca_system_score_gemma":0.0013090825,"threshold_uncertainty_score":0.034510016},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7039854,0.003777459,0.21326679,0.00080065103,0.0003796845,0.00011154648,0.00028756828,0.0049165688,0.07247439],"genre_scores_gemma":[0.96437633,0.0006669316,0.029587828,0.00011093509,0.000056560548,0.000040959138,0.00016821825,0.00019192741,0.004800369],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998129,0.000015787955,0.0000112964935,0.00004143806,0.00008097857,0.00003766769],"domain_scores_gemma":[0.99947184,0.00015207108,0.00004626879,0.00013221227,0.00014686155,0.00005080276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019880214,0.0004237763,0.00020883112,0.0004616855,0.00026543648,0.00060132303,0.00047448167,0.0002618149,0.0035746035],"category_scores_gemma":[0.0014044604,0.00019382985,0.00013784417,0.00037576837,0.00035679052,0.000970459,0.0005974845,0.0005236359,0.0010529185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005635157,0.00029538939,0.0038721706,0.00030983126,0.000041563388,0.00029659105,0.0003022943,0.21998337,0.36798027,0.04200599,0.007974788,0.35637417],"study_design_scores_gemma":[0.00010208104,0.0007518938,0.006409396,0.0000647708,0.000050709164,0.00033527534,0.00020244629,0.7067483,0.20393287,0.043796588,0.037534263,0.000071304225],"about_ca_topic_score_codex":0.0005752394,"about_ca_topic_score_gemma":0.00074979005,"teacher_disagreement_score":0.0035746035,"about_ca_system_score_codex":0.00035312757,"about_ca_system_score_gemma":0.00034530705,"threshold_uncertainty_score":0.011958241},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032140765,0.00032615213,0.9554699,0.00013116753,0.00009322474,0.00021687022,0.0004374019,0.00662442,0.0045600524],"genre_scores_gemma":[0.46101934,0.00028300693,0.527248,0.00027985574,0.000081386526,0.0006265569,0.0019121869,0.0023595924,0.0061900993],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947647,0.0010664528,0.0002550566,0.0011206587,0.0023253374,0.00046776058],"domain_scores_gemma":[0.99232507,0.0020338527,0.000566891,0.002840821,0.0020116891,0.00022163596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002561061,0.0018235978,0.0015543707,0.0013608095,0.0007640437,0.0015806607,0.0014730513,0.0008325477,0.0031118842],"category_scores_gemma":[0.0115398,0.00078131625,0.0010274603,0.0014162881,0.00066698354,0.0022121968,0.0023798335,0.001627817,0.0017681052],"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.0014443278,0.0005955009,0.015103297,0.00056167704,0.00031760763,0.00022945157,0.00034097763,0.14564256,0.10917844,0.015737532,0.0091802385,0.7016684],"study_design_scores_gemma":[0.00008874016,0.0008352083,0.008967162,0.00009793708,0.0002043539,0.00042106895,0.00014642964,0.79066217,0.14163499,0.034168378,0.022601329,0.00017225022],"about_ca_topic_score_codex":0.0010166789,"about_ca_topic_score_gemma":0.0020355696,"teacher_disagreement_score":0.0031118842,"about_ca_system_score_codex":0.0006738748,"about_ca_system_score_gemma":0.0015470912,"threshold_uncertainty_score":0.013544381},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08309146,0.0014082598,0.894743,0.0004145792,0.00037604466,0.00026196352,0.00017628707,0.010567098,0.008961249],"genre_scores_gemma":[0.61493695,0.0006331228,0.37331712,0.00042571125,0.0000757437,0.0004040829,0.00040226654,0.00068658654,0.009118415],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99864656,0.00024427098,0.00012289512,0.00021348405,0.00060007244,0.000172693],"domain_scores_gemma":[0.9967456,0.00087297376,0.0003153983,0.0013714907,0.00058225123,0.00011240426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015860157,0.00043894054,0.000515999,0.0006720376,0.00078256463,0.0017399723,0.0035128754,0.000595348,0.0029325304],"category_scores_gemma":[0.0042878943,0.0006134307,0.00052031066,0.0005563887,0.0011965528,0.0027150784,0.0022397425,0.0017081675,0.00053488376],"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.0020441078,0.00054723927,0.0063487585,0.0011464967,0.00023841698,0.00034796025,0.0010207715,0.11823601,0.1372194,0.25600582,0.020834107,0.45601085],"study_design_scores_gemma":[0.00062800903,0.00090433826,0.0009156285,0.00014771338,0.00016413028,0.0003542221,0.00016528256,0.6564802,0.19395047,0.06553572,0.08055801,0.00019620474],"about_ca_topic_score_codex":0.0024927405,"about_ca_topic_score_gemma":0.005399502,"teacher_disagreement_score":0.0035128754,"about_ca_system_score_codex":0.0013285719,"about_ca_system_score_gemma":0.0033362934,"threshold_uncertainty_score":0.009810269},"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":"software","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007509185,0.0034842445,0.2990257,0.002818419,0.001285837,0.00057176326,0.02874563,0.44431263,0.21224661],"genre_scores_gemma":[0.11493561,0.0038802763,0.367434,0.006164935,0.0006844145,0.0016546334,0.10691967,0.12770587,0.2706206],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977533,0.00031078124,0.00014050634,0.00036366298,0.0011728236,0.00025885226],"domain_scores_gemma":[0.99675375,0.00074083137,0.00021506565,0.0005957842,0.0014277325,0.00026671457],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015045174,0.0014939706,0.0011435836,0.0020784817,0.0011070842,0.00342781,0.003932758,0.0017347167,0.19511828],"category_scores_gemma":[0.008957371,0.0009666986,0.0011134025,0.0014075655,0.0006845229,0.0033652706,0.003983528,0.0018721583,0.1587013],"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.00070143555,0.000121490375,0.0012266934,0.0008273747,0.00009556609,0.00024591235,0.00017575485,0.009720436,0.006182212,0.02538862,0.753862,0.20145248],"study_design_scores_gemma":[0.0002028197,0.000095636555,0.00071571686,0.0002240206,0.00005665365,0.00046473602,0.000078608035,0.040404454,0.011293199,0.022954004,0.9234007,0.00010944736],"about_ca_topic_score_codex":0.003964512,"about_ca_topic_score_gemma":0.0041633314,"teacher_disagreement_score":0.8048817,"about_ca_system_score_codex":0.00090553926,"about_ca_system_score_gemma":0.0020554047,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9684415,0.00011425096,0.0203543,0.000121608144,0.000042394295,0.00019249636,0.0025918465,0.0034367868,0.004704875],"genre_scores_gemma":[0.9685688,0.00014366895,0.026382936,0.00006627198,0.000008342399,0.0001795059,0.0032410421,0.0003179596,0.0010914926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995683,0.00008877058,0.00003975605,0.00007537455,0.00014608254,0.00008168029],"domain_scores_gemma":[0.99858177,0.0005752367,0.00009281106,0.00026330934,0.0004082962,0.00007852995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005379987,0.00080840784,0.00053406,0.0006729025,0.0004316245,0.0006249106,0.00151136,0.0006195094,0.0013300856],"category_scores_gemma":[0.0021926612,0.0004809079,0.000499506,0.0013148786,0.00035672006,0.0006161944,0.00032948487,0.0008432375,0.00028578946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025760286,0.0003314215,0.015651474,0.00012376103,0.00010815176,0.00026790216,0.00030785662,0.94574696,0.016714532,0.0021343639,0.004054589,0.014301448],"study_design_scores_gemma":[0.000022743554,0.00006100013,0.002325328,0.0000029782993,0.000006733434,0.000015918087,0.00003017083,0.9930692,0.0033796271,0.00020466311,0.0008720754,0.00000955852],"about_ca_topic_score_codex":0.020482158,"about_ca_topic_score_gemma":0.014280685,"teacher_disagreement_score":0.020482158,"about_ca_system_score_codex":0.0013208267,"about_ca_system_score_gemma":0.0011652358,"threshold_uncertainty_score":0.040725887},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54623246,0.0014421346,0.43611103,0.00021227865,0.00014854253,0.00016864305,0.00008384741,0.01241654,0.0031844957],"genre_scores_gemma":[0.8769246,0.00025155098,0.120869376,0.00007801238,0.000033186927,0.00006738679,0.00013162915,0.00034295427,0.0013014209],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994124,0.000113559494,0.000056765206,0.000115453775,0.00021601864,0.00008591497],"domain_scores_gemma":[0.9984262,0.00048051513,0.00025355694,0.00040945885,0.00033724977,0.000093019524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009240179,0.000779483,0.00040973615,0.0005745868,0.00034618957,0.0006305982,0.00091760105,0.0002326957,0.00075169955],"category_scores_gemma":[0.0027395957,0.00032283022,0.00024879805,0.0003361444,0.00028871652,0.00089881546,0.0005995119,0.0005370396,0.00024066238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00097253843,0.00037825186,0.013182192,0.00026937632,0.00010184492,0.0002699524,0.0004116785,0.10882049,0.45804226,0.004215206,0.0034010883,0.40993518],"study_design_scores_gemma":[0.000068324734,0.00044083124,0.0030419838,0.000017778362,0.00007184777,0.00011115685,0.000042736305,0.8606503,0.1292513,0.0014913272,0.004784505,0.000027836877],"about_ca_topic_score_codex":0.0019655854,"about_ca_topic_score_gemma":0.0021030016,"teacher_disagreement_score":0.0019655854,"about_ca_system_score_codex":0.00040720688,"about_ca_system_score_gemma":0.0014897933,"threshold_uncertainty_score":0.0048867464},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5516189,0.0005774103,0.42916837,0.00027706518,0.000100179175,0.00030843148,0.00016812685,0.005822406,0.01195921],"genre_scores_gemma":[0.90560156,0.000108407694,0.09006891,0.00004759258,0.00002635023,0.00008961065,0.00017887903,0.00015622264,0.0037225382],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974984,0.000026592686,0.000013127475,0.000037336224,0.00012660444,0.00004660721],"domain_scores_gemma":[0.9997162,0.0001078926,0.000032203847,0.00003149156,0.000094155235,0.000018076495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024712682,0.0004154431,0.00027740002,0.00038945905,0.00043367696,0.00048302233,0.0007045087,0.0002037125,0.0027932315],"category_scores_gemma":[0.00082031736,0.00015941591,0.00012306908,0.00025163166,0.00017764635,0.0005514683,0.0002553855,0.00041387026,0.00042817643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015238081,0.00036273958,0.0041871574,0.0003046181,0.000083169296,0.0003846894,0.00031909486,0.18424973,0.46736765,0.0077435044,0.0065812008,0.3268926],"study_design_scores_gemma":[0.0001044545,0.00087836455,0.0018157107,0.000015352316,0.00004053334,0.00017288148,0.000052930118,0.6541305,0.33224395,0.0009079809,0.009595537,0.000041692736],"about_ca_topic_score_codex":0.0019829737,"about_ca_topic_score_gemma":0.0023826768,"teacher_disagreement_score":0.0027932315,"about_ca_system_score_codex":0.00085313834,"about_ca_system_score_gemma":0.0008172257,"threshold_uncertainty_score":0.00934428},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39294985,0.0017566126,0.5737965,0.00085351255,0.0006076381,0.00026043676,0.00040891377,0.010223273,0.019143222],"genre_scores_gemma":[0.8589254,0.00031006074,0.13223554,0.00035836248,0.00014042076,0.00014937368,0.0003733683,0.00025592392,0.007251658],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968827,0.000035920773,0.000026791578,0.00005532439,0.00013920972,0.000054542765],"domain_scores_gemma":[0.9993057,0.000110879395,0.00005825541,0.0003098541,0.00016175114,0.000053460917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023557608,0.00033033284,0.000406099,0.000363688,0.0006108231,0.0008481895,0.00120463,0.00045121065,0.0029503694],"category_scores_gemma":[0.0008331585,0.0003264853,0.00026404168,0.0004302379,0.00024901138,0.0011751497,0.0011098604,0.0007808547,0.00085041986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007524659,0.0004903188,0.005702775,0.0003036802,0.00008986949,0.0009116259,0.00045149893,0.05749391,0.48775542,0.037239585,0.018869573,0.38993925],"study_design_scores_gemma":[0.000107585984,0.00059582724,0.0025029846,0.00005831803,0.000086718435,0.0006165404,0.00017766813,0.6598715,0.279612,0.008746967,0.047526278,0.00009761915],"about_ca_topic_score_codex":0.00073932175,"about_ca_topic_score_gemma":0.002344728,"teacher_disagreement_score":0.0029503694,"about_ca_system_score_codex":0.00043206045,"about_ca_system_score_gemma":0.0012151425,"threshold_uncertainty_score":0.009869993},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64830625,0.0009076846,0.32236782,0.0011165787,0.0004060538,0.00016475821,0.00027367478,0.011746665,0.014710451],"genre_scores_gemma":[0.9391212,0.00009095453,0.055372622,0.00015441167,0.00003674173,0.000032754087,0.00011106359,0.00023302261,0.0048472336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990958,0.00019299032,0.000042971795,0.00015339062,0.00023856845,0.00027623717],"domain_scores_gemma":[0.99846494,0.00045214116,0.00008657836,0.00053782936,0.00029925778,0.00015930273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009010908,0.0009955202,0.0014739409,0.00054776453,0.0015313968,0.0014919328,0.0024573887,0.0005699967,0.0035676078],"category_scores_gemma":[0.0016060256,0.0004720697,0.0005502053,0.00081373437,0.0005870588,0.0014070221,0.0014695297,0.00081538816,0.00035036827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0075782877,0.00089208933,0.0074172732,0.00027279556,0.00022852822,0.0006470784,0.0004511478,0.6814826,0.03433896,0.01998475,0.016334152,0.2303724],"study_design_scores_gemma":[0.000104952844,0.00018521278,0.00060599076,0.000005220732,0.00005879152,0.00007102833,0.00011603668,0.98117596,0.011720202,0.0046401178,0.0012941797,0.000022235125],"about_ca_topic_score_codex":0.007130362,"about_ca_topic_score_gemma":0.015621335,"teacher_disagreement_score":0.007130362,"about_ca_system_score_codex":0.001262868,"about_ca_system_score_gemma":0.0030640648,"threshold_uncertainty_score":0.01417768},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88225335,0.0009985417,0.110090435,0.0003328395,0.0000795935,0.000072639334,0.000070393035,0.003057097,0.0030450162],"genre_scores_gemma":[0.9866028,0.00009228522,0.01262941,0.00006417081,0.000019536006,0.000023960682,0.00005393185,0.00011749259,0.00039646117],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901676,0.00018193088,0.000067361434,0.00016317156,0.0003030382,0.00026758434],"domain_scores_gemma":[0.99791473,0.0006467856,0.0003393095,0.00056320155,0.0003403505,0.0001956671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009444908,0.0007095622,0.0006916371,0.000651801,0.0011830707,0.001220089,0.001906739,0.0004616567,0.0007190329],"category_scores_gemma":[0.0041326964,0.00042463597,0.000240533,0.0010647349,0.0007195597,0.0011614559,0.0018247092,0.0009949437,0.00021842025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022276295,0.0007552258,0.033929635,0.00028835406,0.00015934114,0.0012402717,0.001137497,0.3484595,0.35055497,0.008135416,0.0070634894,0.2460487],"study_design_scores_gemma":[0.000091981055,0.0005145736,0.0052063824,0.00001732395,0.00005363028,0.00048504389,0.00038129705,0.85747564,0.12811066,0.0043458994,0.0032645806,0.00005290245],"about_ca_topic_score_codex":0.0030232868,"about_ca_topic_score_gemma":0.004499091,"teacher_disagreement_score":0.0030232868,"about_ca_system_score_codex":0.0011237705,"about_ca_system_score_gemma":0.0019679356,"threshold_uncertainty_score":0.008153558},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04135673,0.00030367487,0.9487552,0.0001364288,0.00004943952,0.00010160965,0.00032908784,0.0023305044,0.006637295],"genre_scores_gemma":[0.81620914,0.00043357606,0.17761858,0.000077004624,0.000019571313,0.0003202392,0.00036539207,0.00040070253,0.0045558857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974173,0.00006614357,0.000013432986,0.00003734283,0.00011271816,0.000028599292],"domain_scores_gemma":[0.99955255,0.000192666,0.00005535667,0.0000901683,0.00009156763,0.000017674976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024484668,0.0006198058,0.00042321027,0.00034369197,0.0003063269,0.0007148689,0.0012809358,0.00061277446,0.0019859776],"category_scores_gemma":[0.0011987301,0.0003511017,0.0005000038,0.0002735453,0.00037534785,0.00085321395,0.0004354782,0.0007314323,0.00040767918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008524931,0.000030089124,0.000634006,0.00013137804,0.00001777764,0.00015090746,0.000087017295,0.96286875,0.011866911,0.010467121,0.0007344484,0.012926316],"study_design_scores_gemma":[0.000010933823,0.00003503655,0.00009302608,0.000008279298,0.0000060683938,0.00002515788,0.0000060039556,0.9932948,0.00354019,0.001235488,0.0017389517,0.000006037396],"about_ca_topic_score_codex":0.005162605,"about_ca_topic_score_gemma":0.0039483067,"teacher_disagreement_score":0.005162605,"about_ca_system_score_codex":0.0005293326,"about_ca_system_score_gemma":0.00082856056,"threshold_uncertainty_score":0.010265112},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012301232,0.008564584,0.0452795,0.007106952,0.005958056,0.00072272087,0.00585832,0.009914083,0.90429467],"genre_scores_gemma":[0.06130376,0.0053241057,0.027230892,0.0044905976,0.0014525426,0.00046268562,0.010722136,0.0022797056,0.8867336],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99900633,0.00013777202,0.00006983851,0.0002582312,0.0003920637,0.00013589852],"domain_scores_gemma":[0.9982843,0.00021433138,0.000119446486,0.00039349645,0.00070706394,0.00028142714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008057538,0.0009768988,0.0007232953,0.0016729381,0.0019362487,0.0034846708,0.002882395,0.0015949187,0.38046768],"category_scores_gemma":[0.0032990102,0.00044036482,0.00069806766,0.0015107478,0.0006714772,0.0033601983,0.0037616699,0.0013861721,0.21352522],"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.00047220202,0.00015063306,0.001758316,0.0011137131,0.000035006255,0.00042100053,0.00051860063,0.00082916167,0.0066876244,0.05145112,0.42067719,0.5158854],"study_design_scores_gemma":[0.000014386737,0.000051809027,0.00082215515,0.00008488009,0.000012611597,0.00033124196,0.000121607285,0.0006295758,0.001554898,0.0047154757,0.9916481,0.00001317986],"about_ca_topic_score_codex":0.002434229,"about_ca_topic_score_gemma":0.0033513138,"teacher_disagreement_score":0.38046768,"about_ca_system_score_codex":0.0012263674,"about_ca_system_score_gemma":0.0015933599,"threshold_uncertainty_score":0},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01477188,0.006114106,0.75627345,0.002345573,0.001645153,0.0006776175,0.009054597,0.102647126,0.10647044],"genre_scores_gemma":[0.16844504,0.0044168034,0.7084934,0.0014341163,0.0010951466,0.0017975302,0.022006763,0.009478608,0.08283258],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99879646,0.00030753855,0.00006810328,0.00016162879,0.0004649277,0.00020126041],"domain_scores_gemma":[0.9988091,0.00016748323,0.000099570934,0.0004473065,0.00035507802,0.000121484976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007805876,0.0007001394,0.0008569178,0.0014826653,0.0019164727,0.0021103274,0.003197972,0.001274503,0.03111596],"category_scores_gemma":[0.0021807845,0.00051946304,0.0007837591,0.0028712854,0.00048388552,0.001944038,0.0032904013,0.0021909832,0.029223135],"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.00048993574,0.00019894488,0.002214327,0.0016315774,0.00021673106,0.0006208937,0.00034020026,0.015728964,0.025111387,0.101006426,0.41418338,0.4382573],"study_design_scores_gemma":[0.00007527235,0.00015050887,0.0014731498,0.000117898526,0.00007902871,0.00063053495,0.000107971966,0.05275072,0.030630678,0.017984476,0.89589894,0.00010086895],"about_ca_topic_score_codex":0.0015619961,"about_ca_topic_score_gemma":0.0012933107,"teacher_disagreement_score":0.03111596,"about_ca_system_score_codex":0.0007373256,"about_ca_system_score_gemma":0.00137732,"threshold_uncertainty_score":0.104093194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8198461,0.00076526013,0.17706878,0.00053244934,0.00002249201,0.000047076468,0.000113497415,0.0006212924,0.00098304],"genre_scores_gemma":[0.9777395,0.00009482676,0.021685869,0.000034128847,0.0000137824245,0.000026607217,0.00012144477,0.000050853676,0.00023298225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731183,0.0011214964,0.00012495475,0.0005397355,0.0007274674,0.00017453024],"domain_scores_gemma":[0.96825314,0.025658406,0.0023706122,0.0021914311,0.0013202252,0.00020622816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003656734,0.00095914816,0.0007272218,0.0007897147,0.0004342739,0.00081899425,0.000977914,0.0005906797,0.00046889158],"category_scores_gemma":[0.02955872,0.00037510926,0.00062946667,0.0012992623,0.00047599358,0.0013554527,0.00051845936,0.0009286901,0.00007025622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016626545,0.00015802057,0.041851785,0.000059723214,0.00009972431,0.00014069647,0.00013147513,0.909655,0.0048825815,0.0020602625,0.0004474716,0.040347062],"study_design_scores_gemma":[0.000003628794,0.00003773088,0.0031310697,0.0000030740425,0.000008219765,0.000027521228,0.000014414626,0.9948855,0.0013405774,0.00045612175,0.00008755174,0.0000046547425],"about_ca_topic_score_codex":0.005996662,"about_ca_topic_score_gemma":0.0028950763,"teacher_disagreement_score":0.005996662,"about_ca_system_score_codex":0.00063416024,"about_ca_system_score_gemma":0.0010505174,"threshold_uncertainty_score":0.019338846},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097076155,0.00020577927,0.8954623,0.00030606292,0.00004278581,0.00018852616,0.0002752502,0.001872496,0.0045706537],"genre_scores_gemma":[0.7136075,0.00026730116,0.2805046,0.00030694724,0.00006602401,0.00045639084,0.000488667,0.00059690524,0.003705689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951633,0.001481294,0.00058921974,0.00047838126,0.0016199782,0.0006677791],"domain_scores_gemma":[0.9916609,0.0038239148,0.00085910177,0.0022497566,0.0012739206,0.00013255999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004886143,0.00073024136,0.00063033774,0.00068819406,0.00085601397,0.0032570392,0.0021405118,0.0013932355,0.0016755149],"category_scores_gemma":[0.012240342,0.0011704894,0.0011762707,0.0006430666,0.0020408535,0.004934526,0.00307898,0.0019877136,0.00022647496],"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.0005711354,0.0001862778,0.0069629485,0.0004420161,0.0001369648,0.0010874917,0.002194637,0.20912887,0.035144415,0.7032832,0.0023795085,0.038482554],"study_design_scores_gemma":[0.0002552254,0.0003872327,0.0011484219,0.00014239615,0.00022757378,0.00052740844,0.000632735,0.5430593,0.13054554,0.29679585,0.026190786,0.0000875684],"about_ca_topic_score_codex":0.0023474435,"about_ca_topic_score_gemma":0.0025418182,"teacher_disagreement_score":0.004886143,"about_ca_system_score_codex":0.0010322005,"about_ca_system_score_gemma":0.0016387517,"threshold_uncertainty_score":0.02584064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9660565,0.00031194644,0.020158889,0.00016377568,0.00006879525,0.00003041136,0.00014890799,0.0011808493,0.0118798185],"genre_scores_gemma":[0.9869125,0.000093538925,0.011405915,0.000019880688,0.000008962672,0.000020164704,0.00023747518,0.00012626628,0.0011752786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999201,0.00017227947,0.00004958716,0.000102019854,0.00034032247,0.00013485808],"domain_scores_gemma":[0.99705064,0.0014877524,0.00017225515,0.0005134601,0.00060078106,0.00017510717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059998804,0.00045367866,0.00055424427,0.0007876412,0.0004858676,0.0009593908,0.0008695708,0.00044052376,0.0027878496],"category_scores_gemma":[0.0062804315,0.00021822333,0.00019714686,0.0019434764,0.0005710293,0.00084562885,0.0006051882,0.00040358194,0.00040793733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017218133,0.00031754142,0.018817954,0.0002956556,0.00010418263,0.0006977516,0.0008093639,0.79606295,0.042639107,0.012159033,0.005937235,0.12043743],"study_design_scores_gemma":[0.000028358345,0.00016589374,0.0028639236,0.000007486182,0.000009032066,0.0000690013,0.00013012136,0.98246264,0.011242497,0.0013147903,0.0016954397,0.000010836019],"about_ca_topic_score_codex":0.0068480284,"about_ca_topic_score_gemma":0.0029656037,"teacher_disagreement_score":0.0068480284,"about_ca_system_score_codex":0.0006813672,"about_ca_system_score_gemma":0.00074628746,"threshold_uncertainty_score":0.013616383},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004176176,0.00041719584,0.9731799,0.0006989952,0.00016044668,0.00011732968,0.00020777804,0.011723719,0.009318518],"genre_scores_gemma":[0.107729845,0.0013454446,0.87140644,0.0005325213,0.00026591055,0.0009546843,0.0009438061,0.003164993,0.013656297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833244,0.0004975825,0.00013700871,0.00016056377,0.0007021449,0.00017031931],"domain_scores_gemma":[0.9990257,0.00033581274,0.00008280514,0.0003140159,0.00015149509,0.00009016118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012786321,0.0008108508,0.00061087054,0.00075247395,0.0012014672,0.0026063828,0.0027545623,0.0012090931,0.003024696],"category_scores_gemma":[0.002952693,0.0007126018,0.0011497813,0.0013610596,0.0011365516,0.0023743967,0.0019878233,0.0028879575,0.0020989568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050889066,0.00020473119,0.0023815462,0.00084199745,0.0001548318,0.00086640706,0.00096189574,0.119982,0.030528119,0.5807678,0.06075442,0.20204741],"study_design_scores_gemma":[0.0001641973,0.00014356211,0.0008326593,0.00012513496,0.00006918357,0.0006211522,0.00011736892,0.5648528,0.02111031,0.1593326,0.25252625,0.00010475928],"about_ca_topic_score_codex":0.0017190883,"about_ca_topic_score_gemma":0.001939256,"teacher_disagreement_score":0.003024696,"about_ca_system_score_codex":0.00081931823,"about_ca_system_score_gemma":0.0013631325,"threshold_uncertainty_score":0.010118604},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028892282,0.00022477868,0.95744747,0.00015414847,0.00010471729,0.00012847483,0.00009133943,0.0054055164,0.0075512985],"genre_scores_gemma":[0.18447933,0.00035068026,0.8067794,0.00014838658,0.00006282448,0.00011787591,0.00030653313,0.00093668833,0.006818363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948186,0.00012374952,0.00006602619,0.00007119537,0.00021277666,0.000044428016],"domain_scores_gemma":[0.9985954,0.00036369512,0.000101083184,0.00041907467,0.0004884175,0.000032269356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007483638,0.00045438716,0.00021577901,0.00037418335,0.00027054595,0.00067856157,0.00086758245,0.00022006372,0.0050026476],"category_scores_gemma":[0.0019292387,0.00032578755,0.0004501141,0.000434709,0.00026840658,0.0010696357,0.0003163184,0.00063446246,0.0010332327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038787324,0.00015144871,0.0034286117,0.0006109902,0.000080530284,0.00060076354,0.0003478681,0.10769612,0.22122028,0.04285359,0.009310379,0.6133115],"study_design_scores_gemma":[0.0001766013,0.00077342306,0.0016671121,0.00011001991,0.00010926455,0.0016589807,0.00009433603,0.5387731,0.29955682,0.016908431,0.14007841,0.00009350697],"about_ca_topic_score_codex":0.000878463,"about_ca_topic_score_gemma":0.0013860547,"teacher_disagreement_score":0.0050026476,"about_ca_system_score_codex":0.0003916921,"about_ca_system_score_gemma":0.0007886284,"threshold_uncertainty_score":0.016735494},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013184395,0.005770763,0.67202306,0.008060196,0.009655034,0.00043201668,0.0051777004,0.09253247,0.19316435],"genre_scores_gemma":[0.14696875,0.0044519063,0.51043195,0.012173587,0.004404098,0.0007486402,0.016401619,0.022726435,0.281693],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855846,0.00014349676,0.00011753645,0.00024028413,0.0007478802,0.00019233952],"domain_scores_gemma":[0.99824905,0.00021226407,0.00012666613,0.0005688851,0.0007091452,0.00013405365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010303118,0.0012594165,0.0006546754,0.0013060855,0.0011461426,0.00386986,0.002478882,0.0015704698,0.05335507],"category_scores_gemma":[0.003078497,0.0007553239,0.0007633406,0.0017549052,0.0013672326,0.005240204,0.0022328554,0.0018963334,0.02635938],"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.0004999826,0.00008398857,0.00086898665,0.0004085005,0.000036741647,0.0003085088,0.00018141842,0.0038876666,0.023762293,0.0504036,0.5554495,0.36410883],"study_design_scores_gemma":[0.000044703927,0.00020107283,0.000592482,0.000120346354,0.000021655085,0.00050200685,0.000051237857,0.02165219,0.036583092,0.014041559,0.92610425,0.00008533208],"about_ca_topic_score_codex":0.005162811,"about_ca_topic_score_gemma":0.00626426,"teacher_disagreement_score":0.05335507,"about_ca_system_score_codex":0.0018619407,"about_ca_system_score_gemma":0.0018016411,"threshold_uncertainty_score":0.17849046},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039867423,0.00059307204,0.63091725,0.0004038168,0.00054139516,0.00033409652,0.002598186,0.29806432,0.026680391],"genre_scores_gemma":[0.22934078,0.00041932735,0.7067633,0.0005275131,0.00023105639,0.00057928526,0.010879388,0.023021273,0.028238071],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993655,0.00007859489,0.0000427848,0.0001225462,0.00028637744,0.00010414514],"domain_scores_gemma":[0.9992537,0.00010098326,0.000027874596,0.0003065868,0.00019281846,0.000117958305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063621457,0.0009083079,0.0011101036,0.00065083604,0.00085258007,0.0013775962,0.0030271758,0.00076857454,0.016911076],"category_scores_gemma":[0.0016194244,0.00074013876,0.000778557,0.000982511,0.00036771956,0.0012749267,0.001997957,0.0019929989,0.007835767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034200428,0.0009076785,0.0056591933,0.0006484195,0.0005489343,0.0005788459,0.0004616186,0.06975383,0.11630545,0.024979712,0.19950797,0.57722837],"study_design_scores_gemma":[0.00093068666,0.00035922442,0.0044627627,0.00004910336,0.00021101588,0.0002826473,0.00006282961,0.7786613,0.06545609,0.01687125,0.1324568,0.00019619253],"about_ca_topic_score_codex":0.0043727728,"about_ca_topic_score_gemma":0.0061418163,"teacher_disagreement_score":0.016911076,"about_ca_system_score_codex":0.000627108,"about_ca_system_score_gemma":0.0018108409,"threshold_uncertainty_score":0.056573212},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12720184,0.001528178,0.82702917,0.0006191028,0.0001819005,0.0001289613,0.00008250249,0.0135418195,0.029686444],"genre_scores_gemma":[0.43413645,0.0007931248,0.55569005,0.00017315311,0.000043823824,0.00009886717,0.00018668134,0.0013037523,0.007574115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917233,0.00015113417,0.000053259,0.000113085174,0.00041059416,0.000099705045],"domain_scores_gemma":[0.99895585,0.0002876154,0.00012878496,0.0003739368,0.00017011553,0.00008371665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007049805,0.00039160755,0.00030526042,0.00036026724,0.00050200376,0.0010739041,0.0010466076,0.0003016019,0.0011483135],"category_scores_gemma":[0.0018853211,0.0003908473,0.0003878895,0.00051116897,0.00043199168,0.0016943162,0.00091837783,0.00084093143,0.00045008576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065683696,0.0004288373,0.008355636,0.0005234833,0.00019091816,0.0013000151,0.0009813175,0.07254516,0.32059723,0.08599986,0.0098400125,0.4985807],"study_design_scores_gemma":[0.00019811683,0.0004694531,0.006459556,0.00012434233,0.00021058838,0.0015812563,0.00018757307,0.59987026,0.21038662,0.049061555,0.13132414,0.00012652842],"about_ca_topic_score_codex":0.001311418,"about_ca_topic_score_gemma":0.0030477569,"teacher_disagreement_score":0.001311418,"about_ca_system_score_codex":0.00037362694,"about_ca_system_score_gemma":0.001218611,"threshold_uncertainty_score":0.0038415194},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07430238,0.0017113595,0.89717937,0.0007719018,0.00026669816,0.00013391307,0.00084152835,0.009171007,0.015621894],"genre_scores_gemma":[0.36822635,0.0007420553,0.61842847,0.00030427513,0.00009133922,0.00022119163,0.0011851775,0.00069385674,0.010107328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997874,0.000059086367,0.000022760258,0.000036725436,0.000075542135,0.000018447787],"domain_scores_gemma":[0.998978,0.00033736762,0.00012951871,0.00027556316,0.0002552931,0.000024223427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017164812,0.00029069747,0.00024333513,0.00044426048,0.00032596212,0.00045333322,0.00061296346,0.00024148916,0.0066059795],"category_scores_gemma":[0.0012931998,0.00018498501,0.00015594994,0.00091943453,0.00021221978,0.0007021456,0.0003292688,0.00029626652,0.0019301792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000467,0.00015209864,0.0015273757,0.00070268096,0.00005595354,0.0002871179,0.00029646544,0.041727554,0.3520932,0.020451343,0.017488563,0.5647507],"study_design_scores_gemma":[0.00027810058,0.0009154632,0.0027397398,0.00006764582,0.00014380469,0.0012549598,0.00021468336,0.26888224,0.5312992,0.020828117,0.17329533,0.00008063528],"about_ca_topic_score_codex":0.00034981174,"about_ca_topic_score_gemma":0.0009278927,"teacher_disagreement_score":0.0066059795,"about_ca_system_score_codex":0.0002392072,"about_ca_system_score_gemma":0.00039691065,"threshold_uncertainty_score":0.022099197},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86491674,0.00023630072,0.11492549,0.0002396628,0.000080840895,0.00012340302,0.000591287,0.007264449,0.011621816],"genre_scores_gemma":[0.9739996,0.000065530076,0.024084669,0.000023897854,0.000006338627,0.00006480072,0.00043768948,0.00013170962,0.0011856381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965906,0.00009948304,0.00002227696,0.000040802963,0.00012722205,0.00005105534],"domain_scores_gemma":[0.9991466,0.0003455331,0.00004525057,0.00018873528,0.0002085721,0.0000653641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073212024,0.00042543685,0.0003764681,0.00027312053,0.0004941367,0.0006372377,0.0014106808,0.00036686068,0.0024587228],"category_scores_gemma":[0.0019892212,0.00025265434,0.00030490386,0.00050034944,0.00026847926,0.0008633524,0.00056287594,0.000560831,0.0003961231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013692295,0.00030982608,0.008093411,0.00011604143,0.00010208832,0.00017631678,0.00018342053,0.9115741,0.024146603,0.0057522906,0.0032408366,0.044935822],"study_design_scores_gemma":[0.00004452661,0.000101269005,0.0005855305,0.000002743606,0.000015879266,0.000018484645,0.000025426982,0.98761183,0.009784777,0.0009276098,0.0008744874,0.0000074712357],"about_ca_topic_score_codex":0.0053152703,"about_ca_topic_score_gemma":0.0036671949,"teacher_disagreement_score":0.0053152703,"about_ca_system_score_codex":0.0008530039,"about_ca_system_score_gemma":0.001148801,"threshold_uncertainty_score":0.010568678},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045265455,0.0019038402,0.898133,0.00042658212,0.0010274734,0.0012415681,0.0010503762,0.013793379,0.037158344],"genre_scores_gemma":[0.318596,0.0011381847,0.6049926,0.0005024004,0.00032421682,0.0018127841,0.0055113994,0.0030404592,0.064081885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980108,0.00023466261,0.00016306197,0.00058403396,0.0006523524,0.00035505655],"domain_scores_gemma":[0.9975721,0.00020774397,0.00011000199,0.001000102,0.0008776319,0.0002324116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013613825,0.000809867,0.0011299945,0.0017443233,0.0020678155,0.0022957318,0.0019158818,0.0008966227,0.013230726],"category_scores_gemma":[0.0041056788,0.00058764743,0.0011038403,0.0024726384,0.00047114518,0.0015264119,0.0017930842,0.0011297937,0.008199469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00116912,0.00033964554,0.008319627,0.0006464534,0.00033631243,0.00019166636,0.000917658,0.04262228,0.038733386,0.078407064,0.07458846,0.7537283],"study_design_scores_gemma":[0.00037554096,0.00034935414,0.0056072,0.00012662123,0.0002693451,0.00059543614,0.00042653445,0.48444712,0.06375228,0.10671172,0.33720154,0.00013726934],"about_ca_topic_score_codex":0.0038169753,"about_ca_topic_score_gemma":0.005522926,"teacher_disagreement_score":0.013230726,"about_ca_system_score_codex":0.0011410813,"about_ca_system_score_gemma":0.002518229,"threshold_uncertainty_score":0.044261158},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26962668,0.0056104655,0.63151443,0.0007094651,0.0009369514,0.00043027377,0.0014859835,0.015080827,0.0746049],"genre_scores_gemma":[0.78544426,0.0007893094,0.19127639,0.0004840968,0.00010891725,0.0001561643,0.0006195006,0.00016668814,0.020954685],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99988127,0.000012756752,0.0000091977945,0.000032942276,0.00004372725,0.000020153771],"domain_scores_gemma":[0.9998005,0.000036186546,0.000029031818,0.000050238035,0.00006844999,0.000015602307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012307259,0.00030796643,0.00020309325,0.00031745282,0.00020710853,0.0004833024,0.001734231,0.00028926015,0.0060299747],"category_scores_gemma":[0.00034261405,0.0001521386,0.00014084924,0.0003611725,0.00016630594,0.00070127496,0.00021450024,0.00025877455,0.0010526658],"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.00077711063,0.00014945204,0.0022177,0.00069833256,0.00006910061,0.0009131329,0.00016113558,0.009577006,0.27384368,0.023023278,0.02210768,0.66646236],"study_design_scores_gemma":[0.00023364568,0.0020396262,0.0039954726,0.00015984633,0.00021227739,0.0049100015,0.00011977795,0.096641265,0.65677124,0.0051770215,0.2296005,0.00013945303],"about_ca_topic_score_codex":0.00046713406,"about_ca_topic_score_gemma":0.00092095224,"teacher_disagreement_score":0.0060299747,"about_ca_system_score_codex":0.00032752153,"about_ca_system_score_gemma":0.00030690362,"threshold_uncertainty_score":0.020172238},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7526258,0.00020579812,0.24325897,0.00021237256,0.000013839071,0.00004138172,0.000057843776,0.0019313825,0.0016525625],"genre_scores_gemma":[0.9716979,0.00006224092,0.027850043,0.00001996794,0.0000044217386,0.000022553844,0.000054460124,0.00007369825,0.00021463935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895513,0.00042178796,0.000044912947,0.00014266609,0.0003390655,0.00009642487],"domain_scores_gemma":[0.9940843,0.0035541125,0.00058910594,0.0010488738,0.0005001218,0.00022351796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011852827,0.00045759152,0.00034800125,0.00049248367,0.0004573188,0.00081783184,0.00088743237,0.0003862939,0.0005614646],"category_scores_gemma":[0.00807405,0.00039453275,0.00032265208,0.0005677698,0.0009530244,0.002098134,0.0007004233,0.0007607061,0.00008168835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018703296,0.0007245837,0.033793803,0.00027376722,0.00017405221,0.0005177897,0.0011370659,0.5057144,0.29825473,0.04039142,0.00075993163,0.11638814],"study_design_scores_gemma":[0.000056516597,0.00045419834,0.0031373405,0.000012946744,0.000035451205,0.00017967945,0.0000791164,0.878315,0.08659852,0.02997372,0.0011234154,0.00003405364],"about_ca_topic_score_codex":0.0012687034,"about_ca_topic_score_gemma":0.0010518433,"teacher_disagreement_score":0.0012687034,"about_ca_system_score_codex":0.00050892576,"about_ca_system_score_gemma":0.0006151918,"threshold_uncertainty_score":0.0062684417},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037276756,0.0003171537,0.5914302,0.00017811233,0.00018167189,0.0002155846,0.004025339,0.3920683,0.007856006],"genre_scores_gemma":[0.05214376,0.00053003477,0.8210578,0.000519265,0.00011784427,0.0011826602,0.014379159,0.09834762,0.011721972],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983891,0.00022706491,0.00020746826,0.00032749338,0.0006945728,0.00015433031],"domain_scores_gemma":[0.9959596,0.0022330529,0.000323817,0.00041652564,0.0009504612,0.00011670147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018769231,0.0023178824,0.0010128258,0.0029496343,0.0007474202,0.0020065324,0.003052739,0.0010587692,0.05083043],"category_scores_gemma":[0.011797222,0.0014626009,0.0014364963,0.0011617269,0.0006701528,0.0020145914,0.0022965535,0.0018445239,0.021839902],"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.00092648435,0.00024855716,0.0035288439,0.0018493505,0.00027539357,0.0018978541,0.0009197111,0.03322038,0.03243632,0.027506433,0.38072938,0.5164614],"study_design_scores_gemma":[0.00057871395,0.00021578136,0.0029701635,0.0007498342,0.00012634689,0.002228987,0.0002180592,0.28202748,0.13320646,0.022046635,0.55522466,0.00040679032],"about_ca_topic_score_codex":0.0025561007,"about_ca_topic_score_gemma":0.0028800864,"teacher_disagreement_score":0.05083043,"about_ca_system_score_codex":0.0008140202,"about_ca_system_score_gemma":0.0017334826,"threshold_uncertainty_score":0.17004472},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08534762,0.00081091636,0.879931,0.0015353073,0.000120011515,0.00027854776,0.0006676901,0.0008667301,0.03044227],"genre_scores_gemma":[0.90485114,0.0019739228,0.06246328,0.00050455664,0.00015192035,0.0008674776,0.0006185427,0.0003681183,0.028201122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950325,0.0000785848,0.000024696934,0.00008366753,0.00021074756,0.00009903327],"domain_scores_gemma":[0.99901223,0.00039405574,0.00018460462,0.00009949303,0.0002426228,0.00006702176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090008683,0.00087572215,0.00090654026,0.0008796288,0.00060804957,0.0012543483,0.0031909205,0.0016078852,0.005320039],"category_scores_gemma":[0.0023551479,0.0008429475,0.0012016286,0.00070292363,0.0009169289,0.0025252767,0.00083405216,0.0017264837,0.0011619244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025256926,0.000045578246,0.00040433093,0.000040159724,0.000015353002,0.000084618216,0.000059401096,0.95925456,0.0034741494,0.03323926,0.000631016,0.0027263113],"study_design_scores_gemma":[0.0000063448842,0.000022196102,0.00018881718,0.00000400118,0.0000063793286,0.000028307142,0.000007469594,0.9916093,0.0002688118,0.0070211617,0.0008306728,0.0000065959307],"about_ca_topic_score_codex":0.0041567334,"about_ca_topic_score_gemma":0.0026588358,"teacher_disagreement_score":0.005320039,"about_ca_system_score_codex":0.0013443871,"about_ca_system_score_gemma":0.0013386594,"threshold_uncertainty_score":0.017797291},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025685245,0.0010810932,0.37678564,0.0012017573,0.0015860989,0.0009024615,0.024471804,0.37531096,0.19297487],"genre_scores_gemma":[0.2443532,0.0019263842,0.35062185,0.0025221175,0.00069981226,0.0016967433,0.07551098,0.06091585,0.26175308],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992243,0.000045884837,0.000056916484,0.00011355339,0.00047885586,0.000080522484],"domain_scores_gemma":[0.9986833,0.00021529442,0.000058247497,0.00023140693,0.0007064856,0.00010534403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092087674,0.00090322125,0.0009548727,0.0012982967,0.00058641116,0.002079658,0.0022388913,0.0009063053,0.10625667],"category_scores_gemma":[0.0036998773,0.0006581653,0.0005408718,0.0015038255,0.00030808008,0.0018247684,0.0011359975,0.0018111038,0.040589992],"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.001613738,0.00020799534,0.0035867377,0.00053456455,0.0000951299,0.0005173707,0.00031166646,0.006379333,0.042073563,0.023561912,0.67310697,0.24801107],"study_design_scores_gemma":[0.00043224884,0.00020558819,0.0019238719,0.000076779485,0.00007025278,0.0008000507,0.000074482195,0.13600424,0.092694886,0.0074242074,0.76018053,0.00011286176],"about_ca_topic_score_codex":0.0016680158,"about_ca_topic_score_gemma":0.0013784998,"teacher_disagreement_score":0.10625667,"about_ca_system_score_codex":0.00090765127,"about_ca_system_score_gemma":0.0011682115,"threshold_uncertainty_score":0.35546398},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9886303,0.0004264474,0.004455566,0.00009440432,0.00002418513,0.000048103106,0.00076828414,0.0015404132,0.0040123444],"genre_scores_gemma":[0.9878891,0.0001888517,0.0074042897,0.00003042005,0.000018408355,0.00007338007,0.0029086915,0.00040727205,0.0010797138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99825376,0.00029946992,0.00012478014,0.00024829913,0.0008350634,0.00023854521],"domain_scores_gemma":[0.9936812,0.002341342,0.000552337,0.0008562974,0.0020972658,0.00047152827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013919359,0.00060517987,0.0004553072,0.00095224567,0.0006370285,0.0005287197,0.0010907119,0.00036190683,0.001407061],"category_scores_gemma":[0.0075861886,0.00030148603,0.00020527665,0.002441817,0.00062950264,0.0008910308,0.0006481907,0.00057116814,0.00038277765],"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.011660307,0.0021283387,0.08551722,0.0014066319,0.00020036571,0.0017128352,0.001850897,0.3701205,0.31952745,0.01456421,0.03766085,0.15365046],"study_design_scores_gemma":[0.00046989435,0.0032711285,0.08161423,0.00004770834,0.00008968933,0.0008388992,0.00068041874,0.6858487,0.2118982,0.0038387247,0.011290038,0.00011237488],"about_ca_topic_score_codex":0.0032889333,"about_ca_topic_score_gemma":0.0030565783,"teacher_disagreement_score":0.0032889333,"about_ca_system_score_codex":0.00072293734,"about_ca_system_score_gemma":0.0009101302,"threshold_uncertainty_score":0.0073613524},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27676085,0.003087567,0.61067003,0.002060222,0.0023595437,0.00042512672,0.0007629404,0.015790133,0.088083625],"genre_scores_gemma":[0.740441,0.0005064108,0.18399087,0.0010109452,0.00031427902,0.0001757753,0.001007389,0.0006436093,0.07190973],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998472,0.000014378168,0.000012788011,0.000041093943,0.000061863226,0.000022690596],"domain_scores_gemma":[0.99978584,0.000019998706,0.00001625564,0.00005462076,0.000084574654,0.000038699498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013271326,0.0003868118,0.0002893746,0.0002857159,0.0003571897,0.0007260895,0.0010987028,0.0003537551,0.011226666],"category_scores_gemma":[0.00045833734,0.00021499123,0.0002087077,0.0002851575,0.00014850887,0.0008401794,0.0007138586,0.00086608867,0.003507293],"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.0014159539,0.00062137196,0.0023148023,0.00060137245,0.00012435595,0.0010273063,0.00016891742,0.007197026,0.529061,0.02742969,0.06252922,0.36750892],"study_design_scores_gemma":[0.0005849376,0.0019718725,0.0031807935,0.000105234096,0.00021186571,0.0028504957,0.00008652186,0.23287758,0.41916168,0.010968265,0.3278877,0.00011303555],"about_ca_topic_score_codex":0.00020868224,"about_ca_topic_score_gemma":0.00037119322,"teacher_disagreement_score":0.011226666,"about_ca_system_score_codex":0.00021474271,"about_ca_system_score_gemma":0.00043012184,"threshold_uncertainty_score":0.037556887},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09887203,0.00027495125,0.85604286,0.00035649588,0.00017067,0.0002217346,0.0003112286,0.0104997745,0.033250183],"genre_scores_gemma":[0.5330466,0.0002507544,0.44925556,0.00023600631,0.00007941347,0.00025336904,0.0010227673,0.0014635355,0.014392054],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99962187,0.000053668766,0.00001599274,0.00007383031,0.00016332271,0.000071305105],"domain_scores_gemma":[0.9995914,0.000048723246,0.000022707996,0.000113827395,0.00018244988,0.00004083009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031370047,0.00046797175,0.00041343627,0.00030113957,0.0006945755,0.0008494742,0.0020719701,0.00025697067,0.0025911643],"category_scores_gemma":[0.00065748533,0.00030482392,0.00038061332,0.00044036863,0.00035816134,0.0005888439,0.0007626092,0.0008953354,0.0011594942],"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.0014073844,0.00085244305,0.009919197,0.00077908905,0.00028884527,0.00067661324,0.00103621,0.15806389,0.31629267,0.06808298,0.062064707,0.38053605],"study_design_scores_gemma":[0.00017707229,0.0004927842,0.0030684397,0.000034716366,0.00009759882,0.0005446487,0.0003020855,0.7327488,0.17935422,0.01649757,0.066596985,0.00008502303],"about_ca_topic_score_codex":0.0033184167,"about_ca_topic_score_gemma":0.0116026485,"teacher_disagreement_score":0.0033184167,"about_ca_system_score_codex":0.0005980016,"about_ca_system_score_gemma":0.0015165941,"threshold_uncertainty_score":0.0086683035},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04491636,0.00041634828,0.94627374,0.0001908263,0.00004252063,0.00011073361,0.00010091241,0.0030158672,0.0049326723],"genre_scores_gemma":[0.47325107,0.00037191555,0.52213174,0.00012728745,0.000026623125,0.00020588252,0.00011612002,0.0006724945,0.0030968145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999111,0.00028154042,0.000056254143,0.00016045745,0.00027353363,0.00011715238],"domain_scores_gemma":[0.9980848,0.0011589992,0.00025207762,0.00025326075,0.00019590996,0.00005491772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012099169,0.0013315408,0.00054915535,0.0011052049,0.0004961456,0.0014650968,0.0019143642,0.00079576287,0.003606782],"category_scores_gemma":[0.0041213725,0.0005086426,0.00040636133,0.0010172655,0.00056798063,0.0024075406,0.0009940976,0.000856435,0.00071354845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042101595,0.00027132622,0.0020506051,0.0004518444,0.00010254248,0.00015041535,0.00021366899,0.6913049,0.07869564,0.025911734,0.0026164197,0.19780992],"study_design_scores_gemma":[0.00003207225,0.00018801162,0.00030871612,0.000024455352,0.000034729735,0.00008235416,0.000043087766,0.93161684,0.049690712,0.014519423,0.0034318643,0.000027739386],"about_ca_topic_score_codex":0.0012388333,"about_ca_topic_score_gemma":0.002768749,"teacher_disagreement_score":0.003606782,"about_ca_system_score_codex":0.0010092489,"about_ca_system_score_gemma":0.0010066633,"threshold_uncertainty_score":0.012065947},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25929174,0.00026211713,0.7116049,0.0006583481,0.00006295408,0.00016062848,0.00036289226,0.0014249112,0.026171425],"genre_scores_gemma":[0.7562475,0.00027884336,0.2364024,0.00039047835,0.000050805997,0.00032294614,0.00060307275,0.0005208303,0.0051831165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798214,0.00049285736,0.00011785529,0.00027783148,0.00084718515,0.00028203856],"domain_scores_gemma":[0.9976993,0.0006848629,0.00029542163,0.00087145064,0.00039818094,0.000050714356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014165349,0.00041261455,0.00044862853,0.0006062314,0.00050359976,0.0019083414,0.0018477628,0.00062105857,0.0015784355],"category_scores_gemma":[0.0048600524,0.0005975176,0.0008600123,0.00082613324,0.0019186593,0.0026057097,0.0022089237,0.0017106738,0.00021649657],"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.0001174069,0.000075839234,0.0025416897,0.00011440193,0.000034966102,0.00032934407,0.0009780377,0.1688569,0.00771174,0.7969623,0.001551084,0.020726316],"study_design_scores_gemma":[0.00005287198,0.00010885946,0.0013389622,0.00008508827,0.0000752302,0.00021026819,0.00045910507,0.67227495,0.024761835,0.27648026,0.024112081,0.00004038797],"about_ca_topic_score_codex":0.0054246737,"about_ca_topic_score_gemma":0.00638433,"teacher_disagreement_score":0.0054246737,"about_ca_system_score_codex":0.0016062963,"about_ca_system_score_gemma":0.002163598,"threshold_uncertainty_score":0.011654556},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012956967,0.0014860848,0.46444562,0.00086161913,0.0008803572,0.00026206623,0.009773849,0.46192047,0.047412936],"genre_scores_gemma":[0.26279813,0.002245196,0.50734615,0.0021355168,0.00033604982,0.0010952611,0.026879994,0.09895449,0.09820926],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99759275,0.0003161089,0.00014948128,0.0005132278,0.0011338237,0.00029453886],"domain_scores_gemma":[0.99604565,0.0018271966,0.00026934448,0.0010968696,0.0006145556,0.00014631901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017117417,0.0019935123,0.00090919976,0.0024337405,0.00091926235,0.0032527202,0.0033478036,0.0018891294,0.060014144],"category_scores_gemma":[0.007819647,0.0016431403,0.0013385696,0.0013333807,0.0010817375,0.005756747,0.0027935703,0.0026759238,0.024652585],"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.0020086556,0.00028535974,0.006879367,0.0014808419,0.00021190607,0.0008489,0.0006123174,0.031189185,0.018353917,0.0818399,0.3936702,0.46261933],"study_design_scores_gemma":[0.00040477118,0.0003424691,0.0017514689,0.0003141401,0.0001224906,0.0011475338,0.00011545334,0.18790135,0.08043996,0.07734158,0.6498105,0.000308336],"about_ca_topic_score_codex":0.002283983,"about_ca_topic_score_gemma":0.0028487984,"teacher_disagreement_score":0.060014144,"about_ca_system_score_codex":0.00089453516,"about_ca_system_score_gemma":0.0023251749,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48000607,0.00086809165,0.40296808,0.00083056086,0.00023289477,0.0006989696,0.012163586,0.033285055,0.0689467],"genre_scores_gemma":[0.74701816,0.0005979841,0.22508624,0.00032625077,0.00003825275,0.0009249296,0.009019273,0.0023266925,0.014662175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997708,0.000049466656,0.000018808041,0.000028130336,0.00010060027,0.000032125055],"domain_scores_gemma":[0.99958426,0.00017789492,0.00004310591,0.000080499805,0.000092594375,0.000021637034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042978188,0.00048410834,0.0004509868,0.0002808976,0.00018552445,0.00035009717,0.001422323,0.00043679695,0.0070594186],"category_scores_gemma":[0.0014069215,0.00038795793,0.00041826427,0.0005478055,0.00018715498,0.0006521185,0.00040646733,0.0008758198,0.00088049634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003689536,0.00018443783,0.003747193,0.00033720877,0.000086031585,0.00020507158,0.00021140376,0.87360066,0.028231721,0.014670055,0.030658253,0.047699064],"study_design_scores_gemma":[0.00006229273,0.000113810354,0.000802448,0.000008519032,0.000014977811,0.000035416237,0.000009421241,0.98179287,0.0062431367,0.0011032745,0.009802856,0.000010890668],"about_ca_topic_score_codex":0.004599783,"about_ca_topic_score_gemma":0.005533608,"teacher_disagreement_score":0.0070594186,"about_ca_system_score_codex":0.0005753883,"about_ca_system_score_gemma":0.0012037319,"threshold_uncertainty_score":0.023616135},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14718032,0.018625578,0.08364097,0.03979249,0.009521266,0.00021966264,0.002016377,0.0040020524,0.6950013],"genre_scores_gemma":[0.6273977,0.010072295,0.028691225,0.024898939,0.0028697494,0.00029775617,0.0027316255,0.0019784973,0.30106217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99581856,0.00076425367,0.00018730825,0.00080290216,0.0016469408,0.00077995623],"domain_scores_gemma":[0.99398106,0.000927426,0.0009389795,0.0015554891,0.002052544,0.00054458185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032240944,0.0009638913,0.0006187084,0.0013472461,0.0027230408,0.006921944,0.0013263437,0.0018033793,0.040498417],"category_scores_gemma":[0.008896126,0.00074999407,0.00068916904,0.0021788378,0.0020068428,0.0069881734,0.0030906114,0.0045107584,0.016456865],"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.0004319107,0.00018683622,0.007151793,0.00037216526,0.000110791276,0.0003627278,0.002688936,0.0035035703,0.0060308427,0.5123218,0.20585324,0.2609853],"study_design_scores_gemma":[0.000017676874,0.00014925258,0.0037319835,0.00012638992,0.000029712965,0.00041091166,0.00092536496,0.0016281315,0.0025480227,0.039035037,0.9513647,0.00003276778],"about_ca_topic_score_codex":0.002157617,"about_ca_topic_score_gemma":0.0020983457,"teacher_disagreement_score":0.040498417,"about_ca_system_score_codex":0.002537932,"about_ca_system_score_gemma":0.001904235,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01000919,0.0005348336,0.53462183,0.00026387582,0.00023282516,0.00062886154,0.0049495855,0.4191048,0.029654091],"genre_scores_gemma":[0.1525395,0.0014582188,0.61989,0.0011061883,0.0001785064,0.0032419544,0.040951077,0.09064577,0.08998875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913675,0.00013451958,0.00005614636,0.000112106485,0.00047786618,0.00008267995],"domain_scores_gemma":[0.99923635,0.00023819639,0.00005461724,0.00021853544,0.00016353678,0.000088682384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011831356,0.001957031,0.00091280416,0.0017844662,0.0007351135,0.0014281431,0.0032009128,0.0012680576,0.03347549],"category_scores_gemma":[0.0027188796,0.0009983054,0.0008889011,0.0013543126,0.00042077852,0.0034103913,0.0031549702,0.0014135567,0.013305726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087001617,0.00036206297,0.0020881135,0.0009593993,0.00016093743,0.0011387478,0.00062523887,0.03235939,0.03929805,0.019422054,0.3842575,0.5184585],"study_design_scores_gemma":[0.0005355298,0.00017750054,0.0024555642,0.0002744505,0.00010240781,0.00073722296,0.00019511546,0.36636925,0.0709947,0.018311644,0.53962404,0.00022264424],"about_ca_topic_score_codex":0.001928305,"about_ca_topic_score_gemma":0.002053899,"teacher_disagreement_score":0.03347549,"about_ca_system_score_codex":0.00051821035,"about_ca_system_score_gemma":0.00086140033,"threshold_uncertainty_score":0.11198664},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17154513,0.0009842669,0.8089178,0.00018289525,0.00016309651,0.00009147794,0.00018622741,0.0052322526,0.0126968585],"genre_scores_gemma":[0.8204556,0.00035248316,0.16733684,0.000120828336,0.000055146953,0.00006306496,0.0002338156,0.0001471834,0.011235011],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991107,0.000011793268,0.0000053865347,0.000024428831,0.00003591994,0.000011404566],"domain_scores_gemma":[0.9999027,0.000021505373,0.000018121103,0.000019360901,0.000030698742,0.0000075042767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007061819,0.00018641497,0.00014905947,0.0001769873,0.00013380937,0.00027420072,0.00040218528,0.00013322309,0.002735417],"category_scores_gemma":[0.00026432326,0.00009899685,0.00009071706,0.000214407,0.000086300264,0.00026564306,0.00015034317,0.0002464407,0.0003860406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000499414,0.00009028213,0.00142672,0.00024141323,0.000046444235,0.00017739627,0.00007435398,0.037584383,0.39831904,0.006848595,0.0073478622,0.547344],"study_design_scores_gemma":[0.00021620373,0.0014241238,0.005700451,0.000042289863,0.00019133539,0.0012461757,0.000050748797,0.55021054,0.33798006,0.0042830454,0.098593295,0.00006164698],"about_ca_topic_score_codex":0.00043497182,"about_ca_topic_score_gemma":0.0010286983,"teacher_disagreement_score":0.002735417,"about_ca_system_score_codex":0.00018696091,"about_ca_system_score_gemma":0.0003598601,"threshold_uncertainty_score":0.009150863},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1669872,0.00073168403,0.79734004,0.000173533,0.00016469101,0.00031293306,0.0006649371,0.015929772,0.017695231],"genre_scores_gemma":[0.49346668,0.00035799292,0.48599875,0.00017481917,0.000059487735,0.00045124395,0.0024444028,0.0012417296,0.015804917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940205,0.00006514355,0.00005135284,0.00013813267,0.00024631622,0.00009701234],"domain_scores_gemma":[0.99898916,0.00026958145,0.00011263148,0.00029318882,0.00030376707,0.000031656054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039911855,0.0008984854,0.00088067335,0.0012752053,0.0007055179,0.00082699844,0.00087976054,0.0004012356,0.006185801],"category_scores_gemma":[0.0015948837,0.00045300904,0.00060801854,0.0011193644,0.00048851117,0.0013229934,0.0009520071,0.0008336163,0.001783672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013335265,0.00042355523,0.0075474232,0.0005109948,0.00006901496,0.0006536857,0.0003517023,0.057675105,0.17115575,0.045266043,0.016979821,0.69803333],"study_design_scores_gemma":[0.00010617199,0.00038604497,0.0026306605,0.000075025666,0.00006606441,0.0009691324,0.00012240779,0.47807395,0.42522487,0.04824918,0.04399408,0.00010241492],"about_ca_topic_score_codex":0.0010852059,"about_ca_topic_score_gemma":0.0015333658,"teacher_disagreement_score":0.006185801,"about_ca_system_score_codex":0.00067756284,"about_ca_system_score_gemma":0.0018817757,"threshold_uncertainty_score":0.02069354},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31432518,0.0015078542,0.6601185,0.00040922553,0.00047439133,0.00023048636,0.00019590865,0.0076807803,0.015057572],"genre_scores_gemma":[0.76057523,0.00023532426,0.23346235,0.00016363562,0.00008269904,0.00010301882,0.00029555144,0.00073605456,0.0043460676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995259,0.00009580241,0.00006307646,0.000063242886,0.0001630801,0.000088871166],"domain_scores_gemma":[0.9987293,0.0003040433,0.000116322015,0.00046664054,0.00031432838,0.000069416135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000611953,0.0002548307,0.00036699884,0.0003588803,0.00057318376,0.0005861349,0.0010204226,0.00036152249,0.0013143916],"category_scores_gemma":[0.0023770311,0.00027267146,0.0002793206,0.00050736277,0.00043296834,0.0011933566,0.000864028,0.00075154693,0.0005260071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010452365,0.00041046858,0.0062158,0.0005011724,0.00009371642,0.0008694337,0.0011864622,0.068169355,0.2702951,0.10721991,0.016022826,0.52797055],"study_design_scores_gemma":[0.00018546655,0.00028487918,0.001996147,0.00007818078,0.00007223924,0.0003755044,0.0001860893,0.7140588,0.19517772,0.046045624,0.04147982,0.00005952407],"about_ca_topic_score_codex":0.0013147027,"about_ca_topic_score_gemma":0.0035765707,"teacher_disagreement_score":0.0013147027,"about_ca_system_score_codex":0.0004593381,"about_ca_system_score_gemma":0.0008679153,"threshold_uncertainty_score":0.0043970942},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05228421,0.00046500718,0.6409623,0.000502208,0.0003214554,0.00022127402,0.0008064804,0.29515982,0.009277249],"genre_scores_gemma":[0.4770728,0.0004038334,0.4440135,0.00075738836,0.000445134,0.00045158583,0.005023191,0.061925843,0.009906592],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661934,0.0006494721,0.00042488385,0.0005878943,0.0012238972,0.0004944534],"domain_scores_gemma":[0.9838938,0.006830784,0.0010360802,0.005098127,0.0024336975,0.0007073108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004559965,0.0014276643,0.0010393403,0.0014338222,0.0012002393,0.0036114273,0.004199952,0.0012728676,0.010860341],"category_scores_gemma":[0.017626785,0.0017313384,0.0013036142,0.0010862924,0.0009929361,0.003814443,0.002896785,0.0036814283,0.0051504555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00820782,0.00093477225,0.011824764,0.0010115085,0.0004039676,0.0012015221,0.0018113648,0.013516936,0.19534452,0.044023663,0.10082524,0.6208939],"study_design_scores_gemma":[0.0024706633,0.00043554473,0.0071263923,0.00027995039,0.00039729252,0.00083482993,0.00019125563,0.54334724,0.27477622,0.05140246,0.11836232,0.00037577757],"about_ca_topic_score_codex":0.0022846807,"about_ca_topic_score_gemma":0.0026592757,"teacher_disagreement_score":0.010860341,"about_ca_system_score_codex":0.0007794938,"about_ca_system_score_gemma":0.0017549711,"threshold_uncertainty_score":0.036331475},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053613156,0.00092276535,0.91361713,0.0096382545,0.000253927,0.00012806301,0.00018281586,0.0007214572,0.020922365],"genre_scores_gemma":[0.7785933,0.0010080391,0.21136004,0.0014946251,0.00052777294,0.0006554808,0.00041641342,0.00033600486,0.0056083305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994134,0.0022377814,0.0004997014,0.00082060485,0.0016856516,0.000622165],"domain_scores_gemma":[0.9640697,0.023392487,0.0025885222,0.0059357965,0.0025815233,0.0014320851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073231044,0.0009151633,0.001202209,0.0011906686,0.002442155,0.0056845327,0.00253356,0.0023508596,0.004459222],"category_scores_gemma":[0.027229983,0.0010636664,0.0024403445,0.00096088735,0.009985324,0.01842737,0.004505999,0.0058517577,0.0009536544],"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.000017448301,0.000017559443,0.00008490735,0.000040766936,0.0000045829966,0.000052711075,0.0001797492,0.0042350073,0.0003260321,0.993468,0.00031419183,0.0012590275],"study_design_scores_gemma":[0.000020367894,0.000018572717,0.000039775732,0.000023275441,0.000006187048,0.00006327295,0.000072186696,0.029235035,0.0004903399,0.9670415,0.0029759838,0.000013584993],"about_ca_topic_score_codex":0.0012559018,"about_ca_topic_score_gemma":0.0011196246,"teacher_disagreement_score":0.0073231044,"about_ca_system_score_codex":0.002891101,"about_ca_system_score_gemma":0.0021087273,"threshold_uncertainty_score":0.038728714},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6683941,0.0005723653,0.29944995,0.00024384775,0.000121604135,0.00010706706,0.00013826627,0.0052314214,0.025741344],"genre_scores_gemma":[0.88274616,0.00022060012,0.10997708,0.00009038055,0.000018166373,0.000052760963,0.00013943267,0.00020965765,0.0065457067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960893,0.00006709277,0.000020608588,0.00004133765,0.00016866154,0.0000934132],"domain_scores_gemma":[0.9994148,0.00022591511,0.00007269724,0.00010753283,0.0001307267,0.000048335627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032461408,0.0005283346,0.00019578163,0.00035120247,0.0002360093,0.0006412361,0.00061302824,0.00023324837,0.004580512],"category_scores_gemma":[0.0011080196,0.00020508902,0.00014321739,0.0002655676,0.00032011876,0.00065486354,0.00039989586,0.0005135488,0.00088070275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018869175,0.000316805,0.008180886,0.0006193963,0.00006810328,0.0007160274,0.0003089991,0.22631575,0.31307697,0.024266584,0.0081007825,0.41614276],"study_design_scores_gemma":[0.00017720652,0.0010980628,0.00399638,0.000073714225,0.000057481666,0.00026204516,0.00016593328,0.6999861,0.2725063,0.006185313,0.015452182,0.000039331768],"about_ca_topic_score_codex":0.0014181796,"about_ca_topic_score_gemma":0.0035175872,"teacher_disagreement_score":0.004580512,"about_ca_system_score_codex":0.00046985215,"about_ca_system_score_gemma":0.0005763851,"threshold_uncertainty_score":0.015323281},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23738143,0.00030551225,0.66395295,0.0003993093,0.00034603523,0.00056508207,0.00018022067,0.08653317,0.010336268],"genre_scores_gemma":[0.63665795,0.00017380898,0.34836233,0.0003032922,0.00013058637,0.00038507005,0.00068345084,0.004768354,0.008535062],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987759,0.00032344196,0.000085905136,0.0002772602,0.00038301523,0.0001543948],"domain_scores_gemma":[0.9963702,0.0006528782,0.00025399946,0.0016862031,0.00049572246,0.0005409895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017425051,0.00044340885,0.0005919427,0.00046859155,0.00044337354,0.0012080531,0.0022614498,0.00069060863,0.0020813914],"category_scores_gemma":[0.00508776,0.00048462523,0.00048605268,0.0002847733,0.00074394105,0.002083609,0.0020955298,0.0013532599,0.0012582468],"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.00269486,0.0011052578,0.018383542,0.00048459537,0.00030171592,0.00197934,0.002085914,0.036334716,0.40444186,0.054150198,0.040826745,0.43721116],"study_design_scores_gemma":[0.00032970155,0.00073786074,0.0072169127,0.00010164393,0.000110952926,0.0010434267,0.00018807087,0.6425697,0.24753198,0.017380405,0.08261135,0.00017791797],"about_ca_topic_score_codex":0.00031935517,"about_ca_topic_score_gemma":0.00025116594,"teacher_disagreement_score":0.0022614498,"about_ca_system_score_codex":0.00050428906,"about_ca_system_score_gemma":0.0006926374,"threshold_uncertainty_score":0.0092154145},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3729421,0.0006282412,0.61692345,0.0003014619,0.00007454152,0.00029277737,0.000636297,0.0035838548,0.004617265],"genre_scores_gemma":[0.90603626,0.00027853315,0.09132354,0.00005305318,0.000040400126,0.00040560903,0.0005833007,0.00047617403,0.0008031924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885404,0.00032601328,0.00006932465,0.00013660672,0.0005054634,0.00010861457],"domain_scores_gemma":[0.9851291,0.010168584,0.0018831034,0.0014599911,0.0011955359,0.00016364828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026880417,0.0015653521,0.000707526,0.0029057842,0.00035895198,0.0011892408,0.0009064379,0.0009743636,0.0011943784],"category_scores_gemma":[0.01839945,0.0003976105,0.00081931625,0.0021794713,0.00094144646,0.0023107084,0.0006090016,0.0011209634,0.00041437065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008258102,0.00012163527,0.0086623235,0.00007783855,0.00009019481,0.000025260526,0.000047189184,0.9644772,0.005973718,0.0027146416,0.00049657084,0.017230915],"study_design_scores_gemma":[0.0000076280558,0.00010060016,0.0026587015,0.000003577128,0.000016981605,0.000014501302,0.000007724246,0.991026,0.0037525021,0.0021221605,0.0002752243,0.000014468012],"about_ca_topic_score_codex":0.0028895,"about_ca_topic_score_gemma":0.0017722127,"teacher_disagreement_score":0.0029057842,"about_ca_system_score_codex":0.0009005514,"about_ca_system_score_gemma":0.0005623327,"threshold_uncertainty_score":0.014215887},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8244811,0.0013452802,0.15392867,0.0002614828,0.00011891188,0.000053871176,0.00023637155,0.0030503355,0.016524024],"genre_scores_gemma":[0.957106,0.00016844732,0.040989153,0.00009893842,0.000012132523,0.000032245058,0.0001314958,0.00009053662,0.0013711039],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998839,0.00001217066,0.0000066684884,0.000022893579,0.000044409575,0.000029892362],"domain_scores_gemma":[0.99991465,0.000010194721,0.00002368563,0.000022370165,0.000022873593,0.0000061761148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000617169,0.00044031677,0.00019269434,0.0002917701,0.0001620472,0.0003937713,0.0008670436,0.0003078443,0.00095653266],"category_scores_gemma":[0.00018517896,0.00013558309,0.00029649143,0.0004202598,0.000117398384,0.00054481503,0.00029192588,0.00019463805,0.00030749143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029278008,0.00017663256,0.0052226554,0.00025598847,0.00013917487,0.00063385407,0.0001465193,0.1224098,0.71203405,0.006128903,0.005353178,0.14720644],"study_design_scores_gemma":[0.000066203065,0.00081821275,0.006349121,0.000021478645,0.00012702306,0.0005328077,0.000098109005,0.54117334,0.43519917,0.0014982283,0.014030408,0.00008592302],"about_ca_topic_score_codex":0.00082465616,"about_ca_topic_score_gemma":0.001662895,"teacher_disagreement_score":0.00095653266,"about_ca_system_score_codex":0.0003077859,"about_ca_system_score_gemma":0.0002735993,"threshold_uncertainty_score":0.003199935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19962807,0.018913727,0.7095257,0.003575686,0.0008265128,0.00030692617,0.00029131994,0.032009285,0.034922823],"genre_scores_gemma":[0.6901535,0.007946378,0.28946927,0.0009943773,0.00061149476,0.00019643134,0.00070898584,0.001592874,0.0083265975],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987826,0.00022110213,0.00010800741,0.00016028664,0.00061126705,0.00011683387],"domain_scores_gemma":[0.99306667,0.0020579298,0.00087839254,0.001819643,0.0019094517,0.00026790405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020803558,0.00056683517,0.0003756767,0.0007468179,0.00028746598,0.0012219149,0.001327966,0.00048608275,0.0018764863],"category_scores_gemma":[0.006308058,0.0003912268,0.00036661734,0.00080354477,0.00036844314,0.0023748102,0.00089608727,0.0016566159,0.00073840003],"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.00041542368,0.000329286,0.011895928,0.0015689892,0.00020468915,0.00023160079,0.0005013742,0.029834365,0.13694146,0.022148095,0.01664539,0.77928334],"study_design_scores_gemma":[0.00023123562,0.0014859143,0.032110643,0.00061246403,0.0005041467,0.001241928,0.00020228456,0.47231227,0.16732821,0.019198844,0.30453864,0.00023338865],"about_ca_topic_score_codex":0.0010789436,"about_ca_topic_score_gemma":0.0011327028,"teacher_disagreement_score":0.0020803558,"about_ca_system_score_codex":0.0004642106,"about_ca_system_score_gemma":0.0012533828,"threshold_uncertainty_score":0.011002064},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077528744,0.0003741439,0.5766302,0.00035629226,0.00060391886,0.0002881982,0.0033936275,0.3792748,0.03132603],"genre_scores_gemma":[0.19476694,0.000487026,0.58794373,0.0016116985,0.00037161945,0.0013547732,0.015708834,0.11147464,0.0862807],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985668,0.00015276283,0.000106733045,0.00027255132,0.00063049723,0.0002705539],"domain_scores_gemma":[0.9976793,0.00051736506,0.000102560574,0.00064784987,0.0008550542,0.0001979495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077701645,0.002086518,0.00096373004,0.0016895062,0.0009986997,0.0025571208,0.0068423483,0.0014580959,0.08359098],"category_scores_gemma":[0.0052657034,0.0015041507,0.0011550505,0.0017168305,0.0006455302,0.0026373998,0.002899126,0.0028933673,0.032466073],"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.0019267851,0.0005487083,0.0019237518,0.0010885941,0.00021560257,0.000507979,0.00033372553,0.012713805,0.033507373,0.024700074,0.33908948,0.58344406],"study_design_scores_gemma":[0.0019938874,0.00040314702,0.0016387793,0.0003017503,0.0002250737,0.0006029181,0.00021527342,0.36037168,0.16559546,0.057817623,0.41043073,0.00040371314],"about_ca_topic_score_codex":0.0068553253,"about_ca_topic_score_gemma":0.01075461,"teacher_disagreement_score":0.08359098,"about_ca_system_score_codex":0.0013306881,"about_ca_system_score_gemma":0.0019908196,"threshold_uncertainty_score":0.27963972},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039154664,0.00058528525,0.9260921,0.00022178152,0.000107558735,0.00012513137,0.0006329426,0.017046092,0.016034385],"genre_scores_gemma":[0.54520226,0.0004955426,0.40848356,0.00042292813,0.0002014306,0.0003695457,0.00338362,0.002965375,0.038475752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747294,0.00028929187,0.00012517029,0.00042100012,0.0013828182,0.00030872884],"domain_scores_gemma":[0.9960551,0.00068754837,0.00031113022,0.0016793911,0.0012099523,0.000056855777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007825344,0.0009125067,0.0009182614,0.0031607375,0.0012775504,0.0019472834,0.0021179465,0.00088913954,0.013260816],"category_scores_gemma":[0.006050102,0.00047370055,0.0008954706,0.003483916,0.000528974,0.0033196406,0.002130357,0.0008792346,0.005234358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047186794,0.00014740553,0.007330786,0.00035130905,0.00010604673,0.00035038855,0.00040105218,0.036836464,0.055127185,0.093496,0.022652347,0.78272915],"study_design_scores_gemma":[0.00009241639,0.00027384347,0.006896275,0.000076519565,0.00018375112,0.000697875,0.0002389052,0.65684783,0.14152093,0.11033538,0.08270915,0.0001270843],"about_ca_topic_score_codex":0.0057408954,"about_ca_topic_score_gemma":0.006491479,"teacher_disagreement_score":0.013260816,"about_ca_system_score_codex":0.0013033486,"about_ca_system_score_gemma":0.0016278527,"threshold_uncertainty_score":0.04436183},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016889792,0.0016591542,0.7236319,0.022102201,0.0015918139,0.00019295246,0.00038725702,0.0011505934,0.23239435],"genre_scores_gemma":[0.7291117,0.0019191045,0.21488693,0.0013118509,0.0004363756,0.0005085106,0.00034344016,0.00045938484,0.05102266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972867,0.001422521,0.00013639378,0.00042939457,0.00049181056,0.00023327161],"domain_scores_gemma":[0.9957424,0.0013989266,0.00024637193,0.0016349431,0.00040270947,0.0005745819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004176665,0.0005537294,0.00043590786,0.0006935308,0.0015345286,0.003768268,0.0016498412,0.0017234276,0.012317041],"category_scores_gemma":[0.007740016,0.00032648403,0.0008909077,0.0009798687,0.0047870046,0.005311961,0.0042032055,0.0025193153,0.0019493252],"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.000011070721,0.000009572325,0.00019137605,0.000023752067,0.000003733193,0.00005867452,0.00018345295,0.0022058275,0.00016076397,0.9825498,0.003010511,0.011591383],"study_design_scores_gemma":[0.00001566211,0.00002285627,0.00014141072,0.00006565631,0.000012248533,0.00019626663,0.00012151145,0.03265438,0.00056877977,0.87369746,0.09248646,0.00001743333],"about_ca_topic_score_codex":0.0019769263,"about_ca_topic_score_gemma":0.0022422695,"teacher_disagreement_score":0.012317041,"about_ca_system_score_codex":0.0027259274,"about_ca_system_score_gemma":0.0025522402,"threshold_uncertainty_score":0.04120457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24709037,0.0016892403,0.5303181,0.0024273614,0.0006648846,0.0008229411,0.00085218396,0.15629193,0.059842955],"genre_scores_gemma":[0.50798905,0.0006430189,0.43784523,0.0011839534,0.000140122,0.00046821905,0.0015311913,0.0066501005,0.043549083],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999488,0.00007043255,0.000020933707,0.00009251635,0.00023621994,0.00009184297],"domain_scores_gemma":[0.9992262,0.00011862232,0.000057562524,0.00030121772,0.00013731145,0.00015908049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005622952,0.00070607715,0.00042803053,0.00042026342,0.0004561365,0.0011667074,0.0018442168,0.0005696176,0.010275447],"category_scores_gemma":[0.0020219195,0.00051807304,0.0003943239,0.0002934587,0.0008014823,0.002188817,0.0020470317,0.001974072,0.003147749],"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.0050665466,0.0009051967,0.009912346,0.00093438645,0.00023478424,0.0012369517,0.0018785254,0.02297566,0.3304848,0.053722743,0.10506761,0.46758044],"study_design_scores_gemma":[0.00092120183,0.0027212775,0.013902887,0.00025662722,0.00014436642,0.0015853337,0.000444864,0.18071985,0.23132637,0.015239767,0.55235314,0.0003843158],"about_ca_topic_score_codex":0.0019452486,"about_ca_topic_score_gemma":0.0027339594,"teacher_disagreement_score":0.010275447,"about_ca_system_score_codex":0.0006042505,"about_ca_system_score_gemma":0.00078835234,"threshold_uncertainty_score":0.034374833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07889169,0.00064975186,0.9087049,0.0004617856,0.00006787618,0.00007756679,0.00007769665,0.0015090035,0.009559814],"genre_scores_gemma":[0.42605758,0.00080801675,0.56708837,0.00009023065,0.000061002364,0.00019024256,0.00027554418,0.0010566134,0.004372415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991769,0.00030866958,0.000046609384,0.000040572555,0.00037254806,0.00005461019],"domain_scores_gemma":[0.9987017,0.00071939564,0.000078734585,0.00021100229,0.00026096686,0.00002826892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012114166,0.00058650144,0.00055657857,0.0004981404,0.00077688316,0.00082581094,0.0007359792,0.00036070694,0.0022745458],"category_scores_gemma":[0.0038406898,0.00019900771,0.0004062943,0.0011023423,0.0005338231,0.001395802,0.00060027314,0.0008710042,0.00079692807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027656087,0.00017371375,0.0014917739,0.00027741052,0.000049359296,0.0001271134,0.0003458244,0.47233835,0.041318186,0.20410433,0.00451456,0.2749828],"study_design_scores_gemma":[0.000012086503,0.000046779223,0.00015861423,0.0000075648454,0.000007688504,0.000025080937,0.000028949835,0.96130955,0.013728497,0.0224146,0.0022472986,0.0000132496125],"about_ca_topic_score_codex":0.0016207773,"about_ca_topic_score_gemma":0.002322864,"teacher_disagreement_score":0.0022745458,"about_ca_system_score_codex":0.0009180527,"about_ca_system_score_gemma":0.0013622139,"threshold_uncertainty_score":0.007609129},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12161643,0.0005629872,0.86727643,0.00020584426,0.000119823344,0.00015766424,0.000089844754,0.0054889396,0.0044820895],"genre_scores_gemma":[0.42980418,0.00018194829,0.56373674,0.00009995039,0.00004002794,0.00014912519,0.00015547611,0.0003423025,0.0054902486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958295,0.00005664715,0.00003340891,0.000042878422,0.00022716826,0.00005701385],"domain_scores_gemma":[0.99878126,0.00049859297,0.00018458888,0.00024856496,0.00022233777,0.00006470756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042001408,0.0006607037,0.00040118702,0.00065353647,0.0005828717,0.0008912006,0.00126008,0.00028532255,0.005920575],"category_scores_gemma":[0.001451641,0.0004125843,0.00030105087,0.0006781552,0.00049457164,0.0010453878,0.00067627965,0.0006255273,0.00094936363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001318578,0.00038429536,0.005411601,0.00039382273,0.00006443883,0.00023933871,0.00033342052,0.14077686,0.09494781,0.016603844,0.008792772,0.7307332],"study_design_scores_gemma":[0.00017548254,0.00022951934,0.00094157556,0.00002123676,0.000024727362,0.00010409437,0.000094921736,0.94255316,0.04644607,0.0044999076,0.004882887,0.000026348785],"about_ca_topic_score_codex":0.0036954572,"about_ca_topic_score_gemma":0.011664571,"teacher_disagreement_score":0.005920575,"about_ca_system_score_codex":0.0007814141,"about_ca_system_score_gemma":0.0022150984,"threshold_uncertainty_score":0.019806325},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014898994,0.0003400033,0.9824592,0.00016682572,0.00004916201,0.00006215313,0.000024579493,0.00030794903,0.001691093],"genre_scores_gemma":[0.35566238,0.00046045927,0.64018744,0.00014762615,0.000051193838,0.00039847015,0.00015542723,0.000083815285,0.0028530646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996989,0.00011132106,0.000013136799,0.000045440913,0.000097134485,0.000034130073],"domain_scores_gemma":[0.9996995,0.0001839728,0.00002798825,0.000016108299,0.00005880691,0.000013731328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008175923,0.00070693326,0.00067678647,0.000684982,0.0006022316,0.0006074318,0.000884102,0.0010133934,0.0008783634],"category_scores_gemma":[0.0019162712,0.00038192872,0.0005847254,0.0007463888,0.0005690628,0.0005387913,0.00046861655,0.00070437207,0.00018172314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003063579,0.000027456612,0.00024024954,0.000024217206,0.00003226835,0.000039828392,0.00003193058,0.947476,0.0014651546,0.006675121,0.00056510395,0.043391984],"study_design_scores_gemma":[0.000020526692,0.000019578674,0.00007253516,0.0000045242564,0.00000788005,0.000012647889,0.0000058167384,0.9954335,0.00032376204,0.003382608,0.00071276946,0.0000038189837],"about_ca_topic_score_codex":0.0077125323,"about_ca_topic_score_gemma":0.005232779,"teacher_disagreement_score":0.0077125323,"about_ca_system_score_codex":0.0009817694,"about_ca_system_score_gemma":0.0013599622,"threshold_uncertainty_score":0.015335321},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43543825,0.000869817,0.5436627,0.00029187475,0.00017447847,0.00012478276,0.00029704112,0.009200772,0.009940295],"genre_scores_gemma":[0.75907856,0.00014483735,0.23709294,0.00012629012,0.000029832778,0.0000934928,0.00024754435,0.00039968477,0.0027869],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996475,0.000057315145,0.000032440057,0.000058737434,0.00013555108,0.00006848822],"domain_scores_gemma":[0.9994803,0.0001666837,0.00010834571,0.00012315525,0.00009884549,0.000022683438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036040586,0.0006166015,0.00033174985,0.000542461,0.00022819643,0.0006852944,0.0010013913,0.00031162877,0.0030382106],"category_scores_gemma":[0.0010418757,0.00029214224,0.00032904884,0.00049690716,0.00024633922,0.00069597096,0.00036267168,0.00047861377,0.0005185661],"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.0011137078,0.00036162056,0.0043184683,0.00045285764,0.00011636392,0.00031997744,0.00022088774,0.35771844,0.29336458,0.021869415,0.005048334,0.31509542],"study_design_scores_gemma":[0.00012638043,0.0005791271,0.00099588,0.000025485944,0.00006213373,0.00015489565,0.000032629734,0.8583374,0.12557942,0.006289502,0.00778569,0.000031449756],"about_ca_topic_score_codex":0.0012137301,"about_ca_topic_score_gemma":0.00257005,"teacher_disagreement_score":0.0030382106,"about_ca_system_score_codex":0.00053273886,"about_ca_system_score_gemma":0.0009005586,"threshold_uncertainty_score":0.010163784},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79883325,0.0026920717,0.18121442,0.00035856158,0.00008042297,0.00004812306,0.00017545583,0.0009631665,0.015634412],"genre_scores_gemma":[0.99114144,0.00017199332,0.0060802805,0.0000263327,0.000013662371,0.000014895026,0.00007021236,0.00005454171,0.0024266583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998066,0.00003137742,0.0000074756845,0.000020768028,0.00007990011,0.000053925374],"domain_scores_gemma":[0.9996972,0.000103384744,0.000029765466,0.000049286344,0.00010868563,0.000011720519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019348694,0.00022509074,0.0003124573,0.00048338142,0.000294205,0.00037293835,0.00049829786,0.00019860074,0.0017230076],"category_scores_gemma":[0.0008422651,0.00015359929,0.00024266049,0.00045983773,0.0003209882,0.0005644046,0.0002387408,0.00026776732,0.00027187972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064973696,0.00009901634,0.004815311,0.00025217712,0.00006884146,0.00029175033,0.00025598376,0.77639043,0.104245685,0.045681436,0.0043296637,0.062920034],"study_design_scores_gemma":[0.000010248192,0.00008617108,0.0009056004,0.000005086429,0.00001963554,0.000055639415,0.000018881765,0.9804262,0.0123628415,0.004980294,0.0011223983,0.000007075782],"about_ca_topic_score_codex":0.0023227702,"about_ca_topic_score_gemma":0.0024750507,"teacher_disagreement_score":0.0023227702,"about_ca_system_score_codex":0.00052399863,"about_ca_system_score_gemma":0.00041356718,"threshold_uncertainty_score":0.005764067},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070611745,0.0011360858,0.90682507,0.00040403058,0.0001485916,0.0002486638,0.0001555941,0.017121417,0.00334887],"genre_scores_gemma":[0.72583705,0.00038130497,0.26955137,0.00020399783,0.00011249982,0.00024549523,0.00036737486,0.0009743326,0.002326643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9904586,0.0032231743,0.00056310836,0.0011626272,0.0037154946,0.00087706075],"domain_scores_gemma":[0.9597605,0.021071302,0.0032554916,0.011705992,0.0031800026,0.0010267274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043717036,0.0016042703,0.0015801777,0.0024564504,0.0010056932,0.0018960399,0.0033515207,0.0010609117,0.0036466173],"category_scores_gemma":[0.029739585,0.00090967247,0.0006340064,0.0022722452,0.0011702295,0.003540417,0.002463404,0.0018795916,0.0010213115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046271714,0.00060995476,0.015293893,0.0004937327,0.00019880972,0.00036564824,0.0009339203,0.10723666,0.088769525,0.019080922,0.0075582755,0.75483143],"study_design_scores_gemma":[0.00017122514,0.00037685328,0.0028009152,0.00006030963,0.000110943416,0.00027678107,0.00010905136,0.9383458,0.041601907,0.012284594,0.0038063957,0.000055205015],"about_ca_topic_score_codex":0.0054667485,"about_ca_topic_score_gemma":0.0055810236,"teacher_disagreement_score":0.0054667485,"about_ca_system_score_codex":0.001447741,"about_ca_system_score_gemma":0.003201144,"threshold_uncertainty_score":0.023120046},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075593755,0.0014576091,0.2941188,0.002634925,0.0018258156,0.00051484565,0.011993957,0.07867617,0.53318405],"genre_scores_gemma":[0.5036159,0.00077258033,0.1552177,0.0037973612,0.00034798507,0.0005889107,0.02947374,0.011955906,0.29422992],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941766,0.0000621513,0.000035555688,0.00012308975,0.00022195217,0.00013960233],"domain_scores_gemma":[0.9986039,0.00016463218,0.000059389342,0.00039406825,0.000668083,0.000109962544],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040669288,0.0007344661,0.00052287756,0.0006427795,0.00085051707,0.0018952787,0.0013852649,0.00089453807,0.1105414],"category_scores_gemma":[0.00209315,0.00030661965,0.0005449449,0.0007883008,0.0004318225,0.0018320839,0.0017254922,0.0009783342,0.051173355],"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.0013820257,0.00034965912,0.0061002458,0.0009277906,0.00010657016,0.0005682932,0.00039087058,0.019264223,0.06107939,0.089480005,0.39695024,0.42340067],"study_design_scores_gemma":[0.000178082,0.00043038122,0.0019639854,0.00013938574,0.000053307136,0.00059299613,0.00023969768,0.08131958,0.071884386,0.028065063,0.8150391,0.00009413375],"about_ca_topic_score_codex":0.0031354215,"about_ca_topic_score_gemma":0.004729729,"teacher_disagreement_score":0.8894586,"about_ca_system_score_codex":0.0009774757,"about_ca_system_score_gemma":0.0017096853,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8672871,0.0009578003,0.105148904,0.00033242116,0.00016274521,0.00027360403,0.00043351177,0.006876427,0.01852756],"genre_scores_gemma":[0.9628409,0.000290106,0.031785052,0.00022713703,0.00004042143,0.0001170798,0.00046675061,0.00081805955,0.0034145128],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99957174,0.00006892746,0.000054785425,0.000104430124,0.000115737996,0.00008441401],"domain_scores_gemma":[0.9981407,0.00059753,0.00022450753,0.00073074043,0.00024242501,0.00006407318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005400026,0.00058659597,0.00018643808,0.0005685629,0.00016001474,0.0005667396,0.0008695717,0.00028048173,0.0027601938],"category_scores_gemma":[0.0029478343,0.0003195041,0.00027092075,0.00037600973,0.00018855513,0.0007797386,0.000539493,0.0006505018,0.0007938766],"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.00044878578,0.00028906428,0.019846821,0.000540038,0.00015617482,0.00042291827,0.00027593508,0.08387498,0.6434225,0.004247872,0.004206304,0.24226855],"study_design_scores_gemma":[0.00013631894,0.0012390587,0.046688106,0.00010254646,0.0002845248,0.0011836351,0.00026857553,0.29311708,0.5996951,0.0062410715,0.050920498,0.00012345435],"about_ca_topic_score_codex":0.0003500109,"about_ca_topic_score_gemma":0.0009863272,"teacher_disagreement_score":0.0027601938,"about_ca_system_score_codex":0.00023420458,"about_ca_system_score_gemma":0.00039883517,"threshold_uncertainty_score":0.009233773},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42509067,0.003224181,0.5357252,0.0012779871,0.0003124766,0.0002055384,0.00029614806,0.0005440969,0.03332371],"genre_scores_gemma":[0.9236532,0.00045899837,0.07048543,0.00007304293,0.00005727538,0.00011685136,0.00020629965,0.00024327589,0.0047057224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999244,0.00033823782,0.0000232374,0.000036211855,0.00027914214,0.000079229176],"domain_scores_gemma":[0.99821293,0.0011954474,0.000074844145,0.00012787711,0.0003380706,0.000050854935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011611134,0.0007381186,0.0008295667,0.0008019181,0.0005595053,0.00094427,0.0009894134,0.0008494767,0.0037344974],"category_scores_gemma":[0.0056414646,0.00026875507,0.00050147675,0.0013196893,0.00054119824,0.0011017827,0.0006806594,0.0005136076,0.00022380013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021216183,0.000052016498,0.00045942984,0.00007202214,0.00002449797,0.000033426528,0.000012692809,0.97415876,0.0010177422,0.0060736104,0.0005065186,0.017377106],"study_design_scores_gemma":[0.000012291294,0.000023421875,0.0001794394,0.0000033409783,0.0000059174104,0.000008186136,0.000008007493,0.9969733,0.0005687615,0.0020353014,0.00017994699,0.0000020965313],"about_ca_topic_score_codex":0.0042680623,"about_ca_topic_score_gemma":0.0044119623,"teacher_disagreement_score":0.0042680623,"about_ca_system_score_codex":0.0013358345,"about_ca_system_score_gemma":0.0010551251,"threshold_uncertainty_score":0.012493134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39484653,0.00107709,0.58611923,0.00065106584,0.00030972323,0.00015926185,0.000122069316,0.009531089,0.007183967],"genre_scores_gemma":[0.9238028,0.00014832459,0.07257026,0.000107278625,0.000047705405,0.00008006245,0.00013093908,0.00028127016,0.0028314157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991258,0.0002490888,0.00006358271,0.00012211366,0.0002644804,0.00017485302],"domain_scores_gemma":[0.9961993,0.0013503379,0.00025293764,0.0013568485,0.0006496449,0.00019096065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020186133,0.0008548407,0.0007061888,0.0008235081,0.0009872937,0.001482582,0.0027670746,0.00060919893,0.0020437196],"category_scores_gemma":[0.00759637,0.00046192345,0.00031373667,0.0008912176,0.0006723849,0.0028958363,0.0015201776,0.0011527801,0.00054636475],"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.0023482763,0.0010295187,0.0081720855,0.0003370439,0.00026530385,0.00029710736,0.00058498024,0.4512429,0.20627736,0.033296622,0.0071022385,0.2890466],"study_design_scores_gemma":[0.00007353793,0.00018030332,0.00047916573,0.0000075124585,0.000066490305,0.000035987418,0.00004621237,0.92787963,0.06383971,0.005376539,0.0019877874,0.00002714621],"about_ca_topic_score_codex":0.0037509599,"about_ca_topic_score_gemma":0.0067872987,"teacher_disagreement_score":0.0037509599,"about_ca_system_score_codex":0.00092120277,"about_ca_system_score_gemma":0.0015012188,"threshold_uncertainty_score":0.010675609},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015878967,0.00050807995,0.92540073,0.00063702196,0.00052583835,0.00007858822,0.001476867,0.04583029,0.023954619],"genre_scores_gemma":[0.0726617,0.0013485262,0.8670667,0.0012466488,0.00056482496,0.00063831394,0.004956751,0.027931796,0.023584822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99763846,0.0005323907,0.0002554139,0.00025723825,0.0011235758,0.0001928206],"domain_scores_gemma":[0.9948614,0.0018544281,0.00044877353,0.0008790155,0.0018200305,0.00013632629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020536517,0.0010218658,0.0008476736,0.0031864794,0.0010763023,0.0027793348,0.0018629833,0.00089384714,0.065827236],"category_scores_gemma":[0.016347488,0.0006042781,0.0020912376,0.0016726762,0.0008876117,0.003634206,0.0025107467,0.0021458573,0.022861565],"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.0002617789,0.00004613715,0.0016579779,0.0011007827,0.00012430649,0.00053667504,0.00041787172,0.012890039,0.0057594413,0.4707707,0.21009618,0.29633814],"study_design_scores_gemma":[0.000062459396,0.000040953004,0.0007275939,0.0003401182,0.0000720295,0.0011256658,0.00017585426,0.09441121,0.011666178,0.3584066,0.5328789,0.00009236024],"about_ca_topic_score_codex":0.0015099447,"about_ca_topic_score_gemma":0.0016957831,"teacher_disagreement_score":0.065827236,"about_ca_system_score_codex":0.0009931225,"about_ca_system_score_gemma":0.0015020395,"threshold_uncertainty_score":0.22021407},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5951048,0.0024366702,0.3887792,0.00065212,0.00023621216,0.00008923106,0.00012990623,0.005233986,0.0073379143],"genre_scores_gemma":[0.97768754,0.00027697187,0.01944115,0.00013869406,0.000033111206,0.00003204544,0.0000483316,0.00014840798,0.0021936859],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999655,0.00007234087,0.00002859523,0.00007196735,0.000087280794,0.00008490743],"domain_scores_gemma":[0.99918073,0.00026940546,0.00021417101,0.00022023825,0.000075285636,0.00004016593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037219442,0.00051574426,0.00033765996,0.00041526096,0.00044335242,0.00072895957,0.0009631141,0.00029489555,0.0020019761],"category_scores_gemma":[0.0014872546,0.00038485596,0.00019074859,0.00046264325,0.00051577477,0.0017133305,0.0007481096,0.00044188643,0.00030688697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016513701,0.00033308793,0.014691582,0.00066807977,0.00015269931,0.0011900171,0.00075444905,0.15976726,0.45946354,0.04892056,0.0064337784,0.30597356],"study_design_scores_gemma":[0.00012899024,0.0014821512,0.004660637,0.00010210236,0.00024007872,0.00062127033,0.00019007445,0.50260127,0.4536882,0.015934423,0.020251747,0.00009898753],"about_ca_topic_score_codex":0.0009961544,"about_ca_topic_score_gemma":0.0027822568,"teacher_disagreement_score":0.0020019761,"about_ca_system_score_codex":0.0004796999,"about_ca_system_score_gemma":0.0010112581,"threshold_uncertainty_score":0.0066972375},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036564735,0.00028175817,0.8154115,0.0003593104,0.00017844752,0.00029623142,0.006379305,0.15637489,0.017062066],"genre_scores_gemma":[0.07054819,0.000867542,0.78955215,0.0013819424,0.00015125916,0.0015174209,0.02819096,0.07536768,0.03242284],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99900633,0.0002021513,0.00012041032,0.00022420134,0.0003655429,0.00008140713],"domain_scores_gemma":[0.9979752,0.0009545388,0.0001538382,0.00044157912,0.00038178294,0.00009309791],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016006603,0.0010541757,0.00057503465,0.0007137671,0.0005064435,0.002086835,0.0026690823,0.001019195,0.0400982],"category_scores_gemma":[0.005552931,0.0011193047,0.0012903719,0.0004934526,0.0008324748,0.0025517691,0.0019793042,0.002278465,0.019855574],"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.0008835775,0.00026322462,0.006246012,0.0023025705,0.00022172436,0.00087237457,0.001309427,0.03870278,0.036356483,0.21128209,0.37117368,0.3303861],"study_design_scores_gemma":[0.00014282251,0.00013518606,0.0009402628,0.00021059884,0.00005320823,0.0008514235,0.00008090686,0.08948541,0.028534,0.043748956,0.83572155,0.000095571166],"about_ca_topic_score_codex":0.0012306067,"about_ca_topic_score_gemma":0.0019971137,"teacher_disagreement_score":0.9599018,"about_ca_system_score_codex":0.0005984862,"about_ca_system_score_gemma":0.0013898165,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008746748,0.00054238335,0.9836908,0.00019362694,0.00005737707,0.00009845981,0.00007506897,0.0002769856,0.0063186632],"genre_scores_gemma":[0.73595816,0.0019174103,0.25597265,0.00030381297,0.00019415225,0.0006153486,0.00024052328,0.0002499663,0.00454802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982856,0.00073513296,0.00007225947,0.00014370348,0.00062975334,0.00013358764],"domain_scores_gemma":[0.99817646,0.0012431606,0.00012770022,0.00011662141,0.00028376828,0.00005228521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022277844,0.0012992339,0.00088779524,0.001152037,0.0005428078,0.0014561865,0.0017780487,0.0010765591,0.0025515493],"category_scores_gemma":[0.006637691,0.00045057645,0.0007529086,0.0010657081,0.0010517447,0.0015816053,0.0007829738,0.001397667,0.00046151874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001275294,0.000030551255,0.00015795768,0.000043387565,0.000014493042,0.000025695057,0.000018458417,0.963773,0.0011516786,0.02935642,0.00032519578,0.0050903903],"study_design_scores_gemma":[0.0000021187348,0.000011937968,0.00003120176,0.0000034826785,0.0000026561484,0.000004715858,0.0000042754627,0.9959116,0.00019815887,0.0035662628,0.00026077693,0.0000027997055],"about_ca_topic_score_codex":0.005254094,"about_ca_topic_score_gemma":0.002764911,"teacher_disagreement_score":0.005254094,"about_ca_system_score_codex":0.0026478423,"about_ca_system_score_gemma":0.0019779247,"threshold_uncertainty_score":0.01921159},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.523142,0.00034737273,0.4469564,0.00040873152,0.00022997036,0.00012787218,0.00016612893,0.0013846371,0.027236916],"genre_scores_gemma":[0.92028695,0.00011044684,0.07690615,0.000053878026,0.000021899246,0.00008197362,0.00012259978,0.00014571934,0.0022703528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968326,0.00010871355,0.000015717498,0.000038088638,0.00010079177,0.00005340742],"domain_scores_gemma":[0.9989114,0.0005325317,0.00007721159,0.00027727612,0.00013957566,0.00006211153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005121754,0.0004146907,0.00067012856,0.0003457364,0.00049532275,0.0012506328,0.0012303605,0.00092838355,0.0035796016],"category_scores_gemma":[0.003888366,0.00032295953,0.0004032462,0.00061859074,0.0009918191,0.0014635635,0.0009984343,0.00088512193,0.00029107297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010551164,0.00006617235,0.0007124495,0.000032812877,0.0000205419,0.000043116863,0.00005420924,0.9608888,0.00169204,0.028629387,0.00048465023,0.0072703185],"study_design_scores_gemma":[0.000015634598,0.000008680223,0.0000483581,0.0000015404047,0.0000031424347,0.000004142171,0.000007862386,0.9938606,0.00067382323,0.005112709,0.0002613332,0.0000021479345],"about_ca_topic_score_codex":0.0026790765,"about_ca_topic_score_gemma":0.0028411234,"teacher_disagreement_score":0.0035796016,"about_ca_system_score_codex":0.00060229615,"about_ca_system_score_gemma":0.0006892591,"threshold_uncertainty_score":0.011974931},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75852615,0.0003850783,0.23243974,0.00026844858,0.00004209418,0.00006709882,0.000056180383,0.0018234527,0.006391738],"genre_scores_gemma":[0.9469059,0.00010055046,0.051753305,0.000032613025,0.000015582538,0.000048501868,0.00008842072,0.00008282232,0.00097232877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957067,0.000118604505,0.000021506146,0.000058956324,0.00013017326,0.00010014826],"domain_scores_gemma":[0.99862254,0.0005939989,0.00013431911,0.0003637645,0.00018186723,0.000103467915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057376205,0.00045930812,0.00044303975,0.00038284133,0.0007668812,0.000670593,0.0010028754,0.00032292225,0.0013249505],"category_scores_gemma":[0.0016929158,0.00035365397,0.00032334245,0.00070275145,0.00067589857,0.0012386516,0.00097321265,0.0005057009,0.00034266614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076166546,0.00032641066,0.0051700617,0.00019581568,0.000103502214,0.00068697595,0.0003351769,0.69671386,0.15616718,0.015873298,0.0030694199,0.120596536],"study_design_scores_gemma":[0.000086354215,0.00021928514,0.0012541306,0.0000067568026,0.00002266949,0.00007423879,0.00008020065,0.9507222,0.03385644,0.01173464,0.0019282292,0.0000148802355],"about_ca_topic_score_codex":0.0020044204,"about_ca_topic_score_gemma":0.0039106477,"teacher_disagreement_score":0.0020044204,"about_ca_system_score_codex":0.00052267825,"about_ca_system_score_gemma":0.0007988582,"threshold_uncertainty_score":0.00443238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22598359,0.0024809532,0.73341155,0.00084849645,0.00037435826,0.00025526097,0.00044701833,0.02463015,0.011568618],"genre_scores_gemma":[0.7128125,0.00041878028,0.26373288,0.00042343777,0.00011222007,0.00010310177,0.00045302996,0.0006219721,0.021322073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922323,0.000062579355,0.00003903673,0.00013869809,0.00042623573,0.000110265406],"domain_scores_gemma":[0.99807453,0.00025583082,0.00036855906,0.0005893974,0.0006496697,0.00006193988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002525438,0.0010555675,0.0007288359,0.0010391754,0.00067827484,0.0010369829,0.002729139,0.00082241226,0.0057269144],"category_scores_gemma":[0.001680516,0.0003239639,0.0003185117,0.0011569065,0.00044931693,0.0017541687,0.0009743176,0.000646593,0.0014874501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011774832,0.00055280974,0.005570257,0.00072420045,0.00024189723,0.0005049732,0.00027766736,0.060125656,0.25163844,0.0086996015,0.02673202,0.643755],"study_design_scores_gemma":[0.00022202257,0.00077123195,0.0028123246,0.00006120104,0.00016983761,0.0011735102,0.00013722137,0.32891127,0.6349493,0.0040951953,0.026590861,0.000105992985],"about_ca_topic_score_codex":0.0019527077,"about_ca_topic_score_gemma":0.00600159,"teacher_disagreement_score":0.0057269144,"about_ca_system_score_codex":0.00072445767,"about_ca_system_score_gemma":0.001062695,"threshold_uncertainty_score":0.019158423},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32489502,0.002576525,0.60642695,0.0004939852,0.0005438563,0.00032856505,0.000923884,0.03577115,0.028040031],"genre_scores_gemma":[0.72986156,0.00083620544,0.24967182,0.00051516533,0.00009977498,0.00017853927,0.0018700665,0.0010127365,0.015954131],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987173,0.000010177944,0.000009353534,0.000025620362,0.00004749405,0.00003575489],"domain_scores_gemma":[0.9998714,0.000016544094,0.000020265279,0.00002487405,0.000035659872,0.000031249994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001639125,0.0003574433,0.00031297546,0.00034400963,0.00020151673,0.00056414236,0.00091656955,0.00017092557,0.004340024],"category_scores_gemma":[0.00033966187,0.00028999217,0.00028584723,0.00032987646,0.00025072452,0.00064481073,0.0004621388,0.0005327335,0.0010887951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001815804,0.0001891047,0.010643157,0.0006485353,0.00020114201,0.00060300116,0.00026290442,0.071956016,0.35174596,0.02697728,0.0410298,0.49392727],"study_design_scores_gemma":[0.0005858921,0.0021964042,0.008428479,0.00009612759,0.00025566336,0.0008447458,0.00013352334,0.57878757,0.25534356,0.010570749,0.14258975,0.00016760791],"about_ca_topic_score_codex":0.0013785962,"about_ca_topic_score_gemma":0.0023724458,"teacher_disagreement_score":0.004340024,"about_ca_system_score_codex":0.0003852153,"about_ca_system_score_gemma":0.00086229964,"threshold_uncertainty_score":0.014518797},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50361395,0.004616919,0.43762267,0.0011862855,0.0003623645,0.000212367,0.0005320052,0.0009496199,0.050903816],"genre_scores_gemma":[0.7601346,0.00092524453,0.23490046,0.00014726333,0.000121378805,0.00017192314,0.000240605,0.00017746381,0.0031811625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929965,0.00033647215,0.000021653823,0.0000522927,0.00021196426,0.00007792147],"domain_scores_gemma":[0.9848316,0.013618958,0.0003160176,0.0005963048,0.00052445754,0.000112683636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018228403,0.0005717564,0.00082591246,0.00094125496,0.0006264876,0.0009290144,0.0011091875,0.0007349524,0.005821822],"category_scores_gemma":[0.011839607,0.00039642927,0.0005377021,0.0016763079,0.0007855229,0.0016081296,0.0004747481,0.0011498011,0.00023154155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021014927,0.00015861871,0.0008620295,0.00013583082,0.000026264415,0.000026867161,0.00004485273,0.92560506,0.0005149957,0.027135277,0.0014922515,0.043787703],"study_design_scores_gemma":[0.00001627178,0.000028901717,0.000115917086,0.0000048839183,0.0000053443787,0.000006203047,0.000013770938,0.99577856,0.00011893677,0.0036877745,0.00022132332,0.000002172494],"about_ca_topic_score_codex":0.009031719,"about_ca_topic_score_gemma":0.013909481,"teacher_disagreement_score":0.009031719,"about_ca_system_score_codex":0.0011460923,"about_ca_system_score_gemma":0.0021344756,"threshold_uncertainty_score":0.019475937},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46389672,0.0043756734,0.28517348,0.0012817695,0.0012761746,0.00035849801,0.0019292848,0.013485627,0.2282228],"genre_scores_gemma":[0.85225874,0.001240492,0.12833998,0.00021334595,0.000089585585,0.00009957832,0.0010325029,0.00016228415,0.016563509],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997371,0.000050691797,0.000011979321,0.000044163808,0.000112612775,0.00004336325],"domain_scores_gemma":[0.999705,0.000067179506,0.000022512404,0.00009857745,0.00007551596,0.000031062347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020478205,0.00031591664,0.00029822675,0.00036005277,0.00039869966,0.00075656874,0.0007262888,0.00029938648,0.008638255],"category_scores_gemma":[0.00048710505,0.00018675263,0.00017573686,0.0006377201,0.0002456155,0.0004405095,0.00034229932,0.0003356276,0.0016817237],"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.0023091938,0.00036878348,0.010946848,0.00090369245,0.00027136353,0.0012245962,0.00035949468,0.25164744,0.13276893,0.06375002,0.083150685,0.45229897],"study_design_scores_gemma":[0.00048917596,0.0007707317,0.009243878,0.00011994086,0.00010925313,0.000825944,0.00016203131,0.65643007,0.14276704,0.011241016,0.17774191,0.000098927776],"about_ca_topic_score_codex":0.0039762296,"about_ca_topic_score_gemma":0.0053433497,"teacher_disagreement_score":0.008638255,"about_ca_system_score_codex":0.00057912024,"about_ca_system_score_gemma":0.00045053154,"threshold_uncertainty_score":0.028897882},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2930692,0.0054033156,0.6875776,0.0003610086,0.0005239418,0.00013924221,0.00010330781,0.0039298865,0.008892485],"genre_scores_gemma":[0.90795624,0.0005264585,0.08952373,0.0001358919,0.00004327229,0.000060803428,0.000058823935,0.00011898979,0.0015756935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996574,0.00006478001,0.000026624939,0.000058115016,0.00010671183,0.00008653309],"domain_scores_gemma":[0.9989096,0.00023367931,0.00014260925,0.00041816276,0.00020647807,0.00008942704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037433748,0.0005359555,0.00034420664,0.0003256407,0.00041355082,0.0007787606,0.0011702513,0.00019767786,0.002176107],"category_scores_gemma":[0.0013874117,0.00028441355,0.00026303635,0.00031862714,0.00038048346,0.0012792186,0.0009421172,0.000999886,0.00027576246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001393673,0.00025700981,0.0074712746,0.0007388208,0.0001828761,0.0007264528,0.00080644997,0.26908812,0.28068423,0.084268264,0.00968582,0.34469706],"study_design_scores_gemma":[0.00008212914,0.00096480176,0.002097496,0.000108958666,0.00015838508,0.0004413382,0.00019689059,0.84728944,0.10188378,0.016242824,0.030472985,0.000060939845],"about_ca_topic_score_codex":0.0014255132,"about_ca_topic_score_gemma":0.002925883,"teacher_disagreement_score":0.002176107,"about_ca_system_score_codex":0.000574532,"about_ca_system_score_gemma":0.0011070906,"threshold_uncertainty_score":0.0072798133},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013387602,0.002743643,0.06881041,0.005540971,0.0054628127,0.0006675549,0.019628461,0.03518945,0.8485691],"genre_scores_gemma":[0.12458028,0.0027469876,0.06528972,0.0031110693,0.0017070924,0.0005567336,0.055276375,0.0065052076,0.7402265],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978362,0.0002703077,0.00016517357,0.00040294116,0.0009768639,0.0003485089],"domain_scores_gemma":[0.99637043,0.00035516632,0.00015791674,0.0011728808,0.0015301693,0.00041337093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002139842,0.0010052046,0.00067930634,0.0023293975,0.0019723037,0.004481531,0.0020218752,0.0013753918,0.24887747],"category_scores_gemma":[0.004975589,0.00055576564,0.00078604487,0.0019146949,0.0006210393,0.0037844686,0.0034459499,0.0013666858,0.13011533],"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.00073434407,0.00015859569,0.0030626664,0.00058800774,0.000058539,0.00036917953,0.0004289875,0.0018040045,0.00568457,0.07842765,0.4872797,0.4214037],"study_design_scores_gemma":[0.0000303191,0.000053160187,0.0006318615,0.00006843593,0.000014681448,0.00020780688,0.00012047488,0.0015541981,0.0029001085,0.0067928694,0.9876087,0.000017423448],"about_ca_topic_score_codex":0.0039219703,"about_ca_topic_score_gemma":0.0042946874,"teacher_disagreement_score":0.24887747,"about_ca_system_score_codex":0.0016381877,"about_ca_system_score_gemma":0.0027120523,"threshold_uncertainty_score":0},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006439791,0.020127947,0.028076643,0.50212497,0.040603828,0.00011988255,0.00067993987,0.0010434005,0.40078357],"genre_scores_gemma":[0.17094716,0.027344152,0.021380464,0.26114988,0.027211124,0.00053314696,0.0009442774,0.001300931,0.48918888],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957035,0.0011407975,0.000197693,0.0009662646,0.0013875702,0.0006040954],"domain_scores_gemma":[0.9869681,0.0041980348,0.00080940896,0.0026697598,0.0025055401,0.0028491113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052251695,0.0008866468,0.0011280102,0.00093403214,0.0035841556,0.00982896,0.0028334255,0.0071764775,0.12566617],"category_scores_gemma":[0.037143093,0.0003169245,0.00085560995,0.0006965917,0.007261564,0.01925639,0.00653867,0.011105143,0.058412],"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.00010973221,0.00013995665,0.0009554917,0.00022328462,0.00003274023,0.00043153478,0.00074393256,0.0005007273,0.00034541666,0.31013915,0.5237516,0.16262637],"study_design_scores_gemma":[0.000018434472,0.000045478835,0.00017588612,0.0002855082,0.000008145543,0.00040309332,0.00052636565,0.00044914824,0.0002488037,0.18707088,0.8107458,0.000022578031],"about_ca_topic_score_codex":0.0013683711,"about_ca_topic_score_gemma":0.0012461797,"teacher_disagreement_score":0.12566617,"about_ca_system_score_codex":0.0024350467,"about_ca_system_score_gemma":0.0042482084,"threshold_uncertainty_score":0.4203952},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2619575,0.0010470194,0.6977574,0.00021837474,0.00020177997,0.00025705496,0.00013059103,0.028782284,0.009647908],"genre_scores_gemma":[0.88282365,0.00022382484,0.11065276,0.00023144482,0.000038721013,0.00012351024,0.0002019366,0.00070807966,0.004996022],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995421,0.000077608085,0.000023858274,0.000113194255,0.00012961497,0.00011367544],"domain_scores_gemma":[0.9994067,0.000103477,0.00007823677,0.000270672,0.000065928725,0.00007500029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034316126,0.0005322798,0.0003376955,0.00027755898,0.00031288687,0.0010458939,0.002204859,0.0003520865,0.0031031526],"category_scores_gemma":[0.0009508255,0.00038326217,0.00024929337,0.00017230355,0.0004562291,0.001411914,0.0013360133,0.00091312954,0.0007962279],"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.003737606,0.0006793502,0.012873975,0.0007811797,0.0003199971,0.0014583964,0.0014494007,0.06092035,0.32562977,0.034319274,0.02363215,0.5341986],"study_design_scores_gemma":[0.00034384098,0.0021675113,0.0070961933,0.00010840155,0.0002025936,0.0021929848,0.00021785112,0.57679415,0.29283682,0.008785339,0.109057106,0.00019732742],"about_ca_topic_score_codex":0.0009895185,"about_ca_topic_score_gemma":0.00089169334,"teacher_disagreement_score":0.0031031526,"about_ca_system_score_codex":0.00043706395,"about_ca_system_score_gemma":0.0006551863,"threshold_uncertainty_score":0.010381103},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1201446,0.00036545403,0.8717424,0.00026823653,0.00010350744,0.00017224764,0.000108030945,0.0016710011,0.0054244753],"genre_scores_gemma":[0.4608486,0.00034443443,0.53508097,0.0000671702,0.00004394241,0.00042641777,0.00034773277,0.0004610438,0.0023796516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962175,0.00011142718,0.000022065622,0.000042710228,0.00015314035,0.000048973117],"domain_scores_gemma":[0.9994387,0.00023748381,0.000034243043,0.0000997476,0.00013296743,0.000056946832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006174183,0.0007024248,0.0009327702,0.0004744839,0.0008618683,0.0006064906,0.0014206817,0.00060139643,0.0019730595],"category_scores_gemma":[0.00199782,0.00037103245,0.0005048523,0.0005976668,0.00046557304,0.000771998,0.0008327537,0.0009605862,0.0004197891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015020421,0.00009784774,0.00067167246,0.00010978763,0.00004900472,0.00011115319,0.00011038435,0.9028233,0.0129676405,0.016471867,0.00096432545,0.065472744],"study_design_scores_gemma":[0.000016220598,0.000010986548,0.00006279232,0.0000017293788,0.0000021654416,0.000006327977,0.000004811702,0.99638224,0.0015373796,0.0015598929,0.00041245163,0.0000028933762],"about_ca_topic_score_codex":0.0036503514,"about_ca_topic_score_gemma":0.0039194655,"teacher_disagreement_score":0.0036503514,"about_ca_system_score_codex":0.0006882331,"about_ca_system_score_gemma":0.0012342187,"threshold_uncertainty_score":0.007258177},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19160216,0.0026401493,0.7559818,0.0045072576,0.00042624437,0.000074750635,0.0000829023,0.001325513,0.043359168],"genre_scores_gemma":[0.9015463,0.00088722573,0.090777054,0.0004948298,0.00016377223,0.00005759482,0.000053512988,0.00024823335,0.0057714856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990971,0.00021294074,0.000037031652,0.00010150278,0.0003875425,0.00016388383],"domain_scores_gemma":[0.99807477,0.0006473002,0.00020264888,0.00048395715,0.00044617397,0.00014510311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012981329,0.00060647615,0.0007080265,0.00032638505,0.0005174404,0.0014724903,0.0021464557,0.00075651717,0.0040531214],"category_scores_gemma":[0.005056982,0.00041595826,0.0002521074,0.0005852308,0.0008470717,0.004755529,0.0013390656,0.0014021664,0.00092924235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004951444,0.0003543751,0.0030190602,0.0005283107,0.00015274405,0.00023503855,0.0002955264,0.33737952,0.08330572,0.2873986,0.011114581,0.2757213],"study_design_scores_gemma":[0.000073420684,0.00013667248,0.00062711374,0.000054070042,0.000057554076,0.00015165318,0.0001562195,0.71404064,0.04268364,0.22210792,0.019867215,0.000043800705],"about_ca_topic_score_codex":0.00038193984,"about_ca_topic_score_gemma":0.0008365274,"teacher_disagreement_score":0.0040531214,"about_ca_system_score_codex":0.00058687583,"about_ca_system_score_gemma":0.0006904547,"threshold_uncertainty_score":0.013559043},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20725037,0.0009021819,0.7182201,0.00056521717,0.00046252034,0.0002732164,0.00048617637,0.054552283,0.017287957],"genre_scores_gemma":[0.72080445,0.0002948122,0.24212585,0.00045864127,0.0001486204,0.00022940911,0.0018101562,0.0036807465,0.03044738],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994381,0.00006527202,0.00002602986,0.000118269476,0.00025481754,0.00009750754],"domain_scores_gemma":[0.9987054,0.00027096612,0.0001038487,0.0005542219,0.0002592196,0.000106409294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028959123,0.0008299593,0.00054922287,0.0007915157,0.0006839751,0.00080247346,0.001199172,0.0006307397,0.004373499],"category_scores_gemma":[0.0015533831,0.00027699248,0.00030805278,0.0007115025,0.0007698217,0.0015480584,0.0015860912,0.0012559234,0.0016858373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015780033,0.00028510703,0.0017277452,0.00024286073,0.00006176012,0.0006829032,0.00038261828,0.008911393,0.6727254,0.008552343,0.016567808,0.28828216],"study_design_scores_gemma":[0.00018208272,0.00058255193,0.0034748649,0.00004456367,0.000070691516,0.0010243986,0.00015873497,0.21314245,0.73636246,0.0085860435,0.036280975,0.00009025421],"about_ca_topic_score_codex":0.0011809889,"about_ca_topic_score_gemma":0.0028283212,"teacher_disagreement_score":0.004373499,"about_ca_system_score_codex":0.0003314549,"about_ca_system_score_gemma":0.0008325046,"threshold_uncertainty_score":0.0146307945},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7703604,0.0007268672,0.22240058,0.00023543008,0.0001080879,0.000056393077,0.00027890078,0.0034804165,0.002352879],"genre_scores_gemma":[0.94388616,0.000057463672,0.054953687,0.00007181068,0.000013717091,0.000017960341,0.00014331893,0.000020803667,0.0008351392],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971086,0.000040414925,0.000016728269,0.00005487165,0.00013052556,0.00004662687],"domain_scores_gemma":[0.99897873,0.00038622576,0.00014777905,0.00013202448,0.00028942345,0.00006589169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003858456,0.0003355361,0.00036187161,0.0005972528,0.00052317494,0.0006344495,0.0008448307,0.0005991351,0.00093165465],"category_scores_gemma":[0.001398338,0.00029137285,0.00017924028,0.00048228668,0.00019475594,0.00054553605,0.00028874184,0.00030711349,0.00035840744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030276654,0.0007649926,0.06640487,0.0002039563,0.00025647855,0.00088272913,0.00020026354,0.13574432,0.42894754,0.0035195635,0.009504911,0.3505426],"study_design_scores_gemma":[0.000021286305,0.0003348164,0.0036908637,0.000007867923,0.00003393772,0.00015687598,0.000029147612,0.91816604,0.07627555,0.00033720033,0.00092048664,0.000025984597],"about_ca_topic_score_codex":0.003514301,"about_ca_topic_score_gemma":0.0072228857,"teacher_disagreement_score":0.003514301,"about_ca_system_score_codex":0.00084160565,"about_ca_system_score_gemma":0.0009832582,"threshold_uncertainty_score":0.006987691},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052429214,0.012650481,0.06748968,0.01442584,0.0069847535,0.0002558928,0.0048351237,0.025850033,0.8622653],"genre_scores_gemma":[0.029902564,0.0067745345,0.023801977,0.0019127021,0.0011753356,0.0001762026,0.0046121078,0.005326006,0.9263185],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99841213,0.00021092,0.00007466473,0.00045652338,0.00065328355,0.00019242306],"domain_scores_gemma":[0.9980988,0.00032162468,0.00009646376,0.0004928872,0.0006134602,0.00037675642],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013059606,0.0012028997,0.0008473433,0.0021316174,0.0015230291,0.0042162063,0.0014649887,0.002045947,0.35710034],"category_scores_gemma":[0.0038272531,0.00048187378,0.00065956876,0.0013316941,0.0008494055,0.004088165,0.0029329306,0.0027046134,0.28240395],"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.00029499605,0.00010669112,0.00055746693,0.00031757177,0.000022253937,0.00035412205,0.00021716853,0.00066388486,0.0027986884,0.06550709,0.4402842,0.4888759],"study_design_scores_gemma":[0.00002380744,0.000022935343,0.00017432196,0.000069528614,0.000006234333,0.00027222538,0.000030169309,0.0006151127,0.0012402792,0.006763785,0.9907659,0.00001566622],"about_ca_topic_score_codex":0.001716327,"about_ca_topic_score_gemma":0.0016477901,"teacher_disagreement_score":0.35710034,"about_ca_system_score_codex":0.0013815693,"about_ca_system_score_gemma":0.0014301016,"threshold_uncertainty_score":0.91701835},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008232184,0.013532832,0.7229688,0.0043034535,0.0028337927,0.00016846533,0.00032354257,0.004302859,0.24333407],"genre_scores_gemma":[0.21889342,0.0100242235,0.6637476,0.0020279193,0.0018966371,0.0004307658,0.000584409,0.0015097172,0.10088533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905914,0.0002469266,0.00007235382,0.00015302557,0.00040071772,0.00006771668],"domain_scores_gemma":[0.99950945,0.00014425706,0.000034763332,0.0001412722,0.00011913388,0.00005109133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009995541,0.00045877797,0.00043914685,0.000584463,0.0011633493,0.0025809593,0.0007626902,0.00068564585,0.0073613496],"category_scores_gemma":[0.0016946001,0.00044053132,0.00064048846,0.00080951327,0.0017409539,0.0020585535,0.0012119245,0.0019962813,0.0041190106],"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.000041808635,0.000026611628,0.00025627777,0.0001850558,0.0000145934755,0.000106128035,0.0003693773,0.005880896,0.0016638782,0.8489702,0.023530807,0.11895441],"study_design_scores_gemma":[0.000030469733,0.00003865623,0.00016893753,0.000063668165,0.000011019001,0.00029937,0.000055283428,0.01504806,0.0016773911,0.37166107,0.6109243,0.000021724958],"about_ca_topic_score_codex":0.0009658498,"about_ca_topic_score_gemma":0.0011741532,"teacher_disagreement_score":0.0073613496,"about_ca_system_score_codex":0.00079181214,"about_ca_system_score_gemma":0.0010774671,"threshold_uncertainty_score":0.024626195},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0142743625,0.0001142017,0.9634218,0.00016266077,0.000076112396,0.00003975949,0.00020828431,0.019737763,0.001965008],"genre_scores_gemma":[0.20726126,0.00015432018,0.78078395,0.00025666942,0.00006099324,0.000108306434,0.000854003,0.007920217,0.002600262],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99675107,0.00070886547,0.00027818244,0.0006208783,0.0012736492,0.0003674103],"domain_scores_gemma":[0.99068844,0.0037350638,0.0007152055,0.0032969997,0.0013827318,0.0001815144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019096287,0.0012880071,0.0010077304,0.00079374766,0.0009076401,0.0024228839,0.003598973,0.0010680488,0.0055710343],"category_scores_gemma":[0.011759243,0.0012920935,0.0019495618,0.0010738627,0.0019811832,0.005429858,0.0025056396,0.0026358424,0.0017186056],"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.0013426096,0.00029942818,0.00857149,0.0008955742,0.00026276553,0.0005741895,0.0010145428,0.39467725,0.06312151,0.10954551,0.02208573,0.39760947],"study_design_scores_gemma":[0.00007316293,0.000056083183,0.00055823976,0.00004978774,0.000039723367,0.00014614782,0.00009240066,0.867923,0.048307933,0.072791345,0.009896684,0.00006551288],"about_ca_topic_score_codex":0.0033149535,"about_ca_topic_score_gemma":0.0064569153,"teacher_disagreement_score":0.0055710343,"about_ca_system_score_codex":0.0013960971,"about_ca_system_score_gemma":0.00234116,"threshold_uncertainty_score":0.018637002},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10563875,0.000901764,0.8892296,0.0006275229,0.0000568855,0.0004113524,0.000034903052,0.00083744916,0.002261806],"genre_scores_gemma":[0.7532463,0.0004882001,0.24371627,0.00019570818,0.00006645003,0.0005930057,0.000094870265,0.00009021231,0.0015089454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991215,0.00032309786,0.00008564409,0.0000933827,0.00027941715,0.00009702535],"domain_scores_gemma":[0.99815315,0.00075853034,0.00031062154,0.0003083507,0.00040143018,0.00006781658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016170571,0.000362653,0.00034380326,0.00052754907,0.00089817675,0.000932831,0.0010344785,0.0006755019,0.0008765416],"category_scores_gemma":[0.0037542738,0.00045622786,0.0002268934,0.0005274176,0.0009018605,0.0020309,0.00085321884,0.00073692907,0.00022455186],"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.0006776013,0.00056813296,0.0065091155,0.0010616013,0.00018580978,0.0005361679,0.0010369634,0.3748727,0.26326638,0.10222025,0.0051956153,0.24386959],"study_design_scores_gemma":[0.00017476104,0.00068869133,0.0006560202,0.00004075325,0.00009217958,0.00024261247,0.00020917156,0.905634,0.06979576,0.011513904,0.010907249,0.00004486035],"about_ca_topic_score_codex":0.00076696154,"about_ca_topic_score_gemma":0.0017421186,"teacher_disagreement_score":0.0016170571,"about_ca_system_score_codex":0.0007547098,"about_ca_system_score_gemma":0.0014033961,"threshold_uncertainty_score":0.008551955},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012304623,0.072996214,0.7685849,0.027779551,0.0029207903,0.00009041549,0.00013570681,0.00087870314,0.114309065],"genre_scores_gemma":[0.23279686,0.080378056,0.6348072,0.0052800444,0.0036352342,0.00037107014,0.000235388,0.00035854208,0.042137567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974877,0.00006941017,0.000014351232,0.000036263576,0.00009956685,0.000031706033],"domain_scores_gemma":[0.99960285,0.00015884827,0.000021781698,0.00006849019,0.000116945215,0.000031116513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005901125,0.00067220035,0.00049363676,0.0005032756,0.00051651715,0.0023404376,0.0017130589,0.0015892356,0.0052311956],"category_scores_gemma":[0.00093400764,0.00035820555,0.00045923237,0.0007635233,0.0012256766,0.004304934,0.0005962455,0.0026662266,0.0014166348],"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.000038812923,0.000053087264,0.00031292497,0.00050883496,0.00003166429,0.0001290212,0.00013243174,0.019992333,0.005447592,0.8671266,0.012414488,0.093812235],"study_design_scores_gemma":[0.000025648736,0.00017288356,0.00024542736,0.00017360639,0.000042797765,0.0003920699,0.00013810386,0.07890483,0.003959907,0.6767385,0.23917647,0.000029798204],"about_ca_topic_score_codex":0.0007850403,"about_ca_topic_score_gemma":0.0019169707,"teacher_disagreement_score":0.0052311956,"about_ca_system_score_codex":0.0006946642,"about_ca_system_score_gemma":0.0008910817,"threshold_uncertainty_score":0.017500103},"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":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013767681,0.13100615,0.3770259,0.022644876,0.0033443503,0.0002032215,0.00045878068,0.0010122291,0.45053682],"genre_scores_gemma":[0.25766516,0.19021396,0.34760213,0.013460463,0.0047603003,0.0006298971,0.0009294386,0.00046116658,0.18427746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994929,0.00007359935,0.00001814793,0.0000801635,0.00023692186,0.00009831022],"domain_scores_gemma":[0.99962187,0.00012530545,0.000029416724,0.000056467263,0.000121615136,0.000045201774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052850635,0.0006060866,0.00029459404,0.0007884966,0.00075648545,0.002414221,0.0012415342,0.0014797787,0.0064571877],"category_scores_gemma":[0.0010440914,0.00038360906,0.00032889989,0.0006899902,0.001160103,0.004692166,0.0013002508,0.0020441106,0.0021280635],"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.000010671554,0.000019200685,0.00022882903,0.0003829206,0.000013722752,0.00013512996,0.00043950553,0.0023864699,0.0022705498,0.8958888,0.01804663,0.0801776],"study_design_scores_gemma":[0.0000057018515,0.000026004038,0.00041461943,0.00027440893,0.000008341031,0.00040938758,0.00015762163,0.0049064313,0.0015601894,0.31267673,0.67954576,0.000014765266],"about_ca_topic_score_codex":0.0015838055,"about_ca_topic_score_gemma":0.0018540237,"teacher_disagreement_score":0.0064571877,"about_ca_system_score_codex":0.0010878785,"about_ca_system_score_gemma":0.0010902253,"threshold_uncertainty_score":0.021601439},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56511307,0.0010043258,0.4169815,0.0016671382,0.00010501545,0.00016986056,0.0003219088,0.0049129366,0.009724233],"genre_scores_gemma":[0.8879242,0.00037494503,0.10828927,0.00013423283,0.00007735251,0.00011287864,0.00036119611,0.001122386,0.0016034761],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958658,0.001113316,0.00027627737,0.00047714307,0.0019299847,0.000337437],"domain_scores_gemma":[0.9793306,0.010287431,0.0022420443,0.0054117534,0.002317907,0.00041027737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029120746,0.0013601745,0.0007635684,0.003059819,0.0012655956,0.0028843994,0.0013029055,0.00069477776,0.0010238102],"category_scores_gemma":[0.026594974,0.0008688292,0.0005076269,0.003067831,0.0019177792,0.0052147405,0.002162033,0.0021291613,0.00036193492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012643139,0.00062805606,0.07082083,0.0008315076,0.00013690985,0.0012295065,0.007683558,0.21691649,0.11217611,0.09259184,0.0053910916,0.49032977],"study_design_scores_gemma":[0.000046389472,0.00035432095,0.055280324,0.00014070359,0.00012467323,0.0007999891,0.0013572269,0.73167247,0.06136374,0.13091452,0.01778384,0.00016181945],"about_ca_topic_score_codex":0.002603937,"about_ca_topic_score_gemma":0.0025895345,"teacher_disagreement_score":0.003059819,"about_ca_system_score_codex":0.0012771167,"about_ca_system_score_gemma":0.0012625211,"threshold_uncertainty_score":0.015400708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4452305,0.000674828,0.53651327,0.00032805905,0.00012638114,0.0001541066,0.0003875219,0.009692548,0.006892721],"genre_scores_gemma":[0.87181544,0.0003215822,0.122862324,0.00008195822,0.000037281934,0.00008948173,0.0006816464,0.00037453562,0.0037357444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957937,0.000049531292,0.00002566128,0.00005976854,0.00022507504,0.00006064026],"domain_scores_gemma":[0.9983364,0.00059571065,0.00017608971,0.00043886114,0.00040896703,0.00004408032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032315846,0.0006371144,0.00023568797,0.001079864,0.00022600516,0.00055854407,0.0006780619,0.00023257303,0.001732256],"category_scores_gemma":[0.0026169368,0.00017751733,0.00015384468,0.0010583829,0.00031325038,0.00089304434,0.00035047668,0.00041753522,0.0003173387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010320232,0.00019825676,0.0036527596,0.00015548727,0.000030668343,0.00036881943,0.00026801403,0.07490614,0.32127577,0.008137082,0.0030301334,0.5869448],"study_design_scores_gemma":[0.00004738933,0.0004285414,0.0023644848,0.000027020329,0.00002599169,0.00042492634,0.00008303828,0.45622,0.5304329,0.003592101,0.0063239615,0.000029720833],"about_ca_topic_score_codex":0.0013789205,"about_ca_topic_score_gemma":0.0021371127,"teacher_disagreement_score":0.001732256,"about_ca_system_score_codex":0.00050495716,"about_ca_system_score_gemma":0.0008987007,"threshold_uncertainty_score":0.005795002},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091849044,0.009829672,0.88755095,0.0007194988,0.00021615595,0.000066257904,0.00021739966,0.0035507805,0.006000142],"genre_scores_gemma":[0.80174434,0.002746063,0.19010475,0.00019531786,0.00013046026,0.0000974845,0.00029787925,0.00016155538,0.0045221676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998134,0.000041382238,0.0000093240615,0.000029305724,0.00008925386,0.000017438322],"domain_scores_gemma":[0.9994404,0.0002627302,0.00006596862,0.00009878651,0.00010992626,0.000022099523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002477983,0.0004848033,0.00032477535,0.0003530037,0.0002543809,0.00039346376,0.000691886,0.00030105433,0.002048515],"category_scores_gemma":[0.00155853,0.00028824428,0.00012881278,0.0007963436,0.0002527213,0.0007647703,0.0003171805,0.0006452912,0.00041206274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035282073,0.00009048277,0.002730927,0.00020856247,0.000038303166,0.000110443914,0.000047993068,0.45784757,0.03918305,0.01896604,0.005848088,0.4745756],"study_design_scores_gemma":[0.000018079547,0.00008352375,0.00048669818,0.0000205739,0.000013679134,0.000031917974,0.0000059371214,0.9703167,0.011385178,0.014266606,0.0033608607,0.000010324293],"about_ca_topic_score_codex":0.0014175146,"about_ca_topic_score_gemma":0.0022170015,"teacher_disagreement_score":0.002048515,"about_ca_system_score_codex":0.00041299177,"about_ca_system_score_gemma":0.0007202417,"threshold_uncertainty_score":0.0068529844},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00417438,0.00024985804,0.9876987,0.0002960707,0.00007888464,0.00009420856,0.000063327345,0.00034622988,0.0069983164],"genre_scores_gemma":[0.19616856,0.00070679764,0.7901313,0.00028608943,0.00020307393,0.0004724223,0.00026193948,0.00028933428,0.011480443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970481,0.00081926474,0.00018035498,0.00029414037,0.0013756657,0.00028258297],"domain_scores_gemma":[0.99698037,0.0016635054,0.00016122662,0.0004092088,0.0006450855,0.00014051524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00505053,0.0005563924,0.0007389798,0.00090063456,0.0016540154,0.0021355443,0.0018181725,0.0007580763,0.0043616407],"category_scores_gemma":[0.005260962,0.0006428512,0.0017841375,0.0013958798,0.0038713857,0.003194206,0.0023775366,0.0029928077,0.00073820376],"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.000015045288,0.000016355007,0.000092198454,0.00003858343,0.000009904217,0.0000791476,0.00018936108,0.010068336,0.0007686389,0.98006433,0.0008094359,0.007848638],"study_design_scores_gemma":[0.000055703633,0.000024992734,0.00007449933,0.000034134122,0.000033510412,0.00007826966,0.000046790552,0.118988454,0.0017198949,0.8535432,0.025376676,0.000023886749],"about_ca_topic_score_codex":0.008267726,"about_ca_topic_score_gemma":0.0061701615,"teacher_disagreement_score":0.008267726,"about_ca_system_score_codex":0.0026609418,"about_ca_system_score_gemma":0.003645741,"threshold_uncertainty_score":0.026710033},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43031287,0.0009855164,0.51566607,0.0008295323,0.00021349905,0.00005409495,0.00013084433,0.0036326228,0.048175003],"genre_scores_gemma":[0.8580677,0.00032158958,0.13492227,0.00012210495,0.000022983704,0.000036297333,0.00010222284,0.00007315437,0.0063316743],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99994516,0.000010621619,0.0000023085101,0.000008604881,0.000020217896,0.00001306302],"domain_scores_gemma":[0.999915,0.00001950183,0.000007700389,0.000023230485,0.000019010831,0.000015531687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007497817,0.0001802298,0.00012412554,0.00016892861,0.00023411908,0.00057511445,0.0005052877,0.0002732122,0.0027507283],"category_scores_gemma":[0.00031312887,0.00010228815,0.00012626022,0.00019485084,0.00021731887,0.0006587091,0.00036656664,0.0003048704,0.00053718186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054525875,0.00012074894,0.0031771057,0.0002842142,0.0000594121,0.0006904858,0.0002552904,0.2397328,0.31673285,0.2023965,0.009937817,0.22606751],"study_design_scores_gemma":[0.00010849996,0.00057482696,0.0018741554,0.000042885953,0.000047671034,0.00043582226,0.00010431524,0.82002467,0.071755596,0.033981908,0.07101007,0.000039637987],"about_ca_topic_score_codex":0.0013592234,"about_ca_topic_score_gemma":0.00238871,"teacher_disagreement_score":0.0027507283,"about_ca_system_score_codex":0.00034114264,"about_ca_system_score_gemma":0.00040511493,"threshold_uncertainty_score":0.009202063},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.502799,0.00009669433,0.4809145,0.00022586982,0.000119853576,0.0002054112,0.000073523865,0.006449795,0.00911529],"genre_scores_gemma":[0.7464374,0.00007440605,0.24456583,0.000095563875,0.000025097284,0.00020349915,0.00023308341,0.00072732504,0.0076378263],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974734,0.0000319436,0.000017119797,0.00005468474,0.00008724466,0.000061673454],"domain_scores_gemma":[0.9995388,0.00007729082,0.00005457738,0.00017051277,0.00010836724,0.00005056717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040248942,0.00038046588,0.0003985129,0.00024672778,0.00071093725,0.00073108106,0.0013432276,0.00041510205,0.0022277324],"category_scores_gemma":[0.00076081086,0.0002938902,0.00028210937,0.0002821177,0.0005128449,0.0008647673,0.00090060674,0.00052282197,0.00080816867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013140425,0.00058213685,0.008111965,0.00043905052,0.000094279545,0.0005784765,0.0012466806,0.16103211,0.65630025,0.022751322,0.0045618583,0.14298789],"study_design_scores_gemma":[0.00022191888,0.0007446566,0.0034577725,0.0000206136,0.00006210401,0.00022091651,0.00028963975,0.68382865,0.28844872,0.004388376,0.018242864,0.000073695985],"about_ca_topic_score_codex":0.0015427052,"about_ca_topic_score_gemma":0.0036374223,"teacher_disagreement_score":0.0022277324,"about_ca_system_score_codex":0.00046767696,"about_ca_system_score_gemma":0.0009098892,"threshold_uncertainty_score":0.007452488},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060456647,0.00040867084,0.9680351,0.0002717615,0.00003973838,0.000059109636,0.00016843426,0.020997275,0.0039741453],"genre_scores_gemma":[0.11832496,0.0007161434,0.85888755,0.00039379604,0.00006325059,0.00015406824,0.00076736143,0.009196349,0.011496417],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99931383,0.00016588057,0.000030003692,0.00012739055,0.00024585682,0.00011701413],"domain_scores_gemma":[0.99888617,0.00047329892,0.000108670494,0.0003343688,0.00013747145,0.000060036327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012385366,0.0012801187,0.00079522014,0.0011973287,0.0006545768,0.002209895,0.0023121785,0.0013172369,0.007404598],"category_scores_gemma":[0.0029608717,0.00096915115,0.0015367672,0.00071590586,0.0023616091,0.0028451653,0.002359992,0.0021516748,0.0023014892],"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.0008419713,0.00014555051,0.0037060964,0.0011642508,0.00013327741,0.00077530387,0.0017283027,0.12793016,0.06582896,0.34631702,0.036353443,0.41507563],"study_design_scores_gemma":[0.00013009222,0.00032906848,0.0017827215,0.00037516988,0.00012744442,0.0010465966,0.00023327395,0.46100923,0.07009001,0.13171355,0.33294785,0.00021497768],"about_ca_topic_score_codex":0.0036290283,"about_ca_topic_score_gemma":0.0048683947,"teacher_disagreement_score":0.007404598,"about_ca_system_score_codex":0.0011250441,"about_ca_system_score_gemma":0.0014353038,"threshold_uncertainty_score":0.024770856},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05021517,0.0008642204,0.9464818,0.0001180225,0.0000811385,0.000036450954,0.000025962476,0.00088337297,0.0012938493],"genre_scores_gemma":[0.73105377,0.00037662202,0.26680613,0.00006511098,0.00008613457,0.000057013403,0.00009500264,0.0000900739,0.0013701329],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996805,0.000079972895,0.00002097705,0.000057808193,0.000122006226,0.00003872599],"domain_scores_gemma":[0.99970144,0.000092135095,0.00004977549,0.000060162103,0.00007793585,0.000018459134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033596437,0.0004321523,0.0003291988,0.00029826912,0.00029051048,0.00030131504,0.0007842604,0.00018468063,0.0008548863],"category_scores_gemma":[0.0007188767,0.00014583796,0.00019318149,0.0003309074,0.00022129566,0.00053591206,0.0002625723,0.00029099418,0.000120832476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004872452,0.00018659377,0.0011101628,0.0002471624,0.000054360895,0.000117012525,0.00010476248,0.33870146,0.15005949,0.012955522,0.0024366872,0.49353963],"study_design_scores_gemma":[0.000058826965,0.00030581915,0.00031668087,0.0000064527158,0.000015329782,0.0000811121,0.000015783282,0.9559002,0.035757523,0.0032016505,0.004330548,0.000010025501],"about_ca_topic_score_codex":0.00059023546,"about_ca_topic_score_gemma":0.00122538,"teacher_disagreement_score":0.0008548863,"about_ca_system_score_codex":0.00038969726,"about_ca_system_score_gemma":0.0005861072,"threshold_uncertainty_score":0.0028598309},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20871454,0.00067692355,0.76724666,0.000387132,0.000103486,0.00017697558,0.00015413357,0.015269416,0.0072707636],"genre_scores_gemma":[0.6876025,0.00027939113,0.30119842,0.00035490782,0.00007456333,0.00016883806,0.00045006358,0.0020474454,0.007823719],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873096,0.0001862106,0.00009216072,0.00017022683,0.00063077855,0.00018973992],"domain_scores_gemma":[0.9977731,0.000538558,0.00033491483,0.00091357605,0.00039740797,0.000042423184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062531955,0.00087641994,0.000800614,0.0009721303,0.0006286636,0.0007611659,0.0013570763,0.00033169895,0.0020354379],"category_scores_gemma":[0.0035455718,0.00041005795,0.0006034077,0.0009597387,0.00094963325,0.0012424233,0.0013377138,0.00079416,0.0008094886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007175867,0.00014950415,0.008370751,0.00043283816,0.00010428078,0.00049950054,0.0005796383,0.058702365,0.24481034,0.035516933,0.010987656,0.6391285],"study_design_scores_gemma":[0.00013667226,0.0006628771,0.003612245,0.000103894585,0.00020497732,0.00065368897,0.00015081496,0.4749045,0.4549751,0.025695713,0.038789533,0.00010991544],"about_ca_topic_score_codex":0.0013381992,"about_ca_topic_score_gemma":0.001879707,"teacher_disagreement_score":0.0020354379,"about_ca_system_score_codex":0.00042817826,"about_ca_system_score_gemma":0.0016610775,"threshold_uncertainty_score":0.0068092346},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017979024,0.0040389565,0.28036174,0.0020083103,0.00176251,0.001625369,0.014313058,0.22266749,0.4552435],"genre_scores_gemma":[0.18832,0.0066679535,0.29724145,0.0026231427,0.0007043656,0.0029600312,0.07025555,0.03728485,0.39394265],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99804723,0.00020453613,0.00013768124,0.00026483182,0.0010525038,0.00029324082],"domain_scores_gemma":[0.9952343,0.00043392004,0.00024305869,0.0013493019,0.0022116343,0.0005277333],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001788358,0.00085972593,0.0008252957,0.0015357396,0.001345005,0.0026894328,0.0022795354,0.0010333896,0.07003998],"category_scores_gemma":[0.0058265906,0.0007151687,0.0007518202,0.001786824,0.00054230203,0.0037928643,0.003035775,0.0015058509,0.071518384],"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.0007863732,0.00016085128,0.0021246974,0.0010041512,0.000093482275,0.00022840133,0.00030535247,0.003732413,0.013844776,0.038218606,0.63223493,0.307266],"study_design_scores_gemma":[0.00013418579,0.0001601396,0.0024867721,0.00011115038,0.000041492927,0.00042589018,0.00007898281,0.015778475,0.0071806153,0.009270973,0.9642301,0.000101269514],"about_ca_topic_score_codex":0.003935525,"about_ca_topic_score_gemma":0.0036647702,"teacher_disagreement_score":0.92996,"about_ca_system_score_codex":0.0009371682,"about_ca_system_score_gemma":0.004250018,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08829249,0.00038446134,0.89691603,0.00025725475,0.00012814516,0.000091420996,0.00016059398,0.0028433474,0.010926292],"genre_scores_gemma":[0.50719607,0.00021328776,0.48579198,0.00015441666,0.000055833396,0.00023768873,0.0005789775,0.00033454364,0.0054371753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933475,0.00012949282,0.00005738849,0.00010115918,0.0002624042,0.000114673305],"domain_scores_gemma":[0.9989793,0.00028802783,0.00006517949,0.00032460678,0.00028038525,0.000062576546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062490074,0.00069193967,0.00066250324,0.00042067404,0.0006065152,0.00074661715,0.0011771607,0.00031990066,0.0059261853],"category_scores_gemma":[0.0025274951,0.00030532564,0.00039575947,0.0010069655,0.00053163787,0.0022223082,0.0015858202,0.0008258334,0.0014228548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014507292,0.00032687493,0.0028186997,0.00068222487,0.00007382426,0.00066457555,0.0004989698,0.15318115,0.10222573,0.15707798,0.02084431,0.56015503],"study_design_scores_gemma":[0.000147849,0.0002994595,0.00052630005,0.0000506894,0.000028144532,0.00022217719,0.00010837991,0.848828,0.056199837,0.077212036,0.016346952,0.000030199371],"about_ca_topic_score_codex":0.0010764115,"about_ca_topic_score_gemma":0.0028151136,"teacher_disagreement_score":0.0059261853,"about_ca_system_score_codex":0.0004389562,"about_ca_system_score_gemma":0.0009135911,"threshold_uncertainty_score":0.0198251},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18106787,0.00024878557,0.72501624,0.0014713051,0.00017115832,0.00034875958,0.001101312,0.010410693,0.08016397],"genre_scores_gemma":[0.60290956,0.000353979,0.38013613,0.00012381721,0.00002261868,0.00038767917,0.00094235025,0.00062105234,0.014502804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99972063,0.000128703,0.000014765295,0.000025510246,0.00008404732,0.000026343632],"domain_scores_gemma":[0.99897397,0.0005233802,0.000038537128,0.00022787886,0.00014754978,0.000088702574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043278205,0.00030322597,0.00023698002,0.00019523935,0.00037537847,0.0007449836,0.000757943,0.00051338336,0.0076666432],"category_scores_gemma":[0.0029570353,0.00019848488,0.0002581846,0.00028107816,0.0004003923,0.0009788092,0.00076223724,0.0007663235,0.001401194],"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.0009793658,0.0004416398,0.0042495625,0.000386573,0.000057102803,0.00072115456,0.0010036689,0.54639727,0.04149251,0.17347209,0.02783457,0.20296451],"study_design_scores_gemma":[0.0002169355,0.00038314387,0.0009055882,0.00008962802,0.000026006888,0.0002380649,0.0001259908,0.7566911,0.0638499,0.040097173,0.13733134,0.000045140234],"about_ca_topic_score_codex":0.001311829,"about_ca_topic_score_gemma":0.0015885759,"teacher_disagreement_score":0.0076666432,"about_ca_system_score_codex":0.00045017287,"about_ca_system_score_gemma":0.0008157989,"threshold_uncertainty_score":0.025647461},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3076773,0.005157149,0.47420508,0.0018080338,0.0008115198,0.00068089814,0.0025018344,0.026883125,0.18027508],"genre_scores_gemma":[0.75372887,0.0013319108,0.14070335,0.0012072121,0.00013626985,0.0002464993,0.0034319374,0.0007581483,0.098455854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997696,0.000022842158,0.000010818248,0.00003368979,0.00012417794,0.00003876954],"domain_scores_gemma":[0.9997223,0.000034584413,0.00003365923,0.000042404434,0.00012333259,0.000043759926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019460704,0.00037381452,0.00018721297,0.0004157834,0.00034707735,0.00072608195,0.0005176214,0.00021808271,0.011263821],"category_scores_gemma":[0.00051560544,0.00018826949,0.00015749587,0.00029778323,0.0003722952,0.00070767873,0.0006074098,0.00053576624,0.0020392993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00128124,0.00016116178,0.0047307615,0.00086426036,0.00006146284,0.0008428882,0.00042471045,0.013890361,0.23226948,0.05226192,0.099875286,0.5933365],"study_design_scores_gemma":[0.00039938328,0.0015612289,0.007972795,0.00018370202,0.000112245434,0.001365524,0.00026557792,0.1359257,0.30752364,0.011785314,0.53276104,0.00014389306],"about_ca_topic_score_codex":0.002962395,"about_ca_topic_score_gemma":0.0064594336,"teacher_disagreement_score":0.011263821,"about_ca_system_score_codex":0.00081161223,"about_ca_system_score_gemma":0.0011376457,"threshold_uncertainty_score":0.037681222},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48340955,0.001819839,0.41735387,0.0016995742,0.00023759893,0.00013129822,0.00037893286,0.05713839,0.03783095],"genre_scores_gemma":[0.9278933,0.0001368335,0.06697311,0.00022970591,0.000075127304,0.00007031786,0.00027690467,0.0021099865,0.002234715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798834,0.00033644444,0.00014837626,0.000305865,0.00074401964,0.00047700157],"domain_scores_gemma":[0.9937686,0.0016456319,0.00073497434,0.0026613714,0.0008749808,0.00031452376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011823238,0.00077333266,0.0004749317,0.0008512743,0.0006058412,0.0014350292,0.0015711511,0.0004422436,0.004199224],"category_scores_gemma":[0.008067469,0.0004349428,0.00034977388,0.00087886443,0.00096643984,0.0025834367,0.0015091778,0.001533701,0.0016750094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014448354,0.00040218173,0.0190759,0.000522685,0.00007149556,0.00043316698,0.00072611164,0.1182322,0.26292884,0.03221422,0.02752668,0.53642166],"study_design_scores_gemma":[0.0000768597,0.00041952988,0.0068264375,0.000053152155,0.00006216879,0.0006398647,0.00011253341,0.7276772,0.23436478,0.010542531,0.019135932,0.00008894896],"about_ca_topic_score_codex":0.0015510248,"about_ca_topic_score_gemma":0.002276359,"teacher_disagreement_score":0.004199224,"about_ca_system_score_codex":0.001577097,"about_ca_system_score_gemma":0.0017792223,"threshold_uncertainty_score":0.014047861},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034263816,0.00036189763,0.9224129,0.0002891153,0.0001770155,0.00015755756,0.0019527505,0.020936528,0.01944849],"genre_scores_gemma":[0.27745825,0.00037913016,0.69030386,0.000237036,0.000040171853,0.00048545157,0.003926563,0.0034027183,0.023766804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993986,0.000114926755,0.00006117811,0.00009985009,0.00021734706,0.00010808897],"domain_scores_gemma":[0.9980209,0.00036536815,0.00013322834,0.0009259926,0.00045717758,0.00009731682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005952459,0.00054646604,0.00043780595,0.0008653706,0.00080333,0.0017794779,0.0013262735,0.00058957224,0.015842691],"category_scores_gemma":[0.0024880501,0.00047981535,0.00042488723,0.0017131567,0.0004992256,0.0016308189,0.0019163194,0.00062859466,0.003816107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089796254,0.00028743804,0.004739389,0.0007407157,0.000059760892,0.00033958585,0.0007815597,0.069764465,0.08124796,0.1449362,0.0594476,0.6367573],"study_design_scores_gemma":[0.000292443,0.0004065299,0.002491502,0.0001377103,0.00007044987,0.0006561013,0.00035293298,0.3341981,0.1814849,0.079564326,0.40013897,0.00020604527],"about_ca_topic_score_codex":0.0026063616,"about_ca_topic_score_gemma":0.0047439183,"teacher_disagreement_score":0.015842691,"about_ca_system_score_codex":0.00076211704,"about_ca_system_score_gemma":0.0014106339,"threshold_uncertainty_score":0.05299914},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8054169,0.0013973693,0.17682281,0.0010181101,0.00013167184,0.00003936219,0.0006635658,0.0034014217,0.011108864],"genre_scores_gemma":[0.9868564,0.00026161043,0.010816321,0.000040902316,0.00005101855,0.000017363784,0.0004305739,0.00027144616,0.0012544795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990626,0.00021344429,0.000036444486,0.000118273994,0.0004443499,0.0001248747],"domain_scores_gemma":[0.98721516,0.009213306,0.00077347446,0.0011649647,0.0013627218,0.00027042817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011676496,0.000333729,0.00025197235,0.0008838286,0.00047068438,0.00083448534,0.00026951873,0.00024998002,0.001164016],"category_scores_gemma":[0.014454766,0.00020380341,0.00018252179,0.0008335413,0.00046380635,0.0012072927,0.00054731,0.0007146472,0.00048174316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016171898,0.0002606736,0.16661245,0.00017010629,0.000060489096,0.00027678098,0.000763701,0.2314879,0.042442907,0.022513315,0.012582875,0.52121156],"study_design_scores_gemma":[0.00001520555,0.00043723255,0.055589907,0.000046020556,0.000036166206,0.00031012608,0.00018351902,0.83899605,0.08466085,0.015311839,0.00436404,0.0000490654],"about_ca_topic_score_codex":0.0032920016,"about_ca_topic_score_gemma":0.002513783,"teacher_disagreement_score":0.0032920016,"about_ca_system_score_codex":0.0003973917,"about_ca_system_score_gemma":0.0004407058,"threshold_uncertainty_score":0.006545663},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58734757,0.0017234817,0.3995802,0.0002783749,0.00007551874,0.000023491131,0.00007991194,0.0010686675,0.009822787],"genre_scores_gemma":[0.93128985,0.00033807123,0.06647444,0.000092374714,0.000017454413,0.000018640381,0.00005853099,0.00007329161,0.0016373927],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99993646,0.00001138435,0.0000021511792,0.000013428353,0.000026309923,0.000010241523],"domain_scores_gemma":[0.9998789,0.000031989664,0.000026770174,0.00003103423,0.000022158527,0.000009096374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010199322,0.00020482343,0.00017248503,0.00020045716,0.00021521191,0.00046922712,0.0004129083,0.00020378594,0.0007491101],"category_scores_gemma":[0.00022783184,0.00015104783,0.00018220097,0.0002337486,0.00019266899,0.00043658775,0.0004464313,0.00020774677,0.00015476189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019278088,0.00009095787,0.0039482256,0.00022139757,0.00009140326,0.0003084301,0.00030809792,0.25413895,0.5861453,0.01578777,0.0024883128,0.13627833],"study_design_scores_gemma":[0.00004158552,0.00024932023,0.0028897682,0.000021608239,0.00005650983,0.00027870052,0.00014688238,0.8564862,0.11944878,0.008671103,0.011673093,0.000036456484],"about_ca_topic_score_codex":0.00061078585,"about_ca_topic_score_gemma":0.002821168,"teacher_disagreement_score":0.0007491101,"about_ca_system_score_codex":0.0003570147,"about_ca_system_score_gemma":0.0003012102,"threshold_uncertainty_score":0.0025903583},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063904524,0.014778399,0.14141011,0.5530719,0.044290736,0.00014684345,0.00069000665,0.0047504148,0.23447116],"genre_scores_gemma":[0.12788478,0.020160172,0.14852889,0.2681381,0.010362931,0.000431486,0.0015839556,0.006693893,0.41621584],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99596953,0.0011950822,0.00018591761,0.000647705,0.0015628972,0.00043885052],"domain_scores_gemma":[0.9902441,0.0028941736,0.00045901845,0.002468594,0.002623136,0.0013111153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005852332,0.00087007676,0.0005550602,0.0008339484,0.0028668095,0.006130202,0.002430397,0.0046915184,0.06750166],"category_scores_gemma":[0.01966725,0.00045793908,0.0007650823,0.0006572339,0.0047204187,0.015919788,0.0073488904,0.009221029,0.043734107],"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.00020698718,0.00008627942,0.0007902166,0.00048579823,0.000037424765,0.0002633756,0.0018988852,0.0005117567,0.0018042711,0.33265367,0.43000865,0.23125266],"study_design_scores_gemma":[0.0000072743046,0.000030221858,0.00007795706,0.00016152955,0.000005828096,0.0001344526,0.00045027238,0.00014146618,0.0003630163,0.040662464,0.9579534,0.000012099037],"about_ca_topic_score_codex":0.0017808734,"about_ca_topic_score_gemma":0.0021957941,"teacher_disagreement_score":0.06750166,"about_ca_system_score_codex":0.0015605133,"about_ca_system_score_gemma":0.003825172,"threshold_uncertainty_score":0.22581553},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6516475,0.0021164229,0.28428918,0.0005180205,0.00038649258,0.0006337635,0.00080119184,0.022759527,0.036847956],"genre_scores_gemma":[0.73736167,0.00030794166,0.25196296,0.00018966226,0.000040813113,0.000264458,0.00084285263,0.0002583104,0.008771442],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99883145,0.00014959268,0.00008304042,0.00015145147,0.00059741904,0.00018715767],"domain_scores_gemma":[0.99883896,0.00021872141,0.0001137889,0.00021051451,0.00052525615,0.00009281504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010305474,0.00061055395,0.0006456354,0.00077382533,0.0006492058,0.0011773866,0.0023930739,0.000511693,0.00557226],"category_scores_gemma":[0.0022723253,0.00033639383,0.00038191743,0.0015415553,0.00051831285,0.0014927292,0.0007837927,0.00070246693,0.0010575312],"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.005934936,0.0007154886,0.01266912,0.0008601944,0.00030511763,0.0008138888,0.00058022374,0.15435134,0.15007868,0.031361252,0.047487617,0.594842],"study_design_scores_gemma":[0.0006212078,0.0022647174,0.0038977473,0.00005544741,0.00014316621,0.0004918189,0.00017165812,0.805997,0.13662097,0.005961852,0.043666802,0.00010760608],"about_ca_topic_score_codex":0.0069642607,"about_ca_topic_score_gemma":0.0054604816,"teacher_disagreement_score":0.0069642607,"about_ca_system_score_codex":0.0014771748,"about_ca_system_score_gemma":0.0024890928,"threshold_uncertainty_score":0.018641055},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09328525,0.002152665,0.8985167,0.0008118717,0.00014722909,0.00021561609,0.0005604525,0.0014774197,0.002832849],"genre_scores_gemma":[0.7317274,0.00088118925,0.26396137,0.00020888352,0.0001990595,0.00042231826,0.0011073136,0.000349764,0.0011426683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959197,0.0016422905,0.0002736939,0.0006435127,0.0011744938,0.00034626605],"domain_scores_gemma":[0.98557717,0.007973085,0.0024627668,0.0015488019,0.0018943625,0.00054375187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057040304,0.0014156733,0.0013552196,0.003788408,0.00081283314,0.0023572831,0.0020721871,0.0011006057,0.0009948432],"category_scores_gemma":[0.031245165,0.000465524,0.0004562818,0.004029723,0.0010626526,0.005669284,0.0015903845,0.001469391,0.0003398627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002515776,0.0003325985,0.045849938,0.0004959684,0.0002959095,0.00041897528,0.0004073675,0.6912596,0.011610981,0.11823753,0.0059475605,0.12489187],"study_design_scores_gemma":[0.0000064173146,0.000094902694,0.003283117,0.000021236143,0.000021951348,0.00011395527,0.00009271083,0.97063905,0.0019907444,0.021371212,0.002332908,0.000031702835],"about_ca_topic_score_codex":0.0022512143,"about_ca_topic_score_gemma":0.0016820407,"teacher_disagreement_score":0.0057040304,"about_ca_system_score_codex":0.0017250469,"about_ca_system_score_gemma":0.0016201902,"threshold_uncertainty_score":0.03016615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42232582,0.00073984877,0.5624688,0.0003781669,0.00006750603,0.00011703708,0.000065924396,0.010031016,0.0038058576],"genre_scores_gemma":[0.740025,0.00015637279,0.25633943,0.00027342784,0.000032186457,0.00016911686,0.00020317068,0.0015604497,0.0012408139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886227,0.00026771348,0.00006435535,0.00016533947,0.000435393,0.0002049952],"domain_scores_gemma":[0.9972474,0.0014956134,0.0002936842,0.0004973408,0.00035345234,0.00011256719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012369025,0.00096148904,0.00083608757,0.0007479852,0.00071286235,0.0009144085,0.001620208,0.000842656,0.0009957507],"category_scores_gemma":[0.005971504,0.00051145215,0.0007181567,0.0012446601,0.0012371688,0.001405733,0.0018283529,0.0013834692,0.00028664194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084574416,0.00048479866,0.014809011,0.00036421625,0.00019993035,0.00038218015,0.0009231656,0.49848002,0.11613407,0.017026735,0.0049058865,0.3454443],"study_design_scores_gemma":[0.00007623788,0.00026276082,0.0017975684,0.00001473809,0.000045388075,0.00011868161,0.00007213894,0.93588114,0.04755107,0.011274769,0.0028766047,0.000028931749],"about_ca_topic_score_codex":0.00209293,"about_ca_topic_score_gemma":0.0025765735,"teacher_disagreement_score":0.00209293,"about_ca_system_score_codex":0.0007190966,"about_ca_system_score_gemma":0.0011432339,"threshold_uncertainty_score":0.006541431},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012092068,0.000045777608,0.9766236,0.00008061513,0.000029758528,0.0000688214,0.00004874214,0.0053839018,0.005626732],"genre_scores_gemma":[0.49457744,0.00016014437,0.48824015,0.00020502036,0.000045618162,0.00023349661,0.00033411093,0.0027646848,0.013439392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988004,0.0001523972,0.00006997984,0.00025692867,0.0005693505,0.00015083748],"domain_scores_gemma":[0.9987,0.00021731302,0.000094170915,0.00065182004,0.0002338117,0.000102856204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010069578,0.0005816577,0.0005145955,0.0007019162,0.0004909421,0.0018180747,0.0021101364,0.0009219882,0.008132151],"category_scores_gemma":[0.0029692955,0.00054780295,0.0010679002,0.00039394194,0.0026078408,0.0025804574,0.004036193,0.001331885,0.003586672],"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.00015278552,0.0001287522,0.0020932555,0.00023152909,0.000056728197,0.00059972465,0.00083656306,0.05811185,0.04293035,0.77030087,0.004942522,0.119615056],"study_design_scores_gemma":[0.000088749395,0.00030135264,0.0008396307,0.00008422199,0.00010048657,0.0015722748,0.00013092627,0.49048224,0.094202235,0.28467944,0.12739925,0.0001191788],"about_ca_topic_score_codex":0.00056928734,"about_ca_topic_score_gemma":0.00044325122,"teacher_disagreement_score":0.008132151,"about_ca_system_score_codex":0.0007927291,"about_ca_system_score_gemma":0.00081021397,"threshold_uncertainty_score":0.027204812},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57392764,0.0013777026,0.40712228,0.0003489459,0.00007993921,0.00016715111,0.00042873295,0.011772855,0.0047747996],"genre_scores_gemma":[0.83334315,0.00031452614,0.16360964,0.0000990829,0.000042577853,0.00010238569,0.0005168118,0.00058958755,0.0013822202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991861,0.00014292354,0.00010017419,0.00013850047,0.00029843327,0.0001339182],"domain_scores_gemma":[0.9978217,0.00068321155,0.00047128694,0.0006486181,0.00029272502,0.00008247512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066033547,0.00079659175,0.00050457206,0.0015366334,0.00049513346,0.0010150814,0.001281167,0.00029342543,0.001002002],"category_scores_gemma":[0.0033750227,0.00042463496,0.00037798818,0.0019263201,0.00037828108,0.0020580324,0.00078587263,0.00043664375,0.00036513965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091031904,0.00038617005,0.028028043,0.00028497432,0.00008548317,0.00019599956,0.0003267889,0.030048626,0.14739501,0.0056043006,0.0032572572,0.7834771],"study_design_scores_gemma":[0.0002740099,0.00096614053,0.023182867,0.00011041646,0.00030021174,0.0012585273,0.0005051516,0.4620145,0.4577989,0.017928973,0.03542451,0.00023580955],"about_ca_topic_score_codex":0.0014001708,"about_ca_topic_score_gemma":0.0029040098,"teacher_disagreement_score":0.0015366334,"about_ca_system_score_codex":0.0005686743,"about_ca_system_score_gemma":0.0012379622,"threshold_uncertainty_score":0.0041260123},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32242084,0.0021835116,0.6191377,0.0015322895,0.00055067573,0.0004306697,0.00024361201,0.024073197,0.029427476],"genre_scores_gemma":[0.627797,0.0003935851,0.36510015,0.00026216233,0.00013247575,0.00020486627,0.0003306784,0.0014618775,0.0043171993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969838,0.0005089067,0.00019768366,0.00030805,0.001621885,0.0003795651],"domain_scores_gemma":[0.9934818,0.0018308953,0.00034949044,0.0025806052,0.0013792489,0.00037788102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029509824,0.0011273662,0.00073521154,0.0009730069,0.0011118085,0.0014767871,0.0022215883,0.00054429524,0.0031117257],"category_scores_gemma":[0.015775703,0.0006590132,0.00079829583,0.002037793,0.00096335274,0.0029260155,0.0033424702,0.0025912924,0.00082824484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014605408,0.0012306119,0.02502112,0.00086628716,0.00039333658,0.00087412127,0.0014664179,0.39245594,0.19630374,0.06270772,0.013294437,0.30392575],"study_design_scores_gemma":[0.0005065085,0.00046230684,0.008396617,0.00013538491,0.00019660513,0.00040187236,0.00020008802,0.755083,0.16778405,0.031503968,0.03517057,0.00015907698],"about_ca_topic_score_codex":0.003603377,"about_ca_topic_score_gemma":0.0068401746,"teacher_disagreement_score":0.003603377,"about_ca_system_score_codex":0.00084134657,"about_ca_system_score_gemma":0.0017734254,"threshold_uncertainty_score":0.015606463},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004040348,0.0009086651,0.097634695,0.006770414,0.0035697706,0.0002530078,0.0032725865,0.025254522,0.85829604],"genre_scores_gemma":[0.04257896,0.0010843669,0.029044226,0.0030031353,0.0008283382,0.00021513744,0.0052911183,0.005255709,0.912699],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987809,0.00013845316,0.00008003905,0.00026064456,0.0005722015,0.00016772145],"domain_scores_gemma":[0.997521,0.0002871557,0.00010627316,0.00089617254,0.000849317,0.00034010268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011057336,0.00076567347,0.00044046057,0.0015940616,0.0018681777,0.0046749194,0.0016114969,0.0017588314,0.4014461],"category_scores_gemma":[0.0054964484,0.0005378831,0.00056359527,0.0009876065,0.0009895726,0.0052661276,0.004765635,0.0021340135,0.24049908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025889874,0.0001023384,0.0014642609,0.00029755896,0.000017455668,0.00041778779,0.00073690707,0.00059434853,0.006271023,0.13787982,0.5033799,0.3485798],"study_design_scores_gemma":[0.000017409728,0.000015919426,0.0003392656,0.00006871931,0.000005435758,0.00027124118,0.000078191544,0.00092135055,0.0016085075,0.012404798,0.9842518,0.00001727151],"about_ca_topic_score_codex":0.0023778612,"about_ca_topic_score_gemma":0.002556846,"teacher_disagreement_score":0.4014461,"about_ca_system_score_codex":0.0012558822,"about_ca_system_score_gemma":0.0016268216,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81399125,0.0029506302,0.16704097,0.0003334549,0.000017691309,0.00007022076,0.00020282227,0.00060814456,0.014784834],"genre_scores_gemma":[0.9549178,0.00038500066,0.043463215,0.000042528984,0.0000043719833,0.000040106777,0.00008995962,0.000040926847,0.0010160423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998192,0.00008021904,0.000006390544,0.000016017713,0.000044232693,0.00003391661],"domain_scores_gemma":[0.9996649,0.00020948087,0.000045330165,0.000023171091,0.000044808417,0.000012350976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032586584,0.0004120737,0.0002280459,0.00047414596,0.00021092307,0.0005327853,0.0003996266,0.0002465479,0.0013702712],"category_scores_gemma":[0.00086155714,0.00016407653,0.000238541,0.00041788263,0.0001701303,0.00043781247,0.00021752181,0.00022261048,0.00015905774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020005525,0.00006493864,0.0036285005,0.00042264588,0.000046594974,0.00019697097,0.00013432419,0.8891329,0.023124715,0.008522221,0.001023758,0.07350233],"study_design_scores_gemma":[0.00002919342,0.0002589895,0.0012104792,0.00002780106,0.00002893302,0.00008713999,0.00009351244,0.98118985,0.0107833035,0.003530801,0.002748199,0.000011772338],"about_ca_topic_score_codex":0.0018107367,"about_ca_topic_score_gemma":0.004187321,"teacher_disagreement_score":0.0018107367,"about_ca_system_score_codex":0.0006401342,"about_ca_system_score_gemma":0.00072103966,"threshold_uncertainty_score":0.0046445727},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9918411,0.0001946211,0.0046904357,0.000055103952,0.000026714213,0.000022589138,0.0001215281,0.0005140789,0.0025337571],"genre_scores_gemma":[0.9950866,0.00007450955,0.003907989,0.000030325333,0.0000071935756,0.000014630289,0.00017568313,0.00004895435,0.0006541314],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993261,0.00007814783,0.000058439666,0.000103389946,0.00031464908,0.00011927526],"domain_scores_gemma":[0.9986419,0.0005697515,0.00018540905,0.0002077683,0.00032042438,0.00007476614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047818513,0.000370707,0.00025569517,0.0005906547,0.00021084848,0.00062880735,0.000501795,0.00021669916,0.0017400294],"category_scores_gemma":[0.0022614035,0.00018292443,0.00008457489,0.0008861472,0.0002498247,0.0007440467,0.00024963872,0.00028724872,0.00027623583],"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.008056718,0.0011148461,0.062605664,0.0007580137,0.00013822046,0.0014658374,0.0004776405,0.11230531,0.4922532,0.0049584713,0.0069168294,0.3089492],"study_design_scores_gemma":[0.00016389572,0.0028244322,0.042770896,0.000035949688,0.00006865547,0.0007928102,0.00043396145,0.32741123,0.6188373,0.00175775,0.0048419773,0.00006107345],"about_ca_topic_score_codex":0.001295346,"about_ca_topic_score_gemma":0.0024584292,"teacher_disagreement_score":0.0017400294,"about_ca_system_score_codex":0.0006301999,"about_ca_system_score_gemma":0.00030525986,"threshold_uncertainty_score":0.0058209896},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22688174,0.0012595964,0.7588693,0.0003919846,0.00008280483,0.00010480237,0.00041635436,0.0025033932,0.009490049],"genre_scores_gemma":[0.9568433,0.0007174681,0.036878493,0.000090242,0.000045459907,0.00011172321,0.00017899742,0.00014405126,0.0049900957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993112,0.000097016,0.000033220127,0.00008344056,0.00035330365,0.00012173861],"domain_scores_gemma":[0.99859136,0.000611408,0.00028338228,0.00016314314,0.00031180464,0.000038817136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047746502,0.00090079295,0.00085960026,0.0008455483,0.00044629685,0.0009407247,0.0020322362,0.0010436802,0.0012215013],"category_scores_gemma":[0.0035545893,0.00071749894,0.0007415285,0.0009096733,0.0005224038,0.001773298,0.00051484373,0.000900164,0.0005526662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029840974,0.00001746455,0.0005400857,0.00002084454,0.000014842608,0.000059361657,0.000030610023,0.9893239,0.0026024473,0.0022891643,0.00019642728,0.0048749954],"study_design_scores_gemma":[0.0000010193295,0.0000070649553,0.000057974885,0.0000012649637,0.000002533019,0.000007565249,0.0000025315142,0.9989784,0.000580733,0.00026900356,0.00008984011,0.000002117333],"about_ca_topic_score_codex":0.015068934,"about_ca_topic_score_gemma":0.009259134,"teacher_disagreement_score":0.015068934,"about_ca_system_score_codex":0.001414597,"about_ca_system_score_gemma":0.0016541642,"threshold_uncertainty_score":0.02996248},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5126928,0.0045898915,0.34057242,0.014170259,0.0013257937,0.00023831808,0.0005900131,0.004223695,0.12159687],"genre_scores_gemma":[0.9487426,0.00086070225,0.041502144,0.00090586813,0.0004076803,0.000095013136,0.00027865206,0.00044494553,0.00676225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915135,0.0002279952,0.000031282787,0.0002136315,0.00019853767,0.00017717987],"domain_scores_gemma":[0.99885416,0.0003974021,0.00010076736,0.00020342058,0.00024865303,0.00019562841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011428071,0.00057688827,0.0007851596,0.00081918936,0.0024919962,0.0038288424,0.001479914,0.0014037811,0.005385569],"category_scores_gemma":[0.0031111299,0.00038803762,0.00029571456,0.0012835127,0.0014751189,0.0045596315,0.002191396,0.0011189833,0.00167759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010044099,0.0005369288,0.011931659,0.00030337475,0.00022968683,0.0017054998,0.0017139949,0.45498437,0.026758777,0.12579231,0.06358628,0.31145266],"study_design_scores_gemma":[0.0001285317,0.00017774475,0.005799923,0.000055599296,0.00006442831,0.0005665922,0.0023993049,0.69746864,0.004889524,0.1846281,0.10371199,0.00010963306],"about_ca_topic_score_codex":0.0024276783,"about_ca_topic_score_gemma":0.0036290972,"teacher_disagreement_score":0.005385569,"about_ca_system_score_codex":0.0011445845,"about_ca_system_score_gemma":0.0006911363,"threshold_uncertainty_score":0.018016577},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40438774,0.0071932725,0.50867796,0.00048050843,0.0005049208,0.00061874895,0.0007051928,0.06261273,0.014818866],"genre_scores_gemma":[0.84667593,0.00048753686,0.14676748,0.0003512169,0.000087599314,0.00020025349,0.00079462695,0.000813852,0.0038213837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990114,0.00015393921,0.000081949765,0.00019340037,0.00037181293,0.00018747634],"domain_scores_gemma":[0.99890554,0.00023095834,0.00018690327,0.00037291585,0.0001784529,0.00012518307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076337956,0.0010957135,0.0005684843,0.00078000803,0.00058840576,0.00078265974,0.0029077206,0.00040349233,0.0020272087],"category_scores_gemma":[0.0017535491,0.00050719496,0.0003845464,0.00067268225,0.000493087,0.0013042171,0.0017309018,0.00090071827,0.00061157136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002733293,0.0010480935,0.011508707,0.0013675545,0.0003756538,0.00070717104,0.0004752782,0.11731045,0.3184468,0.008039933,0.03338663,0.50460047],"study_design_scores_gemma":[0.00041226164,0.0015660414,0.005997802,0.00006718014,0.00027324268,0.00050365005,0.00013451958,0.5685667,0.38360667,0.0038146246,0.03492433,0.00013296201],"about_ca_topic_score_codex":0.0014884482,"about_ca_topic_score_gemma":0.0022690808,"teacher_disagreement_score":0.0029077206,"about_ca_system_score_codex":0.0006662837,"about_ca_system_score_gemma":0.0014557414,"threshold_uncertainty_score":0.0067816973},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052082012,0.00026552347,0.97923535,0.00014134376,0.00008363629,0.00010824993,0.000117272444,0.011584795,0.0032555324],"genre_scores_gemma":[0.07056199,0.00032382205,0.92017823,0.0001839406,0.00007609231,0.00030147086,0.0006642192,0.0048859427,0.0028243172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903667,0.00015072174,0.00009801189,0.00015307001,0.0004340374,0.00012754992],"domain_scores_gemma":[0.9992873,0.00011814241,0.000052700478,0.0002650054,0.00023849792,0.00003849036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086893386,0.0009255392,0.0008575771,0.00081882725,0.00066748366,0.0011962177,0.0018966321,0.00074868795,0.0025511163],"category_scores_gemma":[0.0019935113,0.000653681,0.0010492142,0.00085753255,0.00057534117,0.0012744003,0.0015434267,0.0019889798,0.0014840164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029793277,0.0002762711,0.0027546326,0.0004290778,0.0002148036,0.0004186125,0.00058965344,0.2681156,0.052027024,0.13569382,0.028544934,0.5106376],"study_design_scores_gemma":[0.00008481014,0.00013619529,0.0006461957,0.00007109092,0.00008606622,0.00032008113,0.00006924934,0.8346059,0.04266021,0.029345123,0.09189093,0.00008426096],"about_ca_topic_score_codex":0.0013694298,"about_ca_topic_score_gemma":0.0018644674,"teacher_disagreement_score":0.0025511163,"about_ca_system_score_codex":0.0006996925,"about_ca_system_score_gemma":0.001789942,"threshold_uncertainty_score":0.008534312},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42688245,0.052165024,0.41590825,0.0015339265,0.0007279097,0.00014812547,0.0003969697,0.0040875594,0.0981498],"genre_scores_gemma":[0.70988125,0.021951178,0.24917118,0.0002992186,0.00013835028,0.00006316698,0.0005485086,0.00051803316,0.017429087],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985397,0.000046432022,0.0000065877853,0.000013650769,0.00005554007,0.000023858116],"domain_scores_gemma":[0.99976903,0.00010334013,0.000010423464,0.000024217952,0.000083366685,0.000009736626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025735414,0.00050400366,0.00026396566,0.0004716442,0.00021909688,0.00065128715,0.0005263622,0.0003260293,0.0035044542],"category_scores_gemma":[0.000763607,0.00017882478,0.0002716859,0.0011347169,0.00019126364,0.00053287094,0.00043747327,0.0005519073,0.00070622284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006859665,0.00015060834,0.0029028123,0.0008691362,0.0002005473,0.0003823308,0.00021716492,0.13857956,0.12807636,0.029053915,0.020145891,0.67873573],"study_design_scores_gemma":[0.00007184975,0.0005526926,0.0021695471,0.00028455877,0.00016612782,0.00037205336,0.00010200364,0.7062286,0.16504742,0.009073076,0.115893476,0.000038613816],"about_ca_topic_score_codex":0.0012664625,"about_ca_topic_score_gemma":0.0017914046,"teacher_disagreement_score":0.0035044542,"about_ca_system_score_codex":0.00027770564,"about_ca_system_score_gemma":0.00020566887,"threshold_uncertainty_score":0.011723578},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2762994,0.000069989655,0.716456,0.00012635208,0.000029170631,0.00012872698,0.000118957214,0.004936081,0.0018353158],"genre_scores_gemma":[0.8233236,0.00008084861,0.17548822,0.000032285378,0.000013253987,0.00009436875,0.00018289586,0.0002530972,0.0005313885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959552,0.0014594335,0.00022938543,0.000543865,0.0014836623,0.00032856065],"domain_scores_gemma":[0.9833905,0.012842872,0.0011424092,0.0015223924,0.00093267317,0.00016915987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002580153,0.0007784824,0.000504036,0.0011407412,0.00053356006,0.00093249866,0.001251607,0.0005801365,0.0009346732],"category_scores_gemma":[0.015099141,0.0006483461,0.00092833844,0.0007694433,0.0015688706,0.0019465319,0.0008759901,0.0005895461,0.00012769792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010184754,0.00065314776,0.030971522,0.00060429744,0.00022301996,0.0013793724,0.0012025009,0.49436963,0.10627646,0.07819776,0.0016444987,0.28345934],"study_design_scores_gemma":[0.00014740656,0.0005989321,0.0015453888,0.00003242567,0.000085726446,0.00024949637,0.00010092107,0.8835278,0.083131365,0.028505607,0.0020298657,0.000045085828],"about_ca_topic_score_codex":0.00512342,"about_ca_topic_score_gemma":0.003410684,"teacher_disagreement_score":0.00512342,"about_ca_system_score_codex":0.0006867501,"about_ca_system_score_gemma":0.0015103732,"threshold_uncertainty_score":0.013645291},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077095157,0.00020437273,0.92301553,0.000106061154,0.000072059534,0.00014052335,0.0005793137,0.061677434,0.006495206],"genre_scores_gemma":[0.09467957,0.000352485,0.8824304,0.00035398777,0.00006892813,0.0006515844,0.0027495916,0.010667163,0.008046381],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993837,0.00014783007,0.00005203457,0.00010945808,0.0002114043,0.00009563542],"domain_scores_gemma":[0.9990138,0.00029559762,0.00008338876,0.0002560562,0.0002753844,0.0000758167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009055604,0.0008282721,0.00062975136,0.0006198454,0.00057129445,0.0014165823,0.002764957,0.00093698653,0.006661736],"category_scores_gemma":[0.0026401056,0.0006671196,0.0007310023,0.0008831368,0.000796122,0.0012368578,0.0014448403,0.0019790921,0.0035576303],"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.0010433983,0.0003267907,0.0044604638,0.0010634991,0.00019573732,0.0008503592,0.0010656052,0.10228508,0.047072522,0.08340506,0.21062477,0.54760677],"study_design_scores_gemma":[0.0003077438,0.00025337332,0.001942665,0.00011382406,0.000057109366,0.0005671963,0.00008547399,0.68347585,0.079050295,0.029390937,0.20462611,0.00012943498],"about_ca_topic_score_codex":0.002544265,"about_ca_topic_score_gemma":0.0023915102,"teacher_disagreement_score":0.006661736,"about_ca_system_score_codex":0.00045667752,"about_ca_system_score_gemma":0.0012987049,"threshold_uncertainty_score":0.02228576},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9793088,0.001793096,0.00824644,0.000102400125,0.000111914705,0.000024352288,0.00016013485,0.00020653578,0.010046412],"genre_scores_gemma":[0.9916032,0.00066383294,0.0053031025,0.00004570167,0.000015903139,0.000009888129,0.0001393464,0.00004214373,0.0021767851],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975365,0.000034448363,0.000015446853,0.00003843572,0.000100273064,0.00005767948],"domain_scores_gemma":[0.9988403,0.0006141358,0.00016160845,0.00013474321,0.00021538905,0.000033948643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023254065,0.00022497961,0.00015436912,0.00039675253,0.00010966669,0.0003958823,0.00033185584,0.00020031653,0.003548236],"category_scores_gemma":[0.0015382144,0.00009064235,0.0001399927,0.0005251126,0.000116510004,0.000590633,0.00018727493,0.0002001596,0.0002739065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041544945,0.00028301496,0.036670268,0.0013310334,0.0003417656,0.0011932205,0.00017041645,0.10833613,0.4660434,0.00852121,0.0033387328,0.36961624],"study_design_scores_gemma":[0.00032448745,0.010243579,0.121774,0.00019057396,0.0005513646,0.0030261758,0.0005800403,0.117142424,0.7066931,0.003311859,0.03606837,0.000093971896],"about_ca_topic_score_codex":0.0009392085,"about_ca_topic_score_gemma":0.0029415805,"teacher_disagreement_score":0.003548236,"about_ca_system_score_codex":0.00036885645,"about_ca_system_score_gemma":0.00017829698,"threshold_uncertainty_score":0.011870027},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048312806,0.0017293083,0.93670267,0.00040223516,0.00018145276,0.00009200921,0.00019474469,0.0033478497,0.009036937],"genre_scores_gemma":[0.61268884,0.0005022559,0.37432232,0.00023757608,0.00011042509,0.00017850532,0.00023692627,0.00057030196,0.011152801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995845,0.00012664545,0.00002389296,0.00006691132,0.000100100566,0.00009787596],"domain_scores_gemma":[0.99939156,0.00030280024,0.00004644172,0.000118295335,0.00011362386,0.000027192777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005553082,0.0007758939,0.00073706324,0.0010269582,0.0005557913,0.0012197637,0.0018424393,0.0005533997,0.00964036],"category_scores_gemma":[0.0029863038,0.00036984708,0.0003747615,0.0013851165,0.00032225548,0.001812073,0.0006882758,0.0006463376,0.00081677735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001123612,0.0002610108,0.00072925317,0.00020361533,0.000094565024,0.00011849082,0.000113609596,0.44049278,0.04452123,0.080581225,0.013751112,0.41800952],"study_design_scores_gemma":[0.000056867313,0.00009766356,0.00012199298,0.000011153777,0.00004061733,0.000031924963,0.000015967984,0.9721985,0.012333969,0.012394753,0.002681612,0.000015091263],"about_ca_topic_score_codex":0.0029418685,"about_ca_topic_score_gemma":0.006422221,"teacher_disagreement_score":0.00964036,"about_ca_system_score_codex":0.0008361883,"about_ca_system_score_gemma":0.0019446893,"threshold_uncertainty_score":0.032250226},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38592833,0.0012693683,0.5973958,0.00016666582,0.0001771609,0.000086320004,0.00009293307,0.004972741,0.0099107],"genre_scores_gemma":[0.91107005,0.00031752643,0.0856503,0.00008847689,0.000047883303,0.000033534645,0.0000805463,0.00017331644,0.0025384023],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99980754,0.000022749713,0.000013171598,0.000041695745,0.00006097018,0.000053737072],"domain_scores_gemma":[0.99941015,0.00014203625,0.00014078773,0.00018526628,0.00009107849,0.000030660307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028995262,0.00043110948,0.00022409478,0.00040179826,0.0003079406,0.00035695446,0.0007649164,0.00022506241,0.002695452],"category_scores_gemma":[0.00086842687,0.00019725648,0.00019957722,0.00041109536,0.00031020684,0.0010149311,0.00047147495,0.00035015057,0.0005344488],"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.00079625554,0.000197527,0.0031486063,0.00024222459,0.00003609736,0.00033526664,0.00031680198,0.034503434,0.5549748,0.016697852,0.0028546066,0.38589656],"study_design_scores_gemma":[0.00013927293,0.0013609127,0.0021569505,0.000055033343,0.00012505676,0.0008362292,0.0001082177,0.28644988,0.68060964,0.0076961666,0.020404994,0.000057670324],"about_ca_topic_score_codex":0.0005770736,"about_ca_topic_score_gemma":0.0011041521,"teacher_disagreement_score":0.002695452,"about_ca_system_score_codex":0.00039898785,"about_ca_system_score_gemma":0.0006087472,"threshold_uncertainty_score":0.0090171695},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019635964,0.00033020254,0.96120656,0.00016340976,0.00011695889,0.000102581536,0.00015040308,0.0141254915,0.0041683237],"genre_scores_gemma":[0.4514825,0.00034013952,0.53977966,0.00016125603,0.000039103234,0.00034898517,0.0004680629,0.002132067,0.005248164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907804,0.00038513457,0.00005017598,0.00009292725,0.0003216389,0.00007203249],"domain_scores_gemma":[0.99865425,0.00055781734,0.00008207171,0.00039746694,0.00024143852,0.00006700402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015461126,0.0011477241,0.0005150052,0.0005421268,0.00040478254,0.0007440166,0.0013815647,0.00060397206,0.008041205],"category_scores_gemma":[0.00252495,0.00056268874,0.00046832382,0.00031576215,0.0005675255,0.0010235367,0.000793128,0.0012559922,0.0010124573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007861199,0.0003272747,0.004070796,0.0006545179,0.00022700506,0.00043484895,0.00039939006,0.65172976,0.05286381,0.041093882,0.016655277,0.23075739],"study_design_scores_gemma":[0.000099457146,0.00014290804,0.00025576795,0.000038383587,0.000020497286,0.00009269453,0.00001816988,0.95109093,0.029725775,0.0055174464,0.0129742315,0.000023621657],"about_ca_topic_score_codex":0.0016131081,"about_ca_topic_score_gemma":0.0020250413,"teacher_disagreement_score":0.008041205,"about_ca_system_score_codex":0.0005860075,"about_ca_system_score_gemma":0.0010755033,"threshold_uncertainty_score":0.02690053},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9256122,0.0005161101,0.059347913,0.00014893264,0.000051100094,0.000074663825,0.00008721215,0.0015632714,0.012598537],"genre_scores_gemma":[0.97903275,0.00007353862,0.018601166,0.00004848042,0.000018835843,0.000028805445,0.00007606222,0.00011476546,0.0020056504],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936324,0.00007585292,0.00003879031,0.00015400679,0.00026765032,0.00010040842],"domain_scores_gemma":[0.99755496,0.0006157681,0.00022615025,0.0008989302,0.00041753356,0.0002866331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075024564,0.00030181848,0.00035175198,0.0003114408,0.0003177162,0.0013943731,0.001327904,0.00045745107,0.0025604104],"category_scores_gemma":[0.0022277748,0.00022079005,0.00021495148,0.00033842484,0.00062488974,0.0019101141,0.0010794213,0.0007735821,0.00058775157],"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.00592156,0.0021478068,0.049484182,0.0007862943,0.00059758016,0.0009093198,0.0011765363,0.1296989,0.29497337,0.13528113,0.008321616,0.37070173],"study_design_scores_gemma":[0.0004953913,0.0032167197,0.05306082,0.000066878456,0.00038677966,0.001286183,0.00075922516,0.79194313,0.086817905,0.04824308,0.013589873,0.00013406079],"about_ca_topic_score_codex":0.00042785404,"about_ca_topic_score_gemma":0.00054369506,"teacher_disagreement_score":0.0025604104,"about_ca_system_score_codex":0.00025965858,"about_ca_system_score_gemma":0.00030310688,"threshold_uncertainty_score":0.008565426},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83278424,0.0013343543,0.16044053,0.00024803987,0.00008444807,0.000048797712,0.0000636872,0.0019611325,0.003034728],"genre_scores_gemma":[0.96998674,0.00031617525,0.028081201,0.00014678716,0.000022682358,0.000022644921,0.000072861854,0.00009948279,0.0012514493],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998248,0.000015669313,0.000014800193,0.000027723963,0.00006930776,0.000047780708],"domain_scores_gemma":[0.9995921,0.00012471019,0.00012822608,0.000055930923,0.00006552552,0.000033448305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012819337,0.00033513663,0.00026576844,0.0003406738,0.00020710834,0.00047938313,0.00064381445,0.00023754581,0.0012235122],"category_scores_gemma":[0.0006167326,0.00021256445,0.00022256802,0.00036239292,0.0002217944,0.00065481645,0.00034985426,0.0003996291,0.00022610406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053174916,0.0004941829,0.005216502,0.0001993023,0.00004959291,0.00038899962,0.0002567154,0.05566327,0.7556034,0.0041730823,0.0016893571,0.17573388],"study_design_scores_gemma":[0.00009351635,0.002052344,0.008124791,0.00003461336,0.00018939182,0.0005021542,0.00011597038,0.51497,0.46258906,0.004601419,0.0066811237,0.00004567404],"about_ca_topic_score_codex":0.0010361312,"about_ca_topic_score_gemma":0.0018179034,"teacher_disagreement_score":0.0012235122,"about_ca_system_score_codex":0.00033078823,"about_ca_system_score_gemma":0.00073897373,"threshold_uncertainty_score":0.004093051},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16307572,0.0014234028,0.8276994,0.0004927955,0.0002360285,0.00016211314,0.00011870431,0.0030722728,0.0037195585],"genre_scores_gemma":[0.8244386,0.00027825247,0.1711775,0.00025122057,0.00013982049,0.00010666014,0.00011987273,0.00009483004,0.0033932312],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996358,0.000047315683,0.00003274228,0.00007751565,0.00015450962,0.000051992236],"domain_scores_gemma":[0.9994068,0.0001234658,0.00008752474,0.0001732914,0.0001467414,0.00006213179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045199625,0.0004528869,0.0005030859,0.0004693432,0.00044836625,0.00094338995,0.0021161987,0.00058255764,0.0017332531],"category_scores_gemma":[0.00093245826,0.0002587721,0.00020903669,0.00045893434,0.00032738262,0.0012265204,0.000840241,0.00096698874,0.00035627725],"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.0023645398,0.0006179464,0.0037890628,0.00039060143,0.00017671111,0.0009051747,0.00027796713,0.1457662,0.3662702,0.023433639,0.007963248,0.4480447],"study_design_scores_gemma":[0.00017720035,0.00046082263,0.00044005862,0.000015775764,0.000054767246,0.00043830954,0.00005018464,0.90906125,0.07714486,0.00450629,0.007614525,0.000036007987],"about_ca_topic_score_codex":0.0010728096,"about_ca_topic_score_gemma":0.0022687302,"teacher_disagreement_score":0.0021161987,"about_ca_system_score_codex":0.00041805478,"about_ca_system_score_gemma":0.0006453724,"threshold_uncertainty_score":0.0057982802},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015842665,0.00022225663,0.97202,0.00038020127,0.00007717976,0.00016202345,0.0001544606,0.0045772744,0.006563944],"genre_scores_gemma":[0.12579194,0.00042376356,0.8616016,0.00035820855,0.00003904494,0.00061557733,0.0005607221,0.0012782488,0.009330902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999106,0.00021367782,0.00010855455,0.000121730096,0.0003597678,0.000090212205],"domain_scores_gemma":[0.9992506,0.00022074443,0.00008125483,0.0002597522,0.00014052489,0.000047054997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000885672,0.00069226685,0.00031401648,0.00040907794,0.00043207835,0.0014151933,0.0012108184,0.00059489085,0.0036045946],"category_scores_gemma":[0.001983402,0.0004436993,0.0007490884,0.00054049434,0.0008316926,0.0016748513,0.0010552488,0.001540457,0.0009280063],"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.00037200857,0.00019467704,0.002928102,0.00088587846,0.00009924032,0.0008009208,0.0010337499,0.16068338,0.045628723,0.5012038,0.023424158,0.26274544],"study_design_scores_gemma":[0.00013474535,0.00023608861,0.00089239905,0.00013714413,0.000047141053,0.0009899931,0.00020773608,0.54821396,0.033475187,0.24019708,0.1754044,0.000064081934],"about_ca_topic_score_codex":0.0014438845,"about_ca_topic_score_gemma":0.0024235328,"teacher_disagreement_score":0.0036045946,"about_ca_system_score_codex":0.00091071404,"about_ca_system_score_gemma":0.0011652141,"threshold_uncertainty_score":0.012058556},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50438076,0.00044243986,0.44732848,0.00022840452,0.000112712514,0.0001863803,0.0001133539,0.044710528,0.002496894],"genre_scores_gemma":[0.7162097,0.00009212217,0.28001937,0.00012166926,0.00003069605,0.00009867201,0.00016474712,0.0014340571,0.001828879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895513,0.0003054156,0.000089648616,0.00023492295,0.00030611837,0.00010867986],"domain_scores_gemma":[0.99583036,0.0013361342,0.00034329464,0.0019391127,0.00035624998,0.00019486775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013274103,0.00061828364,0.00046746767,0.0005671078,0.0003810165,0.00078526104,0.0019573644,0.0005506804,0.0011876419],"category_scores_gemma":[0.0054380316,0.00067767716,0.00028185718,0.00046458293,0.0005566916,0.00175684,0.0008321243,0.00088560744,0.00040868018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018293586,0.00084184523,0.018090747,0.00028098287,0.000106772415,0.00047438094,0.0010379185,0.10188184,0.31828013,0.0073801833,0.0049369447,0.5448589],"study_design_scores_gemma":[0.00021265929,0.0005585552,0.0043115783,0.00002547621,0.000055934535,0.00026185246,0.00006592793,0.80212915,0.17918503,0.0043700365,0.008748308,0.00007553435],"about_ca_topic_score_codex":0.001337459,"about_ca_topic_score_gemma":0.001772709,"teacher_disagreement_score":0.0019573644,"about_ca_system_score_codex":0.00041962427,"about_ca_system_score_gemma":0.0009638669,"threshold_uncertainty_score":0.007020116},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88297445,0.00034269164,0.09731723,0.00026474215,0.000049593422,0.00013744443,0.0004064766,0.003150614,0.015356734],"genre_scores_gemma":[0.9172003,0.000105012194,0.079716295,0.000059547696,0.000009121238,0.000085524414,0.0006330688,0.00022810948,0.0019629558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996917,0.00009425741,0.000008612732,0.000048828708,0.000093984454,0.00006264088],"domain_scores_gemma":[0.99960846,0.00017527935,0.000025418845,0.000086539905,0.000070556816,0.000033841585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005882305,0.00067830586,0.00030678455,0.00032688797,0.00039018763,0.00047238453,0.0010020188,0.0004321445,0.0017210984],"category_scores_gemma":[0.0010537033,0.00021836862,0.00041242898,0.00053535786,0.00040058643,0.0008540664,0.0005644517,0.0005998493,0.0001669682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059171364,0.00033328935,0.0060944376,0.00022783416,0.00008645572,0.0006100116,0.00019121866,0.87646544,0.035763107,0.013066091,0.005518593,0.061051738],"study_design_scores_gemma":[0.00006083282,0.00021628015,0.0014951229,0.0000072209386,0.000016437876,0.000043666318,0.000053768246,0.98371774,0.009591047,0.002629115,0.0021592781,0.000009585349],"about_ca_topic_score_codex":0.0052686688,"about_ca_topic_score_gemma":0.007512177,"teacher_disagreement_score":0.0052686688,"about_ca_system_score_codex":0.00051478506,"about_ca_system_score_gemma":0.00088935555,"threshold_uncertainty_score":0.010475993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049925443,0.0009058854,0.92713284,0.0008056032,0.00020796624,0.00011682393,0.00039171736,0.0043660263,0.016147736],"genre_scores_gemma":[0.7227874,0.00091133954,0.25998634,0.0004931202,0.00014587857,0.0002193613,0.00089276786,0.0009347435,0.01362917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984687,0.00019045649,0.00009043875,0.00022805986,0.00082628813,0.00019605616],"domain_scores_gemma":[0.9974469,0.00084968697,0.00024186268,0.0009374654,0.00047099803,0.00005308971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007072837,0.0011808674,0.0009501776,0.0008161398,0.0007933793,0.002279428,0.0024926104,0.0010539764,0.0072956705],"category_scores_gemma":[0.0069586374,0.0005526243,0.00063204323,0.0014637385,0.0010386034,0.0039089057,0.001594193,0.0014605729,0.0020307174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010246802,0.00032040366,0.007101805,0.00049074774,0.00012218574,0.00053522515,0.00045485026,0.5198459,0.042105466,0.11458796,0.017687619,0.29572317],"study_design_scores_gemma":[0.00002663894,0.00009605309,0.00042199224,0.000028329003,0.000025118601,0.00018169082,0.00006566081,0.9190301,0.019574089,0.047481366,0.013044621,0.000024289846],"about_ca_topic_score_codex":0.0030800735,"about_ca_topic_score_gemma":0.0036047008,"teacher_disagreement_score":0.0072956705,"about_ca_system_score_codex":0.0013176812,"about_ca_system_score_gemma":0.0014713941,"threshold_uncertainty_score":0.024406433},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035986674,0.00028350853,0.8609111,0.00018608572,0.00016682032,0.000115982315,0.00094895804,0.1251943,0.008594614],"genre_scores_gemma":[0.0579898,0.0004566345,0.87043,0.0004206696,0.00006664651,0.00044279723,0.0035873468,0.051778577,0.014827551],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894494,0.00016372158,0.00012536386,0.0001868137,0.00042803944,0.0001512037],"domain_scores_gemma":[0.99853456,0.00048257312,0.00011619735,0.00039282482,0.0003680937,0.00010586065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013382547,0.0012737287,0.0007996034,0.0007944548,0.000822006,0.002347811,0.00303656,0.00095284334,0.017106382],"category_scores_gemma":[0.004146228,0.0015853348,0.0016982363,0.0007508097,0.0012510278,0.0032103139,0.003130434,0.0034219432,0.008203829],"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.0010624103,0.00023373931,0.003588531,0.00211722,0.00030553955,0.00077653583,0.001356564,0.07182829,0.057301376,0.20330746,0.25408566,0.4040366],"study_design_scores_gemma":[0.00036607496,0.00021455261,0.0008451735,0.00034536293,0.00013262726,0.0008648689,0.00020829709,0.30283612,0.100242876,0.06870455,0.5249627,0.00027675895],"about_ca_topic_score_codex":0.0031221802,"about_ca_topic_score_gemma":0.0050414708,"teacher_disagreement_score":0.017106382,"about_ca_system_score_codex":0.0009229986,"about_ca_system_score_gemma":0.0028405385,"threshold_uncertainty_score":0.05722654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15655075,0.00054720027,0.8212794,0.0005460823,0.00035818195,0.00016826294,0.00023359616,0.00639987,0.013916623],"genre_scores_gemma":[0.42200914,0.00041022993,0.57358295,0.0001353116,0.000046141846,0.00024627591,0.0004444264,0.0004969466,0.002628562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978966,0.00005172672,0.000010406755,0.000018965315,0.00010119248,0.000028065162],"domain_scores_gemma":[0.99969304,0.00009292497,0.00002523592,0.00006557196,0.000097038,0.000026212241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029039997,0.0006422434,0.0003337398,0.0003583073,0.00044202464,0.0006488916,0.0007794151,0.00052466814,0.0017349751],"category_scores_gemma":[0.0012309022,0.00024311463,0.00035663645,0.0007570717,0.0003603457,0.0005438539,0.0006768997,0.0009471916,0.0005564624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020931351,0.00015577541,0.004668808,0.00016832966,0.000088501125,0.0004377058,0.00025830528,0.7491529,0.09506254,0.03207084,0.009667548,0.10805948],"study_design_scores_gemma":[0.000044840468,0.000047756286,0.0004374528,0.000009074265,0.00001029438,0.000041938772,0.000012306294,0.97260296,0.016134698,0.0036230576,0.007024733,0.000010834673],"about_ca_topic_score_codex":0.003425786,"about_ca_topic_score_gemma":0.0025897042,"teacher_disagreement_score":0.003425786,"about_ca_system_score_codex":0.00034227435,"about_ca_system_score_gemma":0.0007195957,"threshold_uncertainty_score":0.0068116784},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025638418,0.0007591123,0.92422134,0.00047888074,0.0004232012,0.00036712264,0.00020760299,0.03064527,0.017259061],"genre_scores_gemma":[0.3816344,0.0006723621,0.5838908,0.0012037205,0.00039491276,0.00047569338,0.00069447927,0.007707056,0.023326574],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986418,0.0002452076,0.00010341713,0.00023206162,0.0005179341,0.00025948035],"domain_scores_gemma":[0.9985788,0.00017623883,0.00010561686,0.0008597075,0.00019036853,0.00008939283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001164698,0.0008445727,0.000806741,0.0009357544,0.00065770413,0.0015538284,0.003707938,0.00075303775,0.0068176207],"category_scores_gemma":[0.0026574868,0.0006352717,0.0011628346,0.0005819466,0.0012287339,0.002535572,0.0039878455,0.0020608038,0.0028164003],"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.0008052758,0.0005322888,0.0042180237,0.00065237825,0.0001967571,0.00078609516,0.0012501972,0.04505188,0.0986795,0.19777694,0.03630414,0.61374646],"study_design_scores_gemma":[0.00027238284,0.0006281305,0.002537395,0.00028724893,0.0002600315,0.0011295243,0.0001942732,0.37181628,0.12519519,0.19356656,0.30381188,0.00030110122],"about_ca_topic_score_codex":0.0012780349,"about_ca_topic_score_gemma":0.0021563782,"teacher_disagreement_score":0.0068176207,"about_ca_system_score_codex":0.00086120673,"about_ca_system_score_gemma":0.001348031,"threshold_uncertainty_score":0.02280718},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87781644,0.0017311359,0.112145156,0.0002683017,0.000049018196,0.000032676144,0.00009358244,0.0019511073,0.005912543],"genre_scores_gemma":[0.9778281,0.00024743538,0.020741208,0.000037557238,0.000013346605,0.0000150264395,0.000051815594,0.000050454124,0.0010150406],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998692,0.000012982125,0.0000065295285,0.000021589109,0.000047726357,0.000042001597],"domain_scores_gemma":[0.9997197,0.00009913155,0.00006414131,0.00004106661,0.000062223946,0.0000137386005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000896967,0.00035353095,0.00021558303,0.00030958818,0.00020230509,0.00028397402,0.00083268585,0.00019598017,0.0011097203],"category_scores_gemma":[0.00051739573,0.000117180745,0.00018274694,0.00052239606,0.00019750377,0.0009121447,0.00020848752,0.00024135955,0.00016986058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075305917,0.00024276496,0.0095942095,0.00034345064,0.00009222028,0.0004830113,0.00019390475,0.16714987,0.5280325,0.0072296923,0.0033075674,0.28257778],"study_design_scores_gemma":[0.00014451433,0.0015178475,0.007282389,0.00003160524,0.00016022233,0.00056371593,0.000072267816,0.5494256,0.42786562,0.003698138,0.009196291,0.000041844112],"about_ca_topic_score_codex":0.0011198833,"about_ca_topic_score_gemma":0.003044267,"teacher_disagreement_score":0.0011198833,"about_ca_system_score_codex":0.00028390312,"about_ca_system_score_gemma":0.00044234958,"threshold_uncertainty_score":0.003712356},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29980603,0.00024029658,0.68155956,0.00050550536,0.00018871693,0.00023086187,0.0007528237,0.0029797668,0.013736387],"genre_scores_gemma":[0.6960903,0.00016632648,0.294589,0.00013771286,0.000047178484,0.00022682243,0.0017794084,0.0006609001,0.006302303],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994629,0.00009101409,0.00003465969,0.00008789561,0.00023121397,0.00009228404],"domain_scores_gemma":[0.9979354,0.00080161804,0.00013458455,0.0007752968,0.0002707554,0.00008238201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045833996,0.00037593802,0.00059825776,0.000732583,0.00061141286,0.0010137956,0.0010020995,0.0006772236,0.004471474],"category_scores_gemma":[0.003548167,0.00042408422,0.00059949065,0.0016837287,0.000982007,0.0013571449,0.002297681,0.0010275685,0.0007884319],"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.0010929472,0.00031877574,0.004172611,0.0006895565,0.00009326491,0.00080127607,0.0010792379,0.22380856,0.07694173,0.3071158,0.021199351,0.36268684],"study_design_scores_gemma":[0.00021982622,0.0003358118,0.0008609951,0.00005869945,0.00006911856,0.0003578747,0.0003794804,0.63212645,0.06724062,0.27887863,0.019437551,0.000034969507],"about_ca_topic_score_codex":0.00036173142,"about_ca_topic_score_gemma":0.0008407027,"teacher_disagreement_score":0.004471474,"about_ca_system_score_codex":0.00050749915,"about_ca_system_score_gemma":0.0005406646,"threshold_uncertainty_score":0.01495862},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18185721,0.0045851786,0.79052186,0.0005481926,0.00025129723,0.00006391481,0.00038823398,0.0053845854,0.016399475],"genre_scores_gemma":[0.74608755,0.001441259,0.23763345,0.00025798468,0.00012220106,0.000047250935,0.0006195986,0.00017993031,0.013610768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997354,0.000037302052,0.000016167764,0.00003904735,0.00013556378,0.000036516154],"domain_scores_gemma":[0.9996165,0.00012852892,0.00005708682,0.00006054358,0.00010985676,0.00002746107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022788961,0.0004513517,0.000309154,0.00045529855,0.00015974352,0.00060235616,0.0009030238,0.00027949963,0.005337],"category_scores_gemma":[0.0011179232,0.00024669766,0.00017808698,0.0006482867,0.0001892197,0.00083206437,0.00051587704,0.0008088482,0.0011209906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067546184,0.00012998664,0.004451139,0.00034887862,0.000066085384,0.00018628465,0.00007273872,0.17352009,0.06429304,0.020318896,0.009450617,0.72648686],"study_design_scores_gemma":[0.00007158202,0.00045000733,0.0017180194,0.00006509921,0.000036949135,0.0002069543,0.000027513839,0.9160224,0.05076709,0.011334869,0.019269722,0.00002982779],"about_ca_topic_score_codex":0.00088936795,"about_ca_topic_score_gemma":0.0031426733,"teacher_disagreement_score":0.005337,"about_ca_system_score_codex":0.00035103076,"about_ca_system_score_gemma":0.00070355326,"threshold_uncertainty_score":0.017854035},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20624703,0.0012388034,0.75505805,0.00048205294,0.0002910512,0.0006279755,0.0003243273,0.021030575,0.014700089],"genre_scores_gemma":[0.6884097,0.0002772225,0.30252796,0.00013502668,0.00006458639,0.00026080024,0.00038440205,0.00027118778,0.0076691327],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994487,0.00012506328,0.0000715823,0.00006463173,0.00019307251,0.00009679304],"domain_scores_gemma":[0.9992424,0.00013930922,0.000059583323,0.0002383951,0.00024263219,0.00007771804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007268961,0.00032392098,0.0003942987,0.000630275,0.00086121453,0.0009905678,0.0014432487,0.00054502697,0.0039038737],"category_scores_gemma":[0.0011681964,0.0003351408,0.00020405794,0.0006095202,0.00041429757,0.0011839613,0.00067883066,0.0005346534,0.0007542716],"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.003284698,0.0008506587,0.010417696,0.0012752728,0.00028114096,0.001807936,0.0013467618,0.055695254,0.31819776,0.10435603,0.032816183,0.4696707],"study_design_scores_gemma":[0.0012077774,0.0032113923,0.0037568621,0.00016850837,0.00034895772,0.0017139992,0.00028321915,0.5572292,0.31243724,0.0074105975,0.11194506,0.00028715076],"about_ca_topic_score_codex":0.0028079706,"about_ca_topic_score_gemma":0.004197777,"teacher_disagreement_score":0.0039038737,"about_ca_system_score_codex":0.0008668883,"about_ca_system_score_gemma":0.0011154365,"threshold_uncertainty_score":0.013059735},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007966447,0.00014286593,0.98132205,0.00006821003,0.000027573646,0.000058752063,0.00005928768,0.00757091,0.0027838226],"genre_scores_gemma":[0.1480389,0.0002243164,0.84598315,0.0001138325,0.000052058396,0.00020536312,0.0004291201,0.0011891277,0.0037641076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992944,0.00011897893,0.000055312616,0.00012636442,0.00030911743,0.000095825715],"domain_scores_gemma":[0.9994822,0.000096882635,0.000044177777,0.00017927751,0.00015273818,0.00004474754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009545416,0.0008342115,0.00058262533,0.0009311421,0.00045750037,0.0013107904,0.0020249083,0.0003716587,0.003911842],"category_scores_gemma":[0.0011115125,0.00048525896,0.0006218677,0.00089958654,0.00086533726,0.0016424279,0.0014277276,0.00095103757,0.0009861328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008018861,0.00026772998,0.0022426592,0.00032788262,0.000114084476,0.00031994915,0.00046019384,0.15742034,0.078464456,0.18065365,0.014231499,0.56469566],"study_design_scores_gemma":[0.00015398709,0.0003020236,0.00040620292,0.000040547584,0.00004435361,0.00022671424,0.00008129281,0.80035555,0.09402801,0.03984624,0.06443826,0.000076826786],"about_ca_topic_score_codex":0.0012829229,"about_ca_topic_score_gemma":0.0016444864,"teacher_disagreement_score":0.003911842,"about_ca_system_score_codex":0.0007198722,"about_ca_system_score_gemma":0.001163311,"threshold_uncertainty_score":0.013086438},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02701757,0.0048890407,0.14803746,0.004650266,0.0036603888,0.00044783545,0.0110704005,0.016171824,0.7840552],"genre_scores_gemma":[0.25874746,0.0036556737,0.10385615,0.0029044542,0.0008362643,0.00063709734,0.029947782,0.0036750392,0.5957401],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994961,0.000078790836,0.000026492238,0.0001086933,0.00022057368,0.000069451155],"domain_scores_gemma":[0.99950004,0.000059281694,0.000024279,0.00013814832,0.00019752744,0.000080651545],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005585814,0.0006153223,0.000556029,0.00064800045,0.0009940104,0.0016616415,0.0011747618,0.00061523024,0.12892546],"category_scores_gemma":[0.0009700721,0.00025783133,0.00029686085,0.0008232441,0.00037595126,0.0013964043,0.0020245519,0.0010416206,0.07212972],"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.0007021331,0.0001738761,0.0026014368,0.00058771647,0.00004461172,0.00028217534,0.00022659915,0.006987248,0.019001031,0.14358535,0.44688037,0.37892738],"study_design_scores_gemma":[0.000058951453,0.00009856292,0.00070027553,0.00004276928,0.000011286009,0.00023364277,0.000086869724,0.008466909,0.012012187,0.013912438,0.9643596,0.000016476168],"about_ca_topic_score_codex":0.0005977899,"about_ca_topic_score_gemma":0.0010065851,"teacher_disagreement_score":0.87107456,"about_ca_system_score_codex":0.0008232249,"about_ca_system_score_gemma":0.00086901744,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92169166,0.0016330128,0.061801035,0.0002503738,0.00018643838,0.00015507637,0.00059509015,0.0025909068,0.011096432],"genre_scores_gemma":[0.9575994,0.00021611403,0.036984578,0.00018525151,0.000029030736,0.000061042985,0.0004342847,0.00003241845,0.0044579026],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99988115,0.000010112384,0.000008715142,0.000031829513,0.000043585274,0.000024529158],"domain_scores_gemma":[0.9998035,0.000027333828,0.0000348248,0.000038852097,0.000075545366,0.000020024956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007675258,0.00018337846,0.0002391714,0.0002489269,0.00030117203,0.00039392596,0.0014799428,0.00032290258,0.002480445],"category_scores_gemma":[0.00019472047,0.00015744528,0.00018059794,0.00045371283,0.00015982473,0.000776741,0.00033162718,0.00024396424,0.00056446216],"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.0005045184,0.00015897426,0.0034736835,0.00031922353,0.00008752691,0.00040563996,0.00011517281,0.0018198309,0.9019017,0.0022560242,0.0036570183,0.085300654],"study_design_scores_gemma":[0.00014665378,0.0026301865,0.0035322015,0.000034508368,0.00018326951,0.0015462512,0.00009839843,0.021887716,0.9466208,0.00066034374,0.022595517,0.00006412655],"about_ca_topic_score_codex":0.0007528343,"about_ca_topic_score_gemma":0.0028406559,"teacher_disagreement_score":0.002480445,"about_ca_system_score_codex":0.00035309256,"about_ca_system_score_gemma":0.00042862562,"threshold_uncertainty_score":0.00829792},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9744143,0.00097121665,0.020915324,0.00011250252,0.000032734355,0.000063782965,0.00030864272,0.000338116,0.0028434913],"genre_scores_gemma":[0.9964401,0.00026433147,0.0024406076,0.00003524285,0.000017130256,0.000028449822,0.00022117824,0.000063235035,0.0004897051],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887794,0.00023240577,0.00007857437,0.00021348955,0.00045016507,0.00014735167],"domain_scores_gemma":[0.9886326,0.0087347245,0.0007941056,0.00062432623,0.0010692597,0.0001449008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059899467,0.0005996324,0.0004192219,0.00070804945,0.00020866851,0.0007849101,0.0005392157,0.00039385125,0.0010630206],"category_scores_gemma":[0.00947852,0.0002230575,0.00025019798,0.0010174535,0.00025501542,0.0010187479,0.000387137,0.0005134747,0.00035803946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022418534,0.0007259003,0.17714897,0.0010744279,0.00033426573,0.0011618787,0.000547332,0.2359108,0.36187604,0.0018004283,0.0012448032,0.21593325],"study_design_scores_gemma":[0.000050117855,0.0027303596,0.21159151,0.0000651925,0.00029589832,0.0014392156,0.00034370893,0.48004067,0.29746744,0.0027532491,0.0031340646,0.0000885581],"about_ca_topic_score_codex":0.00074046047,"about_ca_topic_score_gemma":0.0007158042,"teacher_disagreement_score":0.0010630206,"about_ca_system_score_codex":0.00025706796,"about_ca_system_score_gemma":0.00027255763,"threshold_uncertainty_score":0.0035561323},"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":"other","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044803448,0.014600311,0.29524183,0.037004564,0.012336928,0.0013668513,0.16900657,0.11381647,0.311823],"genre_scores_gemma":[0.36505866,0.0062379134,0.2614127,0.0083070295,0.007477951,0.0016943992,0.22275779,0.036278732,0.09077485],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955296,0.0009830359,0.00017648241,0.00040060192,0.0025499568,0.00036030714],"domain_scores_gemma":[0.98018813,0.0040315357,0.0009157628,0.007482943,0.0049245507,0.002457103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009797425,0.001555784,0.0017838173,0.0043098866,0.0028801307,0.006476707,0.0024890797,0.0026034391,0.028332865],"category_scores_gemma":[0.026585834,0.0022298691,0.000896165,0.004401145,0.0012586992,0.004418271,0.0028864078,0.0071337726,0.013126823],"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.002522108,0.00028360134,0.0021667082,0.00056503527,0.00015127972,0.00013320983,0.00011769075,0.009633438,0.0028081234,0.11323977,0.7245998,0.14377934],"study_design_scores_gemma":[0.000587701,0.0004274833,0.006764923,0.00026971268,0.00021977081,0.00032545597,0.000033682223,0.02888056,0.020614728,0.045247857,0.8963769,0.0002512539],"about_ca_topic_score_codex":0.008954832,"about_ca_topic_score_gemma":0.009572275,"teacher_disagreement_score":0.028332865,"about_ca_system_score_codex":0.0039917,"about_ca_system_score_gemma":0.004824698,"threshold_uncertainty_score":0.09478283},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003717171,0.00008207672,0.98774755,0.00012808488,0.000054353648,0.000113102025,0.00007429235,0.0039277757,0.004155578],"genre_scores_gemma":[0.096523575,0.00021008389,0.8959282,0.00021981001,0.00005214387,0.00021287556,0.0003415313,0.00091067667,0.0056010834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989047,0.00012794326,0.00007642931,0.00018696462,0.00058992865,0.000114030285],"domain_scores_gemma":[0.9971487,0.00049480685,0.00015765516,0.0007489927,0.0013665236,0.00008333824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008909527,0.0011396252,0.0006395978,0.0012866319,0.00073830684,0.002423723,0.002498391,0.00047345043,0.0047733234],"category_scores_gemma":[0.0043912837,0.001152526,0.0007664655,0.0010967096,0.00069393666,0.0021569477,0.0008846595,0.002820103,0.002319034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023280294,0.00017221975,0.004247142,0.00046964877,0.00014485174,0.00028965337,0.0005156406,0.19208637,0.08002882,0.10362329,0.015970016,0.6022195],"study_design_scores_gemma":[0.00003736467,0.00020876704,0.0009334436,0.000055105138,0.00018384645,0.0003287251,0.00009324208,0.8053456,0.10574153,0.028485553,0.05849565,0.00009111254],"about_ca_topic_score_codex":0.004777988,"about_ca_topic_score_gemma":0.007813297,"teacher_disagreement_score":0.004777988,"about_ca_system_score_codex":0.0013245385,"about_ca_system_score_gemma":0.0029086513,"threshold_uncertainty_score":0.015968323},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005882482,0.00008517469,0.7367897,0.00014838998,0.00021509826,0.00028127411,0.0031544315,0.2246574,0.028786028],"genre_scores_gemma":[0.12168143,0.0002356994,0.7433309,0.0007135366,0.0001244935,0.0009940355,0.010832668,0.05817216,0.06391514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996124,0.000033455744,0.000036340607,0.000104430685,0.00013353284,0.00007985473],"domain_scores_gemma":[0.9995339,0.00013838508,0.000024535353,0.0000841886,0.00018190306,0.000037104805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040548603,0.0014833156,0.0005902712,0.00097606995,0.00050951575,0.0017787573,0.0028471726,0.0006348463,0.097926125],"category_scores_gemma":[0.0016602965,0.0008346758,0.0008480234,0.000723062,0.00036277383,0.0010248291,0.00094446476,0.0012007081,0.0347787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006992199,0.00022539838,0.001965383,0.0007136703,0.00009250278,0.0006488233,0.00043191612,0.013925003,0.037155576,0.025769286,0.2532929,0.6650804],"study_design_scores_gemma":[0.00032672877,0.00017095772,0.0020861363,0.00017833505,0.00010486937,0.0009997361,0.00019822744,0.3480504,0.19960035,0.023316842,0.42480305,0.0001644093],"about_ca_topic_score_codex":0.0041591083,"about_ca_topic_score_gemma":0.004610918,"teacher_disagreement_score":0.097926125,"about_ca_system_score_codex":0.00072832766,"about_ca_system_score_gemma":0.0007828705,"threshold_uncertainty_score":0.32759553},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3084574,0.0016531612,0.6710166,0.0003178654,0.00016197852,0.00007348633,0.00012547048,0.0024660975,0.015727969],"genre_scores_gemma":[0.790986,0.0006269766,0.20172976,0.000104012805,0.00004621177,0.0000616219,0.000090115376,0.0000967795,0.0062585655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998994,0.000017896935,0.000012301427,0.000018311497,0.00003235815,0.000019795256],"domain_scores_gemma":[0.9997408,0.00008954098,0.000059207818,0.00006890435,0.000031376378,0.000010154749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015722399,0.00027149348,0.00023933838,0.00029859942,0.00018886622,0.000603057,0.00062206393,0.00022080292,0.004070002],"category_scores_gemma":[0.00038994665,0.00019690339,0.00020159167,0.00033314538,0.000238048,0.0014939829,0.00051503733,0.00034781318,0.00042240156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007971305,0.000114666596,0.0020652513,0.0006456037,0.000070078175,0.00079806615,0.00018110125,0.033559166,0.3514483,0.11438588,0.0039022276,0.4920325],"study_design_scores_gemma":[0.00013809818,0.0011211708,0.0010641619,0.000087672786,0.00009926996,0.0016913554,0.00012105319,0.25003543,0.6703938,0.035213158,0.039980695,0.00005411882],"about_ca_topic_score_codex":0.00012878576,"about_ca_topic_score_gemma":0.00045615435,"teacher_disagreement_score":0.004070002,"about_ca_system_score_codex":0.00024068415,"about_ca_system_score_gemma":0.00018320142,"threshold_uncertainty_score":0.013615549},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021435814,0.0012077077,0.9223238,0.0006788473,0.00018673555,0.00021244935,0.0006580847,0.030708715,0.02258784],"genre_scores_gemma":[0.2025176,0.0009752773,0.7782237,0.00050211477,0.00020048353,0.0005933059,0.00140019,0.0069021056,0.008685277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838626,0.00022838099,0.0000896044,0.00015674316,0.00087767065,0.00026141963],"domain_scores_gemma":[0.99892527,0.00024309893,0.00009593952,0.00037137547,0.00026139873,0.00010281693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019234959,0.001272656,0.0011751401,0.0009500473,0.0010934576,0.0022230726,0.0033652482,0.00088604674,0.004227828],"category_scores_gemma":[0.0034036718,0.0006741709,0.0015028793,0.0010825295,0.001602034,0.0022766113,0.0023051316,0.0028731523,0.0014818142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028321226,0.00014680735,0.0027996718,0.0005496591,0.00011724902,0.0003969791,0.0007002044,0.32585028,0.013942206,0.5144281,0.038278967,0.10250675],"study_design_scores_gemma":[0.00011958029,0.00006834989,0.0008452751,0.0001453225,0.00006497185,0.00020956034,0.000075747186,0.7438363,0.012032301,0.08943069,0.15307093,0.00010100447],"about_ca_topic_score_codex":0.010920277,"about_ca_topic_score_gemma":0.00852762,"teacher_disagreement_score":0.010920277,"about_ca_system_score_codex":0.0023799026,"about_ca_system_score_gemma":0.003055319,"threshold_uncertainty_score":0.021713436},"labels":[],"label_agreement":null},{"id":"W2027534015","doi":"10.1016/j.scico.2011.06.004","title":"Parallel execution of Java loops on Graphics Processing Units","year":2011,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Just-in-time compilation; Speedup; Parallel computing; Control flow; Java bytecode; Java; Compiler; Graphics; Bytecode; Optimizing compiler; Programming language; CUDA; General-purpose computing on graphics processing units; Operating system; Real time Java; Java annotation","score_opus":0.04446778688000051,"score_gpt":0.2719287597999689,"score_spread":0.22746097291996836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027534015","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40407354,0.00035531732,0.5476199,0.00031450295,0.00028315265,0.00021354761,0.00024436606,0.025985844,0.020909864],"genre_scores_gemma":[0.7704817,0.00012499807,0.22040884,0.00014575422,0.000036040252,0.0001536793,0.0005280928,0.00230048,0.00582045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990582,0.00021866805,0.000056970006,0.00015705761,0.00030146935,0.00020774592],"domain_scores_gemma":[0.99854076,0.00054501183,0.000086137225,0.00037215272,0.00034734464,0.00010852905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009886699,0.0007469663,0.0006652,0.0005494417,0.00078092545,0.0011945894,0.001780365,0.0005541888,0.00455014],"category_scores_gemma":[0.0028852497,0.00048910454,0.0006689334,0.00075702596,0.0007593195,0.0011044681,0.0011219329,0.00091782794,0.00075743336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007194612,0.0010132656,0.012563048,0.0005441541,0.00033089676,0.0010316771,0.0015979734,0.23585601,0.17408378,0.051953528,0.021913387,0.49191773],"study_design_scores_gemma":[0.0005115052,0.00036712195,0.0019270305,0.00002568929,0.000098807875,0.00010427875,0.00012540903,0.8780868,0.08857227,0.020393545,0.009742539,0.00004495636],"about_ca_topic_score_codex":0.004936535,"about_ca_topic_score_gemma":0.0057106134,"teacher_disagreement_score":0.004936535,"about_ca_system_score_codex":0.0008322492,"about_ca_system_score_gemma":0.0012223317,"threshold_uncertainty_score":0.015221715},"labels":[],"label_agreement":null},{"id":"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":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011909581,0.003935439,0.26638955,0.00576953,0.0011663388,0.00063024444,0.015065526,0.49740264,0.19773115],"genre_scores_gemma":[0.18195482,0.006282048,0.35828206,0.004411683,0.0015302334,0.0027277148,0.09545122,0.05394212,0.29541805],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860245,0.0002216225,0.00008503265,0.00033173067,0.00048100276,0.0002782063],"domain_scores_gemma":[0.9973322,0.00032463827,0.00014639196,0.0011296791,0.0006526451,0.00041451523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017602436,0.0011571561,0.00072998146,0.0012791551,0.0012599155,0.0032636544,0.0034116164,0.00110834,0.099316515],"category_scores_gemma":[0.003912935,0.0009377912,0.00072795706,0.0015399458,0.0006720745,0.0068595116,0.00425587,0.0027344,0.09029043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008400193,0.00018521943,0.0015325092,0.00058118056,0.00006361607,0.00019739532,0.0002896301,0.0024706346,0.013949504,0.06827716,0.62129855,0.2903145],"study_design_scores_gemma":[0.00021070112,0.0001314461,0.0010017761,0.00010014723,0.00002490756,0.00016499098,0.000074514996,0.016315436,0.008959137,0.019236283,0.9537271,0.000053677693],"about_ca_topic_score_codex":0.0031147478,"about_ca_topic_score_gemma":0.0018920611,"teacher_disagreement_score":0.099316515,"about_ca_system_score_codex":0.001229335,"about_ca_system_score_gemma":0.002624693,"threshold_uncertainty_score":0.33224684},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27954403,0.0076742414,0.58289593,0.0019737172,0.0007599977,0.00059485144,0.002726296,0.067738056,0.05609292],"genre_scores_gemma":[0.79515666,0.0017691222,0.16104738,0.0006335875,0.00019849786,0.00039069462,0.003540462,0.0018024682,0.035461087],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99961865,0.000060369362,0.000026408128,0.00008976191,0.00012804593,0.0000766543],"domain_scores_gemma":[0.9986418,0.00032530178,0.000154957,0.0005047321,0.00027995952,0.00009320834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048073538,0.00058872823,0.00038654255,0.0004974327,0.0004382158,0.00083899096,0.0015222708,0.00045780616,0.011477639],"category_scores_gemma":[0.0016855074,0.000334111,0.00026051758,0.0006499744,0.00034130123,0.0014913086,0.001149616,0.0009071329,0.0029080124],"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.0032739528,0.00029674964,0.010947874,0.00076903566,0.00012211714,0.00045027395,0.00041175453,0.035437066,0.08428968,0.03739202,0.054911595,0.77169794],"study_design_scores_gemma":[0.00053065136,0.0019595455,0.008380808,0.00012481891,0.00023126078,0.0009891179,0.00018086532,0.5584969,0.16255966,0.04555565,0.22081839,0.00017234687],"about_ca_topic_score_codex":0.0010763274,"about_ca_topic_score_gemma":0.0021045452,"teacher_disagreement_score":0.011477639,"about_ca_system_score_codex":0.00042106424,"about_ca_system_score_gemma":0.0008612272,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94322336,0.001670898,0.04950594,0.00018383139,0.000046989815,0.000025116744,0.00007295117,0.0007683609,0.004502526],"genre_scores_gemma":[0.9870947,0.00032650615,0.011587129,0.000030679857,0.0000131125735,0.000009924686,0.00009831093,0.00004152675,0.00079821865],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967647,0.000055478227,0.000022595948,0.000043995842,0.00010038483,0.00010105914],"domain_scores_gemma":[0.9981437,0.00091915845,0.00025164356,0.0003917151,0.00022001426,0.0000737537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043269683,0.0007794801,0.0004360398,0.000384771,0.00045888466,0.00083874,0.0010914551,0.00028751147,0.0020661082],"category_scores_gemma":[0.0020399643,0.00023902094,0.0002558527,0.00084252993,0.0005404477,0.0019619723,0.0005699454,0.0005167501,0.00036204827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029153796,0.00070089457,0.017786857,0.0008409853,0.00018966875,0.0007128125,0.00018445404,0.3810701,0.3864141,0.02071144,0.0037481831,0.18472514],"study_design_scores_gemma":[0.00017079938,0.0019145268,0.009397256,0.000052920062,0.00024528895,0.00054934015,0.00017530694,0.6493024,0.31735802,0.013964654,0.0067926967,0.00007678617],"about_ca_topic_score_codex":0.00066474883,"about_ca_topic_score_gemma":0.0020993454,"teacher_disagreement_score":0.0020661082,"about_ca_system_score_codex":0.00036746304,"about_ca_system_score_gemma":0.0008809831,"threshold_uncertainty_score":0.006911814},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24389513,0.002894453,0.71051335,0.00042036077,0.00024933546,0.0006538776,0.010404932,0.0072327103,0.02373585],"genre_scores_gemma":[0.6021813,0.0011116681,0.3830835,0.00014730841,0.00011644144,0.00064871047,0.007143871,0.0005834659,0.004983745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597377,0.00043076047,0.00026710736,0.00051598955,0.0026715067,0.00014086177],"domain_scores_gemma":[0.98485434,0.005529713,0.001956936,0.0014375863,0.006011868,0.00020960267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014625416,0.00049036846,0.00033580812,0.0054409625,0.00048792872,0.0013268832,0.0005469449,0.00035921487,0.0028583668],"category_scores_gemma":[0.01351952,0.00023560037,0.0003830547,0.0040001716,0.00069096935,0.001568256,0.00042949026,0.000562763,0.0010451468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006250561,0.0002758428,0.035106663,0.0021115842,0.00014379484,0.00026065734,0.0008723524,0.025571411,0.20288324,0.03923512,0.005982017,0.6869323],"study_design_scores_gemma":[0.00007234321,0.0016419326,0.13276778,0.0008584601,0.00021547957,0.002979444,0.0010952159,0.3199815,0.37438512,0.052491583,0.11326338,0.00024775544],"about_ca_topic_score_codex":0.00157828,"about_ca_topic_score_gemma":0.0014074798,"teacher_disagreement_score":0.0054409625,"about_ca_system_score_codex":0.0008012093,"about_ca_system_score_gemma":0.0011642855,"threshold_uncertainty_score":0.009562194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09638489,0.0008031668,0.89364773,0.0001873045,0.00006473194,0.0001240579,0.00004941039,0.0005824975,0.0081561925],"genre_scores_gemma":[0.5109384,0.0007217534,0.48386264,0.00009070242,0.000035094585,0.00016886494,0.000104150924,0.0001372357,0.0039410363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997787,0.00004321095,0.000012236458,0.000047507252,0.000076396595,0.00004194252],"domain_scores_gemma":[0.99981993,0.000058569112,0.000041718613,0.00002689008,0.000038577076,0.000014342196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023954773,0.00039035783,0.00030578126,0.0002546148,0.00027213513,0.0005040798,0.00086134084,0.00029095617,0.0010068436],"category_scores_gemma":[0.00044558098,0.00023723616,0.00028263085,0.0003327311,0.00031310978,0.0003952953,0.00025235317,0.000359131,0.0002512469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011171277,0.00007400704,0.0009306339,0.00029561232,0.000066083936,0.00026932702,0.00011354376,0.7077491,0.13267325,0.024575463,0.0011496635,0.13199167],"study_design_scores_gemma":[0.000051443236,0.00029365346,0.00081643567,0.00002231965,0.00005653179,0.00017017659,0.000072462644,0.92251706,0.0521483,0.008980502,0.014854623,0.000016514565],"about_ca_topic_score_codex":0.0009681867,"about_ca_topic_score_gemma":0.0022005779,"teacher_disagreement_score":0.0010068436,"about_ca_system_score_codex":0.0004191983,"about_ca_system_score_gemma":0.000736611,"threshold_uncertainty_score":0.0033681989},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49227107,0.0031310825,0.49162102,0.0009941355,0.00042592367,0.00010398275,0.00016652644,0.0031603805,0.00812585],"genre_scores_gemma":[0.9597571,0.00018369615,0.038296007,0.000078219455,0.000035496345,0.000025779333,0.000059495727,0.00010130365,0.001463031],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997297,0.000056515484,0.000017945407,0.00003548483,0.000100529476,0.00005966015],"domain_scores_gemma":[0.9988423,0.0004958931,0.00010710944,0.00024787962,0.00024929162,0.000057448677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005686437,0.0004821998,0.0004062461,0.00040967407,0.00055953546,0.00072176434,0.0009418803,0.0003151111,0.0018534748],"category_scores_gemma":[0.002354263,0.00034595813,0.00023725425,0.0003765467,0.00044499143,0.0009203663,0.0007114164,0.0006800853,0.00015815969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034829222,0.00043169636,0.0108952755,0.00050528935,0.00019212623,0.00064011425,0.00080637727,0.44851092,0.16017991,0.057172604,0.010952928,0.30622998],"study_design_scores_gemma":[0.00003978556,0.0001462812,0.00047326772,0.000013953677,0.000040360137,0.00004711536,0.0000646108,0.9598052,0.021350807,0.01641467,0.001589819,0.000014187914],"about_ca_topic_score_codex":0.0014242607,"about_ca_topic_score_gemma":0.004735706,"teacher_disagreement_score":0.0018534748,"about_ca_system_score_codex":0.00051218906,"about_ca_system_score_gemma":0.0013163296,"threshold_uncertainty_score":0.006200433},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044695757,0.03721778,0.57623994,0.014564073,0.006615228,0.00009858249,0.000107477994,0.0020155604,0.31844562],"genre_scores_gemma":[0.5465463,0.017071242,0.32447544,0.0049596825,0.0022975304,0.00019414311,0.00020235396,0.0006978559,0.103555515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999315,0.0001619033,0.000030280778,0.0000983865,0.00031262575,0.000081860075],"domain_scores_gemma":[0.9991247,0.0003301625,0.00005026118,0.00016515832,0.00019257692,0.0001371754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000735556,0.00025105942,0.00027110756,0.00033892193,0.0007533245,0.002057309,0.0006393105,0.000765016,0.006342334],"category_scores_gemma":[0.0018414502,0.00030325085,0.00019406265,0.00029829727,0.001328422,0.003017159,0.0011752845,0.0026160234,0.0016255605],"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.000065385,0.00004661043,0.00036304237,0.0001590019,0.000009787646,0.00014119322,0.00017399805,0.0069496585,0.0035090179,0.86582583,0.017334765,0.10542162],"study_design_scores_gemma":[0.000029993378,0.00009320683,0.00041759197,0.00014437544,0.00000999693,0.00044819497,0.00012627563,0.04312189,0.0040041087,0.5838267,0.36774132,0.000036319412],"about_ca_topic_score_codex":0.00044353356,"about_ca_topic_score_gemma":0.0007615577,"teacher_disagreement_score":0.006342334,"about_ca_system_score_codex":0.0005619076,"about_ca_system_score_gemma":0.0005578176,"threshold_uncertainty_score":0.021217167},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023769159,0.0016324242,0.9457705,0.00020872861,0.00020211097,0.0002870328,0.00018052779,0.013793271,0.014156215],"genre_scores_gemma":[0.3974348,0.0008403381,0.5859294,0.00028025085,0.000080713624,0.00041327206,0.0006240683,0.001640507,0.012756562],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979942,0.0004412663,0.00013411045,0.0003040114,0.00077835226,0.0003481274],"domain_scores_gemma":[0.99735236,0.0005235727,0.0001595542,0.0011589426,0.0007007128,0.00010481027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011083506,0.0006716211,0.0006358378,0.0012253842,0.0007868366,0.0017323912,0.002322747,0.000618218,0.008345623],"category_scores_gemma":[0.004598833,0.00048048404,0.00046583987,0.001546801,0.00063410914,0.0018381332,0.0017768458,0.00086785865,0.0030583485],"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.0011154433,0.0003467333,0.005014571,0.00067907735,0.00019984857,0.00016101006,0.0003290981,0.09870778,0.09365947,0.094672866,0.025553629,0.6795604],"study_design_scores_gemma":[0.00047116145,0.000616824,0.0036539657,0.00013239712,0.00030535806,0.00074838527,0.00016025157,0.6126418,0.14151245,0.04841441,0.19116253,0.00018049091],"about_ca_topic_score_codex":0.0026578333,"about_ca_topic_score_gemma":0.00394217,"teacher_disagreement_score":0.008345623,"about_ca_system_score_codex":0.00079717796,"about_ca_system_score_gemma":0.0014735985,"threshold_uncertainty_score":0.027918935},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029579267,0.0014438406,0.37049916,0.0012665095,0.0005330755,0.00047475923,0.006562311,0.08855502,0.50108606],"genre_scores_gemma":[0.33110356,0.0020935757,0.24553065,0.0014130219,0.0002429848,0.00080896466,0.017921384,0.012120118,0.38876572],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993456,0.00010762357,0.000033003158,0.00010949484,0.00031735818,0.00008689537],"domain_scores_gemma":[0.99908185,0.00020115059,0.000060975213,0.0002906242,0.00027144156,0.000093971285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007688415,0.0005458572,0.00036206987,0.000659946,0.00045531307,0.0011749039,0.0008018196,0.0005806053,0.07805435],"category_scores_gemma":[0.0021793065,0.0003178968,0.0003450204,0.00042768117,0.0002621808,0.0015626863,0.0013244149,0.0006359572,0.029437417],"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.00070957677,0.00016954214,0.0027917486,0.00056331337,0.000048747595,0.0003580267,0.00034307753,0.011388515,0.03676855,0.07966117,0.18997356,0.6772241],"study_design_scores_gemma":[0.00012383853,0.00022522548,0.0015340834,0.0000930559,0.000029638762,0.00080152176,0.0000649669,0.030552864,0.033125054,0.012006861,0.9214,0.000042978438],"about_ca_topic_score_codex":0.00064050464,"about_ca_topic_score_gemma":0.000937641,"teacher_disagreement_score":0.07805435,"about_ca_system_score_codex":0.0003919422,"about_ca_system_score_gemma":0.0008131384,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13813528,0.00031873642,0.82208395,0.00030446547,0.00013439187,0.0005441734,0.001430721,0.032230847,0.004817431],"genre_scores_gemma":[0.251822,0.00033955765,0.74003756,0.000100141566,0.000040452825,0.00064477354,0.0025212604,0.0011875938,0.0033066615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983236,0.0003309455,0.00016510523,0.00027320522,0.00078626245,0.00012082087],"domain_scores_gemma":[0.9970011,0.00057547865,0.00019980992,0.0007118863,0.0013366338,0.00017507425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021927122,0.0007167612,0.0010156105,0.0012429175,0.0008250397,0.0012015055,0.0013104317,0.00042275246,0.0034751513],"category_scores_gemma":[0.004760709,0.00042622758,0.0005921109,0.0021235875,0.00036242628,0.0009660807,0.0008050002,0.00081121095,0.0010065961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032381457,0.0006586009,0.017284347,0.0005708283,0.00040138685,0.0016212106,0.0007572252,0.09738665,0.36568516,0.012974224,0.03664717,0.4627751],"study_design_scores_gemma":[0.00050616654,0.00039498828,0.008950827,0.00004220326,0.000121912635,0.00039565563,0.00017393171,0.7785552,0.16949718,0.0058408366,0.035387892,0.00013317227],"about_ca_topic_score_codex":0.0033104524,"about_ca_topic_score_gemma":0.0035058332,"teacher_disagreement_score":0.0034751513,"about_ca_system_score_codex":0.0007981893,"about_ca_system_score_gemma":0.001799811,"threshold_uncertainty_score":0.011625588},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15301554,0.018656595,0.7162085,0.004171038,0.0011566912,0.00019809199,0.0009808337,0.014293394,0.09131926],"genre_scores_gemma":[0.8164646,0.0024893482,0.16003053,0.00095902337,0.00022484089,0.00027861807,0.00095636287,0.0011422023,0.01745441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995571,0.00010070603,0.00002327081,0.000046508987,0.0002105309,0.000061894956],"domain_scores_gemma":[0.9992107,0.00021139291,0.000048549242,0.00022211942,0.00026147513,0.00004563155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041066433,0.0002698283,0.0002545148,0.000473295,0.00068881747,0.0011517182,0.00083635014,0.00048428745,0.0029442932],"category_scores_gemma":[0.0023349081,0.0002167969,0.00023037709,0.0009214012,0.00038149607,0.0010802303,0.0009037684,0.0010346875,0.00046596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067237916,0.00016470134,0.0064078253,0.0006852854,0.00016564947,0.00040368247,0.0006692566,0.10005651,0.046164837,0.39673048,0.10598938,0.34188998],"study_design_scores_gemma":[0.00019039755,0.00028019663,0.0019647093,0.00014369233,0.000095989955,0.00037702333,0.00018047272,0.6641876,0.028043691,0.12697306,0.17750275,0.00006043765],"about_ca_topic_score_codex":0.0049670646,"about_ca_topic_score_gemma":0.010823384,"teacher_disagreement_score":0.0049670646,"about_ca_system_score_codex":0.0009757678,"about_ca_system_score_gemma":0.0012788343,"threshold_uncertainty_score":0.009876311},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04128415,0.0022760106,0.88079333,0.0022164255,0.0024870476,0.00019020251,0.00029419892,0.016901225,0.053557444],"genre_scores_gemma":[0.3581334,0.001658966,0.47155282,0.0010191606,0.00087185076,0.00021720468,0.0008565537,0.005800427,0.15988953],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996426,0.00008240403,0.000021311196,0.00008687429,0.00009891982,0.00006786961],"domain_scores_gemma":[0.9995709,0.00014485476,0.000017594088,0.000090730646,0.00009508535,0.00008075447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095089804,0.00042626433,0.0004358416,0.00022509867,0.00055014837,0.0017640416,0.0009870139,0.0006280725,0.024865124],"category_scores_gemma":[0.0010222977,0.00040556432,0.00043681505,0.00023745996,0.0003734802,0.0018830101,0.0008998309,0.0011121697,0.006490584],"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.002119029,0.0003806868,0.0023744688,0.0003566273,0.00008136586,0.0006855624,0.00070746616,0.018453028,0.12696554,0.06367161,0.20378377,0.58042085],"study_design_scores_gemma":[0.00048734498,0.0008954453,0.0030223618,0.00018578998,0.00013431006,0.0011971588,0.00036632133,0.2533432,0.1668101,0.043995216,0.5293475,0.0002152457],"about_ca_topic_score_codex":0.00064277527,"about_ca_topic_score_gemma":0.0012596041,"teacher_disagreement_score":0.024865124,"about_ca_system_score_codex":0.00049638737,"about_ca_system_score_gemma":0.00046578594,"threshold_uncertainty_score":0.0831821},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07560337,0.00040086458,0.9095307,0.00015512531,0.00010944948,0.0000751377,0.00013949786,0.007228793,0.0067570107],"genre_scores_gemma":[0.30356216,0.00020536743,0.6880438,0.00006960525,0.000063164334,0.000095646275,0.0003574277,0.00045583787,0.0071470207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996288,0.000059372163,0.000028549954,0.00008110029,0.00013222243,0.00006990202],"domain_scores_gemma":[0.9993635,0.00020749353,0.00004756607,0.00018481171,0.00014937448,0.00004729851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044441893,0.0004839944,0.0007033391,0.0005905677,0.00091680273,0.00088244997,0.0013645153,0.0004401487,0.00454513],"category_scores_gemma":[0.0013022944,0.0003665188,0.0005351739,0.0014117816,0.00048431053,0.0018772724,0.0014013235,0.0005982849,0.0013056434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010393667,0.00035823835,0.0026467831,0.0004201901,0.00013092815,0.00046407568,0.0004733177,0.1606815,0.06066195,0.08619131,0.014766494,0.6721658],"study_design_scores_gemma":[0.00023860102,0.00027664873,0.0007248207,0.00003130743,0.0000604798,0.00031956306,0.0000905262,0.8436475,0.061723046,0.06584537,0.026988704,0.000053501866],"about_ca_topic_score_codex":0.002688782,"about_ca_topic_score_gemma":0.0051359697,"teacher_disagreement_score":0.00454513,"about_ca_system_score_codex":0.0005118794,"about_ca_system_score_gemma":0.0009920506,"threshold_uncertainty_score":0.015204966},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020260211,0.030378524,0.8885013,0.007376228,0.0011514563,0.00017392091,0.00033863843,0.005196667,0.046623178],"genre_scores_gemma":[0.2379198,0.022209384,0.7058108,0.0020988863,0.0019906603,0.000391104,0.00085035217,0.0023908482,0.026338212],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751747,0.0004970194,0.00017248477,0.00036415533,0.001263329,0.00018549192],"domain_scores_gemma":[0.9949286,0.0021328083,0.00048147235,0.001402902,0.0009242788,0.0001300446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020207393,0.0013953734,0.0019457827,0.001136805,0.0012899842,0.004860606,0.0032853354,0.0023384385,0.009650763],"category_scores_gemma":[0.012435293,0.001006181,0.0008466395,0.002830054,0.0024043864,0.00918285,0.0024420028,0.0054497374,0.008140113],"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.0004131693,0.0003425016,0.0017345216,0.0012702598,0.0002432996,0.00012689723,0.0005072497,0.07977435,0.015519007,0.36258942,0.051721603,0.4857577],"study_design_scores_gemma":[0.0002043877,0.00035311087,0.00069493736,0.00037520763,0.00012891622,0.0004244817,0.00014435468,0.28428435,0.018618898,0.4813161,0.21331629,0.00013895896],"about_ca_topic_score_codex":0.001907162,"about_ca_topic_score_gemma":0.0022200118,"teacher_disagreement_score":0.009650763,"about_ca_system_score_codex":0.0014218119,"about_ca_system_score_gemma":0.0022042475,"threshold_uncertainty_score":0.032285035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7773776,0.008254683,0.13816409,0.0018091683,0.00018671449,0.000064989865,0.00015081659,0.00029016065,0.07370177],"genre_scores_gemma":[0.99307704,0.00050635106,0.002904116,0.000054400967,0.00003402372,0.000008182779,0.000014795058,0.000042309537,0.0033589543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997272,0.00007121991,0.0000060652783,0.000027115193,0.00008213771,0.000086218184],"domain_scores_gemma":[0.99779105,0.0017291663,0.00014614148,0.000103417755,0.00017529521,0.000054818946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000617401,0.00043163664,0.000446476,0.0005082263,0.0003750367,0.0008041077,0.00084200583,0.00048039842,0.0029053574],"category_scores_gemma":[0.0062090023,0.00034415527,0.0003571378,0.00089474436,0.0008286203,0.0011288082,0.00056108634,0.000621045,0.00026981207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029194946,0.00014802026,0.0030993228,0.00023073069,0.000044896926,0.0004547113,0.00022334368,0.87519485,0.018311387,0.07393801,0.0017396023,0.026323073],"study_design_scores_gemma":[0.0000068701693,0.000030892817,0.00087945967,0.000010542585,0.000013727338,0.00007678658,0.000043644493,0.99156064,0.0016736885,0.0048693665,0.00082869665,0.0000056446],"about_ca_topic_score_codex":0.0028090444,"about_ca_topic_score_gemma":0.0027187178,"teacher_disagreement_score":0.0029053574,"about_ca_system_score_codex":0.00084314914,"about_ca_system_score_gemma":0.0008189525,"threshold_uncertainty_score":0.009719431},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92331535,0.0017579463,0.06269839,0.00049719773,0.0000525738,0.0000721718,0.00023528238,0.0032471262,0.00812393],"genre_scores_gemma":[0.9357355,0.00054486026,0.05936075,0.00017699043,0.000022318865,0.00012172219,0.0004519588,0.0005173282,0.003068565],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992901,0.00012843525,0.00006887742,0.00008362385,0.00026647528,0.00016241436],"domain_scores_gemma":[0.9982476,0.0007553366,0.00020743528,0.00042349377,0.00029988476,0.00006627211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003321318,0.00072262425,0.0004906427,0.00064865913,0.0005431214,0.00073953386,0.001863087,0.00050446525,0.0024052374],"category_scores_gemma":[0.0029913879,0.00037360485,0.00039706242,0.0010505009,0.00031688644,0.0016385207,0.0012427055,0.00053522724,0.0007545225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014807931,0.00045768154,0.008536534,0.00075070397,0.00012455438,0.0009353775,0.00052624114,0.16227362,0.5608344,0.0063907886,0.0069369674,0.2507523],"study_design_scores_gemma":[0.0001207924,0.0006652607,0.006943255,0.00005679374,0.00021311113,0.0006872722,0.0004442075,0.58664906,0.38113523,0.0049171634,0.018106192,0.000061692605],"about_ca_topic_score_codex":0.0018646242,"about_ca_topic_score_gemma":0.0034092858,"teacher_disagreement_score":0.0024052374,"about_ca_system_score_codex":0.0005172961,"about_ca_system_score_gemma":0.0010677355,"threshold_uncertainty_score":0.008046269},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27267984,0.0003011827,0.6875866,0.00022539245,0.00009410355,0.00031419538,0.00018612912,0.031873953,0.006738643],"genre_scores_gemma":[0.65715766,0.00011840043,0.33700186,0.00016127122,0.000023224462,0.00019537003,0.0004094899,0.0028953687,0.0020374642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984825,0.00032914442,0.00008418078,0.00018733743,0.0006515131,0.00026530432],"domain_scores_gemma":[0.9953063,0.0020093548,0.00047149163,0.0012785646,0.0008408719,0.0000933757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010166619,0.00065638946,0.0004198514,0.0007232781,0.00045047142,0.0007270572,0.0011229161,0.0004196327,0.0016396786],"category_scores_gemma":[0.006309639,0.00049075234,0.00048285295,0.0010509328,0.0007852917,0.0008436691,0.0011112817,0.0010111034,0.0007956044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093722175,0.0005712302,0.023968857,0.0006008407,0.000095166404,0.00090463227,0.0010644759,0.23596984,0.1803448,0.034529835,0.009669263,0.51134384],"study_design_scores_gemma":[0.00011859201,0.00035833073,0.004742301,0.00005196256,0.0000596829,0.00032662996,0.00013683981,0.67603034,0.29585332,0.006462459,0.015793722,0.000065847205],"about_ca_topic_score_codex":0.0033280412,"about_ca_topic_score_gemma":0.003910655,"teacher_disagreement_score":0.0033280412,"about_ca_system_score_codex":0.0008396063,"about_ca_system_score_gemma":0.0026153652,"threshold_uncertainty_score":0.0066173673},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21769102,0.00085149327,0.7637511,0.00030889316,0.00018633786,0.00020631877,0.0002057409,0.0144108785,0.0023882233],"genre_scores_gemma":[0.75462264,0.00022392506,0.23772202,0.00024764836,0.00007123762,0.0001408326,0.00025009608,0.00018434897,0.0065372754],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997223,0.000025337753,0.000022119673,0.00009822077,0.000093089126,0.000038921997],"domain_scores_gemma":[0.9994154,0.00013241376,0.00007073195,0.00014762387,0.00018317188,0.00005068771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037869043,0.0003519853,0.0004388464,0.00045632635,0.0004609896,0.00034922146,0.0015117631,0.00045626872,0.0013312642],"category_scores_gemma":[0.001020975,0.00035333788,0.00022499227,0.000495831,0.0002727877,0.00076645496,0.00046056046,0.0006041958,0.00035507182],"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.001235164,0.0005101798,0.009156492,0.00019411853,0.00010672977,0.00027765203,0.0002157819,0.07046057,0.4153961,0.004586942,0.007758679,0.49010164],"study_design_scores_gemma":[0.00018936458,0.00056879554,0.003216833,0.000013406571,0.00007429455,0.00027377365,0.000026509846,0.8724702,0.11298311,0.0015283199,0.008593874,0.000061430794],"about_ca_topic_score_codex":0.0035021568,"about_ca_topic_score_gemma":0.006861431,"teacher_disagreement_score":0.0035021568,"about_ca_system_score_codex":0.00054314185,"about_ca_system_score_gemma":0.0012500159,"threshold_uncertainty_score":0.006963551},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058496144,0.00015027511,0.9271763,0.000119475335,0.000019532588,0.0001514634,0.00016256643,0.011772085,0.0019521388],"genre_scores_gemma":[0.44464764,0.000094814684,0.55246943,0.00007573299,0.000020602733,0.00013468086,0.00059058564,0.00068707246,0.0012794076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990821,0.00018963403,0.00006076433,0.00017910682,0.00035605344,0.00013227154],"domain_scores_gemma":[0.9984413,0.0007134591,0.00015315045,0.00037594087,0.000260544,0.000055624638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007149425,0.0008190056,0.0005601464,0.0009842231,0.0005794137,0.00073007395,0.0012877734,0.00037462614,0.0018114167],"category_scores_gemma":[0.002639395,0.00046298432,0.0006829134,0.00052626786,0.0008378568,0.0011825552,0.000901135,0.0008978363,0.00043074533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089009164,0.00041624444,0.01566325,0.0003757093,0.00012997458,0.0004721258,0.00066095265,0.17873447,0.15946779,0.03147671,0.009321509,0.6023912],"study_design_scores_gemma":[0.000048028473,0.00008768931,0.0011125614,0.000015809843,0.000020981744,0.00008137857,0.000045877932,0.9398885,0.04508654,0.011017589,0.002569208,0.000025831429],"about_ca_topic_score_codex":0.0036696556,"about_ca_topic_score_gemma":0.005597447,"teacher_disagreement_score":0.0036696556,"about_ca_system_score_codex":0.0005213522,"about_ca_system_score_gemma":0.0016264096,"threshold_uncertainty_score":0.007296562},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73896486,0.000727378,0.25493604,0.00036939813,0.00014256773,0.000058325222,0.00048589314,0.0026729426,0.0016426506],"genre_scores_gemma":[0.97499144,0.00011302861,0.023824451,0.000020680789,0.000046440626,0.000031243773,0.00033948416,0.00007509228,0.0005581037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995751,0.000079946236,0.000025653244,0.0001091722,0.00013428064,0.000075886725],"domain_scores_gemma":[0.99652714,0.0021737905,0.00036462967,0.00031877335,0.0004170296,0.0001987939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087094685,0.00086239696,0.00080033374,0.0007568215,0.00038204965,0.00063054747,0.0009688146,0.00070088974,0.0009552358],"category_scores_gemma":[0.0062518083,0.00044151462,0.00025971973,0.0007667836,0.00033624715,0.0008643331,0.0004734351,0.00091371394,0.00027957212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012085025,0.0003248861,0.013013421,0.00008375603,0.00003719307,0.00016189202,0.000056006094,0.9124057,0.0051694573,0.0018676436,0.0019745538,0.06369701],"study_design_scores_gemma":[0.0000032171215,0.000012110287,0.0003604528,8.462913e-7,0.0000016096004,0.0000043146388,0.0000019307008,0.998836,0.0004718299,0.00027452392,0.000031927568,0.0000012599005],"about_ca_topic_score_codex":0.005627001,"about_ca_topic_score_gemma":0.005319136,"teacher_disagreement_score":0.005627001,"about_ca_system_score_codex":0.00038654768,"about_ca_system_score_gemma":0.00091043377,"threshold_uncertainty_score":0.011188507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006626282,0.000052954616,0.98946804,0.00003292363,0.000013386994,0.00007237383,0.00021142453,0.0029972224,0.00052540423],"genre_scores_gemma":[0.2583175,0.00018063911,0.73551065,0.00015206175,0.000067912886,0.00065283885,0.0013802493,0.0016555253,0.00208264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99639505,0.00071651064,0.00019223182,0.00085350906,0.001625717,0.00021700632],"domain_scores_gemma":[0.9912368,0.0031140118,0.0011868263,0.0031352197,0.0011087722,0.00021842058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022204511,0.0015765227,0.0011844869,0.002279697,0.0006444483,0.0013623805,0.0020409701,0.0009850388,0.0022105249],"category_scores_gemma":[0.013178534,0.0010568288,0.0011554897,0.0020810685,0.0008535555,0.0033373733,0.002608925,0.0023478097,0.0009439178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008125825,0.0004550411,0.022589559,0.00064318674,0.00040403067,0.0005861638,0.001194047,0.25180408,0.076493405,0.045054905,0.008255104,0.59170794],"study_design_scores_gemma":[0.00003847259,0.00032371952,0.0042497036,0.00006119789,0.000100168356,0.00053847034,0.00010977038,0.88784647,0.049465492,0.041088805,0.016063925,0.00011379858],"about_ca_topic_score_codex":0.0014768022,"about_ca_topic_score_gemma":0.001900447,"teacher_disagreement_score":0.002279697,"about_ca_system_score_codex":0.0006177562,"about_ca_system_score_gemma":0.0014961988,"threshold_uncertainty_score":0.011743009},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37483448,0.00025646982,0.62262,0.00028769037,0.000014372261,0.00003355017,0.00003113371,0.0003076948,0.0016146488],"genre_scores_gemma":[0.98030394,0.000059553884,0.019249529,0.000020273726,0.0000053570793,0.000021641637,0.000030050447,0.000015652507,0.00029397322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977916,0.00007008035,0.000009515901,0.000052847237,0.000057518137,0.000030815056],"domain_scores_gemma":[0.998771,0.0008381684,0.00016882225,0.00006645892,0.000121114565,0.00003445641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077017833,0.0005027542,0.00045701698,0.0003220617,0.0002002598,0.00042500996,0.0004675633,0.00036917094,0.00046890634],"category_scores_gemma":[0.004178087,0.00029247216,0.0002274134,0.00018165592,0.00043862223,0.00080822373,0.00037580385,0.0006462458,0.000084357336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040481234,0.00003066275,0.0010027896,0.00001756009,0.0000068485992,0.000014144878,0.000023177065,0.9795654,0.001626367,0.0016526136,0.000111112175,0.015908891],"study_design_scores_gemma":[0.0000017257499,0.000016992808,0.00011655058,0.0000014763206,9.0358304e-7,0.0000029903547,0.0000038508024,0.99828017,0.00043150975,0.0011164128,0.000026093447,0.0000014133519],"about_ca_topic_score_codex":0.0024760938,"about_ca_topic_score_gemma":0.0023283262,"teacher_disagreement_score":0.0024760938,"about_ca_system_score_codex":0.00054199505,"about_ca_system_score_gemma":0.000703264,"threshold_uncertainty_score":0.0049233437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015037252,0.089654006,0.76380914,0.0019672187,0.0009934041,0.00043420302,0.0011452149,0.004654955,0.12230469],"genre_scores_gemma":[0.15183029,0.12544009,0.64144665,0.0029337471,0.0009894369,0.00079847354,0.00307272,0.0027554238,0.070733234],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99727434,0.00044363807,0.00030262594,0.0003104354,0.0014794044,0.00018951505],"domain_scores_gemma":[0.99745303,0.000799676,0.00022597816,0.00052958383,0.00087178237,0.00011995282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021366207,0.0019979912,0.0008932648,0.004657227,0.00069306797,0.0034754535,0.003984126,0.0016900718,0.015387194],"category_scores_gemma":[0.004951673,0.0013518191,0.0014985151,0.0073706554,0.0009432031,0.0035094232,0.0016284775,0.0019145336,0.0064727315],"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.00023675287,0.00008338832,0.0018346639,0.0030604529,0.0000850747,0.00030137144,0.0006408915,0.020100905,0.00927321,0.11981393,0.028979965,0.8155894],"study_design_scores_gemma":[0.00008174368,0.00040034513,0.00096127787,0.0013336511,0.00012867963,0.0026877979,0.0004071413,0.044162523,0.012206363,0.074508764,0.8629608,0.00016095956],"about_ca_topic_score_codex":0.0011967522,"about_ca_topic_score_gemma":0.0016099893,"teacher_disagreement_score":0.015387194,"about_ca_system_score_codex":0.0013404238,"about_ca_system_score_gemma":0.0009124668,"threshold_uncertainty_score":0.051475346},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30679294,0.0005827587,0.6659336,0.0004843746,0.00021156219,0.00014523257,0.00025137136,0.01848135,0.007116845],"genre_scores_gemma":[0.6001059,0.00023402732,0.3968172,0.0001235011,0.00007608015,0.00009528765,0.00033304206,0.0009194205,0.0012956575],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991986,0.00016900183,0.0001104514,0.00009489126,0.00030490736,0.00012218174],"domain_scores_gemma":[0.9965293,0.0013555613,0.00053583074,0.00094295014,0.0005581847,0.00007815948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001027988,0.00047663605,0.000399176,0.0006316286,0.00034722578,0.0007157851,0.00087849976,0.00040071513,0.001906877],"category_scores_gemma":[0.003937591,0.00051338144,0.00040883667,0.00053759373,0.0005041576,0.0011070225,0.00053561816,0.0008432331,0.00034988695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077755365,0.00041953634,0.009556502,0.00060224376,0.00010214489,0.00031610136,0.0004220155,0.18799363,0.40512198,0.039523065,0.007819441,0.34734574],"study_design_scores_gemma":[0.0001984194,0.00043175064,0.002476495,0.000048077338,0.00012716316,0.00021361298,0.00006520527,0.7267616,0.24453904,0.007196761,0.017893724,0.00004818291],"about_ca_topic_score_codex":0.0014188511,"about_ca_topic_score_gemma":0.0024694945,"teacher_disagreement_score":0.001906877,"about_ca_system_score_codex":0.00048466725,"about_ca_system_score_gemma":0.002438379,"threshold_uncertainty_score":0.0063791275},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010766214,0.00091101456,0.97554487,0.0008700198,0.000351218,0.00010372633,0.0001223361,0.0020211837,0.009309405],"genre_scores_gemma":[0.39882597,0.0013203138,0.5838583,0.0007354967,0.00045000052,0.00056837976,0.0002917351,0.00036547906,0.013584322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982241,0.00040939354,0.00012774492,0.00021268346,0.0008810694,0.000145032],"domain_scores_gemma":[0.99523973,0.0015907228,0.0003198332,0.001812644,0.00087277044,0.00016433405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022412466,0.00056437956,0.0006555286,0.0012331576,0.0010868157,0.0020287838,0.001962914,0.0011904162,0.0040101674],"category_scores_gemma":[0.0075571015,0.0006484326,0.00076680956,0.0010933252,0.001959426,0.002692754,0.0021585482,0.0029989234,0.000979942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005817613,0.00011375358,0.002269416,0.00029428827,0.000110445595,0.00030098815,0.0005083161,0.114902124,0.017880574,0.63083124,0.0116749015,0.2205323],"study_design_scores_gemma":[0.00016821476,0.00025676706,0.00017290041,0.00006789384,0.00008673466,0.0002645824,0.00006369343,0.6362327,0.031482305,0.26868024,0.062437035,0.00008688177],"about_ca_topic_score_codex":0.0015486269,"about_ca_topic_score_gemma":0.0023285877,"teacher_disagreement_score":0.0040101674,"about_ca_system_score_codex":0.0011016845,"about_ca_system_score_gemma":0.0020932956,"threshold_uncertainty_score":0.013415337},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025094425,0.0007237843,0.73686105,0.00037228139,0.00020850077,0.00020238057,0.0014025822,0.21932462,0.015810434],"genre_scores_gemma":[0.19717847,0.00068487873,0.7410997,0.000781222,0.00013062365,0.00060275133,0.0078094937,0.02839961,0.023313208],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991535,0.00014627796,0.000060334252,0.00012430562,0.00041337556,0.000102083904],"domain_scores_gemma":[0.998596,0.00032828114,0.00011818279,0.0004452089,0.00041579403,0.00009647316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009655508,0.0012133031,0.00060271047,0.0010385168,0.00090234214,0.0011247264,0.0037733458,0.0009996302,0.012621358],"category_scores_gemma":[0.0035923545,0.0008843392,0.0011881199,0.001496751,0.00048404906,0.001963153,0.0017518547,0.002039705,0.005999272],"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.0008160628,0.00045902812,0.007037471,0.0010203632,0.00036734997,0.0008156135,0.00046451873,0.06795231,0.08270465,0.035143442,0.26710293,0.53611636],"study_design_scores_gemma":[0.0003620253,0.00044093846,0.004233407,0.00015623898,0.00012808603,0.0010579319,0.00010184258,0.5352636,0.174142,0.02165489,0.26222995,0.00022912747],"about_ca_topic_score_codex":0.003027717,"about_ca_topic_score_gemma":0.0062475824,"teacher_disagreement_score":0.012621358,"about_ca_system_score_codex":0.0009801759,"about_ca_system_score_gemma":0.0016625071,"threshold_uncertainty_score":0.04222268},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032733865,0.00013174479,0.7594905,0.00008381783,0.00007189736,0.00022525263,0.00064349774,0.23347007,0.0026098695],"genre_scores_gemma":[0.2903422,0.00070555054,0.5814449,0.0010413558,0.00024107401,0.0018192241,0.006514128,0.10060398,0.017287457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973794,0.00041842065,0.00023639944,0.0004892692,0.0011116466,0.00036484422],"domain_scores_gemma":[0.9953993,0.0017208921,0.00033260093,0.0017112382,0.0005991437,0.00023692042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030422416,0.0016267373,0.0010974878,0.0011441425,0.0005530021,0.0017432211,0.0055042366,0.0014277806,0.016407033],"category_scores_gemma":[0.008722423,0.0018884157,0.0015874933,0.00059019297,0.0014974254,0.003858269,0.0041555017,0.003658129,0.006545832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027936827,0.0005349845,0.010198949,0.0018276369,0.00052616367,0.0017163509,0.0017164507,0.08985941,0.08878805,0.07732128,0.18613605,0.538581],"study_design_scores_gemma":[0.00043597116,0.0005693905,0.0046450626,0.00040141647,0.00016021934,0.0012531615,0.00012794342,0.56555974,0.13314193,0.04723399,0.2459897,0.00048156033],"about_ca_topic_score_codex":0.0025193503,"about_ca_topic_score_gemma":0.0020745776,"teacher_disagreement_score":0.016407033,"about_ca_system_score_codex":0.001088862,"about_ca_system_score_gemma":0.0014361208,"threshold_uncertainty_score":0.054886997},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0147394715,0.0009527674,0.86685216,0.00090602535,0.0004786246,0.0005286785,0.0017006487,0.095101394,0.018740265],"genre_scores_gemma":[0.18237022,0.0010360273,0.779004,0.00062848214,0.00031701542,0.0010470803,0.0067403154,0.01026287,0.018594045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986878,0.00023608757,0.000092350114,0.00016158208,0.0006307983,0.00019145082],"domain_scores_gemma":[0.99817705,0.0003317646,0.00014326697,0.0008117764,0.00035708814,0.00017899834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014466447,0.0010856733,0.0006920307,0.0010404746,0.0014568925,0.0016844221,0.0033994287,0.001350787,0.006958202],"category_scores_gemma":[0.004404437,0.00070325297,0.0009234832,0.0016089734,0.0009078342,0.002522547,0.0022348291,0.0021855598,0.0034371205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010109176,0.00032566066,0.006200253,0.0011681247,0.00034086435,0.0010105271,0.00093307305,0.098609254,0.05102456,0.12635092,0.29767978,0.41534615],"study_design_scores_gemma":[0.00035180853,0.00032957183,0.004818909,0.00011683472,0.00009188802,0.0005855828,0.00012274888,0.41787732,0.05359333,0.07583758,0.44603258,0.00024185545],"about_ca_topic_score_codex":0.0049664285,"about_ca_topic_score_gemma":0.0040214583,"teacher_disagreement_score":0.006958202,"about_ca_system_score_codex":0.0007827396,"about_ca_system_score_gemma":0.0018558211,"threshold_uncertainty_score":0.02327758},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17411171,0.000530613,0.73382,0.00041151256,0.00023310607,0.00013622422,0.00034452815,0.07633416,0.014078193],"genre_scores_gemma":[0.76704764,0.00018747778,0.22106639,0.0002544672,0.00007636957,0.00017628157,0.0011810017,0.0047324346,0.0052779247],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989698,0.00020311496,0.00009216518,0.00017339444,0.00038034405,0.00018120305],"domain_scores_gemma":[0.9977787,0.00035447246,0.00015591792,0.0011113851,0.00043115646,0.0001683248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077777647,0.0008649391,0.0005450373,0.00059950474,0.00055692246,0.0013761648,0.0034486086,0.0006167928,0.003045939],"category_scores_gemma":[0.0037416772,0.00045384478,0.00048140253,0.0007188925,0.00059191,0.0016219405,0.0019358302,0.0013136369,0.0011664891],"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.0023612462,0.0006974345,0.016214902,0.0004296972,0.0002582008,0.0012367285,0.0009998641,0.20130761,0.29478517,0.04727216,0.04837638,0.38606057],"study_design_scores_gemma":[0.00017359012,0.00012136204,0.002335277,0.000021855409,0.0000330559,0.00015130911,0.00007232904,0.9074814,0.055684716,0.0072430545,0.026627574,0.00005447024],"about_ca_topic_score_codex":0.0034524438,"about_ca_topic_score_gemma":0.0055827596,"teacher_disagreement_score":0.0034524438,"about_ca_system_score_codex":0.001094202,"about_ca_system_score_gemma":0.0012514658,"threshold_uncertainty_score":0.010189712},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27904055,0.00052128936,0.7095167,0.00043231208,0.00004215923,0.00009445125,0.00038463323,0.0051647383,0.004803135],"genre_scores_gemma":[0.92844826,0.00019721432,0.06906207,0.00008366227,0.000019991337,0.000083480394,0.00042416074,0.0002198193,0.0014613024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997216,0.000053280957,0.000012369558,0.00008280555,0.00009971847,0.000030215224],"domain_scores_gemma":[0.99918526,0.00040112238,0.000113276605,0.00012268065,0.00015743617,0.000020148831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032340197,0.00095866807,0.0005037515,0.00075961516,0.0002679088,0.00066580664,0.0010702494,0.00057228445,0.00093119574],"category_scores_gemma":[0.0034046278,0.00045956954,0.00043406844,0.0008071524,0.00043293493,0.0012444301,0.0004029901,0.0009272091,0.00038390871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028021825,0.000045917743,0.002847473,0.000021563019,0.000025504529,0.000019658628,0.00001605415,0.9653975,0.0014615699,0.0006595912,0.00062987296,0.02884731],"study_design_scores_gemma":[0.0000013393627,0.000005743782,0.00028245195,0.0000012706156,0.0000015397267,0.000004524356,0.0000014963118,0.9984723,0.0006804152,0.00045202594,0.00009493004,0.0000019585802],"about_ca_topic_score_codex":0.011104306,"about_ca_topic_score_gemma":0.008498062,"teacher_disagreement_score":0.011104306,"about_ca_system_score_codex":0.00094208046,"about_ca_system_score_gemma":0.0006887771,"threshold_uncertainty_score":0.022079349},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039384887,0.0013250022,0.8131635,0.00052874914,0.0014003757,0.00060685904,0.0029345942,0.09977263,0.040883336],"genre_scores_gemma":[0.21941592,0.0013031926,0.7321409,0.0006750231,0.0003363147,0.000975767,0.0099101355,0.013645937,0.021596795],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980647,0.00021937754,0.00016896855,0.00015140262,0.0012497223,0.0001457667],"domain_scores_gemma":[0.99795425,0.0003818589,0.00012435275,0.00061042875,0.0008283372,0.00010078339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011618083,0.001286909,0.0007938728,0.0012685789,0.00047243026,0.0011842714,0.0035029775,0.0006468882,0.012124018],"category_scores_gemma":[0.0042108865,0.0009082149,0.0012406985,0.001092942,0.00021627129,0.0019881034,0.0015338748,0.002178162,0.005058755],"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.000804668,0.0010238838,0.004624053,0.0010379952,0.00041398447,0.0010157344,0.00025908905,0.28364226,0.07148037,0.04747555,0.10997292,0.47824943],"study_design_scores_gemma":[0.00031097865,0.00032954215,0.0013040446,0.00008660749,0.000116107694,0.00047581905,0.000028100258,0.6729579,0.048528004,0.015997881,0.2596901,0.00017489587],"about_ca_topic_score_codex":0.0015512338,"about_ca_topic_score_gemma":0.0024238683,"teacher_disagreement_score":0.012124018,"about_ca_system_score_codex":0.0006021331,"about_ca_system_score_gemma":0.0010193902,"threshold_uncertainty_score":0.040558934},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055324533,0.00038661622,0.7514746,0.007004132,0.002336751,0.0003144505,0.0038722104,0.053370014,0.17570879],"genre_scores_gemma":[0.14351858,0.0010929714,0.5777655,0.009370737,0.0019354388,0.00083497044,0.010957674,0.029050875,0.22547324],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973349,0.0004333158,0.00022573904,0.000490254,0.0012820347,0.00023377374],"domain_scores_gemma":[0.9923469,0.0017041588,0.00039946253,0.0028288541,0.0024597887,0.00026082294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002733741,0.0009799948,0.0007729152,0.0015241064,0.0016082046,0.004059191,0.0022865268,0.0016472318,0.08583035],"category_scores_gemma":[0.007830453,0.0007312814,0.0008760552,0.0022741118,0.002187728,0.0038471862,0.0031260548,0.0026800474,0.040832635],"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.00026560723,0.00009422959,0.0010166718,0.00047571128,0.000048753955,0.00053310674,0.00027907194,0.0075140246,0.014161301,0.24182855,0.44617677,0.28760615],"study_design_scores_gemma":[0.00006223911,0.00006449668,0.0008784864,0.00016909424,0.00002771239,0.0007330619,0.00007175041,0.04672773,0.021680588,0.11809883,0.81139594,0.00009014868],"about_ca_topic_score_codex":0.008640848,"about_ca_topic_score_gemma":0.015388401,"teacher_disagreement_score":0.08583035,"about_ca_system_score_codex":0.0022772017,"about_ca_system_score_gemma":0.0030460416,"threshold_uncertainty_score":0.2871312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18012264,0.00033259243,0.8091723,0.00026087635,0.00024654515,0.00017445328,0.00012292525,0.0035546117,0.0060131135],"genre_scores_gemma":[0.7469136,0.00015343305,0.24668725,0.00007246158,0.00011492274,0.00018332351,0.00023674464,0.0006538699,0.0049843146],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940777,0.00015037591,0.000060877424,0.00009030126,0.00017084702,0.0001198283],"domain_scores_gemma":[0.9980102,0.00032585097,0.00023218773,0.0010133006,0.0002814132,0.00013708786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008658329,0.0005223931,0.00051610573,0.00043624,0.00068227394,0.00061863736,0.0013194524,0.00027286832,0.002435983],"category_scores_gemma":[0.002252177,0.00019016094,0.0002963541,0.0006480659,0.0005340152,0.00126398,0.001299042,0.000915598,0.0006555692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018216011,0.00050037686,0.0078899395,0.0003321288,0.00014470665,0.00036479233,0.0011578199,0.18499456,0.46117708,0.05073452,0.0065406845,0.2843418],"study_design_scores_gemma":[0.00012085183,0.0007580567,0.0043284977,0.00002359434,0.000083249695,0.0002623457,0.0002569941,0.73076165,0.2153748,0.0152074,0.032751773,0.00007079745],"about_ca_topic_score_codex":0.000533539,"about_ca_topic_score_gemma":0.001264758,"teacher_disagreement_score":0.002435983,"about_ca_system_score_codex":0.00046429402,"about_ca_system_score_gemma":0.0012441599,"threshold_uncertainty_score":0.008149147},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64665824,0.0076901936,0.33383247,0.00062789355,0.00012571842,0.00006613205,0.00006449945,0.0007780784,0.010156683],"genre_scores_gemma":[0.9863027,0.00060855265,0.012095875,0.00004474639,0.00003341734,0.000011003572,0.000021591295,0.00003418812,0.0008480193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997421,0.000050435276,0.000018072515,0.0000443907,0.00009954027,0.00004546394],"domain_scores_gemma":[0.99973744,0.00008604082,0.00003589939,0.00004294239,0.0000794767,0.000018151435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026170808,0.0002511001,0.00023286238,0.00030665533,0.00028649028,0.00061996805,0.00047744202,0.00014756397,0.0008806629],"category_scores_gemma":[0.00068403606,0.00013593558,0.00016414117,0.00042964707,0.00023877245,0.0008982607,0.0004027681,0.00021198396,0.00014424088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087894936,0.0001701245,0.005381815,0.00038574554,0.00008072283,0.00038135838,0.0003454462,0.15332271,0.29769257,0.014810885,0.0025148962,0.52403474],"study_design_scores_gemma":[0.00008864827,0.0013490763,0.0047612255,0.000051097224,0.00013180666,0.00072226377,0.00024465274,0.8405146,0.1256621,0.01295086,0.013497204,0.00002645911],"about_ca_topic_score_codex":0.00041921687,"about_ca_topic_score_gemma":0.0008403403,"teacher_disagreement_score":0.0008806629,"about_ca_system_score_codex":0.00021143773,"about_ca_system_score_gemma":0.00034884643,"threshold_uncertainty_score":0.0029460788},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002698108,0.000045235247,0.9941982,0.00003877439,0.00001783956,0.00006696612,0.000025269312,0.00056196004,0.0023477399],"genre_scores_gemma":[0.17992298,0.00021935628,0.8142917,0.00013403982,0.00002673581,0.00039214824,0.00014247144,0.00026897708,0.004601533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993563,0.00013093288,0.00004243162,0.00008271832,0.00033137095,0.00005615859],"domain_scores_gemma":[0.9996569,0.00008596254,0.00004353097,0.00009436629,0.00010786572,0.00001144567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061255286,0.00050479744,0.00030587922,0.0004908602,0.0003936187,0.0008997773,0.0013429577,0.00044928287,0.0045780432],"category_scores_gemma":[0.00086294283,0.0004074387,0.00063026417,0.00046799984,0.00071074354,0.00077363296,0.000600561,0.00089386967,0.0010114084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014628195,0.00012332258,0.00078359555,0.0008705243,0.0001413433,0.0005177088,0.00048702676,0.30899668,0.14982495,0.31066057,0.0054606423,0.22198738],"study_design_scores_gemma":[0.000080512116,0.00035019193,0.00021517927,0.00006551872,0.000073584066,0.00032740214,0.000053230793,0.751464,0.13897926,0.03983425,0.06851443,0.000042352363],"about_ca_topic_score_codex":0.0012274472,"about_ca_topic_score_gemma":0.001714613,"teacher_disagreement_score":0.0045780432,"about_ca_system_score_codex":0.00074503646,"about_ca_system_score_gemma":0.0015402692,"threshold_uncertainty_score":0.015315115},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6544222,0.002799963,0.33342943,0.0003233123,0.000090325324,0.00018939201,0.000100132354,0.0013101293,0.007335033],"genre_scores_gemma":[0.90034103,0.00057234085,0.09688944,0.000073086354,0.000021353932,0.000068565816,0.000078182544,0.00008955812,0.0018664874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997602,0.00008030004,0.000016955759,0.000021202484,0.00008169263,0.00003967788],"domain_scores_gemma":[0.99931276,0.00037004004,0.00011744477,0.00005181716,0.00011408209,0.000033811128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040551368,0.0003836526,0.00023352851,0.0004396614,0.00030788127,0.00052161043,0.00042132524,0.00013416391,0.0017495936],"category_scores_gemma":[0.0012483555,0.0002057118,0.00022097497,0.0002898418,0.00021167332,0.0005064954,0.00022472577,0.00030146935,0.00021210103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014130673,0.00036110257,0.0063319746,0.0006645634,0.00009294617,0.0003872942,0.00052560767,0.30815732,0.16460487,0.021551443,0.0030547634,0.492855],"study_design_scores_gemma":[0.00026657264,0.0020198873,0.0032654016,0.00006136183,0.00015010363,0.0003153318,0.00027229683,0.86579967,0.09997371,0.012486129,0.015349146,0.0000404062],"about_ca_topic_score_codex":0.0009690735,"about_ca_topic_score_gemma":0.0029736594,"teacher_disagreement_score":0.0017495936,"about_ca_system_score_codex":0.00043352236,"about_ca_system_score_gemma":0.0013063847,"threshold_uncertainty_score":0.0058529973},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050377473,0.002613801,0.72219634,0.001104829,0.0024736177,0.0005521293,0.0047112983,0.026133657,0.18983681],"genre_scores_gemma":[0.2570991,0.0015540824,0.56077737,0.00083394325,0.00033685836,0.00063372275,0.006396989,0.0048720404,0.1674959],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994981,0.0000627882,0.000043915148,0.0001446366,0.00014939645,0.00010099785],"domain_scores_gemma":[0.9990928,0.00014073,0.00005322404,0.0003497951,0.0002808258,0.00008262367],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035448026,0.00062750914,0.0005397985,0.00080582633,0.0012554941,0.0016335555,0.0012074531,0.0004798229,0.034968615],"category_scores_gemma":[0.0012659681,0.0003427748,0.00053857797,0.0011106393,0.0003586573,0.0016914731,0.0019470026,0.00071065716,0.011479371],"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.00067680085,0.00014293303,0.001546444,0.00074139814,0.00007058148,0.00041455892,0.00030769483,0.013376242,0.031345572,0.23233248,0.098006815,0.62103844],"study_design_scores_gemma":[0.0001016624,0.0003483656,0.0007319113,0.00022068014,0.00008126673,0.0010507593,0.00025218932,0.06903297,0.07937814,0.16711725,0.6816088,0.000075916636],"about_ca_topic_score_codex":0.0011154409,"about_ca_topic_score_gemma":0.003349659,"teacher_disagreement_score":0.9650314,"about_ca_system_score_codex":0.0007782169,"about_ca_system_score_gemma":0.0011872737,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035887085,0.06429909,0.57472456,0.03412789,0.0043338644,0.00009513053,0.00020966884,0.0022685607,0.28405422],"genre_scores_gemma":[0.56848353,0.043319438,0.28881222,0.0028339103,0.0030797424,0.0002914824,0.0003567693,0.00043300618,0.09238989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99978954,0.00004847102,0.0000066184807,0.000031498792,0.00009872127,0.000025154399],"domain_scores_gemma":[0.9997888,0.00005637262,0.000017239767,0.000049938422,0.000046559628,0.000041026626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037212562,0.00032604762,0.00032652728,0.00027218263,0.00077424507,0.0012975681,0.00057192263,0.0008395971,0.0071674692],"category_scores_gemma":[0.0011736528,0.00019929007,0.00021322517,0.00042426374,0.00091629237,0.0021407562,0.0016598373,0.0024647075,0.0017321819],"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.00004701518,0.000021494616,0.00018165154,0.00012737015,0.0000143337065,0.00008008771,0.00011858002,0.013921599,0.0033336324,0.8529393,0.03279033,0.09642456],"study_design_scores_gemma":[0.000016550619,0.00003552283,0.00019759641,0.000066939436,0.0000058373107,0.00009911232,0.00003734566,0.030870873,0.00098177,0.7670891,0.20058796,0.000011479136],"about_ca_topic_score_codex":0.00030464292,"about_ca_topic_score_gemma":0.00047892777,"teacher_disagreement_score":0.0071674692,"about_ca_system_score_codex":0.0005985284,"about_ca_system_score_gemma":0.0005145231,"threshold_uncertainty_score":0.023977518},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0150688505,0.0005091288,0.96578246,0.0010633793,0.00009694596,0.00017878412,0.00013727241,0.008417304,0.008745888],"genre_scores_gemma":[0.18298306,0.00041936594,0.8090552,0.0004831026,0.000103124454,0.00045996447,0.0008034088,0.0017433831,0.003949461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99408334,0.002156414,0.0002903119,0.0013835188,0.0016609438,0.00042549142],"domain_scores_gemma":[0.9868607,0.0045078043,0.0005458734,0.0063132904,0.0011263086,0.00064599246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009217244,0.0013326647,0.0010850783,0.001724524,0.001202117,0.0041280733,0.004392368,0.0030970897,0.005016052],"category_scores_gemma":[0.024692876,0.0009996769,0.0015049127,0.0013458822,0.0023964767,0.0061899093,0.007881813,0.0032825365,0.0021744953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004152408,0.0009280914,0.005261417,0.0009086172,0.0003748182,0.0005067096,0.0024927913,0.21235041,0.02643857,0.11406609,0.026144123,0.61011314],"study_design_scores_gemma":[0.000102015074,0.00020796948,0.00096949405,0.00019141074,0.00008961732,0.00026418184,0.000383227,0.7349554,0.013811208,0.18948375,0.05944356,0.00009817517],"about_ca_topic_score_codex":0.0014332011,"about_ca_topic_score_gemma":0.0018962792,"teacher_disagreement_score":0.009217244,"about_ca_system_score_codex":0.0011003148,"about_ca_system_score_gemma":0.002498405,"threshold_uncertainty_score":0.04874605},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6731722,0.005933611,0.27158386,0.0019035474,0.00039148892,0.000101705285,0.000203007,0.004357835,0.04235282],"genre_scores_gemma":[0.9749585,0.00046854353,0.02190483,0.00017710942,0.00013788021,0.000024877718,0.000051105962,0.00016698708,0.0021102414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999204,0.00017242611,0.00002969933,0.000099067554,0.00025132942,0.00024354644],"domain_scores_gemma":[0.996539,0.0015162138,0.0003668735,0.00061614375,0.0007524763,0.00020934208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010824446,0.00086493994,0.00064922404,0.0007180866,0.0004472792,0.0007485913,0.00091859483,0.0005224023,0.003739397],"category_scores_gemma":[0.004752966,0.00028140235,0.00029766146,0.0008771578,0.000494003,0.0011721463,0.0008791718,0.0009584384,0.0010989859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012991633,0.0003246606,0.006593685,0.00037982577,0.00007715532,0.00063743535,0.00024354014,0.45784926,0.2097835,0.033670813,0.011831696,0.27730933],"study_design_scores_gemma":[0.00005259639,0.00072193565,0.0018460219,0.00003631964,0.000059373677,0.0004327301,0.00007532957,0.9177806,0.058298927,0.01492642,0.005742828,0.000026879112],"about_ca_topic_score_codex":0.0006715965,"about_ca_topic_score_gemma":0.0008164063,"teacher_disagreement_score":0.003739397,"about_ca_system_score_codex":0.00058151444,"about_ca_system_score_gemma":0.0007591506,"threshold_uncertainty_score":0.012509525},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18951441,0.00046908716,0.8078004,0.00032987507,0.00006676162,0.000022099177,0.00007029195,0.0004525527,0.0012744954],"genre_scores_gemma":[0.95947915,0.00017199942,0.039325096,0.000038840906,0.000065498076,0.000025405581,0.00006601701,0.000048469115,0.0007795377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999564,0.00016362597,0.000018917684,0.00010140486,0.00011466243,0.00003741043],"domain_scores_gemma":[0.99656206,0.002618202,0.00024386855,0.000290576,0.00023841932,0.000046781202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009513181,0.00037386495,0.00042643058,0.00045320083,0.00024944553,0.0005832182,0.0008662645,0.00062099175,0.00053782976],"category_scores_gemma":[0.009228159,0.00033508873,0.00018373728,0.00074275094,0.0007116165,0.0011225941,0.000490529,0.0009400151,0.00014622507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000152139,0.000074675154,0.007402245,0.000034783185,0.0000434991,0.000038656523,0.000050407078,0.9132917,0.004248233,0.00722541,0.00068974966,0.06674843],"study_design_scores_gemma":[0.0000023145928,0.000006439863,0.0012788158,0.000001257971,0.000001935974,0.0000062331037,0.0000028151014,0.9949864,0.00073161145,0.0029159903,0.00006280891,0.0000033234753],"about_ca_topic_score_codex":0.003839641,"about_ca_topic_score_gemma":0.003602879,"teacher_disagreement_score":0.003839641,"about_ca_system_score_codex":0.00050401443,"about_ca_system_score_gemma":0.00036425953,"threshold_uncertainty_score":0.00763458},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5153725,0.002644395,0.46621364,0.00030090907,0.00011995767,0.00009305518,0.00027829673,0.005394666,0.009582572],"genre_scores_gemma":[0.88670623,0.00046841125,0.10590063,0.00006735906,0.000031700954,0.00003921802,0.00021402829,0.00009334737,0.0064789644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978274,0.000034037566,0.0000126204595,0.000027519385,0.00010477701,0.000038343733],"domain_scores_gemma":[0.99961495,0.0001481456,0.00007924651,0.000058847712,0.00007511542,0.000023678305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015695677,0.00041217115,0.00023625989,0.0004385731,0.00020455137,0.000565853,0.0007571432,0.0001899915,0.004205452],"category_scores_gemma":[0.00084980257,0.00025031558,0.00009753387,0.000498973,0.00015987518,0.000710453,0.0002853204,0.0004523674,0.0008516423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001121443,0.00015805314,0.0083955405,0.00047518904,0.00006011534,0.00030692495,0.0000897545,0.11350906,0.17067778,0.010033769,0.0063938834,0.68877846],"study_design_scores_gemma":[0.00011286733,0.0008418755,0.005809076,0.00007473976,0.000066994886,0.00033194126,0.00007859282,0.7834469,0.18876635,0.004216147,0.016210992,0.00004348619],"about_ca_topic_score_codex":0.0012329733,"about_ca_topic_score_gemma":0.004781252,"teacher_disagreement_score":0.004205452,"about_ca_system_score_codex":0.00041871206,"about_ca_system_score_gemma":0.00096934504,"threshold_uncertainty_score":0.014068663},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99219936,0.000242302,0.004297083,0.00003981681,0.000023103259,0.00002645285,0.00009446382,0.0012704146,0.0018069057],"genre_scores_gemma":[0.99230486,0.00007610666,0.0063656815,0.000017508002,0.000007686492,0.000026590282,0.00037443524,0.00025436183,0.00057271245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725336,0.0005264292,0.00022392492,0.00053670665,0.00089690706,0.000562593],"domain_scores_gemma":[0.9892917,0.004833221,0.0009500818,0.0027192303,0.001794906,0.00041086413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015369824,0.0009086018,0.00047861354,0.00089063356,0.0004937462,0.0010807425,0.0018847658,0.00063192425,0.0012689945],"category_scores_gemma":[0.012845359,0.0004536086,0.0003925562,0.0013698804,0.0010873968,0.0017278938,0.0008547263,0.0010087456,0.00039450475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039450605,0.0012648574,0.08975168,0.00085009856,0.00037796737,0.0007442662,0.0022214036,0.46604207,0.217824,0.012951517,0.00570092,0.19832607],"study_design_scores_gemma":[0.00012300728,0.0016574922,0.032835145,0.00006177795,0.00013807148,0.00028132167,0.00040793756,0.7760918,0.18084982,0.002657008,0.004807335,0.0000893305],"about_ca_topic_score_codex":0.0028222317,"about_ca_topic_score_gemma":0.0014914541,"teacher_disagreement_score":0.0028222317,"about_ca_system_score_codex":0.0011487264,"about_ca_system_score_gemma":0.00091194914,"threshold_uncertainty_score":0.008334637},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061173066,0.0066177896,0.83278173,0.002444744,0.0023629481,0.0002835839,0.00065359694,0.0075160535,0.14122222],"genre_scores_gemma":[0.2490561,0.010847795,0.61991584,0.0018893349,0.0020104137,0.0012588409,0.0025268584,0.0020604017,0.110434525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988142,0.00025299133,0.00006754177,0.00023756028,0.00047848932,0.00014915534],"domain_scores_gemma":[0.9991543,0.00018078925,0.00004078057,0.00032964334,0.00022196607,0.00007248427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007114161,0.0010576647,0.0011206383,0.0009389638,0.001381495,0.003332061,0.0016655972,0.0010331479,0.022459911],"category_scores_gemma":[0.002973415,0.0004930386,0.00093331735,0.0014715826,0.0007798716,0.0023297553,0.002904188,0.0014664263,0.011682936],"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.00029539922,0.000087327426,0.00076434924,0.00046910247,0.000116804535,0.00037264926,0.00031806587,0.03679981,0.007186188,0.5672678,0.0815551,0.30476743],"study_design_scores_gemma":[0.00010354174,0.00011310574,0.00031914143,0.0001465077,0.000048517744,0.00048773576,0.00009992672,0.13148719,0.007936849,0.26391152,0.5952939,0.000052147785],"about_ca_topic_score_codex":0.0010556113,"about_ca_topic_score_gemma":0.0010718211,"teacher_disagreement_score":0.022459911,"about_ca_system_score_codex":0.0009598507,"about_ca_system_score_gemma":0.0009820655,"threshold_uncertainty_score":0.075135946},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040441856,0.00020364804,0.93285096,0.00020709111,0.000051200506,0.00008856294,0.00009751182,0.014984716,0.011074503],"genre_scores_gemma":[0.5940879,0.00029253418,0.39283338,0.00017353256,0.00007678614,0.00028932217,0.00047116366,0.0014282658,0.010347053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994912,0.000113440175,0.00003662419,0.00007977831,0.00019202795,0.00008692942],"domain_scores_gemma":[0.999406,0.00012261886,0.000055448145,0.0002827479,0.000090440975,0.000042861186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000599779,0.0004536192,0.0004149355,0.0004137724,0.00048284695,0.0011441937,0.002127636,0.0004248372,0.006607448],"category_scores_gemma":[0.0012046123,0.000338295,0.00045285403,0.00045422517,0.00062633055,0.0024833821,0.0014780731,0.0011099607,0.0011817805],"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.00092097884,0.00038067234,0.003344932,0.0004885194,0.0001331914,0.0005910406,0.00091316405,0.10548064,0.09598632,0.39675108,0.020330042,0.3746794],"study_design_scores_gemma":[0.00032174253,0.0007264305,0.0014656215,0.00011401993,0.00014197482,0.0005516994,0.00021549784,0.6508897,0.14618501,0.06602831,0.13324848,0.0001114608],"about_ca_topic_score_codex":0.0014852415,"about_ca_topic_score_gemma":0.0024005224,"teacher_disagreement_score":0.006607448,"about_ca_system_score_codex":0.00083806046,"about_ca_system_score_gemma":0.0009805968,"threshold_uncertainty_score":0.022104084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026120357,0.0007311453,0.9677816,0.00072393223,0.00006494521,0.00008334367,0.000014013663,0.00022823246,0.004252547],"genre_scores_gemma":[0.74905777,0.0006379574,0.2454347,0.000197341,0.0001632604,0.0001746461,0.000031449148,0.000090499074,0.0042124046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997971,0.0006707069,0.00007873801,0.00027334635,0.00076644553,0.0002398322],"domain_scores_gemma":[0.99624974,0.0014354046,0.00028106527,0.0011482165,0.0007510414,0.00013451042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018684631,0.00086836895,0.0009100058,0.0007218936,0.000896967,0.0012981329,0.0027635216,0.0012910763,0.0024012635],"category_scores_gemma":[0.0052145696,0.00053534354,0.0006815825,0.00084466697,0.0013885915,0.0036883575,0.0023269043,0.0015456274,0.00037371172],"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.00024668314,0.00031393525,0.0037082694,0.00045894785,0.00018933586,0.0009837179,0.00069133274,0.52066976,0.032272376,0.15523346,0.0047691953,0.280463],"study_design_scores_gemma":[0.000036251247,0.00011661718,0.00030047767,0.000024066392,0.000045003166,0.00020287989,0.00010267197,0.95884985,0.003657863,0.03255052,0.004094833,0.000018985158],"about_ca_topic_score_codex":0.0020973245,"about_ca_topic_score_gemma":0.002893026,"teacher_disagreement_score":0.0027635216,"about_ca_system_score_codex":0.00080997887,"about_ca_system_score_gemma":0.002136212,"threshold_uncertainty_score":0.009881437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37979874,0.0009766665,0.60982084,0.00030216112,0.000070093745,0.00017102045,0.00006418358,0.0043369434,0.0044592763],"genre_scores_gemma":[0.8662871,0.00043334306,0.1276518,0.00008815325,0.0000642597,0.00011211836,0.00008870503,0.0003497358,0.004924822],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931276,0.000170939,0.000052906526,0.000063260224,0.00023450668,0.00016556114],"domain_scores_gemma":[0.9962257,0.0014058059,0.00053630257,0.0013594192,0.00036158317,0.000111079346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010217149,0.00062708405,0.00052102504,0.0003778929,0.00063946715,0.0011163779,0.0017203268,0.0005858858,0.0018975448],"category_scores_gemma":[0.004582654,0.00038255475,0.00031182286,0.0006635418,0.0006875798,0.0032031622,0.0013979512,0.0008215785,0.000514127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028131045,0.0007567737,0.0086288825,0.0011289399,0.00017769689,0.0011358601,0.0021350984,0.1932806,0.4721202,0.09711885,0.0038134623,0.21689062],"study_design_scores_gemma":[0.00032574957,0.0015758261,0.002305822,0.00006185155,0.000336867,0.0008402113,0.00035115288,0.49498144,0.45558771,0.022655249,0.020887088,0.00009101921],"about_ca_topic_score_codex":0.0011781292,"about_ca_topic_score_gemma":0.0021063236,"teacher_disagreement_score":0.0018975448,"about_ca_system_score_codex":0.0005692686,"about_ca_system_score_gemma":0.0010442173,"threshold_uncertainty_score":0.0063478947},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034361205,0.00021108046,0.8147648,0.00010394656,0.00005762469,0.00011487568,0.00086397433,0.17827705,0.0021705013],"genre_scores_gemma":[0.20669861,0.00058085413,0.75102127,0.0006781039,0.00014052549,0.0008665606,0.0036094782,0.030726066,0.005678561],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967553,0.000729666,0.0003232315,0.0006273692,0.0011796546,0.0003848373],"domain_scores_gemma":[0.99500114,0.0028391215,0.0005295633,0.0010561062,0.00046159606,0.00011234565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002540177,0.0018496185,0.0009872076,0.0018108642,0.000509263,0.001738717,0.003145752,0.0013239753,0.013728343],"category_scores_gemma":[0.010087052,0.0013145962,0.0017931918,0.0008421238,0.0013216276,0.002936892,0.002505332,0.0025434352,0.0040459977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018528879,0.00034723844,0.005701959,0.0028762533,0.0005085514,0.0018927278,0.0009161349,0.115505934,0.092603765,0.11753154,0.0986998,0.5615632],"study_design_scores_gemma":[0.00042602344,0.00036432745,0.0018036766,0.0006131985,0.00018360376,0.0012391276,0.0000895135,0.6289204,0.18866628,0.057302218,0.12007385,0.00031784177],"about_ca_topic_score_codex":0.002349763,"about_ca_topic_score_gemma":0.002502506,"teacher_disagreement_score":0.013728343,"about_ca_system_score_codex":0.0008346941,"about_ca_system_score_gemma":0.0019121579,"threshold_uncertainty_score":0.045925915},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6383252,0.0009030395,0.35296473,0.00022938047,0.00007228544,0.000054870216,0.00009069574,0.0015743702,0.0057853702],"genre_scores_gemma":[0.96576256,0.00017035335,0.03321525,0.000027554637,0.000009597223,0.00002709435,0.00006972703,0.00003621906,0.0006816305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998629,0.000035524437,0.000007095868,0.000029034294,0.00004208084,0.000023263592],"domain_scores_gemma":[0.9997154,0.00009244443,0.000038041468,0.00007584065,0.000054549342,0.000023714809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024202855,0.00034302962,0.00029152873,0.00026707153,0.00038671558,0.00040240315,0.0006991466,0.00019251714,0.0007738903],"category_scores_gemma":[0.00059027143,0.00018470582,0.000275738,0.00046227474,0.00046275128,0.00069477607,0.00038244264,0.00030185157,0.00007249003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005769279,0.000104949206,0.006567354,0.0001776032,0.00011516966,0.00037948097,0.00020809118,0.8198483,0.08498861,0.03178836,0.0015552859,0.05368988],"study_design_scores_gemma":[0.000012941361,0.000048536887,0.00035748765,0.0000017276241,0.000011024454,0.000012867203,0.000010830921,0.98977697,0.0069922595,0.0022496365,0.00052176224,0.000003975148],"about_ca_topic_score_codex":0.0033263082,"about_ca_topic_score_gemma":0.0034009507,"teacher_disagreement_score":0.0033263082,"about_ca_system_score_codex":0.00050334854,"about_ca_system_score_gemma":0.00069251034,"threshold_uncertainty_score":0.0066138506},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32433683,0.0025292507,0.58546644,0.003036867,0.0005687144,0.00023930769,0.00047270674,0.030689279,0.052660555],"genre_scores_gemma":[0.8063558,0.001014899,0.17742817,0.0006098408,0.00017305736,0.00026598305,0.000772581,0.0015630701,0.011816657],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99684936,0.00096565654,0.00015434877,0.00044153884,0.00086113065,0.0007279294],"domain_scores_gemma":[0.9944665,0.0018393575,0.00044656487,0.0020887554,0.00084314664,0.00031576506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017523416,0.0013536368,0.00069496455,0.0009626522,0.0018235502,0.002545111,0.0025670377,0.0010667192,0.008065631],"category_scores_gemma":[0.0083821975,0.0005401037,0.00046916318,0.0016937621,0.0014109503,0.006961491,0.005540737,0.0015863299,0.0025598612],"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.0021853992,0.0008934694,0.010708566,0.0008677933,0.00014080029,0.00094809895,0.0027154787,0.29835278,0.05522648,0.15478893,0.051048845,0.42212346],"study_design_scores_gemma":[0.00038313537,0.000936645,0.0026263914,0.00014595663,0.00022336635,0.00054312224,0.001699117,0.6434222,0.085144654,0.14999455,0.114760436,0.00012047125],"about_ca_topic_score_codex":0.002795036,"about_ca_topic_score_gemma":0.0033697002,"teacher_disagreement_score":0.008065631,"about_ca_system_score_codex":0.0010666949,"about_ca_system_score_gemma":0.0023744034,"threshold_uncertainty_score":0.026982248},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57998395,0.0014761926,0.40710992,0.0004413393,0.00019412662,0.00010314846,0.00006714553,0.0015646868,0.009059388],"genre_scores_gemma":[0.9605309,0.00023450436,0.037730306,0.00009262668,0.000028330778,0.000021103882,0.000047665446,0.00006530359,0.0012494078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993765,0.000108139575,0.00002615316,0.00006919481,0.00027779123,0.00014224142],"domain_scores_gemma":[0.9983095,0.0005218298,0.00024807133,0.00043727204,0.0003685713,0.000114808085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005552568,0.00035470747,0.00033329116,0.0003589617,0.0005517556,0.0006798743,0.0011167874,0.00033785685,0.00091466156],"category_scores_gemma":[0.0023364339,0.00023670452,0.00023309297,0.00054878514,0.0004270668,0.0009923395,0.00048562427,0.0005516593,0.00022072776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010338366,0.00048150436,0.01115141,0.00023649639,0.00011257429,0.00022808994,0.0003686147,0.5016566,0.13687503,0.028034067,0.0052660387,0.31455573],"study_design_scores_gemma":[0.00004412365,0.00021736139,0.0012122721,0.000008370694,0.000024374436,0.000078329016,0.000038511436,0.96776956,0.024935089,0.0028814026,0.0027707256,0.00001990714],"about_ca_topic_score_codex":0.003950087,"about_ca_topic_score_gemma":0.007868997,"teacher_disagreement_score":0.003950087,"about_ca_system_score_codex":0.0008004454,"about_ca_system_score_gemma":0.002012854,"threshold_uncertainty_score":0.007854223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19054763,0.0007034991,0.78766507,0.00021433731,0.00016090859,0.00018687292,0.00017107604,0.007989225,0.012361322],"genre_scores_gemma":[0.73157537,0.00016758496,0.2624074,0.00012980317,0.000033656517,0.0001599595,0.00020189656,0.00039404372,0.0049303547],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99948263,0.00009035748,0.00004631984,0.00010314779,0.0001909139,0.00008662529],"domain_scores_gemma":[0.9994572,0.00011423849,0.00007997371,0.00021792269,0.00010015657,0.000030459281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004003259,0.0003536658,0.00028823575,0.0005734185,0.00046670792,0.0007545412,0.0012664795,0.00027942477,0.0026387323],"category_scores_gemma":[0.0011340977,0.00022483015,0.00033280253,0.00054156105,0.0004670477,0.0010613974,0.00079083757,0.0006670859,0.00034733253],"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.0012640199,0.0002882405,0.004328556,0.00043455826,0.0000866103,0.00039320104,0.00031298472,0.113708064,0.19387731,0.14030689,0.009315389,0.5356842],"study_design_scores_gemma":[0.00022984839,0.0011087381,0.0022436867,0.000084976375,0.00014764801,0.00041156466,0.00010735588,0.6806441,0.22940038,0.038956407,0.04656473,0.00010058747],"about_ca_topic_score_codex":0.0012917516,"about_ca_topic_score_gemma":0.0024729618,"teacher_disagreement_score":0.0026387323,"about_ca_system_score_codex":0.0007865225,"about_ca_system_score_gemma":0.0010265171,"threshold_uncertainty_score":0.008827448},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6387165,0.0016940676,0.3390415,0.00036863904,0.00011226157,0.00024418812,0.00018046646,0.008879576,0.01076284],"genre_scores_gemma":[0.8802357,0.0002084059,0.115939714,0.00014857735,0.000040903065,0.00014636891,0.00019488171,0.0002661569,0.00281928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944216,0.000083147475,0.00006541605,0.00010905342,0.0001914128,0.00010873906],"domain_scores_gemma":[0.99800223,0.00042496974,0.0003902958,0.00066215236,0.00032488548,0.00019534322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048253706,0.000599966,0.0004616406,0.0014546592,0.0006901763,0.0012604028,0.0016355633,0.0004915564,0.002551262],"category_scores_gemma":[0.0030631737,0.00042762165,0.00027968438,0.0017683256,0.0005951628,0.0021522995,0.0018921251,0.0005621829,0.0009677727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017606139,0.00069399964,0.0136978105,0.0004947632,0.00012109082,0.00051562855,0.00079193333,0.1484752,0.28298357,0.01732609,0.007855186,0.52528405],"study_design_scores_gemma":[0.00043582355,0.0023058783,0.010333106,0.00011318399,0.00024679446,0.0012734112,0.00073182007,0.68940485,0.2401112,0.02062276,0.034278095,0.00014304304],"about_ca_topic_score_codex":0.0014160811,"about_ca_topic_score_gemma":0.0039190226,"teacher_disagreement_score":0.002551262,"about_ca_system_score_codex":0.0006846922,"about_ca_system_score_gemma":0.0010807125,"threshold_uncertainty_score":0.008534789},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012028089,0.00012901204,0.7588888,0.0003064521,0.00038431675,0.00018798695,0.0015774133,0.18626375,0.040234238],"genre_scores_gemma":[0.20138489,0.0002549977,0.6498924,0.0005660666,0.00022941314,0.0007061255,0.006781766,0.09069519,0.049489208],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993542,0.000092204864,0.000038232272,0.00009932749,0.00031020472,0.00010578641],"domain_scores_gemma":[0.99905044,0.00025253117,0.000041608615,0.00037974332,0.000233416,0.000042341435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004522016,0.001176757,0.0007139539,0.0011714185,0.0011079267,0.0014775688,0.0015905118,0.0005597168,0.053018868],"category_scores_gemma":[0.0023227402,0.00070268824,0.0010374705,0.0011350272,0.00051223324,0.0013476163,0.0020611146,0.0022979665,0.025194705],"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.0007087317,0.00030090447,0.0016396152,0.00079427566,0.00015036666,0.00076040486,0.0006813096,0.016439954,0.06608032,0.063126564,0.17624448,0.67307305],"study_design_scores_gemma":[0.00037020055,0.00018431366,0.0020691098,0.00015864937,0.00014046497,0.0009993155,0.00022627693,0.2126648,0.27664936,0.08168812,0.42469802,0.00015145735],"about_ca_topic_score_codex":0.00066347286,"about_ca_topic_score_gemma":0.0009561254,"teacher_disagreement_score":0.053018868,"about_ca_system_score_codex":0.00047232152,"about_ca_system_score_gemma":0.00072265003,"threshold_uncertainty_score":0.17736578},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032353606,0.0023075799,0.009388569,0.003302961,0.004321011,0.00020569665,0.004640851,0.006302297,0.96629566],"genre_scores_gemma":[0.01695762,0.0015793521,0.005782211,0.0010011886,0.00050733326,0.00010301479,0.0063732476,0.0009282487,0.96676785],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906117,0.00011051438,0.000054592045,0.00018026934,0.0004703587,0.00012316208],"domain_scores_gemma":[0.9982356,0.00018669493,0.00007968043,0.00034306277,0.00064883695,0.00050610426],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009135315,0.0009495717,0.00067238294,0.0019639174,0.002015278,0.004296615,0.0014553346,0.0022140162,0.7071477],"category_scores_gemma":[0.0028004982,0.00047667054,0.000539601,0.0013975878,0.0005960742,0.0025565724,0.0029261378,0.0014979145,0.5006416],"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.00056145724,0.00020945138,0.0013161288,0.0005768635,0.00002441244,0.0004880505,0.0002894709,0.0005299835,0.005525782,0.030702405,0.51950955,0.4402664],"study_design_scores_gemma":[0.000021340304,0.000031154246,0.00038681805,0.000057305308,0.0000048276784,0.00024000357,0.000056754692,0.00030413977,0.0007943568,0.0033292465,0.994766,0.000007985254],"about_ca_topic_score_codex":0.0018843262,"about_ca_topic_score_gemma":0.002881359,"teacher_disagreement_score":0.29285228,"about_ca_system_score_codex":0.001060466,"about_ca_system_score_gemma":0.0019890668,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01584273,0.098713614,0.63451886,0.1768271,0.005508656,0.000063235486,0.0002978651,0.00025111155,0.06797681],"genre_scores_gemma":[0.62241685,0.076476045,0.24810317,0.011163117,0.022343623,0.0005258114,0.00032398838,0.00031682447,0.018330589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954211,0.0023243492,0.00019605216,0.00041734194,0.0014103121,0.00023079426],"domain_scores_gemma":[0.9767305,0.019274933,0.00047557228,0.0013481134,0.001535437,0.00063544814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007917574,0.0008976896,0.0026414355,0.001710287,0.0017989958,0.008490801,0.003682819,0.0055298284,0.0069953674],"category_scores_gemma":[0.02855567,0.000852684,0.0009910889,0.002788527,0.012216593,0.0119092185,0.0032286183,0.01068207,0.00082404935],"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.000010599633,0.000026646663,0.00006582225,0.00010030849,0.00000995134,0.00001731238,0.000047443005,0.006153805,0.00004694254,0.98025423,0.003976397,0.0092906],"study_design_scores_gemma":[0.000006115987,0.000006205585,0.00003072247,0.000025016285,0.0000018238193,0.000009762812,0.000033934877,0.0191036,0.000018713778,0.9756471,0.005111305,0.0000057222637],"about_ca_topic_score_codex":0.0022363341,"about_ca_topic_score_gemma":0.0014564431,"teacher_disagreement_score":0.008490801,"about_ca_system_score_codex":0.0029578647,"about_ca_system_score_gemma":0.003032524,"threshold_uncertainty_score":0.04187262},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0081588235,0.0018320108,0.5304936,0.0007656257,0.0006919497,0.0006849898,0.009451592,0.32181945,0.12610194],"genre_scores_gemma":[0.08445948,0.0026257352,0.6582039,0.0015885329,0.0005760026,0.0013173268,0.037877847,0.08616843,0.12718274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894005,0.00010207563,0.00006725382,0.00027540032,0.00050322467,0.00011194469],"domain_scores_gemma":[0.9986148,0.0003725418,0.0000861377,0.0003292788,0.00047250162,0.00012465968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009778007,0.0016169633,0.0008128204,0.0013264044,0.00078505743,0.001867127,0.0028397122,0.0010698696,0.085027166],"category_scores_gemma":[0.0043347236,0.0008504976,0.0012440782,0.0009659349,0.0006410662,0.0020730707,0.0023694795,0.0021794983,0.044026203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066917634,0.00014252655,0.0009164263,0.0010318826,0.0001158209,0.00032976046,0.00019361856,0.0095320055,0.013870553,0.024432898,0.4420201,0.5067452],"study_design_scores_gemma":[0.0002621741,0.00020616446,0.0014666904,0.0002601812,0.00007598948,0.001164188,0.000038816957,0.0759026,0.024309887,0.02165929,0.87452364,0.00013042496],"about_ca_topic_score_codex":0.0033687141,"about_ca_topic_score_gemma":0.0049434616,"teacher_disagreement_score":0.085027166,"about_ca_system_score_codex":0.00050207105,"about_ca_system_score_gemma":0.0017727569,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13421206,0.0007654177,0.8414604,0.00042345043,0.00025469993,0.000077211655,0.000115732015,0.002897788,0.019793203],"genre_scores_gemma":[0.6631248,0.0003386257,0.3227303,0.00025877036,0.000055623837,0.00008680159,0.00015829099,0.00013978886,0.013107016],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999436,0.000008727864,0.0000026793732,0.000008094974,0.000028867165,0.000008111944],"domain_scores_gemma":[0.9999306,0.000018202205,0.000008432131,0.000011452461,0.000018010467,0.000013307469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006255145,0.00020641992,0.00015590979,0.00019544814,0.00020594771,0.00041156608,0.0004689175,0.00027525393,0.0028439658],"category_scores_gemma":[0.00027912762,0.000119212586,0.00014675305,0.0002259918,0.00023433728,0.0002857655,0.00033018357,0.0005120346,0.0006981978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052266585,0.000116448144,0.0018169421,0.00028770303,0.000063438194,0.0005447819,0.00016742805,0.11161549,0.5025056,0.07332136,0.013204134,0.29583406],"study_design_scores_gemma":[0.000100722056,0.00036919658,0.0011022637,0.000027176353,0.00003158365,0.00032168566,0.00003387352,0.8634496,0.086506724,0.01461907,0.033407815,0.000030296398],"about_ca_topic_score_codex":0.00043190664,"about_ca_topic_score_gemma":0.00084130134,"teacher_disagreement_score":0.0028439658,"about_ca_system_score_codex":0.00021682441,"about_ca_system_score_gemma":0.00034874352,"threshold_uncertainty_score":0.009514034},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6616564,0.0017084546,0.31907335,0.00029228686,0.00007976304,0.00032033358,0.00008954617,0.013155272,0.0036246472],"genre_scores_gemma":[0.8854745,0.0003852129,0.11193901,0.00014117139,0.000029308092,0.00019833997,0.00008981148,0.000687918,0.0010547754],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99835974,0.0002710535,0.00019245168,0.00028154667,0.00069914316,0.00019612584],"domain_scores_gemma":[0.9933943,0.0031631857,0.0012634541,0.0013202315,0.000603,0.00025587826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001346987,0.0011366388,0.0004932019,0.0010795081,0.00062059826,0.0010021491,0.0016839547,0.0004771645,0.0006152569],"category_scores_gemma":[0.007625073,0.00057385885,0.0003643552,0.0008943062,0.0006068592,0.0019570151,0.0010505544,0.00077136635,0.00028513573],"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.0006613165,0.0006641676,0.011925212,0.0005643032,0.00006962352,0.00016018168,0.0009899845,0.045877464,0.73551697,0.0031815898,0.0009140941,0.19947505],"study_design_scores_gemma":[0.00015023514,0.0009577367,0.014924034,0.0000657531,0.00017258168,0.00029952402,0.00026611614,0.2659441,0.7042919,0.0029526977,0.0098570185,0.00011832612],"about_ca_topic_score_codex":0.0020432607,"about_ca_topic_score_gemma":0.003955165,"teacher_disagreement_score":0.0020432607,"about_ca_system_score_codex":0.0007116178,"about_ca_system_score_gemma":0.0017678012,"threshold_uncertainty_score":0.007123649},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009239704,0.00010891731,0.9867828,0.00019623486,0.000012793362,0.00012770598,0.000009836448,0.0030762951,0.0004457117],"genre_scores_gemma":[0.10591056,0.00009173212,0.8924582,0.00011783412,0.000034311444,0.00021534272,0.00006482438,0.00084095047,0.00026635846],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.8980823,0.05426777,0.008866691,0.009500753,0.025313543,0.003968922],"domain_scores_gemma":[0.84529126,0.072337516,0.011127876,0.05369618,0.013632937,0.003914273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.055367958,0.0036739137,0.004473529,0.005650138,0.001810467,0.006437913,0.0064204447,0.0044016987,0.0016451699],"category_scores_gemma":[0.09924769,0.00454557,0.0037387328,0.0029645958,0.004974616,0.017352184,0.013862248,0.0073209554,0.00085225515],"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.0015699685,0.0019051521,0.016588379,0.0006976753,0.00061489706,0.0009361104,0.003588259,0.13163969,0.11612406,0.068298936,0.0021265184,0.6559103],"study_design_scores_gemma":[0.00042277796,0.0009414487,0.0027178228,0.0003284095,0.00027260734,0.00079086696,0.0004741603,0.8027823,0.09776648,0.084757835,0.008455611,0.00028957444],"about_ca_topic_score_codex":0.0021727104,"about_ca_topic_score_gemma":0.002012579,"teacher_disagreement_score":0.055367958,"about_ca_system_score_codex":0.0022485019,"about_ca_system_score_gemma":0.0078861285,"threshold_uncertainty_score":0.2928173},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9150808,0.0030398131,0.045415975,0.0018893374,0.0001273625,0.000078633704,0.000121966936,0.00101059,0.03323553],"genre_scores_gemma":[0.96118253,0.0011510031,0.0312697,0.00018563797,0.000061937266,0.000057295452,0.00020529504,0.00054128084,0.005345318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982564,0.0007848532,0.000051869218,0.00011264401,0.0006262714,0.00016788919],"domain_scores_gemma":[0.9915976,0.006564781,0.00038915573,0.00058005995,0.00071656576,0.00015184068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001955786,0.0005814731,0.0003239157,0.00041798703,0.0008360099,0.0009770055,0.00075972127,0.0003192879,0.0022181673],"category_scores_gemma":[0.011937678,0.00028453802,0.00025574295,0.0011623219,0.0007032151,0.0018325567,0.0008640494,0.0006612877,0.0004003152],"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.0019533234,0.0007233621,0.06369713,0.001443345,0.00016692888,0.0011667109,0.001861975,0.51672137,0.13069935,0.046792407,0.009092847,0.22568126],"study_design_scores_gemma":[0.00006225023,0.00060106843,0.026471999,0.00008479823,0.00014308399,0.00039117865,0.0008053389,0.84451866,0.103585504,0.012820268,0.010469087,0.00004677183],"about_ca_topic_score_codex":0.0019519746,"about_ca_topic_score_gemma":0.0045091184,"teacher_disagreement_score":0.0022181673,"about_ca_system_score_codex":0.0006022844,"about_ca_system_score_gemma":0.00067598815,"threshold_uncertainty_score":0.010343313},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2582159,0.0015367196,0.7276601,0.0008849467,0.0004557327,0.00011447873,0.000115735085,0.0024635303,0.008552877],"genre_scores_gemma":[0.6991245,0.000563688,0.29642695,0.0001756851,0.00007889305,0.00009136283,0.0001352886,0.00041414934,0.0029893892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995721,0.00009847528,0.000040633066,0.00007667888,0.00014452032,0.000067581415],"domain_scores_gemma":[0.99861395,0.00050723075,0.00013770661,0.0003096027,0.00032905873,0.00010242704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064515194,0.00070140127,0.0004603917,0.00041108244,0.00074550096,0.0014676612,0.0010949831,0.00044868072,0.0024886276],"category_scores_gemma":[0.0049346546,0.00060003775,0.00032176892,0.0006630244,0.00041675006,0.001634363,0.0008848032,0.0012635437,0.0005633678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020316676,0.00033733604,0.00687886,0.00045890867,0.000080865575,0.00032755092,0.0009234183,0.15934926,0.11216403,0.037694354,0.009799257,0.6699545],"study_design_scores_gemma":[0.00013309081,0.00051696924,0.0021670382,0.000081137965,0.00016028452,0.00016689984,0.00033277366,0.8486418,0.081481904,0.053894997,0.012351592,0.00007152661],"about_ca_topic_score_codex":0.0024147595,"about_ca_topic_score_gemma":0.0063324342,"teacher_disagreement_score":0.0024886276,"about_ca_system_score_codex":0.00049426366,"about_ca_system_score_gemma":0.002034452,"threshold_uncertainty_score":0.008325219},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30029288,0.0011182359,0.6439952,0.00030352263,0.00010432347,0.00033686068,0.00030887852,0.05116444,0.0023755939],"genre_scores_gemma":[0.75887835,0.00015355894,0.23770331,0.00014595292,0.00005089899,0.00016759106,0.0005135997,0.001100238,0.0012865342],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974401,0.0005449726,0.00020522407,0.00061188417,0.0009858303,0.00021198994],"domain_scores_gemma":[0.99199235,0.0027388057,0.0016076942,0.0023790176,0.0010242289,0.00025791934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014979844,0.0010707914,0.0007890685,0.0020107687,0.00054924516,0.0008088424,0.0017887052,0.00058683695,0.0010389497],"category_scores_gemma":[0.007723531,0.0006939909,0.0005804996,0.0013463392,0.0009830274,0.0025986556,0.0017654897,0.00080205564,0.0004236739],"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.00199826,0.0007679324,0.042762633,0.00051005237,0.00027905634,0.00045769356,0.00072718196,0.085280165,0.16214813,0.006224276,0.008272492,0.690572],"study_design_scores_gemma":[0.00013971863,0.00092898955,0.00588856,0.000031863226,0.00009504577,0.00033972162,0.00008021919,0.8384331,0.14182301,0.00745701,0.0047030007,0.00007970963],"about_ca_topic_score_codex":0.0022177843,"about_ca_topic_score_gemma":0.0033788069,"teacher_disagreement_score":0.0022177843,"about_ca_system_score_codex":0.00061484013,"about_ca_system_score_gemma":0.0015071091,"threshold_uncertainty_score":0.007922173},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86760175,0.0006910559,0.12508756,0.00023683658,0.000074980184,0.00003403414,0.000022249256,0.00022728875,0.0060242214],"genre_scores_gemma":[0.9942908,0.00007136197,0.0049429815,0.000017983743,0.000004809435,0.000007161111,0.0000057708703,0.000015404448,0.00064356247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999045,0.000029172896,0.0000031075167,0.000014171951,0.000026450896,0.000022601555],"domain_scores_gemma":[0.99984825,0.00006229085,0.000028241224,0.000020779613,0.000027248017,0.000013124473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002456806,0.00020982148,0.00024043256,0.0002032331,0.00024070713,0.0003000331,0.00031267962,0.0003246732,0.0006224197],"category_scores_gemma":[0.00079954136,0.00020792194,0.00019900204,0.0001873862,0.00040994651,0.00054001133,0.00023093742,0.00021828244,0.00008281702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098818906,0.00005256968,0.0015871425,0.00003637432,0.000017913624,0.00011643757,0.000053637625,0.9606931,0.022446146,0.0032189174,0.00022644261,0.011452464],"study_design_scores_gemma":[0.00000778626,0.00003523781,0.0005283786,0.0000020045247,0.000004228607,0.00002149851,0.000015809419,0.9965274,0.0018453882,0.00081995665,0.00018894413,0.0000032829478],"about_ca_topic_score_codex":0.0014725598,"about_ca_topic_score_gemma":0.0018270861,"teacher_disagreement_score":0.0014725598,"about_ca_system_score_codex":0.0002938997,"about_ca_system_score_gemma":0.0003376907,"threshold_uncertainty_score":0.0029278994},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.255436,0.0010334038,0.7223248,0.0007736958,0.00033071582,0.00016990138,0.00010125459,0.013816885,0.0060132355],"genre_scores_gemma":[0.89862746,0.00031424756,0.09672028,0.00036113284,0.00012724144,0.00007304687,0.00014303655,0.0009432552,0.0026903793],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99667764,0.0012438222,0.00015598502,0.00039804415,0.0010032379,0.0005213016],"domain_scores_gemma":[0.9883422,0.0061774147,0.0007172709,0.0038572482,0.00066461717,0.00024115459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039516874,0.0009995598,0.0011026269,0.0011786562,0.0007697582,0.0015752302,0.0020436884,0.0011800353,0.0023188617],"category_scores_gemma":[0.014093538,0.00056260964,0.0007062508,0.0009040436,0.0020145138,0.0027342439,0.0022804681,0.001711696,0.0003672918],"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.0061782007,0.00090194505,0.021194026,0.0005641554,0.00024680968,0.0011794496,0.0016156033,0.18634355,0.07173074,0.0973738,0.009886917,0.60278475],"study_design_scores_gemma":[0.00014862699,0.0005585477,0.0029754569,0.00007907316,0.00019040272,0.000285349,0.00012965134,0.90416336,0.036287755,0.05137008,0.0037665758,0.00004506832],"about_ca_topic_score_codex":0.0034242757,"about_ca_topic_score_gemma":0.0028057632,"teacher_disagreement_score":0.0039516874,"about_ca_system_score_codex":0.00088896125,"about_ca_system_score_gemma":0.0009725338,"threshold_uncertainty_score":0.02089876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26684403,0.0015674807,0.7238951,0.00026677264,0.000096815944,0.00029149413,0.00012605461,0.0024889181,0.0044234083],"genre_scores_gemma":[0.7577933,0.0002820835,0.24026422,0.00008650968,0.000021026066,0.00014639129,0.00014870442,0.00010651534,0.0011512205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962056,0.00009927478,0.000043896365,0.0000659168,0.00011692141,0.000053417818],"domain_scores_gemma":[0.9993907,0.00009829398,0.0001007346,0.00019544718,0.00017205635,0.00004269368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061919447,0.0003279818,0.0002691333,0.00027759816,0.0003293765,0.0006190089,0.001261261,0.00026178066,0.0006700474],"category_scores_gemma":[0.0010886634,0.000271895,0.0003186077,0.00033087336,0.00028604898,0.0006257351,0.00049217505,0.000450822,0.00015470509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004717169,0.00024222858,0.0066897846,0.00049421244,0.0002665882,0.0004971293,0.00037251413,0.44025102,0.3241113,0.029300088,0.0037747917,0.19352865],"study_design_scores_gemma":[0.000060987826,0.0004106474,0.0026257995,0.00002677568,0.0001118371,0.00013793481,0.000059709393,0.89894336,0.08227359,0.0035295552,0.011788079,0.000031581945],"about_ca_topic_score_codex":0.0011371532,"about_ca_topic_score_gemma":0.0025457807,"teacher_disagreement_score":0.001261261,"about_ca_system_score_codex":0.0005212633,"about_ca_system_score_gemma":0.0009296395,"threshold_uncertainty_score":0.003782034},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09793956,0.0012789762,0.8564777,0.0012145222,0.00034801042,0.00021564229,0.0005115112,0.0065430054,0.03547115],"genre_scores_gemma":[0.43069237,0.0006901063,0.55460525,0.00043689102,0.000109918794,0.00020111645,0.0007540299,0.00032906854,0.012181343],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998118,0.000018195076,0.000011939657,0.000028269566,0.00009627307,0.000033514414],"domain_scores_gemma":[0.99981266,0.000016115715,0.000013263381,0.00004684802,0.000077901794,0.000033185137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001495247,0.00022798308,0.00018859109,0.0003859867,0.00042241946,0.0006154044,0.00097177003,0.00033483325,0.0048822816],"category_scores_gemma":[0.00045885541,0.00016206018,0.00038782018,0.00038549522,0.00020082599,0.0008285847,0.00064918975,0.0007599841,0.0014938861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003831644,0.00013811821,0.0016687883,0.00040341294,0.00009816547,0.00039351246,0.00017540788,0.04408208,0.43428144,0.097370185,0.027260872,0.39374498],"study_design_scores_gemma":[0.00014869754,0.00073227694,0.002311187,0.00009811039,0.00013612889,0.0007051025,0.00007556271,0.52229774,0.22973156,0.02820946,0.21544972,0.00010448259],"about_ca_topic_score_codex":0.0024313396,"about_ca_topic_score_gemma":0.0046389275,"teacher_disagreement_score":0.0048822816,"about_ca_system_score_codex":0.0006168522,"about_ca_system_score_gemma":0.00076476776,"threshold_uncertainty_score":0.016332865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023193156,0.00033935186,0.80020714,0.00034252804,0.00024539375,0.00031001956,0.0014985728,0.13918576,0.034678053],"genre_scores_gemma":[0.42854428,0.0011532033,0.43244225,0.0012107171,0.00033228903,0.0015123354,0.014045574,0.0305747,0.09018466],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991043,0.00015218327,0.00004972276,0.00010783294,0.00040221278,0.00018379807],"domain_scores_gemma":[0.9988379,0.00023676206,0.00005763154,0.00043297338,0.00022419731,0.00021057975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009942254,0.0006213265,0.0006398369,0.00062901416,0.001046165,0.0024440365,0.0023472302,0.00089394976,0.017305009],"category_scores_gemma":[0.0029262437,0.00065994036,0.0004585642,0.0010134238,0.00050661614,0.00267125,0.003534855,0.001442971,0.007866976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025198653,0.0003404014,0.00386869,0.0006139866,0.00014737384,0.0017207777,0.0019626613,0.033039168,0.053183585,0.08727655,0.40870014,0.40662685],"study_design_scores_gemma":[0.0005228099,0.0003255483,0.002006612,0.00011716542,0.000066694636,0.0007466493,0.00038412338,0.22200032,0.08402373,0.035756584,0.6538788,0.00017090149],"about_ca_topic_score_codex":0.0023435727,"about_ca_topic_score_gemma":0.0024858685,"teacher_disagreement_score":0.017305009,"about_ca_system_score_codex":0.00056499505,"about_ca_system_score_gemma":0.0013199169,"threshold_uncertainty_score":0.05789107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04348549,0.00040975356,0.9516719,0.00022138638,0.00004311709,0.00010312709,0.00007600482,0.00040693683,0.0035822638],"genre_scores_gemma":[0.58960336,0.00037751757,0.40599892,0.00009479534,0.0000650763,0.00031480464,0.00021863132,0.00021491971,0.0031119252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994972,0.00013484314,0.000019918101,0.00006547482,0.00019712962,0.00008550309],"domain_scores_gemma":[0.9994887,0.00025965064,0.00008130109,0.000039692655,0.0000936326,0.000037004113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063733733,0.0009798313,0.00077531894,0.00046742495,0.0004476522,0.0006127768,0.0010903707,0.00045345598,0.001750721],"category_scores_gemma":[0.0017809379,0.00032118536,0.00041950453,0.0007346614,0.00039776028,0.00077936123,0.0006026059,0.00047943913,0.00021772287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079636295,0.000046058845,0.00032374598,0.00006826051,0.000018940424,0.000026543368,0.000019732695,0.95603776,0.002568607,0.005457556,0.0011051768,0.03424794],"study_design_scores_gemma":[0.000007729411,0.000018069635,0.000074096526,0.0000016523404,0.0000032754303,0.0000053613385,0.0000043436953,0.9978618,0.0003585412,0.0014258507,0.0002376019,0.0000016849732],"about_ca_topic_score_codex":0.0057110228,"about_ca_topic_score_gemma":0.0048354063,"teacher_disagreement_score":0.0057110228,"about_ca_system_score_codex":0.0014691828,"about_ca_system_score_gemma":0.0015880663,"threshold_uncertainty_score":0.011355579},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022314237,0.00007396457,0.950342,0.00015130675,0.0000573873,0.00014228684,0.000125572,0.022951018,0.0038421971],"genre_scores_gemma":[0.19391505,0.00019205888,0.79069275,0.00021661991,0.0000495991,0.00034806837,0.0009204502,0.0046038907,0.009061489],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984478,0.00033796087,0.000177851,0.00020578533,0.00063035917,0.00020027281],"domain_scores_gemma":[0.9988432,0.0003735058,0.00010605366,0.00031305262,0.0002226896,0.00014149654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024896776,0.0005536914,0.00057136116,0.00046697466,0.0005642895,0.0020076947,0.0026706909,0.00078484917,0.002892092],"category_scores_gemma":[0.0027207795,0.000582476,0.0010088917,0.0003726965,0.0009351042,0.002107288,0.0019423336,0.001885874,0.001161697],"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.0015716044,0.00049382274,0.005928131,0.00074537704,0.0002463161,0.0015395968,0.0026990233,0.23808467,0.13353844,0.28023148,0.029005539,0.30591604],"study_design_scores_gemma":[0.00034642324,0.00026409718,0.00094665535,0.00009305405,0.00006822688,0.00026123525,0.00014481421,0.82047045,0.059921335,0.021461315,0.0959125,0.00010993669],"about_ca_topic_score_codex":0.0021122934,"about_ca_topic_score_gemma":0.0020013675,"teacher_disagreement_score":0.002892092,"about_ca_system_score_codex":0.0009259723,"about_ca_system_score_gemma":0.0017278593,"threshold_uncertainty_score":0.013166785},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9725424,0.001397659,0.017314505,0.002009852,0.00012993962,0.00004865872,0.00013403801,0.000611426,0.0058114924],"genre_scores_gemma":[0.9888916,0.000289402,0.009693064,0.00033116274,0.000027676822,0.000030769228,0.000049073056,0.000097745164,0.0005895406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989761,0.00032525155,0.000036571473,0.00013998024,0.00037493926,0.00014724085],"domain_scores_gemma":[0.9953898,0.0030097405,0.00038874644,0.00066374784,0.00036467018,0.00018326813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086349796,0.00044672863,0.00061415136,0.00043510375,0.0008484502,0.0011901843,0.001194238,0.001313316,0.0011723522],"category_scores_gemma":[0.00786846,0.00042718268,0.00039999536,0.00093565765,0.0014601578,0.0019974988,0.0008315928,0.0014884978,0.00020298714],"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.0025220078,0.0008928283,0.07369832,0.0008875211,0.00032740406,0.006216387,0.0017456439,0.66165495,0.07729198,0.0837159,0.012626612,0.07842056],"study_design_scores_gemma":[0.0001820122,0.0009062801,0.01533668,0.00009683203,0.00012178538,0.0013602326,0.00084670784,0.89227223,0.041243296,0.032874774,0.014652694,0.000106559426],"about_ca_topic_score_codex":0.0038274275,"about_ca_topic_score_gemma":0.0032979317,"teacher_disagreement_score":0.0038274275,"about_ca_system_score_codex":0.0006995345,"about_ca_system_score_gemma":0.00071188266,"threshold_uncertainty_score":0.0076102614},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1679064,0.0005625102,0.79276156,0.0002973197,0.00009338117,0.00037243855,0.00045357939,0.022089941,0.015462788],"genre_scores_gemma":[0.32141286,0.0001732754,0.67072964,0.00014696117,0.000027176868,0.0003815191,0.00092264544,0.0012137342,0.0049921954],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997694,0.00003136812,0.000009907253,0.000037403704,0.00011660117,0.000035400015],"domain_scores_gemma":[0.9997638,0.000040709907,0.000029233175,0.000048163725,0.000095690506,0.000022479186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003048681,0.0005069171,0.00031031924,0.00036649537,0.000391026,0.0005351482,0.0012597217,0.00031522315,0.0023168956],"category_scores_gemma":[0.0006559832,0.0003436358,0.00022606678,0.0005140307,0.00037658258,0.0004826753,0.00036416558,0.0006646262,0.0010297769],"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.00094233174,0.00034172798,0.0098426575,0.00075888436,0.00012038585,0.0008828864,0.000651824,0.18235774,0.30645627,0.034157895,0.026177336,0.4373101],"study_design_scores_gemma":[0.000136274,0.00050280645,0.0020495495,0.000037390677,0.000029770896,0.00032918813,0.00006369145,0.6597673,0.29498416,0.003561,0.038483504,0.00005530043],"about_ca_topic_score_codex":0.0020496917,"about_ca_topic_score_gemma":0.0021253687,"teacher_disagreement_score":0.0023168956,"about_ca_system_score_codex":0.00072897936,"about_ca_system_score_gemma":0.001108208,"threshold_uncertainty_score":0.0077507496},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85160077,0.0009461895,0.123670384,0.00018971584,0.00016096047,0.00012584137,0.00022174361,0.0053919326,0.017692495],"genre_scores_gemma":[0.93588245,0.00027933143,0.05854103,0.00011279371,0.000031333064,0.000047752845,0.0001971552,0.00017243774,0.004735722],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994692,0.00006995187,0.000050321632,0.000098804616,0.00021562215,0.0000961158],"domain_scores_gemma":[0.99870765,0.00034161672,0.0002932396,0.0003779773,0.00020628341,0.00007316811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034347465,0.00044535147,0.00026208186,0.0004516569,0.0001507477,0.0006574907,0.00082367845,0.00018796386,0.005558983],"category_scores_gemma":[0.0014133003,0.00019809314,0.00013250968,0.0007264467,0.0003114868,0.00096226664,0.0005115082,0.00043125803,0.00067177095],"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.003738113,0.00038685263,0.013131451,0.0009283555,0.0001244546,0.00062654377,0.00020324273,0.09600905,0.3811994,0.016997533,0.00750829,0.4791468],"study_design_scores_gemma":[0.00026004636,0.0039780037,0.019238237,0.00009507589,0.00016380959,0.0012837963,0.00023560319,0.3962431,0.5493836,0.0041371225,0.024883078,0.000098596916],"about_ca_topic_score_codex":0.0010790989,"about_ca_topic_score_gemma":0.002203762,"teacher_disagreement_score":0.005558983,"about_ca_system_score_codex":0.00044469477,"about_ca_system_score_gemma":0.00041964886,"threshold_uncertainty_score":0.018596709},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9701544,0.00051087444,0.011308872,0.00011357686,0.00006166452,0.000059564496,0.00041889263,0.00415008,0.013222042],"genre_scores_gemma":[0.9803273,0.0002351835,0.015216169,0.000060398503,0.000027663846,0.000051892075,0.0012297218,0.00032022462,0.0025314358],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989833,0.00010218407,0.00008938888,0.00015278561,0.00039814698,0.00027410942],"domain_scores_gemma":[0.998386,0.00047862643,0.0001336601,0.00039539754,0.00046665213,0.00013961631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005663181,0.0005601494,0.0003279449,0.0007919661,0.00024162597,0.0007480797,0.000892787,0.00027893236,0.005500422],"category_scores_gemma":[0.0030133475,0.00020524199,0.00023015995,0.0013821386,0.000384619,0.0013303028,0.00089977466,0.00037417567,0.00079730566],"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.011514375,0.00057652325,0.024479195,0.0011695183,0.00019663846,0.000616797,0.0005408938,0.12609595,0.3400272,0.006721768,0.020939395,0.46712175],"study_design_scores_gemma":[0.0011697027,0.009865027,0.051583298,0.0000853216,0.00032924456,0.000722739,0.000901728,0.42984113,0.4807527,0.0029356277,0.021698626,0.00011488855],"about_ca_topic_score_codex":0.0036109982,"about_ca_topic_score_gemma":0.003855228,"teacher_disagreement_score":0.005500422,"about_ca_system_score_codex":0.00072718505,"about_ca_system_score_gemma":0.0008980386,"threshold_uncertainty_score":0.018400788},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048396036,0.0012527272,0.8495368,0.0011384835,0.00056983816,0.00083595025,0.0006762476,0.052172787,0.04542131],"genre_scores_gemma":[0.21197885,0.002476432,0.74393046,0.00056354137,0.00017154617,0.0007019974,0.0032906209,0.009580117,0.027306415],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990238,0.00013661027,0.00008102508,0.00014767372,0.0004675781,0.0001433282],"domain_scores_gemma":[0.9987834,0.00036500348,0.00009638439,0.00025512167,0.00034476904,0.00015519313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016523337,0.00073274877,0.00047717793,0.0004774575,0.00047517914,0.001591366,0.0022525468,0.0007807662,0.006568604],"category_scores_gemma":[0.0057103103,0.00066211884,0.00072116236,0.0004658783,0.00048158885,0.0030157364,0.002670527,0.0018173894,0.0035190582],"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.00047027718,0.0008073934,0.004763271,0.0017344052,0.00016563064,0.001569938,0.0012586662,0.045256276,0.18756314,0.0896772,0.081213415,0.58552045],"study_design_scores_gemma":[0.00038240006,0.0004503115,0.0029293806,0.00040872963,0.00017964758,0.0012852377,0.00048287437,0.40766022,0.10639215,0.052896082,0.42678353,0.0001493677],"about_ca_topic_score_codex":0.0010532491,"about_ca_topic_score_gemma":0.0017351122,"teacher_disagreement_score":0.006568604,"about_ca_system_score_codex":0.00043689815,"about_ca_system_score_gemma":0.0010838546,"threshold_uncertainty_score":0.021974206},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053164735,0.0025025918,0.34934774,0.002791385,0.002429239,0.00087400916,0.045099497,0.25463906,0.33699995],"genre_scores_gemma":[0.10952952,0.0045740963,0.27045447,0.004983263,0.0011903733,0.0012966436,0.1679648,0.08873404,0.35127273],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977404,0.00033758747,0.00019546434,0.0004346967,0.0010126354,0.00027931336],"domain_scores_gemma":[0.9963341,0.0006033793,0.00013541445,0.0015665783,0.0011011345,0.00025945858],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019145136,0.001513434,0.00094582816,0.001504339,0.0011312659,0.0056802193,0.003255399,0.0019715952,0.17928901],"category_scores_gemma":[0.007773486,0.0010680296,0.0015930558,0.0013629106,0.0007296768,0.007213444,0.0053295684,0.0027763837,0.10664125],"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.0006610765,0.00012403373,0.0019764907,0.00078505446,0.00008851315,0.0003817594,0.0005760589,0.0021674333,0.006147926,0.10373718,0.6186079,0.2647466],"study_design_scores_gemma":[0.00004251348,0.000033668217,0.00031512554,0.00009242902,0.00002127559,0.00021029176,0.000102280144,0.002588085,0.003364065,0.020057065,0.9731406,0.0000325512],"about_ca_topic_score_codex":0.004058715,"about_ca_topic_score_gemma":0.0046827802,"teacher_disagreement_score":0.820711,"about_ca_system_score_codex":0.0009873487,"about_ca_system_score_gemma":0.0019614664,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98429203,0.00015034415,0.01197549,0.00006602245,0.000014767693,0.000021263513,0.00060577487,0.0016841079,0.0011901456],"genre_scores_gemma":[0.99217755,0.000026752547,0.006934674,0.000022876098,0.0000034040052,0.000013499049,0.00047331065,0.000067865345,0.00027994977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954295,0.00011489119,0.000025757878,0.000112013004,0.0001252351,0.000079159065],"domain_scores_gemma":[0.9976484,0.0015205581,0.00025236228,0.00022148532,0.00024218252,0.000115088435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065517536,0.00049535296,0.000239878,0.000500613,0.00023184132,0.00043106615,0.0004319367,0.00030720897,0.0011647441],"category_scores_gemma":[0.003478581,0.00023349313,0.00021511466,0.0005985124,0.0003803634,0.0005943417,0.00027582925,0.0004020561,0.00028829733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0059228763,0.0013287738,0.26145202,0.0005973361,0.0003142671,0.001212122,0.0010918475,0.33050153,0.1866961,0.005426422,0.0065051117,0.19895156],"study_design_scores_gemma":[0.00005943278,0.0006392332,0.04439065,0.00001579574,0.00004274003,0.00015809703,0.0001442527,0.8868306,0.064693645,0.0018821375,0.0011129782,0.000030404375],"about_ca_topic_score_codex":0.006148007,"about_ca_topic_score_gemma":0.004269345,"teacher_disagreement_score":0.006148007,"about_ca_system_score_codex":0.00039359642,"about_ca_system_score_gemma":0.00069824996,"threshold_uncertainty_score":0.012224436},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029629465,0.0007869206,0.910596,0.0012851206,0.00028680742,0.000522276,0.00025327568,0.038807496,0.01783275],"genre_scores_gemma":[0.26574746,0.0012421047,0.70726824,0.0008186903,0.00015661857,0.00079104543,0.0028729236,0.0045763496,0.016526535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984486,0.0002626861,0.000104859966,0.00020925992,0.00068363594,0.0002909068],"domain_scores_gemma":[0.99770725,0.00039225505,0.00018269652,0.0005240544,0.0008875961,0.00030609628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020556306,0.00081047614,0.00038066306,0.0012292431,0.0007249197,0.002074781,0.0024532964,0.00083800254,0.005453424],"category_scores_gemma":[0.005672611,0.00090386736,0.0006349794,0.0008006628,0.00084910693,0.0027584617,0.0026856293,0.002816183,0.0029136478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069175946,0.00051020907,0.007870073,0.00067588856,0.00013295379,0.0006946802,0.0011824404,0.09077136,0.06455652,0.24251097,0.090971716,0.4994315],"study_design_scores_gemma":[0.00023223275,0.0006383494,0.0027959733,0.00043040758,0.00010058004,0.00038935328,0.00031163462,0.5206637,0.057281464,0.037400194,0.37960532,0.00015077686],"about_ca_topic_score_codex":0.00620574,"about_ca_topic_score_gemma":0.0043670675,"teacher_disagreement_score":0.00620574,"about_ca_system_score_codex":0.0018500544,"about_ca_system_score_gemma":0.00537566,"threshold_uncertainty_score":0.018243551},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013193022,0.00026984207,0.96706045,0.00040921033,0.00024791685,0.00024918618,0.0003195628,0.015346786,0.0029041083],"genre_scores_gemma":[0.20474961,0.00040501414,0.7824351,0.00036880796,0.00028710536,0.0009150506,0.0013780709,0.0015848359,0.007876375],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987469,0.00020556567,0.0001180748,0.00013148124,0.0006552824,0.00014258822],"domain_scores_gemma":[0.99746084,0.00042711486,0.0002659692,0.00079545466,0.00080566027,0.00024479785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016307187,0.00063877366,0.0007019536,0.0011548629,0.001967829,0.0018820121,0.0039202347,0.0011831406,0.004304318],"category_scores_gemma":[0.005327008,0.0005929311,0.00090604066,0.0018477489,0.00059081905,0.0021823759,0.0018730537,0.0015762779,0.0029799913],"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.0013246519,0.0010055287,0.006404896,0.0010073144,0.00033522674,0.00082300627,0.0007843305,0.13116,0.20672926,0.14955972,0.08399705,0.41686898],"study_design_scores_gemma":[0.00045876225,0.00051083736,0.0021665848,0.000046580564,0.000101868296,0.00034336007,0.0000926252,0.8012575,0.07427694,0.033709615,0.08676213,0.00027329908],"about_ca_topic_score_codex":0.002340855,"about_ca_topic_score_gemma":0.0031277328,"teacher_disagreement_score":0.004304318,"about_ca_system_score_codex":0.00095551525,"about_ca_system_score_gemma":0.0028824236,"threshold_uncertainty_score":0.014399409},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14701746,0.00093981373,0.8461577,0.00026900295,0.000024869181,0.000053304986,0.00005871904,0.0008550087,0.0046240487],"genre_scores_gemma":[0.9492511,0.00009599459,0.04941548,0.00003730816,0.000013568652,0.00003575096,0.000035775105,0.00006804906,0.0010469076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994604,0.00015628366,0.00002402184,0.00006245134,0.00015690013,0.00013988311],"domain_scores_gemma":[0.999076,0.00036576646,0.00014737794,0.00016134932,0.0001908364,0.00005874933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069571,0.00043171935,0.0004347863,0.00035965414,0.00038364073,0.00050049543,0.001060758,0.00030535852,0.0011613932],"category_scores_gemma":[0.0019941782,0.00020706511,0.00023033118,0.0005864229,0.00045984914,0.00084315834,0.00077606476,0.00044405114,0.00020209668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021851019,0.000120484896,0.0016562376,0.000086788634,0.00004359568,0.000092072536,0.00011704532,0.84800833,0.022760248,0.0151716,0.0022461272,0.10947896],"study_design_scores_gemma":[0.000010224979,0.000036824407,0.00014998023,0.0000031751206,0.000007843158,0.000024306551,0.000015445486,0.99271387,0.0034784412,0.0028486731,0.00070604443,0.00000526399],"about_ca_topic_score_codex":0.0019067625,"about_ca_topic_score_gemma":0.0035901878,"teacher_disagreement_score":0.0019067625,"about_ca_system_score_codex":0.00085182773,"about_ca_system_score_gemma":0.0010802607,"threshold_uncertainty_score":0.006180465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06989714,0.00578139,0.8661271,0.001431586,0.00077850535,0.000107857864,0.00044254592,0.009927439,0.045506395],"genre_scores_gemma":[0.7698131,0.0013215317,0.18768173,0.00072089455,0.00018951355,0.000100031524,0.0005579661,0.0013532502,0.038261965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980587,0.000033249726,0.0000095414725,0.00003109515,0.00008298796,0.000037374404],"domain_scores_gemma":[0.99959415,0.00008439135,0.00003098222,0.00011940616,0.00014050794,0.00003064265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020156824,0.00046931618,0.00040152008,0.0004237716,0.0006325678,0.0008014777,0.0012397387,0.00042872576,0.014247739],"category_scores_gemma":[0.00082679954,0.00024481822,0.00020016609,0.00077342655,0.00022968074,0.001416487,0.0006554155,0.0007161014,0.0021867133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010079393,0.00024020736,0.0015749722,0.00060725125,0.00008258779,0.00018066239,0.0001891555,0.10896256,0.11954703,0.050930765,0.061502352,0.6551745],"study_design_scores_gemma":[0.00010849674,0.00043582058,0.0018234838,0.00009779538,0.00010107704,0.00039477067,0.0001268165,0.7607058,0.0773818,0.06598537,0.092791766,0.000047070862],"about_ca_topic_score_codex":0.0013496714,"about_ca_topic_score_gemma":0.004535391,"teacher_disagreement_score":0.014247739,"about_ca_system_score_codex":0.0005055028,"about_ca_system_score_gemma":0.00059275486,"threshold_uncertainty_score":0.04766345},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00645061,0.000036046094,0.98541325,0.0002463306,0.000049954117,0.000035611538,0.00005043741,0.0025831761,0.005134644],"genre_scores_gemma":[0.2231434,0.00033017766,0.76614076,0.00026549137,0.00008739025,0.00028636298,0.00022876203,0.0015099238,0.008007708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992005,0.00029048798,0.00004626735,0.00013053673,0.00025358688,0.00007866724],"domain_scores_gemma":[0.9972396,0.001446692,0.00020664779,0.00055596884,0.00038058544,0.0001705855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001616743,0.00072230655,0.0003557169,0.00082466996,0.0005420478,0.002309952,0.001084884,0.00070400094,0.004754049],"category_scores_gemma":[0.0077939103,0.00051169546,0.00087509496,0.0005446832,0.0023842573,0.0034966148,0.0026789315,0.0017661175,0.00084720243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027532518,0.000101421356,0.0010656206,0.000382271,0.000025504392,0.00046835464,0.0026941542,0.042228963,0.022606201,0.78266907,0.0073613417,0.14012174],"study_design_scores_gemma":[0.00015065577,0.00015627299,0.0003857448,0.00024037903,0.00005614952,0.00055695436,0.00043164985,0.28512493,0.03659616,0.50473195,0.17148344,0.000085681015],"about_ca_topic_score_codex":0.0013519047,"about_ca_topic_score_gemma":0.0014593676,"teacher_disagreement_score":0.004754049,"about_ca_system_score_codex":0.0006527055,"about_ca_system_score_gemma":0.00097952,"threshold_uncertainty_score":0.01590383},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4126122,0.00096295576,0.5695298,0.00065255846,0.00026320334,0.00021077303,0.00010138953,0.0031246962,0.0125424275],"genre_scores_gemma":[0.8225775,0.00014971271,0.17130007,0.00015500518,0.00003203466,0.000034915152,0.00007281323,0.0000802135,0.0055976743],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977857,0.000030473144,0.0000145025215,0.000029090492,0.000108617896,0.000038722996],"domain_scores_gemma":[0.9996258,0.00005728581,0.00004925501,0.00013939789,0.00009129975,0.00003700072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024935423,0.00023573832,0.00022380738,0.00021499288,0.00025468206,0.00067668105,0.0010928977,0.00026352936,0.0018734024],"category_scores_gemma":[0.0005009677,0.00015385434,0.00017227793,0.0001485076,0.0002997898,0.00085893663,0.0003666182,0.0005399045,0.00035535885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010420466,0.00028104044,0.0020043629,0.0003337425,0.00006781367,0.0004989746,0.00023995763,0.037833598,0.5423165,0.044771455,0.004475363,0.36613518],"study_design_scores_gemma":[0.00027249203,0.0019853506,0.0019467481,0.000057705023,0.00008680362,0.0009389861,0.000119647084,0.33636916,0.61412984,0.009364628,0.034646913,0.00008170295],"about_ca_topic_score_codex":0.0009027558,"about_ca_topic_score_gemma":0.0031860527,"teacher_disagreement_score":0.0018734024,"about_ca_system_score_codex":0.000346824,"about_ca_system_score_gemma":0.0009053447,"threshold_uncertainty_score":0.0062671304},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9185473,0.0030505632,0.04838162,0.0009120289,0.00033402795,0.000035440204,0.00014938739,0.0023226303,0.026267089],"genre_scores_gemma":[0.9793997,0.00029750494,0.017855134,0.00011566744,0.00006244255,0.00001805909,0.000115219904,0.0004613675,0.0016749048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999448,0.00018404708,0.000026498241,0.00006477484,0.00016699654,0.00010970779],"domain_scores_gemma":[0.9971323,0.0016382107,0.00015739523,0.0004096359,0.0005589024,0.000103570295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00104827,0.00055125565,0.00044782078,0.0006044008,0.0005223182,0.0005629548,0.00054687087,0.00032398736,0.0034557495],"category_scores_gemma":[0.0076684393,0.0002802703,0.0002626339,0.0008176152,0.0002679558,0.001527373,0.00057575066,0.00053646887,0.00035151115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040375255,0.0006810154,0.021389477,0.0006716328,0.00025814434,0.00047620814,0.00035889042,0.3028537,0.25228858,0.023272512,0.01281607,0.38089627],"study_design_scores_gemma":[0.00014127667,0.00060399773,0.011927343,0.00007238719,0.00028997075,0.00020912636,0.00025248586,0.8094475,0.16114444,0.011052277,0.004814771,0.00004438478],"about_ca_topic_score_codex":0.0010421362,"about_ca_topic_score_gemma":0.00488258,"teacher_disagreement_score":0.0034557495,"about_ca_system_score_codex":0.00030852598,"about_ca_system_score_gemma":0.000878291,"threshold_uncertainty_score":0.0115606785},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7037824,0.0016060043,0.2710412,0.00052772847,0.0001625646,0.000056130906,0.000176835,0.0022261934,0.020420952],"genre_scores_gemma":[0.9573449,0.00013296132,0.035593156,0.00010361231,0.000019135501,0.000024603933,0.00012769095,0.000103291175,0.00655067],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986744,0.000027741331,0.0000067928618,0.000020322837,0.000045280194,0.000032407363],"domain_scores_gemma":[0.99990165,0.000025788708,0.000009004229,0.000024008667,0.00003330582,0.0000062767695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012145071,0.0003438983,0.0004898037,0.00032142337,0.00030718904,0.00036684336,0.0006626886,0.00033322035,0.0030917414],"category_scores_gemma":[0.00022776386,0.00013482348,0.00033909336,0.00053458405,0.0001350909,0.0005068982,0.00024651873,0.0002279231,0.0006603965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029436976,0.0004097298,0.0030352355,0.0002911791,0.0001765294,0.0002720162,0.00008653262,0.22518145,0.49626446,0.008361171,0.0047535226,0.25822455],"study_design_scores_gemma":[0.000081291146,0.0006791013,0.003029187,0.000011493473,0.00014844956,0.00022171931,0.000043166157,0.83499396,0.15312524,0.0032025944,0.004439661,0.00002414742],"about_ca_topic_score_codex":0.000497455,"about_ca_topic_score_gemma":0.00101518,"teacher_disagreement_score":0.0030917414,"about_ca_system_score_codex":0.00021704657,"about_ca_system_score_gemma":0.0003689294,"threshold_uncertainty_score":0.010342956},"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":"commentary","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004272523,0.12532201,0.24249113,0.4949495,0.025201404,0.00027733357,0.000644462,0.001992761,0.10484894],"genre_scores_gemma":[0.18410836,0.20263687,0.4035611,0.07184063,0.07819864,0.0023818028,0.0017185586,0.002616526,0.052937485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9868161,0.004740915,0.000688373,0.0017051887,0.0053574694,0.00069193635],"domain_scores_gemma":[0.9698631,0.017289042,0.0006160131,0.0050686863,0.0053968546,0.0017662812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018868636,0.0015173611,0.002921174,0.0018390976,0.0041727107,0.011426146,0.004873084,0.0061714747,0.015262074],"category_scores_gemma":[0.05167641,0.0009878742,0.0018384473,0.002764012,0.011356788,0.02346275,0.009387662,0.016838755,0.009667491],"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.00005508672,0.00005930856,0.00026035635,0.00060111,0.000084249536,0.00007127297,0.0003292503,0.0034115552,0.0002404832,0.8144289,0.12518902,0.055269368],"study_design_scores_gemma":[0.000029713196,0.000015640115,0.00007459161,0.00015338257,0.000008660849,0.000061834784,0.00014005575,0.0042248573,0.00008228053,0.8376411,0.15754914,0.000018720122],"about_ca_topic_score_codex":0.0022410485,"about_ca_topic_score_gemma":0.001432343,"teacher_disagreement_score":0.018868636,"about_ca_system_score_codex":0.0037382466,"about_ca_system_score_gemma":0.0060725613,"threshold_uncertainty_score":0.09978807},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5330098,0.0035925838,0.41587278,0.0022088373,0.00014947174,0.00009545239,0.00008744255,0.0012827906,0.043700866],"genre_scores_gemma":[0.92972475,0.001124977,0.06554878,0.0003777891,0.00005982077,0.00006128962,0.000042721247,0.0002747143,0.0027850976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808705,0.00039650168,0.000120945784,0.00025945646,0.0008679914,0.00026809],"domain_scores_gemma":[0.9959805,0.0023741021,0.00044501363,0.0006039569,0.0004926118,0.00010380723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011936557,0.0004849221,0.00037456112,0.00072710915,0.0004485212,0.0012847938,0.0011563468,0.00078714895,0.0030330992],"category_scores_gemma":[0.006692978,0.00059519854,0.00034209786,0.00034257813,0.0007771808,0.0029861263,0.0006145121,0.0009198757,0.00097148214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093078025,0.0002779511,0.016720235,0.001367323,0.00022323606,0.0009855396,0.0009978979,0.19156903,0.26462883,0.07241282,0.004079654,0.44580674],"study_design_scores_gemma":[0.0002580833,0.0024399268,0.013045118,0.0009840367,0.00057659345,0.0031728854,0.0010800955,0.45346797,0.3291286,0.11553839,0.08004449,0.0002637562],"about_ca_topic_score_codex":0.0008099612,"about_ca_topic_score_gemma":0.0010816818,"teacher_disagreement_score":0.0030330992,"about_ca_system_score_codex":0.00073942036,"about_ca_system_score_gemma":0.0010092753,"threshold_uncertainty_score":0.010146737},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60625243,0.0005404344,0.3818548,0.00031398836,0.00015034783,0.00016194966,0.000098907345,0.0029634254,0.007663758],"genre_scores_gemma":[0.95271206,0.0001479251,0.046002023,0.000066646455,0.000033555436,0.000035165493,0.00008587259,0.00017033854,0.00074634014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993082,0.00013772339,0.000046001736,0.00011702609,0.00022389405,0.00016722496],"domain_scores_gemma":[0.9977896,0.00064498634,0.00030679433,0.0006258049,0.00039701266,0.0002358019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014110592,0.0007713829,0.00057940517,0.0005509655,0.0004575335,0.00075657706,0.0013130264,0.0003163606,0.0009855321],"category_scores_gemma":[0.0042311694,0.00037222088,0.0004022664,0.0005272183,0.00051255117,0.0014899061,0.0013485271,0.0009777639,0.00031527877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033459926,0.00022225606,0.0073619667,0.00010901153,0.000057830468,0.0001626006,0.00019949353,0.86948395,0.038621057,0.010884604,0.0018195778,0.070743024],"study_design_scores_gemma":[0.000012512551,0.00006577752,0.00035601002,0.000004394074,0.000010135612,0.000015238836,0.000013496072,0.99101514,0.0053301523,0.0022499324,0.00092018064,0.000007022762],"about_ca_topic_score_codex":0.0031636953,"about_ca_topic_score_gemma":0.004305138,"teacher_disagreement_score":0.0031636953,"about_ca_system_score_codex":0.00085530954,"about_ca_system_score_gemma":0.001866028,"threshold_uncertainty_score":0.0074625015},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013734529,0.0045773447,0.8684784,0.012001235,0.0019298348,0.00014587167,0.000855046,0.0007170124,0.09756059],"genre_scores_gemma":[0.4887282,0.0102441525,0.4284558,0.016975788,0.0039455066,0.00071824435,0.0014412978,0.0013025083,0.048188485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820447,0.000489721,0.000106967054,0.00044552822,0.0005219777,0.00023129223],"domain_scores_gemma":[0.9957818,0.002346383,0.00026383586,0.0004883352,0.00089892803,0.00022061683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032675983,0.0010397998,0.0011051229,0.001976724,0.0016946122,0.001679745,0.0013926757,0.0014320884,0.01395619],"category_scores_gemma":[0.007821974,0.00047956163,0.0020191676,0.0020040227,0.0042949747,0.007875753,0.003422429,0.0054577035,0.0035718393],"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.000036791214,0.000026946102,0.00014909184,0.00015851155,0.000014131349,0.00010527443,0.00014980976,0.0010344387,0.0009485267,0.9701001,0.011092659,0.016183758],"study_design_scores_gemma":[0.00002082797,0.000047027377,0.00022491485,0.00006337454,0.000015397854,0.00032008943,0.000048181413,0.0061720987,0.0014601813,0.9645318,0.027066875,0.000029232227],"about_ca_topic_score_codex":0.0016098637,"about_ca_topic_score_gemma":0.0009915904,"teacher_disagreement_score":0.01395619,"about_ca_system_score_codex":0.0013326387,"about_ca_system_score_gemma":0.0015588923,"threshold_uncertainty_score":0.04668808},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050931044,0.00040110017,0.9321854,0.00041001738,0.000044748413,0.00010712935,0.0003359759,0.0011454364,0.014439173],"genre_scores_gemma":[0.8399604,0.00096787926,0.14582762,0.00015482803,0.00004308001,0.0004070086,0.0005298728,0.00052141614,0.011588008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999303,0.00012936366,0.000029895175,0.00010274091,0.00036756723,0.00006732409],"domain_scores_gemma":[0.9989567,0.0005743175,0.00010188603,0.00014526042,0.00020255441,0.000019194931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005605096,0.0007285991,0.0003653949,0.0006007047,0.00029067614,0.0010701759,0.001708296,0.00090513076,0.0024054754],"category_scores_gemma":[0.0028823044,0.00045474464,0.00059717085,0.0005924643,0.0007182731,0.0014024669,0.00049516745,0.0010600312,0.0006066808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000215686,0.000044731303,0.00086458126,0.00007658833,0.000015681975,0.00006444872,0.00010966086,0.9204689,0.0076075853,0.053171616,0.000778857,0.016775673],"study_design_scores_gemma":[0.0000034053012,0.000014847441,0.00016464402,0.000006237949,0.0000043590535,0.000022117178,0.0000068302293,0.9871387,0.0018083324,0.009028919,0.0017967247,0.0000048668653],"about_ca_topic_score_codex":0.004749607,"about_ca_topic_score_gemma":0.003860669,"teacher_disagreement_score":0.004749607,"about_ca_system_score_codex":0.00132421,"about_ca_system_score_gemma":0.0012553469,"threshold_uncertainty_score":0.0096078515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3620151,0.026763368,0.56687486,0.0006248865,0.0008573847,0.000514563,0.0017785876,0.014755349,0.025815897],"genre_scores_gemma":[0.8458247,0.0036040158,0.12564997,0.00058201986,0.00019462529,0.00029931456,0.0029874379,0.00031734427,0.020540537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969566,0.000034785928,0.000024173556,0.000047001937,0.0001447023,0.000053752174],"domain_scores_gemma":[0.99945253,0.000063896965,0.000042499534,0.00010166165,0.0003086829,0.00003064962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022219485,0.00053460954,0.00051421963,0.0008179101,0.0005537136,0.0007615911,0.0024838676,0.0006285404,0.0027872147],"category_scores_gemma":[0.00042749004,0.00022244436,0.00043210352,0.0015919154,0.00023162832,0.0016197775,0.00043996266,0.00044549734,0.0006316704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002356618,0.0005073121,0.0110027455,0.0018060383,0.00048421315,0.0015223916,0.00033689497,0.09603983,0.19203252,0.01972102,0.051795993,0.6223944],"study_design_scores_gemma":[0.00061929045,0.0046524326,0.009890414,0.0001930167,0.00069059245,0.0040051304,0.00020546463,0.6019011,0.19445911,0.010886439,0.17219742,0.00029965202],"about_ca_topic_score_codex":0.0026681938,"about_ca_topic_score_gemma":0.0057401443,"teacher_disagreement_score":0.0027872147,"about_ca_system_score_codex":0.00057386653,"about_ca_system_score_gemma":0.0009758622,"threshold_uncertainty_score":0.009324133},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054283492,0.00042682645,0.8978079,0.00035800404,0.00009920819,0.000050478237,0.00013469723,0.02120018,0.025639145],"genre_scores_gemma":[0.48627663,0.00029532914,0.4937826,0.00030300926,0.00006824734,0.00013214657,0.00049280206,0.0048081335,0.013841064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992781,0.00013255021,0.000045417455,0.00010071307,0.00031388324,0.00012929151],"domain_scores_gemma":[0.99876213,0.0005712386,0.0001199937,0.00026838982,0.00023743781,0.000040820192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059684337,0.00080184825,0.0004350865,0.0005576358,0.00039735495,0.0010440989,0.0011358389,0.00046266112,0.0069405446],"category_scores_gemma":[0.0037233587,0.00032929142,0.00051632395,0.0005253176,0.0006468885,0.0011398601,0.001121154,0.00075089914,0.0023395226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068274926,0.0001772144,0.0052799443,0.0005336973,0.00007444085,0.0006133441,0.0004427114,0.33264256,0.06894668,0.07960112,0.019723248,0.49128237],"study_design_scores_gemma":[0.00008569098,0.00011426919,0.0010045979,0.000060032835,0.00004129232,0.00039493068,0.00009461781,0.87752557,0.06817077,0.011802964,0.040666122,0.000039175957],"about_ca_topic_score_codex":0.0018559508,"about_ca_topic_score_gemma":0.0028506347,"teacher_disagreement_score":0.0069405446,"about_ca_system_score_codex":0.00061503035,"about_ca_system_score_gemma":0.0010467896,"threshold_uncertainty_score":0.023218453},"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":"software","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010376842,0.0002781067,0.4296772,0.0010075137,0.0018759584,0.00085707096,0.010467762,0.48744756,0.058011852],"genre_scores_gemma":[0.114620104,0.000793775,0.32503897,0.0016586852,0.0009000437,0.0011782659,0.03679571,0.28269294,0.23632155],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993919,0.00006248656,0.000038821363,0.00013559592,0.0002373038,0.00013386457],"domain_scores_gemma":[0.9973212,0.0007490958,0.00012207343,0.0010093548,0.00048177302,0.0003165954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011790476,0.0014668138,0.0011076992,0.0013306438,0.0007172426,0.002087837,0.0020193032,0.0008082457,0.23860222],"category_scores_gemma":[0.0036445323,0.0007647722,0.0011923896,0.00088914466,0.00043835407,0.0028400063,0.0024301382,0.0015882129,0.09405372],"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.0019030798,0.0003953336,0.00095279346,0.0004282295,0.000065237604,0.00038230448,0.00022905522,0.0014103525,0.02419025,0.0067343335,0.54978454,0.41352454],"study_design_scores_gemma":[0.0010567463,0.00028604132,0.0038369696,0.00028132196,0.00007667331,0.0005726282,0.00024142678,0.04763706,0.112472065,0.027002508,0.80631137,0.00022515345],"about_ca_topic_score_codex":0.0017187479,"about_ca_topic_score_gemma":0.0024268795,"teacher_disagreement_score":0.23860222,"about_ca_system_score_codex":0.00048209986,"about_ca_system_score_gemma":0.00082048035,"threshold_uncertainty_score":0.79820395},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010409247,0.0004055466,0.92995065,0.0003573074,0.00027802592,0.00020837403,0.0010353765,0.053769965,0.012953745],"genre_scores_gemma":[0.02407551,0.000844922,0.9338545,0.0006249368,0.00033092796,0.0021169444,0.008090546,0.01721416,0.012847474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961498,0.00087206013,0.00048060837,0.0004296938,0.0016747124,0.00039315154],"domain_scores_gemma":[0.9965281,0.0009775643,0.00025028086,0.000820947,0.0010906515,0.00033238225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003160805,0.0012412398,0.0014245814,0.0014315649,0.0014723038,0.0031166112,0.005055394,0.0015591623,0.030529756],"category_scores_gemma":[0.009739645,0.0012384446,0.0015104638,0.0018854503,0.0011131396,0.0042344094,0.006747447,0.005903584,0.017712772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007718248,0.00036696327,0.0011912853,0.0012254093,0.00018309942,0.00074311584,0.00090479327,0.026624218,0.01041777,0.3234916,0.27061006,0.36346972],"study_design_scores_gemma":[0.0003715401,0.00014288265,0.00051650923,0.00026885443,0.000061418265,0.0007207393,0.000059854123,0.115830034,0.008418521,0.18365897,0.6898097,0.00014094973],"about_ca_topic_score_codex":0.0011439,"about_ca_topic_score_gemma":0.0010279156,"teacher_disagreement_score":0.030529756,"about_ca_system_score_codex":0.00081332435,"about_ca_system_score_gemma":0.0025840842,"threshold_uncertainty_score":0.10213226},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04773754,0.00032792683,0.9476494,0.0002941354,0.00007089109,0.00008229913,0.000027289123,0.00036324683,0.0034472775],"genre_scores_gemma":[0.4208087,0.00021056876,0.5744648,0.0001800422,0.000057674824,0.00038886003,0.000060469683,0.000058348887,0.0037705658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967813,0.00012945445,0.000018639885,0.000054412536,0.00007603133,0.000043411917],"domain_scores_gemma":[0.9994554,0.00032341116,0.00005920582,0.000046686888,0.000084928215,0.000030305284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011013934,0.00063787843,0.0008181171,0.0008913497,0.00068983895,0.0007063564,0.0015262477,0.0012997561,0.0013687224],"category_scores_gemma":[0.001947694,0.00046108098,0.0007247974,0.00072550547,0.00077405473,0.00073785946,0.0007510931,0.0006831742,0.00020516255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008098306,0.000056930083,0.00042963657,0.000051404684,0.0000662167,0.0000761954,0.00006658773,0.93121654,0.0025034314,0.008000341,0.00094210205,0.05650971],"study_design_scores_gemma":[0.000021106298,0.000027971062,0.000047684407,0.000003767202,0.000007813838,0.000021229096,0.000010154484,0.9964641,0.00062188366,0.0022865094,0.00048341972,0.0000044393655],"about_ca_topic_score_codex":0.0021196736,"about_ca_topic_score_gemma":0.0017988775,"teacher_disagreement_score":0.0021196736,"about_ca_system_score_codex":0.0007145937,"about_ca_system_score_gemma":0.0011071939,"threshold_uncertainty_score":0.0058247447},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28882366,0.0027039319,0.6546509,0.0012383858,0.00015239228,0.0002505532,0.0009416139,0.0034847946,0.047753673],"genre_scores_gemma":[0.6993248,0.0016685228,0.286235,0.00024789927,0.00003299245,0.0002714101,0.001044472,0.0005760904,0.010598724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998585,0.000042433025,0.0000055813316,0.000017917277,0.000057248082,0.000018270819],"domain_scores_gemma":[0.99972063,0.00013616127,0.000020910064,0.000042683096,0.00005669576,0.000022891063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024265147,0.00056780636,0.00028074475,0.00035444193,0.0004890952,0.00055258395,0.0008497661,0.00045576555,0.004560636],"category_scores_gemma":[0.00087497616,0.00032235443,0.0005412622,0.00033320664,0.00033573768,0.00080369675,0.00078093767,0.0006812873,0.0005816167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018938645,0.000099222656,0.0034003179,0.00032173935,0.000054674383,0.00023813789,0.00023062456,0.8748132,0.017338872,0.046322096,0.0046368986,0.052354854],"study_design_scores_gemma":[0.000025876783,0.000073882686,0.00039838898,0.000027576576,0.000017268025,0.00009173836,0.000060460054,0.9517029,0.007676849,0.018270079,0.0216403,0.000014768394],"about_ca_topic_score_codex":0.0023149212,"about_ca_topic_score_gemma":0.0032896665,"teacher_disagreement_score":0.004560636,"about_ca_system_score_codex":0.0005061414,"about_ca_system_score_gemma":0.0008182022,"threshold_uncertainty_score":0.015256882},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007203111,0.0000954071,0.9711014,0.0002866555,0.00011445282,0.00011852608,0.00025338476,0.01572585,0.011583974],"genre_scores_gemma":[0.020550802,0.00031961277,0.9622838,0.00046681898,0.0001485004,0.00073926325,0.00059450715,0.005384919,0.009511706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980039,0.0005287194,0.00014787256,0.0003243322,0.00080237864,0.00019286365],"domain_scores_gemma":[0.9973592,0.0009410985,0.00011009248,0.00085434876,0.0005699136,0.0001653144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019220383,0.0010990812,0.0007185171,0.0015105171,0.0012437043,0.0029753959,0.0033777182,0.0010250239,0.024183303],"category_scores_gemma":[0.008140864,0.001048236,0.0016046934,0.0016479488,0.0014641986,0.0030059286,0.0030061372,0.004379217,0.011910054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029338192,0.000106012216,0.00053170725,0.00056748145,0.00012611445,0.00033273277,0.00049537764,0.026080197,0.006637891,0.56838715,0.11387113,0.2825708],"study_design_scores_gemma":[0.0001717094,0.00011337182,0.00031156625,0.00021993973,0.000068904694,0.00054257724,0.000090158544,0.20075352,0.0117266,0.33161813,0.4542468,0.00013672383],"about_ca_topic_score_codex":0.0029574991,"about_ca_topic_score_gemma":0.0024731748,"teacher_disagreement_score":0.024183303,"about_ca_system_score_codex":0.0008344166,"about_ca_system_score_gemma":0.002496235,"threshold_uncertainty_score":0.080901206},"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":"other","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008401468,0.0009825721,0.063572004,0.0033193987,0.0012234144,0.00059008185,0.0038477012,0.02379264,0.8942707],"genre_scores_gemma":[0.052003678,0.0011249622,0.04547033,0.0027234359,0.00053754414,0.00051103864,0.008272551,0.0055600256,0.88379645],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997738,0.00021797085,0.00012170982,0.00036759386,0.0012754246,0.00027932844],"domain_scores_gemma":[0.9957481,0.00067542365,0.0001994127,0.0014028074,0.0015240494,0.0004502182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015071565,0.0011640998,0.00079004664,0.0019092144,0.0016360895,0.003938339,0.0025907021,0.0017032543,0.3774483],"category_scores_gemma":[0.009829373,0.00066899013,0.0010428226,0.0011490871,0.0008824836,0.0057228617,0.0054181437,0.0017491949,0.29184872],"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.00029668125,0.00026467218,0.0026261539,0.00053504936,0.000027968035,0.00036794663,0.00084219885,0.000640881,0.00488609,0.07251501,0.46186498,0.4551324],"study_design_scores_gemma":[0.000030012356,0.000048823505,0.001194976,0.00007908304,0.0000144928335,0.0005524294,0.00013769996,0.00075601274,0.0016897649,0.009957275,0.9855138,0.00002560389],"about_ca_topic_score_codex":0.0024844313,"about_ca_topic_score_gemma":0.0042690653,"teacher_disagreement_score":0.3774483,"about_ca_system_score_codex":0.0008309975,"about_ca_system_score_gemma":0.0016911582,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030582512,0.00028737844,0.97521573,0.00024612545,0.0001429395,0.00006333044,0.00022978768,0.0053339596,0.015422478],"genre_scores_gemma":[0.1559897,0.00079459714,0.7858018,0.0008204543,0.00038733217,0.00040537442,0.0014229824,0.013584858,0.04079288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874747,0.0003183191,0.000058594287,0.00027450296,0.0004467098,0.00015436215],"domain_scores_gemma":[0.9983652,0.00070596766,0.000072538176,0.00055459567,0.0002466137,0.0000551834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001312802,0.0016511148,0.0010162441,0.0014878248,0.00089189934,0.0018476845,0.0024020337,0.00077834964,0.028325561],"category_scores_gemma":[0.0046633184,0.0010459243,0.002589262,0.0011362025,0.0015511387,0.005579216,0.002798468,0.0039707893,0.0058487267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026668422,0.00014734185,0.0009952913,0.0006383529,0.00017755319,0.0002448518,0.00048286768,0.02968782,0.007674625,0.5648113,0.043454785,0.3514185],"study_design_scores_gemma":[0.000048701153,0.000060704257,0.0004251703,0.00013140298,0.00013567891,0.00018226972,0.000118666285,0.1777413,0.013386553,0.73254335,0.075179614,0.00004660882],"about_ca_topic_score_codex":0.0011930742,"about_ca_topic_score_gemma":0.0018974519,"teacher_disagreement_score":0.028325561,"about_ca_system_score_codex":0.0005730663,"about_ca_system_score_gemma":0.0010057009,"threshold_uncertainty_score":0.09475845},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21481134,0.00023515403,0.77094525,0.000105766034,0.00004438639,0.00018097913,0.000113120215,0.0058259824,0.007738039],"genre_scores_gemma":[0.6746415,0.00017246508,0.32107887,0.00007721432,0.000020624157,0.00012568694,0.00019550645,0.00039204457,0.0032961336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997688,0.000055056145,0.000022291264,0.0000333477,0.00007152257,0.00004902402],"domain_scores_gemma":[0.99944216,0.0002780486,0.00006390172,0.000109975954,0.000083235616,0.000022708113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043011282,0.00051095465,0.00022618385,0.00025850677,0.0002217502,0.00043886143,0.0007333272,0.00018781498,0.0017197103],"category_scores_gemma":[0.0008337148,0.0002559703,0.00027959666,0.00020300515,0.0003205564,0.00062940514,0.0002927157,0.00041780117,0.0002792607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008311571,0.0002673342,0.0056317346,0.000643683,0.00008118441,0.000820463,0.00052979065,0.22359928,0.35832468,0.034204893,0.004259306,0.3708064],"study_design_scores_gemma":[0.00017362929,0.000898045,0.0024754766,0.000071733986,0.00007904243,0.000490088,0.00009520743,0.65039134,0.3036,0.011373202,0.030291127,0.00006108229],"about_ca_topic_score_codex":0.0012853789,"about_ca_topic_score_gemma":0.0026077763,"teacher_disagreement_score":0.0017197103,"about_ca_system_score_codex":0.00040173027,"about_ca_system_score_gemma":0.00066478713,"threshold_uncertainty_score":0.0057530403},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02688317,0.0021706438,0.6874145,0.02776714,0.008133354,0.0006129499,0.0029977805,0.10677158,0.13724887],"genre_scores_gemma":[0.22059456,0.0023349535,0.5543212,0.018068159,0.0026690227,0.0008055316,0.005801045,0.037345905,0.15805952],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99803275,0.00021263621,0.00010298667,0.00039745247,0.0009015892,0.0003525575],"domain_scores_gemma":[0.99432445,0.0007142103,0.00025511396,0.0025478685,0.0011070344,0.0010514117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002257843,0.0009422182,0.00082791154,0.0005578519,0.0031069324,0.0033004782,0.0018376189,0.0008563004,0.015671855],"category_scores_gemma":[0.010056156,0.00095592265,0.0009890562,0.00064208434,0.0021555515,0.009559715,0.0050218413,0.0048594275,0.01655799],"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.00056659844,0.00016807734,0.0038955915,0.00047558485,0.0001433622,0.00044235168,0.0014327794,0.004106771,0.012172485,0.080601074,0.59858435,0.2974109],"study_design_scores_gemma":[0.00007682947,0.00007075818,0.0012963238,0.00018123425,0.000049964772,0.00043912325,0.00047786173,0.012680546,0.006365222,0.13063017,0.84758705,0.00014488731],"about_ca_topic_score_codex":0.0043467423,"about_ca_topic_score_gemma":0.006138063,"teacher_disagreement_score":0.015671855,"about_ca_system_score_codex":0.0007439722,"about_ca_system_score_gemma":0.0029115207,"threshold_uncertainty_score":0.05242753},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10537455,0.002578135,0.78274095,0.00050879276,0.00062960014,0.00027212605,0.00046075627,0.0085894,0.09884571],"genre_scores_gemma":[0.47671744,0.0016093854,0.37917268,0.00045367578,0.00018721443,0.00031365108,0.0017330308,0.000767801,0.13904513],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999149,0.0000068607906,0.0000073403653,0.000018893348,0.00003476255,0.000017212715],"domain_scores_gemma":[0.99991035,0.000007779198,0.000008666861,0.000020167663,0.00003083871,0.000022083112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109612534,0.0002400537,0.00020332266,0.0002548064,0.00026294962,0.00053909,0.0005744937,0.00025602157,0.013533715],"category_scores_gemma":[0.00014475881,0.00017713082,0.00029303823,0.00031133596,0.00013757878,0.00043580128,0.000394826,0.00042034016,0.004634982],"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.00026414244,0.00011403142,0.0013540088,0.00030617486,0.00006277368,0.0003882433,0.00011244149,0.024509119,0.19733605,0.0293069,0.026446749,0.71979934],"study_design_scores_gemma":[0.00013398124,0.0011196751,0.0027774058,0.00010536638,0.00010993463,0.0012421962,0.0000953694,0.32670844,0.12885249,0.016759032,0.5220225,0.00007368234],"about_ca_topic_score_codex":0.00049842254,"about_ca_topic_score_gemma":0.00092560315,"teacher_disagreement_score":0.013533715,"about_ca_system_score_codex":0.00021721736,"about_ca_system_score_gemma":0.0003699887,"threshold_uncertainty_score":0.045274794},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075650415,0.000066205015,0.9817708,0.00013405348,0.00002676522,0.00003283186,0.00007116241,0.008229575,0.0021035338],"genre_scores_gemma":[0.25593317,0.00020195536,0.7399458,0.00015109063,0.000040382445,0.00015349513,0.00026291597,0.0012405528,0.0020706663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735874,0.0007864691,0.00018332338,0.00024960362,0.0011597903,0.00026204524],"domain_scores_gemma":[0.991085,0.0062268265,0.00045956933,0.0016436869,0.00049862184,0.000086336186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002800658,0.0009302589,0.0007434078,0.0010517656,0.0007811252,0.0023991845,0.002206933,0.0010688998,0.008166323],"category_scores_gemma":[0.010449833,0.0011378082,0.0016847654,0.0007955858,0.0028599629,0.0041731186,0.0023953496,0.0029866588,0.0013544809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009319785,0.00026405437,0.002181222,0.0006566495,0.00019708798,0.0007636612,0.00085063605,0.29155624,0.049520876,0.35311782,0.00892243,0.2910373],"study_design_scores_gemma":[0.00017484682,0.00008670607,0.00019798576,0.0000887641,0.00007841986,0.00025120538,0.00004919929,0.7009496,0.048982427,0.23643751,0.012628948,0.00007431422],"about_ca_topic_score_codex":0.0029037667,"about_ca_topic_score_gemma":0.004620998,"teacher_disagreement_score":0.008166323,"about_ca_system_score_codex":0.0010653067,"about_ca_system_score_gemma":0.002143893,"threshold_uncertainty_score":0.027319014},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028381009,0.0031192743,0.91274744,0.001186729,0.00082028814,0.00021305881,0.0004294931,0.015101148,0.03800161],"genre_scores_gemma":[0.4157265,0.0018073836,0.5191342,0.0017738088,0.0005718574,0.00041306726,0.001375343,0.0027615794,0.056436267],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989266,0.00016113947,0.000077531535,0.00021982052,0.000437564,0.00017744588],"domain_scores_gemma":[0.9971444,0.00036346342,0.00015663898,0.0015692166,0.0006174224,0.00014878844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007250361,0.0006396546,0.00094404776,0.0007460119,0.0011879083,0.0025894064,0.0038257772,0.00084794173,0.011010948],"category_scores_gemma":[0.002371842,0.0005757704,0.0006891159,0.0013421202,0.0009691345,0.0034447028,0.0019913379,0.0017812026,0.004798887],"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.0015038741,0.00052323734,0.0039230604,0.00080142735,0.00018685234,0.0007575766,0.0008569613,0.038484566,0.10483823,0.20902337,0.080349885,0.558751],"study_design_scores_gemma":[0.00039271484,0.000735082,0.0009928852,0.00017000086,0.00023978401,0.0019442418,0.00023370037,0.23634258,0.12454067,0.07907466,0.5550803,0.00025326357],"about_ca_topic_score_codex":0.0016275389,"about_ca_topic_score_gemma":0.0022125442,"teacher_disagreement_score":0.011010948,"about_ca_system_score_codex":0.0007675158,"about_ca_system_score_gemma":0.0012303148,"threshold_uncertainty_score":0.036835253},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062828794,0.0007525469,0.92666346,0.000119280754,0.00004813292,0.000107729626,0.00008936058,0.0014013639,0.007989362],"genre_scores_gemma":[0.5873038,0.00055271643,0.40775913,0.000104559105,0.00003642293,0.00016487559,0.00022119127,0.00022529009,0.0036321008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997837,0.000039060935,0.000012773926,0.000030688883,0.00010073453,0.000033162127],"domain_scores_gemma":[0.99984527,0.000031383905,0.000029464518,0.000022220715,0.000064043685,0.000007668926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021320058,0.00038085252,0.0002526871,0.00034982423,0.00026836127,0.00050650485,0.00089534174,0.00021239163,0.0019465929],"category_scores_gemma":[0.00029435146,0.00020693641,0.00030218877,0.0003265634,0.00016189153,0.00044955662,0.0002056822,0.00040674655,0.00038738988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015039717,0.000113815404,0.001898402,0.0004855163,0.00015674427,0.0002999503,0.0002200205,0.4758335,0.23407482,0.03190547,0.0054369536,0.24942444],"study_design_scores_gemma":[0.000027338707,0.00024700124,0.00077685603,0.000025414038,0.000068986454,0.00016814459,0.00005103302,0.92930835,0.051611733,0.0055695246,0.012131046,0.000014532153],"about_ca_topic_score_codex":0.0011830854,"about_ca_topic_score_gemma":0.0037813936,"teacher_disagreement_score":0.0019465929,"about_ca_system_score_codex":0.00039317133,"about_ca_system_score_gemma":0.0008034728,"threshold_uncertainty_score":0.006512046},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11605602,0.00364499,0.79907453,0.0008830076,0.0008826278,0.000394292,0.0005110244,0.014172749,0.06438064],"genre_scores_gemma":[0.5354578,0.0011454023,0.40287063,0.0006917957,0.00020056401,0.00014877881,0.0010146511,0.0004205239,0.058049776],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998548,0.000015699925,0.000010564634,0.0000312451,0.00006827259,0.000019384785],"domain_scores_gemma":[0.9998672,0.000017436834,0.000014031027,0.00003697184,0.000048880425,0.000015427977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010883597,0.00035795412,0.00025741477,0.0001801745,0.00021627395,0.00046923562,0.00042592498,0.00034361187,0.009737493],"category_scores_gemma":[0.00041979953,0.00016087927,0.00016175203,0.00025762417,0.00016372115,0.00051094906,0.0003982368,0.00087811146,0.0033965153],"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.00036307186,0.00013996566,0.0011122535,0.00037221628,0.000034191016,0.00041628955,0.00009784186,0.00979185,0.54729086,0.026576115,0.02156985,0.3922355],"study_design_scores_gemma":[0.00023984912,0.002694742,0.005495848,0.00016329184,0.0001443215,0.0029325238,0.00008097305,0.17285761,0.39401388,0.011877493,0.40938684,0.00011261728],"about_ca_topic_score_codex":0.00022290698,"about_ca_topic_score_gemma":0.00034286024,"teacher_disagreement_score":0.009737493,"about_ca_system_score_codex":0.00017628836,"about_ca_system_score_gemma":0.00041059894,"threshold_uncertainty_score":0.03257513},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76306593,0.00063746533,0.22406434,0.0007682446,0.000071379756,0.000144582,0.00015853562,0.0020550864,0.009034429],"genre_scores_gemma":[0.96896845,0.00005997653,0.030356288,0.000030769952,0.000012345264,0.000041707168,0.00004326862,0.00014054628,0.00034659734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997278,0.00009287105,0.000012621631,0.000040226227,0.0000659015,0.000060525555],"domain_scores_gemma":[0.9989697,0.00050627335,0.00006948014,0.000120567915,0.00026224504,0.00007181541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009105326,0.00039352136,0.0006058025,0.00047093641,0.00041113497,0.0005487776,0.0004922748,0.00047912754,0.0014983345],"category_scores_gemma":[0.0044978335,0.00028988047,0.0002501555,0.00043809027,0.00041366613,0.00085156073,0.0005660963,0.0004915356,0.00022603337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057493185,0.00024207009,0.008118055,0.00032407485,0.00008174017,0.00017104682,0.00019992175,0.78819853,0.07637562,0.01113436,0.0044347243,0.11014492],"study_design_scores_gemma":[0.000053371055,0.00014319399,0.002052258,0.000007450805,0.000021933849,0.000022066282,0.00010781094,0.98273534,0.010045617,0.0041278703,0.00067254854,0.000010551331],"about_ca_topic_score_codex":0.0013154048,"about_ca_topic_score_gemma":0.0024739795,"teacher_disagreement_score":0.0014983345,"about_ca_system_score_codex":0.00050654926,"about_ca_system_score_gemma":0.0009170089,"threshold_uncertainty_score":0.0050124526},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90602577,0.0017167359,0.0776035,0.0033472222,0.00021327625,0.00009435553,0.0002802325,0.0010585246,0.009660302],"genre_scores_gemma":[0.99288404,0.0002598488,0.0059786346,0.0001087824,0.000046638783,0.00003176545,0.000054939454,0.00012400011,0.00051141094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964149,0.000895108,0.00020638652,0.00041228422,0.0011426092,0.00092871324],"domain_scores_gemma":[0.96040386,0.025998669,0.004191254,0.005579501,0.0029266644,0.0009000866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028288753,0.00057199236,0.0007321014,0.00070117705,0.0006985136,0.0014218126,0.0014244873,0.0008069786,0.0027461303],"category_scores_gemma":[0.036907576,0.00042430963,0.00048654588,0.0007014564,0.0014389113,0.004052009,0.0011958361,0.0013646985,0.00047374432],"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.0024130293,0.00079275476,0.08346993,0.001630999,0.0004405287,0.00087545783,0.0006008172,0.4695063,0.15644783,0.06628195,0.004971717,0.21256867],"study_design_scores_gemma":[0.0001290568,0.0018276798,0.040347185,0.00014823313,0.00043230967,0.00094759744,0.00067220937,0.741659,0.12855652,0.07779035,0.007346286,0.00014352074],"about_ca_topic_score_codex":0.001533133,"about_ca_topic_score_gemma":0.001976121,"teacher_disagreement_score":0.0028288753,"about_ca_system_score_codex":0.0012026683,"about_ca_system_score_gemma":0.0016213654,"threshold_uncertainty_score":0.014960706},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29996613,0.0007828554,0.69203645,0.0003123716,0.00014386787,0.00023252946,0.00013619344,0.0018137819,0.004575776],"genre_scores_gemma":[0.6188664,0.00048219215,0.37795636,0.0000634914,0.000044914246,0.00030342673,0.00033326546,0.0002995704,0.0016503973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995813,0.00012757213,0.000023860755,0.000048485428,0.00017009836,0.000048773334],"domain_scores_gemma":[0.99947256,0.00018710643,0.000043063457,0.00013015751,0.00011721278,0.000049895494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006717348,0.0007067308,0.0009277733,0.00056489464,0.00055756373,0.00057291123,0.0012301767,0.00056809676,0.0014707918],"category_scores_gemma":[0.0014962031,0.0003966824,0.0007030479,0.0006288769,0.00053422473,0.0008637111,0.00090025325,0.000977011,0.00028130712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002851255,0.00021749713,0.001379907,0.00020825613,0.00013206834,0.00019866992,0.00017166988,0.8299705,0.05952384,0.01735083,0.0009064333,0.08965525],"study_design_scores_gemma":[0.00004183082,0.00003142023,0.00020070102,0.000002691892,0.000005976622,0.000014266941,0.00000688174,0.99102986,0.0065507847,0.001524304,0.0005851878,0.000006177453],"about_ca_topic_score_codex":0.002373298,"about_ca_topic_score_gemma":0.002648865,"teacher_disagreement_score":0.002373298,"about_ca_system_score_codex":0.00044557758,"about_ca_system_score_gemma":0.0011358091,"threshold_uncertainty_score":0.004920304},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07041742,0.00073229376,0.79835534,0.00042395733,0.00025616627,0.00028727372,0.00069217023,0.10378775,0.02504755],"genre_scores_gemma":[0.48899376,0.00075382256,0.4273118,0.0010587103,0.0002583399,0.0011253877,0.005304652,0.033856012,0.041337565],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99819034,0.0002746399,0.0001880719,0.0002567556,0.0008307489,0.00025941007],"domain_scores_gemma":[0.9967063,0.0010418757,0.00029096744,0.0010444922,0.0007132767,0.00020312046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001597691,0.00080389244,0.0008251117,0.00067579007,0.0007481242,0.0024551337,0.0048639793,0.00081953756,0.012019066],"category_scores_gemma":[0.0053405403,0.0011212187,0.00066284556,0.0008861911,0.00067826256,0.003901155,0.0027343286,0.0022754539,0.0054653417],"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.004995438,0.001098477,0.013565313,0.0019535737,0.00029017116,0.0010980702,0.0024684782,0.043667227,0.09850306,0.15980843,0.10358415,0.56896746],"study_design_scores_gemma":[0.0009084743,0.00057780737,0.0036425176,0.00030557803,0.00015401254,0.0008046234,0.00030807633,0.34560877,0.16515104,0.047593478,0.4346138,0.00033184863],"about_ca_topic_score_codex":0.0013159603,"about_ca_topic_score_gemma":0.0013803272,"teacher_disagreement_score":0.012019066,"about_ca_system_score_codex":0.0010322266,"about_ca_system_score_gemma":0.0015983506,"threshold_uncertainty_score":0.040207803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34350887,0.0035921677,0.61638325,0.00045138472,0.0006427859,0.0004063092,0.0005231293,0.009810561,0.02468159],"genre_scores_gemma":[0.9184689,0.0003124356,0.074311666,0.00023197835,0.0000700817,0.00006106044,0.0002098954,0.00005090982,0.006283116],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998964,0.0000116650635,0.000008454678,0.00001946876,0.000049574413,0.0000144550995],"domain_scores_gemma":[0.99984634,0.000036213547,0.00001778916,0.0000372017,0.000051489074,0.000010928501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014022143,0.00017956323,0.0002562433,0.00022637758,0.00038858716,0.00043067962,0.0009419754,0.00035847045,0.0049723987],"category_scores_gemma":[0.00029834645,0.000116872085,0.00015597789,0.00034560706,0.00015722115,0.0005929419,0.0002443383,0.00026738262,0.0008421932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009492116,0.00016884925,0.002224891,0.0005434337,0.00007482793,0.0005424238,0.00016044488,0.0052344142,0.6641279,0.018728165,0.011023445,0.2962221],"study_design_scores_gemma":[0.00018178465,0.0011046932,0.0036890924,0.000031965155,0.00016474893,0.002586964,0.000070728944,0.12911908,0.826125,0.0041625947,0.032685637,0.000077639896],"about_ca_topic_score_codex":0.0006053388,"about_ca_topic_score_gemma":0.001737414,"teacher_disagreement_score":0.0049723987,"about_ca_system_score_codex":0.00038715877,"about_ca_system_score_gemma":0.00042149652,"threshold_uncertainty_score":0.016634345},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61448336,0.0034885514,0.34648824,0.0012098057,0.00043353744,0.00019611606,0.002517826,0.024840891,0.006341632],"genre_scores_gemma":[0.912719,0.0005439913,0.080094054,0.0002735086,0.00009458336,0.000115323455,0.0022748734,0.00035878574,0.0035257814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999522,0.00005825546,0.000032600252,0.00009452512,0.00021606436,0.0000765333],"domain_scores_gemma":[0.99772257,0.0010673194,0.00028115616,0.00034781647,0.0004355695,0.00014560448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062151125,0.00079326937,0.0005479716,0.0012215739,0.00037387278,0.00071629795,0.0014050418,0.00048247888,0.0018923808],"category_scores_gemma":[0.0043296986,0.0004383186,0.000404803,0.000895826,0.0003746172,0.0018651978,0.0013249833,0.00095659465,0.0006906774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014071153,0.00037942742,0.1538527,0.00028427152,0.00017314097,0.00065353245,0.0003857607,0.15824784,0.026834223,0.004102822,0.025133627,0.6285456],"study_design_scores_gemma":[0.000046880366,0.00042354641,0.00606435,0.00004006584,0.000057187928,0.0002792583,0.00009423985,0.967453,0.0152759375,0.0049076094,0.0053085373,0.00004927844],"about_ca_topic_score_codex":0.0030716644,"about_ca_topic_score_gemma":0.0092504155,"teacher_disagreement_score":0.0030716644,"about_ca_system_score_codex":0.00030611726,"about_ca_system_score_gemma":0.0015478255,"threshold_uncertainty_score":0.006330669},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030855779,0.0007711499,0.6408973,0.0004062359,0.00009235267,0.00036298737,0.013872567,0.3013028,0.011438817],"genre_scores_gemma":[0.23280732,0.001144598,0.7051958,0.0005105075,0.0000880112,0.0016577948,0.025779117,0.021855306,0.0109614935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946684,0.00013467917,0.000050795625,0.00008707084,0.00022614026,0.00003456239],"domain_scores_gemma":[0.9953696,0.0037889509,0.00022248244,0.00021648548,0.00027191092,0.00013053013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013820048,0.0020693522,0.00071627164,0.0033086182,0.0004168228,0.0017358061,0.0017424695,0.0012463613,0.035446662],"category_scores_gemma":[0.0061061108,0.00088450057,0.0011018919,0.0013644354,0.00033761584,0.0028233698,0.0016540673,0.0012299236,0.0060416088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012203852,0.00075151306,0.016373178,0.002395697,0.00027956883,0.001278346,0.0011071776,0.06555933,0.015478148,0.015527729,0.19860078,0.68142813],"study_design_scores_gemma":[0.0006095064,0.0004301098,0.00855433,0.00062398193,0.0001185163,0.0013058594,0.0002934767,0.7435159,0.023922684,0.03442665,0.18596101,0.00023802512],"about_ca_topic_score_codex":0.0017150766,"about_ca_topic_score_gemma":0.0025233943,"teacher_disagreement_score":0.035446662,"about_ca_system_score_codex":0.0004670506,"about_ca_system_score_gemma":0.0007665265,"threshold_uncertainty_score":0.11858094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0738691,0.000345101,0.88079315,0.00033345746,0.00015070812,0.00045314158,0.0031155774,0.01306582,0.027873907],"genre_scores_gemma":[0.578032,0.00064816786,0.39459223,0.00016934142,0.000034197583,0.0012128184,0.0056495424,0.0015108315,0.018150881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998018,0.000048740843,0.000015532729,0.00002077625,0.00008856273,0.000024666171],"domain_scores_gemma":[0.9996767,0.000117668744,0.000023481558,0.00007250066,0.00008588762,0.00002373059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028976638,0.0005143704,0.00044014552,0.00038267713,0.00030743398,0.0004884623,0.0014226286,0.0007464475,0.008262462],"category_scores_gemma":[0.0012589038,0.00044448732,0.0005363142,0.00048614718,0.00026497807,0.0007017032,0.000552475,0.0009988976,0.0011639317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015073668,0.0000642051,0.0014129747,0.00018450107,0.000038407714,0.000121808975,0.000119879114,0.92414117,0.012928308,0.031277273,0.0066663213,0.022894392],"study_design_scores_gemma":[0.00003696839,0.000037882768,0.00015003044,0.000008399976,0.000010789383,0.000043068063,0.000009045999,0.9763106,0.0037798814,0.0033020126,0.016301515,0.000009723108],"about_ca_topic_score_codex":0.0039592017,"about_ca_topic_score_gemma":0.003421037,"teacher_disagreement_score":0.008262462,"about_ca_system_score_codex":0.00048812787,"about_ca_system_score_gemma":0.0012586489,"threshold_uncertainty_score":0.02764064},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64153504,0.00021346354,0.3443943,0.00017182418,0.000077250195,0.000114193535,0.0002939613,0.002363475,0.010836584],"genre_scores_gemma":[0.84153825,0.00024689824,0.1534057,0.00004575804,0.000020212019,0.00012720074,0.0005639045,0.00020175958,0.0038504163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998281,0.00003581059,0.000009569424,0.000034138524,0.000059978887,0.000032418517],"domain_scores_gemma":[0.9995421,0.00019852915,0.000025937954,0.00008856481,0.00011918016,0.000025642097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002325573,0.0004321791,0.00047465652,0.00021126766,0.00036784142,0.00049011584,0.00093906216,0.00030870896,0.0029200604],"category_scores_gemma":[0.00084888807,0.00018927889,0.00040086455,0.00052519946,0.00041472353,0.0007718207,0.00036838133,0.00057914207,0.00049377204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036571268,0.000104930834,0.005439892,0.00015571971,0.00007656819,0.00034527277,0.00044398257,0.865269,0.0482393,0.017220542,0.0030741766,0.059264872],"study_design_scores_gemma":[0.00003149149,0.00007685686,0.0006421526,0.0000033394615,0.000016918702,0.000032428394,0.00004221598,0.98135453,0.013134491,0.0019017828,0.0027527802,0.000010899685],"about_ca_topic_score_codex":0.009885104,"about_ca_topic_score_gemma":0.006105714,"teacher_disagreement_score":0.009885104,"about_ca_system_score_codex":0.0004906885,"about_ca_system_score_gemma":0.0008513745,"threshold_uncertainty_score":0.019655108},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051208485,0.0066322885,0.9090154,0.0009776311,0.00046566373,0.00020750455,0.000389254,0.02255135,0.00855244],"genre_scores_gemma":[0.54871374,0.002666076,0.41500172,0.0020960153,0.0005399231,0.00039782282,0.0012046905,0.002129704,0.027250322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896026,0.00011738677,0.00004607826,0.00017103799,0.0005571869,0.00014803247],"domain_scores_gemma":[0.99800986,0.00032417953,0.0002629676,0.0008200562,0.00046392222,0.000119138036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079616904,0.001066038,0.0010684376,0.0009517183,0.0008111336,0.001005355,0.0041401703,0.0012188765,0.0043431656],"category_scores_gemma":[0.0022299022,0.00056581985,0.0011358719,0.0009915668,0.0009868686,0.0028555861,0.0019877336,0.002098117,0.0028738095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019167899,0.00058230775,0.0073027546,0.00090901717,0.0003948212,0.001003775,0.00053519965,0.12320431,0.1640985,0.05844497,0.061359365,0.5802481],"study_design_scores_gemma":[0.00035717155,0.0018750842,0.002227803,0.00013614424,0.0004962157,0.0026728234,0.00019596939,0.68145823,0.15644275,0.026771275,0.12713182,0.00023469073],"about_ca_topic_score_codex":0.002334453,"about_ca_topic_score_gemma":0.0034386432,"teacher_disagreement_score":0.0043431656,"about_ca_system_score_codex":0.0006689366,"about_ca_system_score_gemma":0.0014870663,"threshold_uncertainty_score":0.014529288},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041031558,0.094825804,0.115640804,0.59472644,0.02166154,0.000084069885,0.0025893312,0.0029966584,0.12644382],"genre_scores_gemma":[0.6174249,0.067916684,0.057914447,0.086116664,0.012901069,0.0001941551,0.0025175116,0.0026284559,0.15238608],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845326,0.00042970176,0.00008168799,0.00021726263,0.0005852915,0.00023283594],"domain_scores_gemma":[0.9939819,0.0013198224,0.0004371766,0.0010109991,0.0027281786,0.00052183156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020927617,0.0004838334,0.0009338849,0.0007985929,0.0018827127,0.007243941,0.0021477728,0.002538718,0.015064589],"category_scores_gemma":[0.016208421,0.0003754112,0.00035374233,0.0023079629,0.003309167,0.019311102,0.0013765366,0.0037378876,0.0112389745],"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.00032389152,0.000119571254,0.007276419,0.0007971421,0.00012712371,0.00044416494,0.00096932787,0.0017991477,0.0034189872,0.31691423,0.35798866,0.30982146],"study_design_scores_gemma":[0.000042740292,0.00008375376,0.0016151367,0.0006997952,0.00006245057,0.0010619392,0.0020952972,0.0031868173,0.0029112177,0.30832475,0.6798006,0.000115435876],"about_ca_topic_score_codex":0.009334044,"about_ca_topic_score_gemma":0.011608611,"teacher_disagreement_score":0.015064589,"about_ca_system_score_codex":0.0027669838,"about_ca_system_score_gemma":0.0030006191,"threshold_uncertainty_score":0.050396085},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13287127,0.001025581,0.85778046,0.00048245356,0.00008369898,0.00008942654,0.00032659498,0.0050949235,0.002245573],"genre_scores_gemma":[0.8156235,0.00045816618,0.18090081,0.00021663797,0.00008142866,0.000078446414,0.0005221172,0.0004714878,0.0016474568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958753,0.0011363619,0.00026516835,0.00060748134,0.0017659803,0.0003497913],"domain_scores_gemma":[0.97461164,0.014941177,0.003116531,0.0040500327,0.0029202313,0.00036042352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003057997,0.0009055121,0.0009247895,0.0016673189,0.00078275934,0.0017487754,0.001907456,0.0010199609,0.0017291091],"category_scores_gemma":[0.028449683,0.00093238935,0.0006736099,0.0024866385,0.0008204444,0.0050278297,0.001333523,0.0017509751,0.00075770513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010185018,0.00037067858,0.07283429,0.00033377032,0.00016723001,0.00030845933,0.00034194445,0.46658778,0.030020423,0.0121670365,0.0059994324,0.40985048],"study_design_scores_gemma":[0.000019820061,0.000113435766,0.003431838,0.000014994948,0.00002842997,0.00012968603,0.00002642323,0.9771952,0.013230562,0.004125171,0.0016520286,0.000032449097],"about_ca_topic_score_codex":0.0079032825,"about_ca_topic_score_gemma":0.011544288,"teacher_disagreement_score":0.0079032825,"about_ca_system_score_codex":0.00088879187,"about_ca_system_score_gemma":0.0021359487,"threshold_uncertainty_score":0.016172469},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15203275,0.0006567445,0.7703577,0.00041430944,0.00034710323,0.00049934885,0.0010914871,0.043826886,0.03077366],"genre_scores_gemma":[0.5056794,0.0005225432,0.4592985,0.0007072795,0.000113320224,0.0004890858,0.0031484838,0.008925988,0.021115324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999243,0.00011967105,0.00007067639,0.00012335378,0.00033016817,0.00011313687],"domain_scores_gemma":[0.99748945,0.00071592943,0.00029981794,0.0009344232,0.00048998714,0.00007038026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005001978,0.00072924094,0.00031821852,0.0008278148,0.0003339785,0.0007559785,0.001041899,0.0004065797,0.008769417],"category_scores_gemma":[0.0033838379,0.0003940871,0.00051031995,0.00084853626,0.00043801303,0.000983574,0.0010509979,0.0009778608,0.002471259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009897901,0.0002525887,0.007761853,0.000849989,0.00010999597,0.00084970664,0.00046047603,0.066153236,0.15215072,0.04579018,0.03903652,0.6855949],"study_design_scores_gemma":[0.0002368125,0.00041126282,0.0049055405,0.00022569626,0.00014532535,0.001057265,0.00018362491,0.43209848,0.37840006,0.033895917,0.1483137,0.0001263295],"about_ca_topic_score_codex":0.00088538474,"about_ca_topic_score_gemma":0.0020468244,"teacher_disagreement_score":0.008769417,"about_ca_system_score_codex":0.00053311576,"about_ca_system_score_gemma":0.00097457896,"threshold_uncertainty_score":0.029336631},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15799086,0.00058796204,0.8100119,0.00020932907,0.00012693617,0.00030660414,0.00035687845,0.010635242,0.019774357],"genre_scores_gemma":[0.58584905,0.00027722056,0.4089273,0.00006873472,0.000016810514,0.0002330396,0.0002513489,0.0004988464,0.003877663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99954695,0.00013478698,0.00001774996,0.000039203034,0.00019505035,0.000066180015],"domain_scores_gemma":[0.9991978,0.0005370617,0.000051284893,0.000094127325,0.00008422742,0.000035544206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073401205,0.0007785491,0.00032274929,0.000405989,0.00021101841,0.0005027199,0.0008366789,0.0003539319,0.0065166345],"category_scores_gemma":[0.0015995656,0.00029490143,0.0003448251,0.00017205598,0.0002805933,0.0005809438,0.00042352264,0.0005457061,0.0005353178],"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.0009194928,0.0002254822,0.0022919672,0.00061715406,0.00011208833,0.0014880911,0.0003826437,0.40943965,0.17429292,0.03025372,0.011717626,0.36825916],"study_design_scores_gemma":[0.00033434317,0.0010724255,0.0020144053,0.00007330662,0.000043347947,0.00080897205,0.000079476886,0.78846526,0.16417468,0.0052669994,0.03759442,0.000072418785],"about_ca_topic_score_codex":0.00052013464,"about_ca_topic_score_gemma":0.00083213096,"teacher_disagreement_score":0.0065166345,"about_ca_system_score_codex":0.0002850678,"about_ca_system_score_gemma":0.00036667936,"threshold_uncertainty_score":0.02180034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038163003,0.00006383677,0.99193656,0.00007408212,0.00007036035,0.00005008943,0.000015418533,0.0021528522,0.0018205525],"genre_scores_gemma":[0.03594363,0.00010044996,0.96141255,0.00006963774,0.000024860525,0.000114230665,0.00007928321,0.00042514637,0.0018302171],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995265,0.00008380971,0.00004112192,0.00008387079,0.00018903948,0.0000755957],"domain_scores_gemma":[0.9993931,0.00013729234,0.000037486923,0.00016181575,0.00023618671,0.00003415649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006261243,0.0007582505,0.0006808729,0.0009795495,0.000812997,0.0009975034,0.001427831,0.0007782829,0.0032865987],"category_scores_gemma":[0.0023184526,0.0003653926,0.0008010303,0.0010294297,0.0006936213,0.0011844616,0.0011481877,0.0012392469,0.001637231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003071463,0.00008102189,0.0009939292,0.00017787264,0.000049212376,0.00024619847,0.00024651896,0.12177911,0.046447054,0.10750292,0.008893296,0.71327573],"study_design_scores_gemma":[0.000096307325,0.000117689146,0.00028206807,0.000044201584,0.000033139633,0.00021897603,0.00006805047,0.8581648,0.03630642,0.06469796,0.039918683,0.00005174425],"about_ca_topic_score_codex":0.0035922388,"about_ca_topic_score_gemma":0.0042920904,"teacher_disagreement_score":0.0035922388,"about_ca_system_score_codex":0.0008267199,"about_ca_system_score_gemma":0.0014509403,"threshold_uncertainty_score":0.010994792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1470685,0.003099568,0.8255846,0.0006124817,0.00042699493,0.0001662486,0.00030192055,0.0101569975,0.012582701],"genre_scores_gemma":[0.7610344,0.0014515248,0.2210887,0.00035536286,0.00020286583,0.00010153527,0.0006953607,0.00038570448,0.014684508],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993723,0.00009133606,0.000036400892,0.00008032034,0.00034562746,0.00007397072],"domain_scores_gemma":[0.9984993,0.0004984298,0.00014109095,0.00040410375,0.00041592904,0.000041207695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034853182,0.0005425693,0.00065140444,0.0007105823,0.00043219436,0.0007795024,0.000993705,0.0003332867,0.0022650182],"category_scores_gemma":[0.003399199,0.00040078908,0.00028972962,0.0009615838,0.00020047533,0.0012280927,0.0006428398,0.00093953294,0.0007021543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004413813,0.0001618916,0.007665725,0.00016174036,0.00006331247,0.00021199287,0.00012250883,0.052721087,0.04452009,0.007836066,0.009689007,0.87640524],"study_design_scores_gemma":[0.00007280383,0.00049649633,0.0053609284,0.000056667413,0.0001279802,0.00086845545,0.000059860475,0.8116397,0.13557239,0.007405792,0.03828086,0.000058049973],"about_ca_topic_score_codex":0.001173342,"about_ca_topic_score_gemma":0.003152275,"teacher_disagreement_score":0.0022650182,"about_ca_system_score_codex":0.0003221084,"about_ca_system_score_gemma":0.0009838406,"threshold_uncertainty_score":0.007577181},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79555726,0.0049880077,0.1301739,0.0014916789,0.00092808914,0.0002189624,0.0010959937,0.014981657,0.05056447],"genre_scores_gemma":[0.94529957,0.0005263185,0.042000536,0.00033731395,0.00008282245,0.000106238476,0.0008107573,0.0004795236,0.01035692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961686,0.00006973373,0.000019121662,0.00006040404,0.00012227206,0.000111598594],"domain_scores_gemma":[0.99922955,0.00023480493,0.00003395303,0.00024053207,0.00020260666,0.000058500485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024807797,0.00055222225,0.00050561316,0.00063645956,0.00086685445,0.0007665502,0.0012911747,0.00048270248,0.0069292807],"category_scores_gemma":[0.001982164,0.00037423774,0.00024143829,0.0017293865,0.00039857862,0.001005344,0.0008963768,0.00066534587,0.001295451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004070529,0.00057437626,0.010220243,0.000619968,0.0001778746,0.0008880293,0.0005456892,0.26264885,0.070057325,0.019717326,0.086952426,0.54352736],"study_design_scores_gemma":[0.00027751888,0.00039284007,0.0039465493,0.00004497122,0.0000777678,0.00020167643,0.00021055338,0.91849685,0.037146512,0.018966565,0.020186486,0.000051701372],"about_ca_topic_score_codex":0.0055152024,"about_ca_topic_score_gemma":0.0128338635,"teacher_disagreement_score":0.0069292807,"about_ca_system_score_codex":0.0005081669,"about_ca_system_score_gemma":0.0010422037,"threshold_uncertainty_score":0.023180723},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101078965,0.0024474582,0.8900663,0.00030549683,0.000085929874,0.00009985376,0.00009915325,0.0023441536,0.0034727666],"genre_scores_gemma":[0.92479986,0.00040834575,0.07308728,0.00011479349,0.00007092078,0.000056919424,0.00012871718,0.000113331305,0.001219911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996327,0.0008376342,0.00021929487,0.000482173,0.0018228438,0.00031117952],"domain_scores_gemma":[0.99493885,0.0019816605,0.0006899157,0.00131468,0.00091738015,0.00015745466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015336375,0.00073405256,0.0012179246,0.00088752666,0.0005575612,0.00079112506,0.0028223163,0.0006229791,0.0011175856],"category_scores_gemma":[0.008972275,0.0004866398,0.0005379479,0.0011578233,0.00069027796,0.0019068533,0.0010432786,0.00075722113,0.00041267122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005878303,0.00020784292,0.0056428877,0.00020361732,0.00012190765,0.00013570876,0.00016586937,0.6843692,0.016132142,0.015664114,0.0038066295,0.27296224],"study_design_scores_gemma":[0.00003326419,0.00023321765,0.00070427073,0.000009699338,0.000050001174,0.00023451904,0.00001610909,0.9861958,0.005891918,0.0048950487,0.0017100166,0.000026164696],"about_ca_topic_score_codex":0.002133967,"about_ca_topic_score_gemma":0.0033794749,"teacher_disagreement_score":0.0028223163,"about_ca_system_score_codex":0.0011306846,"about_ca_system_score_gemma":0.0019759217,"threshold_uncertainty_score":0.008203745},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92127067,0.00037675598,0.07479382,0.000056111774,0.000017088594,0.00003988905,0.000033286273,0.0014160933,0.0019962569],"genre_scores_gemma":[0.98145103,0.00006639891,0.017876508,0.00001324586,0.000006611378,0.000014516021,0.000049981772,0.000076026896,0.00044566134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999411,0.000078205325,0.000030357305,0.00008387886,0.00024890012,0.0001477325],"domain_scores_gemma":[0.9987607,0.00044284537,0.00019453817,0.00016367825,0.00037506904,0.000063165615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005372385,0.0006227137,0.0003904797,0.00042957583,0.0003172652,0.0006860515,0.00086827757,0.00028644604,0.000966956],"category_scores_gemma":[0.003031369,0.00024009537,0.00018426993,0.00046425135,0.00032825614,0.0008556809,0.00021189969,0.00043242655,0.00016977251],"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.0013614075,0.00034591975,0.0074307118,0.00017589709,0.00011182641,0.00018516526,0.00022664768,0.44132417,0.4171297,0.0043093003,0.0010099842,0.12638925],"study_design_scores_gemma":[0.0000740681,0.00077149447,0.0032283273,0.000006563286,0.00008833304,0.00007043337,0.00003160326,0.7706244,0.2235374,0.0004817311,0.0010617706,0.000023827266],"about_ca_topic_score_codex":0.003183367,"about_ca_topic_score_gemma":0.0035304402,"teacher_disagreement_score":0.003183367,"about_ca_system_score_codex":0.0009232268,"about_ca_system_score_gemma":0.0009596628,"threshold_uncertainty_score":0.006698549},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5986319,0.0005782879,0.39546064,0.0003158531,0.0000669217,0.000037508395,0.00008364535,0.0006040999,0.004221174],"genre_scores_gemma":[0.9790413,0.000094313065,0.020377206,0.000039202092,0.000008873214,0.000023411072,0.000034232413,0.000034190325,0.0003472482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997836,0.00007624063,0.000009444915,0.000032835498,0.00004596072,0.00005189821],"domain_scores_gemma":[0.9996425,0.00015391677,0.00006376197,0.000046251098,0.000054477678,0.000039096936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002876672,0.00036725975,0.00033740976,0.00019546752,0.00031350733,0.00036926736,0.00063438993,0.00031190907,0.0004638123],"category_scores_gemma":[0.0010059505,0.00023806911,0.0002933513,0.00033625067,0.00029875748,0.0004660013,0.0003105593,0.00031222205,0.00009283274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006680046,0.00002386969,0.00053600915,0.000015521613,0.0000085224765,0.00004409753,0.000024791265,0.9866389,0.00534019,0.0011790262,0.00025810706,0.005864302],"study_design_scores_gemma":[0.0000026699156,0.0000109541925,0.00011320217,4.8749996e-7,0.0000012910364,0.0000044998296,0.0000039389765,0.99897254,0.00048849924,0.0003231387,0.000077165816,0.0000016863663],"about_ca_topic_score_codex":0.004690877,"about_ca_topic_score_gemma":0.0044830316,"teacher_disagreement_score":0.004690877,"about_ca_system_score_codex":0.0005030411,"about_ca_system_score_gemma":0.00083146914,"threshold_uncertainty_score":0.009327173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09401854,0.0005728171,0.87574774,0.00034281673,0.00007014846,0.00012979309,0.00027925742,0.027269272,0.0015696222],"genre_scores_gemma":[0.4283225,0.00030342245,0.5662792,0.00025392254,0.00005127833,0.0001742686,0.0006617509,0.0024895985,0.001464045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937622,0.0012344407,0.00058014813,0.0007989997,0.0030673656,0.00055687927],"domain_scores_gemma":[0.9812459,0.0112519255,0.0021663692,0.0022014754,0.0028209307,0.00031350728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037611357,0.0013030401,0.001344393,0.0052714082,0.0014330313,0.0020687762,0.0017324374,0.00102333,0.0011897173],"category_scores_gemma":[0.018800994,0.001513421,0.0014138502,0.0022988971,0.0013114349,0.0032914383,0.0018587558,0.0014576078,0.00047862518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008188683,0.000488561,0.07020125,0.00096499064,0.0002827852,0.0011668723,0.0011737676,0.060710177,0.11674817,0.036411162,0.010102807,0.70093054],"study_design_scores_gemma":[0.00013228063,0.0002472306,0.009877735,0.0001421982,0.00024459345,0.0009054724,0.0002197797,0.84439176,0.10073675,0.032159567,0.010754207,0.00018846289],"about_ca_topic_score_codex":0.0063123903,"about_ca_topic_score_gemma":0.009834735,"teacher_disagreement_score":0.0063123903,"about_ca_system_score_codex":0.0015754497,"about_ca_system_score_gemma":0.0046965773,"threshold_uncertainty_score":0.019891083},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9928687,0.00023560945,0.0051226974,0.00006829217,0.000011781652,0.000024483728,0.00018121123,0.0005880756,0.00089911243],"genre_scores_gemma":[0.9955433,0.000087747685,0.0036220646,0.000022400563,0.000006497491,0.000020029396,0.00039528203,0.00016008265,0.00014252502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790704,0.0006516137,0.00014459115,0.00028374253,0.00072819943,0.00028490822],"domain_scores_gemma":[0.972415,0.019309059,0.0032717641,0.0024262774,0.0022730273,0.00030494927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021196757,0.000717819,0.00030984302,0.0010534584,0.00031145976,0.0006788837,0.00046878544,0.0003593524,0.00048751058],"category_scores_gemma":[0.025037548,0.0003261297,0.00029877826,0.0014138274,0.00051009184,0.0010015706,0.0004028764,0.0004946829,0.00015546918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032393353,0.0008407835,0.18402472,0.0005318874,0.0002784056,0.00088401727,0.00056620274,0.43686244,0.20502174,0.0019367725,0.0017699838,0.16404372],"study_design_scores_gemma":[0.000080723206,0.0021583408,0.0945966,0.000027436834,0.00013754441,0.0005057321,0.00015062853,0.70057076,0.19922921,0.0013208755,0.0011512786,0.00007075765],"about_ca_topic_score_codex":0.0014737543,"about_ca_topic_score_gemma":0.0014651805,"teacher_disagreement_score":0.0021196757,"about_ca_system_score_codex":0.0005522033,"about_ca_system_score_gemma":0.00058506883,"threshold_uncertainty_score":0.011210024},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68390614,0.00059005513,0.3076567,0.0003702086,0.00015047833,0.000059828923,0.00009330554,0.002668539,0.0045047724],"genre_scores_gemma":[0.89318085,0.00020939895,0.10331511,0.000061668645,0.000047143683,0.000022422706,0.00012065859,0.00032683264,0.0027158891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992312,0.0001362081,0.00004310203,0.0000923609,0.00035470983,0.00014235699],"domain_scores_gemma":[0.99721295,0.0012992333,0.00022252873,0.0005441916,0.0006160656,0.00010506631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011692735,0.00063257595,0.00059383037,0.0006826964,0.0008809399,0.0016524334,0.0013131165,0.00056895294,0.0019003547],"category_scores_gemma":[0.005019973,0.00041620157,0.0005327064,0.0010590274,0.0010799299,0.0026851096,0.00067666295,0.00079795206,0.00028064518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030771468,0.0005660495,0.026898067,0.00043781122,0.00015171422,0.00034380014,0.0006088185,0.4173716,0.17499678,0.055696554,0.0037882174,0.3160635],"study_design_scores_gemma":[0.000044241904,0.00012921152,0.0018376843,0.0000056237827,0.00005290893,0.00006606147,0.000091268776,0.92315584,0.060152378,0.013090423,0.0013536867,0.000020633423],"about_ca_topic_score_codex":0.006250449,"about_ca_topic_score_gemma":0.008523629,"teacher_disagreement_score":0.006250449,"about_ca_system_score_codex":0.00081543013,"about_ca_system_score_gemma":0.002144206,"threshold_uncertainty_score":0.012428105},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03566541,0.0004731739,0.95218974,0.00014845493,0.00006694253,0.00007892821,0.000035627,0.0015506712,0.009790996],"genre_scores_gemma":[0.33308408,0.00049921137,0.662219,0.00009521194,0.000026092797,0.00012272345,0.00006518297,0.00028333202,0.0036051923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962366,0.00012154939,0.000026696705,0.000036316593,0.00014040279,0.000051353698],"domain_scores_gemma":[0.99966836,0.00017733665,0.000032481817,0.000064300984,0.00004181341,0.000015607953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049459335,0.0003699437,0.00023393231,0.0003153407,0.00028825144,0.0010002042,0.00050903374,0.00037701937,0.0029485715],"category_scores_gemma":[0.0011105123,0.0003650455,0.0004197279,0.00028995314,0.0005882061,0.00057007384,0.00046113264,0.0006353811,0.00058825855],"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.0002828589,0.00012990828,0.0025381073,0.00068354234,0.000055764314,0.00045046536,0.0006015374,0.46144313,0.0907509,0.21015772,0.0025413774,0.23036471],"study_design_scores_gemma":[0.00010656428,0.00027845334,0.00043023436,0.00011375906,0.00004745784,0.00017143997,0.000082741506,0.80798155,0.07403015,0.07664027,0.040089272,0.000028104838],"about_ca_topic_score_codex":0.0015121836,"about_ca_topic_score_gemma":0.002466659,"teacher_disagreement_score":0.0029485715,"about_ca_system_score_codex":0.0005131048,"about_ca_system_score_gemma":0.0008489572,"threshold_uncertainty_score":0.009863973},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085169226,0.00016570551,0.8871584,0.00009967399,0.000046215348,0.00055414083,0.00066171074,0.019712612,0.006432381],"genre_scores_gemma":[0.5010549,0.0001434504,0.4940313,0.00008973721,0.000028483535,0.0010134669,0.0006177608,0.0008992821,0.0021216054],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994936,0.00010395724,0.000038364422,0.00014117232,0.00016563483,0.00005723674],"domain_scores_gemma":[0.99917173,0.0002563711,0.00009453707,0.00031029072,0.00010959884,0.00005744576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005472588,0.0010749246,0.00054027804,0.001115325,0.00036194563,0.00072307995,0.0016545344,0.0004979408,0.00415606],"category_scores_gemma":[0.0014835366,0.00043256176,0.00041263975,0.00053373224,0.00043090238,0.00077406876,0.0006621993,0.0006786864,0.0007863149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012389828,0.0008015266,0.019493412,0.00046172817,0.00019956997,0.0011760119,0.00060242997,0.09860537,0.5327059,0.034540195,0.0077105733,0.3024643],"study_design_scores_gemma":[0.00016493787,0.00080200104,0.016450865,0.000075428405,0.00008731701,0.0013643265,0.0001747809,0.71100646,0.22757944,0.012680742,0.029438933,0.00017466243],"about_ca_topic_score_codex":0.0009519405,"about_ca_topic_score_gemma":0.0013042663,"teacher_disagreement_score":0.00415606,"about_ca_system_score_codex":0.0004162692,"about_ca_system_score_gemma":0.0005367709,"threshold_uncertainty_score":0.013903379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3222292,0.00094745914,0.66506356,0.00039425658,0.000111294765,0.00018967732,0.00007867528,0.0063775284,0.004608355],"genre_scores_gemma":[0.8328748,0.0002168902,0.16382001,0.00006278689,0.00006302096,0.0001350912,0.00013689208,0.0002329961,0.0024575111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935454,0.00013862942,0.00005425494,0.00012331674,0.00024066128,0.00008863809],"domain_scores_gemma":[0.99901783,0.00036064204,0.00013394444,0.00023804668,0.00016396743,0.00008553343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000916998,0.00041651772,0.0005181306,0.00049039203,0.0008343553,0.0012059922,0.0012024066,0.00039776915,0.001949301],"category_scores_gemma":[0.0026111682,0.00034004723,0.00027952204,0.00045576468,0.0005154172,0.0012804936,0.00058388506,0.00068402564,0.0004477279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012094101,0.00045403425,0.0051091183,0.00023343858,0.00011972658,0.00034273745,0.0004045052,0.45036164,0.17509574,0.025822407,0.0050606085,0.33578664],"study_design_scores_gemma":[0.00013834656,0.00016815795,0.00078101474,0.000005807646,0.000034676705,0.00005542215,0.000029214392,0.9718788,0.017335733,0.005908515,0.0036473598,0.000016857437],"about_ca_topic_score_codex":0.0013086374,"about_ca_topic_score_gemma":0.0017834659,"teacher_disagreement_score":0.001949301,"about_ca_system_score_codex":0.0007040791,"about_ca_system_score_gemma":0.0007329062,"threshold_uncertainty_score":0.0065211058},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0705605,0.009788421,0.40471175,0.0021546646,0.002086732,0.0014681966,0.0045751138,0.11893854,0.385716],"genre_scores_gemma":[0.450341,0.0024802445,0.33173135,0.0018957502,0.0002453043,0.0015115081,0.010973186,0.0058998205,0.19492184],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928445,0.00008301789,0.000030555373,0.0000956542,0.00037494037,0.00013139276],"domain_scores_gemma":[0.999527,0.000036310485,0.00004099531,0.000066434666,0.00022066552,0.00010862371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040010636,0.00077833707,0.00063777727,0.0006874052,0.00061263196,0.0013837505,0.001972839,0.00049674493,0.032093123],"category_scores_gemma":[0.0011609675,0.00045297298,0.00025874865,0.00091263064,0.00030020592,0.0010408994,0.0014896642,0.0013026313,0.009349171],"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.0018208947,0.00032030925,0.0021630065,0.00073347,0.00012981887,0.0004869348,0.00028660742,0.015320733,0.06599533,0.033017486,0.51140076,0.3683247],"study_design_scores_gemma":[0.00061295653,0.00080788817,0.0023129426,0.000126245,0.00010038057,0.0007781034,0.00007962498,0.16524598,0.043454587,0.008504176,0.7777767,0.00020040908],"about_ca_topic_score_codex":0.003840606,"about_ca_topic_score_gemma":0.0055913115,"teacher_disagreement_score":0.032093123,"about_ca_system_score_codex":0.0012159523,"about_ca_system_score_gemma":0.0027343233,"threshold_uncertainty_score":0.10736227},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09759319,0.04322405,0.65480393,0.005153438,0.0021250686,0.0006760923,0.0044778585,0.023283433,0.16866297],"genre_scores_gemma":[0.7009958,0.013223464,0.16922425,0.0035378758,0.0012569359,0.0005602703,0.005914192,0.0019280157,0.103359155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981823,0.00023341141,0.0001155791,0.00031637747,0.0008044607,0.0003479117],"domain_scores_gemma":[0.99490684,0.00050069886,0.00025143079,0.0026105214,0.0014141735,0.00031628742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010575217,0.0007434878,0.0010763223,0.0014715161,0.001573199,0.003726257,0.0035003768,0.001318521,0.012284645],"category_scores_gemma":[0.0043425304,0.0006990067,0.0007120106,0.0027772924,0.0015343985,0.005460137,0.0030852084,0.0016792782,0.006684047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006929279,0.00022322776,0.0042889174,0.0009865873,0.00022017097,0.00075172365,0.0005377181,0.022444334,0.027623437,0.31509417,0.17572524,0.45141166],"study_design_scores_gemma":[0.00016546652,0.0004928799,0.0017138219,0.0004019284,0.00032474013,0.0029918533,0.00027263365,0.08515112,0.043413736,0.15855816,0.70631725,0.00019640719],"about_ca_topic_score_codex":0.0061185313,"about_ca_topic_score_gemma":0.0063247154,"teacher_disagreement_score":0.012284645,"about_ca_system_score_codex":0.0014387121,"about_ca_system_score_gemma":0.0033871569,"threshold_uncertainty_score":0.04109621},"labels":[],"label_agreement":null},{"id":"W2077845927","doi":"10.1145/2775052.2661090","title":"Using JavaScript and WebCL for numerical computations","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"JavaScript; Computer science; Unobtrusive JavaScript; Programming language; Computation; Code (set theory); Web application; Variety (cybernetics); Rich Internet application; World Wide Web; Artificial intelligence","score_opus":0.05326982129687474,"score_gpt":0.31206418318978846,"score_spread":0.2587943618929137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077845927","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018134372,0.000557774,0.84746814,0.00054097467,0.0003962485,0.0001864731,0.0012621763,0.104672045,0.026781779],"genre_scores_gemma":[0.15957686,0.0006383786,0.80031806,0.00069897994,0.00016177323,0.0005995405,0.003497861,0.026185874,0.00832274],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99485636,0.0009915292,0.00045821554,0.00083425886,0.0025380047,0.00032160012],"domain_scores_gemma":[0.9876195,0.0046263766,0.0008681338,0.003567504,0.0029621955,0.0003563038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022520456,0.0011835666,0.00078025076,0.0013004254,0.0007400478,0.0026814956,0.0022696846,0.0010569195,0.006513146],"category_scores_gemma":[0.019578677,0.0006484922,0.00091826316,0.002492806,0.0010811177,0.0028042851,0.0017558952,0.0023311945,0.0074896067],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015934536,0.000677397,0.008467575,0.001892465,0.0002252818,0.0008870448,0.00084254984,0.07121905,0.13703442,0.056397326,0.087062985,0.6337004],"study_design_scores_gemma":[0.00044450132,0.00039412026,0.0057251947,0.00047179876,0.00009831686,0.0011733453,0.00017731091,0.45827016,0.23843153,0.07534167,0.21920618,0.00026583223],"about_ca_topic_score_codex":0.0026771217,"about_ca_topic_score_gemma":0.0021489135,"teacher_disagreement_score":0.006513146,"about_ca_system_score_codex":0.00087692,"about_ca_system_score_gemma":0.0019348467,"threshold_uncertainty_score":0.021788657},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31415543,0.0006908729,0.6737799,0.0002567258,0.000271421,0.000089581205,0.00010012326,0.0012973419,0.009358522],"genre_scores_gemma":[0.89087945,0.00013691116,0.105140336,0.00005860498,0.000053106603,0.000058011214,0.00009446604,0.00014602668,0.0034331458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978024,0.00006302239,0.000013929802,0.000032675136,0.00006244934,0.000047714784],"domain_scores_gemma":[0.99945885,0.00020309698,0.000048143294,0.00011802214,0.000108258486,0.000063578795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003991855,0.000334907,0.0004505842,0.00039544905,0.0005662366,0.00065992144,0.0009414972,0.00040599526,0.002625872],"category_scores_gemma":[0.0010927229,0.00028885392,0.00025050205,0.000667063,0.00034766318,0.00045438303,0.0008312743,0.0003914978,0.00041452175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011313906,0.00023547506,0.0022850565,0.00020106838,0.000059182756,0.00030780994,0.0001412001,0.8203153,0.031845763,0.012410913,0.0035161404,0.12755065],"study_design_scores_gemma":[0.000032562748,0.00011747653,0.0003553072,0.0000043996993,0.000010552217,0.000053339863,0.000038714534,0.98871034,0.0042900285,0.005215284,0.0011659289,0.0000060846564],"about_ca_topic_score_codex":0.00096833205,"about_ca_topic_score_gemma":0.0020835635,"teacher_disagreement_score":0.002625872,"about_ca_system_score_codex":0.00030805424,"about_ca_system_score_gemma":0.0004679153,"threshold_uncertainty_score":0.008784473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27797708,0.006897376,0.6969981,0.00051574386,0.00045151947,0.00033056183,0.0003768902,0.010778133,0.0056745815],"genre_scores_gemma":[0.8249239,0.0013224357,0.16730782,0.0002617313,0.00015511134,0.00015625694,0.0004316837,0.00025686508,0.005184341],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965847,0.000040059593,0.000039615625,0.00007013534,0.000150429,0.000041361505],"domain_scores_gemma":[0.9991134,0.00020765797,0.00014752745,0.0002539852,0.00022421489,0.00005308158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029101525,0.00058589806,0.00043028648,0.0005925532,0.00037138083,0.0011690926,0.001605489,0.000381734,0.0012578495],"category_scores_gemma":[0.0012439733,0.00027010575,0.000273095,0.00045432438,0.00029438233,0.0016158312,0.0007687573,0.0006898015,0.00043971676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062294875,0.00043583414,0.004573158,0.000702953,0.00010404842,0.0004589505,0.0004854534,0.023890678,0.48933116,0.0059075844,0.0069300416,0.46655723],"study_design_scores_gemma":[0.000100622055,0.000679058,0.0034441913,0.00006783606,0.00016975123,0.00082820415,0.00023863337,0.39499575,0.5708732,0.0045626773,0.023962162,0.00007792841],"about_ca_topic_score_codex":0.0005531639,"about_ca_topic_score_gemma":0.0012990865,"teacher_disagreement_score":0.001605489,"about_ca_system_score_codex":0.00025996647,"about_ca_system_score_gemma":0.0005777122,"threshold_uncertainty_score":0.004207909},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8421594,0.0042192377,0.042252287,0.0019040114,0.00047317817,0.00057582266,0.031595785,0.021677224,0.055143222],"genre_scores_gemma":[0.805424,0.002372931,0.08685514,0.00043670295,0.00033768322,0.0006513405,0.09367325,0.0033990957,0.0068499423],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9974717,0.00033848823,0.00019995419,0.0003361061,0.0013674048,0.0002863507],"domain_scores_gemma":[0.9953158,0.0012882324,0.0004523066,0.0008175481,0.001848429,0.0002776924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020498566,0.0015329754,0.00061333535,0.0023076027,0.0008444726,0.0010959483,0.001742914,0.0004520639,0.0014393766],"category_scores_gemma":[0.0056397584,0.00031694022,0.0005196039,0.0067402413,0.00046734608,0.0010633821,0.00056519837,0.0011750483,0.0006181329],"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.002308521,0.00186,0.051010538,0.0018108266,0.00034414316,0.000950429,0.0006283229,0.20525245,0.12357369,0.023573987,0.28137207,0.30731505],"study_design_scores_gemma":[0.0002974293,0.00094046467,0.090608366,0.00012872396,0.00012463678,0.0010614484,0.00037405352,0.67894197,0.100140736,0.0055523915,0.12165426,0.0001754726],"about_ca_topic_score_codex":0.009589532,"about_ca_topic_score_gemma":0.011982565,"teacher_disagreement_score":0.009589532,"about_ca_system_score_codex":0.001289865,"about_ca_system_score_gemma":0.001787376,"threshold_uncertainty_score":0.019067407},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5643212,0.0009089273,0.42433688,0.00032604742,0.00007352853,0.00010644704,0.000032544674,0.0025140855,0.0073802867],"genre_scores_gemma":[0.9546979,0.00009631246,0.043912966,0.0000598582,0.000015737714,0.0000432287,0.000032091833,0.00010964657,0.001032392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987483,0.00038339308,0.000065448294,0.00018949293,0.00036622756,0.0002471362],"domain_scores_gemma":[0.9983272,0.0005287837,0.00018692533,0.00046847016,0.00023979976,0.00024880783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014662036,0.0006672563,0.0007833399,0.00062523165,0.0009910563,0.0018373276,0.001828633,0.0005062408,0.00077489973],"category_scores_gemma":[0.0038314844,0.0005146232,0.0003940026,0.0006752348,0.00097576965,0.0017591052,0.002793812,0.0010622022,0.00017278643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013092223,0.00044607767,0.017790409,0.0001582978,0.00018080209,0.0008779812,0.00089280726,0.66296554,0.11856784,0.035373706,0.0030729542,0.15836428],"study_design_scores_gemma":[0.0000610708,0.00009885617,0.000859015,0.0000073611886,0.00002934409,0.00007808049,0.00007656678,0.96916044,0.020366618,0.0075719007,0.0016703664,0.000020345102],"about_ca_topic_score_codex":0.0037278065,"about_ca_topic_score_gemma":0.0054582157,"teacher_disagreement_score":0.0037278065,"about_ca_system_score_codex":0.0011832736,"about_ca_system_score_gemma":0.0012187927,"threshold_uncertainty_score":0.008585274},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87101483,0.0020283966,0.11998548,0.0003165241,0.000088014545,0.00007230454,0.00012706954,0.00058571284,0.0057816003],"genre_scores_gemma":[0.9867878,0.00026926264,0.011349351,0.000027905651,0.00002377954,0.000016834965,0.000041389947,0.000037045316,0.0014466372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970716,0.000035453082,0.000011049501,0.00005287484,0.00015297376,0.000040415547],"domain_scores_gemma":[0.9991756,0.00037638174,0.00015595599,0.000088018125,0.000184022,0.000020058775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002708012,0.00023577764,0.00030163839,0.00028468834,0.0002408072,0.00038648138,0.0006018402,0.00020610506,0.0015514282],"category_scores_gemma":[0.0014551281,0.00018329054,0.00016842551,0.00042110076,0.0002815376,0.00088392134,0.00014085165,0.00033813863,0.00013485523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007832645,0.00021838878,0.003918398,0.00037333387,0.00008335553,0.00045940914,0.00029945755,0.56750274,0.33357126,0.023593234,0.0021686698,0.06702854],"study_design_scores_gemma":[0.000029251276,0.0005422159,0.0023222303,0.000009256822,0.000033950266,0.00015252616,0.00004210874,0.93585885,0.056956623,0.0012610691,0.0027733059,0.000018644718],"about_ca_topic_score_codex":0.0019417264,"about_ca_topic_score_gemma":0.00284483,"teacher_disagreement_score":0.0019417264,"about_ca_system_score_codex":0.0008080655,"about_ca_system_score_gemma":0.0007079331,"threshold_uncertainty_score":0.0058628917},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21102609,0.008131094,0.7266104,0.0006490205,0.0005570331,0.0004133948,0.0006813765,0.024821717,0.027109925],"genre_scores_gemma":[0.7574547,0.0015539238,0.22506517,0.0002898933,0.0001299978,0.00025766264,0.0010627136,0.0005980053,0.013587841],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99967134,0.000038661576,0.00002612358,0.00003789832,0.00015938573,0.000066680404],"domain_scores_gemma":[0.99930394,0.00013753683,0.00008078728,0.00021114042,0.00021359322,0.000053074848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031436153,0.00048372592,0.00037141712,0.0007422461,0.00075634953,0.0009260292,0.0020254827,0.00046643283,0.0035514578],"category_scores_gemma":[0.001199052,0.0003026622,0.00024444528,0.0014009445,0.00025094932,0.0014154002,0.0005478473,0.00062815566,0.000685773],"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.0017152624,0.00045260412,0.008997298,0.0011024271,0.00028949114,0.0012334612,0.00049344206,0.045977134,0.14888135,0.022304382,0.067386344,0.7011669],"study_design_scores_gemma":[0.0005292234,0.002473524,0.005873986,0.00021297776,0.00029745407,0.0024030332,0.00030130957,0.572657,0.25800502,0.008763702,0.14830421,0.00017863668],"about_ca_topic_score_codex":0.0024976947,"about_ca_topic_score_gemma":0.008956072,"teacher_disagreement_score":0.0035514578,"about_ca_system_score_codex":0.00073227054,"about_ca_system_score_gemma":0.0010652696,"threshold_uncertainty_score":0.011880815},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30977467,0.0005566464,0.66585654,0.00060051394,0.00024981037,0.00012754198,0.00014132698,0.012853496,0.009839524],"genre_scores_gemma":[0.8189667,0.00027616275,0.16265528,0.0004170506,0.000055261426,0.00016114024,0.0002812993,0.0021093797,0.015077739],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99773836,0.00051812624,0.00013246591,0.0004123455,0.00085063867,0.00034800795],"domain_scores_gemma":[0.9886557,0.0040393495,0.0007490493,0.0046430463,0.0012649439,0.0006478888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029723337,0.00085834187,0.0008409422,0.00067354605,0.0014520385,0.0028507444,0.0032220448,0.00170423,0.0038194365],"category_scores_gemma":[0.011580697,0.00094803405,0.0004782624,0.000479491,0.0027732502,0.0056117233,0.0055366056,0.0020416754,0.0009680391],"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.0026583779,0.00066631834,0.069509655,0.00086673995,0.0003361711,0.006691585,0.019192494,0.089688174,0.22006942,0.20991631,0.01791769,0.36248708],"study_design_scores_gemma":[0.00018265116,0.0007386125,0.0067986636,0.00019998818,0.000344336,0.002519424,0.0025957846,0.47099757,0.24768615,0.16126736,0.10638561,0.0002838082],"about_ca_topic_score_codex":0.0013275292,"about_ca_topic_score_gemma":0.0013557723,"teacher_disagreement_score":0.0038194365,"about_ca_system_score_codex":0.0005516554,"about_ca_system_score_gemma":0.0008536523,"threshold_uncertainty_score":0.015719414},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45218438,0.00058890035,0.5279773,0.0018052385,0.000057413243,0.00019958553,0.00004761981,0.0047766934,0.012362829],"genre_scores_gemma":[0.6914083,0.00021933294,0.30286267,0.00022808865,0.000016706788,0.00013046617,0.000064276115,0.0002885722,0.0047815363],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941325,0.00021693007,0.000026022211,0.00005668779,0.00019706908,0.000090155474],"domain_scores_gemma":[0.9989292,0.00023930518,0.000118661505,0.00041369328,0.000196696,0.000102436505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010561801,0.00032481126,0.00029003306,0.0002345599,0.00057913817,0.0014634165,0.0014330891,0.0005820975,0.0008348102],"category_scores_gemma":[0.002248551,0.00033064254,0.00016323233,0.00039279182,0.000792174,0.0014085491,0.0015372107,0.0011750534,0.00025376148],"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.00086438045,0.001036333,0.015188839,0.0004964841,0.0000842007,0.00101593,0.0045766863,0.28634644,0.32147932,0.11613433,0.012930453,0.23984672],"study_design_scores_gemma":[0.00016174054,0.00031326184,0.0029049122,0.000030372532,0.000023464165,0.000314549,0.00090890954,0.8638282,0.08330108,0.022372492,0.025784113,0.000056923083],"about_ca_topic_score_codex":0.0012935504,"about_ca_topic_score_gemma":0.0040896777,"teacher_disagreement_score":0.0014634165,"about_ca_system_score_codex":0.00058672676,"about_ca_system_score_gemma":0.0011988413,"threshold_uncertainty_score":0.0055856705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04220118,0.00091019506,0.94233686,0.00036178067,0.00013676206,0.00008253815,0.00006943148,0.0045315255,0.009369814],"genre_scores_gemma":[0.15370771,0.0013569656,0.84088635,0.00016203034,0.000060455146,0.00013384195,0.00020195082,0.0008829885,0.0026076878],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995654,0.00009709345,0.000041219486,0.00005187338,0.00019973573,0.000044671786],"domain_scores_gemma":[0.9991417,0.00027901007,0.000080995706,0.0002243866,0.0002564304,0.00001742149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006152889,0.0003623423,0.00027222754,0.00043976784,0.0003521857,0.0008140109,0.0005224192,0.00035632413,0.0011619477],"category_scores_gemma":[0.002042586,0.0003764257,0.00042994495,0.0007660953,0.00043095212,0.0010187591,0.00045632396,0.0010229992,0.00059523317],"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.00024956118,0.00012979553,0.00489908,0.0006884119,0.0001569882,0.00035306218,0.0007996307,0.12589249,0.14378938,0.12534027,0.013259185,0.5844422],"study_design_scores_gemma":[0.00013694065,0.000448985,0.0027859416,0.00019924993,0.00017593458,0.00057007157,0.00018782764,0.56578934,0.22090957,0.036118343,0.17258762,0.00009013968],"about_ca_topic_score_codex":0.0011330962,"about_ca_topic_score_gemma":0.0019180457,"teacher_disagreement_score":0.0011619477,"about_ca_system_score_codex":0.00045461074,"about_ca_system_score_gemma":0.0013715448,"threshold_uncertainty_score":0.0038870573},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012447046,0.001608069,0.8120652,0.00069944025,0.00069068,0.00034781307,0.002998761,0.096363574,0.07277944],"genre_scores_gemma":[0.19082315,0.0022228854,0.68444437,0.0011110262,0.00030885145,0.00062999025,0.01809667,0.039664526,0.06269851],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855775,0.00015584633,0.00008435387,0.00021127875,0.0007776552,0.00021309305],"domain_scores_gemma":[0.99914503,0.0001473998,0.00006583632,0.00030387068,0.00027022848,0.00006762048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008044906,0.00093220425,0.00072129123,0.000942687,0.00071464817,0.0018061101,0.002147081,0.00058692956,0.019540038],"category_scores_gemma":[0.0024889281,0.00047794404,0.0011726264,0.00080747815,0.00058145035,0.0019820998,0.002029478,0.0011911109,0.008144734],"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.0007152136,0.00020320836,0.0034941153,0.0009241749,0.0001149635,0.00025452382,0.0003169377,0.05166731,0.019968333,0.15762195,0.13521986,0.6294995],"study_design_scores_gemma":[0.00010030411,0.00018519541,0.0012623799,0.00016528994,0.000063840336,0.00038723322,0.000096216754,0.16116922,0.028773945,0.0716632,0.73603165,0.00010148356],"about_ca_topic_score_codex":0.0031984323,"about_ca_topic_score_gemma":0.004448924,"teacher_disagreement_score":0.019540038,"about_ca_system_score_codex":0.0009639054,"about_ca_system_score_gemma":0.0020277037,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85062057,0.0018424768,0.13207969,0.0009103059,0.00010675276,0.0000541072,0.00022855293,0.0017107928,0.012446782],"genre_scores_gemma":[0.9464196,0.0002655276,0.05031211,0.000098545876,0.00003649412,0.000052982497,0.00019785174,0.00009525623,0.0025216944],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891293,0.0001695176,0.00007084568,0.00014700412,0.00043845174,0.00026129154],"domain_scores_gemma":[0.99724764,0.0013646865,0.00028355504,0.000540816,0.00046179496,0.00010143496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070030254,0.00036050842,0.00034418495,0.00058888237,0.0007030158,0.0013256043,0.0013898569,0.0004404171,0.003466079],"category_scores_gemma":[0.0041162833,0.00023222627,0.00029049965,0.0013397473,0.00049295893,0.00223736,0.0007224297,0.00081308454,0.00032471682],"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.0021474054,0.0008558545,0.027070118,0.00068119494,0.0002664539,0.00066315214,0.00085121236,0.32733488,0.11825485,0.12027333,0.015756339,0.38584524],"study_design_scores_gemma":[0.00004745106,0.00022339038,0.0022272838,0.000025405894,0.000057290094,0.000118572054,0.00013147255,0.94644594,0.029926175,0.018194372,0.002575585,0.000026993566],"about_ca_topic_score_codex":0.0038766004,"about_ca_topic_score_gemma":0.011307227,"teacher_disagreement_score":0.0038766004,"about_ca_system_score_codex":0.0016991041,"about_ca_system_score_gemma":0.001903579,"threshold_uncertainty_score":0.0123279095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4560544,0.0008663629,0.5086678,0.0002077062,0.000121260535,0.00016955349,0.00031749468,0.005961209,0.02763432],"genre_scores_gemma":[0.8729455,0.00039355492,0.11522121,0.000070732785,0.000034482266,0.00010189193,0.00035234558,0.00017556456,0.010704771],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998312,0.000016613483,0.000008814423,0.0000280419,0.00008526136,0.000030104056],"domain_scores_gemma":[0.9997545,0.00006246383,0.000042324387,0.00006194061,0.000055229946,0.000023658948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014904469,0.0003862456,0.00016543509,0.00029134535,0.00017013306,0.00048625423,0.000671385,0.00018196277,0.0038994502],"category_scores_gemma":[0.00049651274,0.00017094513,0.00014145223,0.0003919807,0.00023843233,0.0007610643,0.00047321495,0.0004109508,0.0008277778],"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.00069551234,0.00015981945,0.0029717458,0.00024386228,0.000042167318,0.00045015546,0.00012658577,0.15411085,0.3737532,0.015592348,0.006637388,0.44521645],"study_design_scores_gemma":[0.00023956939,0.0014612589,0.0072070314,0.000051639247,0.000057079793,0.0006968321,0.00019535358,0.6838794,0.25376675,0.017104594,0.035263035,0.00007745672],"about_ca_topic_score_codex":0.0006131755,"about_ca_topic_score_gemma":0.0013480572,"teacher_disagreement_score":0.0038994502,"about_ca_system_score_codex":0.00017935259,"about_ca_system_score_gemma":0.00026131212,"threshold_uncertainty_score":0.013044953},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2595354,0.00095008395,0.7136359,0.0003673985,0.00030935844,0.00030766227,0.00017417003,0.006617479,0.018102575],"genre_scores_gemma":[0.817725,0.00039864605,0.17060407,0.00018380501,0.00007844882,0.0002592642,0.00034449145,0.0006120622,0.009794173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951506,0.000046574274,0.000024724914,0.00014978618,0.00017002222,0.00009376357],"domain_scores_gemma":[0.9992204,0.00017062628,0.00011070722,0.00028392012,0.00013111248,0.000083223735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003259485,0.00081763515,0.0006705981,0.00062914996,0.000763747,0.0007834212,0.0013754972,0.00047562123,0.005105175],"category_scores_gemma":[0.0016760693,0.00045956604,0.00041508838,0.000671289,0.0006963667,0.0014996462,0.0020436156,0.00086768577,0.0011112717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012148239,0.0003413523,0.006306045,0.00020981098,0.00010205681,0.00090875104,0.0010369383,0.16630155,0.20424873,0.051824708,0.011506826,0.55599844],"study_design_scores_gemma":[0.00012543995,0.0005442896,0.0020030122,0.000036038884,0.000054705622,0.00074089837,0.00028609092,0.68911207,0.21983719,0.02698228,0.0601933,0.000084737],"about_ca_topic_score_codex":0.00089584774,"about_ca_topic_score_gemma":0.0009137304,"teacher_disagreement_score":0.005105175,"about_ca_system_score_codex":0.00045501848,"about_ca_system_score_gemma":0.00070967886,"threshold_uncertainty_score":0.01707846},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012506841,0.0010817175,0.49184906,0.0006811109,0.0007825062,0.00041920666,0.02484671,0.35097915,0.116853714],"genre_scores_gemma":[0.068112336,0.001503007,0.46440902,0.0016081581,0.00029039776,0.0015279533,0.079188004,0.17743477,0.20592637],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883157,0.00014972402,0.000121644676,0.0002726985,0.00048944564,0.0001347869],"domain_scores_gemma":[0.9986877,0.00042981657,0.00011929401,0.00019913333,0.00046816046,0.00009592219],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00090368395,0.0013348528,0.0006839155,0.0011544263,0.0004811106,0.001856436,0.0023310015,0.0007208301,0.11258542],"category_scores_gemma":[0.003459688,0.0010137275,0.00083731534,0.00078655133,0.0004104555,0.0024797795,0.002548321,0.0016340953,0.065603085],"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.0011350485,0.0002139143,0.0026907136,0.0018152012,0.00013238234,0.00044253957,0.0005412721,0.0075894664,0.03877483,0.0860035,0.514224,0.34643713],"study_design_scores_gemma":[0.00010075062,0.00009486342,0.0006317359,0.0001130911,0.00002922268,0.00040992274,0.00006254711,0.015259512,0.03793361,0.011996367,0.9333066,0.00006187303],"about_ca_topic_score_codex":0.0007009295,"about_ca_topic_score_gemma":0.0011310035,"teacher_disagreement_score":0.8874146,"about_ca_system_score_codex":0.00064524385,"about_ca_system_score_gemma":0.001253483,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17971307,0.002576165,0.77509606,0.00039532737,0.00032399377,0.00052175694,0.0005471738,0.030189717,0.010636668],"genre_scores_gemma":[0.7498518,0.00041749846,0.2406027,0.0003340975,0.00009568668,0.0004141898,0.0013058621,0.0006787084,0.006299516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925107,0.00012859583,0.00006023918,0.00011160788,0.0003026979,0.00014576525],"domain_scores_gemma":[0.9991033,0.00015075522,0.00011550738,0.00033037996,0.00021948817,0.00008060662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064901187,0.0008337517,0.00051517284,0.0008882551,0.0006555717,0.00092137785,0.0027071496,0.0005386719,0.0025218609],"category_scores_gemma":[0.0011484518,0.0003306668,0.0005895124,0.0009747266,0.00053699507,0.0015325915,0.0013202815,0.0009054552,0.0005780507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018999291,0.00064162095,0.014796148,0.0009337898,0.00047844107,0.0011784291,0.00074165897,0.15492755,0.1564596,0.022617485,0.049909096,0.5954163],"study_design_scores_gemma":[0.00033709902,0.001196324,0.004338072,0.000052145202,0.00016600009,0.0005536483,0.00017896654,0.7969955,0.14360619,0.008799193,0.04364776,0.00012911922],"about_ca_topic_score_codex":0.0027641198,"about_ca_topic_score_gemma":0.0032342072,"teacher_disagreement_score":0.0027641198,"about_ca_system_score_codex":0.00091986964,"about_ca_system_score_gemma":0.0014256903,"threshold_uncertainty_score":0.008436501},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013792575,0.00008502635,0.98063385,0.000093590024,0.00003168579,0.000051934843,0.0000452419,0.0040184967,0.0012475481],"genre_scores_gemma":[0.109928325,0.000062897154,0.88659817,0.00008094738,0.000018821143,0.00007775671,0.0001756144,0.0005012239,0.0025562625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964046,0.000054972115,0.000025891863,0.00008935833,0.00013155284,0.000057717134],"domain_scores_gemma":[0.9995092,0.0001320214,0.00003970036,0.00014151313,0.00015237814,0.00002514327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061786664,0.0010043369,0.001011844,0.0010442004,0.00080423185,0.0010569174,0.0016606578,0.0009781851,0.005802758],"category_scores_gemma":[0.001482791,0.0005956577,0.0009214472,0.00094794005,0.00053740677,0.001486413,0.0012257355,0.0011291332,0.0015894672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005216705,0.00016620765,0.000995434,0.00014227901,0.00008835383,0.0001478514,0.000115868635,0.103717715,0.0543461,0.013683061,0.0054709907,0.8206045],"study_design_scores_gemma":[0.0000664805,0.00010177818,0.00026751202,0.000012328621,0.000053938325,0.00006622858,0.00004079594,0.95961094,0.024402138,0.012303774,0.0030495028,0.000024628866],"about_ca_topic_score_codex":0.002674753,"about_ca_topic_score_gemma":0.0042806836,"teacher_disagreement_score":0.005802758,"about_ca_system_score_codex":0.00052813895,"about_ca_system_score_gemma":0.0013325391,"threshold_uncertainty_score":0.01941216},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56203055,0.0009028406,0.40275994,0.00036536687,0.00038563763,0.00039280957,0.00030941895,0.00601614,0.026837239],"genre_scores_gemma":[0.77141124,0.00031296216,0.21141745,0.00023806999,0.000053079577,0.00028993277,0.0004813767,0.00023627993,0.015559663],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99985564,0.000013670959,0.000016959159,0.000025525665,0.000063068685,0.000025125804],"domain_scores_gemma":[0.9998018,0.000047058555,0.000039664214,0.000052917025,0.00004313812,0.000015433592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014888064,0.00042630782,0.00024698407,0.0001950834,0.00017978082,0.00042040925,0.00080590235,0.00022466792,0.0034457867],"category_scores_gemma":[0.0006083063,0.00014652053,0.0001817429,0.00032588543,0.0002936423,0.00057701115,0.0003665345,0.0005852074,0.00061843544],"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.002188175,0.0006212198,0.004914516,0.00055997405,0.000041873256,0.0009838808,0.0004119002,0.021910924,0.5805975,0.030184885,0.007629132,0.34995595],"study_design_scores_gemma":[0.00027780066,0.0014767804,0.0038582764,0.000071171075,0.00008032072,0.0013275582,0.00006872908,0.1071189,0.79866105,0.004540848,0.08243478,0.000083736304],"about_ca_topic_score_codex":0.0006696887,"about_ca_topic_score_gemma":0.001335946,"teacher_disagreement_score":0.0034457867,"about_ca_system_score_codex":0.00031163145,"about_ca_system_score_gemma":0.0005886683,"threshold_uncertainty_score":0.01152724},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5788593,0.0068637244,0.39163664,0.001382122,0.00014137023,0.00013522513,0.00009899842,0.0017338869,0.019148653],"genre_scores_gemma":[0.8988199,0.000939802,0.097457305,0.00022581914,0.000050132065,0.000041944553,0.000052811578,0.00010132839,0.002311012],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932635,0.00015391696,0.00004749722,0.00007200341,0.0002818542,0.000118401265],"domain_scores_gemma":[0.999097,0.00033287666,0.00017824555,0.00016212519,0.00019716102,0.000032676795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006078274,0.00048510195,0.00024973656,0.00035053116,0.00032091816,0.0010410522,0.0012707139,0.0005019136,0.0009884189],"category_scores_gemma":[0.0018698758,0.00031207266,0.00022678786,0.0004623624,0.00035222466,0.0025286134,0.00039434078,0.00052866124,0.0003526285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096165226,0.00031709933,0.011905137,0.0011461736,0.00016073658,0.00066842674,0.00050736254,0.23792249,0.38722566,0.080379754,0.004981409,0.2738242],"study_design_scores_gemma":[0.0001941519,0.0025999914,0.0035168892,0.00011759377,0.000373778,0.0011946935,0.0005089616,0.6427663,0.28939503,0.03181646,0.02740976,0.00010632013],"about_ca_topic_score_codex":0.00080309657,"about_ca_topic_score_gemma":0.0028194687,"teacher_disagreement_score":0.0012707139,"about_ca_system_score_codex":0.0009576665,"about_ca_system_score_gemma":0.0010731473,"threshold_uncertainty_score":0.0069484115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21223947,0.0026592012,0.5917988,0.00077409565,0.0003468371,0.00059951685,0.0009387103,0.17323227,0.017411137],"genre_scores_gemma":[0.7583539,0.00047445908,0.21741563,0.00055482826,0.00009905684,0.00031947103,0.001938443,0.007078055,0.01376617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998803,0.00023533494,0.00010452959,0.00012873947,0.00050820375,0.00022014596],"domain_scores_gemma":[0.9973809,0.00039035684,0.000318027,0.0013635224,0.00034187292,0.00020525594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00119513,0.00064629473,0.00045215376,0.00086286187,0.0007413145,0.0017457247,0.0025854327,0.00068641896,0.005016766],"category_scores_gemma":[0.0042070653,0.00060694857,0.00037191107,0.00075787195,0.0008457647,0.002620044,0.0022155694,0.0012732975,0.002494749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0060791983,0.001098249,0.014793414,0.0014184272,0.00019143528,0.0010367119,0.0013321269,0.029522093,0.28746593,0.05137714,0.061962467,0.54372275],"study_design_scores_gemma":[0.00086134067,0.0020076777,0.0075350297,0.0003124227,0.00018110995,0.0011617995,0.00039160642,0.5387931,0.2553649,0.03149444,0.16157824,0.0003184084],"about_ca_topic_score_codex":0.0030677756,"about_ca_topic_score_gemma":0.0040888656,"teacher_disagreement_score":0.005016766,"about_ca_system_score_codex":0.0010076785,"about_ca_system_score_gemma":0.0015091174,"threshold_uncertainty_score":0.01678276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26768324,0.0014006897,0.721572,0.0006834996,0.00015982594,0.00026471642,0.00017810464,0.0026966692,0.0053611496],"genre_scores_gemma":[0.907716,0.00018838196,0.08964994,0.00015947112,0.000084234925,0.0000978878,0.00009099007,0.00012932345,0.0018838851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987589,0.0002743593,0.000089022935,0.00023563851,0.00039212737,0.00024999646],"domain_scores_gemma":[0.99734527,0.00064372347,0.00048001847,0.0008996356,0.00040808087,0.00022333644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017480513,0.0007938123,0.0011687747,0.0006958167,0.0011303384,0.0012020796,0.003923334,0.0008752162,0.0018899352],"category_scores_gemma":[0.0057012183,0.0004679586,0.00038991933,0.0011152687,0.00094009296,0.0028611042,0.0016924524,0.0011776183,0.00035548775],"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.0037600496,0.0007054932,0.006313696,0.0003541156,0.00022351785,0.0005635875,0.00082990027,0.43899992,0.09505556,0.054933447,0.014261057,0.38399956],"study_design_scores_gemma":[0.00019197717,0.00045978418,0.0005496762,0.000013850132,0.00006108098,0.00032453839,0.00011911316,0.9536318,0.026786063,0.013453461,0.004351829,0.000056873767],"about_ca_topic_score_codex":0.0032102908,"about_ca_topic_score_gemma":0.0033155428,"teacher_disagreement_score":0.003923334,"about_ca_system_score_codex":0.0010911153,"about_ca_system_score_gemma":0.002049804,"threshold_uncertainty_score":0.00924468},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059213027,0.007909461,0.12445684,0.004048251,0.001437191,0.0005581815,0.002033213,0.055771656,0.7445722],"genre_scores_gemma":[0.29687923,0.0026672217,0.07997641,0.0019003265,0.0004937171,0.0005509422,0.006121744,0.001497602,0.6099129],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99963105,0.0000300032,0.000016366559,0.000079011275,0.0001781253,0.000065384185],"domain_scores_gemma":[0.9997137,0.000014742878,0.000018343819,0.00004784023,0.00016573863,0.00003954258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025531393,0.00048665467,0.00033146408,0.0009215491,0.0007762445,0.00094762945,0.00119258,0.00069349277,0.062306944],"category_scores_gemma":[0.00066786865,0.0003466825,0.000204817,0.0007556493,0.0002027125,0.0012439224,0.0007393845,0.0007006824,0.026521455],"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.00077357853,0.00017137262,0.0019016904,0.0002460429,0.000040568193,0.000389638,0.00040946875,0.0021995795,0.04383196,0.033524428,0.53887993,0.37763166],"study_design_scores_gemma":[0.00013660034,0.0003709105,0.0025617878,0.00007158257,0.00003624858,0.0007009085,0.00005777732,0.017611064,0.013853775,0.0049318764,0.9596044,0.0000631852],"about_ca_topic_score_codex":0.0039397595,"about_ca_topic_score_gemma":0.0069296183,"teacher_disagreement_score":0.062306944,"about_ca_system_score_codex":0.0009225515,"about_ca_system_score_gemma":0.0009685244,"threshold_uncertainty_score":0.2084375},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07038566,0.00048757275,0.8347714,0.00040663197,0.0003158929,0.00034201244,0.0004400832,0.07697031,0.015880374],"genre_scores_gemma":[0.5451129,0.000334263,0.42553565,0.00053239183,0.000080530575,0.00032289952,0.0017363445,0.006169122,0.020175815],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987079,0.0001933066,0.000118194905,0.00026641402,0.00041420397,0.00029994207],"domain_scores_gemma":[0.9981589,0.00036885604,0.00011984862,0.00078873395,0.00038531213,0.00017844167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013383675,0.0008730952,0.0007248776,0.0007942863,0.00069703365,0.0021075294,0.0043985653,0.0011318141,0.011803801],"category_scores_gemma":[0.0038152044,0.0008278823,0.00086172676,0.00087529165,0.0011466111,0.0034023956,0.0035540303,0.0017760686,0.0030962096],"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.0042278897,0.0017184202,0.00694383,0.0009330378,0.00047144562,0.0013456357,0.0019515901,0.03953158,0.15847841,0.23617621,0.055008225,0.4932138],"study_design_scores_gemma":[0.0011197076,0.0013973212,0.0022271664,0.00020549803,0.000543739,0.0008366343,0.0003369722,0.58620477,0.19249953,0.067155585,0.1471568,0.00031613285],"about_ca_topic_score_codex":0.003840805,"about_ca_topic_score_gemma":0.005492196,"teacher_disagreement_score":0.011803801,"about_ca_system_score_codex":0.00096620223,"about_ca_system_score_gemma":0.0024318993,"threshold_uncertainty_score":0.03948766},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19125625,0.00327939,0.65960413,0.0022847876,0.0010784537,0.00071037374,0.0015597631,0.114870735,0.025356045],"genre_scores_gemma":[0.6778836,0.0007205961,0.28973088,0.0017745428,0.0002541623,0.00076837896,0.0025182357,0.0036277154,0.022721834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876344,0.0002182669,0.0001110594,0.00024616398,0.000444491,0.00021661977],"domain_scores_gemma":[0.9958455,0.00046587747,0.00038467787,0.0023761143,0.0005767197,0.00035120576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010174123,0.0006367529,0.00046570867,0.0011767306,0.0012728263,0.0017078983,0.0024521705,0.00079727144,0.004792271],"category_scores_gemma":[0.004281336,0.00066671346,0.00047133406,0.0010392392,0.0014064654,0.0051843687,0.0041319644,0.001586175,0.0024348348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022317348,0.00059026084,0.013456306,0.00082441134,0.00018555985,0.00078177813,0.0016779382,0.025613785,0.10640208,0.05730255,0.15021689,0.64071673],"study_design_scores_gemma":[0.0007555822,0.0026111635,0.005031194,0.00021716027,0.00024931738,0.0021394028,0.0010548364,0.3966515,0.15354446,0.053783037,0.38358533,0.00037699658],"about_ca_topic_score_codex":0.0022316235,"about_ca_topic_score_gemma":0.0037408648,"teacher_disagreement_score":0.004792271,"about_ca_system_score_codex":0.00094778475,"about_ca_system_score_gemma":0.0017892784,"threshold_uncertainty_score":0.016031742},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23074432,0.00039518144,0.7611075,0.0002572119,0.00005175295,0.00010018,0.000077014665,0.004903733,0.0023631323],"genre_scores_gemma":[0.7651465,0.00010667318,0.23345369,0.000050336923,0.00001591878,0.000054651366,0.00010145362,0.00019371361,0.00087703095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993892,0.00017802873,0.000037762667,0.00007097876,0.0002702847,0.00005367495],"domain_scores_gemma":[0.9977865,0.0010477148,0.00025646482,0.00059663696,0.00024157196,0.00007106567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075278943,0.00053650956,0.0002998338,0.0007693186,0.00027198135,0.00051458785,0.0008809323,0.00042169244,0.0017571987],"category_scores_gemma":[0.0052235713,0.00018335889,0.000119690994,0.0007746757,0.0005862768,0.0009720756,0.0005070386,0.00047139227,0.00021144116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015400518,0.00044753012,0.004513618,0.00020076563,0.000038175218,0.0005331894,0.00043521423,0.20316108,0.1973764,0.01897556,0.0025093,0.57026917],"study_design_scores_gemma":[0.000052396746,0.0002608862,0.00084854686,0.00001829202,0.00001220621,0.00027136618,0.000048550148,0.8264073,0.16652563,0.003109224,0.0024271223,0.000018473078],"about_ca_topic_score_codex":0.00079150667,"about_ca_topic_score_gemma":0.0011759575,"teacher_disagreement_score":0.0017571987,"about_ca_system_score_codex":0.0005471853,"about_ca_system_score_gemma":0.0007186537,"threshold_uncertainty_score":0.0058784485},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051839966,0.0012896842,0.5676268,0.001525772,0.0010964966,0.001356564,0.0023580787,0.090877704,0.28202894],"genre_scores_gemma":[0.1981904,0.0024357894,0.49292108,0.001563156,0.00065105886,0.0015473011,0.005732037,0.011855088,0.28510413],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995018,0.00007169384,0.000032724285,0.00008861784,0.00023705709,0.00006797366],"domain_scores_gemma":[0.99853075,0.00036279496,0.00013815842,0.00028854585,0.00038994296,0.0002898009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061216444,0.0006874114,0.0003117616,0.0006375323,0.00039116282,0.0010978716,0.0012398486,0.0005074266,0.047934443],"category_scores_gemma":[0.002915793,0.00037006804,0.00030803747,0.00032877916,0.0003683132,0.0017572992,0.0017706673,0.0011002425,0.020885605],"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.00079567276,0.00039889233,0.002222897,0.00069787574,0.000024960176,0.00021508966,0.00059417496,0.0019295716,0.038216777,0.06090442,0.13356227,0.7604375],"study_design_scores_gemma":[0.00011775243,0.0006390063,0.0025039187,0.00021296158,0.000034942386,0.0009205983,0.00013213216,0.01173342,0.031214256,0.014875987,0.9375644,0.00005075338],"about_ca_topic_score_codex":0.00032027843,"about_ca_topic_score_gemma":0.0006266396,"teacher_disagreement_score":0.047934443,"about_ca_system_score_codex":0.00031863197,"about_ca_system_score_gemma":0.0010810837,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09077674,0.00040698797,0.8939531,0.00020443846,0.000050918417,0.00010592349,0.00009008216,0.009364267,0.0050476515],"genre_scores_gemma":[0.7135616,0.00024101022,0.28052232,0.0001907036,0.000045324465,0.00023734602,0.00024862195,0.00060239405,0.004350765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999049,0.00025610795,0.00007260489,0.00017601252,0.00030985224,0.00013629331],"domain_scores_gemma":[0.99802136,0.0005367502,0.00020597855,0.00085323484,0.00027788192,0.00010473984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011379409,0.00060807244,0.0005170943,0.00060958316,0.00042021877,0.0011172561,0.0018200574,0.00048591022,0.0026501177],"category_scores_gemma":[0.0024403054,0.00049012544,0.00075742893,0.00053023756,0.00093188544,0.0022058182,0.0015804658,0.00088493264,0.00054391974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011937594,0.00033022405,0.014026566,0.00066451525,0.00026683588,0.00044347811,0.0012426743,0.37521082,0.0794763,0.18086645,0.009614343,0.33666402],"study_design_scores_gemma":[0.000040978106,0.00017074391,0.00040422962,0.000020350428,0.00004668248,0.00010167619,0.000037062597,0.95389706,0.017532263,0.020597676,0.0071290475,0.000022252336],"about_ca_topic_score_codex":0.0019633716,"about_ca_topic_score_gemma":0.0027581772,"teacher_disagreement_score":0.0026501177,"about_ca_system_score_codex":0.0008674758,"about_ca_system_score_gemma":0.0017830865,"threshold_uncertainty_score":0.008865535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100455455,0.00058304874,0.8791261,0.00031201637,0.00010406181,0.00007535448,0.00009325319,0.015776582,0.0034740306],"genre_scores_gemma":[0.60832584,0.00033486803,0.3867768,0.00016052334,0.000053967702,0.0001067141,0.0003102791,0.0017296937,0.0022012778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995003,0.00009407916,0.00004224198,0.00007899762,0.00020108193,0.00008316944],"domain_scores_gemma":[0.9984823,0.00043474144,0.00016636805,0.0006162276,0.00022320222,0.00007721634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067011063,0.00042763085,0.00030750493,0.00032534433,0.00047178156,0.0006475334,0.0011612882,0.00024070621,0.0014094851],"category_scores_gemma":[0.0026544086,0.0003819706,0.00050670403,0.00045045832,0.0006001847,0.0012744155,0.0008127929,0.0010566083,0.00037514418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008718767,0.00038573128,0.010808863,0.0004925866,0.000120683784,0.0003716303,0.00081127643,0.0928575,0.23391163,0.08214101,0.011939198,0.56528795],"study_design_scores_gemma":[0.00013124288,0.00034243934,0.0019535196,0.00003785812,0.00008237208,0.00020768441,0.000061174156,0.7924412,0.14582418,0.03927521,0.019591011,0.000052124313],"about_ca_topic_score_codex":0.0029470634,"about_ca_topic_score_gemma":0.0036820916,"teacher_disagreement_score":0.0029470634,"about_ca_system_score_codex":0.0005591428,"about_ca_system_score_gemma":0.001206076,"threshold_uncertainty_score":0.005859792},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009389735,0.044783518,0.07615036,0.50903946,0.09733355,0.00013691759,0.0012708828,0.0039224634,0.2579732],"genre_scores_gemma":[0.27756685,0.06686546,0.12369323,0.114447914,0.03664128,0.00049763586,0.0019633896,0.0040774257,0.37424687],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925107,0.00029475006,0.000028389839,0.00008028899,0.0002678524,0.00007766892],"domain_scores_gemma":[0.99671847,0.0014016606,0.00016549882,0.0003392805,0.0008066265,0.0005684025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016340191,0.0011130918,0.00049391255,0.0010749092,0.002156921,0.0065493495,0.0009935115,0.0027360506,0.050415512],"category_scores_gemma":[0.013679077,0.00031713667,0.00062081264,0.00066026056,0.0035962395,0.013670711,0.0016956282,0.0046176654,0.02088015],"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.00024573779,0.00005057625,0.0008312222,0.00050133327,0.00005336443,0.0004126896,0.0015171509,0.0009429575,0.0013714816,0.13591719,0.663266,0.19489028],"study_design_scores_gemma":[0.000018467206,0.000047197525,0.0003986104,0.00045105437,0.000025451976,0.00055871316,0.001671352,0.00083514606,0.0003949272,0.10483727,0.89071643,0.000045392877],"about_ca_topic_score_codex":0.0013503978,"about_ca_topic_score_gemma":0.0018117627,"teacher_disagreement_score":0.050415512,"about_ca_system_score_codex":0.0012508752,"about_ca_system_score_gemma":0.00085820974,"threshold_uncertainty_score":0.1686567},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02368371,0.0028594336,0.79818726,0.0009810083,0.0008283642,0.00043272058,0.0010270353,0.120171286,0.05182919],"genre_scores_gemma":[0.2400059,0.0035925955,0.592465,0.0026041642,0.00065093214,0.000869931,0.0059001497,0.022115748,0.1317956],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99880767,0.000096611286,0.00006761931,0.00025181286,0.00060207886,0.0001741393],"domain_scores_gemma":[0.998728,0.00019596891,0.00007820735,0.00053303875,0.00035992745,0.00010491141],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00075661705,0.00085121515,0.0007169938,0.00081880466,0.0007196293,0.001966378,0.003775537,0.0011551061,0.022513315],"category_scores_gemma":[0.0026994953,0.000873577,0.00079505536,0.0007593467,0.000678038,0.0042853504,0.003436131,0.0018324918,0.012967499],"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.0010345556,0.00021258599,0.0047256337,0.0010093476,0.00010899411,0.00035408852,0.0004339774,0.009591034,0.035956793,0.06812078,0.09983541,0.7786169],"study_design_scores_gemma":[0.00034893694,0.0007159031,0.0024883556,0.0002169632,0.00015021165,0.0010368198,0.00014434021,0.09611186,0.05767524,0.038270514,0.8026393,0.00020159534],"about_ca_topic_score_codex":0.0021028565,"about_ca_topic_score_gemma":0.0026070448,"teacher_disagreement_score":0.97748667,"about_ca_system_score_codex":0.000685314,"about_ca_system_score_gemma":0.0015039073,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034134313,0.00028136084,0.98132,0.00034384397,0.00037336195,0.00013480634,0.00074997905,0.005629297,0.0077539296],"genre_scores_gemma":[0.08436189,0.0006570357,0.88936925,0.0008353045,0.00035320513,0.0008029353,0.0025003476,0.0037744583,0.017345712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993339,0.0010736216,0.0011605972,0.0011912173,0.0026355898,0.00060000736],"domain_scores_gemma":[0.9873718,0.0020167644,0.00070453284,0.006786235,0.0026505827,0.0004700874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005084254,0.0012871645,0.0014104451,0.0025180206,0.0019941526,0.007723462,0.005062282,0.001636479,0.011815001],"category_scores_gemma":[0.011870363,0.0013084774,0.0031884857,0.0030822207,0.002964817,0.012305898,0.008741338,0.00423123,0.004697293],"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.0005212503,0.00012601886,0.0036467218,0.00050200394,0.000095287265,0.0004228918,0.00077032537,0.011273238,0.008150834,0.74265605,0.021088718,0.21074678],"study_design_scores_gemma":[0.00007728055,0.00013063841,0.000398468,0.00021818477,0.00012775636,0.00083906006,0.00021733156,0.059583414,0.021755252,0.4439046,0.4726103,0.00013766451],"about_ca_topic_score_codex":0.0017124547,"about_ca_topic_score_gemma":0.002014625,"teacher_disagreement_score":0.011815001,"about_ca_system_score_codex":0.002274853,"about_ca_system_score_gemma":0.002960462,"threshold_uncertainty_score":0.03952515},"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":"dataset","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002604596,0.0008686451,0.027199246,0.0026787291,0.0017371511,0.0019182995,0.79474396,0.07805455,0.09019483],"genre_scores_gemma":[0.021929765,0.0012888386,0.080510676,0.0035662095,0.00048298016,0.0051310873,0.7752534,0.02969705,0.0821399],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99390197,0.0010126223,0.0009999203,0.0016404034,0.0019873374,0.0004578078],"domain_scores_gemma":[0.9807765,0.005781925,0.0008206424,0.005801184,0.005918288,0.000901442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068285745,0.0016028549,0.0019131174,0.0049162875,0.0013537484,0.007017392,0.0043971706,0.0021643054,0.31756604],"category_scores_gemma":[0.034615986,0.0012035255,0.0017803989,0.006419301,0.0009590673,0.0056067416,0.004710357,0.0033580752,0.2581371],"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.0007895659,0.00011629416,0.0014312996,0.0013122117,0.000077868965,0.0001436026,0.00024431985,0.00046210494,0.0008624172,0.008058439,0.90617865,0.080323234],"study_design_scores_gemma":[0.00016969559,0.000046727077,0.0011984156,0.0002733176,0.000028954817,0.00009812052,0.00016468634,0.00085490796,0.001364261,0.008890124,0.9868671,0.000043729437],"about_ca_topic_score_codex":0.002521808,"about_ca_topic_score_gemma":0.0028503323,"teacher_disagreement_score":0.31756604,"about_ca_system_score_codex":0.0013179053,"about_ca_system_score_gemma":0.0039303657,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68614095,0.000983827,0.3075678,0.00013655641,0.000058879843,0.00010397545,0.000056793957,0.0031410255,0.0018102798],"genre_scores_gemma":[0.90846485,0.0001198996,0.09002726,0.000058353486,0.000017058512,0.00006496493,0.000063167776,0.00007513401,0.0011092816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995504,0.000097990305,0.000051278388,0.00007957277,0.00015339076,0.00006738334],"domain_scores_gemma":[0.9986003,0.0003720816,0.00028765787,0.00044661414,0.0002175671,0.00007582703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049613003,0.00028287506,0.00037282018,0.0005333811,0.0006543642,0.0008212501,0.0015649415,0.0003639419,0.0010151791],"category_scores_gemma":[0.0016269394,0.00024753265,0.00016113397,0.000679092,0.00040768698,0.0017552645,0.0009144938,0.00042425646,0.0001994121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024881882,0.00067996135,0.016384523,0.00048775028,0.0002825745,0.0016422342,0.0020135066,0.14907481,0.37826928,0.027990622,0.0048474837,0.41583908],"study_design_scores_gemma":[0.00035743456,0.0014108999,0.0039474377,0.00006401656,0.00024518615,0.0010205714,0.00037930676,0.6319026,0.33874545,0.007343481,0.014468703,0.000114927134],"about_ca_topic_score_codex":0.0010800349,"about_ca_topic_score_gemma":0.0024239398,"teacher_disagreement_score":0.0015649415,"about_ca_system_score_codex":0.00045195082,"about_ca_system_score_gemma":0.00082252506,"threshold_uncertainty_score":0.0033961535},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026601867,0.044041812,0.9416457,0.00059431075,0.00031805853,0.0001192526,0.00027287437,0.0024719816,0.007875798],"genre_scores_gemma":[0.043955278,0.07349887,0.86908406,0.00071744365,0.00057402387,0.00046261205,0.0016008142,0.0025017804,0.0076051066],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99818134,0.00040645374,0.00015015287,0.00016743959,0.0009737889,0.00012080849],"domain_scores_gemma":[0.9984139,0.0006215625,0.00008325527,0.00031390382,0.00047848458,0.000088776025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002329687,0.0010752585,0.0018738956,0.0018836664,0.00074948644,0.002475597,0.004580856,0.0017565005,0.006439411],"category_scores_gemma":[0.0047810157,0.0013115142,0.0017519998,0.0050575216,0.00093787204,0.002388602,0.0020800994,0.0029877806,0.0046422645],"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.00017184606,0.00018793473,0.0012374355,0.0030371272,0.00016001277,0.00010392696,0.00018862853,0.06661682,0.005199578,0.14408278,0.02301264,0.7560013],"study_design_scores_gemma":[0.0001001373,0.00020615676,0.00095803745,0.00096926495,0.000119081684,0.00050422864,0.00007834685,0.45245412,0.0075495644,0.10772207,0.42921087,0.00012813143],"about_ca_topic_score_codex":0.0021969029,"about_ca_topic_score_gemma":0.0021909687,"teacher_disagreement_score":0.006439411,"about_ca_system_score_codex":0.0007176265,"about_ca_system_score_gemma":0.0018441307,"threshold_uncertainty_score":0.021542013},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8372201,0.00044668658,0.12714157,0.0017394907,0.000081708815,0.000116014206,0.00006875869,0.001666074,0.031519666],"genre_scores_gemma":[0.8709895,0.00071277446,0.10596698,0.0005127859,0.00008025873,0.0000673146,0.00021787726,0.00066587486,0.020786595],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972963,0.0010216233,0.00012175273,0.00032166595,0.001005971,0.00023263668],"domain_scores_gemma":[0.9943674,0.0023094255,0.00022277731,0.001241866,0.001260888,0.0005976682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050689266,0.0006229862,0.00033890788,0.0004650927,0.0015353039,0.0024089073,0.0017796229,0.0010121645,0.003870968],"category_scores_gemma":[0.014010238,0.0005510154,0.00029169998,0.0008570746,0.0016146216,0.0043094596,0.0019617258,0.0014842913,0.0012360405],"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.0010228103,0.002419921,0.064952165,0.00063848146,0.00013074111,0.0035415255,0.1209139,0.021930084,0.08713813,0.02801425,0.027919015,0.64137894],"study_design_scores_gemma":[0.00053166854,0.010655395,0.047110155,0.00047271032,0.0005871004,0.009851434,0.06615883,0.14556907,0.14604701,0.03193823,0.5405944,0.0004839905],"about_ca_topic_score_codex":0.0019018177,"about_ca_topic_score_gemma":0.002952645,"teacher_disagreement_score":0.0050689266,"about_ca_system_score_codex":0.00070142664,"about_ca_system_score_gemma":0.0008805161,"threshold_uncertainty_score":0.026807368},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050739076,0.00035783334,0.9460776,0.00006370274,0.000023561275,0.0000495611,0.000035577377,0.00050858874,0.0021444848],"genre_scores_gemma":[0.51429486,0.00042317505,0.48357597,0.00005706699,0.000039047984,0.00016448252,0.00007762902,0.00012170437,0.0012461143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996307,0.00009965351,0.000027426391,0.0000632316,0.00012297506,0.000056066165],"domain_scores_gemma":[0.999595,0.00018885889,0.00009662291,0.000041912663,0.00006237499,0.000015294352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000505677,0.000646968,0.00042871982,0.0005727404,0.00026085635,0.00045771847,0.0006155423,0.00026302433,0.0011152575],"category_scores_gemma":[0.001108988,0.00036286275,0.00045237795,0.0005662185,0.000412818,0.0005430329,0.00034805448,0.00031794407,0.00017390806],"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.00017245318,0.00008066347,0.0008157785,0.00028221792,0.000057158228,0.00011644611,0.00011455334,0.6641864,0.08953064,0.03970793,0.001143476,0.20379227],"study_design_scores_gemma":[0.000073418756,0.0002893705,0.00019466793,0.000013556633,0.000044229084,0.000049574865,0.000013556426,0.958975,0.023076776,0.014154677,0.0031041952,0.000010923739],"about_ca_topic_score_codex":0.00078596507,"about_ca_topic_score_gemma":0.0017755404,"teacher_disagreement_score":0.0011152575,"about_ca_system_score_codex":0.00059379387,"about_ca_system_score_gemma":0.0008866624,"threshold_uncertainty_score":0.004308343},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39384642,0.00049119786,0.5713997,0.00029176677,0.0002534769,0.00016685062,0.0003147284,0.006590529,0.02664536],"genre_scores_gemma":[0.799182,0.00015506335,0.19313739,0.00011742049,0.000019995081,0.00006033905,0.0004207356,0.00024646858,0.006660652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984217,0.000037855232,0.00000890024,0.00003574449,0.000043677694,0.000031603002],"domain_scores_gemma":[0.99986506,0.000027107995,0.000012016281,0.00003977218,0.000037341062,0.000018658668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021750272,0.0003195818,0.00022475641,0.00030797406,0.00025129723,0.0005671905,0.0011999924,0.00024156884,0.004350087],"category_scores_gemma":[0.0003468772,0.00012289704,0.00025068867,0.00037939523,0.0002460627,0.0007495714,0.0004193718,0.00037510088,0.00058240606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030328734,0.00042200845,0.007908796,0.00043424702,0.00021653078,0.0015953027,0.00037382866,0.41926286,0.23112504,0.064589016,0.012728757,0.25831074],"study_design_scores_gemma":[0.00017213753,0.00070930296,0.001646734,0.000046299974,0.00006917149,0.0003911394,0.000084227424,0.86784166,0.08733498,0.004842008,0.036822982,0.00003939536],"about_ca_topic_score_codex":0.0017432973,"about_ca_topic_score_gemma":0.0030670087,"teacher_disagreement_score":0.004350087,"about_ca_system_score_codex":0.0006063508,"about_ca_system_score_gemma":0.0004035754,"threshold_uncertainty_score":0.014552534},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014132737,0.0004084456,0.95363116,0.000872672,0.00017536411,0.00021945553,0.00018388449,0.006995292,0.023380915],"genre_scores_gemma":[0.32054952,0.0007439627,0.63394797,0.0015357004,0.00031835158,0.00052821334,0.0007867845,0.007723563,0.03386601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9887151,0.0029107754,0.00062570046,0.002104999,0.004899463,0.0007438537],"domain_scores_gemma":[0.9681686,0.010180524,0.0014902157,0.015660064,0.0038490372,0.0006514593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009011311,0.0018267696,0.0008514317,0.0015109724,0.001224206,0.0064488202,0.0051221345,0.0016539391,0.006507268],"category_scores_gemma":[0.026646247,0.0013365829,0.0015402914,0.0010318544,0.004205779,0.010553805,0.006502849,0.00439124,0.0025785472],"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.0006793926,0.00032141776,0.0060942452,0.00081342354,0.00017635814,0.0015416625,0.007460722,0.01044109,0.02972696,0.58252615,0.016706364,0.3435122],"study_design_scores_gemma":[0.00011194643,0.00029276323,0.0010266269,0.0003660535,0.0003198395,0.002294627,0.0012360353,0.08439095,0.06412435,0.5195231,0.32617334,0.00014033062],"about_ca_topic_score_codex":0.0015267623,"about_ca_topic_score_gemma":0.0020336623,"teacher_disagreement_score":0.009011311,"about_ca_system_score_codex":0.0012479281,"about_ca_system_score_gemma":0.0021929573,"threshold_uncertainty_score":0.047656953},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3749929,0.00081544684,0.59394324,0.0008810275,0.00062592136,0.0002900579,0.0002973068,0.013141343,0.015012775],"genre_scores_gemma":[0.9073424,0.000105917505,0.0870806,0.000077634264,0.000066084875,0.00009447002,0.00018550584,0.00023292491,0.004814517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940753,0.00014673814,0.00004447554,0.00010535117,0.00019706476,0.00009883915],"domain_scores_gemma":[0.99801034,0.00042625723,0.00009014241,0.0010199536,0.0003292826,0.00012402398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095776963,0.0005130077,0.0007104567,0.00050614384,0.0012486456,0.0013354556,0.002510071,0.00062549365,0.002460761],"category_scores_gemma":[0.003122342,0.00040968892,0.00028519228,0.00054994447,0.0007781205,0.0011879418,0.0015288666,0.00095877255,0.0005173728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004629884,0.000524046,0.007818863,0.00043784306,0.0002683192,0.0010396179,0.0010790621,0.32546476,0.22462341,0.09897746,0.017148292,0.31798843],"study_design_scores_gemma":[0.0001164418,0.00020984624,0.00076960144,0.000009591243,0.00005210103,0.00010074843,0.00008567329,0.9587638,0.02678353,0.007862374,0.005201524,0.00004468157],"about_ca_topic_score_codex":0.0035962944,"about_ca_topic_score_gemma":0.005550504,"teacher_disagreement_score":0.0035962944,"about_ca_system_score_codex":0.000677774,"about_ca_system_score_gemma":0.0012375944,"threshold_uncertainty_score":0.0082319975},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15595958,0.0005709036,0.82454365,0.0001581879,0.00006781611,0.00009279861,0.00012845019,0.013401862,0.005076686],"genre_scores_gemma":[0.63463384,0.00024161751,0.3559361,0.00016522515,0.0000405305,0.00015209558,0.00045634923,0.0021055895,0.0062686596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996288,0.000060013615,0.00003262299,0.00005415412,0.00016087764,0.000063511965],"domain_scores_gemma":[0.99937457,0.00016153244,0.000072160794,0.00025486015,0.0001241176,0.00001278165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022990708,0.0008139958,0.00043775758,0.0005953713,0.00040932294,0.00051261374,0.0008984725,0.00026092524,0.0021276441],"category_scores_gemma":[0.0008553022,0.00033997349,0.0005075751,0.000535536,0.00031018615,0.0010368905,0.0007072274,0.0005524094,0.00051820045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063794904,0.00024476543,0.00632642,0.00036659025,0.00009935283,0.0003055912,0.00041277087,0.116057165,0.1995391,0.011021615,0.008621343,0.6563673],"study_design_scores_gemma":[0.000111627895,0.000440283,0.0033964862,0.000024484194,0.00012767604,0.0004232219,0.00014934274,0.6464251,0.3241522,0.0075505762,0.017147427,0.00005150998],"about_ca_topic_score_codex":0.0013122876,"about_ca_topic_score_gemma":0.0034974276,"teacher_disagreement_score":0.0021276441,"about_ca_system_score_codex":0.00040497782,"about_ca_system_score_gemma":0.0006048171,"threshold_uncertainty_score":0.0071176887},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004047989,0.00011833753,0.9798148,0.00004520084,0.00005975702,0.000098956305,0.0004364812,0.011179339,0.004199167],"genre_scores_gemma":[0.10766055,0.0003819961,0.88155895,0.000120860765,0.00002766458,0.0005217273,0.0017017927,0.002080476,0.0059459414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995135,0.00006320297,0.00004606273,0.000042126554,0.0002903593,0.000044737757],"domain_scores_gemma":[0.99923766,0.00039535685,0.000048497615,0.00010438198,0.00019529073,0.000018845723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005908402,0.00082952995,0.00044397218,0.00088754995,0.00032519363,0.0006658644,0.0010692267,0.0005141,0.012244193],"category_scores_gemma":[0.0017357622,0.000618228,0.000503415,0.00041641924,0.00026953156,0.00053148664,0.00041785976,0.0010305026,0.002686728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029126936,0.00017485222,0.0012043593,0.0014639018,0.00012908259,0.0009834684,0.00042647598,0.2039066,0.18883131,0.041983765,0.033556968,0.52704793],"study_design_scores_gemma":[0.00027246441,0.00036269287,0.00063495914,0.00020117384,0.000105205036,0.0015422424,0.000075533135,0.6172631,0.20769341,0.010086732,0.16164103,0.00012143268],"about_ca_topic_score_codex":0.0012183267,"about_ca_topic_score_gemma":0.0013536647,"teacher_disagreement_score":0.012244193,"about_ca_system_score_codex":0.00041506145,"about_ca_system_score_gemma":0.00068142073,"threshold_uncertainty_score":0.040960908},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8460193,0.0018911909,0.12926994,0.0002731684,0.00011820472,0.0001938708,0.0003157727,0.012499633,0.009419031],"genre_scores_gemma":[0.94697076,0.0002031632,0.04983158,0.00012298755,0.000016097018,0.0000625938,0.00035785665,0.00078060466,0.001654225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987213,0.00035055264,0.00010384482,0.00016291185,0.00033218646,0.0003291723],"domain_scores_gemma":[0.99613285,0.0019480365,0.0003235853,0.0008165783,0.00065757486,0.00012129843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012313443,0.0012340735,0.00044152513,0.0007313117,0.00037416516,0.0011078122,0.0013912203,0.00039024584,0.0031785152],"category_scores_gemma":[0.008043735,0.00044129248,0.00036934234,0.00068596477,0.00039831823,0.002764292,0.0009215762,0.0006828594,0.0008315936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003214848,0.0006561571,0.018930513,0.00075999636,0.00025897607,0.0003972926,0.00055311644,0.29680452,0.22457668,0.008411067,0.011121534,0.4343153],"study_design_scores_gemma":[0.00015425107,0.0014569873,0.007225464,0.00007742847,0.00016284238,0.00028671947,0.0002239229,0.6642779,0.30915833,0.0021099988,0.014791586,0.00007455468],"about_ca_topic_score_codex":0.0019835143,"about_ca_topic_score_gemma":0.0026740779,"teacher_disagreement_score":0.0031785152,"about_ca_system_score_codex":0.0008413594,"about_ca_system_score_gemma":0.0013411894,"threshold_uncertainty_score":0.010633171},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010343627,0.002421038,0.16717002,0.0024070141,0.002127272,0.0005956221,0.01178124,0.08399904,0.7191551],"genre_scores_gemma":[0.16094631,0.00283672,0.14078909,0.0019675056,0.00075462385,0.000992495,0.030514622,0.01143001,0.64976853],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925584,0.00007969329,0.00003162944,0.00014627216,0.00037974428,0.00010672808],"domain_scores_gemma":[0.9990163,0.0001363878,0.00004672463,0.00028362294,0.00039666763,0.00012032566],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005444698,0.00082924264,0.00058761804,0.0009481939,0.00086992054,0.0022684128,0.00209979,0.0012391572,0.3043366],"category_scores_gemma":[0.0019135926,0.00054320967,0.0005250333,0.0008439775,0.00041240043,0.0023196903,0.001751431,0.0014367192,0.10804981],"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.0005136012,0.0002280346,0.0015792233,0.00077695266,0.000068305555,0.0003932434,0.00022333371,0.014070063,0.017459856,0.0798156,0.49919498,0.3856769],"study_design_scores_gemma":[0.00008458876,0.000094472925,0.00043906952,0.00006038579,0.00002431236,0.00024999134,0.000042261705,0.022079878,0.011322456,0.008712888,0.9568579,0.000031659438],"about_ca_topic_score_codex":0.0027253053,"about_ca_topic_score_gemma":0.0035346933,"teacher_disagreement_score":0.6956634,"about_ca_system_score_codex":0.0010423686,"about_ca_system_score_gemma":0.001753429,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013140271,0.00050200743,0.9807271,0.00007621276,0.000083494444,0.000070320035,0.000018488392,0.0014438839,0.0039382936],"genre_scores_gemma":[0.56494766,0.00066721503,0.42489687,0.00018734389,0.00014326,0.00019212658,0.00014601536,0.00030545797,0.008514093],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99972445,0.00004119645,0.000026223492,0.00006781072,0.00009484916,0.000045441033],"domain_scores_gemma":[0.9996493,0.00011247292,0.000054816177,0.000054446158,0.00010793682,0.000020964975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038847953,0.0009235664,0.0005521357,0.00095436786,0.00059791066,0.0008790864,0.0009985204,0.00033884228,0.0049567646],"category_scores_gemma":[0.0009787943,0.00023679572,0.00031126357,0.0007044953,0.0003759719,0.0011487457,0.00061795965,0.0005606296,0.0007879617],"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.00035006928,0.00014397551,0.00074458926,0.00017154288,0.00003537814,0.00013070846,0.000110676796,0.12177236,0.031373676,0.01895268,0.0042860555,0.82192826],"study_design_scores_gemma":[0.00006529832,0.00021504606,0.00028530465,0.000020726597,0.000030170107,0.00015612353,0.000051770476,0.9597831,0.022508558,0.008303872,0.008554814,0.000025152212],"about_ca_topic_score_codex":0.0013530331,"about_ca_topic_score_gemma":0.0015217352,"teacher_disagreement_score":0.0049567646,"about_ca_system_score_codex":0.00045548714,"about_ca_system_score_gemma":0.00068741635,"threshold_uncertainty_score":0.016582012},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013029615,0.000258856,0.9927201,0.00021114016,0.00005334729,0.00010488633,0.000086460816,0.00039222452,0.004869984],"genre_scores_gemma":[0.10405684,0.0013151115,0.88418996,0.0003278219,0.00015855847,0.0012518135,0.00050132355,0.0004858543,0.0077126995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841547,0.0005935773,0.00013723197,0.00014447153,0.0005855786,0.00012370899],"domain_scores_gemma":[0.9978873,0.0009789298,0.00020360856,0.0005923562,0.00029196026,0.000045818284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022719176,0.0011037303,0.0006362779,0.00092303334,0.0007668436,0.0018809671,0.0024309545,0.0012838856,0.006288695],"category_scores_gemma":[0.004814258,0.0007388502,0.0019824377,0.00088942086,0.0017826927,0.0025282335,0.0019326038,0.003206832,0.001643821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015146681,0.00004097005,0.00021527005,0.00019643508,0.000024800112,0.000120593286,0.00018782241,0.15217151,0.0035970693,0.82464623,0.001499709,0.01728445],"study_design_scores_gemma":[0.000020767064,0.000036542802,0.00011170127,0.00012251206,0.000024019468,0.000078795114,0.00005852368,0.6353105,0.0037063423,0.3138381,0.046672203,0.000019918001],"about_ca_topic_score_codex":0.004138753,"about_ca_topic_score_gemma":0.0043067103,"teacher_disagreement_score":0.006288695,"about_ca_system_score_codex":0.0016354239,"about_ca_system_score_gemma":0.0025665627,"threshold_uncertainty_score":0.021037817},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0997609,0.0008608341,0.8772658,0.00043245396,0.0001425198,0.0001908683,0.00008124406,0.00314144,0.018123945],"genre_scores_gemma":[0.59003353,0.00033725688,0.40021646,0.00030653403,0.00007117446,0.00018509237,0.00011987947,0.0003266766,0.008403258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995912,0.00008738799,0.000025488363,0.000068705536,0.00014880204,0.00007844832],"domain_scores_gemma":[0.9994862,0.000060171642,0.00005105664,0.00025882575,0.0001016612,0.000041977222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005041312,0.0005730041,0.00032434185,0.00047711673,0.0004738114,0.0010394948,0.0017321003,0.00037646235,0.0020751779],"category_scores_gemma":[0.0008413947,0.00038158736,0.00039995802,0.00044571166,0.00050089206,0.0017373809,0.0013670797,0.00085958955,0.0005659965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005451572,0.0005411222,0.005737901,0.00037100664,0.00027115483,0.0007550915,0.00058816845,0.1429837,0.2549247,0.10145735,0.009580964,0.48224366],"study_design_scores_gemma":[0.00008258805,0.0008932491,0.0024397238,0.00007355986,0.00022153113,0.00042810582,0.00037384522,0.77346134,0.1438577,0.03804198,0.040055554,0.00007085735],"about_ca_topic_score_codex":0.00075336575,"about_ca_topic_score_gemma":0.002312589,"teacher_disagreement_score":0.0020751779,"about_ca_system_score_codex":0.0003754826,"about_ca_system_score_gemma":0.0006330283,"threshold_uncertainty_score":0.0069420934},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3784629,0.001399678,0.56298095,0.00052566594,0.00038153122,0.00024557768,0.00041996586,0.026986491,0.02859721],"genre_scores_gemma":[0.83428323,0.00030332213,0.14165567,0.00033692928,0.000056333978,0.00008904872,0.00054636004,0.0002735026,0.022455594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999828,0.00002560571,0.000011658672,0.000034688757,0.00006600736,0.00003401746],"domain_scores_gemma":[0.9998215,0.000042212454,0.000024192052,0.00004063057,0.000041837888,0.00002969938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019394908,0.00040144584,0.00023863907,0.00028375103,0.00022232202,0.0005388506,0.0008304145,0.00032597955,0.004741902],"category_scores_gemma":[0.00034083673,0.00020831604,0.00019012106,0.0001992669,0.0003012441,0.0006772449,0.0005166986,0.0005548664,0.0012133152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0042891884,0.00048922416,0.0028312074,0.00049168634,0.00013539562,0.001481737,0.00024848914,0.09267205,0.36904228,0.020464128,0.023523748,0.4843309],"study_design_scores_gemma":[0.00057979755,0.0026438273,0.0021298653,0.00004555753,0.00009343867,0.0010417432,0.00008840692,0.6248881,0.30765966,0.006929795,0.053786658,0.00011300647],"about_ca_topic_score_codex":0.0006127006,"about_ca_topic_score_gemma":0.001312227,"teacher_disagreement_score":0.004741902,"about_ca_system_score_codex":0.00023039992,"about_ca_system_score_gemma":0.000544164,"threshold_uncertainty_score":0.01586324},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15273955,0.00063005293,0.8319048,0.0007817955,0.0006704186,0.00031958485,0.00022986323,0.0045040995,0.008219712],"genre_scores_gemma":[0.81772727,0.00015711196,0.17361939,0.00018398368,0.00024756815,0.0002132539,0.00025847714,0.00029487966,0.007298022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931157,0.00016000734,0.00004979078,0.000082046194,0.0002718392,0.00012472429],"domain_scores_gemma":[0.99856865,0.00024483984,0.00008888111,0.00057788874,0.00035578324,0.00016382182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010768515,0.0005777593,0.0011050496,0.0008913819,0.0019473605,0.001310793,0.0024927016,0.0008742548,0.0059985016],"category_scores_gemma":[0.0026919062,0.00032682283,0.00034608183,0.0011850557,0.0008429254,0.0019571632,0.0025534544,0.00090203446,0.0010943016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005172171,0.0008961302,0.0022967902,0.00033475278,0.00017806227,0.00022945166,0.0010730631,0.23171765,0.077056535,0.08161428,0.030996043,0.56843513],"study_design_scores_gemma":[0.00038839792,0.0003616264,0.0004802672,0.000014596606,0.00006965384,0.000058051846,0.000099903446,0.9385939,0.010614099,0.03911042,0.010161819,0.00004732616],"about_ca_topic_score_codex":0.0020250075,"about_ca_topic_score_gemma":0.0027270983,"teacher_disagreement_score":0.0059985016,"about_ca_system_score_codex":0.00088667125,"about_ca_system_score_gemma":0.0009995297,"threshold_uncertainty_score":0.020066977},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2329894,0.00034830588,0.7557678,0.0002672954,0.00003159595,0.0003037691,0.00074963446,0.0066652386,0.0028769155],"genre_scores_gemma":[0.51073647,0.00023506726,0.4836086,0.00016712943,0.000016203445,0.00043192107,0.0018509672,0.00070281804,0.0022509026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976043,0.0006545153,0.00016777264,0.0003690412,0.0008616193,0.0003427533],"domain_scores_gemma":[0.9888365,0.008290977,0.00081923057,0.0010965226,0.00078994164,0.00016679161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022454571,0.0010361173,0.0011206142,0.0026388664,0.0011546308,0.0016442687,0.0010836172,0.0010536175,0.0033613353],"category_scores_gemma":[0.0154799605,0.0010158205,0.0011571633,0.0017190138,0.0016273747,0.0047719036,0.002190833,0.0009785229,0.00057606405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015586166,0.00083782896,0.053392462,0.0012186226,0.00028671243,0.0011463484,0.0031056802,0.35172662,0.037482962,0.05518215,0.005857929,0.48820415],"study_design_scores_gemma":[0.000085621636,0.0003119586,0.0041946904,0.00012295698,0.0001316366,0.00029775855,0.00037843717,0.87812585,0.022373399,0.089228794,0.004651766,0.00009715331],"about_ca_topic_score_codex":0.006887433,"about_ca_topic_score_gemma":0.01220297,"teacher_disagreement_score":0.006887433,"about_ca_system_score_codex":0.00075576885,"about_ca_system_score_gemma":0.0031809744,"threshold_uncertainty_score":0.013694704},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055140764,0.00029351804,0.93585443,0.000580763,0.00006636478,0.00016295382,0.00014545574,0.0037343814,0.0040213065],"genre_scores_gemma":[0.4055886,0.000203379,0.58761793,0.00022982823,0.00007342407,0.0002909861,0.00052880484,0.000396161,0.005070914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981248,0.00070938264,0.000091847076,0.00026330783,0.0005133872,0.00029723256],"domain_scores_gemma":[0.9975077,0.0011698598,0.0002236271,0.0005343901,0.00043073975,0.00013366061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014461592,0.00067276944,0.0010842682,0.00076178234,0.0010647598,0.0013993724,0.001718527,0.0007629625,0.0037679188],"category_scores_gemma":[0.0050238613,0.00048332175,0.0005115141,0.0012266623,0.001011048,0.0022318996,0.0012150719,0.000956058,0.0011877177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007132777,0.00028621696,0.0008594943,0.00019733363,0.00003880412,0.00010473556,0.000103929815,0.7085142,0.014264722,0.058272365,0.010818567,0.20582634],"study_design_scores_gemma":[0.00009794072,0.00007784447,0.00010429037,0.000004277035,0.000008010956,0.000015131767,0.00001805238,0.97316283,0.003195139,0.022420159,0.00088398275,0.000012352001],"about_ca_topic_score_codex":0.004627209,"about_ca_topic_score_gemma":0.009644185,"teacher_disagreement_score":0.004627209,"about_ca_system_score_codex":0.0016460575,"about_ca_system_score_gemma":0.002883815,"threshold_uncertainty_score":0.012604892},"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":"other","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073605485,0.003385936,0.19198318,0.0030959349,0.0039344463,0.00088261015,0.038251232,0.24385972,0.44100145],"genre_scores_gemma":[0.46253836,0.0028464326,0.14877951,0.0030661859,0.00048741183,0.0013755125,0.09343403,0.049596492,0.237876],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993679,0.00006310571,0.00002915101,0.00011077278,0.00035011818,0.00007889847],"domain_scores_gemma":[0.999173,0.00011669075,0.000035517976,0.00023798218,0.00036174958,0.00007504642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000556543,0.0014174511,0.0006563494,0.00090904563,0.00058739015,0.0018528856,0.002237211,0.00092108466,0.06795043],"category_scores_gemma":[0.0024201893,0.00062945223,0.0008006205,0.0011201506,0.00029136756,0.0015758242,0.001591266,0.0014895388,0.024959903],"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.00071442407,0.00016221045,0.006423541,0.0006810762,0.00015033424,0.00041435403,0.0002270945,0.028607823,0.019876583,0.020782366,0.6834239,0.23853634],"study_design_scores_gemma":[0.0002009402,0.0003728034,0.004291571,0.00010820659,0.00006918046,0.0003897178,0.00008908397,0.18516523,0.04106272,0.010742592,0.75739264,0.000115311595],"about_ca_topic_score_codex":0.005057049,"about_ca_topic_score_gemma":0.0076646814,"teacher_disagreement_score":0.06795043,"about_ca_system_score_codex":0.0010959567,"about_ca_system_score_gemma":0.0008671555,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22894596,0.001076821,0.73981,0.00083338027,0.00043419172,0.00026473452,0.00059995305,0.008715827,0.019319065],"genre_scores_gemma":[0.6916022,0.00034255188,0.29452714,0.00023455931,0.000070792456,0.000100768,0.000786961,0.00018770708,0.012147321],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999317,0.000010626764,0.0000026823607,0.000010596949,0.00003642304,0.000007858817],"domain_scores_gemma":[0.9999105,0.000014910367,0.000010895027,0.000019734707,0.000028656706,0.000015418806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015245925,0.00023491487,0.00022727273,0.00019713333,0.00022308493,0.00026769866,0.00059279497,0.00017267987,0.002830034],"category_scores_gemma":[0.00031168168,0.00011261756,0.00014421598,0.00034890597,0.00013840564,0.0003917235,0.00029834275,0.00032798055,0.00055900397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011016912,0.0002624776,0.0046271216,0.00039411313,0.00009186429,0.0007240407,0.00015624735,0.045489706,0.38938835,0.028654581,0.045645423,0.4834644],"study_design_scores_gemma":[0.00023485976,0.0015589561,0.004483315,0.000036535035,0.000046859423,0.00096084905,0.000067257584,0.74859595,0.15168518,0.005798782,0.08647805,0.00005348973],"about_ca_topic_score_codex":0.00045712353,"about_ca_topic_score_gemma":0.0012178737,"teacher_disagreement_score":0.002830034,"about_ca_system_score_codex":0.00024589783,"about_ca_system_score_gemma":0.0005120299,"threshold_uncertainty_score":0.009467363},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018062215,0.00029951346,0.97497433,0.00020525312,0.000032878103,0.00014687874,0.000049385544,0.00189753,0.0043319855],"genre_scores_gemma":[0.21667524,0.0007787703,0.77127254,0.0004624769,0.000030341054,0.00035149933,0.00026890825,0.00083579466,0.00932435],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984357,0.00043836934,0.00017426597,0.0001949941,0.00064696744,0.00010965124],"domain_scores_gemma":[0.9972932,0.000906314,0.00019135456,0.0011759542,0.00036211975,0.00007098909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022489189,0.0005066937,0.00024834776,0.00045542378,0.00021638782,0.0014437621,0.0018509342,0.0005630632,0.0026663078],"category_scores_gemma":[0.0035847079,0.0005914944,0.0005055785,0.0004497776,0.0006388467,0.0025113537,0.0013982868,0.0018832809,0.00085408066],"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.0005763867,0.00021401154,0.001667447,0.0007653876,0.000104677805,0.0004865035,0.0007947058,0.08557766,0.17069922,0.11416291,0.003890052,0.62106097],"study_design_scores_gemma":[0.0002997847,0.00083040266,0.0012759413,0.00030235157,0.00015359579,0.001543203,0.0003405446,0.50054747,0.24017678,0.05485131,0.19951352,0.00016510228],"about_ca_topic_score_codex":0.00043777507,"about_ca_topic_score_gemma":0.0011273839,"teacher_disagreement_score":0.0026663078,"about_ca_system_score_codex":0.0005988582,"about_ca_system_score_gemma":0.0010445492,"threshold_uncertainty_score":0.011893511},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03370396,0.00018716558,0.9572603,0.00012625004,0.000031372016,0.00009259962,0.00020599134,0.00095302664,0.00743939],"genre_scores_gemma":[0.82527393,0.00061360176,0.16025436,0.00012957971,0.00003976831,0.0007502432,0.00037858286,0.00038023788,0.012179803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99992,0.000017393211,0.0000051132674,0.000013480816,0.000034245164,0.00000982753],"domain_scores_gemma":[0.9998505,0.00007863783,0.000015090746,0.000021319207,0.000026952675,0.0000074175086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016138998,0.00043508876,0.00036863497,0.0002792285,0.0002688312,0.0004970936,0.0007825893,0.0005543351,0.003366451],"category_scores_gemma":[0.00051659247,0.00025013214,0.00039765867,0.00020256624,0.00036488372,0.00052037614,0.0003437613,0.00064373686,0.0006587552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022538745,0.000013835554,0.0002829461,0.000030755997,0.000009027081,0.000060975675,0.000052492833,0.9771404,0.006702654,0.010188111,0.00026035312,0.005235862],"study_design_scores_gemma":[0.0000023968046,0.000012719254,0.000057838013,0.0000018329487,0.0000025393813,0.000008409353,0.0000028102975,0.99748236,0.0006539748,0.0010159775,0.00075711205,0.0000020444745],"about_ca_topic_score_codex":0.003965563,"about_ca_topic_score_gemma":0.002563358,"teacher_disagreement_score":0.003965563,"about_ca_system_score_codex":0.00040691023,"about_ca_system_score_gemma":0.00047136258,"threshold_uncertainty_score":0.01126188},"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":"software","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011800467,0.00076748786,0.20040281,0.0005587071,0.000756231,0.00041051296,0.014360133,0.60113853,0.1698052],"genre_scores_gemma":[0.29885027,0.0014620277,0.14852907,0.0026836211,0.00062863756,0.0017928024,0.07582111,0.1544858,0.3157467],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929905,0.00007123111,0.000027725824,0.00015235599,0.000343293,0.00010626023],"domain_scores_gemma":[0.9989968,0.00026291504,0.000069149784,0.0002258499,0.000350882,0.00009444357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008725571,0.0011432578,0.0006671597,0.0007644278,0.0004209424,0.0016199959,0.0022279676,0.00077124685,0.13542034],"category_scores_gemma":[0.002418958,0.00068063545,0.00063408795,0.0005470844,0.0003027586,0.0012137532,0.0011608602,0.001483839,0.06599047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002291565,0.00018419669,0.0020575365,0.00062544603,0.000092719696,0.00040219023,0.00020193812,0.007814997,0.017849749,0.015046143,0.74508566,0.20834775],"study_design_scores_gemma":[0.00031701103,0.00027733936,0.0021446827,0.00008981867,0.000048574107,0.0005315255,0.000044515058,0.054520193,0.032577187,0.006528063,0.9028209,0.00010024278],"about_ca_topic_score_codex":0.0015446792,"about_ca_topic_score_gemma":0.0012277956,"teacher_disagreement_score":0.13542034,"about_ca_system_score_codex":0.0005767596,"about_ca_system_score_gemma":0.00096307,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065462617,0.046976782,0.78928405,0.017694045,0.03780791,0.0006692497,0.0029442422,0.0127316015,0.08534586],"genre_scores_gemma":[0.047786873,0.043576635,0.5391306,0.0063602664,0.010561342,0.0012555231,0.0183794,0.008019488,0.32492995],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947531,0.001410619,0.00043538987,0.0010826229,0.0017316673,0.00058654917],"domain_scores_gemma":[0.9918835,0.0014459309,0.00023930857,0.002032022,0.0032504264,0.0011486899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009779179,0.0028392111,0.002540827,0.003832671,0.0016529127,0.008986355,0.004552631,0.0036346568,0.050026305],"category_scores_gemma":[0.0112090325,0.001542302,0.0024721164,0.0035775562,0.0011932452,0.007831887,0.005757039,0.005978717,0.031996585],"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.0004864923,0.00030768453,0.0006242927,0.00043606953,0.0001347695,0.00024531333,0.00031202353,0.0028206597,0.0033730522,0.03230166,0.4442586,0.51469934],"study_design_scores_gemma":[0.00006148062,0.0001077217,0.00058184145,0.00033733656,0.00007072705,0.00041324913,0.00014689926,0.008788402,0.0028629657,0.028174117,0.9584021,0.00005306272],"about_ca_topic_score_codex":0.0040093297,"about_ca_topic_score_gemma":0.0041886773,"teacher_disagreement_score":0.050026305,"about_ca_system_score_codex":0.0022957877,"about_ca_system_score_gemma":0.0037994427,"threshold_uncertainty_score":0.16735464},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042036347,0.00031789686,0.9185722,0.00022861281,0.000080251564,0.0001668091,0.00019780829,0.01365297,0.024747206],"genre_scores_gemma":[0.3526368,0.00036527697,0.62337786,0.00034041,0.000048490358,0.00027753503,0.00047856307,0.0029902062,0.01948487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990256,0.00017112063,0.000088119465,0.00014621907,0.0003663509,0.00020266965],"domain_scores_gemma":[0.99855477,0.0003102834,0.00018320534,0.00062449253,0.00027746914,0.00004973011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011469153,0.00064509845,0.00056528347,0.0005827028,0.00067581964,0.0014232987,0.0015666373,0.0006374224,0.006008788],"category_scores_gemma":[0.0028174475,0.0005198442,0.0009722483,0.0009071659,0.0016800667,0.003182001,0.002746351,0.0012098505,0.001511499],"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.00092093373,0.00017152612,0.0035851724,0.00065470726,0.00008599012,0.00053363387,0.00083825266,0.082738854,0.05784775,0.5445875,0.016390808,0.29164493],"study_design_scores_gemma":[0.00028067036,0.00046277104,0.0007382003,0.00015632791,0.00013119337,0.0005909676,0.00021507127,0.3994295,0.13968493,0.3210076,0.13717078,0.0001319967],"about_ca_topic_score_codex":0.0022982112,"about_ca_topic_score_gemma":0.004383067,"teacher_disagreement_score":0.006008788,"about_ca_system_score_codex":0.0011515592,"about_ca_system_score_gemma":0.0020340995,"threshold_uncertainty_score":0.020101368},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3096042,0.00063390075,0.65484625,0.00082230347,0.00006688982,0.0000825924,0.00011376963,0.0011036468,0.032726526],"genre_scores_gemma":[0.82861996,0.00026542498,0.16364332,0.00012222171,0.000025345476,0.00009073725,0.00009609518,0.000107313615,0.007029605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974257,0.00007793326,0.000008635121,0.000047488826,0.0000750021,0.000048443053],"domain_scores_gemma":[0.99974185,0.000118132935,0.000024582478,0.00006471071,0.00003022238,0.00002043804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044647153,0.00027954203,0.00042686128,0.00021874184,0.00032259425,0.000591815,0.00058537925,0.00037156855,0.0022764716],"category_scores_gemma":[0.0014140374,0.00018585769,0.00024833495,0.0002883339,0.0004684678,0.00097443926,0.000609702,0.0005067219,0.00045419228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027893472,0.00011340277,0.0009681568,0.00014033023,0.000019506248,0.00014465176,0.00010228909,0.776391,0.013098193,0.14520912,0.0035398745,0.05999451],"study_design_scores_gemma":[0.000029987847,0.000061865336,0.00016395334,0.0000046770897,0.000004165809,0.000023568862,0.000010966101,0.95637894,0.0016781362,0.040279847,0.001360111,0.0000037577097],"about_ca_topic_score_codex":0.0011141754,"about_ca_topic_score_gemma":0.0019629558,"teacher_disagreement_score":0.0022764716,"about_ca_system_score_codex":0.0004960965,"about_ca_system_score_gemma":0.0006080197,"threshold_uncertainty_score":0.0076155663},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.335775,0.00066547305,0.6517665,0.00052063144,0.00010316243,0.00007073028,0.00019926197,0.005097829,0.0058014183],"genre_scores_gemma":[0.7233178,0.0002240961,0.2743454,0.00006898681,0.000020490754,0.00007045656,0.00025782423,0.00031107327,0.0013838253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973005,0.000057665467,0.000025799973,0.000026108128,0.00011766908,0.000042804364],"domain_scores_gemma":[0.9992403,0.0002803176,0.00007593891,0.00019871446,0.00017848735,0.000026292459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025154892,0.00048601185,0.0003504269,0.00065137283,0.00029970577,0.0005616048,0.00072880293,0.00034852867,0.0015326688],"category_scores_gemma":[0.00237264,0.00021097033,0.00021947072,0.001106245,0.0002952351,0.0011431244,0.000625705,0.00059968134,0.0003329818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080287975,0.00024589355,0.004663208,0.0002813763,0.000046769077,0.00032894342,0.00042592725,0.3275608,0.26717705,0.019958483,0.005687333,0.37282124],"study_design_scores_gemma":[0.00004513255,0.00010109718,0.00050834153,0.00001529695,0.000013937599,0.000061782026,0.000045081015,0.86581945,0.12434518,0.0039159376,0.0051155174,0.000013295318],"about_ca_topic_score_codex":0.0017222654,"about_ca_topic_score_gemma":0.0020825951,"teacher_disagreement_score":0.0017222654,"about_ca_system_score_codex":0.00058179436,"about_ca_system_score_gemma":0.0005777615,"threshold_uncertainty_score":0.0051273108},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066705644,0.000164522,0.54216576,0.00012177503,0.00011323587,0.00020401465,0.0011635456,0.44348505,0.005911596],"genre_scores_gemma":[0.372015,0.00068138575,0.36169106,0.001801754,0.0003092717,0.0015495251,0.01036282,0.21614183,0.035447296],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99810237,0.00029471182,0.00016801945,0.00035374964,0.0007800708,0.00030114935],"domain_scores_gemma":[0.99470454,0.0022056035,0.00031530944,0.0018129948,0.00073387334,0.000227684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027352702,0.0015521366,0.0010137603,0.0010709317,0.00055115955,0.001394399,0.0034643041,0.00124615,0.028715236],"category_scores_gemma":[0.007849874,0.0014575516,0.0010014671,0.00066274696,0.00088628486,0.0041981195,0.003916291,0.0031562138,0.010607362],"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.0049679484,0.0005243915,0.0105744535,0.0013616933,0.00033233018,0.0015424605,0.0025575354,0.019455671,0.099931404,0.042773414,0.30223486,0.5137438],"study_design_scores_gemma":[0.0005775685,0.0005598677,0.008008401,0.0003904539,0.00015989285,0.0017540483,0.00019353477,0.2657174,0.22092828,0.034262106,0.4668532,0.00059523655],"about_ca_topic_score_codex":0.0014862544,"about_ca_topic_score_gemma":0.0013707484,"teacher_disagreement_score":0.028715236,"about_ca_system_score_codex":0.0008489006,"about_ca_system_score_gemma":0.0010624592,"threshold_uncertainty_score":0.096062005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28136548,0.00953711,0.6291469,0.043295145,0.0012449475,0.00033553227,0.0003567229,0.0032899594,0.03142822],"genre_scores_gemma":[0.8404922,0.0056536105,0.14351304,0.0024096316,0.000804337,0.00021776455,0.00028948966,0.0010710766,0.005548864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98082215,0.005809463,0.0011389323,0.0022093377,0.008694177,0.0013259533],"domain_scores_gemma":[0.8919657,0.08351411,0.0044717463,0.0118487505,0.0074940166,0.0007058091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010370246,0.0010155418,0.001187168,0.0020240142,0.0022201817,0.0051098564,0.0028651853,0.0022067155,0.0047169137],"category_scores_gemma":[0.07126429,0.001467307,0.00240823,0.0012969101,0.009828858,0.016888108,0.0056530638,0.0074766134,0.00053244573],"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.00050963124,0.00033189167,0.010271964,0.0018827769,0.00021264526,0.0019036392,0.004750623,0.121235624,0.025915671,0.7047703,0.008940818,0.11927449],"study_design_scores_gemma":[0.00016565705,0.0004468773,0.0035348444,0.00091882737,0.00020366994,0.0017461707,0.0023745995,0.34074908,0.04913239,0.54779303,0.05258998,0.00034483575],"about_ca_topic_score_codex":0.007505032,"about_ca_topic_score_gemma":0.00565579,"teacher_disagreement_score":0.010370246,"about_ca_system_score_codex":0.004569173,"about_ca_system_score_gemma":0.0044640913,"threshold_uncertainty_score":0.054843724},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03983638,0.00069319434,0.8998969,0.00023420436,0.000117839045,0.00016960409,0.0002655678,0.05350967,0.0052765557],"genre_scores_gemma":[0.5168603,0.00045239044,0.47177318,0.00037162154,0.00007896133,0.00037236355,0.0006481862,0.004127442,0.005315621],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981376,0.0003389383,0.00011748826,0.0003292624,0.00085225573,0.0002244304],"domain_scores_gemma":[0.9968466,0.001200569,0.0005636094,0.0009576221,0.000319791,0.000111767426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012878464,0.0010668996,0.0006701295,0.0013797034,0.0004505741,0.0011573028,0.002496141,0.00055893685,0.0031046988],"category_scores_gemma":[0.0061191143,0.0007237035,0.0004344663,0.0008801265,0.0010091884,0.002232095,0.0020353545,0.001438434,0.0009061119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001417372,0.0006821557,0.010382584,0.0007502489,0.00017283969,0.00031651114,0.0005053706,0.118172035,0.17609349,0.03313676,0.022370405,0.63600016],"study_design_scores_gemma":[0.00016725506,0.00035544884,0.0031316106,0.00007326404,0.00007545918,0.0003346085,0.00007627255,0.7607657,0.19520369,0.011628861,0.028053375,0.00013442717],"about_ca_topic_score_codex":0.0015047201,"about_ca_topic_score_gemma":0.0026493615,"teacher_disagreement_score":0.0031046988,"about_ca_system_score_codex":0.0009128303,"about_ca_system_score_gemma":0.0013904282,"threshold_uncertainty_score":0.010386229},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6332223,0.0032546017,0.31348416,0.0010477902,0.00042105909,0.00032890178,0.0003050696,0.0022682094,0.045667946],"genre_scores_gemma":[0.9180635,0.0011464356,0.07394903,0.0003269492,0.00009869343,0.00018599338,0.00018424878,0.00018768327,0.0058574],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949634,0.00008733762,0.00003511132,0.00008485493,0.0002268509,0.00006941052],"domain_scores_gemma":[0.99816257,0.0007667133,0.00019084876,0.00036388345,0.0003935085,0.00012252318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047993776,0.00055612886,0.00038376692,0.00046339244,0.00033858413,0.0012324566,0.000823682,0.00051743025,0.0074423784],"category_scores_gemma":[0.003673057,0.00024183338,0.00018070456,0.0004643726,0.00038636825,0.0018679872,0.001147307,0.0007476317,0.0016212134],"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.00053546013,0.00037100498,0.007629761,0.0011607757,0.00014989334,0.00038764472,0.00036242412,0.31577912,0.21033643,0.03824201,0.0063864836,0.41865897],"study_design_scores_gemma":[0.00020507697,0.0020474438,0.007453665,0.0001727002,0.00016091121,0.0007008279,0.00062257354,0.7808232,0.10691932,0.054765377,0.046051957,0.0000769718],"about_ca_topic_score_codex":0.00049267476,"about_ca_topic_score_gemma":0.00082315825,"teacher_disagreement_score":0.0074423784,"about_ca_system_score_codex":0.00044813828,"about_ca_system_score_gemma":0.00044392777,"threshold_uncertainty_score":0.024897277},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16025114,0.0012278857,0.83035827,0.0004053134,0.000049969163,0.00010657841,0.00005722331,0.0045835613,0.0029600498],"genre_scores_gemma":[0.7808942,0.00046595646,0.21554363,0.00007371896,0.00003871742,0.000117773816,0.000082003164,0.00029510303,0.0024888376],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99672616,0.0015273653,0.00016153914,0.0003126907,0.00096893543,0.00030318327],"domain_scores_gemma":[0.98407376,0.008708312,0.0018345166,0.0039563347,0.0010214882,0.0004055239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025322144,0.00062961155,0.00074580905,0.000840044,0.00096023997,0.0014960385,0.0020231612,0.0006983345,0.0009393207],"category_scores_gemma":[0.013825265,0.00067081733,0.00034863647,0.00080177217,0.0021148508,0.0037243457,0.001893243,0.0013045482,0.00021286178],"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.002397676,0.0002841137,0.01870333,0.0006344602,0.0001795562,0.001307156,0.0023430306,0.21764398,0.07249421,0.1313203,0.0055072308,0.54718494],"study_design_scores_gemma":[0.0001706336,0.0005406784,0.004599998,0.000102702536,0.00012910205,0.00061787054,0.000306483,0.79420984,0.09299356,0.09399707,0.012259713,0.00007239062],"about_ca_topic_score_codex":0.0014127715,"about_ca_topic_score_gemma":0.0018500782,"teacher_disagreement_score":0.0025322144,"about_ca_system_score_codex":0.00061972433,"about_ca_system_score_gemma":0.001003795,"threshold_uncertainty_score":0.013391793},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06492073,0.0014234459,0.91171205,0.0008653951,0.00017914489,0.00020420083,0.0003251716,0.0031085801,0.017261326],"genre_scores_gemma":[0.44739076,0.00096516305,0.5413352,0.00020464307,0.00016270275,0.00046941673,0.000782237,0.00056021236,0.008129608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961371,0.001203134,0.00022760607,0.0005421401,0.0015554935,0.00033454396],"domain_scores_gemma":[0.9930056,0.0037120413,0.0003448498,0.0012626803,0.0015075972,0.00016730947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033857038,0.0010591232,0.0012848495,0.0010500106,0.00076997903,0.001996917,0.0011399677,0.00096201675,0.0047946502],"category_scores_gemma":[0.01833425,0.00049220346,0.0006567041,0.0014844602,0.00095789105,0.002373456,0.0015859931,0.00091641187,0.0016771173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015581971,0.0002639898,0.002647339,0.00046790045,0.00015962405,0.00029100172,0.0003760557,0.5146386,0.019401433,0.089676395,0.012474603,0.35804486],"study_design_scores_gemma":[0.000106381594,0.000080314974,0.00038360883,0.00001923655,0.000027219648,0.00008401868,0.000051226878,0.96976817,0.0065998673,0.020081373,0.0027772782,0.000021388209],"about_ca_topic_score_codex":0.0032416126,"about_ca_topic_score_gemma":0.0024678067,"teacher_disagreement_score":0.0047946502,"about_ca_system_score_codex":0.00079795433,"about_ca_system_score_gemma":0.001988978,"threshold_uncertainty_score":0.017905533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010531752,0.000142716,0.97903836,0.00026809878,0.000066927925,0.00011850668,0.0001047148,0.006862275,0.002866656],"genre_scores_gemma":[0.10431463,0.00030011905,0.88723,0.00037371053,0.00006866358,0.0002055848,0.00052934093,0.0031055096,0.0038723862],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99844664,0.000366931,0.00013153753,0.00026267604,0.00060027,0.00019199874],"domain_scores_gemma":[0.9959558,0.0013825925,0.0004999545,0.0014206463,0.00063483487,0.000106134445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014401891,0.0013060326,0.00077409495,0.0012750948,0.0012442097,0.0014827655,0.0018603161,0.00073843484,0.00393916],"category_scores_gemma":[0.0049891626,0.00087368605,0.0013524063,0.0012210854,0.003026098,0.0029041476,0.0021980864,0.0025134555,0.0016955965],"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.00095420063,0.00040730284,0.004639116,0.000948086,0.0001485565,0.00084237906,0.0028989015,0.055641953,0.1116704,0.14985093,0.016500074,0.6554981],"study_design_scores_gemma":[0.00044870185,0.00057586055,0.0016902561,0.00035527544,0.00035459205,0.0008309531,0.0005222938,0.34966892,0.27133977,0.27207673,0.101898216,0.00023836215],"about_ca_topic_score_codex":0.0025701956,"about_ca_topic_score_gemma":0.0038224002,"teacher_disagreement_score":0.00393916,"about_ca_system_score_codex":0.0006649006,"about_ca_system_score_gemma":0.0030725598,"threshold_uncertainty_score":0.0131777525},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040025294,0.000810628,0.6722561,0.00082479004,0.0008961883,0.0009584723,0.012296464,0.16541597,0.10651608],"genre_scores_gemma":[0.1626011,0.00084167614,0.6803594,0.00052133895,0.0003073154,0.0012808883,0.04972153,0.022543753,0.08182295],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951744,0.000049642236,0.00003376282,0.00008533277,0.00025348403,0.00006037546],"domain_scores_gemma":[0.99932265,0.000102832615,0.000041195366,0.00022325868,0.00023185006,0.00007820258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005953707,0.00090200955,0.0007152406,0.00090013444,0.0006551479,0.0011723081,0.0021058696,0.00055643934,0.026577424],"category_scores_gemma":[0.0014602601,0.00072358176,0.0009002506,0.00132196,0.00038323752,0.0015906215,0.0011726252,0.0013913427,0.00918899],"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.0012258415,0.00038652497,0.0023752565,0.00083495246,0.00023152173,0.0007502711,0.00026379406,0.078480504,0.051899917,0.05655175,0.4046788,0.4023209],"study_design_scores_gemma":[0.0005458293,0.00019315975,0.0021464562,0.00004405361,0.00006468098,0.0007432211,0.000028186752,0.45179206,0.055234667,0.019780774,0.46927312,0.00015370209],"about_ca_topic_score_codex":0.0025737407,"about_ca_topic_score_gemma":0.0023331884,"teacher_disagreement_score":0.026577424,"about_ca_system_score_codex":0.0005004532,"about_ca_system_score_gemma":0.0010670837,"threshold_uncertainty_score":0.08891028},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11170443,0.00056180416,0.8707559,0.00013270072,0.00010093278,0.000119967684,0.00009482183,0.0137224,0.0028070703],"genre_scores_gemma":[0.6630821,0.00030603024,0.33150807,0.00013138016,0.0000649253,0.00015262386,0.00015135862,0.0018037773,0.0027997876],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995858,0.0000977251,0.000047005735,0.000075539945,0.00012252903,0.000071462164],"domain_scores_gemma":[0.99897075,0.00025463256,0.00013686287,0.00044454003,0.00012684465,0.00006646137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005973385,0.00056507665,0.00041220905,0.00042782858,0.00041038703,0.00065369747,0.001431687,0.00031196975,0.0021037494],"category_scores_gemma":[0.0022992329,0.0004455929,0.00036318804,0.00032915268,0.0005495271,0.001240413,0.0009602394,0.00077811047,0.0004973062],"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.0009820265,0.0001525273,0.008945324,0.00033111262,0.00008200264,0.0004591801,0.0011280585,0.052173924,0.20760761,0.031300943,0.009289069,0.6875483],"study_design_scores_gemma":[0.0003349174,0.0006243348,0.0030308084,0.00008620467,0.00014243524,0.0006666309,0.00014903997,0.6791691,0.24628417,0.025580985,0.043788016,0.00014329112],"about_ca_topic_score_codex":0.0014189166,"about_ca_topic_score_gemma":0.0020011484,"teacher_disagreement_score":0.0021037494,"about_ca_system_score_codex":0.00039036153,"about_ca_system_score_gemma":0.0010499051,"threshold_uncertainty_score":0.007037759},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049610574,0.00006814481,0.9147135,0.0001225955,0.00003702581,0.00017863537,0.00014164465,0.033724003,0.0014038316],"genre_scores_gemma":[0.40591583,0.00010969113,0.5879166,0.00009728648,0.000032269345,0.00030528568,0.0009510496,0.0026519508,0.0020200808],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99809057,0.0004813012,0.0001407917,0.000377653,0.00075395696,0.00015574385],"domain_scores_gemma":[0.99452364,0.0018867223,0.00042889334,0.0016409317,0.001347693,0.00017204633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014368178,0.0012319924,0.00071559305,0.0010695144,0.0005727867,0.0010952976,0.0021120934,0.0005230697,0.002128895],"category_scores_gemma":[0.0077782543,0.00055006635,0.00053157855,0.00074051163,0.0007521255,0.0016966066,0.0011312546,0.0011819268,0.0007493283],"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.0009965806,0.0007558304,0.0052489145,0.0003665439,0.000118124226,0.0002565506,0.0007024705,0.1225866,0.13299285,0.010257563,0.0077499654,0.71796805],"study_design_scores_gemma":[0.000092350616,0.00014091622,0.0007563912,0.000014782736,0.000021932641,0.000081530234,0.000067088215,0.87337154,0.112872474,0.008419332,0.0041264193,0.000035174766],"about_ca_topic_score_codex":0.004061048,"about_ca_topic_score_gemma":0.003980175,"teacher_disagreement_score":0.004061048,"about_ca_system_score_codex":0.0006797619,"about_ca_system_score_gemma":0.0018235295,"threshold_uncertainty_score":0.00807482},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03252786,0.00021065502,0.95976794,0.00010650045,0.00005341652,0.000054617638,0.00007723035,0.0017274404,0.0054743313],"genre_scores_gemma":[0.26861694,0.0001929386,0.72707945,0.000035609275,0.000030225003,0.00010805076,0.00024081129,0.00008117857,0.0036148627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983096,0.000047091937,0.000010777821,0.000017613289,0.0000761293,0.000017418002],"domain_scores_gemma":[0.9997764,0.00009644619,0.000019688376,0.00003682358,0.000060455524,0.0000101946525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021149701,0.00037610685,0.00021277694,0.00025087586,0.00027640155,0.00028549533,0.00045601543,0.0002024612,0.005168967],"category_scores_gemma":[0.00067187846,0.0001545858,0.00015931913,0.00037224838,0.00017823833,0.00039484882,0.000285291,0.00030486082,0.0009799709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005029148,0.000099929835,0.0015641021,0.0004082374,0.00006503861,0.00037925254,0.0001821699,0.14649518,0.13130882,0.06000414,0.0089822635,0.65000796],"study_design_scores_gemma":[0.000084990264,0.0003163963,0.00072441244,0.000035615536,0.00001579074,0.00032198642,0.000049237402,0.887389,0.073410675,0.011464636,0.026169388,0.000017941404],"about_ca_topic_score_codex":0.0010510044,"about_ca_topic_score_gemma":0.0020502391,"teacher_disagreement_score":0.005168967,"about_ca_system_score_codex":0.00026402078,"about_ca_system_score_gemma":0.0003189657,"threshold_uncertainty_score":0.017291963},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17659515,0.00038330464,0.79146105,0.0002751367,0.0002089336,0.001154567,0.00022043179,0.02299033,0.0067110513],"genre_scores_gemma":[0.45054346,0.00020349491,0.542387,0.00019752185,0.000044082917,0.00061729876,0.0009660566,0.0013295737,0.0037114955],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980844,0.00038853282,0.00017843889,0.00040124543,0.00067632756,0.00027110358],"domain_scores_gemma":[0.99743843,0.00045248665,0.0003085142,0.0009009557,0.00059820904,0.00030135398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028935694,0.0005327163,0.0004307605,0.00046444585,0.00033569176,0.0015320326,0.004015317,0.00075762573,0.0018520508],"category_scores_gemma":[0.0053253383,0.00071090815,0.00051089085,0.00031392995,0.0007504852,0.0017683947,0.0014155013,0.0012764522,0.0007663198],"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.0017599491,0.0013767679,0.011916703,0.0008376856,0.00027468093,0.0010575665,0.0010448083,0.0875147,0.42132595,0.039728034,0.0111287385,0.42203435],"study_design_scores_gemma":[0.0010804733,0.0039535305,0.009701677,0.00017116712,0.00038650862,0.00083889585,0.00020060956,0.57204545,0.29494828,0.008939881,0.10751894,0.00021457358],"about_ca_topic_score_codex":0.0012375354,"about_ca_topic_score_gemma":0.0005535244,"teacher_disagreement_score":0.004015317,"about_ca_system_score_codex":0.00059266534,"about_ca_system_score_gemma":0.0011762595,"threshold_uncertainty_score":0.015302837},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17829877,0.0016279154,0.81480134,0.00042136534,0.00014119296,0.00012545154,0.000025336625,0.0012007417,0.0033579168],"genre_scores_gemma":[0.763805,0.0004936866,0.23428911,0.000103854356,0.00009484985,0.0000838354,0.00004213547,0.000112154434,0.0009753223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985637,0.0005436274,0.00009393904,0.00013885248,0.00044892164,0.00021103253],"domain_scores_gemma":[0.9969626,0.0013727053,0.0003902082,0.0006609313,0.0004785278,0.00013508623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018804049,0.0005064114,0.0007483267,0.00070810446,0.0009730431,0.0011529207,0.0012418672,0.00050669536,0.0006671574],"category_scores_gemma":[0.0054503316,0.00031927726,0.0003948855,0.0012735529,0.0009891071,0.0016734082,0.00090515404,0.00075691025,0.00014200847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048658607,0.0002704799,0.006501043,0.00030182762,0.00012376536,0.00019717177,0.000367399,0.5842161,0.057033785,0.04904791,0.0030835178,0.2983704],"study_design_scores_gemma":[0.00003417985,0.00014741924,0.000482622,0.000013356626,0.00003105017,0.000055525852,0.000057281824,0.9614737,0.015957406,0.0186908,0.0030403715,0.000016304095],"about_ca_topic_score_codex":0.0020157355,"about_ca_topic_score_gemma":0.0030940939,"teacher_disagreement_score":0.0020157355,"about_ca_system_score_codex":0.0010567956,"about_ca_system_score_gemma":0.0020882783,"threshold_uncertainty_score":0.009944677},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45497388,0.0006270128,0.5347291,0.00017711906,0.00005393718,0.00014514968,0.00004065452,0.00541249,0.003840628],"genre_scores_gemma":[0.9505995,0.0001333225,0.04694826,0.00006087892,0.000021645632,0.0000740223,0.000039073875,0.00022623318,0.001897147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993368,0.00021547105,0.0000431387,0.00006771619,0.0001983332,0.00013848914],"domain_scores_gemma":[0.9969506,0.0011905462,0.00048992335,0.0010410151,0.00022744508,0.00010048788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010428384,0.0003297092,0.0005562545,0.00027574616,0.0006682048,0.0009436367,0.001414981,0.0005135745,0.0013516705],"category_scores_gemma":[0.0038876885,0.0002798767,0.00027000147,0.00056372123,0.00095765933,0.0021979902,0.001109204,0.0007030208,0.000310012],"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.0022788572,0.0008460734,0.016427085,0.0006759118,0.00016587024,0.0012817405,0.002586926,0.48201725,0.20962301,0.08018046,0.0040902845,0.19982658],"study_design_scores_gemma":[0.00023346131,0.0007266381,0.0018482537,0.00002708853,0.00012288816,0.00039106194,0.00018779316,0.8359843,0.13812992,0.015062066,0.0072244634,0.000062220766],"about_ca_topic_score_codex":0.001614494,"about_ca_topic_score_gemma":0.0021922074,"teacher_disagreement_score":0.001614494,"about_ca_system_score_codex":0.0005909379,"about_ca_system_score_gemma":0.0010970687,"threshold_uncertainty_score":0.005515158},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02131808,0.0016152071,0.9683908,0.00045259614,0.0004131262,0.000060055667,0.000044555163,0.0023883916,0.005317072],"genre_scores_gemma":[0.6703164,0.002672776,0.29356897,0.00029545717,0.000716369,0.00021163172,0.00023110268,0.00085655274,0.031130789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961475,0.0012688517,0.0002093886,0.00033604505,0.0016528434,0.0003853009],"domain_scores_gemma":[0.98874795,0.0064250263,0.00072364375,0.0024430994,0.0014810298,0.00017928821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030286482,0.0013622722,0.0016045184,0.001244915,0.0013366351,0.0023013023,0.001845215,0.0020439015,0.0035490843],"category_scores_gemma":[0.019261,0.0009572077,0.00053011626,0.0019074298,0.0021295273,0.0035857128,0.0023635377,0.0025427626,0.0013490372],"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.00056778034,0.00010844775,0.001142473,0.0004911768,0.00008493616,0.00024840323,0.0006814744,0.35325247,0.007954479,0.33411396,0.010891058,0.29046333],"study_design_scores_gemma":[0.00007344888,0.00012792487,0.00021720302,0.000076658325,0.000053412226,0.00016551265,0.000069951195,0.5427343,0.01960363,0.422871,0.013959275,0.000047690337],"about_ca_topic_score_codex":0.0011966571,"about_ca_topic_score_gemma":0.00095086725,"teacher_disagreement_score":0.0035490843,"about_ca_system_score_codex":0.00092555414,"about_ca_system_score_gemma":0.0011782337,"threshold_uncertainty_score":0.016017199},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010037505,0.0010847299,0.98133504,0.00023095649,0.00007532526,0.000037755395,0.00014604008,0.00040628365,0.0066464525],"genre_scores_gemma":[0.7814084,0.0035547242,0.20996483,0.000105129926,0.00031704706,0.00023193445,0.0005489195,0.00021846964,0.0036503987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748045,0.0009397079,0.00011606582,0.00031901506,0.0009602111,0.00018455973],"domain_scores_gemma":[0.99529606,0.0031778833,0.0003927058,0.0004395331,0.0006050339,0.000088827204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027598946,0.0012191725,0.0009248627,0.0020066784,0.00044306088,0.002901168,0.001223398,0.0008093856,0.0036346824],"category_scores_gemma":[0.012080235,0.0003374472,0.0008404107,0.0022098192,0.0010799159,0.0027604708,0.0011364607,0.001620876,0.0005315487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006839607,0.000029143357,0.00070900604,0.0001314586,0.000045294473,0.000049974253,0.00012144862,0.7690712,0.0010889205,0.1901994,0.0014564797,0.03702932],"study_design_scores_gemma":[0.000003645355,0.000019619985,0.00016010762,0.000013814353,0.0000072002854,0.000013785873,0.000017246202,0.9486282,0.00038973222,0.049266562,0.0014708746,0.000009246981],"about_ca_topic_score_codex":0.0034182896,"about_ca_topic_score_gemma":0.0009942485,"teacher_disagreement_score":0.0036346824,"about_ca_system_score_codex":0.0017641329,"about_ca_system_score_gemma":0.0010009205,"threshold_uncertainty_score":0.014595866},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22204475,0.0030244656,0.62157375,0.0008249809,0.0005273077,0.00064275187,0.0013289398,0.01280782,0.13722521],"genre_scores_gemma":[0.6298763,0.0010386849,0.2732391,0.00060409866,0.000112344445,0.00029376827,0.002200572,0.000593602,0.092041545],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998485,0.000016521515,0.00001144485,0.000025126248,0.000067420995,0.00003093129],"domain_scores_gemma":[0.9998735,0.000018504546,0.000009322711,0.000021584465,0.00006660706,0.000010488514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015123245,0.00040861612,0.00021880044,0.00040789205,0.0002663204,0.00040262204,0.00061245245,0.00038697687,0.010954818],"category_scores_gemma":[0.00051507127,0.00018379683,0.00014295857,0.00031758173,0.00012566936,0.00066926976,0.00030300606,0.00037983636,0.0034445713],"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.00076853816,0.000091924616,0.0018294518,0.00048795613,0.000041702962,0.0008361546,0.00015506119,0.008985601,0.36664575,0.021308064,0.030513996,0.56833583],"study_design_scores_gemma":[0.00027420316,0.0022131028,0.006614629,0.00014314828,0.00012124912,0.004979095,0.00010931446,0.06636628,0.45475128,0.0076290066,0.45664197,0.00015671959],"about_ca_topic_score_codex":0.00043065601,"about_ca_topic_score_gemma":0.0005918412,"teacher_disagreement_score":0.010954818,"about_ca_system_score_codex":0.0001870367,"about_ca_system_score_gemma":0.00032411897,"threshold_uncertainty_score":0.03664756},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42608836,0.00039689566,0.5367764,0.00079539145,0.00042814174,0.00031979603,0.0005738446,0.007364314,0.02725688],"genre_scores_gemma":[0.809367,0.00015018394,0.1846028,0.00013143173,0.000047299265,0.00035757458,0.0006099476,0.0009398633,0.0037939886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960417,0.00011918279,0.000024585941,0.000058179518,0.000115569244,0.00007837493],"domain_scores_gemma":[0.99879813,0.00048104403,0.00004745577,0.0003051842,0.0002503329,0.0001178771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005942335,0.00085970917,0.0008834267,0.0005018519,0.0010698019,0.00093941786,0.0019555609,0.0006114539,0.0064381757],"category_scores_gemma":[0.003355899,0.00044870912,0.0006262413,0.0008490074,0.0005166937,0.0009920171,0.0010790274,0.001315928,0.0008487154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010338359,0.00047613424,0.0021494818,0.00021119023,0.00010283954,0.00016662256,0.0002512576,0.85936165,0.012957714,0.025032787,0.0059336782,0.09232294],"study_design_scores_gemma":[0.000043162614,0.000022823604,0.00010845203,0.0000024914614,0.0000050923095,0.000005755399,0.000012833077,0.9920896,0.003089321,0.0037662995,0.00084927893,0.000004833644],"about_ca_topic_score_codex":0.0060889362,"about_ca_topic_score_gemma":0.005235759,"teacher_disagreement_score":0.0064381757,"about_ca_system_score_codex":0.00075778563,"about_ca_system_score_gemma":0.0017419917,"threshold_uncertainty_score":0.02153784},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03475196,0.00040293168,0.75115675,0.00017537433,0.0002787398,0.00022762557,0.0047321096,0.17418283,0.03409172],"genre_scores_gemma":[0.27899238,0.00071651797,0.5493221,0.0005839856,0.00012257001,0.0012667652,0.031934243,0.07726418,0.059797205],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966097,0.00003057447,0.000022106782,0.000063118685,0.00015954056,0.00006361167],"domain_scores_gemma":[0.99940634,0.00014178643,0.000039701645,0.00016440048,0.00021717283,0.00003063304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040291925,0.0012908586,0.0006934032,0.00095509115,0.00060498697,0.00093692663,0.0017927949,0.00054809276,0.023784244],"category_scores_gemma":[0.0015477261,0.0005501319,0.0008168101,0.0010836434,0.00037225263,0.00085243996,0.00075067586,0.0009765588,0.008854613],"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.0016933575,0.0002625461,0.0051643895,0.0016163308,0.00017154173,0.001492149,0.00057315925,0.062866315,0.14951725,0.06817448,0.23645994,0.47200856],"study_design_scores_gemma":[0.00030340045,0.00021906324,0.0024118568,0.00010823989,0.00008799018,0.0013219094,0.000070779,0.29412016,0.29746267,0.009848599,0.39388186,0.00016356468],"about_ca_topic_score_codex":0.0028968498,"about_ca_topic_score_gemma":0.0024482647,"teacher_disagreement_score":0.023784244,"about_ca_system_score_codex":0.0010297156,"about_ca_system_score_gemma":0.0013257968,"threshold_uncertainty_score":0.07956624},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052014478,0.004621234,0.7995377,0.00095154694,0.0019009073,0.0010852157,0.023711938,0.04692916,0.11606089],"genre_scores_gemma":[0.040454336,0.0042923596,0.8272933,0.0008586631,0.0004540587,0.0042690025,0.03172234,0.020422637,0.070233405],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987099,0.00023760978,0.00009986345,0.0001274833,0.0006911493,0.00013401927],"domain_scores_gemma":[0.99849343,0.00030721107,0.00008740706,0.00026360285,0.0007558011,0.00009258291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010019448,0.0011540403,0.0018290926,0.0015818818,0.0012226752,0.0018383617,0.0029684263,0.0013653206,0.08549424],"category_scores_gemma":[0.0041798456,0.0006904385,0.001135608,0.0023038404,0.00048053398,0.0016888211,0.0015926576,0.0030832218,0.068956025],"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.00023316461,0.00018258292,0.00065267686,0.0017641578,0.00013408845,0.000433036,0.00029984533,0.07179554,0.01337209,0.2080399,0.48205006,0.22104292],"study_design_scores_gemma":[0.00012843797,0.000075532014,0.00043913868,0.00019436028,0.00003782795,0.00034156084,0.000042512856,0.105477475,0.0074249143,0.0390793,0.84666836,0.00009054571],"about_ca_topic_score_codex":0.0024606977,"about_ca_topic_score_gemma":0.0016394085,"teacher_disagreement_score":0.08549424,"about_ca_system_score_codex":0.0010048685,"about_ca_system_score_gemma":0.0022428627,"threshold_uncertainty_score":0.28600675},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21952632,0.0008010002,0.76333207,0.00031429497,0.00006122685,0.000088300294,0.00015879629,0.0077738245,0.007944174],"genre_scores_gemma":[0.87041163,0.00040139898,0.12384504,0.00015314617,0.000049401577,0.00009888917,0.00030664675,0.00043123474,0.004302526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951446,0.000106293985,0.000028713845,0.000091191076,0.00017981924,0.000079499136],"domain_scores_gemma":[0.9986411,0.00032817485,0.00018570034,0.00063069054,0.00016707205,0.00004732363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037582085,0.00059703365,0.00032418975,0.00041405472,0.00032064904,0.0006825692,0.0014428927,0.00027520905,0.0020120544],"category_scores_gemma":[0.001871091,0.00028035927,0.0001749087,0.00046917726,0.0005708996,0.0018005583,0.00096801796,0.00062070234,0.0004622972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008407504,0.00032844197,0.0074074254,0.00024320111,0.000071797615,0.0003392927,0.00038508954,0.17564508,0.27420878,0.040091198,0.004261512,0.49617743],"study_design_scores_gemma":[0.00007892496,0.000736263,0.00246902,0.000036969308,0.000081870574,0.00043398797,0.00013479486,0.7150734,0.23743288,0.021945091,0.021508832,0.000067843706],"about_ca_topic_score_codex":0.00082876394,"about_ca_topic_score_gemma":0.0026687358,"teacher_disagreement_score":0.0020120544,"about_ca_system_score_codex":0.0003316512,"about_ca_system_score_gemma":0.0007859535,"threshold_uncertainty_score":0.0067309737},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027548976,0.00058361515,0.97332215,0.002501355,0.00061873626,0.0004139513,0.0012427839,0.00794829,0.010614241],"genre_scores_gemma":[0.0153952325,0.0010628345,0.9694308,0.0010341806,0.00018229094,0.00050707965,0.003971689,0.0040131942,0.0044026114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9839642,0.003520251,0.0039851647,0.001769912,0.0060233586,0.00073710294],"domain_scores_gemma":[0.95133615,0.0051263375,0.0020007538,0.01398961,0.025899656,0.0016475379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021525826,0.0013615633,0.0015704093,0.0056568794,0.0029148518,0.014249607,0.0052290447,0.0046227244,0.00649807],"category_scores_gemma":[0.036384888,0.0018934014,0.002191224,0.008074627,0.0037127747,0.013487728,0.0049268287,0.011160905,0.008225833],"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.00012482132,0.00016216285,0.0015686746,0.0007820809,0.000066542685,0.00035018026,0.0014684765,0.008872979,0.0070274,0.7648871,0.06554487,0.14914477],"study_design_scores_gemma":[0.00006338051,0.00010003384,0.0005251418,0.00082816725,0.00006202961,0.00070687424,0.0005806764,0.035235632,0.011003981,0.15097666,0.7997666,0.00015081499],"about_ca_topic_score_codex":0.0106547475,"about_ca_topic_score_gemma":0.0060022697,"teacher_disagreement_score":0.021525826,"about_ca_system_score_codex":0.0038346597,"about_ca_system_score_gemma":0.010806907,"threshold_uncertainty_score":0.11384082},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07629597,0.0008422395,0.90676624,0.0004268264,0.00026962202,0.00016787257,0.000109338485,0.007327773,0.007794079],"genre_scores_gemma":[0.48958492,0.00045911598,0.4986829,0.00021311818,0.00009792484,0.00023936066,0.0003402145,0.0004813713,0.009901144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999871,0.00002008323,0.000009301738,0.000025318332,0.000050015977,0.00002414828],"domain_scores_gemma":[0.9997485,0.000046215926,0.000021223843,0.00008039243,0.00006056642,0.000043080647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000282111,0.00033326796,0.00031365533,0.00035397543,0.00035145602,0.0005901277,0.0014304182,0.0003848438,0.003075098],"category_scores_gemma":[0.0005127755,0.00030411335,0.00031531934,0.00042376498,0.0003034637,0.0011106795,0.00077144837,0.0006154821,0.00074704847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062444113,0.0003455915,0.002376317,0.00036041232,0.00018545768,0.00031495947,0.00028368,0.15254185,0.25340572,0.051382422,0.020308375,0.5178708],"study_design_scores_gemma":[0.00023650845,0.00052717415,0.0011301872,0.000025248844,0.00009337998,0.00020815125,0.00005021126,0.8904928,0.05232277,0.019455986,0.03539519,0.00006234214],"about_ca_topic_score_codex":0.0013809483,"about_ca_topic_score_gemma":0.002938902,"teacher_disagreement_score":0.003075098,"about_ca_system_score_codex":0.0003293159,"about_ca_system_score_gemma":0.00071945786,"threshold_uncertainty_score":0.010287225},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031497013,0.00044831733,0.95581084,0.00025832572,0.000100206984,0.00030630428,0.000082402155,0.002757084,0.008739592],"genre_scores_gemma":[0.29755145,0.00072132796,0.69343686,0.0002789744,0.00006349185,0.00051398,0.00028297224,0.0008686976,0.0062822476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927014,0.00019698017,0.000054939122,0.00007766278,0.00031341292,0.00008688848],"domain_scores_gemma":[0.9991811,0.00021645815,0.00006851975,0.00012699678,0.00037298317,0.000034021945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009315486,0.00040009967,0.00029072963,0.00036951795,0.00032685118,0.0009343121,0.0013659963,0.0005332352,0.001433907],"category_scores_gemma":[0.0017126194,0.000397776,0.0003745808,0.00034207146,0.00042996567,0.00065952697,0.00045351003,0.00085437373,0.0006474772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022415607,0.00019447893,0.0017567243,0.00082804397,0.00010202559,0.0005051491,0.00041967625,0.46929878,0.17581916,0.13050365,0.008720122,0.21162793],"study_design_scores_gemma":[0.00006573807,0.00012689886,0.00058075925,0.000047225163,0.000044620898,0.00022941298,0.0000687678,0.8131517,0.11715975,0.022049505,0.046447095,0.00002860327],"about_ca_topic_score_codex":0.0005945193,"about_ca_topic_score_gemma":0.0008800434,"teacher_disagreement_score":0.001433907,"about_ca_system_score_codex":0.00050730887,"about_ca_system_score_gemma":0.0013211104,"threshold_uncertainty_score":0.0049265623},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29824388,0.0027956697,0.62189966,0.0006836705,0.0005856162,0.00020486656,0.00037299813,0.034029968,0.041183688],"genre_scores_gemma":[0.6628389,0.0009545701,0.32093725,0.00022795919,0.00009337803,0.00012359436,0.00061464164,0.0016228234,0.012586885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994727,0.0000861052,0.000029654298,0.000079973426,0.00022293112,0.000108706714],"domain_scores_gemma":[0.9991767,0.0002549064,0.00007505493,0.00023012825,0.00020741698,0.000055905595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004070724,0.0006352675,0.00028374078,0.0003300879,0.00024703942,0.0007890332,0.00079807144,0.0002863718,0.0034906785],"category_scores_gemma":[0.0021272232,0.0002863999,0.00027741666,0.00048773646,0.00018604918,0.0013722145,0.0007055885,0.0008864103,0.0010689334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012986845,0.0003682862,0.005723879,0.0006197506,0.00010394966,0.00040570908,0.00038147313,0.04106943,0.2935014,0.035037316,0.032247912,0.5892423],"study_design_scores_gemma":[0.00042507108,0.00080669625,0.006177194,0.00012519243,0.00012324186,0.0006712398,0.00014277217,0.5649855,0.28509957,0.017250773,0.12409145,0.00010124786],"about_ca_topic_score_codex":0.00092250184,"about_ca_topic_score_gemma":0.0015880587,"teacher_disagreement_score":0.0034906785,"about_ca_system_score_codex":0.0002651034,"about_ca_system_score_gemma":0.00055095257,"threshold_uncertainty_score":0.011677504},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10162893,0.00084871874,0.8489217,0.00031821753,0.00013437174,0.00021039361,0.00030985405,0.0399835,0.007644321],"genre_scores_gemma":[0.45420483,0.00030187806,0.53553843,0.00014728364,0.000034795008,0.00016025972,0.0010112347,0.0021185244,0.00648266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969304,0.00005843894,0.000022526523,0.00006882468,0.00010338639,0.000053769567],"domain_scores_gemma":[0.99939096,0.00015209691,0.000059063277,0.0002084155,0.00012597174,0.000063451575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004939592,0.0006953103,0.00035098038,0.00036190578,0.0005166971,0.0008521135,0.0015139038,0.00038915398,0.0035536604],"category_scores_gemma":[0.0011040653,0.0005034649,0.00048177806,0.0004917643,0.00044840344,0.0015053069,0.00085146213,0.0008129826,0.0010550236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011617005,0.00062940276,0.01441111,0.0006978021,0.000224883,0.00056072435,0.00065273466,0.117183104,0.23385926,0.03245827,0.041576512,0.55658454],"study_design_scores_gemma":[0.00011185569,0.00035368916,0.002819295,0.000027839262,0.000036153368,0.00026983803,0.00006322716,0.8486283,0.11280108,0.011268699,0.02355798,0.000062073574],"about_ca_topic_score_codex":0.002627051,"about_ca_topic_score_gemma":0.0051684394,"teacher_disagreement_score":0.0035536604,"about_ca_system_score_codex":0.0005710996,"about_ca_system_score_gemma":0.001541534,"threshold_uncertainty_score":0.011888146},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98985904,0.00032145588,0.0024571626,0.00006710564,0.0000199652,0.000032487573,0.00034890513,0.00097388873,0.0059200684],"genre_scores_gemma":[0.9940619,0.00012164756,0.0029307138,0.00003429931,0.000008664949,0.000018035656,0.0010892081,0.000071855,0.001663618],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990722,0.00013609554,0.00005695886,0.00017210275,0.00040909948,0.0001535477],"domain_scores_gemma":[0.99799263,0.00040573947,0.00013359876,0.0002515028,0.0010775662,0.00013905048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069374364,0.0006606149,0.00024917978,0.0008667045,0.0003167448,0.00054258073,0.00063141796,0.00025070706,0.004196758],"category_scores_gemma":[0.0027311773,0.00022112462,0.00017679436,0.0017454238,0.00023983042,0.0006925918,0.0003683629,0.00025491745,0.00092538446],"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.007890328,0.0010254219,0.10951865,0.00078036514,0.0003941762,0.0010888107,0.0006783309,0.3203703,0.17530093,0.004799829,0.028015101,0.35013774],"study_design_scores_gemma":[0.00045598665,0.0062120217,0.16064619,0.000057410736,0.00020629358,0.000995918,0.0006165311,0.6854974,0.12110963,0.0013825989,0.02269501,0.00012501722],"about_ca_topic_score_codex":0.005095683,"about_ca_topic_score_gemma":0.0036420065,"teacher_disagreement_score":0.005095683,"about_ca_system_score_codex":0.00091512094,"about_ca_system_score_gemma":0.00074942544,"threshold_uncertainty_score":0.014039576},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027307512,0.000047944293,0.9656186,0.00024974154,0.0001207434,0.00010573634,0.00038822123,0.017157588,0.013580578],"genre_scores_gemma":[0.124885716,0.00017364517,0.8347144,0.00074959465,0.00010876929,0.0005421645,0.002636493,0.010438457,0.025750646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99808514,0.00059457106,0.00019774224,0.0002811795,0.00062867225,0.00021265548],"domain_scores_gemma":[0.9979551,0.0007230178,0.00008166608,0.0008167145,0.00036118392,0.00006238863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002288598,0.00080270827,0.000519419,0.0010656711,0.0007113466,0.0024336583,0.0024264927,0.0009849834,0.02498026],"category_scores_gemma":[0.0056763957,0.00055910734,0.001291583,0.00067262235,0.001388288,0.0044377325,0.0033965688,0.0024189926,0.006633963],"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.00046415135,0.00017249351,0.00078653474,0.00060688396,0.00006181989,0.00048423532,0.00088490313,0.015064658,0.00944224,0.6286503,0.0424613,0.30092043],"study_design_scores_gemma":[0.00018510326,0.00018568688,0.00025129376,0.00020275885,0.000097186465,0.0005463669,0.00028144076,0.17969,0.04347647,0.41476315,0.36023736,0.000083195795],"about_ca_topic_score_codex":0.0011561568,"about_ca_topic_score_gemma":0.0019209444,"teacher_disagreement_score":0.02498026,"about_ca_system_score_codex":0.00077719527,"about_ca_system_score_gemma":0.0014885722,"threshold_uncertainty_score":0.08356726},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11621087,0.00025140351,0.8465767,0.00022436935,0.000114562004,0.0003392022,0.00024962434,0.020010876,0.016022557],"genre_scores_gemma":[0.49226904,0.00015494825,0.48921293,0.00017815075,0.000038899474,0.00026184702,0.0009818657,0.0006558837,0.01624638],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999388,0.00011239441,0.000034464087,0.000113794784,0.00026664016,0.00008478329],"domain_scores_gemma":[0.9992836,0.00014167439,0.000060824485,0.00019035835,0.0002480587,0.00007544023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090559194,0.00048834516,0.0005722855,0.0005692773,0.0006673867,0.001119631,0.0016991106,0.0004374472,0.0043900474],"category_scores_gemma":[0.0010578401,0.00036565954,0.00031870065,0.00049786415,0.0005112094,0.00095963443,0.00079313933,0.00061297714,0.0012979839],"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.0018527346,0.0008769623,0.011453065,0.0006504392,0.00025641292,0.00056979514,0.0015827522,0.2082282,0.38942707,0.04069414,0.028714819,0.31569368],"study_design_scores_gemma":[0.00013752005,0.00040101403,0.0013069389,0.000029187098,0.00004532016,0.00008127197,0.000106853025,0.838181,0.13360341,0.0018903664,0.024154957,0.000062019564],"about_ca_topic_score_codex":0.005094363,"about_ca_topic_score_gemma":0.0066912095,"teacher_disagreement_score":0.005094363,"about_ca_system_score_codex":0.0011581215,"about_ca_system_score_gemma":0.0011536276,"threshold_uncertainty_score":0.014686227},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5845626,0.0010904918,0.40398017,0.00047207696,0.00015820093,0.0001512704,0.0001364481,0.0072173406,0.0022314002],"genre_scores_gemma":[0.9349601,0.00012693876,0.063200116,0.000036701622,0.000035439763,0.000053879918,0.00014996089,0.00005934834,0.0013774736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995427,0.00013951864,0.000028490434,0.00007949419,0.00013822565,0.00007159579],"domain_scores_gemma":[0.9974833,0.0010971075,0.00035929587,0.00041750635,0.00050446397,0.0001383928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000659785,0.0005643457,0.0004887424,0.00066620717,0.00058548077,0.00047648678,0.00087451603,0.00042229707,0.00083216827],"category_scores_gemma":[0.0023798316,0.00025417143,0.00017696267,0.000781997,0.00036123773,0.000767476,0.00060205994,0.0006848821,0.00027337897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013477448,0.00033950727,0.012835319,0.00020925334,0.000054917313,0.00026195086,0.0002414443,0.71796733,0.056623604,0.0046815225,0.0041622496,0.20127518],"study_design_scores_gemma":[0.000013232945,0.00013566024,0.00063058344,0.000004679129,0.000008195681,0.00001520222,0.000017963674,0.98449033,0.01307372,0.0009111374,0.0006911636,0.000008096198],"about_ca_topic_score_codex":0.0036038854,"about_ca_topic_score_gemma":0.0036794578,"teacher_disagreement_score":0.0036038854,"about_ca_system_score_codex":0.00068997935,"about_ca_system_score_gemma":0.00097539823,"threshold_uncertainty_score":0.0071657896},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017696768,0.00015169289,0.975316,0.00011235991,0.00002772142,0.000069384856,0.000036027817,0.0022922624,0.004297836],"genre_scores_gemma":[0.1023266,0.00014193961,0.8949529,0.00008705688,0.000024841418,0.000113018315,0.00014088837,0.0003426532,0.0018700676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939346,0.00012285773,0.000039122882,0.00010274962,0.00027589317,0.0000659447],"domain_scores_gemma":[0.999683,0.000053109212,0.000022131255,0.00012573617,0.000096227624,0.00001981284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005724852,0.0006721184,0.0007232702,0.0005289158,0.0005421098,0.00097083027,0.0018565395,0.00066173024,0.0018014584],"category_scores_gemma":[0.0013122289,0.0003991722,0.0007240088,0.0008811821,0.00065364916,0.00087886566,0.0009372101,0.0010627938,0.00076429674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046866055,0.0003236269,0.0021678354,0.00029865702,0.00013449226,0.0003658957,0.00055754714,0.3841542,0.09477922,0.11434535,0.009117055,0.39328742],"study_design_scores_gemma":[0.000049624377,0.00006813897,0.000270124,0.0000126209825,0.000016240689,0.000097083124,0.000030352194,0.96396196,0.016189715,0.010631374,0.008661879,0.000010974077],"about_ca_topic_score_codex":0.002631759,"about_ca_topic_score_gemma":0.0038492754,"teacher_disagreement_score":0.002631759,"about_ca_system_score_codex":0.0007071307,"about_ca_system_score_gemma":0.0008833063,"threshold_uncertainty_score":0.0060265064},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21676333,0.0041212314,0.4824015,0.0008098493,0.0008755369,0.002413565,0.0055243173,0.09245872,0.19463187],"genre_scores_gemma":[0.61551595,0.001003157,0.3027803,0.0009983112,0.0001584001,0.0015152899,0.011957905,0.0032962374,0.06277447],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934095,0.00006106838,0.00006468271,0.00015639319,0.00023518298,0.00014167915],"domain_scores_gemma":[0.9993181,0.00005750894,0.00004803567,0.00015657557,0.00036436136,0.000055362696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046686362,0.000827768,0.00064722553,0.0006310723,0.00038281363,0.001148692,0.001719477,0.0003859418,0.017615682],"category_scores_gemma":[0.0014796497,0.00041135232,0.0003769148,0.0006865243,0.00026804575,0.000710582,0.0005825848,0.00089005544,0.010937091],"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.0026408515,0.00066511147,0.005756387,0.001399827,0.0002765673,0.00085731846,0.00053690054,0.037860986,0.15601575,0.0804819,0.20806874,0.5054397],"study_design_scores_gemma":[0.00076371076,0.0022245746,0.007293515,0.00023483644,0.00022340278,0.0013895194,0.00011617228,0.20753674,0.23227318,0.0143252285,0.5333908,0.00022817797],"about_ca_topic_score_codex":0.0015155842,"about_ca_topic_score_gemma":0.0010840523,"teacher_disagreement_score":0.017615682,"about_ca_system_score_codex":0.00085767225,"about_ca_system_score_gemma":0.001384376,"threshold_uncertainty_score":0.058930278},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041928706,0.00007067579,0.9938856,0.000029310517,0.000053309668,0.000031888776,0.000019977899,0.0007394429,0.0009768916],"genre_scores_gemma":[0.06928562,0.00014750157,0.92747724,0.00007553161,0.00006263462,0.00010257408,0.00020335871,0.00030863346,0.0023369119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958843,0.00006532262,0.000036921858,0.0000926931,0.0001761356,0.000040516403],"domain_scores_gemma":[0.9995266,0.00014752192,0.000047788373,0.0000986714,0.00015842739,0.000020970201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055114087,0.0006044979,0.00042605554,0.0007923372,0.00052569056,0.0006322914,0.0009687611,0.00040169084,0.0029996166],"category_scores_gemma":[0.0013283379,0.0002987592,0.00042349097,0.000791283,0.00032267265,0.00096948777,0.0005065997,0.0008287932,0.00080242037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019964244,0.00013662245,0.0008614151,0.00020985516,0.00006233902,0.00008427779,0.00011554539,0.18274757,0.06605567,0.03607647,0.0056825164,0.7077681],"study_design_scores_gemma":[0.00005496322,0.00013928064,0.0002882433,0.00001872892,0.000038152415,0.00016074843,0.00001971507,0.935774,0.031255607,0.008086671,0.024145737,0.000018100847],"about_ca_topic_score_codex":0.0013442207,"about_ca_topic_score_gemma":0.0018815526,"teacher_disagreement_score":0.0029996166,"about_ca_system_score_codex":0.0005978152,"about_ca_system_score_gemma":0.0010536978,"threshold_uncertainty_score":0.01003468},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10962546,0.008264289,0.33955103,0.0044396427,0.0023516144,0.0014525403,0.010505057,0.1294121,0.3943983],"genre_scores_gemma":[0.44546345,0.00558622,0.23482767,0.006870833,0.0007614798,0.0016460209,0.024447868,0.013403629,0.26699275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988381,0.00016602833,0.0000742677,0.00030862764,0.0004349733,0.00017798605],"domain_scores_gemma":[0.99811953,0.0004426362,0.00020173605,0.0006017203,0.0004262427,0.00020823792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010258778,0.000756789,0.00046849975,0.0008032986,0.0006592347,0.0018301064,0.0023957905,0.00082951214,0.0475352],"category_scores_gemma":[0.0035801579,0.00044433653,0.0005286756,0.0009211606,0.00063031254,0.0020352788,0.0022963916,0.001022931,0.028323507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013439504,0.00071150623,0.0099260835,0.0014771657,0.00013297675,0.0008139842,0.00039612202,0.008585542,0.027131256,0.08202913,0.20014796,0.66730446],"study_design_scores_gemma":[0.00011598669,0.00063258526,0.0040178327,0.00012288876,0.00009083294,0.001880413,0.00011904836,0.042749114,0.031132026,0.027544072,0.89149684,0.00009838895],"about_ca_topic_score_codex":0.00064651377,"about_ca_topic_score_gemma":0.0011465165,"teacher_disagreement_score":0.0475352,"about_ca_system_score_codex":0.00059422385,"about_ca_system_score_gemma":0.00090780825,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81023383,0.003932885,0.14495979,0.00083757035,0.00025866771,0.00036834282,0.0010394868,0.017998524,0.020370867],"genre_scores_gemma":[0.8932654,0.0010332214,0.099037215,0.0001974907,0.00007419567,0.00018281303,0.0019884075,0.0022661206,0.0019551862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9900226,0.0026547879,0.000820759,0.0012701112,0.004149234,0.0010826212],"domain_scores_gemma":[0.9520965,0.01951413,0.0049064206,0.016640723,0.0055013583,0.0013408322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009456407,0.0011999044,0.0012756385,0.0019624673,0.0013478192,0.0031112202,0.0032043334,0.0013968565,0.0031315368],"category_scores_gemma":[0.04229735,0.0008202682,0.0013842672,0.0049926224,0.0020141264,0.0058458303,0.002477035,0.0015921625,0.0012988248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004490457,0.00081603293,0.063331895,0.0020129276,0.0005395989,0.0004947609,0.0009985452,0.4779288,0.051902242,0.0879411,0.018800445,0.29074317],"study_design_scores_gemma":[0.00029069613,0.0019487124,0.015393885,0.00014787073,0.0003149955,0.0005894709,0.0003196249,0.81202406,0.11282081,0.027882542,0.028072994,0.00019429791],"about_ca_topic_score_codex":0.0025650545,"about_ca_topic_score_gemma":0.0015617373,"teacher_disagreement_score":0.009456407,"about_ca_system_score_codex":0.0027872054,"about_ca_system_score_gemma":0.0023393466,"threshold_uncertainty_score":0.05001086},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86220616,0.0026132176,0.12804613,0.00038439973,0.00008899062,0.000034503322,0.00045482357,0.0021929033,0.003978898],"genre_scores_gemma":[0.99208087,0.0004907899,0.006265149,0.000031477648,0.000020375506,0.000017422211,0.00018146711,0.0001708329,0.00074169674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988317,0.00015601816,0.00005379399,0.00022126088,0.0005238249,0.00021343386],"domain_scores_gemma":[0.9917468,0.005336209,0.0010584029,0.0009883668,0.0007795849,0.00009070954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008847555,0.00076439837,0.00051116286,0.001016953,0.00040113117,0.00079584366,0.0010323283,0.00044709118,0.0016455051],"category_scores_gemma":[0.008917433,0.00049979176,0.00036209144,0.0013329681,0.00047096531,0.0032258893,0.00047908118,0.00073800614,0.0003428264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007457175,0.0002264711,0.015870057,0.00018677283,0.00009549882,0.00023653865,0.0001585385,0.8405621,0.06246642,0.00855761,0.0013109997,0.06958328],"study_design_scores_gemma":[0.000018597451,0.0002162695,0.005130579,0.000017553491,0.00004555505,0.00012661738,0.000055227538,0.9449063,0.045909557,0.0025718901,0.0009646759,0.000037133002],"about_ca_topic_score_codex":0.0041038604,"about_ca_topic_score_gemma":0.004953647,"teacher_disagreement_score":0.0041038604,"about_ca_system_score_codex":0.0014883633,"about_ca_system_score_gemma":0.00101274,"threshold_uncertainty_score":0.0107988715},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7521873,0.00038618807,0.24241203,0.00018775211,0.000031719723,0.00015959195,0.000114004324,0.00071721687,0.0038041112],"genre_scores_gemma":[0.9621187,0.000055482244,0.03617973,0.000021325886,0.0000042159527,0.000052301148,0.00008978841,0.000014572686,0.0014638216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997764,0.00006740938,0.000018724711,0.000024383227,0.000081844315,0.0000312594],"domain_scores_gemma":[0.99938285,0.00017303886,0.00007683065,0.00017710772,0.00014777019,0.000042430318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064031634,0.00014425271,0.00020310932,0.00037623383,0.0005246291,0.0003992919,0.00063110446,0.00032240825,0.001312919],"category_scores_gemma":[0.0012236324,0.000111681846,0.0001152745,0.00038693,0.00036040702,0.0011497698,0.0004264745,0.00022097686,0.00012627177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027964194,0.0007011329,0.008554279,0.00034602868,0.00011456437,0.00052742544,0.00080287224,0.4185521,0.23421617,0.080908075,0.004719707,0.24776109],"study_design_scores_gemma":[0.00022872654,0.0013069927,0.0019906636,0.000013551682,0.000042393396,0.00018438963,0.0000897048,0.9248786,0.058975723,0.007738874,0.004509471,0.000040930772],"about_ca_topic_score_codex":0.001324794,"about_ca_topic_score_gemma":0.003042515,"teacher_disagreement_score":0.001324794,"about_ca_system_score_codex":0.00053124834,"about_ca_system_score_gemma":0.00046208818,"threshold_uncertainty_score":0.004392147},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08236482,0.00019369207,0.90610063,0.0001913685,0.000057624584,0.00025183192,0.0001224519,0.006999552,0.0037179338],"genre_scores_gemma":[0.5444934,0.00010056943,0.45092162,0.00022137885,0.000039804458,0.00067652896,0.0005832431,0.0011814797,0.0017820044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979553,0.00072137464,0.00013226873,0.0002401525,0.0007635795,0.00018727798],"domain_scores_gemma":[0.99617416,0.0016818631,0.00027841437,0.0008337904,0.0009070808,0.00012476793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023147308,0.0014510426,0.0008455012,0.0008360266,0.0007763514,0.00090562855,0.0018948753,0.0006691113,0.002700728],"category_scores_gemma":[0.009132583,0.0005321113,0.00073252845,0.00082168455,0.0006533836,0.0011836557,0.0014424401,0.0011757626,0.0007485282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000712723,0.0007119381,0.004824389,0.00036215485,0.00008156138,0.00015434268,0.00032316672,0.5767827,0.058837153,0.006150676,0.0046459828,0.3464133],"study_design_scores_gemma":[0.00002656696,0.00010890002,0.0005346065,0.000014061115,0.0000148706,0.000023616438,0.0000228726,0.9797635,0.015326232,0.0031364476,0.00101691,0.000011369459],"about_ca_topic_score_codex":0.0023636692,"about_ca_topic_score_gemma":0.0034530314,"teacher_disagreement_score":0.002700728,"about_ca_system_score_codex":0.0009440904,"about_ca_system_score_gemma":0.0016169078,"threshold_uncertainty_score":0.012241602},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05971506,0.0004754566,0.9170495,0.00019287596,0.00010604289,0.00016055256,0.00035457665,0.00925346,0.012692448],"genre_scores_gemma":[0.43512037,0.0003991136,0.55586773,0.00034610805,0.000048424346,0.0002273103,0.0011307604,0.0003840076,0.006476197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997501,0.00003788454,0.000020932406,0.00006394153,0.00008285262,0.000044328317],"domain_scores_gemma":[0.9994646,0.00009379952,0.000029910303,0.00020848792,0.0001737411,0.000029526787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028333825,0.0003972858,0.0003773227,0.0005043614,0.00034059814,0.0007483285,0.0016899229,0.00049001985,0.004952432],"category_scores_gemma":[0.00084299047,0.00032863911,0.0005365504,0.00072792836,0.0003991379,0.0009591075,0.0004861057,0.0010354172,0.0020216338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088903797,0.0004211195,0.0091460105,0.0010193756,0.00021254932,0.0005269004,0.0003122846,0.22097635,0.22519375,0.12856016,0.028130947,0.38461152],"study_design_scores_gemma":[0.00007384968,0.0004902264,0.002004872,0.00006434506,0.00013731868,0.0006275966,0.00004595789,0.7770829,0.1306371,0.019883078,0.06887949,0.00007317819],"about_ca_topic_score_codex":0.0014047875,"about_ca_topic_score_gemma":0.0023732167,"teacher_disagreement_score":0.004952432,"about_ca_system_score_codex":0.00059698167,"about_ca_system_score_gemma":0.0012011308,"threshold_uncertainty_score":0.016567528},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9856485,0.00055428,0.008016096,0.0001831035,0.000054118787,0.00002632423,0.00012901727,0.0016367774,0.0037517159],"genre_scores_gemma":[0.99164295,0.00014306208,0.0074374736,0.000046230773,0.00002034545,0.00001715219,0.00016525513,0.00009761962,0.0004299882],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993925,0.00010377913,0.00006863477,0.0000723879,0.00021990962,0.00014275062],"domain_scores_gemma":[0.9970963,0.0012783477,0.00033479312,0.00051242305,0.0005983301,0.00017977794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047590488,0.0009576821,0.00034438501,0.00056050665,0.00031957022,0.00044059113,0.0008062241,0.00034091863,0.0014669892],"category_scores_gemma":[0.0030986702,0.000250234,0.00036480074,0.0005913991,0.00034016772,0.00061631424,0.0005916204,0.00045765608,0.0002764751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033080047,0.0008090186,0.014205675,0.0013250245,0.00022656913,0.0007819304,0.00022436709,0.30716377,0.49916813,0.0017729063,0.002580085,0.1684345],"study_design_scores_gemma":[0.0002681426,0.004854035,0.04315353,0.00010576324,0.000620855,0.00064940075,0.00034717246,0.41481057,0.52098805,0.0012633606,0.01280502,0.0001341357],"about_ca_topic_score_codex":0.0014267585,"about_ca_topic_score_gemma":0.001391688,"teacher_disagreement_score":0.0014669892,"about_ca_system_score_codex":0.000247671,"about_ca_system_score_gemma":0.00041399754,"threshold_uncertainty_score":0.0049075484},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11646251,0.010800879,0.7930665,0.00337425,0.0005116611,0.0001451851,0.0009027235,0.002571962,0.07216436],"genre_scores_gemma":[0.8863416,0.005392677,0.08484961,0.00023042384,0.00024342413,0.0002676412,0.00085820106,0.00037868496,0.021437736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939275,0.00013400722,0.000027899725,0.000044159715,0.00033719945,0.0000640244],"domain_scores_gemma":[0.99952376,0.00018485774,0.00005022772,0.0000626591,0.00016315538,0.00001529093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055922515,0.000629764,0.00046205314,0.00066923664,0.0004105283,0.00091433787,0.0008751875,0.00058924756,0.0018312965],"category_scores_gemma":[0.0024864646,0.00028808825,0.00055467786,0.00093024113,0.00024133493,0.0011658247,0.00040340694,0.00073608087,0.00049893116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045078188,0.000035519537,0.0011795087,0.00012248124,0.000024202383,0.000087890076,0.00007481846,0.8635988,0.006027732,0.0694966,0.007868984,0.05143841],"study_design_scores_gemma":[0.0000028914546,0.000022685303,0.000463047,0.000012022569,0.000004384421,0.000028768507,0.000008360352,0.98169035,0.0012449614,0.011010683,0.0055051735,0.000006606283],"about_ca_topic_score_codex":0.005829674,"about_ca_topic_score_gemma":0.0026781834,"teacher_disagreement_score":0.005829674,"about_ca_system_score_codex":0.0012445872,"about_ca_system_score_gemma":0.0009126581,"threshold_uncertainty_score":0.0115914345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01309222,0.00017491511,0.9813461,0.00013548334,0.000058039772,0.0001165646,0.00014508856,0.0020971238,0.00283449],"genre_scores_gemma":[0.1318827,0.00015745834,0.86010444,0.00009790583,0.00003748362,0.00020309245,0.0006499792,0.00022882913,0.0066381833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993032,0.00007717428,0.000045256715,0.0002041613,0.00024986043,0.00012036802],"domain_scores_gemma":[0.9989931,0.0002818978,0.00008691444,0.00020419374,0.0003564396,0.000077389246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005849417,0.0008112183,0.001210133,0.0015934849,0.0009630012,0.0012468125,0.002244418,0.0011174759,0.0070172455],"category_scores_gemma":[0.0025071441,0.00047394488,0.00054735405,0.0018447576,0.00059003796,0.0018590613,0.0019186009,0.0008736506,0.0018923456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048596883,0.00017656051,0.0012697092,0.00021799904,0.000054225347,0.0001757647,0.00015977892,0.2606694,0.015862772,0.042312533,0.012809635,0.6658057],"study_design_scores_gemma":[0.00011581353,0.000061474086,0.000183196,0.000014602003,0.00001593207,0.00010976471,0.000031102463,0.960761,0.005290109,0.026347006,0.0070494176,0.000020651458],"about_ca_topic_score_codex":0.0038636166,"about_ca_topic_score_gemma":0.0040288465,"teacher_disagreement_score":0.0070172455,"about_ca_system_score_codex":0.0010853859,"about_ca_system_score_gemma":0.002010058,"threshold_uncertainty_score":0.02347505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99422413,0.00023353136,0.0040985662,0.00004140441,0.000010646399,0.000026692294,0.000102765815,0.00042309094,0.00083914096],"genre_scores_gemma":[0.9951024,0.00009480022,0.0041820263,0.000013926486,0.000008605517,0.000026758302,0.00026645328,0.000040959745,0.00026402395],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796236,0.00039096025,0.00019669686,0.00043477016,0.00063142454,0.00038382495],"domain_scores_gemma":[0.99474585,0.002326334,0.00051590364,0.00095823314,0.0011782469,0.00027543557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014474976,0.00063725805,0.00059121364,0.00096230383,0.00055958476,0.001124984,0.0010959415,0.00049030816,0.0012372732],"category_scores_gemma":[0.005603417,0.00035902538,0.00023433972,0.0018423506,0.00069278036,0.0019710232,0.00056635693,0.00068380276,0.00022404052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008843937,0.0017865021,0.13795416,0.0008250317,0.0005153526,0.00080621353,0.0016637197,0.30582425,0.34787184,0.009628756,0.0057019116,0.17857842],"study_design_scores_gemma":[0.00015245481,0.0019294181,0.048317015,0.000018609586,0.00009875549,0.0002294422,0.00035741227,0.81708014,0.1285155,0.0014951171,0.0017512752,0.0000548526],"about_ca_topic_score_codex":0.0031702467,"about_ca_topic_score_gemma":0.0019515974,"teacher_disagreement_score":0.0031702467,"about_ca_system_score_codex":0.0011213848,"about_ca_system_score_gemma":0.000891475,"threshold_uncertainty_score":0.008136272},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064150974,0.0008572715,0.9212083,0.00027770762,0.00006899306,0.0002069935,0.00018887728,0.009268909,0.0037718562],"genre_scores_gemma":[0.3895547,0.00044347407,0.6021188,0.00027575615,0.00005855859,0.0003679339,0.0005528907,0.0006304011,0.0059974613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993303,0.00015501592,0.00008349373,0.000063410334,0.00027752525,0.000090194],"domain_scores_gemma":[0.9984761,0.00021336174,0.00012311425,0.00082061416,0.00031099984,0.000055792443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009388336,0.0004491977,0.0004868335,0.0007832544,0.0006665219,0.0008467488,0.001980137,0.0005106092,0.0021133209],"category_scores_gemma":[0.0021820394,0.00037946197,0.0004274725,0.001228837,0.00063605385,0.0024764768,0.0010615193,0.00076176925,0.0006558379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009395544,0.00046888384,0.0036121788,0.00059664785,0.00013922478,0.0002727562,0.0006305029,0.08016901,0.11206425,0.18822272,0.016360015,0.59652424],"study_design_scores_gemma":[0.0005755772,0.0013805393,0.0018839813,0.00014331022,0.00030664972,0.0008343931,0.00011703658,0.57574505,0.17820914,0.11022386,0.13036719,0.00021315031],"about_ca_topic_score_codex":0.0011997181,"about_ca_topic_score_gemma":0.0019528647,"teacher_disagreement_score":0.0021133209,"about_ca_system_score_codex":0.0007034695,"about_ca_system_score_gemma":0.00103917,"threshold_uncertainty_score":0.007069707},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08966626,0.0012290371,0.8992802,0.00052497303,0.000045732202,0.00003876836,0.00006234634,0.00033343962,0.008819213],"genre_scores_gemma":[0.88362783,0.0006289761,0.11005559,0.000102728365,0.000031857744,0.00007106102,0.000056007077,0.0001931287,0.005232935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968886,0.000105868574,0.000008950982,0.00004393731,0.000112462454,0.00003995524],"domain_scores_gemma":[0.9996979,0.00018405342,0.000030800067,0.00002058294,0.000056568904,0.000010089764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004933009,0.0005833805,0.0004752541,0.00027818262,0.00035919674,0.0005248667,0.0003928012,0.00032065515,0.0011712841],"category_scores_gemma":[0.0014255253,0.00026547798,0.00022452681,0.00045807794,0.00043365773,0.00057794136,0.00035208935,0.00041044984,0.00014955805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073989584,0.000023879107,0.00026877836,0.000051564264,0.0000098022465,0.000019857112,0.000028504803,0.9568101,0.0103932815,0.0067176847,0.00046980407,0.025132693],"study_design_scores_gemma":[0.0000069685157,0.000029508366,0.00013672275,0.0000035091261,0.0000048121865,0.000011176863,0.000012029198,0.9904529,0.004312228,0.004379674,0.0006464577,0.0000040168534],"about_ca_topic_score_codex":0.0022714431,"about_ca_topic_score_gemma":0.0031448235,"teacher_disagreement_score":0.0022714431,"about_ca_system_score_codex":0.00089734583,"about_ca_system_score_gemma":0.00081698986,"threshold_uncertainty_score":0.0065107346},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054741617,0.00007978651,0.94302255,0.000081532584,0.000029879822,0.000046205347,0.00002852036,0.000433489,0.001536457],"genre_scores_gemma":[0.22495443,0.00015766389,0.7723297,0.00003537085,0.000019747447,0.00014540492,0.00007229539,0.000068333444,0.0022171063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998609,0.000033861565,0.000011142169,0.000023441085,0.000057377318,0.000013337809],"domain_scores_gemma":[0.9993678,0.00038748098,0.000045237975,0.00007991913,0.000093729715,0.00002582257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048983074,0.00038463622,0.0004910612,0.00024500012,0.00039093,0.00043482074,0.0008010711,0.0006359954,0.0012360952],"category_scores_gemma":[0.0012542856,0.00025938766,0.00041502606,0.000495344,0.0003575989,0.0006826128,0.00044409875,0.0007198673,0.00025526792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014935342,0.00016914796,0.0020533563,0.00014086418,0.00009389109,0.00023560274,0.00020188373,0.8027242,0.049405407,0.018136885,0.0011974643,0.12549208],"study_design_scores_gemma":[0.000012055555,0.000027233526,0.000104973435,0.0000023031832,0.000004027448,0.000015591304,0.000008388705,0.99505794,0.0035338255,0.0007586764,0.00047195333,0.0000030776673],"about_ca_topic_score_codex":0.0034848878,"about_ca_topic_score_gemma":0.004511191,"teacher_disagreement_score":0.0034848878,"about_ca_system_score_codex":0.0003427006,"about_ca_system_score_gemma":0.0010891556,"threshold_uncertainty_score":0.006929159},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10085107,0.00045990528,0.7393946,0.00076409226,0.00039542431,0.00043164194,0.0011586145,0.14003654,0.016508086],"genre_scores_gemma":[0.5241914,0.00027280417,0.4487417,0.00039343152,0.00017005888,0.0005689487,0.002424512,0.00624282,0.016994424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942845,0.00012114668,0.000046695517,0.00008611519,0.0001927801,0.00012481505],"domain_scores_gemma":[0.99850464,0.00021339246,0.00009937773,0.0008379804,0.00023997256,0.00010465175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007200135,0.00055647886,0.00046958556,0.0004967014,0.0010043795,0.00090452994,0.0018286722,0.00065838645,0.0050240876],"category_scores_gemma":[0.002028803,0.0004678763,0.00059959246,0.00054280285,0.0006455167,0.0009922439,0.001550652,0.001441577,0.002243057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032659187,0.001014983,0.016749443,0.0011153864,0.0003227414,0.0012930518,0.0012878791,0.10821815,0.15827146,0.035645504,0.08311025,0.5897053],"study_design_scores_gemma":[0.00025738243,0.00060415035,0.005554114,0.00007031916,0.0001632763,0.0006177034,0.00022629985,0.7600764,0.10854955,0.013361132,0.11028339,0.00023625567],"about_ca_topic_score_codex":0.004109258,"about_ca_topic_score_gemma":0.006146895,"teacher_disagreement_score":0.0050240876,"about_ca_system_score_codex":0.0005851539,"about_ca_system_score_gemma":0.0011024042,"threshold_uncertainty_score":0.016807199},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23184267,0.0018968404,0.7518653,0.00080418604,0.00027280778,0.00011512003,0.00013986097,0.0018893571,0.011173832],"genre_scores_gemma":[0.8835345,0.0004187093,0.11166525,0.00011247281,0.000088820874,0.000063167565,0.00013721168,0.00012344583,0.0038564836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996594,0.0000914384,0.000021270784,0.000041186424,0.00012894563,0.000057831894],"domain_scores_gemma":[0.99950695,0.00019408621,0.000068072484,0.0001058794,0.00008149634,0.000043513694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033484696,0.00035529718,0.00027343372,0.00025642905,0.00049954484,0.00060509593,0.00060798496,0.00021947533,0.0019607672],"category_scores_gemma":[0.0013766112,0.00018075817,0.00017474416,0.00031725282,0.00026357258,0.00069351454,0.00041364168,0.00050551776,0.00025872028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005650295,0.0003322741,0.0029040396,0.0002734753,0.000051036837,0.00023161898,0.00021075556,0.59945315,0.08554376,0.03904157,0.011263626,0.26012963],"study_design_scores_gemma":[0.000018783076,0.000074341515,0.0004516409,0.0000039975153,0.000006719819,0.000028356217,0.000025854948,0.9841048,0.006198998,0.0062815635,0.002797727,0.0000070961087],"about_ca_topic_score_codex":0.0021115155,"about_ca_topic_score_gemma":0.005538925,"teacher_disagreement_score":0.0021115155,"about_ca_system_score_codex":0.0008225396,"about_ca_system_score_gemma":0.0014220807,"threshold_uncertainty_score":0.006559372},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90557986,0.0017806661,0.072698995,0.00029976227,0.000060460654,0.00009412301,0.00040079298,0.0012705304,0.017814772],"genre_scores_gemma":[0.990104,0.00026171928,0.007367352,0.000026280313,0.000019430445,0.00003806031,0.00022660459,0.00008410142,0.0018723973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999363,0.00011331394,0.000021499607,0.00011414997,0.000241614,0.00014652926],"domain_scores_gemma":[0.9978382,0.00083216076,0.00021858355,0.0002567943,0.00077635964,0.000077879595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049782713,0.0005742572,0.00042045454,0.00079784595,0.00035141833,0.0004490213,0.0007672843,0.00045476411,0.0032661264],"category_scores_gemma":[0.003233677,0.00023573067,0.00034138307,0.0013281803,0.00027915716,0.00063230016,0.00029011688,0.00035324876,0.0004999106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007895484,0.00012306406,0.004501265,0.00022707939,0.0000991815,0.00015519562,0.00010248475,0.9334656,0.0194542,0.0068216887,0.0027803332,0.031480435],"study_design_scores_gemma":[0.000023876539,0.00035767534,0.0016251995,0.000009011104,0.000028000779,0.000059340324,0.0000315583,0.987387,0.008088568,0.0015107681,0.0008692813,0.0000096776785],"about_ca_topic_score_codex":0.0035983555,"about_ca_topic_score_gemma":0.0020007256,"teacher_disagreement_score":0.0035983555,"about_ca_system_score_codex":0.0011118238,"about_ca_system_score_gemma":0.0007019951,"threshold_uncertainty_score":0.010926306},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9851435,0.0009892664,0.009442996,0.00006516332,0.000018518047,0.00002129701,0.0001587128,0.0012827675,0.0028777164],"genre_scores_gemma":[0.9968021,0.00010335881,0.0024429078,0.000020732194,0.0000038948956,0.000013520282,0.00019799078,0.0000545068,0.00036088348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854916,0.00024599032,0.000065815635,0.00020087775,0.00070296205,0.00023515422],"domain_scores_gemma":[0.99633586,0.0014077256,0.00029161506,0.00053865864,0.0013109725,0.0001151099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009559213,0.0003586853,0.00054986245,0.0010918124,0.00054711284,0.0008287221,0.0009546061,0.00047685235,0.0010730568],"category_scores_gemma":[0.005563648,0.00023749485,0.0002358125,0.001723704,0.0004896239,0.0014370688,0.00035539118,0.00040964654,0.00027063987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007991792,0.00084209087,0.058233317,0.00076324015,0.00040736856,0.0005166341,0.0010165802,0.5088931,0.1918454,0.011785024,0.0056778914,0.21202756],"study_design_scores_gemma":[0.00010519034,0.0011896124,0.008930031,0.00003954702,0.0000915161,0.00023687922,0.00015794509,0.7961203,0.18852536,0.0012538239,0.0032900253,0.00005980803],"about_ca_topic_score_codex":0.00436776,"about_ca_topic_score_gemma":0.0031098037,"teacher_disagreement_score":0.00436776,"about_ca_system_score_codex":0.0013598994,"about_ca_system_score_gemma":0.0011482725,"threshold_uncertainty_score":0.009866774},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05838371,0.00072328135,0.77359116,0.00026706496,0.00038065194,0.0005985992,0.0010005303,0.15294114,0.012113995],"genre_scores_gemma":[0.3923364,0.0010586495,0.5336957,0.0005709956,0.0003993764,0.0020421557,0.0053480044,0.027939685,0.036609013],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894077,0.00021154813,0.00013614682,0.0001424601,0.0003944998,0.00017457607],"domain_scores_gemma":[0.99802667,0.0004423642,0.00025408372,0.00064291246,0.0003519869,0.0002818253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016664164,0.0010711428,0.00051251723,0.00064976356,0.00046657224,0.0011939593,0.0033116813,0.0008865209,0.009550126],"category_scores_gemma":[0.0044882908,0.0011365538,0.0006391658,0.00063046993,0.0006725518,0.002198626,0.0027252184,0.0022158276,0.0027073207],"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.006408237,0.0006182983,0.01511246,0.0014454031,0.0004358706,0.001439468,0.0024223386,0.06457396,0.1284772,0.07400452,0.19835466,0.5067076],"study_design_scores_gemma":[0.0020262848,0.0011649432,0.005074074,0.0003036815,0.00027905332,0.0009609489,0.00023124872,0.4283096,0.08728221,0.027284121,0.44679633,0.0002874683],"about_ca_topic_score_codex":0.0020220021,"about_ca_topic_score_gemma":0.0021848516,"teacher_disagreement_score":0.009550126,"about_ca_system_score_codex":0.00084968924,"about_ca_system_score_gemma":0.0012150459,"threshold_uncertainty_score":0.031948328},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41264895,0.0005263403,0.57528,0.00024616387,0.00009207634,0.00010165043,0.00026287945,0.008654105,0.0021878977],"genre_scores_gemma":[0.9184573,0.00015231263,0.07988173,0.000034278826,0.000033581113,0.000059979437,0.00022264267,0.000120027005,0.0010380263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995982,0.00009591117,0.000019753996,0.00004980896,0.00018755802,0.000048710568],"domain_scores_gemma":[0.9973985,0.0013045374,0.00038264348,0.00035737286,0.00047075786,0.00008630018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074773753,0.00053549156,0.00038929607,0.0006352067,0.00027017813,0.00035431996,0.00068386004,0.00019776006,0.0015781574],"category_scores_gemma":[0.0037621988,0.00027571828,0.00015476573,0.0006120629,0.0002751335,0.00063402066,0.0003460713,0.00067195855,0.00030265554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010582112,0.00039129556,0.030264573,0.00019232012,0.00006286629,0.00011174002,0.0001199882,0.539134,0.049879566,0.005450788,0.0057461653,0.36758846],"study_design_scores_gemma":[0.000014674734,0.00012790508,0.001732923,0.000005115559,0.000012521931,0.000019125811,0.0000069938405,0.9783135,0.018258585,0.00096562,0.0005339711,0.000009153921],"about_ca_topic_score_codex":0.00226168,"about_ca_topic_score_gemma":0.0035890893,"teacher_disagreement_score":0.00226168,"about_ca_system_score_codex":0.0005365131,"about_ca_system_score_gemma":0.0017247981,"threshold_uncertainty_score":0.005279422},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6108558,0.0035951098,0.33476886,0.0032089942,0.00016786001,0.00009090801,0.00014963404,0.00135874,0.045804076],"genre_scores_gemma":[0.8957606,0.001339035,0.098806664,0.00025097295,0.000037423844,0.00003928435,0.00005988863,0.000092146845,0.0036140892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999728,0.00006905088,0.00002184255,0.000028321243,0.00009380081,0.00005893407],"domain_scores_gemma":[0.99863017,0.0007705059,0.00017393491,0.0001746142,0.00021558047,0.000035165034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000481515,0.0003767097,0.000176522,0.00021889582,0.00026755728,0.00076209777,0.00083785766,0.00053543004,0.0020553353],"category_scores_gemma":[0.002518181,0.00028143023,0.00017383412,0.0003180808,0.00065516005,0.0023666227,0.00037720148,0.0005770785,0.0003597267],"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.00044908279,0.00017392883,0.0057196827,0.0008691176,0.000053169835,0.0011194067,0.00026699598,0.44408888,0.18816498,0.18488449,0.0030515695,0.17115864],"study_design_scores_gemma":[0.00015442168,0.00078612455,0.0025973413,0.00021053947,0.00007958504,0.0013699105,0.0005146271,0.6326217,0.25153047,0.089744814,0.020321855,0.00006855042],"about_ca_topic_score_codex":0.0007035761,"about_ca_topic_score_gemma":0.0011476901,"teacher_disagreement_score":0.0020553353,"about_ca_system_score_codex":0.00040875244,"about_ca_system_score_gemma":0.00031140188,"threshold_uncertainty_score":0.006875813},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8864536,0.0025061558,0.028548153,0.0016507196,0.0005742876,0.00012566823,0.005091972,0.003020488,0.072028935],"genre_scores_gemma":[0.90487915,0.001445472,0.07845144,0.00023150787,0.00016413674,0.00017037908,0.006945326,0.0007699643,0.0069425115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990306,0.0002052154,0.00005283205,0.00008996321,0.00047843464,0.00014290934],"domain_scores_gemma":[0.997001,0.0013989192,0.00018822566,0.0004074612,0.0008151603,0.00018908603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009305151,0.0008934988,0.0006234067,0.0008965886,0.0008900936,0.0009183812,0.0013275248,0.0004839665,0.0036298782],"category_scores_gemma":[0.0052072187,0.00021004325,0.00039867286,0.0041349814,0.0005800082,0.0008953972,0.0005998268,0.0009991699,0.0008826022],"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.002166126,0.0019220504,0.017880535,0.0008642128,0.00018851853,0.0007990992,0.0004460464,0.53722745,0.026859488,0.13344546,0.12134188,0.15685913],"study_design_scores_gemma":[0.0003511561,0.0006305394,0.014447369,0.000043872646,0.00005546952,0.00029680776,0.00041970026,0.8445859,0.052430585,0.04278932,0.04387886,0.00007036147],"about_ca_topic_score_codex":0.011527796,"about_ca_topic_score_gemma":0.013314545,"teacher_disagreement_score":0.011527796,"about_ca_system_score_codex":0.00065674016,"about_ca_system_score_gemma":0.0012189774,"threshold_uncertainty_score":0.022921443},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10547987,0.00088846165,0.87705433,0.00032784606,0.00009817193,0.00011569874,0.00046008907,0.012821887,0.0027536084],"genre_scores_gemma":[0.5653922,0.00058312074,0.42892277,0.0001671641,0.00008106038,0.00026087379,0.0017526527,0.0013162036,0.0015239026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99856347,0.00048648013,0.00009986223,0.00043099915,0.0003138266,0.00010541168],"domain_scores_gemma":[0.9941334,0.0031877512,0.0006915528,0.0010318158,0.00085185963,0.000103629834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017558718,0.0016199449,0.00086302665,0.0012034492,0.0004397052,0.0016110621,0.0015400288,0.0010732854,0.0014778234],"category_scores_gemma":[0.013204692,0.001012193,0.00086108607,0.0009653102,0.00071906415,0.0028933273,0.00092601334,0.0022772579,0.0012492916],"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.00027544136,0.00018838489,0.009032668,0.00028283737,0.00015669277,0.00009364693,0.00017407675,0.5868677,0.010349048,0.0059815897,0.00465687,0.38194108],"study_design_scores_gemma":[0.00001670397,0.00004808333,0.00050486304,0.00001969557,0.000018164785,0.0000197812,0.000013642695,0.9874702,0.0043085674,0.0066075097,0.00095935236,0.000013409043],"about_ca_topic_score_codex":0.0016175321,"about_ca_topic_score_gemma":0.0021512194,"teacher_disagreement_score":0.0017558718,"about_ca_system_score_codex":0.00075836433,"about_ca_system_score_gemma":0.0011753606,"threshold_uncertainty_score":0.009286106},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9746318,0.00068814686,0.013379815,0.0007197529,0.000019351603,0.00008899377,0.00016379484,0.00032103807,0.009987335],"genre_scores_gemma":[0.9746926,0.00037070358,0.021167912,0.000071698574,0.000019632243,0.000050421237,0.0001456847,0.00008824081,0.0033930633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990133,0.0003995117,0.00004759881,0.000089122324,0.00029878542,0.0001516353],"domain_scores_gemma":[0.99522865,0.0032203654,0.0003066578,0.00052282936,0.0005657199,0.00015586049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012599779,0.0005781813,0.00040034825,0.0007547731,0.0007995516,0.0010908211,0.0013183672,0.0011374278,0.0027921135],"category_scores_gemma":[0.005518342,0.00031232744,0.00049630954,0.0017232151,0.00068053097,0.0014354809,0.00050182635,0.0010100477,0.0003323789],"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.0022265788,0.0021686216,0.03517751,0.001103308,0.00020286274,0.009827734,0.0025681101,0.6353443,0.041665506,0.056310717,0.013212111,0.2001926],"study_design_scores_gemma":[0.0004965306,0.004357859,0.022883682,0.000092105416,0.0002146236,0.0040932633,0.0014622449,0.81618404,0.083427176,0.027382875,0.039282124,0.00012350612],"about_ca_topic_score_codex":0.0032931704,"about_ca_topic_score_gemma":0.006081317,"teacher_disagreement_score":0.0032931704,"about_ca_system_score_codex":0.0013930293,"about_ca_system_score_gemma":0.000518098,"threshold_uncertainty_score":0.010107219},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069984207,0.00013225693,0.98377776,0.00019552218,0.000105804036,0.0002810779,0.00009932461,0.0016437077,0.006766204],"genre_scores_gemma":[0.16637294,0.00040058134,0.81720585,0.00036359899,0.00007565705,0.0017331919,0.0006115946,0.0012382831,0.011998379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99754983,0.00057039113,0.00028370725,0.00030255108,0.0010124227,0.00028097723],"domain_scores_gemma":[0.99735945,0.00065392174,0.00020682147,0.000752594,0.0008173682,0.00020978154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030732406,0.0006788196,0.0005155344,0.00042713626,0.0011490438,0.0028490154,0.0033746876,0.0014062136,0.0039999285],"category_scores_gemma":[0.0071310303,0.00096537085,0.0007829238,0.0004523801,0.0013311881,0.002976971,0.00280366,0.0024945352,0.0019171478],"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.00070875895,0.00019682763,0.0018692099,0.0010575313,0.0000803698,0.0004313234,0.0019140745,0.16896039,0.028517451,0.60093606,0.020360291,0.1749677],"study_design_scores_gemma":[0.00020438767,0.00032917518,0.0004068011,0.00020543531,0.00006861234,0.0004027963,0.00024895562,0.5708075,0.042668674,0.15936801,0.22519587,0.00009376139],"about_ca_topic_score_codex":0.0009189161,"about_ca_topic_score_gemma":0.0009490973,"teacher_disagreement_score":0.0039999285,"about_ca_system_score_codex":0.0008707594,"about_ca_system_score_gemma":0.002000798,"threshold_uncertainty_score":0.016253054},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20627505,0.000615452,0.78091276,0.00026766988,0.00010564246,0.0002237701,0.00016635256,0.0038150274,0.007618232],"genre_scores_gemma":[0.62226385,0.000256361,0.372711,0.000058295427,0.000023859482,0.00025309814,0.00027890425,0.00032417575,0.0038304308],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994759,0.00016263027,0.000042802294,0.00003750265,0.00020544378,0.00007577593],"domain_scores_gemma":[0.998787,0.00043381265,0.00009591636,0.00022262378,0.00038232864,0.00007834417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006356588,0.0003364031,0.00026278844,0.00046475852,0.00036659653,0.00069782627,0.0011428919,0.0004012174,0.0036887114],"category_scores_gemma":[0.0018039098,0.00032881022,0.00018134927,0.00034894558,0.000307653,0.00091667735,0.00041697337,0.0005453832,0.0005293571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010328903,0.00029582967,0.0029846698,0.00067971786,0.00009195946,0.0015347354,0.0009550793,0.1290672,0.55414915,0.05856334,0.006930772,0.2437147],"study_design_scores_gemma":[0.0003267018,0.0018165564,0.0013664049,0.000088532775,0.00009860282,0.0009172375,0.0002060742,0.4815855,0.45300663,0.0073660295,0.05312775,0.000093986935],"about_ca_topic_score_codex":0.0004853397,"about_ca_topic_score_gemma":0.0010028626,"teacher_disagreement_score":0.0036887114,"about_ca_system_score_codex":0.00026587845,"about_ca_system_score_gemma":0.00041833683,"threshold_uncertainty_score":0.012340009},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031125667,0.0018274372,0.9443682,0.00037434226,0.00023941403,0.0001000541,0.00010244782,0.011323217,0.0105393175],"genre_scores_gemma":[0.35731822,0.0011958588,0.6256738,0.00045900088,0.00019209717,0.00020267631,0.000434735,0.00052076636,0.014002812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998301,0.00003357434,0.000008273035,0.000027996606,0.0000772608,0.000022817218],"domain_scores_gemma":[0.99985003,0.000024741223,0.000017336451,0.0000506618,0.00003298853,0.000024276895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026026682,0.00040577777,0.00051076716,0.00044593262,0.00047228122,0.0007564022,0.0020632609,0.00063600903,0.004658777],"category_scores_gemma":[0.00043637742,0.00028711182,0.00031359642,0.0005746862,0.00047091465,0.0010441457,0.0008439405,0.00067309494,0.0015834958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011043363,0.00025280064,0.0012367644,0.00045303593,0.00020879926,0.0009828678,0.00047348347,0.091798045,0.19786991,0.11304916,0.039512303,0.5530584],"study_design_scores_gemma":[0.00028724392,0.0010357238,0.0009774106,0.000047494224,0.00009305038,0.0012588714,0.00007844271,0.7366567,0.10453291,0.03633187,0.11857854,0.00012174312],"about_ca_topic_score_codex":0.0003448693,"about_ca_topic_score_gemma":0.00052607455,"teacher_disagreement_score":0.004658777,"about_ca_system_score_codex":0.0003319359,"about_ca_system_score_gemma":0.00031301755,"threshold_uncertainty_score":0.015585184},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05066622,0.002175257,0.7595429,0.0013405076,0.00067481754,0.00042713337,0.0032497868,0.061972953,0.11995044],"genre_scores_gemma":[0.46303904,0.0012322632,0.36124077,0.0016364699,0.00025831163,0.00044673344,0.014051879,0.0055687535,0.15252575],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939597,0.000056255216,0.000042496726,0.00011957289,0.0003188209,0.00006689787],"domain_scores_gemma":[0.9986897,0.00018145569,0.000074408505,0.0004856344,0.00050785346,0.00006094791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005377685,0.000512506,0.00039116913,0.00040912183,0.0003545056,0.0012615606,0.0014966861,0.0004966879,0.028818972],"category_scores_gemma":[0.0019545746,0.00030678516,0.00043737108,0.0006358321,0.00044696147,0.0015641422,0.001401983,0.0007711675,0.015746826],"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.00075844536,0.00021051968,0.0036131612,0.00079323625,0.00006682009,0.00039017154,0.00028691711,0.03161978,0.05858498,0.059769828,0.14438164,0.69952446],"study_design_scores_gemma":[0.0002722432,0.000715259,0.0023319295,0.0001240699,0.000059072554,0.0007799664,0.00015142198,0.27404904,0.07929076,0.054717213,0.58741844,0.000090606896],"about_ca_topic_score_codex":0.0014044611,"about_ca_topic_score_gemma":0.0023364017,"teacher_disagreement_score":0.028818972,"about_ca_system_score_codex":0.00045382377,"about_ca_system_score_gemma":0.0010710597,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5586884,0.002396386,0.43077222,0.00036236385,0.000119702505,0.000046120473,0.00009083571,0.0026681046,0.004855897],"genre_scores_gemma":[0.950928,0.00031602333,0.046918977,0.00007070288,0.0000193224,0.00001985179,0.000054253585,0.00009965619,0.0015733426],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999192,0.000013628973,0.0000056652666,0.00001530775,0.000026094944,0.0000200996],"domain_scores_gemma":[0.9998504,0.000041586733,0.000033816475,0.000035601424,0.00002939512,0.0000090937565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000081080754,0.00028810938,0.00020746015,0.00021798897,0.00019087104,0.00030733377,0.0006315253,0.00016681287,0.00103359],"category_scores_gemma":[0.0003118053,0.00016849845,0.00020711467,0.00033386043,0.00011824077,0.00042850696,0.00016601931,0.00024177205,0.00016819939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035875727,0.0001699294,0.0049749725,0.00022713968,0.0000748623,0.00036180767,0.00020808534,0.06633731,0.69484705,0.004833077,0.0021187472,0.22548823],"study_design_scores_gemma":[0.000051549494,0.00074234075,0.0044997577,0.000035689114,0.000112532296,0.0004986379,0.000054671378,0.62831396,0.35000405,0.0029771805,0.012674641,0.000034942263],"about_ca_topic_score_codex":0.0008341168,"about_ca_topic_score_gemma":0.003731713,"teacher_disagreement_score":0.00103359,"about_ca_system_score_codex":0.0002164198,"about_ca_system_score_gemma":0.00042330896,"threshold_uncertainty_score":0.003457725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45882997,0.0016801822,0.4987197,0.0023806551,0.00014825286,0.00024071043,0.0006156289,0.013072041,0.024312926],"genre_scores_gemma":[0.89416605,0.00048690144,0.10212177,0.00018372237,0.000040476316,0.00016745956,0.00048813864,0.0005793046,0.0017661542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708706,0.0011269263,0.00016020284,0.00046142988,0.00093810627,0.00022631444],"domain_scores_gemma":[0.9798166,0.013719593,0.000662255,0.0040911157,0.0015102911,0.00020010874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042288178,0.00095996953,0.0007091651,0.00081630785,0.0006552409,0.0013315699,0.0016194938,0.000693544,0.005053717],"category_scores_gemma":[0.02260209,0.0006808463,0.0005927289,0.0009655709,0.0012266507,0.00462827,0.0013738255,0.0013221885,0.0007300465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009102187,0.00024589102,0.009873262,0.0002891338,0.00012585083,0.00034297362,0.0004469333,0.78603804,0.032916296,0.03564638,0.0047018207,0.12846324],"study_design_scores_gemma":[0.00003968361,0.000073433526,0.00040292877,0.000019157322,0.000022453016,0.000059978494,0.000042071955,0.9773632,0.00835024,0.012153717,0.0014605895,0.000012585876],"about_ca_topic_score_codex":0.0059249266,"about_ca_topic_score_gemma":0.0043722163,"teacher_disagreement_score":0.0059249266,"about_ca_system_score_codex":0.0012682164,"about_ca_system_score_gemma":0.0016522871,"threshold_uncertainty_score":0.022364378},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10075466,0.00036592397,0.83993304,0.00019910364,0.000113640956,0.000398284,0.0012833575,0.022303905,0.03464812],"genre_scores_gemma":[0.70707834,0.00028019823,0.27426854,0.00021916517,0.000045712088,0.00032944433,0.0020684171,0.00068442564,0.01502576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997702,0.000039933348,0.000015034649,0.000052583986,0.00009576004,0.000026516645],"domain_scores_gemma":[0.99975556,0.00004973733,0.00003100286,0.000058189773,0.000084630185,0.000020963347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023750165,0.0004508757,0.00031893468,0.00035607436,0.00021903048,0.0005754552,0.00093461166,0.0003154456,0.008865433],"category_scores_gemma":[0.0005087577,0.00017639932,0.00019023892,0.0005716308,0.0002773421,0.0005076654,0.00026144343,0.00043597686,0.0017624517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015794582,0.00041893724,0.0058145374,0.00065753073,0.00013369776,0.0010716706,0.00026878083,0.29994795,0.24379535,0.038441893,0.04421573,0.36365446],"study_design_scores_gemma":[0.00016189106,0.00040763034,0.0007962108,0.000018818944,0.000040169485,0.00037082794,0.0000314975,0.80538017,0.1277072,0.0023932508,0.062658,0.000034276698],"about_ca_topic_score_codex":0.00082411885,"about_ca_topic_score_gemma":0.00075119786,"teacher_disagreement_score":0.008865433,"about_ca_system_score_codex":0.00041499978,"about_ca_system_score_gemma":0.00051668775,"threshold_uncertainty_score":0.0296579},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5717471,0.0006508576,0.40651754,0.00032690057,0.00012328742,0.00006683851,0.00020863465,0.010644607,0.009714245],"genre_scores_gemma":[0.82858396,0.0002673003,0.16840723,0.00005630375,0.000014632111,0.000054016877,0.00020164304,0.000846576,0.0015683629],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996747,0.000041906653,0.000013629304,0.00003807316,0.00018877417,0.000042978365],"domain_scores_gemma":[0.9991923,0.00024550242,0.00011052298,0.00025278368,0.00017174255,0.000027177268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032656992,0.00041063418,0.00021417651,0.00046491402,0.00027254928,0.00066712213,0.0007427106,0.00025180087,0.0009626839],"category_scores_gemma":[0.0016935919,0.00021064773,0.00018157973,0.00038025933,0.00048050444,0.0009205224,0.00046091178,0.0008085338,0.00024660947],"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.00026665363,0.00022327286,0.01702351,0.00028219,0.00004557936,0.00046236103,0.00078833604,0.19073252,0.44669572,0.04528342,0.0046344665,0.2935619],"study_design_scores_gemma":[0.000025708112,0.00027038346,0.006697344,0.00003501278,0.000027692055,0.00021077826,0.00012579786,0.654909,0.30873543,0.011438302,0.017480984,0.000043494896],"about_ca_topic_score_codex":0.002236299,"about_ca_topic_score_gemma":0.0035918052,"teacher_disagreement_score":0.002236299,"about_ca_system_score_codex":0.0005383195,"about_ca_system_score_gemma":0.0006689822,"threshold_uncertainty_score":0.004446566},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77523834,0.0015178927,0.20644528,0.0002749065,0.0001683165,0.000054898534,0.00010515553,0.0033552065,0.012840032],"genre_scores_gemma":[0.90582,0.0003176779,0.09140926,0.000046446978,0.00003771218,0.00003843208,0.00010106364,0.00008058895,0.0021488531],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997429,0.000056539575,0.000021809155,0.000059120546,0.00007117418,0.000048394402],"domain_scores_gemma":[0.99941003,0.0002006236,0.00007880622,0.00016944399,0.000091406175,0.000049786377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029438568,0.00042758088,0.00023669867,0.0005790052,0.0002892411,0.0005232707,0.0007498204,0.0002695421,0.0027824144],"category_scores_gemma":[0.0014383962,0.00013959907,0.00018614002,0.00084577844,0.00022869631,0.00086247793,0.0003290316,0.00038875482,0.00035564502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017894135,0.00033432688,0.0053657405,0.00024008783,0.00008842696,0.00036479344,0.00020207728,0.25385815,0.2328442,0.016319333,0.0057178917,0.4828755],"study_design_scores_gemma":[0.0001947064,0.0011554767,0.0039172065,0.000034455177,0.00007331703,0.00041276895,0.000077118224,0.8706814,0.10938784,0.004588995,0.009423417,0.000053405187],"about_ca_topic_score_codex":0.00071965816,"about_ca_topic_score_gemma":0.0011480728,"teacher_disagreement_score":0.0027824144,"about_ca_system_score_codex":0.00039950662,"about_ca_system_score_gemma":0.0003237024,"threshold_uncertainty_score":0.0093081},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18391532,0.000054449214,0.80432147,0.00011951003,0.000043010936,0.00020597715,0.000237218,0.0053814454,0.005721555],"genre_scores_gemma":[0.56328297,0.00006584301,0.4328462,0.00004942497,0.000011847847,0.000371271,0.00051154743,0.0007175141,0.0021433723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99929464,0.00017077554,0.000040371062,0.00013124083,0.00030757926,0.000055324977],"domain_scores_gemma":[0.99814963,0.00096933095,0.00014665342,0.00046984307,0.0002038119,0.000060854098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081789546,0.0004652406,0.0003340594,0.00033275556,0.0005861857,0.0006381162,0.0007568965,0.000270897,0.0047726734],"category_scores_gemma":[0.0028247705,0.00023764865,0.00035242533,0.0004929878,0.0011023538,0.0011385492,0.00057947886,0.0006857063,0.00033998565],"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.0014216235,0.000566771,0.0028255852,0.0006261855,0.00005451397,0.00037672583,0.0008727843,0.3314557,0.20968032,0.27294114,0.0040958086,0.17508277],"study_design_scores_gemma":[0.0000751181,0.00017798565,0.00058471586,0.000019241286,0.00001961869,0.000085766376,0.0000704197,0.8105661,0.13791633,0.042166594,0.008296068,0.000022046192],"about_ca_topic_score_codex":0.0009425333,"about_ca_topic_score_gemma":0.0012450188,"teacher_disagreement_score":0.0047726734,"about_ca_system_score_codex":0.0007227379,"about_ca_system_score_gemma":0.0007561936,"threshold_uncertainty_score":0.015966177},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4090274,0.0033968862,0.5756389,0.0008820941,0.00012305428,0.00005455805,0.00009008538,0.0039646886,0.0068223043],"genre_scores_gemma":[0.9207666,0.0003332231,0.0774292,0.00008637344,0.00006491153,0.000036995458,0.00006367922,0.00006863128,0.0011503929],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937254,0.00020615416,0.000034369878,0.00006468131,0.00022445343,0.00009794531],"domain_scores_gemma":[0.99746335,0.0010530951,0.00034143782,0.0007008175,0.00037453754,0.00006684183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007524936,0.0002933541,0.00038707184,0.00051171915,0.0004852862,0.00055114273,0.0008307414,0.00035013037,0.0015140827],"category_scores_gemma":[0.003311853,0.00026280046,0.00031004957,0.0007869975,0.00052864867,0.0012511446,0.0008627677,0.0005763518,0.0003384684],"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.0009839288,0.00039919486,0.018531408,0.0004197093,0.00015433067,0.00030138125,0.0006136722,0.22032703,0.2030823,0.035445474,0.00756145,0.51218015],"study_design_scores_gemma":[0.00008591844,0.00035179118,0.0022231883,0.000042796695,0.00010373056,0.0002660237,0.00011780719,0.8762374,0.093094304,0.020507993,0.0069297175,0.00003925523],"about_ca_topic_score_codex":0.0013423944,"about_ca_topic_score_gemma":0.0025384645,"teacher_disagreement_score":0.0015140827,"about_ca_system_score_codex":0.00049502985,"about_ca_system_score_gemma":0.0011798363,"threshold_uncertainty_score":0.0050650835},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9218051,0.0020714342,0.06454007,0.00027893417,0.0001465809,0.00011978975,0.00038518658,0.001931613,0.008721242],"genre_scores_gemma":[0.98009616,0.0002685134,0.017882107,0.000032326792,0.00001876737,0.00003113009,0.00011782774,0.00010183768,0.0014512138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961084,0.000057435554,0.000025738264,0.00007589407,0.00014806999,0.00008205042],"domain_scores_gemma":[0.99860126,0.00051759434,0.0003148797,0.0002775281,0.00026026214,0.000028501683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028442626,0.00045531354,0.00035511886,0.0004914585,0.00025055557,0.0005135439,0.0012327008,0.0002225725,0.0026781426],"category_scores_gemma":[0.0017179284,0.00024456464,0.00033977733,0.0006682816,0.00023391358,0.0011981124,0.0002313048,0.0002958327,0.00025009326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001190715,0.00041368033,0.01084182,0.0010095998,0.00023055408,0.00053945545,0.00019771706,0.4753463,0.36271358,0.008338935,0.0053861346,0.13379155],"study_design_scores_gemma":[0.00012548061,0.0027010948,0.009012403,0.000039844756,0.0002623936,0.00054742856,0.0001227628,0.76049817,0.21513031,0.0015634563,0.009924583,0.000072096984],"about_ca_topic_score_codex":0.0026567436,"about_ca_topic_score_gemma":0.0057813562,"teacher_disagreement_score":0.0026781426,"about_ca_system_score_codex":0.0010193173,"about_ca_system_score_gemma":0.0008410724,"threshold_uncertainty_score":0.008959353},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12514614,0.00048998994,0.8579683,0.0003405779,0.000106439125,0.00033345728,0.00036415877,0.006726249,0.008524661],"genre_scores_gemma":[0.68328106,0.00018980587,0.31140292,0.00008053428,0.00005259351,0.0008828177,0.00092048716,0.0006328404,0.0025569235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947654,0.0026518092,0.00028283254,0.0003793766,0.0015895263,0.00033106137],"domain_scores_gemma":[0.988832,0.0070792907,0.0004260333,0.0023941032,0.0010402609,0.00022830327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032664246,0.0009821674,0.000789504,0.0011738171,0.00078390137,0.0014103766,0.0027505597,0.0009353346,0.0041551446],"category_scores_gemma":[0.019238837,0.00047845184,0.00061213295,0.0015124341,0.0014349758,0.0031596618,0.0022513554,0.0011627066,0.0005588063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015456178,0.00057196536,0.006456285,0.0006794745,0.00019106841,0.00051142165,0.00053460174,0.5772885,0.021976959,0.15417507,0.008428259,0.22764078],"study_design_scores_gemma":[0.00021897352,0.00028288134,0.00047023615,0.00003713758,0.000024949399,0.00007332065,0.00009024763,0.9136494,0.019512344,0.06159007,0.0040324363,0.000018032973],"about_ca_topic_score_codex":0.001639155,"about_ca_topic_score_gemma":0.0010795951,"teacher_disagreement_score":0.0041551446,"about_ca_system_score_codex":0.0011017686,"about_ca_system_score_gemma":0.0014017939,"threshold_uncertainty_score":0.017274678},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052587844,0.0010181288,0.90781116,0.0010115148,0.00016787347,0.00015520783,0.00041296927,0.024546191,0.0122890975],"genre_scores_gemma":[0.39064115,0.000534934,0.5924307,0.00030181892,0.00016596628,0.00043982733,0.0012367895,0.0013428036,0.012906078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998042,0.0005586265,0.00022991186,0.00033179883,0.000651016,0.00018671658],"domain_scores_gemma":[0.9962257,0.0005367214,0.00027662667,0.001965753,0.0007906022,0.00020465037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015529335,0.00043624372,0.00070926175,0.00087285234,0.001638761,0.0025074685,0.0025960824,0.00062579144,0.0037756932],"category_scores_gemma":[0.0045362306,0.00048429132,0.00036775885,0.0016364316,0.0009971419,0.002734461,0.0026044794,0.0011838909,0.0018495681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086358946,0.00027092083,0.00494395,0.000311308,0.00010393697,0.0005394553,0.0015421852,0.0870495,0.07281422,0.103198536,0.06495802,0.6634044],"study_design_scores_gemma":[0.0003322756,0.00026661958,0.0021436533,0.00006255327,0.00006893891,0.0005218453,0.00030432988,0.6670317,0.10433147,0.06804543,0.15677592,0.00011524656],"about_ca_topic_score_codex":0.002877151,"about_ca_topic_score_gemma":0.0028769798,"teacher_disagreement_score":0.0037756932,"about_ca_system_score_codex":0.0014254778,"about_ca_system_score_gemma":0.001185924,"threshold_uncertainty_score":0.0126309395},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43612897,0.0015336578,0.5523199,0.00028250535,0.0000953266,0.000068369365,0.00005530983,0.002475505,0.007040422],"genre_scores_gemma":[0.78402936,0.00049123575,0.21199055,0.00009691149,0.000047137382,0.00004960832,0.00008403043,0.00015251685,0.003058646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996475,0.000048714548,0.00003314531,0.00004989685,0.00015931793,0.00006147323],"domain_scores_gemma":[0.99928015,0.00025035389,0.00013291439,0.0001621048,0.00013801377,0.000036444362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053556374,0.00046175375,0.00030417132,0.00041151704,0.00023583048,0.00057942886,0.0007065891,0.00022903389,0.0028788012],"category_scores_gemma":[0.0016231788,0.00026290322,0.00028198404,0.0005071508,0.00028700946,0.0014283098,0.00073180493,0.00051676045,0.00047352564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006367685,0.0003009708,0.004275274,0.0004047155,0.00007729488,0.0002062768,0.00019432764,0.19283828,0.32993054,0.014567557,0.0023388818,0.45422906],"study_design_scores_gemma":[0.0001815984,0.0010870253,0.0020992993,0.000037722464,0.00009311663,0.00021225335,0.00006983004,0.77698356,0.19691986,0.011014038,0.011269649,0.00003213559],"about_ca_topic_score_codex":0.0006294487,"about_ca_topic_score_gemma":0.0012319712,"teacher_disagreement_score":0.0028788012,"about_ca_system_score_codex":0.00032813317,"about_ca_system_score_gemma":0.00056239194,"threshold_uncertainty_score":0.0096306205},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1743709,0.0036503065,0.7833077,0.00039709857,0.00027300647,0.00021219387,0.00021016021,0.0038003584,0.033778302],"genre_scores_gemma":[0.6942256,0.001126915,0.2762108,0.00022341906,0.000086651744,0.00014497769,0.0005227339,0.00021736058,0.027241468],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999027,0.000009923176,0.0000076284587,0.000018555276,0.000047099893,0.0000141047785],"domain_scores_gemma":[0.9998815,0.000019323266,0.000017194601,0.000020087002,0.000051446757,0.000010430056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000088884575,0.00022691005,0.00019459536,0.00023790594,0.00016049699,0.00033952104,0.00049957266,0.00023279423,0.004545419],"category_scores_gemma":[0.00028434495,0.00014492442,0.0001276127,0.00030625853,0.00008649957,0.00042665342,0.00029134145,0.00046266642,0.0014073028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049023004,0.00025428995,0.001435294,0.0004230043,0.000044531167,0.00034359292,0.00008004342,0.016314002,0.53788567,0.014661726,0.011910118,0.41615757],"study_design_scores_gemma":[0.00022802105,0.0015442682,0.005149461,0.00008546933,0.0001262071,0.0016773675,0.00007118146,0.39936662,0.42816404,0.008514043,0.15501253,0.00006076436],"about_ca_topic_score_codex":0.00013534077,"about_ca_topic_score_gemma":0.00029239384,"teacher_disagreement_score":0.004545419,"about_ca_system_score_codex":0.00013770701,"about_ca_system_score_gemma":0.00028098305,"threshold_uncertainty_score":0.01520592},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062677726,0.016783198,0.8795171,0.008017277,0.00123475,0.00008581357,0.00013038582,0.008534352,0.02301938],"genre_scores_gemma":[0.5937257,0.008811879,0.37234193,0.0023795576,0.0009516883,0.0002002034,0.00025392105,0.001731298,0.019603789],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877423,0.00035893323,0.000049428472,0.00017801099,0.00043270845,0.0002067194],"domain_scores_gemma":[0.99764,0.0007315122,0.00015590576,0.0010334759,0.00027321844,0.00016597111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016869258,0.00053594424,0.00068194047,0.0004712934,0.00064960687,0.0018123222,0.0021188266,0.00077163504,0.0030920147],"category_scores_gemma":[0.004894004,0.00048523652,0.00056379085,0.00074322324,0.0013895248,0.00802262,0.0019902124,0.0038985966,0.0010560845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007951027,0.00023702001,0.005131603,0.000341455,0.00013058037,0.0002897251,0.0010086414,0.038975656,0.020913811,0.29569003,0.034703232,0.60178304],"study_design_scores_gemma":[0.00028469705,0.0005920736,0.0017566116,0.00030232492,0.00023849338,0.0010612243,0.0005998857,0.3570692,0.06689314,0.29946014,0.27151537,0.00022688374],"about_ca_topic_score_codex":0.0014440268,"about_ca_topic_score_gemma":0.0025094706,"teacher_disagreement_score":0.0030920147,"about_ca_system_score_codex":0.0007085993,"about_ca_system_score_gemma":0.0017578371,"threshold_uncertainty_score":0.01034385},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059634164,0.00035445945,0.8758591,0.0013253615,0.00047590162,0.00021553185,0.00022757972,0.025512697,0.03639518],"genre_scores_gemma":[0.47282824,0.0005170026,0.49792358,0.00036505528,0.0004210477,0.0006544735,0.0015569744,0.0036528097,0.022080816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828595,0.00045323514,0.00008505143,0.00014483115,0.0007834649,0.00024746906],"domain_scores_gemma":[0.99551445,0.0009935314,0.00021811154,0.0019249975,0.0010838344,0.00026508034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017400401,0.00057712337,0.0006753339,0.0006825104,0.001987793,0.0020380586,0.0027962136,0.00096092216,0.006625974],"category_scores_gemma":[0.007678791,0.00043587628,0.00050308736,0.0012234149,0.0008527616,0.0026450797,0.0027154905,0.0020492198,0.0027586757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015634461,0.0007518234,0.010198593,0.00091893156,0.00023307177,0.0013462629,0.002706137,0.08197769,0.11119451,0.22617653,0.11200242,0.45093066],"study_design_scores_gemma":[0.00018238531,0.0002112225,0.0017288566,0.00007610024,0.000083803156,0.00033890875,0.00034559233,0.63744855,0.07416825,0.05604918,0.22923078,0.00013639969],"about_ca_topic_score_codex":0.0039027226,"about_ca_topic_score_gemma":0.0049591614,"teacher_disagreement_score":0.006625974,"about_ca_system_score_codex":0.0008121336,"about_ca_system_score_gemma":0.002026116,"threshold_uncertainty_score":0.022166133},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.959188,0.00026586262,0.02927448,0.00008458201,0.000040032894,0.000053992146,0.00025012592,0.0020578573,0.008785146],"genre_scores_gemma":[0.98689914,0.00009399335,0.010872212,0.000022197552,0.0000049045666,0.000025174744,0.00030445104,0.00013351608,0.001644463],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928826,0.00015174923,0.000034963487,0.000080682075,0.00031050094,0.00013374617],"domain_scores_gemma":[0.9985077,0.0006633178,0.00012389045,0.00035717915,0.00029179174,0.000056083885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042321676,0.0004117097,0.00025248431,0.00048339384,0.00028196603,0.0005973063,0.00060935604,0.00018028257,0.0036494774],"category_scores_gemma":[0.0022984103,0.00014869805,0.00021136136,0.0006917433,0.0003094014,0.00073655206,0.00026528642,0.00033950628,0.0003605335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004789121,0.00070807204,0.018403837,0.0006596861,0.00009480225,0.00062684703,0.00045841344,0.32164723,0.38780418,0.015024996,0.0057036877,0.24407908],"study_design_scores_gemma":[0.000093094466,0.00087609224,0.011399159,0.000024507777,0.000091154485,0.0003309329,0.00011762016,0.5671264,0.41099006,0.0020745418,0.006823312,0.000053120373],"about_ca_topic_score_codex":0.003024733,"about_ca_topic_score_gemma":0.00278534,"teacher_disagreement_score":0.0036494774,"about_ca_system_score_codex":0.0010748339,"about_ca_system_score_gemma":0.0009134689,"threshold_uncertainty_score":0.0122087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06205867,0.0004019622,0.8190116,0.0004362884,0.00024034604,0.0006933848,0.0017165334,0.08524141,0.030199792],"genre_scores_gemma":[0.32996237,0.00032058416,0.65217096,0.00018456765,0.0000863864,0.0010070899,0.0052721784,0.0035504391,0.0074454006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995753,0.00006927276,0.000019549474,0.00008814601,0.0001714182,0.00007627012],"domain_scores_gemma":[0.999223,0.00018453108,0.000062582745,0.00023943423,0.00017759658,0.00011290727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007060889,0.0008105136,0.0005757536,0.000526847,0.00047954425,0.00072015653,0.0025446075,0.0006368558,0.008062823],"category_scores_gemma":[0.0020000564,0.00043915233,0.00045525946,0.00075536926,0.000592274,0.0011821582,0.0011006545,0.0014573331,0.0024602192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031928478,0.00082436635,0.0035162326,0.0010896745,0.00019529588,0.0011466907,0.0007018865,0.16700304,0.17209516,0.085008845,0.16208392,0.403142],"study_design_scores_gemma":[0.0005816486,0.000718018,0.0016336037,0.000052399697,0.00006905628,0.0005861541,0.00006617231,0.8033928,0.106167674,0.0134752905,0.0731554,0.00010180641],"about_ca_topic_score_codex":0.0017296326,"about_ca_topic_score_gemma":0.0013478776,"teacher_disagreement_score":0.008062823,"about_ca_system_score_codex":0.00047505458,"about_ca_system_score_gemma":0.0010551759,"threshold_uncertainty_score":0.02697277},"labels":[],"label_agreement":null},{"id":"W2113124751","doi":"10.1145/356989.357009","title":"OS and compiler considerations in the design of the IA-64 architecture","year":2000,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hewlett-Packard (Canada)","funders":"","keywords":"Computer science; Compiler; Instruction-level parallelism; Instruction set; Computer architecture; Exploit; Parallelism (grammar); Architecture; Addressing mode; Parallel computing; Programming language; Operating system; Instructions per cycle","score_opus":0.028591066831945428,"score_gpt":0.26507831811897303,"score_spread":0.2364872512870276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113124751","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21852489,0.007289123,0.6415781,0.0068770642,0.0018553904,0.00044677075,0.00023061248,0.003736605,0.1194614],"genre_scores_gemma":[0.5983551,0.0024837765,0.36531636,0.0016857713,0.00032739204,0.00029495376,0.00014537538,0.0007215189,0.030669713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994955,0.00013403417,0.0000604714,0.00005147101,0.0001697451,0.00008860376],"domain_scores_gemma":[0.99922097,0.0002327862,0.000081989325,0.00010401316,0.00031266996,0.00004755634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012553422,0.00039014238,0.00023669911,0.00050474954,0.0005316034,0.001962543,0.0005502318,0.0005150113,0.0018747529],"category_scores_gemma":[0.0025244711,0.000561188,0.0003893935,0.00061957905,0.00067522447,0.0017982792,0.0005811146,0.0015977406,0.00071226235],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087327696,0.00012458191,0.005823399,0.0008228199,0.00006876793,0.0011115868,0.0015699344,0.093055055,0.112664945,0.45216644,0.009800222,0.321919],"study_design_scores_gemma":[0.00021464194,0.0016685345,0.006348169,0.00059889926,0.000373569,0.0014401318,0.0010463024,0.18953176,0.10618045,0.18011771,0.51230067,0.00017916875],"about_ca_topic_score_codex":0.00109012,"about_ca_topic_score_gemma":0.003080983,"teacher_disagreement_score":0.001962543,"about_ca_system_score_codex":0.00062472565,"about_ca_system_score_gemma":0.0015820083,"threshold_uncertainty_score":0.0066390038},"labels":[],"label_agreement":null},{"id":"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002811009,0.00029297778,0.77703923,0.00023884233,0.0002571072,0.00037746996,0.0056707095,0.18963715,0.023675432],"genre_scores_gemma":[0.03784776,0.0005711233,0.8886144,0.0004726067,0.00022696037,0.00089986145,0.012804225,0.025232773,0.033330236],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983065,0.00017695427,0.00014502765,0.00026499107,0.0009011711,0.0002053285],"domain_scores_gemma":[0.9964322,0.0008315772,0.00026335233,0.0007099618,0.0015813074,0.00018162001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011836771,0.0024179146,0.0011862381,0.0018531352,0.001501712,0.002112797,0.004493968,0.0009886416,0.057528716],"category_scores_gemma":[0.0060064816,0.0008841062,0.0011608889,0.0027770994,0.00077598344,0.0018374764,0.0012700629,0.0031420086,0.03876243],"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.00064246915,0.0002931484,0.0012320699,0.0012242867,0.00014814598,0.00045105253,0.00022976982,0.03952311,0.034366626,0.0614193,0.40029833,0.4601717],"study_design_scores_gemma":[0.00035066748,0.00019987463,0.0019216669,0.00024014688,0.00011633615,0.00083793956,0.00007604291,0.3989975,0.11246888,0.045670528,0.43884495,0.0002754667],"about_ca_topic_score_codex":0.0071617407,"about_ca_topic_score_gemma":0.0068872278,"teacher_disagreement_score":0.057528716,"about_ca_system_score_codex":0.0013037012,"about_ca_system_score_gemma":0.0037607248,"threshold_uncertainty_score":0.19245273},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55227405,0.00442931,0.3936822,0.00058847957,0.0011097882,0.00022342813,0.0009969323,0.0055808155,0.04111491],"genre_scores_gemma":[0.65889096,0.0013496266,0.32747492,0.00028512703,0.00016441736,0.00012947353,0.00062619854,0.000111469875,0.0109679345],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999366,0.0000094821835,0.0000067242468,0.000015588605,0.000023397564,0.000008301277],"domain_scores_gemma":[0.99974173,0.000040781593,0.00006780595,0.000066453504,0.00006674898,0.000016478101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009565679,0.00038325597,0.0002676772,0.00028752218,0.00017407165,0.00053632364,0.00069119857,0.00038151536,0.001972837],"category_scores_gemma":[0.00023700036,0.00020036123,0.00020757134,0.0005159205,0.00020607184,0.0010078787,0.00035749818,0.00022349478,0.0010016952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028243806,0.0001608527,0.0027059107,0.00069347525,0.00015611952,0.0011974227,0.00013732442,0.020924188,0.6572675,0.02379308,0.008944498,0.28373712],"study_design_scores_gemma":[0.00013779431,0.0018690034,0.0038992474,0.0001097459,0.00027280074,0.0036651003,0.00016059137,0.190892,0.7055958,0.009494955,0.083778776,0.00012430303],"about_ca_topic_score_codex":0.00023416663,"about_ca_topic_score_gemma":0.0010219603,"teacher_disagreement_score":0.001972837,"about_ca_system_score_codex":0.00016605826,"about_ca_system_score_gemma":0.0001300467,"threshold_uncertainty_score":0.006599784},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040844567,0.0042833243,0.8272612,0.0024369643,0.0009678826,0.00008242096,0.00060599635,0.0005866548,0.122931],"genre_scores_gemma":[0.613439,0.011096466,0.27802336,0.0015306429,0.002226328,0.00030474176,0.001557956,0.00071716396,0.091104485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807644,0.0004655652,0.00013882841,0.0002538409,0.00077464106,0.00029058655],"domain_scores_gemma":[0.9946812,0.002274687,0.0004459934,0.0012800051,0.0011279271,0.00019023698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00105501,0.0007395271,0.0005412432,0.0021882786,0.001484087,0.0031231765,0.00089066965,0.0012001656,0.008762171],"category_scores_gemma":[0.009166053,0.00037876572,0.0004926529,0.0033346226,0.0039408314,0.0064587635,0.00292892,0.0024307775,0.003381618],"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.000025391144,0.000005898381,0.00014248188,0.000020844534,0.0000017259274,0.000036859572,0.00008800468,0.0072189094,0.00026933898,0.97108454,0.0024975901,0.018608408],"study_design_scores_gemma":[0.0000066200764,0.00001782127,0.00010839347,0.000051487266,0.0000036049137,0.00012999044,0.000084562445,0.028134199,0.00085689075,0.9454943,0.025093488,0.00001869421],"about_ca_topic_score_codex":0.0033311648,"about_ca_topic_score_gemma":0.0028491102,"teacher_disagreement_score":0.008762171,"about_ca_system_score_codex":0.0014482083,"about_ca_system_score_gemma":0.0014031209,"threshold_uncertainty_score":0.029312432},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047857594,0.00022352135,0.9358483,0.00015803926,0.000062454346,0.0001388666,0.00020702195,0.002966618,0.012537533],"genre_scores_gemma":[0.40313956,0.00043762824,0.5861925,0.00021773168,0.000056781206,0.00018151627,0.00064422376,0.00053769286,0.008592341],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99943215,0.00008712945,0.00007001409,0.00007513937,0.00026703978,0.000068464586],"domain_scores_gemma":[0.9994978,0.00014160114,0.00006471866,0.0001522994,0.0001284339,0.000015156934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004928389,0.0004288782,0.00019264843,0.00027420095,0.00020364317,0.0006250148,0.00083179295,0.00035220972,0.0023085491],"category_scores_gemma":[0.0009413424,0.0003030933,0.00040256616,0.00028452472,0.0003411659,0.00073252886,0.00037493178,0.0007377913,0.00066948857],"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.000629509,0.00015339236,0.0015924907,0.00079748855,0.00004498048,0.0008384937,0.00035069813,0.08621435,0.55665565,0.13624449,0.006591943,0.20988663],"study_design_scores_gemma":[0.00012857225,0.00083823176,0.0012741977,0.00009030526,0.00011296579,0.0014358567,0.000042378015,0.34859863,0.49387366,0.016065672,0.13747707,0.0000625039],"about_ca_topic_score_codex":0.00048353212,"about_ca_topic_score_gemma":0.0009593236,"teacher_disagreement_score":0.0023085491,"about_ca_system_score_codex":0.00044220078,"about_ca_system_score_gemma":0.0006686918,"threshold_uncertainty_score":0.0077228546},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16429093,0.0005020965,0.82016474,0.00035214625,0.00015547076,0.00021130254,0.00008244054,0.0041162376,0.010124625],"genre_scores_gemma":[0.6889911,0.00019458632,0.3005695,0.0001729878,0.00006023205,0.00021168325,0.00026039558,0.00033263836,0.0092068855],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965346,0.00004286346,0.000021671533,0.00006777397,0.00015919468,0.000055035358],"domain_scores_gemma":[0.9995135,0.000059695616,0.00007109721,0.00010948535,0.00021142712,0.00003478181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002467287,0.00039667045,0.0002122467,0.00056660833,0.0007809489,0.0005195596,0.00091645954,0.0003648851,0.0024164002],"category_scores_gemma":[0.00095310487,0.00024641416,0.00043462118,0.00067881256,0.0002516072,0.0006324349,0.00042953077,0.00054829265,0.00073963497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006808453,0.0002540208,0.0037857797,0.00025173556,0.00013038825,0.000382443,0.0005062963,0.118396014,0.4296281,0.016665317,0.010395552,0.41892353],"study_design_scores_gemma":[0.00007771546,0.0005180154,0.002340406,0.00003372438,0.000075912714,0.0003826391,0.00010527995,0.8670251,0.10265353,0.0042454232,0.022496639,0.00004567375],"about_ca_topic_score_codex":0.002839955,"about_ca_topic_score_gemma":0.006356576,"teacher_disagreement_score":0.002839955,"about_ca_system_score_codex":0.00074087403,"about_ca_system_score_gemma":0.00094391464,"threshold_uncertainty_score":0.0080836415},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1591151,0.0012402316,0.8209546,0.0006319766,0.000108279324,0.00016245988,0.00014646543,0.0038890068,0.013751756],"genre_scores_gemma":[0.71443695,0.00040421056,0.28078502,0.00030553577,0.000045559682,0.00015504472,0.00020089281,0.00033547965,0.0033312808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981064,0.000031767104,0.000010743307,0.000032039963,0.000081319755,0.000033595912],"domain_scores_gemma":[0.9996327,0.00007650069,0.000035929257,0.00017486303,0.00006143376,0.000018469558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025484746,0.00024924392,0.00033514813,0.00029299632,0.00043642527,0.00064032676,0.00094052975,0.0004109894,0.0014179439],"category_scores_gemma":[0.0010153479,0.00030192957,0.00028087592,0.00046764687,0.0004037609,0.0010359441,0.00048480195,0.0010044164,0.0004284461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002873472,0.0003383044,0.0033932368,0.0003842112,0.000116238196,0.0001958598,0.00037858967,0.33816978,0.3000535,0.06564735,0.0077222367,0.28331333],"study_design_scores_gemma":[0.0001162091,0.00064420793,0.0031461434,0.000059018188,0.000119748736,0.00022757499,0.0001259541,0.8004177,0.1169576,0.038187053,0.03994203,0.000056724224],"about_ca_topic_score_codex":0.0017842818,"about_ca_topic_score_gemma":0.0041651344,"teacher_disagreement_score":0.0017842818,"about_ca_system_score_codex":0.00048753494,"about_ca_system_score_gemma":0.0010672117,"threshold_uncertainty_score":0.004743457},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12537132,0.004383279,0.8383706,0.0014911358,0.0003463267,0.00017425166,0.00013984712,0.004322675,0.025400575],"genre_scores_gemma":[0.832643,0.0024822813,0.15442836,0.00030661275,0.00030555172,0.00013334354,0.00021707066,0.00049998914,0.008983778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995122,0.000094689225,0.00003354571,0.00006754579,0.00021120094,0.000080715545],"domain_scores_gemma":[0.99926704,0.00025579252,0.00010758976,0.00015242508,0.00017375861,0.000043420558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005869846,0.00076871034,0.0006155713,0.0006288976,0.0004932198,0.0011319951,0.0011997947,0.00041302014,0.0028579633],"category_scores_gemma":[0.0020016485,0.00024735453,0.0002490012,0.0010273155,0.0003841657,0.0015197073,0.0006215003,0.0005420659,0.0010192737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032045715,0.00043158964,0.0021095313,0.00037993636,0.000089644585,0.00012280044,0.00020710839,0.29946837,0.1241067,0.024890509,0.010065449,0.5378079],"study_design_scores_gemma":[0.00008895407,0.0002237647,0.001139556,0.000030510237,0.000079279635,0.00015123172,0.0000740381,0.89633983,0.051420663,0.027877742,0.022544106,0.000030306228],"about_ca_topic_score_codex":0.00093884027,"about_ca_topic_score_gemma":0.0017329728,"teacher_disagreement_score":0.0028579633,"about_ca_system_score_codex":0.0005408605,"about_ca_system_score_gemma":0.0009918545,"threshold_uncertainty_score":0.009560823},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04090861,0.0004206379,0.95306325,0.00014507025,0.000056565426,0.00007694666,0.000040815037,0.0013719901,0.003916187],"genre_scores_gemma":[0.32993722,0.00053564337,0.6617188,0.000094446455,0.00006401156,0.00022656549,0.00015098,0.00029440655,0.0069778836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998887,0.00016736104,0.00005664632,0.00011032738,0.0006075024,0.00017111092],"domain_scores_gemma":[0.9981744,0.00068054185,0.00013843033,0.0003826838,0.0005277663,0.00009624409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014687391,0.0005926402,0.0008438231,0.00079871813,0.0015016785,0.0019984352,0.0019898072,0.0010400192,0.0029003227],"category_scores_gemma":[0.0037570945,0.00038808776,0.0005815188,0.0013031462,0.0009904914,0.0022844982,0.0015625011,0.0012891123,0.00080681255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006687529,0.00047605534,0.002310248,0.0002496572,0.00006944528,0.00025188393,0.0006338978,0.41413224,0.02605985,0.29032934,0.00458997,0.26022863],"study_design_scores_gemma":[0.000056173627,0.00012920039,0.0003110054,0.000011654846,0.000021407226,0.00017562472,0.000080683385,0.90925956,0.013069731,0.07276818,0.0040795477,0.00003728178],"about_ca_topic_score_codex":0.0016202357,"about_ca_topic_score_gemma":0.0012578376,"teacher_disagreement_score":0.0029003227,"about_ca_system_score_codex":0.0009184456,"about_ca_system_score_gemma":0.0012018976,"threshold_uncertainty_score":0.009702563},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023794318,0.0005269933,0.95598197,0.00022119016,0.00012263992,0.00016592546,0.00022535001,0.01255349,0.006408223],"genre_scores_gemma":[0.23142898,0.0004873624,0.7558261,0.00024390846,0.00006785681,0.0002126379,0.00086391787,0.00049630576,0.010372979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996588,0.00004467434,0.000024865441,0.000051760017,0.00018291568,0.0000368759],"domain_scores_gemma":[0.99961436,0.000110167806,0.00004580283,0.0001024623,0.0001100502,0.000017165728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029716923,0.00041329977,0.00031617517,0.00067069626,0.00036494478,0.0006726015,0.0011339649,0.00037051426,0.0036594726],"category_scores_gemma":[0.00075194245,0.00025986836,0.00028489335,0.00084780407,0.00033070525,0.0010764776,0.0005138171,0.00064142555,0.0013752857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000496903,0.00012106048,0.0011951261,0.00050974835,0.00006473508,0.0004954385,0.00018051192,0.013401779,0.24674487,0.019067228,0.02066768,0.69705486],"study_design_scores_gemma":[0.00023212796,0.0007768824,0.002654262,0.000075975164,0.000111288195,0.0015467311,0.000115969,0.3476525,0.55194527,0.008155393,0.08664975,0.00008391962],"about_ca_topic_score_codex":0.0011859258,"about_ca_topic_score_gemma":0.0014148019,"teacher_disagreement_score":0.0036594726,"about_ca_system_score_codex":0.0002994316,"about_ca_system_score_gemma":0.0007689283,"threshold_uncertainty_score":0.012242198},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3807559,0.0009266827,0.56586003,0.00038095578,0.00031396621,0.00020849468,0.00019297552,0.0039203037,0.047440667],"genre_scores_gemma":[0.81756175,0.00021975485,0.1693771,0.00021283957,0.000043900698,0.0000789034,0.00021078828,0.00017339499,0.012121621],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997328,0.000040425333,0.000014951727,0.00004427225,0.00012678764,0.000040828],"domain_scores_gemma":[0.99957114,0.000052180752,0.000042344076,0.00017395758,0.00013144426,0.000028984361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023502846,0.00024877812,0.00021103492,0.00020184305,0.00020160705,0.0004114994,0.0007145396,0.00021430316,0.0033400867],"category_scores_gemma":[0.0005328229,0.00019369645,0.00016584416,0.00027877153,0.00021891356,0.00068000617,0.0005705549,0.0004835148,0.0008147156],"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.0006680094,0.00019537554,0.0031468284,0.0003359132,0.000101584585,0.0005295761,0.00016882016,0.015999986,0.52391607,0.08123689,0.014358961,0.35934183],"study_design_scores_gemma":[0.00031464387,0.0017520095,0.0046365713,0.00007290139,0.00015550769,0.0015419743,0.0001367201,0.19749397,0.6343154,0.032433145,0.1270761,0.00007110249],"about_ca_topic_score_codex":0.00029424232,"about_ca_topic_score_gemma":0.0009540398,"teacher_disagreement_score":0.0033400867,"about_ca_system_score_codex":0.00022136573,"about_ca_system_score_gemma":0.00052623724,"threshold_uncertainty_score":0.011173725},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04717236,0.00031592452,0.94057524,0.0004380626,0.000052058644,0.000112454705,0.0004943376,0.00092933024,0.009910138],"genre_scores_gemma":[0.8790018,0.00085008156,0.10266143,0.00019876788,0.00008636154,0.0004483727,0.00055097474,0.00022267208,0.015979577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944574,0.00009628573,0.000028348693,0.00010332799,0.00022131034,0.00010485963],"domain_scores_gemma":[0.9988663,0.0005680637,0.0001698717,0.00017148098,0.0001855696,0.0000386905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078129093,0.0005624978,0.00078165537,0.00060363027,0.00040103254,0.0009876267,0.0016808442,0.0009383605,0.0033755824],"category_scores_gemma":[0.00303207,0.0006385941,0.00090893515,0.00064761704,0.00059557735,0.0021316977,0.00046640393,0.0010810976,0.0008030652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018634459,0.000029364246,0.00048169782,0.00002320089,0.000014467178,0.00003376569,0.000042400407,0.9745155,0.0016878452,0.018214205,0.00040533463,0.0045335945],"study_design_scores_gemma":[0.0000030218614,0.000009538787,0.00011437285,0.0000019729407,0.0000043516884,0.000010210851,0.0000026812734,0.9954947,0.0002583848,0.003648151,0.00044938395,0.0000031885456],"about_ca_topic_score_codex":0.009374422,"about_ca_topic_score_gemma":0.0058022267,"teacher_disagreement_score":0.009374422,"about_ca_system_score_codex":0.0013804631,"about_ca_system_score_gemma":0.0015518218,"threshold_uncertainty_score":0.018639684},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32132468,0.0010251817,0.6421374,0.00047877748,0.00031065193,0.00010224916,0.0002684922,0.008077221,0.02627545],"genre_scores_gemma":[0.86341625,0.00012323406,0.1303004,0.00014872254,0.000055995213,0.00008991508,0.00013125806,0.00044017527,0.005294038],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999846,0.000021463993,0.000008225695,0.000035451376,0.00005998265,0.000028865614],"domain_scores_gemma":[0.99961436,0.000079820704,0.000037629845,0.00015270943,0.00008291005,0.0000325372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018112583,0.00052849425,0.0003593815,0.00053593225,0.00038340784,0.0005316845,0.0010371163,0.000338416,0.006731012],"category_scores_gemma":[0.0007400823,0.0002630188,0.00021040806,0.0006829564,0.0003219033,0.0011049281,0.0007766123,0.00056657696,0.0005851402],"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.002006679,0.00048590844,0.0018136444,0.0002530229,0.0001032106,0.00024249857,0.00020990524,0.10890514,0.45432058,0.058664598,0.013569657,0.35942525],"study_design_scores_gemma":[0.00014521267,0.00024006933,0.00084364944,0.000014628005,0.000033851313,0.000103471975,0.00002843827,0.8151375,0.16955167,0.0056588226,0.00820969,0.000032854496],"about_ca_topic_score_codex":0.0008146348,"about_ca_topic_score_gemma":0.0012125445,"teacher_disagreement_score":0.006731012,"about_ca_system_score_codex":0.00035130195,"about_ca_system_score_gemma":0.0004064173,"threshold_uncertainty_score":0.022517443},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024106393,0.0003087565,0.8333244,0.0001886793,0.000091126996,0.00030611045,0.0005816456,0.1348437,0.006249229],"genre_scores_gemma":[0.20780729,0.0006386213,0.7540995,0.0003911774,0.00006315752,0.0006083634,0.0032859098,0.018185372,0.0149206985],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987062,0.00026914038,0.00012858688,0.00020778982,0.00056461693,0.00012372331],"domain_scores_gemma":[0.9957967,0.0018351395,0.00035679006,0.0011273435,0.0006442637,0.00023975602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001953841,0.0011167187,0.00044159588,0.00071848015,0.00025614072,0.0008738546,0.002448676,0.0007507184,0.0052728388],"category_scores_gemma":[0.008224694,0.00069703563,0.0004389639,0.00036672747,0.00046227474,0.0025942668,0.0016308428,0.0017092817,0.0027532827],"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.00096500706,0.00038401675,0.0029214788,0.00065185106,0.00009478734,0.001092257,0.0005795892,0.03637714,0.11017584,0.016489683,0.038217813,0.7920506],"study_design_scores_gemma":[0.000558227,0.0017130598,0.0053914203,0.00028255273,0.00014994846,0.0031796005,0.00015698826,0.40675825,0.34702817,0.02307314,0.21138439,0.0003242135],"about_ca_topic_score_codex":0.00048926467,"about_ca_topic_score_gemma":0.00072804035,"teacher_disagreement_score":0.0052728388,"about_ca_system_score_codex":0.00032138661,"about_ca_system_score_gemma":0.00077255175,"threshold_uncertainty_score":0.017639399},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012228859,0.0028911193,0.09854703,0.0026745675,0.004387403,0.0005800985,0.007881333,0.03805711,0.83275247],"genre_scores_gemma":[0.07055218,0.002498476,0.04436871,0.0029252185,0.00067137345,0.00055997487,0.01584427,0.0042569167,0.85832286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992379,0.000064195076,0.000053373646,0.00015568231,0.00037542003,0.00011338223],"domain_scores_gemma":[0.99909675,0.00006790814,0.00004924622,0.00028405644,0.0004226354,0.00007942039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052033324,0.0010233675,0.00050542236,0.0013890141,0.0010914541,0.0033669453,0.0024471576,0.001806098,0.21579434],"category_scores_gemma":[0.0015172701,0.00053607376,0.00055612356,0.0010084122,0.00036327878,0.0037810311,0.0023632487,0.0016357127,0.17642583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033996982,0.00020094904,0.0014793178,0.00060394505,0.00004645744,0.0005145617,0.00026093476,0.0015878446,0.018008739,0.037056133,0.4418025,0.49809873],"study_design_scores_gemma":[0.00003108898,0.00005834151,0.00045624905,0.00006649524,0.000013431017,0.00037727304,0.00007408097,0.0033080247,0.008920494,0.0049580326,0.98171127,0.000025204059],"about_ca_topic_score_codex":0.0014854423,"about_ca_topic_score_gemma":0.0021089623,"teacher_disagreement_score":0.21579434,"about_ca_system_score_codex":0.0006349537,"about_ca_system_score_gemma":0.0011155737,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16187724,0.00030077435,0.8070767,0.0007100682,0.00008366225,0.0001464851,0.00011132739,0.00028597988,0.029407846],"genre_scores_gemma":[0.7933112,0.00057633396,0.19872281,0.00012824721,0.000042366122,0.0002773608,0.0001402542,0.00015468063,0.0066467756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994848,0.00015440819,0.00002063513,0.00003585925,0.00024948458,0.00005481552],"domain_scores_gemma":[0.99832016,0.0011042694,0.00015818786,0.00011543158,0.00025294823,0.000049030685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000911967,0.0003204354,0.0003889813,0.0002637757,0.00043127697,0.0008976289,0.0011907206,0.00044691353,0.0030481059],"category_scores_gemma":[0.0028776831,0.00023190919,0.00046606065,0.00027417796,0.00062860665,0.0015650399,0.00041737687,0.0012170996,0.00026482777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006628363,0.00007090866,0.0007478467,0.0001367837,0.000012945979,0.00010466157,0.000111734385,0.8183939,0.0034154141,0.16365032,0.0008673833,0.012421867],"study_design_scores_gemma":[0.000010985052,0.000031515632,0.00008230166,0.000007945529,0.000003378876,0.000032334963,0.00003349183,0.98538107,0.0010136673,0.012717747,0.0006824613,0.0000030525075],"about_ca_topic_score_codex":0.0014898507,"about_ca_topic_score_gemma":0.0020878352,"teacher_disagreement_score":0.0030481059,"about_ca_system_score_codex":0.0007159154,"about_ca_system_score_gemma":0.0011082481,"threshold_uncertainty_score":0.010196865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03380383,0.00012194996,0.961667,0.00018310559,0.00002506104,0.000075698794,0.00007716157,0.0007502222,0.003295962],"genre_scores_gemma":[0.5671341,0.00025498783,0.42938587,0.000080225145,0.00004286614,0.00017062238,0.00016934624,0.00024048846,0.0025214632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988883,0.0002212287,0.000045610126,0.000071739196,0.0006674523,0.000105753024],"domain_scores_gemma":[0.99861693,0.0006568319,0.00013810737,0.0003097823,0.00025865564,0.000019683666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083641347,0.0006104015,0.00047193922,0.00096979825,0.00038287,0.00081847387,0.00064653164,0.00036049294,0.0015578215],"category_scores_gemma":[0.0024727385,0.000301595,0.0007754564,0.00076896383,0.00067805796,0.001131833,0.0006294565,0.00067135296,0.00027378404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023118476,0.00010959623,0.0017139076,0.00027053806,0.00007533437,0.00039943465,0.000104438026,0.5127247,0.050645795,0.22107972,0.0031879544,0.20945735],"study_design_scores_gemma":[0.0000149217,0.00008367032,0.0003261623,0.000011796475,0.000035336932,0.00015128487,0.000013297329,0.9278542,0.023799479,0.04460027,0.0030928748,0.000016760256],"about_ca_topic_score_codex":0.0007752743,"about_ca_topic_score_gemma":0.00082765316,"teacher_disagreement_score":0.0015578215,"about_ca_system_score_codex":0.0006152174,"about_ca_system_score_gemma":0.0011895836,"threshold_uncertainty_score":0.0052114725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014996856,0.00016539625,0.96389914,0.000031312025,0.00006144264,0.00009727688,0.00027893123,0.028767386,0.0051994435],"genre_scores_gemma":[0.045001447,0.00044263093,0.9321419,0.00016470697,0.00003734576,0.0005964515,0.00206089,0.008641591,0.01091301],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989048,0.00017413813,0.00010001037,0.00012795243,0.0006053523,0.00008766994],"domain_scores_gemma":[0.99872774,0.00065514835,0.0000767983,0.000260047,0.00022852948,0.00005173963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010893112,0.001121459,0.0006423325,0.001311509,0.00045719714,0.0011856586,0.0017294094,0.0006919819,0.020684866],"category_scores_gemma":[0.0031090453,0.0011435171,0.0008173629,0.0009182846,0.0003772966,0.0014101967,0.0011193611,0.0016546902,0.006328199],"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.00046696537,0.00014651766,0.0008423842,0.0011006739,0.0001117562,0.001426813,0.0005489853,0.034393735,0.12476411,0.057294637,0.06828292,0.7106205],"study_design_scores_gemma":[0.00037997062,0.00044213387,0.0013433392,0.0002830901,0.00012669015,0.0038636806,0.00007950243,0.22604579,0.17452016,0.022193905,0.5704528,0.00026898485],"about_ca_topic_score_codex":0.0006734232,"about_ca_topic_score_gemma":0.00094205793,"teacher_disagreement_score":0.020684866,"about_ca_system_score_codex":0.0003468255,"about_ca_system_score_gemma":0.0005924987,"threshold_uncertainty_score":0.069197774},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7018247,0.0026109852,0.24335094,0.0009846414,0.00020962006,0.00018736787,0.0009097464,0.011003797,0.038918216],"genre_scores_gemma":[0.89689386,0.00078611105,0.095926754,0.00009182872,0.000040832543,0.00014074102,0.0013736705,0.00085265934,0.0038934383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99935585,0.00024281321,0.00004328913,0.00008003748,0.00018056843,0.00009742357],"domain_scores_gemma":[0.99511343,0.002990335,0.00018409929,0.0004003531,0.0011673413,0.00014455647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010080857,0.0008444972,0.0008124475,0.0008347036,0.00061275606,0.0010219851,0.0009948389,0.00096280075,0.0055675455],"category_scores_gemma":[0.005311671,0.00036879876,0.00055107,0.0013422219,0.00043511743,0.001206114,0.00053633057,0.00060826633,0.0009982716],"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.0021917769,0.00046773828,0.0072185313,0.0007242659,0.00032974686,0.00032095454,0.0003838324,0.8163362,0.032166734,0.008041627,0.006680588,0.12513803],"study_design_scores_gemma":[0.000081861705,0.00020160085,0.0008664194,0.000016288863,0.00004247577,0.000044370718,0.000074979376,0.98190606,0.014399645,0.0011896152,0.0011597367,0.000016988113],"about_ca_topic_score_codex":0.006143741,"about_ca_topic_score_gemma":0.0054651136,"teacher_disagreement_score":0.006143741,"about_ca_system_score_codex":0.0006509102,"about_ca_system_score_gemma":0.0013632482,"threshold_uncertainty_score":0.018625319},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9499675,0.0018141298,0.04384319,0.00016353604,0.0000093636345,0.0000272591,0.00011283981,0.00013471532,0.003927458],"genre_scores_gemma":[0.9894058,0.00048483055,0.009142194,0.000027299755,0.0000078627345,0.000020500656,0.00013356486,0.00004012027,0.00073775946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996917,0.000056398872,0.000010986139,0.000035361638,0.00014948711,0.000056189707],"domain_scores_gemma":[0.9984585,0.0010726006,0.0001624269,0.00008317598,0.00020114014,0.000022116565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036272578,0.00040233793,0.00038070334,0.00072930177,0.00030012723,0.0005503912,0.0007482925,0.0005157037,0.0011376527],"category_scores_gemma":[0.0039113145,0.00023087779,0.00023032086,0.001334401,0.00029957094,0.0018165999,0.000341063,0.00031570287,0.00021028171],"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.0006153116,0.00016479663,0.020409044,0.00035544072,0.00010944936,0.00034040853,0.00015056794,0.8492978,0.061726604,0.00808328,0.00074134266,0.05800591],"study_design_scores_gemma":[0.000033845874,0.0003931854,0.009313982,0.000026560005,0.000050311075,0.00018185849,0.000114937386,0.9184117,0.06337283,0.006022148,0.0020485204,0.00003006335],"about_ca_topic_score_codex":0.0020147199,"about_ca_topic_score_gemma":0.0024056984,"teacher_disagreement_score":0.0020147199,"about_ca_system_score_codex":0.00067348825,"about_ca_system_score_gemma":0.0003291932,"threshold_uncertainty_score":0.004886508},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051439885,0.00010717899,0.99735427,0.00008393975,0.000016923039,0.00026658017,0.000034843113,0.00025261313,0.0013693598],"genre_scores_gemma":[0.007488433,0.0001841001,0.9909122,0.000056184323,0.000018515982,0.00057381456,0.00009454979,0.000092529786,0.00057975797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918719,0.0030894827,0.0007292587,0.0007703866,0.0031665927,0.00037226433],"domain_scores_gemma":[0.99305505,0.0027140416,0.00051688915,0.00143671,0.002091705,0.00018563555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008820038,0.00227518,0.001382224,0.0028410247,0.0015949195,0.0046789083,0.003507803,0.0014521691,0.004839063],"category_scores_gemma":[0.015525606,0.0014028536,0.0025288514,0.0028111516,0.0042170915,0.0033114548,0.0026663064,0.0037735219,0.0019747515],"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.000053692223,0.00015054221,0.0006075542,0.0010968398,0.0001362749,0.0002831329,0.00054727565,0.08430246,0.007290272,0.75393796,0.0057492326,0.14584477],"study_design_scores_gemma":[0.000113642884,0.00025184083,0.0003146085,0.00083887886,0.00013227134,0.0005625379,0.00023545825,0.27920908,0.012061684,0.5999822,0.10620187,0.00009600533],"about_ca_topic_score_codex":0.0025315399,"about_ca_topic_score_gemma":0.003382894,"teacher_disagreement_score":0.008820038,"about_ca_system_score_codex":0.0023411377,"about_ca_system_score_gemma":0.0064531723,"threshold_uncertainty_score":0.046645403},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15364364,0.00086428924,0.803204,0.00032963624,0.00038795552,0.00016620137,0.0011621645,0.009295557,0.03094654],"genre_scores_gemma":[0.5300211,0.00073978794,0.45376673,0.00019700416,0.00004916584,0.0003286758,0.0019213872,0.00057751633,0.012398699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998355,0.000037769732,0.000007983041,0.000016079577,0.00008199555,0.000020662048],"domain_scores_gemma":[0.9997002,0.00011886605,0.00001710631,0.000060181366,0.000078934565,0.000024689221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022912081,0.0002287046,0.00027877762,0.00024047935,0.0002095142,0.00032265054,0.0011443595,0.00030366195,0.004236555],"category_scores_gemma":[0.00067473756,0.00020911265,0.00029569987,0.0002691392,0.00020494044,0.0005122288,0.00040293572,0.000794127,0.0006746996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042856982,0.00014566982,0.0031080954,0.00027026387,0.0001037141,0.00019073777,0.00017856726,0.77644217,0.05155841,0.06260854,0.012487155,0.092478104],"study_design_scores_gemma":[0.00003649463,0.000110461195,0.00035182651,0.000009860108,0.000023317703,0.00005014214,0.000011829308,0.9567511,0.013305282,0.003394423,0.025944302,0.00001093375],"about_ca_topic_score_codex":0.0013895484,"about_ca_topic_score_gemma":0.0016655886,"teacher_disagreement_score":0.004236555,"about_ca_system_score_codex":0.0003974288,"about_ca_system_score_gemma":0.0007893502,"threshold_uncertainty_score":0.014172673},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008951224,0.00010663734,0.98841697,0.00012833693,0.000016899274,0.000031740063,0.000075385986,0.0014951425,0.0007776228],"genre_scores_gemma":[0.34564844,0.00029229457,0.65069646,0.00015803894,0.000108559136,0.00020581266,0.00026678573,0.0005159362,0.0021077546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983569,0.0003567001,0.000083141815,0.00024838754,0.00085366576,0.00010118826],"domain_scores_gemma":[0.9957503,0.002192309,0.00042222405,0.00088587037,0.0006888669,0.000060457707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016074827,0.0009140557,0.00075955765,0.0024009163,0.0012258325,0.0014060624,0.0016085368,0.0008802644,0.0023925605],"category_scores_gemma":[0.012162743,0.0008367642,0.0009754778,0.0018453923,0.001132623,0.003226742,0.0014589375,0.0016273863,0.0007211005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002555056,0.000095840325,0.005200693,0.00014563484,0.0000779603,0.00012661715,0.00018935539,0.4364944,0.018626232,0.23623636,0.0046654404,0.297886],"study_design_scores_gemma":[0.0000070806827,0.00002349912,0.00026696912,0.000009957396,0.0000175072,0.000032071403,0.000006563861,0.95037407,0.0031497148,0.044584557,0.0015101015,0.000017856826],"about_ca_topic_score_codex":0.003261752,"about_ca_topic_score_gemma":0.003207108,"teacher_disagreement_score":0.003261752,"about_ca_system_score_codex":0.0011221905,"about_ca_system_score_gemma":0.0031594275,"threshold_uncertainty_score":0.008501232},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005786684,0.0006019986,0.9824707,0.00056996674,0.0003239283,0.00010393308,0.00008024795,0.0042158524,0.005846735],"genre_scores_gemma":[0.09659595,0.0015957722,0.8831712,0.0010545027,0.0009196243,0.0008925144,0.00052101555,0.0017951849,0.013454203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967913,0.0011818316,0.00025098238,0.00044402218,0.0009812658,0.0003505681],"domain_scores_gemma":[0.99691963,0.0010304968,0.00027054688,0.0011227544,0.0005091506,0.00014745237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037776846,0.0011124993,0.0012423777,0.00075447536,0.001643734,0.003283275,0.002390282,0.002234052,0.0038331172],"category_scores_gemma":[0.006046129,0.00095549796,0.0014942134,0.0013240328,0.002616363,0.0072344546,0.0040574893,0.0041620205,0.0026621353],"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.00019806511,0.000049784565,0.0004418598,0.00029899325,0.0000542862,0.00033446398,0.0009841277,0.015686436,0.0055981926,0.90781987,0.012654614,0.055879224],"study_design_scores_gemma":[0.00016136086,0.00012921025,0.00021814412,0.00018720847,0.00017474263,0.00037678285,0.0001580619,0.13915037,0.01453341,0.51821244,0.32655814,0.00014015572],"about_ca_topic_score_codex":0.001099253,"about_ca_topic_score_gemma":0.0013154666,"teacher_disagreement_score":0.0038331172,"about_ca_system_score_codex":0.00070921,"about_ca_system_score_gemma":0.001746461,"threshold_uncertainty_score":0.019978523},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020624506,0.00011679498,0.6754382,0.00014046079,0.0001243001,0.0004179146,0.0040494124,0.3099572,0.0076931715],"genre_scores_gemma":[0.025111232,0.00035667067,0.82813555,0.00053189555,0.000114563125,0.0024578564,0.022100223,0.10712046,0.014071557],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99781066,0.00026962886,0.00020413088,0.00038788526,0.0010713262,0.00025632014],"domain_scores_gemma":[0.9957318,0.0016508707,0.00040713052,0.0008835476,0.0010585218,0.00026804136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027524277,0.0029891373,0.0013271378,0.0027053042,0.0013255273,0.002125304,0.005432737,0.001503978,0.026397044],"category_scores_gemma":[0.009484862,0.0024714507,0.002153497,0.002144946,0.0012379056,0.0030400686,0.0027988476,0.0042419517,0.021437805],"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.0012612595,0.00031409395,0.0022406229,0.0014561432,0.00024790072,0.0007965982,0.00064316735,0.028013805,0.03092288,0.042875696,0.48656994,0.40465793],"study_design_scores_gemma":[0.0007716493,0.00018495113,0.0022729046,0.00032211613,0.00012837948,0.0012288992,0.00006139904,0.22040765,0.10701951,0.031509783,0.635595,0.00049775926],"about_ca_topic_score_codex":0.006011004,"about_ca_topic_score_gemma":0.0046052574,"teacher_disagreement_score":0.026397044,"about_ca_system_score_codex":0.0014526885,"about_ca_system_score_gemma":0.0033375905,"threshold_uncertainty_score":0.088306904},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034379784,0.0019095546,0.9123549,0.010766355,0.0003225799,0.000087168235,0.000043025993,0.0005442142,0.03959234],"genre_scores_gemma":[0.6656245,0.0026882722,0.31630436,0.0013164051,0.00047804788,0.0003650663,0.00007639292,0.00036827393,0.012778668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842155,0.0003958391,0.00006400288,0.00019008388,0.0008233238,0.00010524995],"domain_scores_gemma":[0.9927906,0.0045766653,0.00038515998,0.0011893443,0.00080075586,0.00025749157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019062706,0.0003803627,0.00043253665,0.00034609684,0.00095490954,0.001956205,0.0010342052,0.0012782558,0.003214754],"category_scores_gemma":[0.007876655,0.0005125912,0.0006535583,0.00043033264,0.0035529633,0.004167178,0.0013195726,0.003435215,0.0008133464],"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.000007129344,0.000026874524,0.00017224079,0.00007478513,0.000010273394,0.00005839539,0.00014029743,0.018800821,0.0018259014,0.9653186,0.0014627774,0.012101843],"study_design_scores_gemma":[0.0000106099615,0.000019753326,0.00009497082,0.000019021007,0.0000050494323,0.00005547809,0.000042643635,0.060976755,0.0010930891,0.92217237,0.015502502,0.000007753284],"about_ca_topic_score_codex":0.00082036934,"about_ca_topic_score_gemma":0.0008336985,"teacher_disagreement_score":0.003214754,"about_ca_system_score_codex":0.0008627886,"about_ca_system_score_gemma":0.0016564013,"threshold_uncertainty_score":0.010754406},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17342906,0.0010467801,0.81680375,0.0002027555,0.00011766931,0.00013393961,0.000082719984,0.0041969954,0.003986269],"genre_scores_gemma":[0.58905303,0.00017728144,0.40771878,0.00008137191,0.000032737866,0.00011016791,0.00018738137,0.000166928,0.0024723033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997892,0.000033944165,0.000013367655,0.000046740268,0.00006555344,0.000051296312],"domain_scores_gemma":[0.9997551,0.000083485815,0.000032955908,0.000021170312,0.00008560234,0.000021734259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003828981,0.0008502955,0.00074838195,0.00082633714,0.0004885987,0.00045275502,0.00083728303,0.00044793755,0.0025494301],"category_scores_gemma":[0.0008220828,0.0002753668,0.0003314473,0.0005021751,0.000263075,0.00047621256,0.00037440174,0.00034986777,0.00036125825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006026188,0.00018150473,0.0028397979,0.00023068453,0.000052621053,0.00017487955,0.00011193614,0.53165644,0.048062995,0.00390627,0.0042603957,0.40791988],"study_design_scores_gemma":[0.000020252239,0.00007148217,0.00022791287,0.0000041810595,0.0000067314495,0.000014525738,0.000006612221,0.99576616,0.003169819,0.00028926795,0.00041961472,0.0000035767205],"about_ca_topic_score_codex":0.0057453876,"about_ca_topic_score_gemma":0.00650671,"teacher_disagreement_score":0.0057453876,"about_ca_system_score_codex":0.0008182127,"about_ca_system_score_gemma":0.0015113113,"threshold_uncertainty_score":0.011423886},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40614393,0.001201637,0.54055345,0.00048787374,0.00019602926,0.0009185376,0.00016685376,0.041266162,0.009065571],"genre_scores_gemma":[0.77492243,0.00019231142,0.22009024,0.00017926678,0.00003302361,0.00018093297,0.00016448218,0.0010514713,0.0031859302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826777,0.00050749566,0.00012789534,0.00023687576,0.00062471005,0.00023510118],"domain_scores_gemma":[0.9956548,0.0012796613,0.0004474918,0.0013799028,0.000996839,0.00024127206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021825803,0.00073614507,0.00056886155,0.0005666205,0.000380595,0.0011155513,0.0036896563,0.00070727116,0.0018402113],"category_scores_gemma":[0.0061484594,0.0006544443,0.0003440167,0.00036992395,0.00065227144,0.0013208437,0.00055948214,0.000802566,0.00046446756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003298902,0.0013748474,0.015303798,0.0010818287,0.00027215216,0.0008216043,0.0009873665,0.119151786,0.22937267,0.016592959,0.008062576,0.6036795],"study_design_scores_gemma":[0.00061444344,0.002411274,0.005027607,0.000049328497,0.00024814965,0.00039947647,0.00010220693,0.7592638,0.21339022,0.0017875875,0.01662527,0.000080636804],"about_ca_topic_score_codex":0.0035279316,"about_ca_topic_score_gemma":0.0026697754,"teacher_disagreement_score":0.0036896563,"about_ca_system_score_codex":0.0007705854,"about_ca_system_score_gemma":0.0018826642,"threshold_uncertainty_score":0.011542678},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029614973,0.00018782335,0.9940041,0.00019017351,0.000038819315,0.0001009764,0.000055071287,0.0002064428,0.002255198],"genre_scores_gemma":[0.10615537,0.00079430686,0.8885875,0.00015226842,0.000075154814,0.000277703,0.00023210546,0.00016425154,0.0035613917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991254,0.00032860498,0.000039921448,0.00015726617,0.00026904393,0.000079748424],"domain_scores_gemma":[0.998995,0.0004932788,0.000111334164,0.00017392747,0.00017973353,0.00004673103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008486248,0.0012438223,0.0011144796,0.0017079496,0.0014148073,0.0019125391,0.0022904626,0.0011200316,0.003511597],"category_scores_gemma":[0.0030622985,0.001092098,0.0014099167,0.0028325685,0.0016056868,0.0021107702,0.0012532049,0.0016823619,0.00092142966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005654481,0.000118863325,0.00041801724,0.00036142993,0.00006986215,0.00019520138,0.0002312353,0.70128375,0.005203393,0.20567508,0.004846357,0.08154034],"study_design_scores_gemma":[0.00002640587,0.00008234387,0.00014295314,0.000035674027,0.00003135105,0.00014059908,0.000077053766,0.8366215,0.0021257594,0.15311278,0.007573932,0.000029674538],"about_ca_topic_score_codex":0.005584984,"about_ca_topic_score_gemma":0.009939839,"teacher_disagreement_score":0.005584984,"about_ca_system_score_codex":0.002469755,"about_ca_system_score_gemma":0.0031673184,"threshold_uncertainty_score":0.017919362},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024723224,0.0011562727,0.9557728,0.00024712156,0.0002268258,0.00013695146,0.00007861994,0.0018836083,0.015774604],"genre_scores_gemma":[0.17508484,0.00119088,0.80303156,0.00024056906,0.000104136154,0.00013752832,0.00021632342,0.00020517685,0.019788988],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999018,0.000011083783,0.00000663753,0.00001555744,0.000050371218,0.000014494478],"domain_scores_gemma":[0.9999119,0.000025812518,0.000008268158,0.000011515199,0.00003512977,0.0000073464366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018259908,0.00039562533,0.0002403936,0.0006508401,0.00036494614,0.0003878427,0.0006023085,0.0006215563,0.0037657195],"category_scores_gemma":[0.0002585149,0.00032318343,0.0002477187,0.00037868103,0.00024317905,0.00083722797,0.00031299665,0.00056911324,0.0020406293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023547909,0.00013853112,0.0005403032,0.0003854625,0.00006252227,0.0007094255,0.00020474005,0.017588513,0.5387137,0.052335106,0.008719137,0.38036704],"study_design_scores_gemma":[0.000063452295,0.00047454148,0.00072279456,0.000040381652,0.000076639386,0.0020977615,0.000038755297,0.21722877,0.6550835,0.010957157,0.1131374,0.00007883042],"about_ca_topic_score_codex":0.00041537613,"about_ca_topic_score_gemma":0.001068373,"teacher_disagreement_score":0.0037657195,"about_ca_system_score_codex":0.00032764333,"about_ca_system_score_gemma":0.00024141686,"threshold_uncertainty_score":0.0125976205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01773496,0.0024618346,0.95333475,0.00076615845,0.00026418376,0.00044569728,0.0017789763,0.004026469,0.019186934],"genre_scores_gemma":[0.2099748,0.0017223808,0.77525073,0.00028228725,0.00022078474,0.0021943217,0.0036254495,0.0015832246,0.0051461486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99164295,0.0018133054,0.0012342741,0.0008727118,0.004123167,0.00031361612],"domain_scores_gemma":[0.98866165,0.0038666283,0.0023397733,0.0018031911,0.0029703153,0.00035835488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004409565,0.0013743169,0.00076162623,0.0057609784,0.0010609961,0.0035374674,0.0012103089,0.0009799363,0.0028148768],"category_scores_gemma":[0.035587955,0.0004908111,0.0008484801,0.0065049413,0.0013979531,0.004829451,0.002864552,0.0017335677,0.0010372768],"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.000101005484,0.00011888387,0.0058606444,0.0006781165,0.000075516036,0.00012974122,0.00071138074,0.056492437,0.011142275,0.578131,0.015711693,0.3308472],"study_design_scores_gemma":[0.00003489221,0.00046088366,0.008683797,0.0003558211,0.0000638372,0.0005654369,0.00037168482,0.2203297,0.009700667,0.55826026,0.20099917,0.00017389478],"about_ca_topic_score_codex":0.0037162972,"about_ca_topic_score_gemma":0.0031196848,"teacher_disagreement_score":0.0057609784,"about_ca_system_score_codex":0.0022450641,"about_ca_system_score_gemma":0.0017423839,"threshold_uncertainty_score":0.023320317},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16438796,0.017329404,0.10848838,0.018970484,0.0015775149,0.00006226321,0.00012779942,0.0004800307,0.68857604],"genre_scores_gemma":[0.9388746,0.0032326886,0.011403039,0.00071445317,0.0003382184,0.000036029454,0.000035502544,0.000066644265,0.04529887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994849,0.00019748678,0.000016628588,0.000089098685,0.0001484053,0.00006333209],"domain_scores_gemma":[0.9986051,0.00058079284,0.00013491037,0.0003999148,0.0001095626,0.00016985902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005401235,0.0003221618,0.0002662869,0.0004899937,0.0018314369,0.0058945245,0.00075772137,0.0013188124,0.021827366],"category_scores_gemma":[0.003915203,0.00024289382,0.00017014102,0.00078512856,0.0040647793,0.008908049,0.0029196523,0.0015555293,0.0020545255],"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.000083020255,0.00007110451,0.0019422362,0.00015748227,0.000022048122,0.0003219653,0.0061654835,0.0008396932,0.0019823725,0.880724,0.008071855,0.09961883],"study_design_scores_gemma":[0.000027400667,0.00008323594,0.0016969906,0.00021422726,0.000034692803,0.00083675946,0.0040321033,0.0030639004,0.0023583358,0.8174864,0.17013225,0.000033798256],"about_ca_topic_score_codex":0.000552727,"about_ca_topic_score_gemma":0.00074376166,"teacher_disagreement_score":0.021827366,"about_ca_system_score_codex":0.0005242262,"about_ca_system_score_gemma":0.0004964645,"threshold_uncertainty_score":0.0730198},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010188686,0.00010073813,0.98017913,0.00029072582,0.00023665346,0.00016697242,0.0011704665,0.008467967,0.008368486],"genre_scores_gemma":[0.094702795,0.00048465712,0.870477,0.00043387205,0.0004802833,0.0013003035,0.0047897603,0.0063799676,0.020951236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99786913,0.00061900297,0.00040103667,0.0003852137,0.000525734,0.0001998651],"domain_scores_gemma":[0.9968406,0.0013283077,0.00026701574,0.00079914345,0.0006269938,0.00013793574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029368082,0.0016634555,0.0011561909,0.0014681842,0.001366859,0.0044873278,0.002902436,0.0019703985,0.038374033],"category_scores_gemma":[0.0057022567,0.0010213781,0.00181471,0.0016960261,0.002316015,0.004696123,0.002467537,0.0030847169,0.0133770825],"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.0003573439,0.000088517,0.00023259818,0.00051582,0.000034444056,0.00039903808,0.0007818421,0.008188772,0.0055157077,0.88716125,0.03192907,0.0647957],"study_design_scores_gemma":[0.0001799794,0.00017062419,0.00018235805,0.000375551,0.0000947415,0.0005791734,0.00021410112,0.11608733,0.017376304,0.4203006,0.44428477,0.00015451037],"about_ca_topic_score_codex":0.0017791511,"about_ca_topic_score_gemma":0.0023624091,"teacher_disagreement_score":0.038374033,"about_ca_system_score_codex":0.0012278161,"about_ca_system_score_gemma":0.0014243793,"threshold_uncertainty_score":0.12837392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19315912,0.00033486198,0.7970011,0.0004508433,0.00009078543,0.00011710542,0.0004292995,0.00236879,0.0060481504],"genre_scores_gemma":[0.84660727,0.00034596046,0.14813398,0.00014471803,0.00008002492,0.0002075338,0.0004785459,0.0005057926,0.0034961735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909365,0.00024446403,0.00005703781,0.00012655019,0.0002870374,0.00019131429],"domain_scores_gemma":[0.9973634,0.0016332002,0.00025749367,0.00047863432,0.000178498,0.00008881516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012349437,0.0006825868,0.00035975996,0.0006420479,0.0006101421,0.0013295595,0.0010014639,0.0006416671,0.0016046515],"category_scores_gemma":[0.0043393914,0.0004434401,0.00054690195,0.00064752414,0.0013091804,0.002692129,0.0013053388,0.00125646,0.0002601584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042807547,0.00016592057,0.0021547691,0.00017278912,0.00003468038,0.00036095126,0.00056075584,0.74912274,0.014252884,0.1771083,0.0024896127,0.05314861],"study_design_scores_gemma":[0.00003685968,0.00004944271,0.00036816907,0.000019050087,0.000028714398,0.00003287714,0.00006309964,0.8476746,0.007485265,0.1399951,0.0042317365,0.000015103772],"about_ca_topic_score_codex":0.0057440395,"about_ca_topic_score_gemma":0.013341923,"teacher_disagreement_score":0.0057440395,"about_ca_system_score_codex":0.0008880004,"about_ca_system_score_gemma":0.0013650046,"threshold_uncertainty_score":0.011421204},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024246871,0.0012576914,0.476948,0.0013244529,0.0012742735,0.00039592537,0.007592066,0.29093653,0.19602418],"genre_scores_gemma":[0.34983838,0.0011213878,0.36011878,0.0016938813,0.00046475884,0.0008252689,0.02273235,0.03705409,0.22615129],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925953,0.00011844044,0.00004059159,0.00015199759,0.00033964482,0.000089776826],"domain_scores_gemma":[0.9988464,0.00022660417,0.00007105077,0.000416965,0.0003347281,0.00010420199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000749689,0.00078538747,0.00058093795,0.0007419579,0.00067394093,0.0017011353,0.0017277935,0.0008577976,0.07646834],"category_scores_gemma":[0.0023719685,0.00049894257,0.00065353303,0.00049861835,0.000472062,0.0015134657,0.0015804328,0.0013563462,0.034956403],"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.0015404411,0.00025976854,0.0025154925,0.0007986469,0.000102807346,0.0003800581,0.00027061184,0.02612696,0.031800605,0.048454292,0.3383127,0.5494376],"study_design_scores_gemma":[0.00029992365,0.00023358388,0.0012704097,0.000082953884,0.000037126596,0.0004703886,0.00004575503,0.18875758,0.044497173,0.026047343,0.7381845,0.00007312721],"about_ca_topic_score_codex":0.0019541895,"about_ca_topic_score_gemma":0.0020773623,"teacher_disagreement_score":0.07646834,"about_ca_system_score_codex":0.00076490734,"about_ca_system_score_gemma":0.0011328263,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27550825,0.00021423456,0.7196369,0.000064532185,0.00007123851,0.00012390244,0.000022001288,0.0019063186,0.0024526452],"genre_scores_gemma":[0.8520965,0.00006498997,0.14630367,0.00001867471,0.000013253306,0.00012676694,0.00004794281,0.00013990025,0.0011883834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872607,0.0004627284,0.000087228465,0.00022954325,0.00031095225,0.00018343015],"domain_scores_gemma":[0.99779946,0.00078270375,0.00023976878,0.00061282894,0.00038960314,0.00017569399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011551578,0.00050067436,0.00063963654,0.00032789737,0.00047144212,0.0011240414,0.001361811,0.00045330907,0.0008336854],"category_scores_gemma":[0.0026429622,0.0005253201,0.00052536343,0.000341723,0.00086277345,0.0011245458,0.00079004397,0.00078374235,0.00021428723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025317746,0.00070663553,0.008453111,0.00028805857,0.00023524638,0.0006877871,0.00062093465,0.70786864,0.16721366,0.032460373,0.0016118189,0.07732193],"study_design_scores_gemma":[0.000114932,0.0002616967,0.00059750915,0.000009958091,0.00004117073,0.000104998064,0.000021672286,0.94547004,0.047578573,0.0032412128,0.0025391586,0.000019112926],"about_ca_topic_score_codex":0.000903399,"about_ca_topic_score_gemma":0.00081539707,"teacher_disagreement_score":0.001361811,"about_ca_system_score_codex":0.0006354416,"about_ca_system_score_gemma":0.00093815353,"threshold_uncertainty_score":0.0061091185},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8383106,0.0006448553,0.09939858,0.0022407484,0.0011612384,0.00053042505,0.0017471166,0.0017946701,0.05417177],"genre_scores_gemma":[0.9639849,0.00015235538,0.025852041,0.000670186,0.00015294556,0.0004218977,0.0005163277,0.00018152311,0.008067755],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826294,0.00048244226,0.00010442425,0.00046987535,0.0004909022,0.00018946553],"domain_scores_gemma":[0.9857578,0.008328658,0.0008936346,0.002855159,0.0011058502,0.0010587196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002921371,0.00026951154,0.00042366277,0.00035457476,0.000809216,0.0010104009,0.0013285037,0.001217767,0.012151107],"category_scores_gemma":[0.012302854,0.0002904526,0.00024643532,0.0005135816,0.0007905143,0.0024086311,0.0012153636,0.0018507827,0.0013113162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.016097387,0.009258162,0.01871295,0.0009254602,0.00028382253,0.0013967392,0.0026224612,0.017050229,0.4323242,0.32993138,0.02467909,0.14671807],"study_design_scores_gemma":[0.00442224,0.015657395,0.02133612,0.0001370519,0.00033136227,0.0019300063,0.0012147854,0.16075905,0.40142995,0.2598516,0.1325798,0.00035065715],"about_ca_topic_score_codex":0.00029020678,"about_ca_topic_score_gemma":0.00025253106,"teacher_disagreement_score":0.012151107,"about_ca_system_score_codex":0.00042992792,"about_ca_system_score_gemma":0.00052646553,"threshold_uncertainty_score":0.040649474},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09732445,0.0042100856,0.8601104,0.0006204729,0.00034638288,0.00022724012,0.00014253508,0.0022641262,0.034754317],"genre_scores_gemma":[0.4776138,0.0025354002,0.50726944,0.00017775295,0.000108792585,0.00012530587,0.00027602213,0.000106488,0.011786925],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997832,0.000049838804,0.000010389115,0.000019968942,0.00011846037,0.000018203425],"domain_scores_gemma":[0.99979156,0.00008246277,0.000024244242,0.000046514215,0.000044417757,0.0000107915075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022315687,0.0003011663,0.00021476833,0.0002347586,0.00018233323,0.00036539906,0.00030887502,0.0002596044,0.005737154],"category_scores_gemma":[0.000608115,0.0001297665,0.00014791601,0.0003825161,0.00025931842,0.0005118135,0.00019666979,0.0005855081,0.00078668445],"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.0005593401,0.00016714528,0.0009644371,0.00043157168,0.00006455003,0.00048412944,0.0001122033,0.05159791,0.30417788,0.09973708,0.010064139,0.5316395],"study_design_scores_gemma":[0.00033504455,0.0016748753,0.0030650285,0.00011312915,0.000120693934,0.001952293,0.00007014601,0.39613336,0.4027775,0.031127922,0.16254504,0.000084864296],"about_ca_topic_score_codex":0.00032982143,"about_ca_topic_score_gemma":0.0006500556,"teacher_disagreement_score":0.005737154,"about_ca_system_score_codex":0.00027911618,"about_ca_system_score_gemma":0.00027079988,"threshold_uncertainty_score":0.019192696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052800295,0.000228397,0.9893087,0.00006901081,0.000058328078,0.000053193176,0.000052798052,0.0008959941,0.004053452],"genre_scores_gemma":[0.27896357,0.00079484686,0.7104671,0.00017802605,0.00006658554,0.00018127846,0.00018446152,0.00015519564,0.009008912],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993082,0.00007927924,0.00003421468,0.00014499856,0.000382259,0.000051037223],"domain_scores_gemma":[0.9992654,0.0002513976,0.0000817836,0.00017398382,0.00020719694,0.000020282956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068131625,0.00045560894,0.00030098745,0.00035908274,0.0004434285,0.0007200039,0.0010518198,0.0005615638,0.0053836205],"category_scores_gemma":[0.002154041,0.00038213082,0.00042404782,0.00031969027,0.00060213916,0.0011439987,0.00042840827,0.00078021275,0.0010369725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054844405,0.00008896554,0.00094999076,0.00050143973,0.00009554172,0.00022839734,0.00023119852,0.13110496,0.23838271,0.22534096,0.004967379,0.39756],"study_design_scores_gemma":[0.00014419369,0.0003932804,0.0005311193,0.00008705664,0.00009063048,0.0003115986,0.000029088491,0.70989764,0.16233967,0.042503316,0.08361092,0.00006142737],"about_ca_topic_score_codex":0.0016351372,"about_ca_topic_score_gemma":0.0022876835,"teacher_disagreement_score":0.0053836205,"about_ca_system_score_codex":0.0009073301,"about_ca_system_score_gemma":0.0010604196,"threshold_uncertainty_score":0.01800996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112158865,0.00015945875,0.8510424,0.00017674293,0.00014094482,0.00025282562,0.0002460849,0.01439251,0.021430138],"genre_scores_gemma":[0.6742981,0.00015136802,0.30833253,0.00016769586,0.000048805865,0.00025176018,0.0008321432,0.002898173,0.013019496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994777,0.000088871806,0.000028107423,0.00008954577,0.00022105059,0.000094786505],"domain_scores_gemma":[0.99952173,0.00016652839,0.000051663566,0.00012320769,0.000118420685,0.0000183551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025880983,0.0005371271,0.00031076098,0.0003725157,0.0004526689,0.00069764437,0.00059106975,0.00026805006,0.003930244],"category_scores_gemma":[0.0012342822,0.00022322856,0.0004660142,0.00034544762,0.0005256773,0.0005795375,0.0007824241,0.00058239774,0.0008928078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010237042,0.0005473461,0.0033832018,0.00044297002,0.00007551824,0.00079470646,0.0010427164,0.2500344,0.20005193,0.11638709,0.012709293,0.41350725],"study_design_scores_gemma":[0.00019676086,0.0003704716,0.0009065602,0.000030909116,0.000039023926,0.0002655522,0.00018546674,0.5768112,0.30932862,0.051386546,0.060440276,0.000038628885],"about_ca_topic_score_codex":0.0015359494,"about_ca_topic_score_gemma":0.0013365155,"teacher_disagreement_score":0.003930244,"about_ca_system_score_codex":0.0004893069,"about_ca_system_score_gemma":0.00045010188,"threshold_uncertainty_score":0.01314795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45405784,0.0013142186,0.52676547,0.000491304,0.00019851404,0.00011022711,0.00016935299,0.0017551027,0.015138087],"genre_scores_gemma":[0.94066143,0.00027292702,0.056007273,0.00019261654,0.000034389275,0.00008205031,0.000109192726,0.00011329585,0.0025267093],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997533,0.000052114912,0.000017019798,0.00003282868,0.000096928234,0.000047777656],"domain_scores_gemma":[0.9995788,0.00014794499,0.00009052359,0.00008412721,0.00007427656,0.000024347553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022613058,0.00032388823,0.00022513431,0.00028607572,0.00024098795,0.0003617592,0.0005455891,0.00029332782,0.0024133308],"category_scores_gemma":[0.0011180877,0.00015807073,0.00023022799,0.00038048637,0.00028348388,0.0005680724,0.00025296697,0.00046136984,0.00034625313],"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.00093470863,0.00023338308,0.006578059,0.0004264198,0.000044918437,0.0008503573,0.0002663202,0.24302436,0.3683133,0.040694058,0.005010419,0.33362365],"study_design_scores_gemma":[0.000069751666,0.0016165555,0.0050240792,0.00005424567,0.000060811974,0.00086905714,0.00008880873,0.79582,0.16021177,0.017512454,0.01864756,0.000024961519],"about_ca_topic_score_codex":0.0004677715,"about_ca_topic_score_gemma":0.0009020572,"teacher_disagreement_score":0.0024133308,"about_ca_system_score_codex":0.0002357156,"about_ca_system_score_gemma":0.000477404,"threshold_uncertainty_score":0.0080733895},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021579587,0.0001583266,0.98307437,0.00031027655,0.00009319603,0.00014713916,0.00011983258,0.00180686,0.012132061],"genre_scores_gemma":[0.045945965,0.0005934893,0.93664503,0.00028038354,0.000068695146,0.00053679146,0.0004495953,0.0006662694,0.014813776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99834275,0.0004057301,0.00018642281,0.000360315,0.0005706372,0.00013420772],"domain_scores_gemma":[0.9981294,0.00065703836,0.00012223786,0.00061915553,0.00039144247,0.00008071965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019359215,0.00076346437,0.0005829336,0.0006997938,0.00084667146,0.003023021,0.0020238813,0.0009026109,0.010286922],"category_scores_gemma":[0.0051380093,0.00066289166,0.001514206,0.0013310729,0.0018018947,0.0031786861,0.0021314865,0.0016951843,0.0034332972],"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.00012069008,0.00009274266,0.0008787456,0.00043121102,0.000085236476,0.00023016811,0.0005011198,0.045736827,0.004793814,0.69735456,0.018434236,0.23134069],"study_design_scores_gemma":[0.00010350257,0.000090712885,0.00016876048,0.00009566901,0.000049566963,0.0004445695,0.000091224385,0.19455642,0.007931656,0.61157507,0.18485908,0.000033893568],"about_ca_topic_score_codex":0.0013828527,"about_ca_topic_score_gemma":0.00167072,"teacher_disagreement_score":0.010286922,"about_ca_system_score_codex":0.0008262789,"about_ca_system_score_gemma":0.0016765496,"threshold_uncertainty_score":0.03441322},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30030996,0.0011397208,0.68079644,0.00039802707,0.00025151958,0.00008548991,0.00014328175,0.008147984,0.008727629],"genre_scores_gemma":[0.7635739,0.00030378933,0.23105083,0.00006377099,0.00002498604,0.000093984796,0.00020527068,0.00021624162,0.004467335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997589,0.000059100632,0.000014920267,0.000027915592,0.000089237925,0.000049966842],"domain_scores_gemma":[0.9992405,0.00024783023,0.00006229587,0.00024610525,0.00012002141,0.00008323946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021705814,0.00040940332,0.0003559425,0.00038320522,0.00046313368,0.00075239793,0.0007275337,0.0003206857,0.0042028944],"category_scores_gemma":[0.0014344109,0.0002861128,0.00022106494,0.0005231164,0.00041617083,0.0015296144,0.0013337918,0.00056979817,0.00069493405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009800603,0.000442032,0.0061763544,0.0003368567,0.00008718989,0.00040637128,0.0005813721,0.36583975,0.1061387,0.06586764,0.021051086,0.43209252],"study_design_scores_gemma":[0.00007928726,0.00018647876,0.00078555464,0.000014248485,0.000013462589,0.00013712172,0.000055081557,0.9510173,0.020528704,0.019176127,0.0079792915,0.00002718833],"about_ca_topic_score_codex":0.0012215455,"about_ca_topic_score_gemma":0.0026725142,"teacher_disagreement_score":0.0042028944,"about_ca_system_score_codex":0.00028251903,"about_ca_system_score_gemma":0.0005666866,"threshold_uncertainty_score":0.01406008},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03613038,0.000030726256,0.9530129,0.0003670859,0.00003596219,0.000198548,0.000055457735,0.0016698401,0.008499032],"genre_scores_gemma":[0.13603418,0.00010634475,0.85438037,0.00015525114,0.000011894876,0.0003617682,0.00021184424,0.0004815011,0.008256873],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991874,0.00020786555,0.000045801826,0.00011161525,0.00035774047,0.00008955196],"domain_scores_gemma":[0.99878246,0.00052144483,0.00013414715,0.000288073,0.00021370318,0.000060173734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008776815,0.0007278541,0.00035620882,0.00043797836,0.00064814003,0.0011130314,0.0009020903,0.0010235806,0.004015355],"category_scores_gemma":[0.003068314,0.00037579506,0.00090666465,0.00042226003,0.0009714688,0.0011677225,0.0011029326,0.0012097735,0.0008873872],"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.000321942,0.000727369,0.0049121836,0.0005972562,0.000068347756,0.0011706691,0.0018464642,0.13941197,0.08277875,0.23312637,0.01308005,0.52195865],"study_design_scores_gemma":[0.00029906552,0.00056685455,0.0013982467,0.00007281681,0.000070676964,0.0010027395,0.00045300295,0.6581539,0.12775551,0.13597402,0.07418064,0.000072588],"about_ca_topic_score_codex":0.0014601765,"about_ca_topic_score_gemma":0.002229884,"teacher_disagreement_score":0.004015355,"about_ca_system_score_codex":0.00056103047,"about_ca_system_score_gemma":0.0014016591,"threshold_uncertainty_score":0.013432682},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49055144,0.00028447254,0.48190656,0.00030484208,0.0000796112,0.00016971717,0.0001978195,0.015568841,0.01093684],"genre_scores_gemma":[0.74609774,0.00009481285,0.24668913,0.00007736495,0.000016888383,0.00008856901,0.00037489051,0.0002643273,0.0062962673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994443,0.00013736304,0.000026561445,0.00010124083,0.00020867285,0.00008185263],"domain_scores_gemma":[0.99911183,0.0002201292,0.00007318668,0.00027986622,0.000253962,0.00006110593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006505251,0.00052996876,0.00042796155,0.00045210682,0.0006821729,0.0007837823,0.0014419897,0.00047819765,0.0021561813],"category_scores_gemma":[0.0012323122,0.0003144011,0.0002676305,0.0005270555,0.00044465813,0.0011138348,0.0007556461,0.00050577853,0.00048438617],"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.002973,0.0007406981,0.010967038,0.00049374264,0.0002094783,0.00039534402,0.0009974309,0.37194914,0.24876328,0.01403424,0.011224089,0.3372526],"study_design_scores_gemma":[0.00008890085,0.0002716638,0.0011409714,0.00000845999,0.000027302542,0.00006093586,0.00009554658,0.90681094,0.086689994,0.0010462556,0.0037320945,0.000026970769],"about_ca_topic_score_codex":0.004765447,"about_ca_topic_score_gemma":0.009700581,"teacher_disagreement_score":0.004765447,"about_ca_system_score_codex":0.0008054747,"about_ca_system_score_gemma":0.0009848131,"threshold_uncertainty_score":0.00947541},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26308158,0.00020503046,0.7162368,0.00015988834,0.000055967816,0.0001224517,0.00012312303,0.010349556,0.009665591],"genre_scores_gemma":[0.46540982,0.00013502793,0.52841616,0.00011666886,0.000012130201,0.00008346858,0.00032018448,0.0011237807,0.0043827225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99983287,0.00002369038,0.000008548234,0.000043570784,0.00006481332,0.000026463156],"domain_scores_gemma":[0.99966466,0.00008372263,0.000039975956,0.0001163233,0.0000830661,0.000012366141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026591646,0.00026769124,0.0002113281,0.000290524,0.00021872453,0.00046235562,0.00067613914,0.00033772754,0.0012758669],"category_scores_gemma":[0.0009929995,0.00020045391,0.00021902211,0.0003171016,0.0005226536,0.00045122998,0.00036796086,0.00051630253,0.000363342],"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.00044989065,0.00015338373,0.0027138465,0.00020432976,0.00003705702,0.00043649372,0.00043183382,0.38638714,0.16951136,0.054584634,0.006335579,0.3787544],"study_design_scores_gemma":[0.00008061949,0.00028570212,0.00095561007,0.000021306698,0.000027046803,0.000272259,0.00004972178,0.84068805,0.123990685,0.011329973,0.022272153,0.000026910926],"about_ca_topic_score_codex":0.0014697298,"about_ca_topic_score_gemma":0.0019367897,"teacher_disagreement_score":0.0014697298,"about_ca_system_score_codex":0.00036014014,"about_ca_system_score_gemma":0.000677611,"threshold_uncertainty_score":0.004268229},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2062693,0.090507366,0.049042143,0.45962617,0.0042910557,0.00003243878,0.00015818658,0.0002916236,0.18978171],"genre_scores_gemma":[0.92055297,0.030115187,0.006748365,0.023457987,0.005728951,0.00005728333,0.000059562455,0.00042930964,0.012850373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99649316,0.0010506435,0.00011299306,0.0005830277,0.0014270421,0.00033310268],"domain_scores_gemma":[0.9917515,0.005387263,0.0005242908,0.0007429897,0.0012950583,0.00029882023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061241165,0.00043433107,0.0007039279,0.0014746857,0.002310916,0.0067106555,0.0017370303,0.0034873146,0.003132692],"category_scores_gemma":[0.014576605,0.00044488348,0.0003501212,0.002122462,0.015016815,0.015884016,0.002661558,0.009091801,0.0006628686],"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.00013639397,0.00006596739,0.0016821445,0.00015135683,0.000019969797,0.00012742642,0.0041941027,0.0034239723,0.0010746598,0.893411,0.016442647,0.07927053],"study_design_scores_gemma":[0.00004608482,0.00019840154,0.0072449525,0.00075616915,0.00003272662,0.00018317794,0.0076454403,0.009626168,0.0015895914,0.7209014,0.25169566,0.00008010789],"about_ca_topic_score_codex":0.002872543,"about_ca_topic_score_gemma":0.003742847,"teacher_disagreement_score":0.0067106555,"about_ca_system_score_codex":0.003143704,"about_ca_system_score_gemma":0.0014299178,"threshold_uncertainty_score":0.032387853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20496307,0.00043958134,0.78801036,0.00026949868,0.000050312265,0.000060901355,0.0000517724,0.0009465872,0.005207985],"genre_scores_gemma":[0.8966778,0.00010486264,0.10174944,0.00007110649,0.000017285849,0.00003759767,0.0000354523,0.000059380713,0.0012471119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962866,0.0000821322,0.000019203319,0.000063432955,0.00011770652,0.00008885844],"domain_scores_gemma":[0.9995041,0.00018554681,0.00013749274,0.00005488929,0.0000850691,0.000032841097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037714306,0.00061289564,0.00041094725,0.00043978315,0.0002999502,0.0005580822,0.00079668855,0.00034595418,0.001253861],"category_scores_gemma":[0.0012279032,0.00018208653,0.00029188834,0.0005638876,0.00045776865,0.0007991057,0.00034356865,0.0003670935,0.0001792307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014793583,0.0000921087,0.0006519459,0.000050801278,0.000019264216,0.000036200134,0.000044090302,0.92707014,0.012997234,0.0037708299,0.00051219156,0.054607343],"study_design_scores_gemma":[0.000017936769,0.00007592599,0.00012178765,0.000002696872,0.0000080704685,0.000015089819,0.000011091043,0.9928197,0.0049983296,0.0015951841,0.00032935865,0.000004768215],"about_ca_topic_score_codex":0.002215075,"about_ca_topic_score_gemma":0.004170995,"teacher_disagreement_score":0.002215075,"about_ca_system_score_codex":0.0007485592,"about_ca_system_score_gemma":0.0011831225,"threshold_uncertainty_score":0.005431235},"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":"software","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004856008,0.0022146236,0.1986711,0.002259727,0.0018629304,0.00075144897,0.023373948,0.4447684,0.3212418],"genre_scores_gemma":[0.058297776,0.0037726103,0.22304954,0.003966544,0.000636205,0.0015824083,0.07841645,0.12027927,0.5099992],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99782467,0.00030196673,0.0001997977,0.00055773574,0.0008187932,0.00029695308],"domain_scores_gemma":[0.9960896,0.0008715976,0.0002748335,0.0011804326,0.0011461929,0.00043728357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020643843,0.0025625278,0.00128117,0.003015464,0.0013739733,0.0061087967,0.0046990565,0.0023882282,0.34436643],"category_scores_gemma":[0.0094458945,0.0015977245,0.0016896623,0.0018528777,0.0009601013,0.008235727,0.0055298414,0.0031629887,0.33614975],"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.0007220632,0.00022863685,0.0018824013,0.0013544846,0.00008006293,0.00044640055,0.00039694074,0.0027566722,0.006700186,0.041676823,0.5362944,0.40746096],"study_design_scores_gemma":[0.00008602949,0.00007107827,0.0007520587,0.00021512635,0.0000287832,0.00046371206,0.00008091887,0.00523851,0.005435852,0.01518555,0.9723741,0.00006836926],"about_ca_topic_score_codex":0.002255083,"about_ca_topic_score_gemma":0.0019584452,"teacher_disagreement_score":0.34436643,"about_ca_system_score_codex":0.0014635915,"about_ca_system_score_gemma":0.002219699,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043370267,0.0012795761,0.69873524,0.0022224728,0.0013756246,0.0005132912,0.005964692,0.1171038,0.16846822],"genre_scores_gemma":[0.09161363,0.0022503322,0.5786907,0.0037949574,0.0010860527,0.0010234452,0.025135245,0.03514451,0.2612612],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966794,0.00043113387,0.000264428,0.0007083712,0.0015900324,0.00032648828],"domain_scores_gemma":[0.9963993,0.00056960154,0.00014345573,0.0016737937,0.000996486,0.00021739253],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020466705,0.0011405069,0.0006629783,0.0013965913,0.001166993,0.0035230939,0.0045807473,0.0014163959,0.096347176],"category_scores_gemma":[0.007389792,0.0010242449,0.001320906,0.0011340015,0.0010446989,0.006742077,0.006818195,0.0025447092,0.058238912],"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.00039817634,0.00013444618,0.001570631,0.00062542094,0.000058370937,0.0003678377,0.0003925488,0.003877297,0.0069290837,0.20246227,0.2818577,0.50132626],"study_design_scores_gemma":[0.000031070882,0.00004539212,0.00021189016,0.00006617142,0.00001827171,0.00035671814,0.00003788363,0.0070417398,0.006689709,0.029709049,0.9557638,0.00002825601],"about_ca_topic_score_codex":0.0018627074,"about_ca_topic_score_gemma":0.0019562365,"teacher_disagreement_score":0.90365285,"about_ca_system_score_codex":0.00096933666,"about_ca_system_score_gemma":0.0020144158,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35355994,0.0021936034,0.62424433,0.00020818104,0.00021290321,0.00022447675,0.0004417519,0.0052616713,0.013653212],"genre_scores_gemma":[0.84810865,0.000369781,0.14448126,0.00016096173,0.000047818474,0.00007351354,0.0003928799,0.00012160022,0.006243611],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997918,0.00002747841,0.000021148024,0.000038983846,0.000082088445,0.000038494483],"domain_scores_gemma":[0.9994779,0.00007248845,0.00012843148,0.00017081584,0.00012323601,0.000027152935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020913739,0.00029752584,0.00029341393,0.00038941728,0.00014121165,0.00065518473,0.0017169652,0.00029433827,0.0028270965],"category_scores_gemma":[0.0005011036,0.0001544912,0.00030380266,0.0004066987,0.00019382023,0.0013298569,0.00057900825,0.00032404298,0.0006825985],"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.0009359434,0.00018858351,0.0027541153,0.000729532,0.0001382761,0.0005804888,0.00017425479,0.052657075,0.4236537,0.023277214,0.0054219826,0.4894889],"study_design_scores_gemma":[0.00013857588,0.0027010373,0.0025684177,0.000089238594,0.00022486546,0.0015696605,0.00008373035,0.24917498,0.69676495,0.009680105,0.036913358,0.00009114989],"about_ca_topic_score_codex":0.00012991804,"about_ca_topic_score_gemma":0.00031605217,"teacher_disagreement_score":0.0028270965,"about_ca_system_score_codex":0.00027111455,"about_ca_system_score_gemma":0.00026213084,"threshold_uncertainty_score":0.009457648},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046750445,0.0002429324,0.94658405,0.00026910764,0.000030688258,0.000091454545,0.00009340323,0.00051287777,0.0054250695],"genre_scores_gemma":[0.61073977,0.0003208643,0.38300684,0.00012838459,0.00005501243,0.0002151391,0.00015364803,0.00030251496,0.005077731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899,0.00023587517,0.00002728246,0.00006572499,0.00057725166,0.000103941726],"domain_scores_gemma":[0.9985611,0.00070386735,0.00010644192,0.00023784279,0.00036703888,0.00002386447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010058196,0.00067813165,0.0006343443,0.00088658766,0.00034444805,0.0005869542,0.0007586267,0.0003002354,0.0022293408],"category_scores_gemma":[0.002962936,0.00034207097,0.0005824843,0.00074322784,0.00063379225,0.0009632619,0.00055210857,0.0006632048,0.00036749354],"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.00022714086,0.000064310254,0.0010718427,0.0002526457,0.00008663007,0.0002634207,0.000120428194,0.627382,0.05029184,0.12929808,0.0039102756,0.18703148],"study_design_scores_gemma":[0.000013827278,0.00007672095,0.00039388263,0.000012835929,0.00004876192,0.00009750548,0.000014923688,0.95103014,0.014160174,0.031154048,0.002981918,0.000015191003],"about_ca_topic_score_codex":0.0009896165,"about_ca_topic_score_gemma":0.0015201973,"teacher_disagreement_score":0.0022293408,"about_ca_system_score_codex":0.00052730273,"about_ca_system_score_gemma":0.0010144636,"threshold_uncertainty_score":0.0074578524},"labels":[],"label_agreement":null},{"id":"W2124504744","doi":"10.1016/j.scico.2005.10.012","title":"Gaussian Elimination: A case study in efficient genericity with MetaOCaml","year":2006,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Implementation; Gaussian elimination; Code (set theory); Gaussian; Code generation; Programming language; Algorithm; Theoretical computer science; Parallel computing; Mathematical optimization; Key (lock); Operating system; Mathematics","score_opus":0.013699039743499506,"score_gpt":0.26979308635756466,"score_spread":0.25609404661406515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124504744","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06813831,0.00025500185,0.910255,0.0010861978,0.000031285,0.00016648052,0.00017006318,0.005278161,0.014619503],"genre_scores_gemma":[0.4851829,0.00023420798,0.50470364,0.00028609097,0.000037654972,0.0001168497,0.00030411896,0.00211826,0.0070162765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951792,0.001990806,0.00022133024,0.00046064402,0.0014975687,0.00065051886],"domain_scores_gemma":[0.98224336,0.009807545,0.0006357865,0.0060115284,0.0010709551,0.00023077885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063757114,0.00059709005,0.0008842128,0.0010635913,0.0018018092,0.0029414964,0.003306476,0.0022926803,0.0048158113],"category_scores_gemma":[0.02311493,0.00056681794,0.0017059011,0.002931478,0.0032003468,0.005576979,0.0048010005,0.0026772371,0.00088458066],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042252245,0.00026555723,0.0035374807,0.000391586,0.000098777295,0.0013362062,0.0023380986,0.056991894,0.0062234495,0.7292682,0.006582227,0.192544],"study_design_scores_gemma":[0.00018817539,0.00019308848,0.00088624016,0.0001439808,0.00018324605,0.0013791878,0.0007003542,0.41754773,0.0316459,0.4864818,0.06056247,0.00008779984],"about_ca_topic_score_codex":0.0027110775,"about_ca_topic_score_gemma":0.0046796766,"teacher_disagreement_score":0.0063757114,"about_ca_system_score_codex":0.0010659776,"about_ca_system_score_gemma":0.0017503193,"threshold_uncertainty_score":0.033718407},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3832877,0.001283178,0.588391,0.00057446683,0.00024268498,0.00014000821,0.00011532918,0.0014972842,0.024468265],"genre_scores_gemma":[0.900909,0.00039234798,0.09166286,0.00011637742,0.000050099865,0.000071953684,0.00007333367,0.0000962777,0.0066278093],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99974746,0.000041691805,0.000009987157,0.000043209307,0.0001047911,0.000052899868],"domain_scores_gemma":[0.9994742,0.00013947436,0.000072398245,0.00009970387,0.00018116544,0.000033011504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021058769,0.00035511886,0.00030968824,0.0002339341,0.0004972339,0.0006898439,0.0007361075,0.0003497462,0.002120085],"category_scores_gemma":[0.0008652552,0.000107523425,0.00009293043,0.00040968013,0.00025458034,0.0010068633,0.0004832584,0.0003122792,0.0006114781],"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.00067221397,0.00022620863,0.0068234024,0.00030912345,0.000050770002,0.00041699308,0.00036761767,0.19790499,0.46530572,0.049652357,0.006983886,0.27128667],"study_design_scores_gemma":[0.00004877541,0.000625837,0.0020883817,0.000024259878,0.00009611399,0.00041560875,0.00023119035,0.6907216,0.25487432,0.010287064,0.040550265,0.00003658981],"about_ca_topic_score_codex":0.0011464505,"about_ca_topic_score_gemma":0.003046456,"teacher_disagreement_score":0.002120085,"about_ca_system_score_codex":0.0004623547,"about_ca_system_score_gemma":0.0008776526,"threshold_uncertainty_score":0.0070923567},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026246079,0.00006977271,0.98710364,0.00013261902,0.00004448172,0.00013295843,0.00008949191,0.0016866619,0.0081158215],"genre_scores_gemma":[0.05297908,0.00029175484,0.93452996,0.0002204153,0.0000400157,0.00060007616,0.00042237766,0.0013090611,0.0096073225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889404,0.00026822774,0.00008536743,0.00012609198,0.00052176026,0.000104491664],"domain_scores_gemma":[0.9987663,0.00049822545,0.000109949804,0.00032284934,0.00025287527,0.000049908856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013563449,0.000941608,0.00041806218,0.000671376,0.0009094293,0.0015522328,0.0015851401,0.0012492398,0.0116570145],"category_scores_gemma":[0.003197189,0.00084032223,0.0013984379,0.0005391686,0.0010008352,0.0014750937,0.0013959476,0.0018306421,0.0041359453],"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.00012552667,0.00008732107,0.000479645,0.00049664447,0.00004258352,0.00037833521,0.0004641126,0.20024276,0.017155292,0.67295665,0.008258811,0.09931234],"study_design_scores_gemma":[0.00010771268,0.00012181676,0.00016708214,0.00014257422,0.00007290666,0.0003251224,0.00005993364,0.58133805,0.020439034,0.13135734,0.2658236,0.000044784236],"about_ca_topic_score_codex":0.0030984697,"about_ca_topic_score_gemma":0.0040342133,"teacher_disagreement_score":0.0116570145,"about_ca_system_score_codex":0.0010570463,"about_ca_system_score_gemma":0.0018074973,"threshold_uncertainty_score":0.038996637},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11906746,0.001102833,0.8597126,0.0011714472,0.00010224908,0.00012188216,0.000578394,0.0017362828,0.016406829],"genre_scores_gemma":[0.8807532,0.0015854872,0.1049135,0.0001966252,0.00010794918,0.000348535,0.0010161579,0.0005156326,0.010562926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941075,0.00013857536,0.000021950576,0.000104369305,0.0002302948,0.00009414918],"domain_scores_gemma":[0.99918526,0.0003254633,0.000112815505,0.000119804245,0.0002124536,0.00004416929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005544511,0.00092108035,0.0007304449,0.0007208772,0.0006009967,0.0009917913,0.0015781049,0.0009661217,0.0016459973],"category_scores_gemma":[0.0027323982,0.0003902378,0.0006098886,0.0010332749,0.000614977,0.001619311,0.00060648797,0.0012335523,0.00066332676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007827538,0.000011198667,0.0003357864,0.000012953086,0.0000053314766,0.000018277216,0.000015323938,0.9880723,0.0005299187,0.0074899653,0.00042785887,0.0030732583],"study_design_scores_gemma":[0.0000010815063,0.0000052536698,0.0000841191,0.0000020322093,0.0000013239006,0.0000042982006,0.000002248863,0.9966689,0.00024897084,0.0025868772,0.00039304668,0.0000018750912],"about_ca_topic_score_codex":0.010041597,"about_ca_topic_score_gemma":0.003841352,"teacher_disagreement_score":0.010041597,"about_ca_system_score_codex":0.0011336927,"about_ca_system_score_gemma":0.0010250376,"threshold_uncertainty_score":0.019966304},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003830734,0.00048586805,0.96836144,0.0010276109,0.00017529374,0.00007719875,0.0006472102,0.01620087,0.009193727],"genre_scores_gemma":[0.09084854,0.00070238573,0.88218266,0.0014107215,0.00017334886,0.00066092645,0.0015803935,0.007780928,0.014660107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996393,0.0009583738,0.00041923329,0.0005166993,0.0013624304,0.00035020988],"domain_scores_gemma":[0.99559927,0.0019253194,0.00023611709,0.0013505952,0.00069771823,0.00019103281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047314577,0.0010586007,0.0011263915,0.0012843651,0.0015289605,0.00531436,0.004520917,0.0015398382,0.007837354],"category_scores_gemma":[0.011434439,0.0018675028,0.0024705504,0.001662405,0.005172472,0.011319223,0.007667289,0.00558019,0.0036674053],"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.00022671687,0.000025924332,0.0005708327,0.00039025166,0.000027634522,0.00013506725,0.0014391498,0.0061216736,0.0026611518,0.9256491,0.018591031,0.044161476],"study_design_scores_gemma":[0.00014223058,0.00007718223,0.00022217714,0.0004311987,0.00007314745,0.00041730725,0.00021357776,0.062394906,0.015058214,0.452945,0.46785635,0.00016878931],"about_ca_topic_score_codex":0.0037278947,"about_ca_topic_score_gemma":0.0052742916,"teacher_disagreement_score":0.007837354,"about_ca_system_score_codex":0.0037411829,"about_ca_system_score_gemma":0.003766124,"threshold_uncertainty_score":0.027144372},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91939574,0.00044422384,0.077120565,0.00023019231,0.000013959799,0.000046665406,0.0001917181,0.00045500684,0.0021018828],"genre_scores_gemma":[0.990386,0.0001461412,0.008891275,0.000024666433,0.000012149993,0.00002086622,0.00012392522,0.00003382697,0.00036114766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991542,0.00014568248,0.000056487854,0.0001351533,0.0004147631,0.00009370925],"domain_scores_gemma":[0.9948715,0.0024360442,0.0012509926,0.0004491874,0.000793103,0.0001992607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009395884,0.00026915665,0.00030112953,0.0014274966,0.0005758818,0.00094184745,0.00046524787,0.00058613793,0.00048498638],"category_scores_gemma":[0.008003391,0.00035290446,0.00027335863,0.0018828382,0.00093334226,0.0014407351,0.00060532405,0.0006738356,0.00011201246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014815492,0.0005241591,0.19085117,0.00028311496,0.00011285697,0.004446855,0.002203724,0.48185712,0.05201337,0.115535825,0.0026172954,0.14807305],"study_design_scores_gemma":[0.000013428234,0.00009230784,0.016435862,0.000018111637,0.000020467936,0.0007440314,0.00023374686,0.9390342,0.012320179,0.029764593,0.001294723,0.000028356168],"about_ca_topic_score_codex":0.0028750845,"about_ca_topic_score_gemma":0.0020439434,"teacher_disagreement_score":0.0028750845,"about_ca_system_score_codex":0.0009269684,"about_ca_system_score_gemma":0.0006440375,"threshold_uncertainty_score":0.006725669},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81202155,0.00070216146,0.1535659,0.00028366628,0.0000660701,0.00014423234,0.00044021342,0.0011266638,0.03164949],"genre_scores_gemma":[0.9930668,0.000102094775,0.0043366286,0.000028800836,0.000015619442,0.000054584685,0.0001450412,0.00003636783,0.0022141675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99956626,0.000044241242,0.000020998812,0.00006410982,0.00018769804,0.00011675918],"domain_scores_gemma":[0.99848217,0.0006202377,0.0002447239,0.00023332148,0.0003377241,0.00008187989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034639574,0.00031729788,0.0003962162,0.0008526305,0.00068034616,0.0010863194,0.00075591763,0.00047404427,0.0031339582],"category_scores_gemma":[0.002865853,0.00016726075,0.00017847081,0.0007684606,0.0006477081,0.000839896,0.0005298844,0.00062980637,0.0004924501],"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.0017954943,0.00032969142,0.013783092,0.00027230495,0.00005723225,0.0010166673,0.0008651432,0.42083514,0.3720374,0.14616689,0.0033060245,0.03953491],"study_design_scores_gemma":[0.000025337498,0.00018545205,0.003913531,0.000011662037,0.00001926434,0.00018015182,0.00013768056,0.89927566,0.08295492,0.007881822,0.0053865965,0.000027988846],"about_ca_topic_score_codex":0.0019593132,"about_ca_topic_score_gemma":0.0011749045,"teacher_disagreement_score":0.0031339582,"about_ca_system_score_codex":0.0007987067,"about_ca_system_score_gemma":0.00075518363,"threshold_uncertainty_score":0.010484099},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7115991,0.003122698,0.27521443,0.00067348266,0.00024843248,0.0000952886,0.00008330415,0.0028347918,0.00612844],"genre_scores_gemma":[0.9501024,0.00034175196,0.047332387,0.000074260824,0.000056417237,0.000048670798,0.000060284558,0.000045939556,0.0019379044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992255,0.00022521368,0.00006262194,0.000082671526,0.00029706495,0.00010689801],"domain_scores_gemma":[0.9979194,0.0007889298,0.00020640089,0.0005371173,0.0004358075,0.00011242968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008608092,0.0003239327,0.00041614563,0.00038694052,0.0005979588,0.00066028757,0.0011618752,0.00044377695,0.00097477174],"category_scores_gemma":[0.0032648523,0.00043153524,0.0002469311,0.00069327437,0.0005564629,0.0013757449,0.00082475005,0.000570157,0.00019428744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029449235,0.00043533253,0.021740384,0.00038368383,0.00018802365,0.0014968553,0.0006344619,0.41026556,0.16476971,0.03240379,0.007474651,0.35726267],"study_design_scores_gemma":[0.00006132551,0.00018761169,0.0011161956,0.000012894761,0.000037420952,0.00010695563,0.000034727414,0.9707666,0.019659413,0.0062888274,0.001711242,0.000016682909],"about_ca_topic_score_codex":0.0035079678,"about_ca_topic_score_gemma":0.0057187933,"teacher_disagreement_score":0.0035079678,"about_ca_system_score_codex":0.00065669505,"about_ca_system_score_gemma":0.0013385644,"threshold_uncertainty_score":0.0069751143},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10676683,0.0036997665,0.66693175,0.0006942955,0.00085141254,0.0006273569,0.00165596,0.17857057,0.040202048],"genre_scores_gemma":[0.710623,0.0016651851,0.24922603,0.0005372211,0.00020066313,0.00031381432,0.0037773722,0.005302111,0.028354468],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998847,0.00014254975,0.00014734545,0.00018824537,0.00042930624,0.00024560254],"domain_scores_gemma":[0.99646807,0.00047334546,0.00033812202,0.0016413309,0.0006311633,0.00044808933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001324152,0.0007164891,0.0007329262,0.00084554666,0.0006855782,0.0027859742,0.0028156638,0.0008911565,0.003659464],"category_scores_gemma":[0.005714863,0.00075379584,0.00081477105,0.0005604658,0.0008714545,0.0041946024,0.0028086167,0.0025724263,0.0040531424],"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.0042905896,0.00089122314,0.018199895,0.00086603593,0.0005022452,0.001374106,0.0008073659,0.04948298,0.18717512,0.076843135,0.09923027,0.56033707],"study_design_scores_gemma":[0.00046059533,0.00095626246,0.016070666,0.00019799212,0.00033071855,0.005009339,0.00020481818,0.47100285,0.1256823,0.04881568,0.33054897,0.0007198024],"about_ca_topic_score_codex":0.00073329784,"about_ca_topic_score_gemma":0.0006847193,"teacher_disagreement_score":0.003659464,"about_ca_system_score_codex":0.0005875732,"about_ca_system_score_gemma":0.0010051343,"threshold_uncertainty_score":0.012242079},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9919813,0.0004019003,0.003824669,0.00007821694,0.000017836146,0.000019483034,0.0001015176,0.0004925392,0.0030825317],"genre_scores_gemma":[0.9973449,0.00008463709,0.0014654315,0.000014018634,0.000009261078,0.000009732471,0.00019836043,0.000037254475,0.000836356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988832,0.0002751901,0.00007046347,0.00018646612,0.0003460299,0.0002386542],"domain_scores_gemma":[0.9972331,0.0011748578,0.00017686113,0.00030510375,0.00095604843,0.0001540546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001030592,0.00051179837,0.0006469437,0.0009150112,0.00054614263,0.000881447,0.0006338116,0.00058399606,0.0030660129],"category_scores_gemma":[0.003308458,0.00024268526,0.00027337272,0.0015019187,0.0003972065,0.0008173504,0.0003065662,0.0004281264,0.0006944891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0073518814,0.00093875645,0.06661845,0.0008374381,0.0003907179,0.0018696244,0.00057297916,0.53563625,0.26777387,0.0070098815,0.007377799,0.10362239],"study_design_scores_gemma":[0.000090843496,0.0011856654,0.017132062,0.000013861778,0.00009957188,0.0003195667,0.00014187883,0.9095622,0.06955322,0.0006583403,0.0012127389,0.000030083263],"about_ca_topic_score_codex":0.002432324,"about_ca_topic_score_gemma":0.0014343542,"teacher_disagreement_score":0.0030660129,"about_ca_system_score_codex":0.0009815065,"about_ca_system_score_gemma":0.00053517567,"threshold_uncertainty_score":0.010256827},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031304394,0.00020572306,0.97870904,0.00010899123,0.000066002576,0.00006670021,0.00023372403,0.0037326526,0.013746835],"genre_scores_gemma":[0.274213,0.0013848796,0.7003103,0.0002641979,0.00014164177,0.0008910512,0.0015531136,0.0019078696,0.019333994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941206,0.0001740389,0.000029384055,0.000060658855,0.00026372864,0.00006003449],"domain_scores_gemma":[0.99940395,0.0001902796,0.00003179097,0.00017951855,0.00016631103,0.0000280923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060577196,0.00067961356,0.0010832213,0.0009567095,0.0004297839,0.0010370337,0.0022493673,0.0011872579,0.01302901],"category_scores_gemma":[0.0021454254,0.00049804925,0.0010323672,0.0007685664,0.0005132121,0.0016893125,0.0011218698,0.0012894424,0.0032844548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008649398,0.00006419576,0.0005578869,0.00020799466,0.000082464205,0.0000889602,0.000127394,0.7336003,0.0073446753,0.18706831,0.0092854295,0.061485864],"study_design_scores_gemma":[0.000014189596,0.000027245595,0.00006227295,0.000014741933,0.000014824338,0.000046809575,0.000008494111,0.9667136,0.0026691954,0.011443072,0.018975446,0.000010189454],"about_ca_topic_score_codex":0.0023866892,"about_ca_topic_score_gemma":0.002540038,"teacher_disagreement_score":0.01302901,"about_ca_system_score_codex":0.0007223013,"about_ca_system_score_gemma":0.00094323675,"threshold_uncertainty_score":0.043586373},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9857054,0.00050460664,0.009822805,0.00007182581,0.00003095524,0.000048529466,0.00026523127,0.0006364412,0.0029142713],"genre_scores_gemma":[0.98967,0.00017668078,0.008674855,0.00002692302,0.000010837718,0.00003252979,0.00043217806,0.00004000687,0.00093591947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990502,0.00019216794,0.000059101727,0.00012451972,0.0004141978,0.00015976591],"domain_scores_gemma":[0.9975222,0.00079795177,0.00019389266,0.00046465523,0.0008532962,0.00016793459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091619365,0.0005729625,0.000604442,0.00073722727,0.00044176533,0.00059726875,0.0010955239,0.00054150994,0.0012519789],"category_scores_gemma":[0.0027809883,0.00017333312,0.00025031558,0.0015258489,0.00039804587,0.00093513366,0.0004977949,0.00036828793,0.0001780092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0050191157,0.000992487,0.015450089,0.00065273663,0.00029334973,0.00061651954,0.00043442936,0.657488,0.18510534,0.0056949207,0.0037776232,0.1244754],"study_design_scores_gemma":[0.00016861544,0.0024379527,0.0063109584,0.000013880811,0.0001070893,0.00014860817,0.000103169026,0.9293493,0.05957119,0.00044009043,0.0013103237,0.00003871481],"about_ca_topic_score_codex":0.007931501,"about_ca_topic_score_gemma":0.006365561,"teacher_disagreement_score":0.007931501,"about_ca_system_score_codex":0.00084144203,"about_ca_system_score_gemma":0.0011911864,"threshold_uncertainty_score":0.015770674},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03243574,0.000115472445,0.9445752,0.00013707946,0.00007305196,0.00007335446,0.00016439702,0.0035879267,0.01883777],"genre_scores_gemma":[0.65677744,0.00011835946,0.33288342,0.00028157752,0.000082214065,0.0002077939,0.0003278064,0.00037658098,0.008944749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956554,0.000056344663,0.000032686945,0.00009625109,0.00018428829,0.000064896485],"domain_scores_gemma":[0.9996909,0.000058668884,0.000030005509,0.0001043674,0.0000846968,0.000031309293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002918171,0.00033554056,0.00030943326,0.00029379828,0.00034484925,0.0006993278,0.0010794438,0.0004459745,0.0067360285],"category_scores_gemma":[0.00086995825,0.00020921855,0.00023994937,0.00025180902,0.00037703774,0.0010694655,0.0009609698,0.00051144557,0.0017802843],"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.0008099638,0.00023791802,0.0007772549,0.00050557556,0.00004504603,0.00038642573,0.00029965118,0.029746395,0.29662848,0.41779265,0.010277883,0.24249282],"study_design_scores_gemma":[0.00039320628,0.0012050514,0.00078073377,0.00009071489,0.00018430053,0.0009866811,0.00009526561,0.43475544,0.28713444,0.16010514,0.1141935,0.000075544725],"about_ca_topic_score_codex":0.00021222119,"about_ca_topic_score_gemma":0.00042504907,"teacher_disagreement_score":0.0067360285,"about_ca_system_score_codex":0.00028645727,"about_ca_system_score_gemma":0.0006605249,"threshold_uncertainty_score":0.02253431},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9694251,0.00066429615,0.010307166,0.0002671514,0.000046685676,0.000034027027,0.00028645777,0.00012080772,0.018848268],"genre_scores_gemma":[0.9972946,0.0001247917,0.001274136,0.000019939458,0.0000056523695,0.0000111546415,0.00010557776,0.00001932873,0.0011447921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983335,0.00004566129,0.000006490449,0.000018527888,0.000046002606,0.000049968803],"domain_scores_gemma":[0.99898857,0.00062454527,0.000060955103,0.000065952954,0.00021808803,0.000041896743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043683127,0.00040421187,0.00044714403,0.0005637054,0.00030783843,0.0004470243,0.0007514474,0.0005710938,0.0037677435],"category_scores_gemma":[0.0015903474,0.00019154779,0.0005606592,0.00108292,0.00026689895,0.0007598465,0.00018865241,0.00038867438,0.00024757042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001790984,0.00007806952,0.0029881136,0.000068504705,0.00003394698,0.00010119841,0.000033663564,0.9869027,0.0022957304,0.0015260342,0.0006210172,0.0051719462],"study_design_scores_gemma":[0.00001706568,0.00013724939,0.0016707041,0.000004332565,0.000020322646,0.000024775802,0.00003254631,0.99628496,0.0010090035,0.00037344563,0.00042026475,0.000005247631],"about_ca_topic_score_codex":0.0077204076,"about_ca_topic_score_gemma":0.007326287,"teacher_disagreement_score":0.0077204076,"about_ca_system_score_codex":0.00062823587,"about_ca_system_score_gemma":0.00050708576,"threshold_uncertainty_score":0.015350938},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010614209,0.0016665054,0.34231687,0.004367877,0.002526009,0.00065866706,0.010688441,0.0713843,0.5557772],"genre_scores_gemma":[0.12925187,0.0023935433,0.1898898,0.0033120099,0.0012309853,0.00086437014,0.03812084,0.012606848,0.6223297],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894744,0.00013043969,0.000069979265,0.00023070077,0.0004801948,0.00014124085],"domain_scores_gemma":[0.99799097,0.00017802208,0.00008224497,0.00084204547,0.0007303069,0.00017640708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091910205,0.00082080846,0.00039023577,0.00096843025,0.0008930005,0.0026956724,0.0017857375,0.0010792608,0.20260103],"category_scores_gemma":[0.0028578872,0.0004865106,0.00048618353,0.0011683094,0.00040077209,0.0029662424,0.0025489174,0.0012302205,0.15252024],"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.00036161768,0.000120674544,0.0012258536,0.00042486232,0.000028996572,0.0003302641,0.00016101704,0.002035525,0.016061528,0.044732045,0.42662603,0.50789154],"study_design_scores_gemma":[0.00004687424,0.00007239483,0.0005482269,0.000043057153,0.000010810675,0.0003499876,0.000050306324,0.005352002,0.008206426,0.012061096,0.9732404,0.000018436358],"about_ca_topic_score_codex":0.001226094,"about_ca_topic_score_gemma":0.0013232927,"teacher_disagreement_score":0.20260103,"about_ca_system_score_codex":0.000753364,"about_ca_system_score_gemma":0.001323071,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030118953,0.00030789335,0.9472192,0.00017650468,0.00011842485,0.00007880028,0.00022435997,0.014980537,0.0067753694],"genre_scores_gemma":[0.64231914,0.0002020866,0.34950712,0.00019475001,0.00005112806,0.00017272367,0.0005029609,0.00139823,0.0056517553],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974953,0.000556633,0.00015044716,0.0004434493,0.0011132271,0.0002409776],"domain_scores_gemma":[0.995697,0.0010770594,0.00040381678,0.0017712835,0.00095588854,0.00009496313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012353531,0.00072413945,0.0006924642,0.00077890424,0.0005125607,0.001483269,0.0018155867,0.00078758074,0.0037816437],"category_scores_gemma":[0.007320266,0.0004766494,0.00075052027,0.0005193323,0.00096223317,0.0020375445,0.001543825,0.0012048526,0.000893152],"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.0017146474,0.00021949044,0.012389209,0.0006884764,0.00018944587,0.00070531137,0.0005511115,0.23220135,0.18003455,0.10505818,0.018455,0.44779322],"study_design_scores_gemma":[0.000056590736,0.00011710137,0.0010285138,0.00004828576,0.000044460998,0.00020303043,0.000029235389,0.8810629,0.07996965,0.019463051,0.017940847,0.000036268222],"about_ca_topic_score_codex":0.003100149,"about_ca_topic_score_gemma":0.00403292,"teacher_disagreement_score":0.0037816437,"about_ca_system_score_codex":0.0010748002,"about_ca_system_score_gemma":0.0019623085,"threshold_uncertainty_score":0.012650847},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03134839,0.0002347374,0.9605076,0.00014727125,0.00012156967,0.00023805842,0.000035968293,0.0020947282,0.005271741],"genre_scores_gemma":[0.4243322,0.00018761594,0.5680252,0.00017390071,0.000042907457,0.00039862018,0.00014131666,0.00040748128,0.006290796],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989015,0.0002715891,0.000095288015,0.00017380706,0.00038250812,0.00017540695],"domain_scores_gemma":[0.99838424,0.00030128608,0.00010758579,0.00043853596,0.0005888621,0.00017945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001194098,0.0004783048,0.0005693932,0.00030654628,0.00041766922,0.0013853665,0.0017535866,0.00047413356,0.0035248369],"category_scores_gemma":[0.0018196764,0.0004685388,0.0006256346,0.00020411768,0.0005859193,0.0010149276,0.00094222586,0.0010594815,0.0009876795],"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.0016738534,0.0005637611,0.0035953827,0.0012008068,0.00033270617,0.0006553204,0.0005253426,0.17773591,0.26430982,0.086371005,0.007413537,0.4556226],"study_design_scores_gemma":[0.00032724967,0.0014200782,0.0019143596,0.00009464981,0.00023724443,0.0007611156,0.00009276469,0.7598114,0.14803919,0.019256497,0.06796375,0.00008174207],"about_ca_topic_score_codex":0.00049582275,"about_ca_topic_score_gemma":0.00066312926,"teacher_disagreement_score":0.0035248369,"about_ca_system_score_codex":0.0004355641,"about_ca_system_score_gemma":0.0011990332,"threshold_uncertainty_score":0.011791766},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02081851,0.00024383228,0.9431554,0.0019017279,0.00028930267,0.00022169655,0.0001427015,0.001147294,0.032079633],"genre_scores_gemma":[0.6649738,0.00063624716,0.3078904,0.0018890351,0.0004978438,0.0005727303,0.00063584803,0.0006189674,0.022285145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962423,0.0005724184,0.00022201211,0.00047892414,0.0017311614,0.00075319695],"domain_scores_gemma":[0.9930937,0.0031037726,0.000583531,0.0013001161,0.001725621,0.00019325162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045915092,0.00075193524,0.000546732,0.0012336064,0.0018890026,0.002600532,0.0017897306,0.0015952748,0.009362234],"category_scores_gemma":[0.013234599,0.0007666156,0.0014139378,0.00088624266,0.006262103,0.006373338,0.002426083,0.0030248684,0.0020632383],"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.000020828116,0.000041701565,0.0001966056,0.000064441905,0.00000865497,0.00013165895,0.00018746288,0.0028141458,0.001453519,0.9875399,0.0012629121,0.006278319],"study_design_scores_gemma":[0.00005117075,0.00008983375,0.00029726265,0.00008846083,0.000047039837,0.00039261093,0.00015958647,0.028989887,0.011000786,0.9294254,0.029415164,0.00004278229],"about_ca_topic_score_codex":0.002327654,"about_ca_topic_score_gemma":0.0015812682,"teacher_disagreement_score":0.009362234,"about_ca_system_score_codex":0.0017713543,"about_ca_system_score_gemma":0.0030067777,"threshold_uncertainty_score":0.031319737},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012411184,0.006884198,0.96434945,0.0020824573,0.00012013682,0.000058562906,0.00015794941,0.0003318229,0.013604279],"genre_scores_gemma":[0.573159,0.0142170135,0.3937478,0.0012295273,0.001036331,0.0008976921,0.00051686825,0.0010075367,0.014188295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964295,0.0011002095,0.00017096527,0.00058895367,0.0012364852,0.00047390372],"domain_scores_gemma":[0.98640174,0.010853736,0.0008086861,0.0012055623,0.0004877622,0.00024256788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036371131,0.0026759785,0.0018865723,0.0017406191,0.0010574864,0.00708842,0.0028421555,0.0036572842,0.0048956834],"category_scores_gemma":[0.019517792,0.0014514585,0.0018413126,0.0036262083,0.003936757,0.011814101,0.0025434084,0.006047697,0.0014335669],"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.00008842652,0.00009323167,0.0003752023,0.00018761645,0.00004889206,0.00005056013,0.00011617972,0.43238193,0.0011991186,0.54096913,0.0022929292,0.022196794],"study_design_scores_gemma":[0.000012227515,0.000018318444,0.000074397576,0.000034066466,0.000015532923,0.000032729266,0.000017827513,0.5898505,0.0005406003,0.40737563,0.0020142575,0.000013892889],"about_ca_topic_score_codex":0.0023151173,"about_ca_topic_score_gemma":0.002575302,"teacher_disagreement_score":0.00708842,"about_ca_system_score_codex":0.0040373146,"about_ca_system_score_gemma":0.0017145983,"threshold_uncertainty_score":0.029292941},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3492645,0.0007171795,0.60612553,0.0002356193,0.00017476475,0.00035895102,0.00028590887,0.034987304,0.007850304],"genre_scores_gemma":[0.79423195,0.000094624214,0.19987872,0.00015413495,0.000034281704,0.00026323262,0.00040821897,0.0011371747,0.003797705],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992304,0.00012804796,0.00005977577,0.0001294309,0.0003160688,0.00013633522],"domain_scores_gemma":[0.99798065,0.0005634432,0.00029262702,0.00073599344,0.00033261735,0.00009464254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005871771,0.0006505018,0.00038651802,0.00045203936,0.00047115952,0.000487021,0.0015685905,0.00041914437,0.0026719563],"category_scores_gemma":[0.0020374274,0.0003248323,0.00035669084,0.000487485,0.0006750861,0.0007792862,0.0010380805,0.00083564594,0.00059719646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025750154,0.00053186156,0.008455624,0.00068702287,0.0001542886,0.0010959137,0.00053526805,0.14413825,0.4950605,0.021857908,0.0204743,0.30443406],"study_design_scores_gemma":[0.00022807378,0.001067618,0.0018320669,0.000027475591,0.00008937274,0.0004510257,0.00006880427,0.49233064,0.48050448,0.0037474686,0.019581331,0.000071695176],"about_ca_topic_score_codex":0.001869939,"about_ca_topic_score_gemma":0.0033568575,"teacher_disagreement_score":0.0026719563,"about_ca_system_score_codex":0.0005254744,"about_ca_system_score_gemma":0.0015216041,"threshold_uncertainty_score":0.008938611},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1468416,0.0018518909,0.7496734,0.0003127439,0.00020492806,0.0008195516,0.0009132393,0.03718843,0.062194172],"genre_scores_gemma":[0.38936198,0.0006675837,0.5791267,0.0002588829,0.000040165112,0.00060855184,0.0024979683,0.0018682164,0.025569879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975246,0.00004403063,0.000018570967,0.000032887252,0.000120976605,0.000031019477],"domain_scores_gemma":[0.9997656,0.000050135008,0.000039960396,0.00004333902,0.00007690949,0.000024107352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002942928,0.0006649839,0.0002603559,0.00048774364,0.00023583251,0.0005049577,0.0008181012,0.00023431337,0.011293099],"category_scores_gemma":[0.00071166025,0.0002829681,0.00027058105,0.00038416314,0.00023052277,0.00060121674,0.0005467161,0.00043457377,0.0021687134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013217048,0.00021014446,0.0048012147,0.00090314244,0.00010503932,0.00063492765,0.00039172007,0.030613212,0.2000613,0.017315192,0.05526544,0.6883769],"study_design_scores_gemma":[0.0008862599,0.0019303221,0.004812663,0.00014911927,0.00014975033,0.0016136982,0.00020004628,0.3527785,0.36058286,0.008895147,0.2678641,0.00013765354],"about_ca_topic_score_codex":0.000781848,"about_ca_topic_score_gemma":0.002164185,"teacher_disagreement_score":0.011293099,"about_ca_system_score_codex":0.00030884732,"about_ca_system_score_gemma":0.00081564503,"threshold_uncertainty_score":0.037779212},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006476807,0.00063979864,0.9734284,0.00020152098,0.00012298985,0.00012332282,0.0001432458,0.0028291282,0.01603483],"genre_scores_gemma":[0.23237391,0.0010775474,0.75254554,0.00029597283,0.00008331777,0.00045896022,0.0005429619,0.00075755466,0.011864225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995541,0.000095709765,0.00003229738,0.00004451223,0.00022693217,0.00004652069],"domain_scores_gemma":[0.999602,0.00017846767,0.000028152343,0.00008213894,0.00009670629,0.000012532287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056154537,0.00048177002,0.00030617564,0.0005032435,0.00036460816,0.000933256,0.00057387416,0.0004941612,0.0072208205],"category_scores_gemma":[0.0012648224,0.00039376793,0.0005017842,0.0003621151,0.00040082863,0.00067810446,0.00050960615,0.00073609146,0.0019966967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027596336,0.00014537324,0.00082298927,0.00091310847,0.00007314965,0.00041532548,0.00038866702,0.20542495,0.13013245,0.36233267,0.014082489,0.2849928],"study_design_scores_gemma":[0.00014379421,0.0002961035,0.00029331894,0.00021419575,0.00006069059,0.00026540938,0.00006173758,0.6175066,0.09742225,0.12087384,0.16281137,0.00005074115],"about_ca_topic_score_codex":0.0008539293,"about_ca_topic_score_gemma":0.0012982257,"teacher_disagreement_score":0.0072208205,"about_ca_system_score_codex":0.00060532405,"about_ca_system_score_gemma":0.0008075024,"threshold_uncertainty_score":0.024156094},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022471715,0.0003949492,0.9299259,0.00019230125,0.00010558352,0.00019165475,0.000849463,0.037471112,0.0083972905],"genre_scores_gemma":[0.22583392,0.00044407873,0.7541251,0.00028371465,0.000049906597,0.00068696117,0.0017892558,0.0044755167,0.012311498],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995766,0.000073229676,0.000032630247,0.00005790823,0.00021728856,0.000042263902],"domain_scores_gemma":[0.9985702,0.000751309,0.000113849885,0.0002400167,0.00027655382,0.000048118796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052857836,0.0007955832,0.00043885683,0.00065333536,0.00036760373,0.00077184546,0.0025106107,0.0009993484,0.011836271],"category_scores_gemma":[0.0029121647,0.00053534127,0.00034585275,0.00053693366,0.00036447556,0.00091736636,0.00090865156,0.0012157751,0.0019272986],"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.0014993162,0.00032124136,0.0019218775,0.0015235299,0.00014843917,0.0013720245,0.00043682198,0.136005,0.201012,0.02761345,0.054163404,0.5739829],"study_design_scores_gemma":[0.00049384544,0.00042596017,0.0011911026,0.00013822869,0.00008167565,0.0012699036,0.000034997283,0.6635823,0.23113689,0.016827838,0.08468901,0.00012836474],"about_ca_topic_score_codex":0.00065942446,"about_ca_topic_score_gemma":0.0012182577,"teacher_disagreement_score":0.011836271,"about_ca_system_score_codex":0.00036513616,"about_ca_system_score_gemma":0.0006324653,"threshold_uncertainty_score":0.03959626},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009091505,0.00006010542,0.994565,0.000028024644,0.000012776183,0.00006763115,0.000029364308,0.002774989,0.0015529579],"genre_scores_gemma":[0.027447287,0.00029603875,0.9674444,0.000079092984,0.000029783767,0.00045795421,0.0002239529,0.00079111586,0.0032303424],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993088,0.00009233249,0.00005181473,0.000087314664,0.0004007311,0.000059021037],"domain_scores_gemma":[0.9990589,0.0004047969,0.00006849641,0.00014898414,0.0002863292,0.000032512173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075112813,0.0011657181,0.0005152537,0.00080948585,0.00043184782,0.0009439505,0.0019446153,0.0006639605,0.008952929],"category_scores_gemma":[0.0021345334,0.00064418704,0.0006785432,0.0007858516,0.0006785687,0.0011500206,0.0009172597,0.0019195972,0.0036181184],"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.000327588,0.00024165193,0.001076312,0.0010777541,0.00010138491,0.00047950912,0.0004659211,0.07133411,0.103363745,0.117513336,0.017584031,0.6864347],"study_design_scores_gemma":[0.0002675072,0.0004643647,0.0008004693,0.00022515551,0.00011654698,0.0015766046,0.00008093232,0.6273835,0.12529856,0.06645629,0.17722322,0.000106947286],"about_ca_topic_score_codex":0.001067041,"about_ca_topic_score_gemma":0.0009241848,"teacher_disagreement_score":0.008952929,"about_ca_system_score_codex":0.00045175676,"about_ca_system_score_gemma":0.0011559332,"threshold_uncertainty_score":0.0299505},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011692981,0.00015077383,0.9889774,0.00021074228,0.000054157324,0.00010573832,0.00016551973,0.006628006,0.0025382908],"genre_scores_gemma":[0.09540235,0.0003903483,0.8955557,0.00026338012,0.0001314591,0.00064511644,0.0014793708,0.0011646992,0.004967661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998833,0.00026325352,0.000113119124,0.00016002989,0.0005105805,0.00012003884],"domain_scores_gemma":[0.9986376,0.0003411199,0.000075832184,0.00043463017,0.00031561658,0.00019516806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026107384,0.00054039183,0.0007526517,0.00123831,0.0011093123,0.0032908893,0.0031685173,0.0012115043,0.0056518097],"category_scores_gemma":[0.0041639954,0.0005216206,0.00059299247,0.0011631891,0.001009823,0.002436968,0.0030178635,0.0017061547,0.0022356566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035874604,0.00024489357,0.0015933454,0.0003022743,0.00011940851,0.00041077915,0.0005012647,0.17451055,0.012814379,0.37411547,0.048816677,0.3862122],"study_design_scores_gemma":[0.0000889286,0.00006044138,0.00021797972,0.000053122356,0.000026430225,0.00017232864,0.00006121021,0.7379729,0.0059991013,0.09928462,0.15600199,0.000060974882],"about_ca_topic_score_codex":0.004232419,"about_ca_topic_score_gemma":0.0048266468,"teacher_disagreement_score":0.0056518097,"about_ca_system_score_codex":0.0011968748,"about_ca_system_score_gemma":0.0026303327,"threshold_uncertainty_score":0.01890719},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07157147,0.0030323905,0.8281838,0.0007679656,0.00045274704,0.00045462308,0.00073618744,0.021082634,0.07371804],"genre_scores_gemma":[0.2075608,0.002060756,0.7672039,0.00025535366,0.00012418874,0.00053326006,0.0016373108,0.0024694146,0.018154941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998447,0.00032155344,0.00009609434,0.00012389236,0.00086187513,0.00014966479],"domain_scores_gemma":[0.9975635,0.00079643645,0.00015273353,0.00057755265,0.00080554764,0.00010424933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014008498,0.0007455422,0.0008622047,0.0010752026,0.0007307164,0.0018172563,0.0025052559,0.00064139196,0.008259633],"category_scores_gemma":[0.0053853667,0.00045498705,0.0003822394,0.0028032067,0.00047624414,0.0018951677,0.0011384804,0.0009810489,0.002313488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023177182,0.00056117785,0.0036626225,0.00051072927,0.0001581651,0.00021472063,0.00020807468,0.18312483,0.00629306,0.03890731,0.023336565,0.7407051],"study_design_scores_gemma":[0.00048826437,0.0004428855,0.0025856318,0.000104510575,0.00013885494,0.00035574636,0.00021015534,0.88036627,0.016914204,0.024416368,0.07391388,0.000063199026],"about_ca_topic_score_codex":0.005137144,"about_ca_topic_score_gemma":0.0050289817,"teacher_disagreement_score":0.008259633,"about_ca_system_score_codex":0.0007876723,"about_ca_system_score_gemma":0.0017022346,"threshold_uncertainty_score":0.027631223},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9851613,0.0004438261,0.010630707,0.00016950261,0.00004494243,0.000053728756,0.000027290045,0.0009202757,0.00254842],"genre_scores_gemma":[0.9932401,0.000092275506,0.00587979,0.000038227678,0.000011604618,0.000024494593,0.000037630314,0.000078477315,0.00059737416],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968652,0.0011845727,0.00026377177,0.00021580717,0.001186531,0.0002839983],"domain_scores_gemma":[0.9834247,0.00986898,0.0017907409,0.0025806546,0.0019690664,0.00036581856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002935528,0.0009003746,0.00040335098,0.00051226694,0.0011874813,0.00113743,0.0014620835,0.0006757653,0.0010827848],"category_scores_gemma":[0.015916046,0.00046894923,0.00024111943,0.0006283949,0.00094193325,0.0023212668,0.0012937328,0.00088081893,0.00020578929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003597546,0.0010373032,0.043373473,0.001052861,0.00026079256,0.0023140819,0.0021801603,0.3142726,0.4388449,0.010614451,0.0033996461,0.17905207],"study_design_scores_gemma":[0.00023405254,0.004556339,0.018341294,0.000069281334,0.00035728852,0.0017865301,0.0011078398,0.5689957,0.39338207,0.004759285,0.0062602777,0.0001500846],"about_ca_topic_score_codex":0.0013879039,"about_ca_topic_score_gemma":0.0015312574,"teacher_disagreement_score":0.002935528,"about_ca_system_score_codex":0.0007213606,"about_ca_system_score_gemma":0.00092227024,"threshold_uncertainty_score":0.015524745},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60544395,0.0004265618,0.38339943,0.00013582155,0.00008317512,0.0001529358,0.00017158488,0.004067476,0.006119092],"genre_scores_gemma":[0.8347431,0.0000683645,0.16316454,0.000043450185,0.000016823165,0.000059975722,0.00010015721,0.000047481368,0.001756072],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998466,0.000025578653,0.000010294242,0.000051500872,0.000035841247,0.000030180265],"domain_scores_gemma":[0.99964833,0.000093081006,0.000045584624,0.00009995661,0.00007163457,0.000041308263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002302991,0.0001747875,0.00028875947,0.0002138847,0.00028103424,0.00039328096,0.0013963651,0.0002986803,0.0025207598],"category_scores_gemma":[0.00041257346,0.00014406769,0.0002069453,0.00018505275,0.00018796798,0.0004388828,0.00020646106,0.0002526211,0.0005144032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011043753,0.0003805699,0.004188687,0.00047713972,0.00013355444,0.00047372107,0.00019653392,0.073033996,0.7056604,0.009381292,0.0031827567,0.20178698],"study_design_scores_gemma":[0.0002920042,0.002829859,0.003458949,0.000030888223,0.00019254815,0.0007064847,0.00006561338,0.61862445,0.35872948,0.0015179319,0.013484528,0.00006726127],"about_ca_topic_score_codex":0.00066570455,"about_ca_topic_score_gemma":0.0013209154,"teacher_disagreement_score":0.0025207598,"about_ca_system_score_codex":0.00033156932,"about_ca_system_score_gemma":0.0005405773,"threshold_uncertainty_score":0.008432806},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5212232,0.00082745636,0.45760998,0.0010031782,0.000065609805,0.00005751406,0.0005910539,0.008763188,0.009858911],"genre_scores_gemma":[0.83067745,0.00053539476,0.16540304,0.0000573499,0.000017995795,0.00003825912,0.00036596888,0.00061234384,0.002292163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999879,0.000034529847,0.000005264076,0.00001664438,0.00004796469,0.000016621807],"domain_scores_gemma":[0.9996234,0.00019598419,0.000041673597,0.000041577925,0.000057512407,0.000039700728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029631765,0.0003872252,0.00021865904,0.0009060709,0.00031583532,0.00083824655,0.0004442889,0.00038265984,0.0021983876],"category_scores_gemma":[0.0011696507,0.0002386955,0.00025909574,0.0005455342,0.00033237576,0.000965732,0.0007546822,0.0005224013,0.00019042149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000510645,0.00016199905,0.017844196,0.0003856569,0.00013867115,0.001096051,0.0038166877,0.52010024,0.14788046,0.044244226,0.014446317,0.24937491],"study_design_scores_gemma":[0.00003153727,0.00005441959,0.0074587734,0.00003111247,0.000020096344,0.00026301533,0.00035850267,0.9515018,0.01678577,0.013462359,0.009991499,0.00004117914],"about_ca_topic_score_codex":0.0028752594,"about_ca_topic_score_gemma":0.0029593587,"teacher_disagreement_score":0.0028752594,"about_ca_system_score_codex":0.00036191268,"about_ca_system_score_gemma":0.000417753,"threshold_uncertainty_score":0.0073543787},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083243035,0.003864654,0.9027722,0.00027565003,0.0001492634,0.00009054302,0.00012770122,0.0032028796,0.006273931],"genre_scores_gemma":[0.59025055,0.0013396724,0.39824647,0.0001522763,0.00011080671,0.00016153972,0.00023730313,0.000474673,0.00902669],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997149,0.00007524863,0.000021939217,0.00005613713,0.000083372506,0.000048329675],"domain_scores_gemma":[0.99958855,0.0001779208,0.000065102606,0.00008754783,0.000063655665,0.000017255128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036946422,0.0005908076,0.00047910496,0.00067955104,0.00031530458,0.0007479399,0.0010943605,0.00040051236,0.0033139312],"category_scores_gemma":[0.0012195319,0.00022886996,0.00029975633,0.0009094463,0.0002744743,0.0017473715,0.0005140246,0.00037232682,0.00057125767],"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.0010654425,0.00024673605,0.0015243329,0.00030484924,0.00013208996,0.0001841448,0.00018925253,0.25288123,0.15129949,0.046619713,0.0058077946,0.5397449],"study_design_scores_gemma":[0.00017754827,0.0005154736,0.0008429747,0.000029861714,0.00016566165,0.00031495307,0.00006479261,0.821783,0.1384665,0.014374348,0.023192868,0.00007204272],"about_ca_topic_score_codex":0.001027383,"about_ca_topic_score_gemma":0.0018487332,"teacher_disagreement_score":0.0033139312,"about_ca_system_score_codex":0.00037566558,"about_ca_system_score_gemma":0.0006939919,"threshold_uncertainty_score":0.0110862255},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020044068,0.00025874478,0.96698606,0.00020568348,0.000081859565,0.00008209911,0.000091013,0.0072814254,0.0049689044],"genre_scores_gemma":[0.25807488,0.00029197647,0.7339957,0.00012457164,0.000067922796,0.00025540483,0.0004945067,0.0020936534,0.004601421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870515,0.00028129754,0.0000836848,0.00022844173,0.0005400698,0.00016139683],"domain_scores_gemma":[0.99882895,0.00040851472,0.00009489651,0.00031658547,0.00031421764,0.00003677304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000841153,0.0010250219,0.0007863138,0.0009489377,0.0008352598,0.001460557,0.0015170887,0.0005381356,0.0033468558],"category_scores_gemma":[0.00373901,0.0005464767,0.00081222533,0.0012999703,0.0007921966,0.001746373,0.0012132394,0.0012420056,0.0012922179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005686099,0.0001262912,0.002391003,0.00031786095,0.00006869399,0.0002107968,0.00029497128,0.29189965,0.0447613,0.13462913,0.022288853,0.50244284],"study_design_scores_gemma":[0.00004349431,0.000023660485,0.00023949926,0.0000132301575,0.000008790789,0.000036926205,0.000017000499,0.94866425,0.012261433,0.031817343,0.0068633566,0.00001109428],"about_ca_topic_score_codex":0.003292596,"about_ca_topic_score_gemma":0.004830132,"teacher_disagreement_score":0.0033468558,"about_ca_system_score_codex":0.0013816785,"about_ca_system_score_gemma":0.0015203586,"threshold_uncertainty_score":0.011196375},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043505445,0.00029797395,0.9252097,0.00023561431,0.00008771227,0.00008333205,0.00023910114,0.0071926937,0.0231485],"genre_scores_gemma":[0.35582188,0.0002628624,0.63132125,0.00016098487,0.00008105303,0.00020479165,0.0006012053,0.00094411505,0.010601889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992724,0.00018647261,0.00005173073,0.00008819741,0.00028396226,0.00011727662],"domain_scores_gemma":[0.9992805,0.00022944059,0.000055701927,0.0002452765,0.00013822167,0.000050869334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008340306,0.00038297984,0.00061231497,0.0004560037,0.0008207318,0.0012214244,0.001459975,0.0003369144,0.0064019132],"category_scores_gemma":[0.0014570722,0.00022239199,0.0006519933,0.00063864276,0.000739931,0.001938347,0.0013504325,0.0008455209,0.0014750276],"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.0004348442,0.00017783008,0.0016201336,0.00038111652,0.00004678436,0.0004190757,0.00045982166,0.09875686,0.035511058,0.64567417,0.011524279,0.20499398],"study_design_scores_gemma":[0.00012122835,0.00022954757,0.0005882398,0.00004940648,0.000031046166,0.0002014976,0.00011991706,0.70225734,0.04617517,0.17669,0.073464364,0.000072228904],"about_ca_topic_score_codex":0.0016788467,"about_ca_topic_score_gemma":0.0038354723,"teacher_disagreement_score":0.0064019132,"about_ca_system_score_codex":0.0007989408,"about_ca_system_score_gemma":0.001002724,"threshold_uncertainty_score":0.021416605},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70399874,0.00048610635,0.27593887,0.0003255921,0.00019371515,0.0007100871,0.00068994076,0.008715574,0.00894144],"genre_scores_gemma":[0.8562976,0.000117367694,0.13898025,0.00008487428,0.000018533146,0.00027607766,0.00061652734,0.00015307487,0.0034556855],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99973863,0.00005504393,0.000018463343,0.000044418157,0.00007813493,0.000065225235],"domain_scores_gemma":[0.99939644,0.00017380863,0.00003922772,0.00012076031,0.00019704923,0.00007274736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034801583,0.0003940766,0.0003913896,0.00037533086,0.0002830774,0.00049850764,0.0021628612,0.00043696773,0.008284771],"category_scores_gemma":[0.00070778903,0.00024734653,0.00020344752,0.0003464793,0.00024108311,0.0007700231,0.00027388535,0.00061616034,0.0010397161],"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.0035357883,0.0013304292,0.004587134,0.0011553806,0.0002409513,0.001037204,0.00036354642,0.040438168,0.75137264,0.008847009,0.008295975,0.17879575],"study_design_scores_gemma":[0.0012176352,0.008041825,0.0058731455,0.00006115789,0.00020489322,0.0009562271,0.00020274731,0.29903114,0.66624624,0.002053973,0.016014935,0.000096119664],"about_ca_topic_score_codex":0.00082493597,"about_ca_topic_score_gemma":0.000899383,"teacher_disagreement_score":0.008284771,"about_ca_system_score_codex":0.00030232128,"about_ca_system_score_gemma":0.0006337974,"threshold_uncertainty_score":0.027715325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012360604,0.0011812677,0.95961833,0.0019606366,0.00017654219,0.00018658026,0.00034135085,0.0005422885,0.023632443],"genre_scores_gemma":[0.32636493,0.0036680377,0.6315086,0.0009270166,0.00048841845,0.0022785128,0.0009310505,0.00087113224,0.032962214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991775,0.00022710145,0.00003649431,0.00007222946,0.00040322836,0.00008344188],"domain_scores_gemma":[0.9982778,0.001069838,0.00015961363,0.000116180985,0.00029857171,0.00007803169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001325872,0.0009526296,0.00074927614,0.0006490564,0.0007931367,0.001312062,0.0021392892,0.001333029,0.0047091837],"category_scores_gemma":[0.004430403,0.0006089157,0.001380078,0.00097017194,0.0009964942,0.0023375333,0.0014535196,0.0025022132,0.00077110657],"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.000017168275,0.00004138535,0.00020544905,0.00008621427,0.000017719845,0.00008083054,0.00009883468,0.7246116,0.0006552762,0.2642203,0.00323083,0.0067343954],"study_design_scores_gemma":[0.000008200759,0.0000060403713,0.00003304235,0.0000074105637,0.000002639993,0.0000115181565,0.000009345798,0.95265454,0.00008415391,0.044997294,0.0021824567,0.0000034201796],"about_ca_topic_score_codex":0.0055901026,"about_ca_topic_score_gemma":0.00552548,"teacher_disagreement_score":0.0055901026,"about_ca_system_score_codex":0.001236869,"about_ca_system_score_gemma":0.0017965466,"threshold_uncertainty_score":0.015753806},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32235825,0.001195399,0.6596077,0.0005432103,0.00008007104,0.00008198442,0.00011658059,0.0034998772,0.012516938],"genre_scores_gemma":[0.8875708,0.00040504223,0.10468177,0.0001214025,0.00004002907,0.000060259696,0.0001365461,0.00028831098,0.006695832],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998561,0.00001817781,0.0000076032643,0.000025670293,0.000059072907,0.000033268967],"domain_scores_gemma":[0.9998216,0.000044182118,0.000041317868,0.000039932733,0.000040534127,0.000012472293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018107385,0.00043283217,0.0002304698,0.0003631304,0.00026237962,0.00034642316,0.00069984386,0.00020562492,0.0028274443],"category_scores_gemma":[0.00051933085,0.00018748235,0.0001664157,0.0005389012,0.00023132884,0.00092492474,0.00040090352,0.0003097036,0.00052969856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003402059,0.00017202797,0.0021156382,0.00021429491,0.00003582471,0.00014955616,0.00011301835,0.0685895,0.5874286,0.017023258,0.0038227695,0.31999522],"study_design_scores_gemma":[0.00013281833,0.00081129954,0.0035401962,0.000027796143,0.00007707606,0.00042564896,0.000074320815,0.6568104,0.2802505,0.033156373,0.024652991,0.000040547267],"about_ca_topic_score_codex":0.0006705,"about_ca_topic_score_gemma":0.0014471634,"teacher_disagreement_score":0.0028274443,"about_ca_system_score_codex":0.00030826134,"about_ca_system_score_gemma":0.0004725996,"threshold_uncertainty_score":0.009458721},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003075825,0.000042111566,0.99465334,0.000026883194,0.000017264347,0.000056986944,0.00006222007,0.0013578743,0.0007074691],"genre_scores_gemma":[0.26237282,0.00019732598,0.73388577,0.00007770828,0.000041969037,0.00033276156,0.00040803006,0.00044007253,0.0022434893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983394,0.0004511252,0.00017160627,0.00028739902,0.00063571363,0.00011463996],"domain_scores_gemma":[0.9961849,0.0019172748,0.00022427605,0.0008438379,0.0007491534,0.00008056847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009333752,0.0009819298,0.00080151553,0.0024188212,0.0006687986,0.0015182905,0.0020963736,0.0008413053,0.0033664673],"category_scores_gemma":[0.006028071,0.0005120751,0.0012885978,0.00092708727,0.001154405,0.0020201893,0.0012336611,0.0016838514,0.00095068285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033472202,0.000345175,0.0058376393,0.0005088924,0.00031238617,0.0006712971,0.000664715,0.45499283,0.040321775,0.24158274,0.002832205,0.25159568],"study_design_scores_gemma":[0.000009592364,0.000038144488,0.00020893736,0.000023865547,0.000031735704,0.000091546826,0.000035816796,0.9483519,0.0078043444,0.040069945,0.0033082217,0.000025944202],"about_ca_topic_score_codex":0.004098403,"about_ca_topic_score_gemma":0.0034822393,"teacher_disagreement_score":0.004098403,"about_ca_system_score_codex":0.0011355284,"about_ca_system_score_gemma":0.0013331559,"threshold_uncertainty_score":0.01126194},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0378544,0.003403872,0.56323045,0.0011168058,0.0010577267,0.00075030944,0.0019147166,0.33652252,0.054149184],"genre_scores_gemma":[0.43841586,0.0018320753,0.4688559,0.00163948,0.00039594664,0.00087168586,0.008431948,0.02858121,0.050975878],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966434,0.00045470597,0.00027884034,0.00084274943,0.0013387755,0.00044156934],"domain_scores_gemma":[0.99109685,0.002315859,0.0010722531,0.0035667727,0.001521199,0.0004270134],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001935976,0.001976203,0.0009534795,0.0021603557,0.0009529401,0.0028533835,0.004195487,0.0014742701,0.018855602],"category_scores_gemma":[0.012834426,0.0015249171,0.0014093368,0.0007721985,0.0013051704,0.0054645976,0.003993691,0.0029986624,0.013680108],"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.0019301393,0.0005221273,0.013707673,0.0020226133,0.00044655445,0.0007450816,0.0009122655,0.014480823,0.062314488,0.04284543,0.1179557,0.7421171],"study_design_scores_gemma":[0.00057609176,0.0018936386,0.007834997,0.0006639998,0.00063334475,0.004516482,0.00031023182,0.21801989,0.15847139,0.07196389,0.5345573,0.0005587515],"about_ca_topic_score_codex":0.0015543173,"about_ca_topic_score_gemma":0.0021853682,"teacher_disagreement_score":0.9811444,"about_ca_system_score_codex":0.00082571845,"about_ca_system_score_gemma":0.002089318,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016774088,0.00019001272,0.89066195,0.00032693136,0.00024647417,0.00023920421,0.0010759259,0.07916584,0.011319559],"genre_scores_gemma":[0.20909673,0.00042548578,0.75930053,0.00025533652,0.00015910891,0.001013785,0.004755887,0.006565018,0.018428082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945575,0.00008262027,0.000051260475,0.000067627065,0.00024723884,0.00009552565],"domain_scores_gemma":[0.9991918,0.0001324436,0.00005460283,0.00031670165,0.00022771934,0.00007669767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064268365,0.0010819208,0.0006050602,0.0011589315,0.0012783258,0.0010422252,0.0029066065,0.00075480976,0.010079542],"category_scores_gemma":[0.0019278086,0.00069446396,0.0008245689,0.0010961138,0.00045023725,0.0012377247,0.0016203028,0.0015658544,0.0032938588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016584211,0.00040995813,0.008526098,0.00093372713,0.0004851461,0.0014559318,0.0009109573,0.065699324,0.07788162,0.054195266,0.19888908,0.5889545],"study_design_scores_gemma":[0.000540306,0.00040303916,0.002985796,0.00007853091,0.00011326724,0.00066809164,0.00014317707,0.7148359,0.08372921,0.020545596,0.17579275,0.00016437011],"about_ca_topic_score_codex":0.003284291,"about_ca_topic_score_gemma":0.004161086,"teacher_disagreement_score":0.010079542,"about_ca_system_score_codex":0.0006058525,"about_ca_system_score_gemma":0.00092080917,"threshold_uncertainty_score":0.03371942},"labels":[],"label_agreement":null},{"id":"W2136271630","doi":"10.1145/1925844.1926389","title":"Points-to analysis with efficient strong updates","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Singleton; Flow (mathematics); Set (abstract data type); Program analysis; Compiler; Sensitivity (control systems); Abstract interpretation; Optimizing compiler; Key (lock); Static analysis; Quadratic equation; Theoretical computer science; Algorithm; Programming language; Mathematics; Operating system","score_opus":0.027640971344499457,"score_gpt":0.2537133634451165,"score_spread":0.22607239210061708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136271630","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017984217,0.00008439709,0.9734561,0.00020513138,0.00005076327,0.00011208139,0.00011491727,0.004809021,0.0031833486],"genre_scores_gemma":[0.44040075,0.00023928814,0.54837817,0.0005828112,0.00018018043,0.00040920687,0.00045580592,0.003019627,0.006334098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99403846,0.0011468178,0.0003647561,0.0007859827,0.0029910272,0.0006729275],"domain_scores_gemma":[0.9890771,0.0042853625,0.0006110376,0.0043791267,0.0014998065,0.00014762634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032680768,0.0015646487,0.0013902534,0.0022838982,0.0011787394,0.0034297295,0.0035122177,0.001198064,0.0042863493],"category_scores_gemma":[0.015810547,0.0013707784,0.0022578288,0.0016958759,0.0024682153,0.0067917584,0.0045677484,0.0036276837,0.0013093686],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010533638,0.00021191887,0.0039187004,0.00039650928,0.00019536098,0.00045469005,0.0008065783,0.2346834,0.029520283,0.4469466,0.0067248875,0.27508768],"study_design_scores_gemma":[0.00006710375,0.00014417688,0.00036985,0.00006133357,0.00013760552,0.0001344125,0.000086383996,0.6126601,0.0444533,0.33210388,0.009719243,0.000062660765],"about_ca_topic_score_codex":0.002177903,"about_ca_topic_score_gemma":0.0021231994,"teacher_disagreement_score":0.0042863493,"about_ca_system_score_codex":0.0013118677,"about_ca_system_score_gemma":0.0019855327,"threshold_uncertainty_score":0.01728344},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45177522,0.0026613974,0.52216434,0.0010089481,0.00036436063,0.0002817715,0.00019770555,0.011985876,0.009560471],"genre_scores_gemma":[0.7792402,0.0006370781,0.21567936,0.0002006696,0.000055705546,0.00007672636,0.00020937678,0.00042614195,0.0034747275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987997,0.00037332324,0.00010468187,0.00011381417,0.0004660594,0.00014253292],"domain_scores_gemma":[0.99667144,0.0008026588,0.0002066997,0.0017377796,0.0004176934,0.00016356907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090824737,0.00043858626,0.00034897236,0.0004229296,0.0005885673,0.0014819419,0.0018766865,0.00040166688,0.0019011056],"category_scores_gemma":[0.004234765,0.00051968766,0.00033989185,0.0006325663,0.0009412191,0.0029462553,0.0015428786,0.0008477354,0.00051565946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011059353,0.0003745479,0.016122712,0.0007937248,0.00011110556,0.0007087003,0.0010282637,0.1453639,0.12816449,0.09334401,0.010555178,0.6023275],"study_design_scores_gemma":[0.00016293942,0.0014011338,0.0049634236,0.0001609946,0.00011415278,0.0007975194,0.0003834403,0.77953404,0.103344105,0.03441409,0.07460587,0.00011825968],"about_ca_topic_score_codex":0.0019101395,"about_ca_topic_score_gemma":0.0045257844,"teacher_disagreement_score":0.0019101395,"about_ca_system_score_codex":0.0004513143,"about_ca_system_score_gemma":0.0015939531,"threshold_uncertainty_score":0.006359875},"labels":[],"label_agreement":null},{"id":"W2136605135","doi":"10.1016/s0167-6423(02)00059-x","title":"Extracting Java library subsets for deployment on embedded systems","year":2002,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Russian Science Foundation","keywords":"Computer science; Java; Vendor; Real time Java; Software deployment; Operating system; Java annotation; Embedded system; Programming language","score_opus":0.033097929753995725,"score_gpt":0.2732840682834196,"score_spread":0.2401861385294239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136605135","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40292633,0.0006474679,0.53745085,0.0006027489,0.00015787325,0.00034644,0.0053721503,0.039321337,0.013174824],"genre_scores_gemma":[0.46283317,0.0004580544,0.5070058,0.0001148808,0.00006748968,0.00025354238,0.015730469,0.007767199,0.005769388],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994804,0.00006513462,0.000055131306,0.00010668348,0.00018318693,0.00010951848],"domain_scores_gemma":[0.99813545,0.0005519209,0.0001938186,0.0005481353,0.00046158192,0.00010908911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003252271,0.0012399731,0.0010406352,0.0023050397,0.00072215335,0.0011640121,0.001037055,0.00063298305,0.0054660724],"category_scores_gemma":[0.0036424757,0.001037647,0.0011309804,0.0025498061,0.00031156166,0.0024694472,0.000970538,0.0008580482,0.0035051988],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016669686,0.00035456067,0.018925779,0.0008793364,0.00008985116,0.0014204071,0.00076525816,0.020212416,0.14384027,0.007196656,0.030675052,0.77397335],"study_design_scores_gemma":[0.0004549179,0.00088308565,0.02732151,0.00024248847,0.00048673464,0.0016654081,0.0021555373,0.5736967,0.29037508,0.028698148,0.07386692,0.00015358247],"about_ca_topic_score_codex":0.0020861053,"about_ca_topic_score_gemma":0.0041415347,"teacher_disagreement_score":0.0054660724,"about_ca_system_score_codex":0.00034305526,"about_ca_system_score_gemma":0.001224869,"threshold_uncertainty_score":0.018285811},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"design_other","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"split"},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12013735,0.00043948225,0.86444926,0.00014908447,0.000038181657,0.00012729914,0.00008566918,0.004894333,0.0096793445],"genre_scores_gemma":[0.6391742,0.0002736334,0.35697,0.000061092054,0.000018903429,0.00014541285,0.00021923827,0.0004229224,0.0027145955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996364,0.00010179844,0.000015634287,0.00003620947,0.00016046483,0.00004948685],"domain_scores_gemma":[0.9995383,0.00021320896,0.000049938575,0.000084395324,0.00009929264,0.00001490803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044936896,0.00045500675,0.00042620543,0.00034561544,0.00039428158,0.00056007114,0.00056184863,0.00017957506,0.0017733688],"category_scores_gemma":[0.0009691382,0.00027263403,0.00032635394,0.00029164576,0.0005443655,0.0006301275,0.00034192036,0.00034393914,0.0002999882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005287664,0.00011557165,0.0022642866,0.0005314182,0.000063612104,0.00026971934,0.00025378438,0.41596916,0.09612164,0.06976491,0.0042235753,0.40989357],"study_design_scores_gemma":[0.00013135155,0.00036806884,0.0006228367,0.00003711168,0.000053192132,0.00016479245,0.00003570514,0.86304957,0.09209434,0.027514255,0.015895654,0.000033148415],"about_ca_topic_score_codex":0.0012198746,"about_ca_topic_score_gemma":0.0019872512,"teacher_disagreement_score":0.0017733688,"about_ca_system_score_codex":0.0004495796,"about_ca_system_score_gemma":0.001207746,"threshold_uncertainty_score":0.0059324503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20539789,0.00019002122,0.78157306,0.00032476557,0.000044719516,0.00024391068,0.0004616312,0.00053970644,0.011224267],"genre_scores_gemma":[0.92782265,0.00022014872,0.06647184,0.000018447228,0.00002264737,0.00020474884,0.000166215,0.00010258214,0.004970735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985875,0.00039829643,0.000083286424,0.00031089812,0.00042858117,0.00019152068],"domain_scores_gemma":[0.9951756,0.0025882325,0.0010994528,0.00042154998,0.00050132844,0.0002137316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025649641,0.000904548,0.00059667986,0.0011098714,0.0004771015,0.002260728,0.0018152912,0.00069046486,0.0029983162],"category_scores_gemma":[0.0093674455,0.000603207,0.00076670223,0.0010859107,0.0006767649,0.003162392,0.0010572876,0.0010651752,0.0003178786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121404715,0.0000629095,0.0075006755,0.000060634287,0.000044537,0.00011008295,0.00030800313,0.9147852,0.0017969159,0.03961161,0.00056121073,0.035036776],"study_design_scores_gemma":[0.000009768459,0.00010323075,0.0024552015,0.000014351914,0.00003090591,0.000079651196,0.0001611065,0.9790308,0.0011206532,0.014861805,0.0021039261,0.00002863311],"about_ca_topic_score_codex":0.010677501,"about_ca_topic_score_gemma":0.010198161,"teacher_disagreement_score":0.010677501,"about_ca_system_score_codex":0.0015785347,"about_ca_system_score_gemma":0.0017822126,"threshold_uncertainty_score":0.021230698},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27092928,0.0036034416,0.66149795,0.001252666,0.00027235507,0.000108677355,0.00034780634,0.004378188,0.05760967],"genre_scores_gemma":[0.85524726,0.00047012756,0.13536137,0.00018674435,0.000044406548,0.00009065884,0.0002263053,0.0002966029,0.008076501],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961156,0.00007984104,0.000022766262,0.00004285786,0.00017021046,0.000072868155],"domain_scores_gemma":[0.9993845,0.00015769705,0.000057965826,0.00020686426,0.00016673926,0.000026121865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026323055,0.00043062298,0.00035165928,0.00039727314,0.0004658199,0.00090734044,0.0016385043,0.00030549482,0.0046626725],"category_scores_gemma":[0.0014470746,0.00017297799,0.00026745273,0.0010544107,0.0004050296,0.0013875727,0.0007497786,0.0006187072,0.0007388062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011183486,0.00038105945,0.0041649053,0.00037938278,0.00012416027,0.00035773267,0.00032570967,0.29623973,0.093009464,0.11784599,0.024418777,0.4616347],"study_design_scores_gemma":[0.000089400455,0.00022889659,0.00076816365,0.00002942449,0.000060864208,0.00020153256,0.00016577473,0.893317,0.04177099,0.04350929,0.019828597,0.000030135716],"about_ca_topic_score_codex":0.0015409206,"about_ca_topic_score_gemma":0.0051744008,"teacher_disagreement_score":0.0046626725,"about_ca_system_score_codex":0.0005292552,"about_ca_system_score_gemma":0.00082128687,"threshold_uncertainty_score":0.015598178},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021048004,0.01740687,0.9649397,0.0023276743,0.000652789,0.00008536866,0.0001211734,0.00031764104,0.012043963],"genre_scores_gemma":[0.10449615,0.03824659,0.8284905,0.00090603204,0.004358179,0.0010715185,0.00054523465,0.0012697226,0.02061611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99658173,0.0017137694,0.00021463496,0.0003241831,0.0010392424,0.00012634644],"domain_scores_gemma":[0.9925551,0.0052974494,0.00033473308,0.00086009706,0.0007607284,0.00019201309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030196714,0.0016675997,0.002110261,0.001722045,0.0006131825,0.0030331525,0.0025218332,0.0023432549,0.0058787777],"category_scores_gemma":[0.018654957,0.001278123,0.001197959,0.0026805345,0.0024924693,0.0043015685,0.002611403,0.004064764,0.0028849123],"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.000053439664,0.000037415142,0.00026160653,0.0006540522,0.000027092005,0.00012530765,0.000109057044,0.071558766,0.0016399099,0.8582172,0.010498717,0.056817364],"study_design_scores_gemma":[0.000026698814,0.0000561646,0.00016714727,0.00019160788,0.00001920518,0.0003128657,0.00003445817,0.38834235,0.0013952865,0.55706817,0.05233686,0.000049185277],"about_ca_topic_score_codex":0.0010133968,"about_ca_topic_score_gemma":0.0011621967,"teacher_disagreement_score":0.0058787777,"about_ca_system_score_codex":0.0010608819,"about_ca_system_score_gemma":0.00106112,"threshold_uncertainty_score":0.019666493},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96015126,0.0017911248,0.030284313,0.00012773639,0.000027087675,0.000070800066,0.00019254781,0.0003561333,0.006998944],"genre_scores_gemma":[0.9832208,0.0005498863,0.015257246,0.000019912932,0.000015065253,0.000039012477,0.00029614594,0.00002904419,0.0005727841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990476,0.00043987398,0.00004561931,0.00007918218,0.00029177364,0.00009593388],"domain_scores_gemma":[0.9961935,0.0026246912,0.00020581907,0.00037913764,0.0004922214,0.00010458332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012950494,0.00070912926,0.00044148308,0.00077990995,0.00029533842,0.00053448114,0.0005221711,0.0003656444,0.0015478882],"category_scores_gemma":[0.0044206376,0.0001805561,0.00017798597,0.0009800765,0.0002835439,0.0010400014,0.0005170134,0.00021261249,0.00018979215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009277677,0.0005310796,0.010289918,0.0006970242,0.00011971465,0.00021182858,0.00011559162,0.76180816,0.033582956,0.009531028,0.0016927526,0.18049219],"study_design_scores_gemma":[0.00007274113,0.0014732046,0.00697591,0.000032719403,0.000043953925,0.00012601221,0.00011460879,0.96592706,0.019136738,0.004335694,0.001747123,0.000014315958],"about_ca_topic_score_codex":0.0010559638,"about_ca_topic_score_gemma":0.0012661236,"teacher_disagreement_score":0.0015478882,"about_ca_system_score_codex":0.000495369,"about_ca_system_score_gemma":0.00035604535,"threshold_uncertainty_score":0.0068489313},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012526504,0.00007255766,0.9696521,0.00009779954,0.000020903544,0.00009781344,0.00027923458,0.012956638,0.0042964015],"genre_scores_gemma":[0.2646092,0.00018568095,0.7227857,0.00011596104,0.00003299218,0.0002828471,0.0010202476,0.0037904985,0.007176856],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956626,0.000087945875,0.000029372226,0.000059006634,0.00020186437,0.000055613964],"domain_scores_gemma":[0.99910516,0.00038709515,0.00007488476,0.00020199131,0.00020306675,0.000027754992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069944747,0.0010080846,0.00045610435,0.0011320652,0.00063385535,0.0017017267,0.0012308535,0.00059786224,0.013486065],"category_scores_gemma":[0.0025343953,0.0003716764,0.00091891084,0.0007896534,0.00077579083,0.0024105979,0.0011735008,0.001292711,0.0018725494],"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.00046739544,0.00022958973,0.009025889,0.0013237436,0.00012467153,0.0009994856,0.0014814893,0.14862883,0.06633962,0.19853567,0.028121175,0.54472244],"study_design_scores_gemma":[0.000058952868,0.00017903425,0.0020158908,0.0001214605,0.000067939094,0.0003679468,0.00029156412,0.7802327,0.042159833,0.12998883,0.044462707,0.000053162803],"about_ca_topic_score_codex":0.0021618116,"about_ca_topic_score_gemma":0.002671551,"teacher_disagreement_score":0.013486065,"about_ca_system_score_codex":0.0006380317,"about_ca_system_score_gemma":0.0017307658,"threshold_uncertainty_score":0.04511535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0131674195,0.000054066895,0.88913715,0.000093422415,0.00011313151,0.00015112273,0.0005160351,0.089733586,0.0070340545],"genre_scores_gemma":[0.14758208,0.00023694645,0.81719023,0.0003161495,0.00011154568,0.00064356346,0.0034898808,0.0183671,0.01206253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991067,0.0001248427,0.00009010127,0.00023420379,0.00032298185,0.000121208206],"domain_scores_gemma":[0.9989392,0.0002276585,0.00008917021,0.00040199197,0.00026108598,0.00008095952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090482127,0.00082769815,0.00049033266,0.00052440516,0.0004321626,0.0009517487,0.0016992723,0.0003633548,0.0046039964],"category_scores_gemma":[0.0023090083,0.0006041943,0.00092934904,0.00050514255,0.00063635194,0.0010372269,0.0021408305,0.0015218867,0.0031946716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012135188,0.0005316594,0.01008996,0.0012769729,0.00052333245,0.002022514,0.0012686483,0.12087573,0.14741488,0.0832753,0.08950901,0.5419985],"study_design_scores_gemma":[0.0002260359,0.00023840988,0.0043685897,0.00011952726,0.00012263466,0.0011961114,0.000092380076,0.6386058,0.12978666,0.032206245,0.19285837,0.0001792391],"about_ca_topic_score_codex":0.0011055219,"about_ca_topic_score_gemma":0.0009043769,"teacher_disagreement_score":0.0046039964,"about_ca_system_score_codex":0.00031790798,"about_ca_system_score_gemma":0.0013631729,"threshold_uncertainty_score":0.01540184},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013133086,0.00024236408,0.96058166,0.00039580234,0.00019769547,0.00015257516,0.000679379,0.014126948,0.010490424],"genre_scores_gemma":[0.25350565,0.00046145509,0.7294885,0.0003613188,0.00021933929,0.00038903463,0.0039263144,0.0019547336,0.00969362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987612,0.00013976806,0.000047919842,0.00019642375,0.0007179789,0.00013678576],"domain_scores_gemma":[0.99877876,0.00026374782,0.000054179534,0.00034904043,0.0004679969,0.00008624243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000680664,0.0011052244,0.0008167486,0.000787341,0.0010259374,0.0013207681,0.002050196,0.0005546369,0.0064912457],"category_scores_gemma":[0.002758866,0.0005314071,0.001294725,0.0011513935,0.0006596869,0.001928764,0.0022528116,0.0017534047,0.0028522522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057936396,0.000419622,0.0022027357,0.0006975722,0.00035166685,0.00084130146,0.00049173634,0.2920361,0.07336617,0.063094944,0.1106055,0.45531327],"study_design_scores_gemma":[0.0001107185,0.00008531895,0.00056338526,0.000020092084,0.0000250667,0.00023527256,0.00018690317,0.8756853,0.029605709,0.05652592,0.036897436,0.000058783196],"about_ca_topic_score_codex":0.0073769833,"about_ca_topic_score_gemma":0.008968567,"teacher_disagreement_score":0.0073769833,"about_ca_system_score_codex":0.00057118066,"about_ca_system_score_gemma":0.0021378126,"threshold_uncertainty_score":0.021715403},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035402257,0.0011418002,0.9558016,0.000482381,0.00016155513,0.00006392222,0.00007588998,0.0005600578,0.0063105463],"genre_scores_gemma":[0.31661925,0.0013505504,0.6773141,0.00013336627,0.000110743495,0.00024492794,0.0001216987,0.00033225265,0.0037730301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999706,0.00011916946,0.000016968412,0.000031296182,0.000095585005,0.00003109296],"domain_scores_gemma":[0.9993223,0.00039858322,0.000053976775,0.00007556786,0.00010389512,0.000045740693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000666419,0.00051611924,0.00050655263,0.00036618332,0.00050021237,0.000542807,0.00060266076,0.00053771544,0.0014971829],"category_scores_gemma":[0.0030128718,0.00030009032,0.00037973173,0.00075974624,0.00069103425,0.00062450004,0.0010096134,0.0012499904,0.00036435778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020601506,0.00008572928,0.0014171427,0.00017547714,0.000044514298,0.00016360183,0.00017132347,0.78773683,0.007729039,0.09875769,0.0023335028,0.101179086],"study_design_scores_gemma":[0.000013524246,0.0000105632935,0.00012431781,0.000006973766,0.000004000566,0.000021798121,0.000014601291,0.9697,0.0010651536,0.026345354,0.002687615,0.0000060328975],"about_ca_topic_score_codex":0.0034116001,"about_ca_topic_score_gemma":0.0024788633,"teacher_disagreement_score":0.0034116001,"about_ca_system_score_codex":0.00035330048,"about_ca_system_score_gemma":0.0005558891,"threshold_uncertainty_score":0.0067834854},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.683196,0.0017237677,0.29638183,0.0005933705,0.0002384241,0.00036638256,0.0009769717,0.008897943,0.00762528],"genre_scores_gemma":[0.9248423,0.00011148812,0.07332859,0.00006230474,0.000033281365,0.00010894206,0.00068468094,0.00020564868,0.0006228472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979906,0.00040443405,0.00018627621,0.00021540564,0.001059456,0.00014387943],"domain_scores_gemma":[0.9936784,0.0021685627,0.0012107707,0.0006034638,0.0020783101,0.00026050946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019447069,0.0010875268,0.00058107614,0.0019988224,0.00041867053,0.0007019435,0.00060907326,0.0003808536,0.00069229124],"category_scores_gemma":[0.008935032,0.00024701728,0.0003597627,0.0013507117,0.0002491598,0.0010361859,0.00060091284,0.0005206252,0.00032831213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009623974,0.00059096253,0.1148303,0.00037317423,0.00022834842,0.00022666337,0.00030732137,0.3494656,0.13440527,0.002233166,0.011114209,0.38526255],"study_design_scores_gemma":[0.000037500835,0.00075844314,0.031226171,0.000018810497,0.000045491222,0.00016524809,0.000053590822,0.9079096,0.05564454,0.00087792816,0.0031876727,0.00007499019],"about_ca_topic_score_codex":0.0018504347,"about_ca_topic_score_gemma":0.0028343794,"teacher_disagreement_score":0.0019988224,"about_ca_system_score_codex":0.0007845624,"about_ca_system_score_gemma":0.00087222294,"threshold_uncertainty_score":0.010284722},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06313558,0.0003973486,0.93132156,0.00016502706,0.000054829245,0.00010967182,0.000092390896,0.0014868053,0.0032368742],"genre_scores_gemma":[0.58737344,0.00016612312,0.41037372,0.00006968834,0.00003039718,0.00014644273,0.00016154976,0.00021345732,0.0014651642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999542,0.00012548188,0.000024668818,0.00007099306,0.00016686323,0.000070050235],"domain_scores_gemma":[0.9995999,0.00013074852,0.00006053374,0.00013591973,0.000045991386,0.00002698892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006917439,0.00046133928,0.0004631189,0.0004065888,0.00047777963,0.0005052973,0.0008823528,0.00036181626,0.0014809141],"category_scores_gemma":[0.0013467727,0.0003093902,0.00047481668,0.000497191,0.00037268086,0.00068006385,0.00049409806,0.0006732887,0.00021322965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085172054,0.000088252455,0.0005717022,0.000055454446,0.000021022255,0.000036389178,0.000062927895,0.9165593,0.016268594,0.014272153,0.001207529,0.05077139],"study_design_scores_gemma":[0.0000070372785,0.000024362631,0.00010660835,0.0000027889505,0.000003699332,0.000009064562,0.000006062407,0.9921435,0.001863711,0.004809566,0.0010194477,0.0000040243817],"about_ca_topic_score_codex":0.0038199788,"about_ca_topic_score_gemma":0.010496998,"teacher_disagreement_score":0.0038199788,"about_ca_system_score_codex":0.0009607482,"about_ca_system_score_gemma":0.0014551323,"threshold_uncertainty_score":0.0075954795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22151269,0.0013975827,0.7700151,0.00020488174,0.00004173933,0.00006451798,0.00004790159,0.0011176083,0.0055979006],"genre_scores_gemma":[0.9280097,0.0001981497,0.06996964,0.000032698706,0.000014483032,0.00003077958,0.00003481164,0.000035446214,0.0016743406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998492,0.00002403586,0.000010128294,0.00004226769,0.00004414476,0.000030217208],"domain_scores_gemma":[0.9998752,0.000048199283,0.000025138135,0.000023384215,0.000020545538,0.0000075801536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022534371,0.0002812146,0.0002532457,0.00029368038,0.0004068821,0.0003946136,0.00072972657,0.00024420556,0.0010876345],"category_scores_gemma":[0.0004188378,0.00020914176,0.00023322523,0.00047362063,0.00025937677,0.00094429153,0.00042519337,0.00027906056,0.00011303069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004651947,0.00013619858,0.0017961598,0.00021552415,0.00003967466,0.0003340309,0.0003014322,0.30899733,0.18865827,0.025383355,0.0013044318,0.47236845],"study_design_scores_gemma":[0.000024438921,0.00019435979,0.00070294307,0.000014290664,0.000020529707,0.000115063034,0.00003070228,0.9468485,0.04169078,0.006929953,0.0034151145,0.000013331496],"about_ca_topic_score_codex":0.0012445629,"about_ca_topic_score_gemma":0.0023037624,"teacher_disagreement_score":0.0012445629,"about_ca_system_score_codex":0.0004741688,"about_ca_system_score_gemma":0.0005633506,"threshold_uncertainty_score":0.003638506},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06350178,0.00024292608,0.9316099,0.00022034017,0.000022139111,0.000052148647,0.000011211009,0.00042170068,0.0039178752],"genre_scores_gemma":[0.81097573,0.00020061467,0.1852845,0.00011298628,0.000043779233,0.0002057893,0.00003354347,0.00012723867,0.003015779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847,0.0006008087,0.000073402756,0.00026251466,0.00045006644,0.00014319643],"domain_scores_gemma":[0.997189,0.0015658439,0.000222111,0.0007280975,0.00018569203,0.00010939064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014470587,0.00047265997,0.0006759472,0.0006811422,0.0014009572,0.0018273245,0.0011912198,0.0006861799,0.0020191292],"category_scores_gemma":[0.004899846,0.0005414274,0.0006487491,0.00083040626,0.002518779,0.0023341987,0.0024588995,0.0012887685,0.00028595765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011540348,0.00010465294,0.0043551326,0.00012249366,0.00010657912,0.00048501958,0.0013085592,0.43375355,0.021651743,0.485329,0.0007723917,0.05189538],"study_design_scores_gemma":[0.000032409436,0.00007296952,0.0007226973,0.000016818864,0.00003562197,0.00011520592,0.00016275437,0.7417011,0.005128378,0.24626148,0.005714022,0.000036477293],"about_ca_topic_score_codex":0.002508405,"about_ca_topic_score_gemma":0.0019214362,"teacher_disagreement_score":0.002508405,"about_ca_system_score_codex":0.0010216044,"about_ca_system_score_gemma":0.0007580489,"threshold_uncertainty_score":0.007652819},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004959389,0.0012000297,0.79662246,0.0009550714,0.0012572702,0.00024652274,0.0061561903,0.12762518,0.06097784],"genre_scores_gemma":[0.07501258,0.0012340061,0.82379943,0.0013193132,0.00046355883,0.00083384675,0.01518623,0.023313427,0.05883753],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989189,0.0002411115,0.0001082126,0.00016208639,0.00046901856,0.00010063751],"domain_scores_gemma":[0.99795926,0.00022042343,0.00013749485,0.00059992,0.0009894449,0.00009347425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080818794,0.0008997044,0.0008717332,0.0011829366,0.00073221856,0.0020050416,0.0021304118,0.0006906261,0.04828192],"category_scores_gemma":[0.0035342553,0.00041813467,0.00060204964,0.0019006848,0.0005900141,0.0012576082,0.0014518456,0.0014774499,0.020866672],"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.00026771508,0.000034460867,0.00083923514,0.000450877,0.0000953972,0.0002874996,0.00016458119,0.007984273,0.01309542,0.0336026,0.6779336,0.26524442],"study_design_scores_gemma":[0.000102239486,0.000053991385,0.0010962156,0.00010804771,0.000039642986,0.00039129137,0.00004301581,0.107364066,0.037658453,0.013628501,0.83940715,0.00010740993],"about_ca_topic_score_codex":0.004255862,"about_ca_topic_score_gemma":0.0048622577,"teacher_disagreement_score":0.04828192,"about_ca_system_score_codex":0.00072574883,"about_ca_system_score_gemma":0.0009276775,"threshold_uncertainty_score":0.16151905},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07521147,0.0010046887,0.7665212,0.000524584,0.0007534813,0.00037230016,0.0006303586,0.10853151,0.046450485],"genre_scores_gemma":[0.43935806,0.00073350203,0.49786636,0.0005586349,0.0002040219,0.00033384477,0.0022772513,0.004663672,0.05400462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997657,0.000039285274,0.000014684568,0.00003170055,0.00011328524,0.000035306155],"domain_scores_gemma":[0.9996012,0.000093564304,0.000029728591,0.000098961114,0.00013570543,0.00004091586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026392564,0.00047395777,0.0002639264,0.0004228659,0.00041567048,0.00064890616,0.0007790141,0.00036860615,0.008571806],"category_scores_gemma":[0.0007057273,0.00028019253,0.00029965147,0.0003984225,0.00022609415,0.000545286,0.00044474736,0.00079175935,0.0025121863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001544598,0.00047741755,0.004189094,0.0006543278,0.00012591077,0.0011572744,0.00043919607,0.046640657,0.22762215,0.0438521,0.1084063,0.5648909],"study_design_scores_gemma":[0.00026735727,0.00077958853,0.0025375006,0.000109237444,0.00008640964,0.00096756406,0.00006547827,0.3722417,0.20555614,0.01060827,0.40666628,0.00011451425],"about_ca_topic_score_codex":0.0012146512,"about_ca_topic_score_gemma":0.0015098865,"teacher_disagreement_score":0.008571806,"about_ca_system_score_codex":0.00040730624,"about_ca_system_score_gemma":0.00075791526,"threshold_uncertainty_score":0.028675556},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7108387,0.0013312935,0.2769717,0.0003659996,0.000053831685,0.00007442551,0.00023094071,0.0008003438,0.009332811],"genre_scores_gemma":[0.9823476,0.00020280479,0.014821465,0.000062693485,0.000039257055,0.00004984708,0.0001339502,0.00011463958,0.002227653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992415,0.00006534275,0.000028066579,0.00011948591,0.00045114715,0.00009453321],"domain_scores_gemma":[0.9960821,0.002377637,0.0005661009,0.00043975693,0.00045939497,0.00007506913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034353,0.00067249185,0.0004772407,0.0013972304,0.00039943654,0.00050669484,0.0004781949,0.00025853116,0.003739644],"category_scores_gemma":[0.004641401,0.00034863866,0.0004603972,0.0012785017,0.0005598566,0.0011640736,0.00048703913,0.000877393,0.00037268264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015283885,0.00082283455,0.051489774,0.00042140897,0.0002481225,0.0008813577,0.00033408744,0.37688538,0.20091751,0.027847968,0.0026206474,0.33600253],"study_design_scores_gemma":[0.000027811677,0.00027830582,0.028885417,0.000022865766,0.00008165261,0.00032110338,0.00005501038,0.90478235,0.053535216,0.009685255,0.0022853047,0.00003977457],"about_ca_topic_score_codex":0.0014489762,"about_ca_topic_score_gemma":0.0013170594,"teacher_disagreement_score":0.003739644,"about_ca_system_score_codex":0.0004690337,"about_ca_system_score_gemma":0.0005669168,"threshold_uncertainty_score":0.012510419},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4160658,0.0011532493,0.57358074,0.00028971123,0.000048660775,0.0002675475,0.00014830152,0.0024564809,0.005989463],"genre_scores_gemma":[0.6187277,0.00027521816,0.37822333,0.00008547459,0.000018129853,0.00015979877,0.00022911967,0.00027055672,0.0020106405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996424,0.00010116436,0.000023790093,0.000043975968,0.00010421076,0.00008450053],"domain_scores_gemma":[0.99859303,0.0008059012,0.00016328318,0.000117665906,0.00022660548,0.000093427705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007903806,0.000404,0.00040096047,0.0008496613,0.0005270638,0.0004770933,0.0014756978,0.00038958233,0.0017496522],"category_scores_gemma":[0.0024999909,0.00035878827,0.0002386161,0.001008062,0.00041507653,0.00066546444,0.000526315,0.00048425258,0.00028066977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000502652,0.0002688184,0.003548599,0.00018545416,0.000041604824,0.00008094664,0.00031084724,0.7215478,0.010016231,0.011041264,0.004474337,0.24798147],"study_design_scores_gemma":[0.000069486094,0.000093314906,0.00040743046,0.000006027613,0.000009625882,0.000018020168,0.000056919667,0.9925861,0.003325858,0.0026769142,0.00074395403,0.000006443016],"about_ca_topic_score_codex":0.010429109,"about_ca_topic_score_gemma":0.018242143,"teacher_disagreement_score":0.010429109,"about_ca_system_score_codex":0.0016326825,"about_ca_system_score_gemma":0.002174241,"threshold_uncertainty_score":0.020736814},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15870564,0.00019507245,0.8157114,0.000195545,0.00012176103,0.000046694233,0.00013459299,0.0023628916,0.022526419],"genre_scores_gemma":[0.8696585,0.00011404057,0.124212004,0.00008197562,0.000024145787,0.00006487886,0.00016286265,0.0002887378,0.0053927843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981755,0.00005034676,0.000007880606,0.000023184026,0.000074361575,0.000026752787],"domain_scores_gemma":[0.99958307,0.00017505755,0.000030065403,0.00011498799,0.000076264456,0.000020612533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034255834,0.00030249142,0.00031637715,0.00025073648,0.00023559901,0.00046506853,0.0007220656,0.00034404802,0.004284447],"category_scores_gemma":[0.0011272797,0.00019554805,0.00028352928,0.00032942268,0.00035880774,0.0005889789,0.00050733035,0.00045636916,0.0002919089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002911973,0.000055928223,0.000750576,0.00006803041,0.00002854266,0.00011544288,0.00009781368,0.88479215,0.016579753,0.03214396,0.0019026833,0.06317389],"study_design_scores_gemma":[0.000010023523,0.000023079436,0.00007290979,0.0000031609825,0.0000026842956,0.000014804444,0.000007737384,0.98938936,0.006135906,0.0033955679,0.00094175723,0.0000029453258],"about_ca_topic_score_codex":0.0011589559,"about_ca_topic_score_gemma":0.0011538002,"teacher_disagreement_score":0.004284447,"about_ca_system_score_codex":0.00036055996,"about_ca_system_score_gemma":0.0003570055,"threshold_uncertainty_score":0.0143328905},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5104902,0.0042088656,0.34292918,0.0020319638,0.0006033333,0.0004364592,0.0010195008,0.059141062,0.079139546],"genre_scores_gemma":[0.6673849,0.002061614,0.29229188,0.0006111265,0.0001711344,0.00038499516,0.002556878,0.0032728768,0.031264562],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99914956,0.00012462822,0.00003499012,0.00014200302,0.00041195424,0.00013680529],"domain_scores_gemma":[0.99889106,0.00036654127,0.00008989439,0.0002334106,0.0003378157,0.00008134451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009887923,0.0007807085,0.0004176791,0.0011254883,0.00044645343,0.0016870126,0.0024352137,0.0005243711,0.007544116],"category_scores_gemma":[0.0037205098,0.00044124175,0.00030572352,0.0016867011,0.00060366857,0.0031899365,0.0018046544,0.0013421433,0.0036860472],"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.0031597891,0.0006085285,0.0061751464,0.000960186,0.000078760975,0.0006923114,0.0005779918,0.06347326,0.17150767,0.050711147,0.07675565,0.6252996],"study_design_scores_gemma":[0.0006295359,0.0015361776,0.0051814243,0.00012003918,0.0000985969,0.00047611762,0.0003738448,0.617632,0.23243313,0.025095833,0.11632082,0.0001025275],"about_ca_topic_score_codex":0.0017439756,"about_ca_topic_score_gemma":0.0015544484,"teacher_disagreement_score":0.007544116,"about_ca_system_score_codex":0.000727999,"about_ca_system_score_gemma":0.0011876118,"threshold_uncertainty_score":0.02523762},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045632794,0.000067307636,0.9917985,0.00006132646,0.000021161279,0.000060967006,0.00031680634,0.0017060783,0.0014044587],"genre_scores_gemma":[0.18981847,0.0004904717,0.79984754,0.0001501414,0.000039114613,0.00078357954,0.0022234062,0.0020786785,0.00456859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803,0.00045873702,0.00019118043,0.00013784046,0.0010589595,0.00012320334],"domain_scores_gemma":[0.9964264,0.0016755739,0.00021190195,0.0008980777,0.0007478344,0.000040161474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018694389,0.0010515618,0.0007301818,0.0008108249,0.0005029174,0.001459487,0.002340031,0.0010013784,0.0035866122],"category_scores_gemma":[0.007342281,0.0011219489,0.0013232927,0.00055431796,0.0006848687,0.002559507,0.0011267043,0.0018837032,0.0012898999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008560716,0.000049175622,0.00093451986,0.00035836827,0.000056128836,0.00024281479,0.0002977487,0.7411086,0.020452863,0.18448535,0.0038898746,0.048038922],"study_design_scores_gemma":[0.000030363683,0.00003336538,0.00006784354,0.000032675878,0.000020332285,0.00006664754,0.000025882666,0.9375625,0.014814486,0.03199199,0.015335391,0.000018556468],"about_ca_topic_score_codex":0.0022176586,"about_ca_topic_score_gemma":0.004047568,"teacher_disagreement_score":0.0035866122,"about_ca_system_score_codex":0.0010204853,"about_ca_system_score_gemma":0.0019863227,"threshold_uncertainty_score":0.011998415},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97708535,0.00036107533,0.012822248,0.00024601593,0.00007710135,0.000055865377,0.00017404227,0.0008527796,0.008325474],"genre_scores_gemma":[0.98977566,0.00014228171,0.008260842,0.000043168475,0.000019139095,0.00003426188,0.00027949188,0.00007205922,0.0013730255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99862874,0.00055449875,0.00004786859,0.00011084952,0.0004673455,0.00019072388],"domain_scores_gemma":[0.9964994,0.0015521873,0.00021353313,0.00054350356,0.00094487163,0.00024635525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023523208,0.00069241464,0.00040770057,0.0007245178,0.00047357182,0.0008740749,0.0011063077,0.0005029871,0.0021006404],"category_scores_gemma":[0.0057120654,0.00021197286,0.00021021234,0.0011238047,0.0005197483,0.00166473,0.0008320184,0.00057883136,0.0002699307],"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.006910206,0.0012690682,0.027852355,0.00094622566,0.00027556284,0.0010177003,0.00046626295,0.6904555,0.12886183,0.015655493,0.00691214,0.119377755],"study_design_scores_gemma":[0.00013373731,0.0019945253,0.012037892,0.000039331484,0.00006332486,0.00029526366,0.00028860604,0.9174468,0.061607033,0.001681951,0.0043682926,0.000043188003],"about_ca_topic_score_codex":0.0024855647,"about_ca_topic_score_gemma":0.002328324,"teacher_disagreement_score":0.0024855647,"about_ca_system_score_codex":0.000862132,"about_ca_system_score_gemma":0.00063976157,"threshold_uncertainty_score":0.012440443},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04531806,0.0003446592,0.94968593,0.00009770774,0.00006310778,0.00008572989,0.00002359459,0.000736598,0.0036447195],"genre_scores_gemma":[0.5255533,0.00032370136,0.4694765,0.00008428806,0.000048853883,0.00013699595,0.00011989029,0.00022674382,0.004029785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912626,0.00019522093,0.00005460357,0.00016387753,0.00030075043,0.00015942116],"domain_scores_gemma":[0.9985561,0.00058024784,0.00013769128,0.00039608695,0.00025896888,0.00007080565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096657925,0.00047642278,0.00044077073,0.0005527375,0.00045514145,0.00074446015,0.00096620683,0.00035705915,0.002358662],"category_scores_gemma":[0.0020105077,0.00043801972,0.00047062294,0.00063802314,0.0006405559,0.0012162316,0.0008035984,0.0006364186,0.00045175268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070669374,0.0001998252,0.0032171698,0.0004546474,0.00012597434,0.00039628,0.0004051347,0.2907318,0.09265958,0.12483658,0.002763979,0.4835024],"study_design_scores_gemma":[0.00007721125,0.00058361894,0.0010287227,0.000038586022,0.00009118147,0.00029677126,0.00009938383,0.8284982,0.07719758,0.058804102,0.03324098,0.000043641874],"about_ca_topic_score_codex":0.0012512822,"about_ca_topic_score_gemma":0.0022011937,"teacher_disagreement_score":0.002358662,"about_ca_system_score_codex":0.00066375046,"about_ca_system_score_gemma":0.0019617248,"threshold_uncertainty_score":0.007890582},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009541407,0.00046101052,0.97078663,0.0012093489,0.00040594005,0.00005667939,0.00004001753,0.0023481902,0.015150793],"genre_scores_gemma":[0.1644282,0.0011426591,0.817643,0.0006703887,0.00082345156,0.00034377494,0.00017128242,0.0012390844,0.013538209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844617,0.00046305027,0.000070300375,0.000184746,0.00069866044,0.00013707427],"domain_scores_gemma":[0.99763143,0.0006848127,0.000107599444,0.0008819902,0.0005129152,0.0001812126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021258793,0.00060846785,0.00057735445,0.0007111117,0.0011184248,0.002327386,0.0019413105,0.00090568856,0.0026558128],"category_scores_gemma":[0.0050734715,0.0006438758,0.0006304528,0.0009917378,0.0014186612,0.00248084,0.0028550257,0.0033457044,0.0021344998],"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.00021565071,0.00014695586,0.0014963446,0.00024289379,0.000041740223,0.00044570427,0.00091418094,0.031082718,0.02066744,0.7867588,0.015036523,0.14295106],"study_design_scores_gemma":[0.000105400264,0.000077936085,0.0004984512,0.000078149096,0.000040097213,0.00027530905,0.00010002564,0.4228157,0.017837528,0.42606282,0.13205867,0.000049853603],"about_ca_topic_score_codex":0.0010949037,"about_ca_topic_score_gemma":0.0012694268,"teacher_disagreement_score":0.0026558128,"about_ca_system_score_codex":0.00061596534,"about_ca_system_score_gemma":0.000790326,"threshold_uncertainty_score":0.011242807},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23612721,0.0003857069,0.7431545,0.00033601408,0.0000781236,0.00064846594,0.00025002888,0.0079929205,0.011027044],"genre_scores_gemma":[0.46790123,0.00017568396,0.5281721,0.00008502047,0.000013851282,0.0002897528,0.00023500595,0.0006103199,0.0025171028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982254,0.00070799486,0.00012683283,0.00012219201,0.0006558854,0.00016161682],"domain_scores_gemma":[0.9972638,0.0012965776,0.00022977115,0.00042703067,0.0007077524,0.0000751321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002301474,0.00060048176,0.00040249235,0.00047137745,0.00039912213,0.0012489378,0.0018003003,0.00065749977,0.003769242],"category_scores_gemma":[0.004089303,0.0003566288,0.0005835042,0.0004022783,0.00058348477,0.0011767996,0.00041446567,0.00060329126,0.00054862304],"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.001019984,0.00067654514,0.0036606314,0.0015023766,0.00019533832,0.00047733317,0.00046383846,0.5613691,0.14253257,0.055916317,0.0038108947,0.22837506],"study_design_scores_gemma":[0.00019476899,0.0007367162,0.0007287598,0.00004993321,0.000056507106,0.000117203876,0.00011293281,0.876123,0.11048962,0.0025917587,0.0087643545,0.00003450424],"about_ca_topic_score_codex":0.0025393495,"about_ca_topic_score_gemma":0.00196536,"teacher_disagreement_score":0.003769242,"about_ca_system_score_codex":0.0011950134,"about_ca_system_score_gemma":0.0017848951,"threshold_uncertainty_score":0.012609422},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3525488,0.01656433,0.5047072,0.03723968,0.00082232064,0.000046386624,0.0001601017,0.001773002,0.08613826],"genre_scores_gemma":[0.9427366,0.0034936317,0.046117216,0.0008603731,0.00038563367,0.00004319621,0.00003958626,0.00018921818,0.0061345324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995338,0.00015720447,0.000013248457,0.00009016798,0.00013549249,0.000070152884],"domain_scores_gemma":[0.99780005,0.0013271767,0.00010276039,0.00058418105,0.00011559469,0.00007015459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010568761,0.0004180992,0.00053550175,0.000362122,0.0004189013,0.0017354888,0.0010659564,0.0010267391,0.0058905603],"category_scores_gemma":[0.004747249,0.00037576607,0.00038696543,0.00061159936,0.0028341436,0.008706675,0.0009801576,0.001635993,0.0010738627],"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.00018740856,0.00004838205,0.0009811176,0.000392752,0.00006439406,0.00013353745,0.0002836049,0.07958464,0.010959546,0.7673738,0.0062695276,0.13372132],"study_design_scores_gemma":[0.00005470495,0.00015340348,0.0003756435,0.000054941425,0.000052885658,0.00030624733,0.00017001785,0.14443737,0.005719271,0.8351341,0.013515713,0.000025698619],"about_ca_topic_score_codex":0.00081453356,"about_ca_topic_score_gemma":0.0010919471,"teacher_disagreement_score":0.0058905603,"about_ca_system_score_codex":0.0005211202,"about_ca_system_score_gemma":0.00039358495,"threshold_uncertainty_score":0.019705832},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029830125,0.00017075856,0.99471325,0.00012551779,0.000015062414,0.000034622066,0.00008474738,0.0002080401,0.0016649431],"genre_scores_gemma":[0.29103875,0.0014761945,0.6991915,0.00015397336,0.00011949036,0.00081850315,0.00048300647,0.00040149788,0.0063170777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993855,0.00017797746,0.000029887151,0.0001037588,0.0002373944,0.00006536931],"domain_scores_gemma":[0.99909186,0.00049845007,0.000116647134,0.00011806446,0.00014250271,0.000032567335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011028143,0.00095211144,0.00092552765,0.0008534909,0.0005980406,0.0011280532,0.0020682376,0.00110966,0.0020956784],"category_scores_gemma":[0.0030100944,0.000739315,0.0010094157,0.0009442812,0.0012357556,0.0018752614,0.0008014823,0.0018271819,0.00045601345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007029978,0.000015591899,0.00019853922,0.000021422795,0.000011153307,0.000019018738,0.000020780664,0.94983315,0.0006153738,0.0448829,0.0003151394,0.004059868],"study_design_scores_gemma":[0.000001956923,0.00000571079,0.000030904317,0.0000034555735,0.0000027910046,0.0000047267417,0.0000033791907,0.9869419,0.00013868634,0.012056888,0.0008066722,0.0000030223405],"about_ca_topic_score_codex":0.010179657,"about_ca_topic_score_gemma":0.008385325,"teacher_disagreement_score":0.010179657,"about_ca_system_score_codex":0.0015187148,"about_ca_system_score_gemma":0.0024239027,"threshold_uncertainty_score":0.020240843},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10411044,0.00019686129,0.8676082,0.00020048537,0.0001349163,0.00023559034,0.0014212605,0.013677953,0.012414218],"genre_scores_gemma":[0.43755615,0.00038500174,0.5461804,0.00012865245,0.000029924215,0.00053018425,0.002678586,0.0008704222,0.011640545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983466,0.0000224352,0.000011098046,0.00001867658,0.000094603856,0.000018513201],"domain_scores_gemma":[0.99961334,0.00014004814,0.000032434025,0.00009808138,0.00009327589,0.000022795677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025916146,0.0003550754,0.00028919973,0.00026756214,0.00017046594,0.00032608648,0.0009543829,0.00047765666,0.0031974474],"category_scores_gemma":[0.00088958524,0.0003059606,0.00040134194,0.0002607658,0.00023345595,0.00048369897,0.00041765446,0.0008364971,0.00058059586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009618467,0.00006871079,0.0013617711,0.00014639749,0.00004953137,0.00022443983,0.00013087303,0.8666093,0.057891365,0.02959349,0.0049570403,0.038870912],"study_design_scores_gemma":[0.000027250206,0.00005168242,0.00022657463,0.000004198432,0.000012742606,0.00004732304,0.0000064223545,0.972484,0.0132647725,0.0028834345,0.01098309,0.000008601719],"about_ca_topic_score_codex":0.0014945718,"about_ca_topic_score_gemma":0.001854049,"teacher_disagreement_score":0.0031974474,"about_ca_system_score_codex":0.0002592858,"about_ca_system_score_gemma":0.0008620889,"threshold_uncertainty_score":0.01069659},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2644809,0.0005637123,0.72053176,0.0005290714,0.00012802758,0.0002569131,0.00011124417,0.005636596,0.0077618044],"genre_scores_gemma":[0.8505795,0.00013888789,0.1469807,0.00006563622,0.00002642912,0.00010173977,0.00016135219,0.00014227295,0.0018034572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988925,0.0002810668,0.00008989057,0.00014205735,0.00041420074,0.00018032883],"domain_scores_gemma":[0.9971807,0.0008928287,0.00035432744,0.0008596811,0.0005816899,0.00013075031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017221376,0.0004532138,0.00033329782,0.0005145687,0.00077470526,0.00094216433,0.0015392064,0.00046140436,0.002010433],"category_scores_gemma":[0.004959185,0.00025382196,0.00029501168,0.00062531093,0.00071249285,0.003095986,0.0018101773,0.0008349574,0.00043919706],"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.0008618366,0.0005476574,0.010123429,0.00040566263,0.00010858265,0.0004123406,0.0008450858,0.4417958,0.13317268,0.08786379,0.008746259,0.3151169],"study_design_scores_gemma":[0.00017246013,0.0006275927,0.0009001139,0.000022069908,0.000056036668,0.00013192861,0.00011605875,0.9028622,0.069141634,0.015417642,0.010506011,0.000046255856],"about_ca_topic_score_codex":0.0030328915,"about_ca_topic_score_gemma":0.004799545,"teacher_disagreement_score":0.0030328915,"about_ca_system_score_codex":0.0011784071,"about_ca_system_score_gemma":0.001647274,"threshold_uncertainty_score":0.009107649},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027207008,0.00033248076,0.99427706,0.0005968583,0.000030842348,0.00004671994,0.000022411748,0.0007787103,0.0011941739],"genre_scores_gemma":[0.023091296,0.0008292663,0.9736084,0.00021012576,0.00007974113,0.00013001953,0.00007762459,0.0005667252,0.0014067087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798393,0.0006210658,0.00020099546,0.0002527678,0.00081117166,0.00013010626],"domain_scores_gemma":[0.995165,0.0023117918,0.00056727015,0.0011495517,0.0006976437,0.00010871739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037437286,0.0009817297,0.00061332865,0.0015574322,0.0007767307,0.0039133346,0.0030014405,0.00095746864,0.0029298854],"category_scores_gemma":[0.008229288,0.0010625685,0.0010667919,0.0014031095,0.004892604,0.010182627,0.0019757543,0.0037639474,0.0011334551],"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.000050552837,0.00006842904,0.0007934544,0.0006591444,0.000043169515,0.00025096466,0.0011884088,0.008387782,0.024521023,0.84552777,0.004309933,0.1141994],"study_design_scores_gemma":[0.000058556903,0.00013719604,0.00035067296,0.00041140878,0.00007376924,0.00075800274,0.0005361989,0.092829674,0.055896156,0.7225713,0.12625338,0.00012360951],"about_ca_topic_score_codex":0.000511111,"about_ca_topic_score_gemma":0.0008204823,"teacher_disagreement_score":0.0039133346,"about_ca_system_score_codex":0.0007119882,"about_ca_system_score_gemma":0.0020545176,"threshold_uncertainty_score":0.019798934},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83376807,0.0006013147,0.14819215,0.00035480972,0.00007964918,0.00004673523,0.00006155076,0.002795885,0.01409989],"genre_scores_gemma":[0.9795782,0.00014080721,0.017968168,0.00003346957,0.000023655246,0.00003343141,0.000070661,0.00009264716,0.002059029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997614,0.0000699163,0.000015373254,0.000024404684,0.00006718149,0.00006171368],"domain_scores_gemma":[0.9988482,0.00040844217,0.000114892384,0.00039271783,0.00016615674,0.00006960326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003580425,0.00025389798,0.00021265485,0.0002004025,0.00053229294,0.0006585424,0.0010037543,0.00031098476,0.0033528667],"category_scores_gemma":[0.0018941108,0.00022588643,0.00017012251,0.0003481748,0.0004044395,0.0014593536,0.000910399,0.0006164634,0.000553689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027829742,0.00054726814,0.01608933,0.00073144695,0.00014258033,0.0016481485,0.0013926998,0.34663227,0.31219053,0.10992316,0.007569822,0.2003497],"study_design_scores_gemma":[0.00033769527,0.00087445846,0.005294073,0.00006779752,0.00022379444,0.0005010198,0.00036205188,0.7838361,0.15546745,0.026844354,0.026129005,0.000062148734],"about_ca_topic_score_codex":0.0008079095,"about_ca_topic_score_gemma":0.0017944683,"teacher_disagreement_score":0.0033528667,"about_ca_system_score_codex":0.0002871263,"about_ca_system_score_gemma":0.00062795996,"threshold_uncertainty_score":0.011216521},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015715037,0.0006596673,0.9704471,0.0013172508,0.00026652205,0.000096293064,0.000049074064,0.0032560104,0.008193095],"genre_scores_gemma":[0.18130305,0.0011544345,0.8016388,0.00067112956,0.0004193346,0.00034869113,0.00032221607,0.0015468126,0.012595591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690646,0.00054457295,0.00014028043,0.00022222051,0.0018636361,0.000322876],"domain_scores_gemma":[0.99587905,0.0005923085,0.0002638259,0.0013201892,0.0017002127,0.0002444817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029846388,0.0010911957,0.00088102417,0.0012460835,0.001456341,0.0025471407,0.0027696602,0.0014301778,0.0028653406],"category_scores_gemma":[0.0068073706,0.0011212385,0.0010894476,0.0015367966,0.0018982649,0.004195232,0.0033287324,0.0065792603,0.0018943946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090465875,0.00040035904,0.0043203207,0.0009863002,0.00023953222,0.0011892797,0.0014668042,0.076091506,0.10845969,0.44590276,0.039762396,0.3202765],"study_design_scores_gemma":[0.00023299927,0.00028975733,0.0009180152,0.00021335781,0.00016216266,0.00079480483,0.00027606037,0.5744215,0.10424115,0.14616263,0.1721369,0.00015063834],"about_ca_topic_score_codex":0.003010611,"about_ca_topic_score_gemma":0.0023738118,"teacher_disagreement_score":0.003010611,"about_ca_system_score_codex":0.0010974183,"about_ca_system_score_gemma":0.0028628036,"threshold_uncertainty_score":0.015784502},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41532296,0.0014412677,0.5326117,0.00037554707,0.00022472127,0.00012831858,0.00047320322,0.020816071,0.028606195],"genre_scores_gemma":[0.8902503,0.00022513825,0.10334778,0.00006851676,0.000040399766,0.0001030996,0.0003147728,0.00031813415,0.0053317244],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998017,0.000026995296,0.000014182851,0.000021527576,0.000095834876,0.0000398136],"domain_scores_gemma":[0.9995091,0.00013995303,0.000055165598,0.00014644938,0.00012421735,0.000025017598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019218498,0.00031106418,0.00034219213,0.0003224654,0.00033226167,0.0003887022,0.00075069873,0.00017569817,0.002912037],"category_scores_gemma":[0.0007267402,0.00018499541,0.00019586939,0.0003441246,0.00019152861,0.00032408745,0.00025102182,0.0003153951,0.0005176012],"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.00094913197,0.00027885116,0.0030251346,0.0010234133,0.00012261784,0.00040035532,0.00034242508,0.17671855,0.42485338,0.019755123,0.010796631,0.3617343],"study_design_scores_gemma":[0.00017717504,0.0005798138,0.0040677185,0.00005716224,0.00013703515,0.00028983693,0.00008810874,0.52245545,0.41770613,0.004228998,0.050137304,0.000075274475],"about_ca_topic_score_codex":0.0015874042,"about_ca_topic_score_gemma":0.0028404696,"teacher_disagreement_score":0.002912037,"about_ca_system_score_codex":0.00029923924,"about_ca_system_score_gemma":0.0004656627,"threshold_uncertainty_score":0.009741783},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.978229,0.0010096772,0.015710313,0.00015031763,0.000038248123,0.00003304686,0.00036667896,0.0012675602,0.0031952262],"genre_scores_gemma":[0.99364954,0.00020685901,0.004711748,0.000034507157,0.00001798845,0.000037201702,0.00046154394,0.000116008516,0.0007646518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857855,0.0003513022,0.000088312685,0.0002124662,0.00044616254,0.00032321556],"domain_scores_gemma":[0.9970795,0.0014053049,0.00018382275,0.00054990797,0.0007014342,0.00008003922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071066496,0.00070238695,0.00073481794,0.0011594285,0.0010929883,0.0011068628,0.00092513143,0.00072468864,0.0032562253],"category_scores_gemma":[0.0038530054,0.00036441578,0.00054414093,0.0017918342,0.000628247,0.0023935384,0.0005240131,0.0007118922,0.00064703496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040613497,0.00061862054,0.030436106,0.0012877724,0.0011129765,0.0010685124,0.000787448,0.5665605,0.26850915,0.012436518,0.0066251396,0.106495954],"study_design_scores_gemma":[0.00012781106,0.0024239537,0.008548199,0.000037062957,0.00032317193,0.00064002327,0.00030255172,0.79420656,0.18763246,0.0024442605,0.003208832,0.000105242245],"about_ca_topic_score_codex":0.003054102,"about_ca_topic_score_gemma":0.0024320034,"teacher_disagreement_score":0.0032562253,"about_ca_system_score_codex":0.0012441819,"about_ca_system_score_gemma":0.0007505521,"threshold_uncertainty_score":0.010893166},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028565766,0.00044216914,0.94201374,0.00013983213,0.00023019224,0.00047208965,0.00012907246,0.0021099427,0.025897205],"genre_scores_gemma":[0.80259997,0.000346519,0.18527134,0.00013342233,0.000089708534,0.0005938984,0.0002083877,0.00015463907,0.010601984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997814,0.000022647857,0.000014424933,0.00004429848,0.00011309823,0.000024103829],"domain_scores_gemma":[0.99977607,0.000048748145,0.00003145802,0.000019621899,0.000110970635,0.000013154588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027208638,0.0004261581,0.00027281189,0.00032428897,0.0004193344,0.0009015769,0.00086528936,0.00027122366,0.0065641874],"category_scores_gemma":[0.0005740033,0.00015765785,0.00017575127,0.0002493994,0.00022162146,0.0003100188,0.0002426429,0.00048729105,0.000989608],"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.0005467044,0.00024939977,0.0011552405,0.00087500975,0.000101296835,0.0004977496,0.0003183054,0.39435613,0.18365917,0.051439453,0.010629651,0.35617185],"study_design_scores_gemma":[0.00010972061,0.00032607635,0.00040771597,0.00003049067,0.00002916713,0.00013665177,0.000037415848,0.9390105,0.04102654,0.0029263475,0.015937248,0.000022130136],"about_ca_topic_score_codex":0.0024499134,"about_ca_topic_score_gemma":0.004277599,"teacher_disagreement_score":0.0065641874,"about_ca_system_score_codex":0.00036986775,"about_ca_system_score_gemma":0.0006726538,"threshold_uncertainty_score":0.021959424},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33436605,0.0014220325,0.62466383,0.00042898825,0.0003528682,0.0004960712,0.0005666348,0.011049465,0.026654111],"genre_scores_gemma":[0.7849509,0.00037265342,0.19642405,0.00021134595,0.00004770666,0.00010980995,0.00045649635,0.00022107987,0.017205928],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995665,0.0000361787,0.00003361863,0.000117788244,0.00016829207,0.0000776199],"domain_scores_gemma":[0.999474,0.00009505356,0.00007808043,0.0002208197,0.00011005856,0.000022013623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033268705,0.00039490397,0.00039152917,0.00031376237,0.0003853633,0.00057196815,0.0018615297,0.00038379562,0.004475485],"category_scores_gemma":[0.0007564797,0.0004152105,0.00042369062,0.00042968232,0.0002845212,0.0015181062,0.00061209325,0.00044091928,0.0007811621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007405255,0.00018421706,0.0018015172,0.00050989224,0.00006681343,0.00048941106,0.00026424517,0.015605894,0.7321287,0.016557053,0.0057610758,0.22589065],"study_design_scores_gemma":[0.00017113842,0.0018751452,0.003917749,0.00004419265,0.0001355019,0.0022508008,0.00008256376,0.188994,0.7333962,0.0049055675,0.06402896,0.00019822361],"about_ca_topic_score_codex":0.0012389991,"about_ca_topic_score_gemma":0.0035203611,"teacher_disagreement_score":0.004475485,"about_ca_system_score_codex":0.0005119284,"about_ca_system_score_gemma":0.0010416221,"threshold_uncertainty_score":0.0149719715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11576056,0.0014343894,0.81485075,0.00040309632,0.0005532256,0.0003230628,0.00045746198,0.031091502,0.035126],"genre_scores_gemma":[0.68882275,0.00032794595,0.2915684,0.00046527575,0.00014663929,0.00025852217,0.00040947978,0.0002940242,0.017707016],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998018,0.00002467177,0.000017690481,0.000050185427,0.000054775726,0.000050906743],"domain_scores_gemma":[0.99973565,0.00006822378,0.000030518135,0.00006546554,0.000077544246,0.000022554697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002071437,0.00034735873,0.0003385102,0.0006068558,0.0003813417,0.0007515752,0.001612834,0.0004356831,0.009455359],"category_scores_gemma":[0.0005156113,0.00024244863,0.00021160916,0.00034069672,0.00019287117,0.00054826547,0.0004274533,0.00038652614,0.003613662],"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.0013383207,0.00023146755,0.0029235445,0.0006167352,0.0001558394,0.0005802352,0.00035975777,0.02029223,0.31938642,0.026653418,0.019033387,0.6084286],"study_design_scores_gemma":[0.00028186533,0.0013007966,0.0027770181,0.000115122966,0.00021057394,0.0014230765,0.0001001561,0.27623758,0.5908975,0.0058947373,0.12064948,0.00011212866],"about_ca_topic_score_codex":0.00070838863,"about_ca_topic_score_gemma":0.00076963066,"teacher_disagreement_score":0.009455359,"about_ca_system_score_codex":0.00030112464,"about_ca_system_score_gemma":0.00049706304,"threshold_uncertainty_score":0.03163129},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015862396,0.00039833263,0.9776945,0.0001247812,0.00003318832,0.00003728881,0.000040642637,0.001200519,0.004608305],"genre_scores_gemma":[0.5317041,0.0006551611,0.46227658,0.000107331805,0.00008386685,0.00016454882,0.00016200206,0.00039660768,0.0044497536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995603,0.00013421643,0.000023332193,0.00005036141,0.00017384824,0.00005792772],"domain_scores_gemma":[0.9995535,0.00021378312,0.00005790087,0.00010510211,0.000052924268,0.000016797601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005181254,0.0005134431,0.000320957,0.00048298898,0.00035564794,0.0007856312,0.00067848753,0.00033569976,0.0030135422],"category_scores_gemma":[0.001179128,0.00026763356,0.00037307417,0.00058419956,0.00049698603,0.00088179053,0.0005892933,0.0007236649,0.00061701745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020150175,0.000098114804,0.0004843979,0.00023142577,0.000025929963,0.0000792464,0.00009082335,0.61651754,0.049565777,0.06188927,0.0029495687,0.26786634],"study_design_scores_gemma":[0.000023768696,0.000098652585,0.00018950176,0.000016345586,0.000014438927,0.000027538113,0.000018246526,0.9478773,0.01584218,0.030702824,0.005177722,0.000011541924],"about_ca_topic_score_codex":0.0010918794,"about_ca_topic_score_gemma":0.0027208806,"teacher_disagreement_score":0.0030135422,"about_ca_system_score_codex":0.00075358874,"about_ca_system_score_gemma":0.0012178643,"threshold_uncertainty_score":0.010081351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39239135,0.0009154839,0.5347848,0.0015999308,0.000048236838,0.00014711173,0.00012327415,0.00037998427,0.06960984],"genre_scores_gemma":[0.9636519,0.00026830361,0.03225818,0.00006992139,0.000025344652,0.000058418336,0.000042019885,0.00003684581,0.0035889845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959236,0.00016664708,0.000008068103,0.000039774528,0.00012458861,0.000068474445],"domain_scores_gemma":[0.9984296,0.0011342824,0.00014468274,0.00007729397,0.00017944037,0.000034606033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092784857,0.0004129896,0.00026266222,0.000603075,0.0005068134,0.00086580066,0.0004187089,0.00068417133,0.0041299416],"category_scores_gemma":[0.004560346,0.00026561596,0.0003890171,0.0004779108,0.0007794541,0.0014483002,0.00046103966,0.00036315186,0.0002916819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003249388,0.00011539108,0.002639675,0.00026540732,0.000029019373,0.00034146887,0.00012395026,0.7272006,0.020285256,0.2126926,0.0019988148,0.033982933],"study_design_scores_gemma":[0.00001462088,0.00015477029,0.00084655406,0.000018717375,0.00001858678,0.00008408105,0.00007176438,0.9699237,0.003309605,0.023791932,0.0017558399,0.000009889662],"about_ca_topic_score_codex":0.00096690486,"about_ca_topic_score_gemma":0.0011533502,"teacher_disagreement_score":0.0041299416,"about_ca_system_score_codex":0.00073906255,"about_ca_system_score_gemma":0.0006439197,"threshold_uncertainty_score":0.013816059},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00619365,0.0006901047,0.9870576,0.00032711038,0.000034949117,0.000070794405,0.000045288114,0.0010312487,0.0045492128],"genre_scores_gemma":[0.18135783,0.0010670105,0.81243896,0.00023563148,0.0000625675,0.00035798378,0.00013630452,0.0003829679,0.00396074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947983,0.00014181375,0.000023751361,0.00007363939,0.00021324468,0.00006771438],"domain_scores_gemma":[0.99965215,0.00009879548,0.00003426699,0.00014499853,0.00005054427,0.000019181367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089432247,0.0006277254,0.00055597204,0.00054275297,0.0006822167,0.0014332865,0.0020038998,0.00080010033,0.0020025736],"category_scores_gemma":[0.0013201067,0.00046681293,0.0007021266,0.0007962404,0.0014698788,0.0021699404,0.0012260992,0.0018963731,0.0005654581],"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.00005522918,0.000092794515,0.0005638004,0.00017435174,0.00004318306,0.00012160488,0.00024204637,0.48474348,0.016894372,0.3971906,0.0050510624,0.09482746],"study_design_scores_gemma":[0.00003141532,0.000076756165,0.00018284356,0.000033101252,0.000025796844,0.00005442215,0.00004830547,0.84163135,0.004287853,0.12761626,0.025987862,0.000024010975],"about_ca_topic_score_codex":0.004654898,"about_ca_topic_score_gemma":0.0090325335,"teacher_disagreement_score":0.004654898,"about_ca_system_score_codex":0.0011875649,"about_ca_system_score_gemma":0.002150152,"threshold_uncertainty_score":0.009255588},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15958764,0.0005472688,0.8180012,0.00021014466,0.00016964917,0.00013043202,0.00011750592,0.004282458,0.016953673],"genre_scores_gemma":[0.5127836,0.0002328449,0.48078653,0.00007444878,0.00003269724,0.00009109459,0.00024169924,0.00013200207,0.0056250724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998667,0.000023289742,0.000007238341,0.000023081895,0.00005592047,0.00002370056],"domain_scores_gemma":[0.9998654,0.000028342374,0.000012769964,0.00005004704,0.00003453119,0.000008888537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011891275,0.0003938351,0.0002518304,0.00039493066,0.0002918605,0.0003747029,0.00045912535,0.00024735523,0.0032582146],"category_scores_gemma":[0.00040743753,0.00017003738,0.00023977463,0.0003868282,0.00014660369,0.00047674967,0.00033061102,0.00034504227,0.00063146517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036603204,0.00017636764,0.0016995479,0.00020381935,0.00007219335,0.00051824533,0.00013412508,0.24990314,0.22684325,0.01660428,0.0051554567,0.49832353],"study_design_scores_gemma":[0.000068181864,0.00034636768,0.0019026083,0.000016953187,0.000019531357,0.0006022597,0.000042867294,0.83879775,0.1270633,0.011097081,0.020011753,0.000031346684],"about_ca_topic_score_codex":0.0008887969,"about_ca_topic_score_gemma":0.0013312274,"teacher_disagreement_score":0.0032582146,"about_ca_system_score_codex":0.0002625826,"about_ca_system_score_gemma":0.0003643491,"threshold_uncertainty_score":0.010899842},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24421185,0.0012676645,0.44877303,0.00039548345,0.00078803126,0.00072639226,0.0008228442,0.28992444,0.013090195],"genre_scores_gemma":[0.78311056,0.00027764152,0.19320111,0.00089555164,0.00023130636,0.0004339912,0.002262083,0.010862203,0.008725479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972621,0.00036786153,0.00028725347,0.00050013495,0.0010784478,0.00050420687],"domain_scores_gemma":[0.99606776,0.00079774106,0.00033259997,0.0015079919,0.00078539486,0.00050851185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002040038,0.0013601397,0.0007074222,0.0008415077,0.0007018543,0.0019349414,0.003698907,0.00081460027,0.0042679],"category_scores_gemma":[0.005385903,0.0009057813,0.00082644663,0.0007873804,0.001442642,0.0022579278,0.0027238154,0.002277011,0.0020520224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007641885,0.002540513,0.04027252,0.0007953073,0.000498732,0.0011946107,0.0015318932,0.09529887,0.20371327,0.023453228,0.1146861,0.50837314],"study_design_scores_gemma":[0.0011345502,0.001443899,0.0084298225,0.00008967912,0.00017731659,0.00054571824,0.00018225789,0.74734825,0.1678418,0.010983494,0.061427817,0.0003954154],"about_ca_topic_score_codex":0.0051813005,"about_ca_topic_score_gemma":0.0038916476,"teacher_disagreement_score":0.0051813005,"about_ca_system_score_codex":0.0010849807,"about_ca_system_score_gemma":0.0028591035,"threshold_uncertainty_score":0.014277577},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38516554,0.00052593014,0.58185256,0.00065944873,0.00017276684,0.0001734255,0.00028543308,0.012745208,0.018419698],"genre_scores_gemma":[0.8342635,0.0001494465,0.16091076,0.00013743597,0.000024462053,0.00015364277,0.00035128873,0.0006724983,0.003336931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989073,0.00021592861,0.00006493297,0.00021713685,0.0002787563,0.0003158976],"domain_scores_gemma":[0.99779594,0.000701959,0.00019755168,0.00071622385,0.0003676503,0.00022060478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001021784,0.0006155836,0.0005217363,0.0007527945,0.0010411106,0.0017470922,0.0019365362,0.000685058,0.002961139],"category_scores_gemma":[0.0041955863,0.00051221665,0.0004907065,0.0010748437,0.0014276019,0.0021469023,0.0018631562,0.0013362966,0.00063261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012242014,0.0003741395,0.008272032,0.0002927801,0.00006329173,0.00037685785,0.0011138208,0.59763503,0.07110747,0.096798465,0.016443092,0.20629887],"study_design_scores_gemma":[0.00009777979,0.00014090283,0.0013438929,0.0000182312,0.000018175491,0.000061399,0.00012641196,0.9347903,0.020482227,0.032579016,0.010303994,0.0000376425],"about_ca_topic_score_codex":0.012154261,"about_ca_topic_score_gemma":0.013318874,"teacher_disagreement_score":0.012154261,"about_ca_system_score_codex":0.0019875264,"about_ca_system_score_gemma":0.0024313026,"threshold_uncertainty_score":0.024167001},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12031829,0.03329762,0.5130345,0.008689339,0.00095440046,0.000172492,0.0001258366,0.0009019715,0.32250544],"genre_scores_gemma":[0.4704323,0.045602947,0.35530984,0.0024232687,0.0004429747,0.00012791455,0.00029480126,0.00031586803,0.12505011],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99895465,0.00026344685,0.000042476175,0.000086887725,0.0005630537,0.00008941718],"domain_scores_gemma":[0.9988018,0.00038208516,0.000040160503,0.00013246694,0.00047625037,0.000167186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014966883,0.0004005572,0.00018857168,0.00028536253,0.00061545754,0.0016094154,0.00081798184,0.00068020483,0.004364234],"category_scores_gemma":[0.002723498,0.00025671208,0.00021609112,0.00055711146,0.00068451377,0.0022838167,0.0007360609,0.0013343488,0.001341954],"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.00018198915,0.00030923565,0.0028547074,0.0007107843,0.00004306512,0.00052951404,0.004263978,0.029059717,0.023967408,0.120914854,0.028528607,0.788636],"study_design_scores_gemma":[0.000051983738,0.0006885941,0.0016721217,0.00039996507,0.000027006381,0.0016913918,0.001308509,0.033036478,0.034320075,0.0658787,0.8608615,0.00006364019],"about_ca_topic_score_codex":0.001279138,"about_ca_topic_score_gemma":0.0023200125,"teacher_disagreement_score":0.004364234,"about_ca_system_score_codex":0.00068745995,"about_ca_system_score_gemma":0.001017373,"threshold_uncertainty_score":0.0145998},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05035377,0.00023568486,0.9409347,0.00019064549,0.00018154933,0.00011972895,0.00009706659,0.0020431215,0.0058437353],"genre_scores_gemma":[0.6699,0.00045919663,0.31209487,0.0002814043,0.00018750752,0.00047340544,0.00039126206,0.0010482051,0.015164144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967146,0.000855713,0.0003683065,0.00046198367,0.0009719153,0.0006274391],"domain_scores_gemma":[0.9890358,0.0041436595,0.0011499221,0.002900658,0.002074768,0.00069524825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035574802,0.0006551732,0.00079845067,0.00079340884,0.0012717376,0.002486117,0.0024819437,0.00083328865,0.0038420581],"category_scores_gemma":[0.015099366,0.0006522947,0.0007927619,0.0008147532,0.0010431301,0.0032963161,0.0030979307,0.001440006,0.0012889201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004119648,0.00043809536,0.00751527,0.0009094578,0.0001614507,0.0032078465,0.0033553038,0.20611282,0.07272302,0.39927843,0.0136858,0.28849298],"study_design_scores_gemma":[0.0003940166,0.00039881442,0.0008066535,0.00012654855,0.00017624235,0.0005635529,0.00021424273,0.6843497,0.05156496,0.22453918,0.03674705,0.00011908083],"about_ca_topic_score_codex":0.0022104785,"about_ca_topic_score_gemma":0.0015592129,"teacher_disagreement_score":0.0038420581,"about_ca_system_score_codex":0.0007238104,"about_ca_system_score_gemma":0.0022824653,"threshold_uncertainty_score":0.018813968},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05200779,0.00043156164,0.93469477,0.00041397035,0.00011598874,0.00007294586,0.00006464229,0.0030380404,0.0091602355],"genre_scores_gemma":[0.5063284,0.0003516972,0.4844794,0.00017448737,0.00007859709,0.0001577973,0.000215282,0.00031433153,0.007900027],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995585,0.00008867241,0.000037781167,0.00006393745,0.00017285482,0.00007824634],"domain_scores_gemma":[0.99937063,0.00014983796,0.000030955624,0.00025739722,0.00013709327,0.000054023676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040419068,0.0003079212,0.0004602574,0.0002706832,0.00070655945,0.0012678801,0.0014535375,0.00077610626,0.0036488776],"category_scores_gemma":[0.0012327889,0.00037275,0.00060607516,0.00041507534,0.0004841999,0.0018839345,0.0012337203,0.00086132524,0.00078856794],"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.00077479094,0.00039274117,0.0039836066,0.00042598648,0.00015784217,0.0011264179,0.00075962255,0.3084953,0.10033904,0.2321829,0.020760173,0.33060163],"study_design_scores_gemma":[0.00007409674,0.00012314627,0.00018491663,0.000020637057,0.000031757387,0.00014152005,0.00003471692,0.92917943,0.015594919,0.032425612,0.02216828,0.000020892492],"about_ca_topic_score_codex":0.0016409773,"about_ca_topic_score_gemma":0.0023921179,"teacher_disagreement_score":0.0036488776,"about_ca_system_score_codex":0.00047508997,"about_ca_system_score_gemma":0.0008729484,"threshold_uncertainty_score":0.012206733},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04328963,0.0006445753,0.8683166,0.00034416615,0.00034878557,0.00036654674,0.0025180692,0.040214866,0.043956723],"genre_scores_gemma":[0.12945043,0.0004902329,0.83526146,0.0003505876,0.00007678747,0.00043363438,0.0058671213,0.005866052,0.022203628],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974865,0.000028849565,0.000018546296,0.000045603156,0.00011115453,0.000047134694],"domain_scores_gemma":[0.9997311,0.00005143745,0.000015110488,0.000045481833,0.00014219806,0.000014620621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027211543,0.000491533,0.00042407977,0.00047511284,0.0003326766,0.0006615688,0.0006275504,0.00029947696,0.008672952],"category_scores_gemma":[0.00086216076,0.00035122677,0.0004165207,0.0006833255,0.00019252006,0.0005008395,0.00046833968,0.00072838634,0.0053552133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061609567,0.0002480351,0.004000893,0.00050746696,0.00012710108,0.00055050827,0.0003163019,0.10179498,0.0815239,0.081858054,0.1472038,0.5812529],"study_design_scores_gemma":[0.00023804231,0.0001887714,0.0019941933,0.00010085922,0.00009327535,0.00046732734,0.0000963932,0.56207013,0.08940551,0.022818258,0.32245588,0.00007127233],"about_ca_topic_score_codex":0.0018810934,"about_ca_topic_score_gemma":0.0027171501,"teacher_disagreement_score":0.008672952,"about_ca_system_score_codex":0.00048024917,"about_ca_system_score_gemma":0.0014350887,"threshold_uncertainty_score":0.029013932},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40690514,0.00077670254,0.5791293,0.00028075709,0.00012845431,0.00009784728,0.0001796936,0.0076461937,0.0048558707],"genre_scores_gemma":[0.91077316,0.00010539932,0.08712253,0.00006437852,0.00003353206,0.00004978322,0.00015020806,0.00009358812,0.0016074206],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99973506,0.000059374284,0.000015569272,0.000055145927,0.00009319007,0.00004157971],"domain_scores_gemma":[0.99936205,0.00023706983,0.00008333498,0.00013896642,0.00013105244,0.000047482565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029125312,0.00038877167,0.00035205143,0.000482538,0.0002866865,0.0005122159,0.00080590165,0.00023501455,0.0020579277],"category_scores_gemma":[0.0011392202,0.00024176191,0.00008789044,0.00050015777,0.00022532092,0.00076138455,0.00040052534,0.00037188106,0.00038718278],"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.0011803367,0.00015596561,0.009516314,0.00014877843,0.000064922024,0.00040000345,0.00010814328,0.12849197,0.16669807,0.0043840175,0.007314522,0.6815369],"study_design_scores_gemma":[0.00013559191,0.0005308344,0.0038882133,0.000013143191,0.00004941887,0.00039826636,0.000043924974,0.8471204,0.13755691,0.0037563876,0.0064725545,0.00003429592],"about_ca_topic_score_codex":0.0006720905,"about_ca_topic_score_gemma":0.0015486003,"teacher_disagreement_score":0.0020579277,"about_ca_system_score_codex":0.000316949,"about_ca_system_score_gemma":0.00066154863,"threshold_uncertainty_score":0.0068845153},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74623126,0.0018479483,0.2193606,0.00038768767,0.00013916088,0.00014993735,0.00015503951,0.028233677,0.003494711],"genre_scores_gemma":[0.9251418,0.0002751793,0.071074195,0.0002277241,0.000052033563,0.00005786827,0.00016684756,0.00079150917,0.0022127386],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990062,0.000116803436,0.00011532928,0.00016293953,0.00044126704,0.00015751022],"domain_scores_gemma":[0.9922776,0.0016329096,0.0010804079,0.0032265973,0.0014060768,0.0003762941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084193406,0.0009353818,0.00085367064,0.0011386501,0.00046440336,0.0015995093,0.0024192848,0.00053042534,0.0016304774],"category_scores_gemma":[0.005306728,0.0006230803,0.00044906666,0.00065749383,0.00078792905,0.002007371,0.0014521235,0.00090313435,0.0005749656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025638682,0.00092548656,0.031406965,0.00054515776,0.00027520696,0.000643985,0.00090422446,0.067834824,0.59153557,0.008215672,0.0057881735,0.28936085],"study_design_scores_gemma":[0.00023514996,0.0014990382,0.011972847,0.00006464096,0.00042238444,0.0009905789,0.00020999253,0.36427638,0.5944123,0.004041299,0.021708421,0.00016695699],"about_ca_topic_score_codex":0.0013715684,"about_ca_topic_score_gemma":0.0014661576,"teacher_disagreement_score":0.0024192848,"about_ca_system_score_codex":0.00071854587,"about_ca_system_score_gemma":0.0013660535,"threshold_uncertainty_score":0.0054545403},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033078525,0.00063963776,0.92840755,0.00047602618,0.00048153888,0.0005601406,0.0003352928,0.0075872825,0.02843404],"genre_scores_gemma":[0.24877383,0.00044488377,0.71400267,0.00036979595,0.00014370607,0.00034753114,0.00075571367,0.0003570745,0.034804728],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99976236,0.00004298439,0.000015782913,0.000046129815,0.00010340627,0.000029310515],"domain_scores_gemma":[0.9997758,0.00003199677,0.00001815369,0.000042969477,0.00008814486,0.00004291894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003067726,0.00039678544,0.00027563446,0.00038292218,0.00034085463,0.00071379874,0.0011530065,0.00042073903,0.01523169],"category_scores_gemma":[0.0004227772,0.00026766318,0.00022836338,0.0003253037,0.0002449429,0.0006593965,0.00033505357,0.00062236213,0.0034494626],"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.0008988058,0.00031446695,0.0021665262,0.000930678,0.00013118789,0.00066496833,0.00019936278,0.050605375,0.3064443,0.08598783,0.060066804,0.49158978],"study_design_scores_gemma":[0.00047924815,0.0024201002,0.0028919554,0.000117241194,0.00015319584,0.001672868,0.00007768571,0.39808026,0.15630561,0.0075587207,0.43013567,0.000107446715],"about_ca_topic_score_codex":0.0011088116,"about_ca_topic_score_gemma":0.0019467125,"teacher_disagreement_score":0.01523169,"about_ca_system_score_codex":0.000496394,"about_ca_system_score_gemma":0.00082262146,"threshold_uncertainty_score":0.050955117},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77493644,0.0015536522,0.2070646,0.0005429835,0.00018532509,0.00018264566,0.00012703374,0.0077516837,0.00765571],"genre_scores_gemma":[0.90628743,0.00031960447,0.090654105,0.00012180004,0.000058834645,0.000093443545,0.0001795272,0.0001822066,0.0021030745],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993216,0.000110806,0.00006767759,0.00009848741,0.00024975115,0.00015179814],"domain_scores_gemma":[0.9979722,0.00042767197,0.00044268125,0.00053338456,0.0005131511,0.0001109128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005931708,0.0007131712,0.00049301743,0.00063574023,0.0004651778,0.0006635756,0.0013060425,0.00038939388,0.0011355664],"category_scores_gemma":[0.0029646337,0.00023263757,0.00031010926,0.0009557014,0.00023970194,0.000813076,0.00088858226,0.0005899725,0.00053135643],"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.0011767313,0.00076736434,0.0182226,0.000261825,0.000087035,0.00029173473,0.0004369303,0.08657103,0.24883567,0.0033658084,0.006540103,0.63344324],"study_design_scores_gemma":[0.00020178454,0.0018344217,0.013662748,0.00004909428,0.00011766755,0.00071127736,0.00039578122,0.7220056,0.2430583,0.0049175373,0.012968039,0.00007773554],"about_ca_topic_score_codex":0.0016358505,"about_ca_topic_score_gemma":0.0018598381,"teacher_disagreement_score":0.0016358505,"about_ca_system_score_codex":0.00037640295,"about_ca_system_score_gemma":0.000969346,"threshold_uncertainty_score":0.0037988424},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97770715,0.0013055782,0.017569294,0.00040161537,0.00005430436,0.000034687702,0.000046820787,0.00034672738,0.00253386],"genre_scores_gemma":[0.9918526,0.00038596295,0.0070848074,0.000056742,0.000022417005,0.00001414875,0.000028715845,0.00007036413,0.00048417482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991104,0.00037969626,0.000037397593,0.00007892148,0.00022106421,0.00017249385],"domain_scores_gemma":[0.9931593,0.0048568114,0.00092742755,0.0005102834,0.0003682461,0.00017794792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014660556,0.00069826795,0.000464675,0.0005474931,0.00034996585,0.0011175665,0.00107681,0.00062424777,0.0014415344],"category_scores_gemma":[0.009320776,0.00048195623,0.0003383539,0.00074972044,0.0008095842,0.0031376295,0.0004958253,0.00055940077,0.00018081021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025016116,0.0007853153,0.030537372,0.0005061183,0.00023397463,0.00056407036,0.00037752354,0.8185774,0.042161513,0.01217075,0.0012442919,0.0903401],"study_design_scores_gemma":[0.00023912243,0.001672964,0.0045002056,0.000040343373,0.00024659728,0.00015908494,0.00022684093,0.9372892,0.04730845,0.006302162,0.0019637074,0.00005124178],"about_ca_topic_score_codex":0.0034103617,"about_ca_topic_score_gemma":0.006312498,"teacher_disagreement_score":0.0034103617,"about_ca_system_score_codex":0.00046348176,"about_ca_system_score_gemma":0.0010082383,"threshold_uncertainty_score":0.0077533126},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0403592,0.00022360471,0.94937176,0.00018693139,0.00008047766,0.00007362079,0.00005138961,0.004027223,0.005625849],"genre_scores_gemma":[0.48391214,0.00022813056,0.50528467,0.00014529904,0.000061959436,0.00015485391,0.00019118587,0.0010169073,0.009004906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889475,0.00033111655,0.000061560415,0.00014561786,0.00036163058,0.00020531061],"domain_scores_gemma":[0.9961184,0.0011318403,0.00025381835,0.0018701868,0.00043606025,0.00018971667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012962526,0.00045564194,0.00047649792,0.00052587246,0.0011096579,0.0015612303,0.0016030646,0.0004069314,0.0033655008],"category_scores_gemma":[0.0034378637,0.00039244656,0.0007159219,0.0012238974,0.0012730592,0.0022430494,0.0017332894,0.001076856,0.0005137057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005700626,0.00029829988,0.0030692115,0.00038518,0.0000907957,0.000456566,0.0006463865,0.11246723,0.028174825,0.4675105,0.009178991,0.37715212],"study_design_scores_gemma":[0.0001971172,0.00027508743,0.001111406,0.00008992397,0.00016465299,0.0003968093,0.00022181499,0.5228369,0.05503474,0.35810453,0.061478935,0.00008809558],"about_ca_topic_score_codex":0.003085374,"about_ca_topic_score_gemma":0.004951866,"teacher_disagreement_score":0.0033655008,"about_ca_system_score_codex":0.0014486974,"about_ca_system_score_gemma":0.0019521567,"threshold_uncertainty_score":0.011258662},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08704796,0.0029904875,0.87824196,0.0007515372,0.00019947451,0.00007492496,0.00006523733,0.0010276135,0.029600825],"genre_scores_gemma":[0.8093794,0.0023420255,0.17912638,0.00029403914,0.00021152907,0.00020880585,0.00014828921,0.00026802535,0.008021487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993667,0.00014260446,0.00004272825,0.000064505126,0.0002803913,0.000102938415],"domain_scores_gemma":[0.99881315,0.00056654884,0.00011027568,0.00026166617,0.0001787786,0.00006967893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006315717,0.00043824856,0.0004010874,0.00035933065,0.0005844588,0.00094993005,0.0006423043,0.00037683613,0.003060773],"category_scores_gemma":[0.0025297452,0.0003664842,0.0004034704,0.00040587102,0.0007264505,0.0018066216,0.001330396,0.0011915443,0.0004925529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035407743,0.00007010529,0.0011526492,0.0003739439,0.000056933866,0.00052362675,0.00034985904,0.29807457,0.042642925,0.5097138,0.0031859176,0.14350155],"study_design_scores_gemma":[0.000063241816,0.00015545615,0.0005790561,0.00006423558,0.00006348334,0.00019072204,0.00007019786,0.63390553,0.023682786,0.3146374,0.026558304,0.000029648167],"about_ca_topic_score_codex":0.0009739468,"about_ca_topic_score_gemma":0.001349045,"teacher_disagreement_score":0.003060773,"about_ca_system_score_codex":0.00061512354,"about_ca_system_score_gemma":0.0008117193,"threshold_uncertainty_score":0.010239363},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6253964,0.0057127746,0.33713937,0.0015459815,0.0001271261,0.000114079936,0.00027407004,0.004809249,0.024880953],"genre_scores_gemma":[0.9182233,0.0008174042,0.07426427,0.0004377002,0.000036009027,0.00010854782,0.00021491875,0.00039036115,0.0055074664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973685,0.000028843368,0.000009142713,0.000041753116,0.00010121774,0.00008223013],"domain_scores_gemma":[0.99976295,0.00007310913,0.000046645353,0.000038284474,0.000056854806,0.0000221571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015401714,0.00067151006,0.00040006934,0.00041706025,0.0005477368,0.00066711765,0.0010506174,0.00046265894,0.0016605052],"category_scores_gemma":[0.0007478693,0.00032197512,0.00029781304,0.0008798518,0.00037994992,0.0008068241,0.0006310098,0.0005911511,0.0004225699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007801143,0.00025914947,0.0072411927,0.0004906809,0.00014274183,0.0006147478,0.0004985178,0.3346961,0.33387616,0.015581172,0.017343402,0.288476],"study_design_scores_gemma":[0.00012489292,0.00055459864,0.0047928477,0.00004567903,0.000118076416,0.00031672776,0.000109879154,0.7957052,0.16819093,0.007811591,0.022167351,0.000062300096],"about_ca_topic_score_codex":0.0049422886,"about_ca_topic_score_gemma":0.009340557,"teacher_disagreement_score":0.0049422886,"about_ca_system_score_codex":0.00085072214,"about_ca_system_score_gemma":0.00087811606,"threshold_uncertainty_score":0.009827077},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09353435,0.00015202242,0.88309,0.000187299,0.00008443282,0.0002055765,0.00019108441,0.0056527536,0.016902491],"genre_scores_gemma":[0.38308,0.00014374728,0.6096392,0.00015999415,0.000027953587,0.00025764998,0.00046159702,0.0004316918,0.0057981065],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99980384,0.000025105819,0.000013925894,0.000030648902,0.00010113469,0.000025311103],"domain_scores_gemma":[0.9997037,0.00008874917,0.00002790234,0.00006384558,0.000094404095,0.000021369528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023889859,0.00060052524,0.0002463808,0.00038938926,0.00029481403,0.0006674964,0.00085729314,0.00026168436,0.0052127396],"category_scores_gemma":[0.00093659776,0.00022437036,0.0003308721,0.00038323112,0.00026700355,0.00048508644,0.00036022498,0.00044048385,0.0010690647],"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.0016024063,0.00033944251,0.004647713,0.00033288694,0.00012642749,0.00044199845,0.00043241805,0.15696532,0.18268114,0.03393282,0.012154239,0.60634327],"study_design_scores_gemma":[0.00029072072,0.0005707827,0.0013870773,0.000027306216,0.000056503068,0.0003089507,0.00009656294,0.7528856,0.20281678,0.0046432945,0.03685982,0.00005666463],"about_ca_topic_score_codex":0.0016065218,"about_ca_topic_score_gemma":0.0019270041,"teacher_disagreement_score":0.0052127396,"about_ca_system_score_codex":0.0006034666,"about_ca_system_score_gemma":0.00066435896,"threshold_uncertainty_score":0.017438412},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08749738,0.00039024028,0.87805974,0.00023406079,0.00006493711,0.00035326998,0.00041510945,0.023006188,0.009979025],"genre_scores_gemma":[0.24407373,0.00021839992,0.7477068,0.00015955426,0.000018437908,0.00017965859,0.00067867583,0.0013770704,0.005587733],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99832696,0.00025476055,0.0001281229,0.00035971086,0.00072199886,0.00020837596],"domain_scores_gemma":[0.99578995,0.0020840587,0.0007500543,0.0007204766,0.0005666239,0.000088830275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008845056,0.001061759,0.00063920143,0.0018709557,0.00081735855,0.0011499281,0.0010236962,0.000590606,0.004745335],"category_scores_gemma":[0.005114326,0.0006486421,0.0007121477,0.0010899294,0.0011320803,0.0016289551,0.0012513234,0.00095972035,0.001084544],"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.0009212819,0.00021598271,0.005831698,0.000782657,0.00008922449,0.0015318192,0.00079504977,0.06772033,0.1026555,0.037104223,0.012385865,0.7699663],"study_design_scores_gemma":[0.0001432277,0.00029195903,0.0027419114,0.00024697802,0.00006466518,0.0014881433,0.00020882538,0.6540212,0.21697064,0.08283872,0.040826246,0.00015747055],"about_ca_topic_score_codex":0.0035819155,"about_ca_topic_score_gemma":0.006705178,"teacher_disagreement_score":0.004745335,"about_ca_system_score_codex":0.0007285654,"about_ca_system_score_gemma":0.0018240467,"threshold_uncertainty_score":0.015874743},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18795118,0.0022347379,0.78968775,0.00023932414,0.00012105847,0.0002396713,0.0002658267,0.012947838,0.0063126646],"genre_scores_gemma":[0.5752678,0.0010509224,0.416997,0.00021658736,0.00006036065,0.00020973297,0.00059148506,0.00059468363,0.0050114216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999666,0.0000717197,0.00003394328,0.000036735408,0.0001283966,0.00006324348],"domain_scores_gemma":[0.99911827,0.00015765277,0.000106415624,0.00038392373,0.00018280666,0.000050928105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060352153,0.0004039663,0.00042492978,0.0006850296,0.0004958653,0.0009150456,0.0016375063,0.0004431485,0.0016858926],"category_scores_gemma":[0.0010877687,0.0003337166,0.0004105688,0.0011304725,0.00046787248,0.0023063933,0.00058370805,0.0006190393,0.0003719506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020402002,0.00055449264,0.0106323175,0.00085992634,0.0002965258,0.0005035852,0.00082612585,0.16239615,0.13132498,0.06557341,0.015247634,0.6097446],"study_design_scores_gemma":[0.00059426593,0.0016881372,0.0042954492,0.00012151076,0.00034432497,0.0011523569,0.00012366688,0.73601544,0.13581242,0.021661457,0.09793285,0.00025808509],"about_ca_topic_score_codex":0.002613561,"about_ca_topic_score_gemma":0.0049832934,"teacher_disagreement_score":0.002613561,"about_ca_system_score_codex":0.0005823696,"about_ca_system_score_gemma":0.0012146385,"threshold_uncertainty_score":0.005639851},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2396647,0.00041889193,0.73996824,0.000099014236,0.00005090656,0.000075963915,0.00014349747,0.0058247754,0.013753989],"genre_scores_gemma":[0.8592029,0.00014864307,0.13599193,0.00006339002,0.000018000457,0.00008217873,0.0001802775,0.0004649313,0.0038477285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99989784,0.000016798194,0.0000057196658,0.000016820253,0.000037886377,0.00002490623],"domain_scores_gemma":[0.9998727,0.000042415177,0.000024712235,0.000027279262,0.000028109118,0.0000048102293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012835873,0.00037612932,0.0002242194,0.000317788,0.00018402269,0.00027237032,0.00032716297,0.00013600236,0.002454236],"category_scores_gemma":[0.0004609149,0.00010287762,0.0002736191,0.00037488082,0.00021068146,0.00036455566,0.0003309538,0.00022320343,0.0002590582],"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.00034750925,0.00011104393,0.0016150366,0.00020813661,0.000047686673,0.0001758322,0.00016189835,0.52432346,0.11430663,0.024927566,0.003135925,0.33063927],"study_design_scores_gemma":[0.000056265333,0.0002696518,0.0005835685,0.000009949509,0.00003065088,0.00009892528,0.000042158477,0.90266085,0.07612742,0.010245903,0.009863576,0.00001115498],"about_ca_topic_score_codex":0.0010384202,"about_ca_topic_score_gemma":0.0015771082,"teacher_disagreement_score":0.002454236,"about_ca_system_score_codex":0.00022167453,"about_ca_system_score_gemma":0.00044769954,"threshold_uncertainty_score":0.008210182},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014943604,0.0011279575,0.5573283,0.0006643076,0.0007083359,0.000364264,0.0053380216,0.30667835,0.11284682],"genre_scores_gemma":[0.44956464,0.0011280489,0.26553014,0.0014140565,0.000553154,0.0016308242,0.03270146,0.037829526,0.20964815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993587,0.000072371506,0.000058841157,0.00013018589,0.00025964138,0.00012032799],"domain_scores_gemma":[0.99861217,0.0002264439,0.00009382648,0.0004475357,0.00053876854,0.0000811807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041244,0.0012086062,0.00053368724,0.0009566575,0.0005445558,0.0019568885,0.0035186152,0.00089129526,0.1483665],"category_scores_gemma":[0.0019514359,0.0006094859,0.000591619,0.00080844556,0.0003309863,0.0017252908,0.001648556,0.001453368,0.040329903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009933751,0.00012697223,0.0022486383,0.0013891369,0.0001246064,0.00077692885,0.00030223347,0.012663829,0.034244787,0.036654703,0.41189003,0.49858478],"study_design_scores_gemma":[0.00047940528,0.0003593534,0.001659247,0.00022664224,0.00007615457,0.0010041705,0.000071588365,0.10110446,0.11749145,0.017245192,0.7601411,0.00014125458],"about_ca_topic_score_codex":0.0019831415,"about_ca_topic_score_gemma":0.0028932448,"teacher_disagreement_score":0.1483665,"about_ca_system_score_codex":0.0013001349,"about_ca_system_score_gemma":0.0009054172,"threshold_uncertainty_score":0.4963354},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98351073,0.00010066389,0.015441292,0.00007774476,0.0000044847516,0.00001938238,0.00013251315,0.00024716352,0.00046599898],"genre_scores_gemma":[0.9942311,0.000038896975,0.005357778,0.000012384399,0.000002405565,0.000015654558,0.0001631874,0.000020684362,0.00015801091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996126,0.00012141979,0.000020697966,0.0000867332,0.00009363804,0.00006487609],"domain_scores_gemma":[0.9966799,0.0022421104,0.0002617136,0.00031776438,0.00039211393,0.00010640809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009082911,0.00094036217,0.0006338004,0.0007890562,0.0005278091,0.0005773349,0.0008195388,0.0011223957,0.0003940554],"category_scores_gemma":[0.0063880635,0.00044589947,0.00038218513,0.0014665164,0.00041201085,0.00097159646,0.000401122,0.0006905968,0.00016668568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018301231,0.00013732516,0.025764355,0.00003357665,0.000026603066,0.00007660817,0.000054044238,0.9559299,0.004032717,0.00031520944,0.00026546308,0.0131811965],"study_design_scores_gemma":[0.0000025572106,0.000020019577,0.0036265156,0.0000016395485,0.0000033447393,0.000011811416,0.000013625996,0.9943646,0.0017491878,0.00017663754,0.000025419933,0.0000046156388],"about_ca_topic_score_codex":0.026493574,"about_ca_topic_score_gemma":0.015993081,"teacher_disagreement_score":0.026493574,"about_ca_system_score_codex":0.0014021891,"about_ca_system_score_gemma":0.0008915773,"threshold_uncertainty_score":0.052678764},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09671009,0.0040384224,0.4066277,0.0034839353,0.0023513602,0.0013219365,0.088296846,0.097327046,0.29984266],"genre_scores_gemma":[0.43612918,0.0029892542,0.32530075,0.0021628288,0.00028011444,0.0019227794,0.13656633,0.016056513,0.07859231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938846,0.0001726309,0.000033476907,0.000067801,0.00021112282,0.00012653683],"domain_scores_gemma":[0.9992483,0.00022876353,0.00004695582,0.00013185636,0.0002446684,0.000099457146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009839048,0.0010698799,0.00096908555,0.0007586151,0.0007290832,0.0013407066,0.003201132,0.0015375357,0.028720377],"category_scores_gemma":[0.0027207497,0.0006255243,0.0011732543,0.000973527,0.00038410784,0.0015257667,0.0016191994,0.0022766762,0.007434605],"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.0006366733,0.0002255161,0.0041971137,0.00075295183,0.00023544875,0.00022486356,0.00017639495,0.58949614,0.0053012185,0.04575251,0.30817994,0.044821236],"study_design_scores_gemma":[0.00028222607,0.00012225022,0.00096448895,0.00006340662,0.0000640084,0.0001136022,0.00007040635,0.7858032,0.004817839,0.014363595,0.19328244,0.000052529394],"about_ca_topic_score_codex":0.011994047,"about_ca_topic_score_gemma":0.010445465,"teacher_disagreement_score":0.028720377,"about_ca_system_score_codex":0.0012148907,"about_ca_system_score_gemma":0.002426965,"threshold_uncertainty_score":0.09607923},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104034476,0.006167448,0.46184042,0.0014830438,0.0022386098,0.001082255,0.0041698716,0.1533407,0.26564315],"genre_scores_gemma":[0.56467026,0.0023891486,0.25097674,0.0022807145,0.00030392854,0.0010517593,0.012472727,0.014128775,0.15172587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991252,0.00008850828,0.00006417676,0.00017254805,0.00041981976,0.00012973102],"domain_scores_gemma":[0.9984559,0.00030856574,0.0000944397,0.0006059502,0.0004380136,0.00009716148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008789917,0.00055462605,0.0005642451,0.000722459,0.00073280325,0.0017621566,0.003015348,0.0007977213,0.019573295],"category_scores_gemma":[0.003021863,0.00049693725,0.00041166478,0.0006059533,0.00082797854,0.0022125556,0.0023446076,0.001283946,0.005117697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027185737,0.0003274521,0.0042700698,0.0018333388,0.00020485274,0.00042616058,0.00065107155,0.023678163,0.07440599,0.105110474,0.26831526,0.5180586],"study_design_scores_gemma":[0.0006268364,0.00045273764,0.0020924914,0.00019539046,0.00011373278,0.00060539675,0.00026754648,0.17392845,0.103966095,0.028502673,0.68908924,0.00015933166],"about_ca_topic_score_codex":0.0032263752,"about_ca_topic_score_gemma":0.007266226,"teacher_disagreement_score":0.019573295,"about_ca_system_score_codex":0.0007090221,"about_ca_system_score_gemma":0.0020432693,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4396521,0.0015705134,0.54451954,0.00035289838,0.00016473497,0.000084464715,0.000073766976,0.000992657,0.012589373],"genre_scores_gemma":[0.8496132,0.00029950906,0.14448771,0.00007419529,0.00003189429,0.000058239275,0.00008106035,0.00005944041,0.005294732],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997911,0.000033330416,0.0000182184,0.00004507214,0.00006756555,0.000044739903],"domain_scores_gemma":[0.9998149,0.000055953686,0.000030277786,0.000037389967,0.000034623983,0.000026759273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021173226,0.00021499902,0.00019249528,0.00021731101,0.0002873561,0.0005385664,0.00054472545,0.00025674168,0.0016726211],"category_scores_gemma":[0.0005826134,0.00027371358,0.00018381787,0.00022658489,0.00019473457,0.0006137652,0.00034024488,0.0003699113,0.00027497433],"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.0010190685,0.00025062938,0.0026338026,0.000362052,0.000055713877,0.0010721295,0.0004538394,0.06444474,0.6625767,0.030741189,0.0020453278,0.23434493],"study_design_scores_gemma":[0.00027745528,0.0014298358,0.0022191396,0.000046757083,0.00013394488,0.0009592161,0.000098912176,0.70818716,0.24045642,0.009901374,0.03622556,0.0000642552],"about_ca_topic_score_codex":0.00052258855,"about_ca_topic_score_gemma":0.001214125,"teacher_disagreement_score":0.0016726211,"about_ca_system_score_codex":0.00030102962,"about_ca_system_score_gemma":0.00050033466,"threshold_uncertainty_score":0.0055955052},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007939171,0.04526431,0.33669665,0.02376245,0.01065359,0.0009851562,0.005438918,0.012285911,0.55697393],"genre_scores_gemma":[0.30780056,0.08290722,0.3161124,0.013223565,0.009987712,0.0019103881,0.021635555,0.0040940917,0.24232845],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9947765,0.0008914656,0.0002205032,0.00064936205,0.0029436888,0.00051849574],"domain_scores_gemma":[0.99592704,0.0008189299,0.00016647013,0.0010705864,0.0015012556,0.00051573856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020565044,0.0012482747,0.0013558303,0.001732877,0.002133517,0.008604916,0.0038902573,0.002644052,0.047935553],"category_scores_gemma":[0.010598592,0.0005075384,0.0008278524,0.004079775,0.0015951981,0.0060523017,0.005403855,0.0029772597,0.031459127],"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.00014011575,0.00009824848,0.0016110414,0.0010823407,0.00012546749,0.00037525315,0.0002631133,0.008467841,0.0025848788,0.33464903,0.37641653,0.27418607],"study_design_scores_gemma":[0.000033189874,0.000043155032,0.000519434,0.00025701078,0.00002108279,0.00029834363,0.00012830034,0.01452151,0.001455031,0.1575125,0.82516503,0.000045357567],"about_ca_topic_score_codex":0.002180433,"about_ca_topic_score_gemma":0.0013402303,"teacher_disagreement_score":0.047935553,"about_ca_system_score_codex":0.002038588,"about_ca_system_score_gemma":0.0031513297,"threshold_uncertainty_score":0.1603604},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023600345,0.00006525697,0.9566002,0.000065920874,0.00003371504,0.00032478015,0.00040308523,0.014907344,0.0039992705],"genre_scores_gemma":[0.11691454,0.00009299162,0.8745242,0.000114966955,0.00001940978,0.00054929114,0.0016135683,0.0035777534,0.0025932884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991726,0.00013579766,0.00006123928,0.00017609424,0.00035573714,0.00009841893],"domain_scores_gemma":[0.9971636,0.001181195,0.00023400168,0.0006721997,0.00068673823,0.00006224814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080898433,0.0012287801,0.00045609017,0.0011567544,0.0004667662,0.0006660009,0.0012711405,0.00041801512,0.0058568697],"category_scores_gemma":[0.0047357217,0.0006679912,0.0008790189,0.00074309396,0.0004775957,0.00060846785,0.0008863304,0.0009895072,0.0021974433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055284513,0.00024687397,0.0046079177,0.0009111122,0.00013721839,0.00093567645,0.00043609,0.13751994,0.20608214,0.023906577,0.02330426,0.60135937],"study_design_scores_gemma":[0.0001513793,0.00030873512,0.0019037033,0.00009498865,0.000072232826,0.0004769775,0.00008478071,0.77502364,0.16830093,0.012704215,0.04079369,0.000084732215],"about_ca_topic_score_codex":0.002003564,"about_ca_topic_score_gemma":0.003342211,"teacher_disagreement_score":0.0058568697,"about_ca_system_score_codex":0.00055007316,"about_ca_system_score_gemma":0.0018692743,"threshold_uncertainty_score":0.01959318},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8384273,0.0004567997,0.13689853,0.00034106732,0.00006779366,0.00011492774,0.0011158284,0.0028092659,0.01976851],"genre_scores_gemma":[0.95362574,0.00019830278,0.042604975,0.00004717773,0.000012574893,0.00017575322,0.0005112099,0.00017468927,0.0026495385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998455,0.00003546066,0.000010205475,0.000019148663,0.00006652775,0.000023138795],"domain_scores_gemma":[0.99971527,0.00014232766,0.000029474177,0.000044856428,0.000053390184,0.000014708747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025738848,0.00041607983,0.0005426565,0.0002274429,0.00031143276,0.00039561497,0.0006706771,0.0003905657,0.0027053915],"category_scores_gemma":[0.0010150553,0.00026578316,0.00034825385,0.0004983634,0.0002486304,0.00049960555,0.00039547848,0.00049882726,0.000190285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008805453,0.00005288739,0.0020244066,0.00008086574,0.000028776129,0.00009757546,0.0000939496,0.9787147,0.004610304,0.0043797255,0.0010776296,0.00875118],"study_design_scores_gemma":[0.000011601925,0.000026730973,0.00039922545,0.0000022419745,0.0000026666287,0.000008122368,0.000007784767,0.99720424,0.0012996917,0.00041387786,0.0006202489,0.0000034742595],"about_ca_topic_score_codex":0.005031318,"about_ca_topic_score_gemma":0.0030216244,"teacher_disagreement_score":0.005031318,"about_ca_system_score_codex":0.0003752307,"about_ca_system_score_gemma":0.0006435896,"threshold_uncertainty_score":0.010004044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035330985,0.012982807,0.62523717,0.005390744,0.003042252,0.0009601553,0.0019011329,0.022337675,0.2928171],"genre_scores_gemma":[0.21150835,0.0040535005,0.632757,0.0013428521,0.0006101007,0.0017982753,0.0028958204,0.0010292564,0.14400485],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990558,0.00025556123,0.0000631309,0.00016084539,0.00038896513,0.000075744014],"domain_scores_gemma":[0.99913377,0.000106826854,0.000057706307,0.00025027734,0.00028336103,0.0001681799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007610252,0.00049010676,0.0006049987,0.0006602785,0.0010361202,0.0014670962,0.0009869039,0.0007832731,0.018880036],"category_scores_gemma":[0.0031204694,0.0005378095,0.00027184913,0.0010365957,0.00071513804,0.0014216752,0.0021978135,0.0019520117,0.008118958],"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.00056878093,0.00014361106,0.0022381472,0.0005554518,0.00009693063,0.00044278352,0.00040444074,0.024615483,0.027397133,0.22949864,0.17053762,0.54350096],"study_design_scores_gemma":[0.00028787417,0.00031381552,0.001342774,0.00012833366,0.00005686739,0.0006269553,0.00006405588,0.086566195,0.020348724,0.046456296,0.84373516,0.00007300776],"about_ca_topic_score_codex":0.0007936807,"about_ca_topic_score_gemma":0.0011649944,"teacher_disagreement_score":0.018880036,"about_ca_system_score_codex":0.0007077958,"about_ca_system_score_gemma":0.00146568,"threshold_uncertainty_score":0.06316},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045507114,0.00079456234,0.79447573,0.00024907818,0.00032849362,0.00033685897,0.0010475648,0.12986258,0.027398014],"genre_scores_gemma":[0.3714497,0.0009978039,0.51723796,0.00081449066,0.00016078349,0.0005660108,0.0042968662,0.035149924,0.06932647],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991897,0.000112578484,0.00006209767,0.00018779238,0.0003221559,0.0001256891],"domain_scores_gemma":[0.9979924,0.0006391327,0.00016442298,0.0008448645,0.0003129271,0.000046258097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005793361,0.00088920054,0.0005182002,0.0009982892,0.00039171003,0.0009596216,0.0015133144,0.0007469844,0.012717774],"category_scores_gemma":[0.004014535,0.00059387257,0.0005958331,0.0005810476,0.0004879687,0.0017311111,0.0020458964,0.0013530654,0.0066884942],"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.00065676164,0.00020049515,0.003307232,0.00066130003,0.00006276478,0.0013862831,0.0010688201,0.012705215,0.1251118,0.04681317,0.050965555,0.75706047],"study_design_scores_gemma":[0.00020449856,0.00030908,0.0056741918,0.00032681425,0.00019912948,0.0030559492,0.00027676174,0.12803975,0.35354847,0.05773078,0.45040435,0.0002302142],"about_ca_topic_score_codex":0.0007499265,"about_ca_topic_score_gemma":0.0013298247,"teacher_disagreement_score":0.012717774,"about_ca_system_score_codex":0.00047084302,"about_ca_system_score_gemma":0.0004786309,"threshold_uncertainty_score":0.0425452},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35032997,0.000872423,0.63206047,0.00041064556,0.000045248664,0.00011465935,0.00046146728,0.0024974127,0.013207608],"genre_scores_gemma":[0.9618419,0.00046303062,0.03109003,0.00009713436,0.000022252087,0.00012251036,0.00015477696,0.00012435575,0.0060841334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995714,0.000059892507,0.000019788782,0.000053596184,0.00021078505,0.00008456498],"domain_scores_gemma":[0.99892884,0.000469019,0.00022747429,0.00014045218,0.00020240685,0.00003181267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039053144,0.00068575505,0.0006100955,0.00069581275,0.00032045163,0.00079087145,0.0014865417,0.0009274115,0.0012642468],"category_scores_gemma":[0.002486952,0.00057587744,0.0005914862,0.0008199344,0.0005141287,0.0012626282,0.00054754247,0.00064401573,0.00042473339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027596543,0.000022755612,0.0007238381,0.000021190124,0.00001186082,0.000056899855,0.000048497554,0.9880669,0.0038686388,0.002685781,0.00016592766,0.0043001953],"study_design_scores_gemma":[9.557247e-7,0.0000062425775,0.000055333687,0.0000012069389,0.0000019604759,0.000005159115,0.0000026984785,0.9989993,0.00049434335,0.0003382805,0.000093073984,0.0000015864942],"about_ca_topic_score_codex":0.013392673,"about_ca_topic_score_gemma":0.008399817,"teacher_disagreement_score":0.013392673,"about_ca_system_score_codex":0.0011662163,"about_ca_system_score_gemma":0.0013729864,"threshold_uncertainty_score":0.026629448},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060060746,0.0006169888,0.9859234,0.0002730375,0.00012258842,0.00004666699,0.00007076135,0.0016508343,0.005289629],"genre_scores_gemma":[0.35509467,0.0008855699,0.6216795,0.00040891537,0.0004621167,0.0002743945,0.0004330919,0.00096202776,0.019799717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796885,0.0004654968,0.000080684345,0.00035228842,0.0009542902,0.00017849107],"domain_scores_gemma":[0.99465054,0.0029285268,0.0003757584,0.0010355068,0.00079807657,0.00021155577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026958506,0.0012673681,0.00085586356,0.0014290478,0.0006828949,0.002210933,0.002461652,0.0011445759,0.0124205155],"category_scores_gemma":[0.0132179195,0.0005644095,0.00053606275,0.0014338722,0.00087913114,0.0028830818,0.0026882936,0.0021925066,0.0029410138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007166838,0.00013617991,0.0020109473,0.00025937762,0.00009213665,0.00009589306,0.00014872874,0.45235297,0.013939806,0.094907,0.012245567,0.42309475],"study_design_scores_gemma":[0.000022291646,0.00005095009,0.0002041388,0.00002126295,0.000017001763,0.000041994055,0.000009421306,0.97881716,0.004742454,0.013376967,0.0026856954,0.000010655801],"about_ca_topic_score_codex":0.003352392,"about_ca_topic_score_gemma":0.005224726,"teacher_disagreement_score":0.0124205155,"about_ca_system_score_codex":0.001958173,"about_ca_system_score_gemma":0.001999435,"threshold_uncertainty_score":0.041550756},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9935644,0.00038602413,0.004532852,0.000066277105,0.000020038715,0.00000845399,0.00009082432,0.00035727894,0.00097383274],"genre_scores_gemma":[0.99721247,0.00008389621,0.0023211965,0.000022920138,0.0000053086824,0.0000066450166,0.00007853768,0.00010054649,0.00016844278],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995704,0.00008079665,0.000034678367,0.000068026704,0.00013809733,0.00010794231],"domain_scores_gemma":[0.9977996,0.0011963275,0.00036403013,0.00024884715,0.00033456806,0.000056632918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047824343,0.00044471497,0.0003393358,0.0005228566,0.00024272063,0.00045478716,0.00023420168,0.00020114987,0.00071730616],"category_scores_gemma":[0.0031827602,0.0001705357,0.00023587905,0.0006736151,0.00027583845,0.00048352795,0.00018927203,0.00033690367,0.00014063263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036705898,0.00037410192,0.026467202,0.00044579743,0.0002524137,0.0004920826,0.00023299466,0.40593097,0.46006706,0.001057974,0.0014381838,0.099570625],"study_design_scores_gemma":[0.00009288697,0.0031827174,0.04886898,0.000047354602,0.00038091064,0.00038738098,0.00021912088,0.50702924,0.43675098,0.0008589384,0.0021144608,0.000067012086],"about_ca_topic_score_codex":0.0011387423,"about_ca_topic_score_gemma":0.002223352,"teacher_disagreement_score":0.0011387423,"about_ca_system_score_codex":0.00035484208,"about_ca_system_score_gemma":0.00047334735,"threshold_uncertainty_score":0.002574563},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67234075,0.0011181434,0.3200543,0.00021472467,0.00006378044,0.00006287965,0.00007448423,0.0029190835,0.003151761],"genre_scores_gemma":[0.9531851,0.00025013072,0.044949703,0.00007834428,0.000026080179,0.000042650372,0.00008696859,0.00011529073,0.0012656874],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981576,0.000046606907,0.000013268103,0.000033294607,0.00005051365,0.000040639483],"domain_scores_gemma":[0.99928826,0.00023853955,0.00014748886,0.00015901498,0.00012899906,0.00003774949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025189764,0.00029573712,0.00014564229,0.00033847764,0.000316949,0.0002511056,0.0005452756,0.00015708314,0.0009509805],"category_scores_gemma":[0.0011791011,0.00018988228,0.000117882875,0.00048163225,0.00028665943,0.000662022,0.0003949879,0.00022438212,0.00012632644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008224771,0.0003557176,0.011089853,0.0002571636,0.00009330954,0.00033118165,0.0002597346,0.21279156,0.39215448,0.010695761,0.0023845066,0.36876428],"study_design_scores_gemma":[0.000055466986,0.0006225646,0.003353688,0.000015934582,0.00009627973,0.0003347663,0.00007465565,0.787122,0.19678444,0.0073904907,0.0041111233,0.00003858963],"about_ca_topic_score_codex":0.0013154147,"about_ca_topic_score_gemma":0.0037754779,"teacher_disagreement_score":0.0013154147,"about_ca_system_score_codex":0.00029988927,"about_ca_system_score_gemma":0.0010354498,"threshold_uncertainty_score":0.003181398},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10939526,0.000841932,0.8835655,0.0005994842,0.00008573091,0.00040358643,0.00055531866,0.001793395,0.0027598427],"genre_scores_gemma":[0.5268424,0.00036061762,0.46824583,0.00038320827,0.00011515725,0.0005908209,0.0016764576,0.00018449592,0.0016009904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893326,0.00046719433,0.00007310664,0.00027578877,0.00013686414,0.000113764385],"domain_scores_gemma":[0.9916312,0.006891599,0.0004060897,0.0003327827,0.0006006807,0.00013767499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002509818,0.0011995849,0.0013277277,0.001341084,0.0006994405,0.00091506646,0.0016355414,0.0015430372,0.002047101],"category_scores_gemma":[0.007930142,0.00080393115,0.000985911,0.0011654595,0.0011228187,0.0015283681,0.000707346,0.00223913,0.0004179179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019019491,0.00018755217,0.0010792409,0.00013387908,0.000035266807,0.000053167307,0.00008582434,0.89984846,0.0006708391,0.005325403,0.0029422883,0.08944784],"study_design_scores_gemma":[0.000037419144,0.000037302383,0.000100655656,0.000009119487,0.000007128987,0.0000073205333,0.000010949804,0.9926835,0.00035061402,0.0065054963,0.00024612297,0.0000044532403],"about_ca_topic_score_codex":0.006552748,"about_ca_topic_score_gemma":0.00919117,"teacher_disagreement_score":0.006552748,"about_ca_system_score_codex":0.0019586326,"about_ca_system_score_gemma":0.0029320174,"threshold_uncertainty_score":0.014210999},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041177165,0.0003548625,0.9460327,0.00016891217,0.000096994954,0.00006201435,0.00009312359,0.005174056,0.0068402],"genre_scores_gemma":[0.3847966,0.0003975752,0.60682076,0.00016080949,0.00006931445,0.00013866386,0.0002821888,0.0008639033,0.006470257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991301,0.0002221676,0.000035988818,0.00015019886,0.00031195948,0.00014964839],"domain_scores_gemma":[0.9986279,0.00051942514,0.00012666117,0.00040682466,0.00027711445,0.000042029744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095638,0.000824587,0.0006102008,0.002220486,0.0010510074,0.0011497845,0.0016264182,0.00059551315,0.0043419884],"category_scores_gemma":[0.0028297687,0.0004406338,0.00074408314,0.0020274152,0.0011809337,0.001878565,0.0011632523,0.0007561107,0.000743605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004081595,0.00019989024,0.003417362,0.0002355031,0.00009146524,0.00012660734,0.00019685701,0.23631024,0.04994101,0.13667761,0.005822091,0.5665732],"study_design_scores_gemma":[0.00006122175,0.000085887455,0.0005529463,0.000032691605,0.00006887745,0.00010398232,0.000049382907,0.8694764,0.04646867,0.07521833,0.007830086,0.00005151756],"about_ca_topic_score_codex":0.0051393625,"about_ca_topic_score_gemma":0.008551673,"teacher_disagreement_score":0.0051393625,"about_ca_system_score_codex":0.0012941259,"about_ca_system_score_gemma":0.0032209668,"threshold_uncertainty_score":0.0145254135},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11084107,0.00023116969,0.85747445,0.00026665666,0.000055464057,0.00018442146,0.00051782787,0.027782287,0.00264672],"genre_scores_gemma":[0.68091935,0.00015967646,0.3126243,0.00014898536,0.000031571784,0.00031906494,0.0013218753,0.0016106048,0.0028645375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997433,0.0006004789,0.0001629598,0.00039496398,0.0011773312,0.00023116902],"domain_scores_gemma":[0.9914506,0.0028636565,0.0008704339,0.0030013123,0.0015893977,0.0002245264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013135705,0.0007443992,0.00063261576,0.0017323879,0.0004933905,0.0012707774,0.0016155866,0.00077320467,0.0013772957],"category_scores_gemma":[0.012455112,0.00052792404,0.00034850324,0.0015949628,0.00054238294,0.0018474725,0.0009954671,0.0010242332,0.0006296614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009872651,0.0004893816,0.028758064,0.0002795551,0.000104383136,0.0005094858,0.0009534028,0.08693806,0.12108786,0.025880245,0.009988689,0.7240236],"study_design_scores_gemma":[0.000046521523,0.0002444104,0.004071832,0.000035541616,0.000041573683,0.0004150596,0.000121707104,0.81294155,0.15682986,0.0132846935,0.01189717,0.00007014846],"about_ca_topic_score_codex":0.0021305478,"about_ca_topic_score_gemma":0.0024266462,"teacher_disagreement_score":0.0021305478,"about_ca_system_score_codex":0.0007574723,"about_ca_system_score_gemma":0.0012818646,"threshold_uncertainty_score":0.0069468617},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12638089,0.00093493937,0.84050727,0.0002628493,0.00025103247,0.00027184555,0.00027341672,0.008137037,0.02298067],"genre_scores_gemma":[0.5144689,0.00034081336,0.46984807,0.00016591742,0.000041355917,0.000117272866,0.0004166945,0.00012593462,0.014475054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990416,0.000009851124,0.0000061119026,0.000020720436,0.00004174983,0.000017482469],"domain_scores_gemma":[0.9998745,0.000018087945,0.000010364214,0.000027841605,0.00005751177,0.0000115959065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113218506,0.0003643998,0.00019258414,0.00039539573,0.00026092425,0.00033881725,0.00061503326,0.00027131857,0.0043210634],"category_scores_gemma":[0.00027252722,0.00016795899,0.00017397094,0.00032386227,0.00010303548,0.0003489356,0.00017555096,0.00035855317,0.000955067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068659574,0.00013638656,0.002375449,0.0003137856,0.00007204216,0.0007984739,0.00012622708,0.020874273,0.41568,0.011997798,0.014051348,0.5328877],"study_design_scores_gemma":[0.00020768068,0.00135442,0.008872466,0.00008071325,0.00009951332,0.0032527708,0.000068997295,0.5022405,0.38038802,0.0023113294,0.10101954,0.00010406017],"about_ca_topic_score_codex":0.0011981985,"about_ca_topic_score_gemma":0.003369407,"teacher_disagreement_score":0.0043210634,"about_ca_system_score_codex":0.00030156164,"about_ca_system_score_gemma":0.00038987657,"threshold_uncertainty_score":0.014455438},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0112314625,0.0024510662,0.9608411,0.0010938591,0.0005360939,0.00014028112,0.00009553586,0.0032726247,0.020337963],"genre_scores_gemma":[0.086516544,0.0026803669,0.901038,0.00036933704,0.0002187223,0.00015054931,0.00039213683,0.00068387727,0.007950448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996382,0.00006963453,0.000023688252,0.000050810922,0.00016820835,0.000049340902],"domain_scores_gemma":[0.99955946,0.0001126715,0.000025502022,0.00012021772,0.00014935946,0.00003277227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045779112,0.00071851024,0.00044932595,0.00058333355,0.00059056515,0.0015017992,0.0016409274,0.00081414205,0.004607271],"category_scores_gemma":[0.0016069709,0.00058401725,0.0005383809,0.0008342627,0.0005688854,0.0019409243,0.0011026495,0.0017591547,0.0031713408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018606428,0.00008683966,0.0019384258,0.00070561946,0.00008332903,0.00043136737,0.00045863588,0.07522335,0.07955007,0.31885105,0.033304375,0.4891809],"study_design_scores_gemma":[0.000083679,0.00020404697,0.001094924,0.00015307269,0.00008876859,0.00067316217,0.0002314549,0.3999425,0.036251064,0.19064176,0.37055415,0.000081437516],"about_ca_topic_score_codex":0.0008950159,"about_ca_topic_score_gemma":0.0017238337,"teacher_disagreement_score":0.004607271,"about_ca_system_score_codex":0.0004917069,"about_ca_system_score_gemma":0.00079876074,"threshold_uncertainty_score":0.015412807},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.128345,0.00042729528,0.8459251,0.00025421943,0.0002727124,0.00017759381,0.00012288502,0.005002814,0.019472301],"genre_scores_gemma":[0.5965188,0.0002820306,0.39428735,0.00017898284,0.0000844923,0.00011724086,0.00021540339,0.00015646871,0.0081592435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998017,0.000030111552,0.000012227593,0.000052373038,0.00007631658,0.000027232723],"domain_scores_gemma":[0.9997838,0.000052365413,0.000025635876,0.000053495885,0.000068024485,0.000016669115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001770918,0.00021683164,0.00016684357,0.0003245602,0.00026354622,0.00047119346,0.0008458529,0.00027766352,0.005466661],"category_scores_gemma":[0.0005250238,0.00016326469,0.00015067383,0.00029020567,0.00020905623,0.00054440624,0.0002290199,0.00039264097,0.000901604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044712046,0.00018899726,0.0020440205,0.0002607031,0.000061971856,0.00024818975,0.00016389298,0.025438963,0.35730004,0.026960354,0.0055017713,0.581384],"study_design_scores_gemma":[0.00033212974,0.0031465676,0.0042821853,0.00006366111,0.00015892263,0.0017203965,0.00010756462,0.3751993,0.42697036,0.008589113,0.1793207,0.00010921592],"about_ca_topic_score_codex":0.00056861306,"about_ca_topic_score_gemma":0.00085707544,"teacher_disagreement_score":0.005466661,"about_ca_system_score_codex":0.00022749451,"about_ca_system_score_gemma":0.0005346809,"threshold_uncertainty_score":0.018287838},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2862209,0.07659799,0.4860324,0.018469673,0.0014009824,0.00014922528,0.00020787878,0.005247405,0.12567352],"genre_scores_gemma":[0.82065964,0.024977066,0.12930244,0.0018466206,0.0011517291,0.00008893481,0.00011225946,0.00024087881,0.021620482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998097,0.000028044293,0.000008059752,0.00002146383,0.00010638401,0.000026259891],"domain_scores_gemma":[0.99957806,0.00012514889,0.00006126389,0.000053095075,0.00015360933,0.000028887836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003010299,0.00031993692,0.00016167139,0.0003626884,0.0002179711,0.0007151224,0.0004524396,0.00050410884,0.0025533887],"category_scores_gemma":[0.0015171177,0.00014464071,0.00011953176,0.00049005746,0.00031581,0.0012138601,0.00040943414,0.0005343857,0.000939179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013966179,0.00012962015,0.003907132,0.00046080683,0.00004529357,0.0002202639,0.0002970588,0.024120977,0.13631757,0.1290497,0.011683718,0.6936282],"study_design_scores_gemma":[0.00011435679,0.0011649319,0.01255236,0.00034306204,0.00013850124,0.0011484687,0.00039675803,0.24226919,0.13653849,0.17649907,0.42875752,0.000077353696],"about_ca_topic_score_codex":0.00030444024,"about_ca_topic_score_gemma":0.0006000235,"teacher_disagreement_score":0.0025533887,"about_ca_system_score_codex":0.00027592576,"about_ca_system_score_gemma":0.00041218253,"threshold_uncertainty_score":0.008542001},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33298928,0.014662749,0.6257247,0.0014367534,0.00030094487,0.00018595472,0.00048183056,0.004653934,0.019563826],"genre_scores_gemma":[0.89614767,0.002647623,0.09262059,0.00041470292,0.00006759053,0.00009961986,0.00045474505,0.0001340285,0.0074133924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997718,0.00004988055,0.000017395476,0.000029744102,0.00010026273,0.000030956595],"domain_scores_gemma":[0.9994553,0.00009832864,0.000076013945,0.00014969482,0.00019140507,0.000029401499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021608887,0.00025952174,0.00027580373,0.0002811953,0.0002826842,0.0005714077,0.0008776497,0.00028734677,0.0017489094],"category_scores_gemma":[0.0009308507,0.00017236928,0.00025664087,0.00077722967,0.00021211842,0.00096284715,0.00047648634,0.0004908733,0.0005450646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010509235,0.0003438666,0.0091845365,0.0019896284,0.00021822499,0.0008397192,0.00036014407,0.1228321,0.37254882,0.045972396,0.023851912,0.4208077],"study_design_scores_gemma":[0.0001608059,0.0011726631,0.0036613184,0.00020165675,0.00024040349,0.0011592255,0.0002112067,0.65106875,0.21394984,0.020278528,0.10780725,0.00008829168],"about_ca_topic_score_codex":0.0007770971,"about_ca_topic_score_gemma":0.0024000017,"teacher_disagreement_score":0.0017489094,"about_ca_system_score_codex":0.00051718025,"about_ca_system_score_gemma":0.0008104603,"threshold_uncertainty_score":0.0058507323},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9703409,0.00103087,0.015942235,0.0003817944,0.00012664878,0.000051616298,0.00027504563,0.0018308166,0.01001997],"genre_scores_gemma":[0.9943123,0.00014288248,0.003760342,0.000038044498,0.000025728892,0.000014396955,0.00010952255,0.000218588,0.0013783234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979729,0.0007612785,0.000080569574,0.00016560996,0.0005081975,0.000511401],"domain_scores_gemma":[0.9772246,0.016571421,0.0010634945,0.0021288954,0.002246838,0.0007648033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031398986,0.0005150111,0.0005952235,0.0010332691,0.000989459,0.0013482486,0.0013340305,0.00081861624,0.002869283],"category_scores_gemma":[0.016294358,0.00026853124,0.0002561539,0.0012256701,0.0006212942,0.0021528238,0.0005969615,0.00075885653,0.00057246553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.02134152,0.0027594941,0.033503756,0.0008001426,0.00029932553,0.00036499323,0.0010696354,0.5383769,0.06929121,0.02145234,0.027137062,0.28360367],"study_design_scores_gemma":[0.00030976307,0.0021541647,0.01675335,0.000035604495,0.0002472225,0.00013246856,0.0011824969,0.9178823,0.051856127,0.006361987,0.002995136,0.000089341695],"about_ca_topic_score_codex":0.005223395,"about_ca_topic_score_gemma":0.0058820974,"teacher_disagreement_score":0.005223395,"about_ca_system_score_codex":0.0014187915,"about_ca_system_score_gemma":0.0013825505,"threshold_uncertainty_score":0.016605556},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09628857,0.0020739427,0.61304414,0.00055721577,0.00050915236,0.0011160226,0.017955374,0.2184651,0.04999051],"genre_scores_gemma":[0.47040102,0.0005775795,0.48792592,0.00048387345,0.00020402545,0.0010792164,0.012340539,0.008345588,0.018642193],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997561,0.00034308786,0.0001337746,0.00048133312,0.0012807755,0.00020007718],"domain_scores_gemma":[0.9907066,0.0021773574,0.0009662798,0.0030196202,0.002978055,0.00015204433],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017148849,0.0013398897,0.0009751195,0.0031953235,0.0005306008,0.0011973031,0.0029570297,0.0009793759,0.017763427],"category_scores_gemma":[0.011558286,0.00057392754,0.0005692347,0.0024358658,0.0003249683,0.0014077211,0.0010184995,0.00084373663,0.008014241],"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.0013222032,0.00030828873,0.00842483,0.0008501501,0.0001752501,0.00042361068,0.0002330809,0.08502613,0.046264686,0.014595201,0.12152266,0.7208539],"study_design_scores_gemma":[0.00022983938,0.0004463544,0.008945893,0.00009690105,0.00007061099,0.0010571169,0.00007089074,0.7504284,0.11292721,0.00754356,0.11786978,0.00031344124],"about_ca_topic_score_codex":0.00553199,"about_ca_topic_score_gemma":0.0055544795,"teacher_disagreement_score":0.98223656,"about_ca_system_score_codex":0.0011232595,"about_ca_system_score_gemma":0.0013871937,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1737373,0.0012993113,0.7983099,0.0004913849,0.00020036437,0.00017292814,0.00012501457,0.004182188,0.02148152],"genre_scores_gemma":[0.6592191,0.00034883557,0.33668792,0.0001767924,0.000059908423,0.000098539145,0.00012810163,0.000056562207,0.003224167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998703,0.000024059875,0.0000096173935,0.00002467085,0.000045693032,0.000025658714],"domain_scores_gemma":[0.99983275,0.00003933256,0.00001803144,0.000055244596,0.000037285554,0.00001731411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014912558,0.00025893102,0.00022816074,0.00037300005,0.00030042295,0.000555615,0.0006700637,0.00022136488,0.0025636726],"category_scores_gemma":[0.00034990878,0.00016534806,0.00020298755,0.00031397154,0.0002502464,0.0006328386,0.0003027805,0.00039611253,0.00039259213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004242684,0.0001859114,0.00285248,0.00036454434,0.00007460547,0.000507344,0.00014021143,0.16654964,0.3361159,0.05489405,0.009153839,0.42873716],"study_design_scores_gemma":[0.0001946159,0.0008544468,0.0026516712,0.000042788924,0.00006436618,0.00047099858,0.00004483253,0.8439936,0.091938496,0.014958601,0.04472951,0.00005605825],"about_ca_topic_score_codex":0.0017188616,"about_ca_topic_score_gemma":0.003017668,"teacher_disagreement_score":0.0025636726,"about_ca_system_score_codex":0.00045859456,"about_ca_system_score_gemma":0.0005400265,"threshold_uncertainty_score":0.008576393},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48715594,0.00052038225,0.48588517,0.00037189157,0.00016981857,0.00022425865,0.0010388447,0.0039880374,0.020645699],"genre_scores_gemma":[0.81776184,0.00027023183,0.1777387,0.000059677543,0.000021431813,0.00035612375,0.00076765503,0.00019530691,0.0028290022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996934,0.0000713615,0.00002037157,0.000056137527,0.00009469275,0.000063968466],"domain_scores_gemma":[0.99928826,0.0003131482,0.000054437605,0.00013353385,0.00013950853,0.0000711197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000434418,0.0005337844,0.00082479336,0.00042247545,0.00068333594,0.000744002,0.0015261852,0.00076370663,0.0028089855],"category_scores_gemma":[0.001602707,0.00038625777,0.00067362405,0.00092118164,0.0005086525,0.00088995235,0.0006920129,0.0007244839,0.00029813292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015654351,0.00008966506,0.0015516629,0.000083195,0.000044932327,0.00008950649,0.000073475014,0.9749347,0.0051748343,0.0055596204,0.00093808665,0.01130387],"study_design_scores_gemma":[0.000017716988,0.000017436905,0.00018605453,0.0000018713502,0.0000038465637,0.000010689985,0.0000087876915,0.99651766,0.0015355325,0.0011293993,0.0005667904,0.00000423963],"about_ca_topic_score_codex":0.009341379,"about_ca_topic_score_gemma":0.0070016864,"teacher_disagreement_score":0.009341379,"about_ca_system_score_codex":0.0008064762,"about_ca_system_score_gemma":0.0012533112,"threshold_uncertainty_score":0.018574059},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043282796,0.0007219236,0.9282383,0.00027632163,0.00034332776,0.000109494766,0.00009396179,0.014009851,0.012924074],"genre_scores_gemma":[0.2915973,0.0007555726,0.6934894,0.00031464422,0.00014422012,0.0001812635,0.00053337053,0.0007363237,0.01224792],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998166,0.00002079769,0.000016048465,0.000040273906,0.00006992388,0.000036321075],"domain_scores_gemma":[0.99982256,0.000023729162,0.000016283839,0.000034057106,0.000073613446,0.000029696976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019937426,0.00032881834,0.00027641552,0.0003668021,0.0003727816,0.0005775647,0.0011497687,0.00035747243,0.0026304978],"category_scores_gemma":[0.00037322644,0.00027349914,0.00027555824,0.00047620232,0.00026964518,0.001018958,0.00044461596,0.0006710146,0.0012273215],"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.0010394366,0.00050499494,0.0020041454,0.0004052775,0.00007028509,0.0007004637,0.00021555944,0.025733972,0.30632517,0.07194133,0.020708218,0.5703511],"study_design_scores_gemma":[0.00047844226,0.0010982072,0.0023217937,0.00008341213,0.00018541439,0.0018246758,0.00009285244,0.45076594,0.33488303,0.028546816,0.17959903,0.00012034049],"about_ca_topic_score_codex":0.0012860426,"about_ca_topic_score_gemma":0.0015013904,"teacher_disagreement_score":0.0026304978,"about_ca_system_score_codex":0.00036381546,"about_ca_system_score_gemma":0.0008444726,"threshold_uncertainty_score":0.008799911},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74812204,0.0037241557,0.23674463,0.0005430813,0.000100451376,0.00012494308,0.00024868405,0.0022374052,0.008154678],"genre_scores_gemma":[0.94807196,0.00032714324,0.049870502,0.000060903036,0.000023329325,0.00005608981,0.00020817608,0.000046610283,0.0013352823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920744,0.00020064398,0.00003898373,0.000087604305,0.0003516451,0.000113739836],"domain_scores_gemma":[0.9975714,0.00051337446,0.000185349,0.0009215873,0.0006915492,0.000116741845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010634952,0.0003952101,0.00052107475,0.00048632536,0.0004908471,0.0011028921,0.0014486016,0.00071989925,0.0015558241],"category_scores_gemma":[0.0027701897,0.00022207583,0.0004520663,0.0005521978,0.00033021442,0.0020634867,0.000665201,0.00073087454,0.00038803223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0063566836,0.0008210421,0.030480364,0.00059396797,0.00041997826,0.0010222582,0.00057763123,0.3361485,0.21008863,0.10869042,0.012542378,0.29225808],"study_design_scores_gemma":[0.000105809304,0.0010821215,0.0019811688,0.000026281663,0.00008975689,0.00046775187,0.00007158815,0.9477851,0.036833648,0.0055626584,0.005957828,0.00003630659],"about_ca_topic_score_codex":0.0020022716,"about_ca_topic_score_gemma":0.0027087014,"teacher_disagreement_score":0.0020022716,"about_ca_system_score_codex":0.0007480216,"about_ca_system_score_gemma":0.00084211375,"threshold_uncertainty_score":0.005624354},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24982335,0.00040141464,0.72159314,0.0005104581,0.00013340575,0.00040551013,0.00018488253,0.01913288,0.007814948],"genre_scores_gemma":[0.78290963,0.0001393781,0.21194671,0.00013659574,0.000040572828,0.00015315166,0.0002793871,0.0011335181,0.003261084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979803,0.0005660411,0.00013418998,0.0004249888,0.0005651134,0.00032934523],"domain_scores_gemma":[0.9974843,0.000877199,0.0003170143,0.0007918101,0.0002669052,0.00026272988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020106244,0.0008489613,0.00055406283,0.00082557724,0.001087693,0.0016398192,0.0024042262,0.000683719,0.0017943683],"category_scores_gemma":[0.0059187063,0.0007298465,0.00055167486,0.0007535194,0.0017827216,0.0032830485,0.0023650695,0.0012553296,0.00036917586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004186674,0.0009891483,0.017325865,0.00050214765,0.00016910667,0.0012754042,0.0052034706,0.20896707,0.15091065,0.1315526,0.012694092,0.46622378],"study_design_scores_gemma":[0.00019490028,0.00049815536,0.00283163,0.000049605267,0.00007948996,0.00023089667,0.00034368198,0.81486547,0.10543414,0.054240372,0.021111866,0.00011978715],"about_ca_topic_score_codex":0.009600965,"about_ca_topic_score_gemma":0.01059069,"teacher_disagreement_score":0.009600965,"about_ca_system_score_codex":0.0017504,"about_ca_system_score_gemma":0.003156979,"threshold_uncertainty_score":0.019090176},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0483982,0.002051556,0.9328325,0.00033075246,0.00018279879,0.00014392704,0.00017070031,0.0061424514,0.0097471075],"genre_scores_gemma":[0.26792517,0.0009289362,0.7212591,0.0001470619,0.000089028006,0.00019069157,0.00061878125,0.00023766335,0.008603583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998228,0.000022615899,0.000013898534,0.000023498833,0.000088680375,0.000028554461],"domain_scores_gemma":[0.9998393,0.00002845956,0.00001542712,0.000044344408,0.000063026,0.000009445828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021143815,0.00038465732,0.00023193994,0.00042362683,0.00029584538,0.00042753218,0.0011476764,0.00029563365,0.0044335504],"category_scores_gemma":[0.00046987412,0.00030007344,0.0002355725,0.0005289947,0.00017076968,0.00083824014,0.00035436996,0.0005834297,0.0014139808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041170206,0.00012405765,0.0007833876,0.0005568446,0.000083708175,0.0002469629,0.00012153895,0.029530495,0.32204974,0.05250867,0.01724568,0.5763372],"study_design_scores_gemma":[0.0002177625,0.00080085103,0.0024486112,0.00010218585,0.00014544383,0.00065633026,0.0000612566,0.5680919,0.2785447,0.018587194,0.1302875,0.000056273413],"about_ca_topic_score_codex":0.0007449967,"about_ca_topic_score_gemma":0.0016934251,"teacher_disagreement_score":0.0044335504,"about_ca_system_score_codex":0.0004229314,"about_ca_system_score_gemma":0.0006198466,"threshold_uncertainty_score":0.014831662},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16314246,0.0011308062,0.7415627,0.001305454,0.0010401795,0.00018822796,0.00027708162,0.009177241,0.08217586],"genre_scores_gemma":[0.78140175,0.00047168476,0.19669883,0.00049276365,0.00016548757,0.000116415395,0.00036963358,0.0008978088,0.0193855],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998056,0.000028702329,0.000011181384,0.000028244678,0.00008609118,0.000040164578],"domain_scores_gemma":[0.99975234,0.000059337446,0.000026877266,0.00007505507,0.000069811584,0.000016449214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019848885,0.0004182176,0.00036013758,0.0003635329,0.0003633576,0.0009850811,0.0006032271,0.00042243156,0.00882201],"category_scores_gemma":[0.0008956032,0.00015158963,0.00020803319,0.00043493573,0.00036290372,0.00095376256,0.00059053843,0.0007125061,0.0026533976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010200617,0.00026235028,0.0012163507,0.0004919699,0.000045063105,0.0010550909,0.0003520935,0.04467151,0.38361278,0.16199157,0.022017421,0.38326374],"study_design_scores_gemma":[0.00018538347,0.0007233281,0.0011118624,0.00012728536,0.00006718869,0.00090655487,0.00018498144,0.37305602,0.43771502,0.059349664,0.12650217,0.00007055551],"about_ca_topic_score_codex":0.00034954754,"about_ca_topic_score_gemma":0.00065036234,"teacher_disagreement_score":0.00882201,"about_ca_system_score_codex":0.0003042447,"about_ca_system_score_gemma":0.0003857735,"threshold_uncertainty_score":0.029512584},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03449458,0.0007877256,0.9431067,0.00080218504,0.00025482362,0.000037323338,0.00013683464,0.0007131142,0.01966667],"genre_scores_gemma":[0.72461206,0.0011000527,0.24360177,0.00045507489,0.00042888886,0.00021651738,0.00037504514,0.00068518927,0.028525416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997365,0.000082766834,0.000013841346,0.00004334135,0.00007780106,0.00004572676],"domain_scores_gemma":[0.9992281,0.0003558322,0.000049881055,0.00020230208,0.00010999078,0.00005394565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007831032,0.0005461195,0.00081594696,0.00039530487,0.00045842034,0.0011719442,0.0014085606,0.0007912597,0.0074625215],"category_scores_gemma":[0.0025728864,0.0003114871,0.00044916212,0.0006406787,0.00075851206,0.0032307506,0.0014311629,0.0017335205,0.00111434],"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.0003539885,0.00008939372,0.0002607055,0.00015126601,0.000033623564,0.00009723874,0.000086746375,0.17519985,0.00318636,0.77326506,0.008804151,0.038471594],"study_design_scores_gemma":[0.000056141544,0.000017828199,0.000046733832,0.0000059620133,0.000011161933,0.000017952234,0.00001039172,0.69501656,0.0008350779,0.301999,0.0019763983,0.0000067994374],"about_ca_topic_score_codex":0.00087470136,"about_ca_topic_score_gemma":0.0011873585,"teacher_disagreement_score":0.0074625215,"about_ca_system_score_codex":0.000651191,"about_ca_system_score_gemma":0.0006356821,"threshold_uncertainty_score":0.02496463},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037889837,0.0004237762,0.99112844,0.00014516909,0.000043143544,0.00007892339,0.000047282705,0.0005754338,0.0037687537],"genre_scores_gemma":[0.09031626,0.00084657664,0.9020495,0.00012385673,0.00010257552,0.0005338009,0.0003833278,0.0005185891,0.0051256125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682355,0.00097239704,0.00019024008,0.0004684985,0.0012406786,0.00030464068],"domain_scores_gemma":[0.99534214,0.0027524293,0.00024163029,0.0009194998,0.00060589745,0.00013857463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002663931,0.0018402176,0.0014332796,0.0029985285,0.0017928897,0.0026990166,0.0024269314,0.0016202257,0.0073005897],"category_scores_gemma":[0.0108227,0.0010552147,0.0011657904,0.002812419,0.0022140478,0.0047180043,0.0031232312,0.0024644108,0.001704213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014000502,0.00009994503,0.00036715457,0.0003244132,0.00005020134,0.00008422968,0.00030732623,0.364507,0.00321485,0.36498964,0.0063634194,0.25955188],"study_design_scores_gemma":[0.00010818247,0.00003892081,0.00009917587,0.000047367415,0.000034980807,0.00007307005,0.00006565786,0.6512369,0.002702881,0.3326121,0.012962894,0.000017739638],"about_ca_topic_score_codex":0.0023256328,"about_ca_topic_score_gemma":0.003133039,"teacher_disagreement_score":0.0073005897,"about_ca_system_score_codex":0.002390565,"about_ca_system_score_gemma":0.0019156219,"threshold_uncertainty_score":0.024422884},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06616228,0.00070756685,0.8947313,0.00048798532,0.0001885795,0.00023299392,0.0004340488,0.0050268793,0.03202842],"genre_scores_gemma":[0.5076359,0.0005264282,0.47107264,0.00027875672,0.00011153656,0.0003417005,0.0010909063,0.00015168203,0.018790567],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998149,0.000026269397,0.000018531542,0.000036620757,0.00007088586,0.00003277708],"domain_scores_gemma":[0.99980956,0.00003359844,0.000018089702,0.000037484057,0.00008252137,0.000018843566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023451766,0.00029107463,0.00028765542,0.0006079354,0.00048541924,0.0008940251,0.0010528713,0.00040280784,0.005807505],"category_scores_gemma":[0.00041869687,0.0002712989,0.0003201038,0.0005858849,0.0003135623,0.00077431375,0.00041662433,0.0004417872,0.0013095239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053665554,0.0002754361,0.0013327695,0.0004429463,0.00007823468,0.00039295055,0.00030331363,0.20542215,0.13881789,0.28463617,0.019528156,0.3482334],"study_design_scores_gemma":[0.00011285621,0.00042602987,0.0007705787,0.000051708226,0.000072509974,0.00024262739,0.000024444395,0.8204306,0.05722127,0.052575666,0.06801316,0.000058583435],"about_ca_topic_score_codex":0.0011151901,"about_ca_topic_score_gemma":0.0016586501,"teacher_disagreement_score":0.005807505,"about_ca_system_score_codex":0.0007989191,"about_ca_system_score_gemma":0.0012315905,"threshold_uncertainty_score":0.019428074},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8461178,0.0028485223,0.13561416,0.00040544025,0.00005851681,0.000029031089,0.000103415514,0.00071950216,0.014103561],"genre_scores_gemma":[0.98459727,0.00023582748,0.014058663,0.000026656231,0.000015787964,0.00001375826,0.000059828963,0.00005148527,0.0009407594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950075,0.00015084568,0.000031430714,0.000049124403,0.00020107148,0.00006667081],"domain_scores_gemma":[0.99899334,0.00043908667,0.000110609464,0.00017530033,0.00021934789,0.000062237465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006706416,0.00033703007,0.00026153369,0.00036457967,0.0003739154,0.00052831345,0.00076313404,0.00026263765,0.002338204],"category_scores_gemma":[0.0022481177,0.00016885324,0.00013324557,0.00049114594,0.00023740497,0.0011386393,0.00048341756,0.00035640193,0.0005389358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018371729,0.00031873467,0.014469789,0.00044947723,0.000068894995,0.00044134594,0.00025200238,0.32003096,0.30149612,0.021823788,0.0048635895,0.33394817],"study_design_scores_gemma":[0.000052873445,0.00040609264,0.0057630227,0.00001862739,0.000043683936,0.00027148958,0.0000902568,0.8872575,0.09202158,0.00867267,0.0053816424,0.000020576877],"about_ca_topic_score_codex":0.00041294197,"about_ca_topic_score_gemma":0.00084926543,"teacher_disagreement_score":0.002338204,"about_ca_system_score_codex":0.00034223782,"about_ca_system_score_gemma":0.0002992278,"threshold_uncertainty_score":0.007822037},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42782715,0.00063048187,0.5594114,0.0002020295,0.00013338469,0.00014430813,0.000045053002,0.0075992374,0.004006933],"genre_scores_gemma":[0.9081921,0.00010195468,0.09027717,0.000087334134,0.00003153876,0.00005263791,0.00004551688,0.00012377657,0.0010879092],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997079,0.00004811728,0.00002615567,0.000068011796,0.00009565952,0.000054156957],"domain_scores_gemma":[0.9991731,0.00019955661,0.00019072648,0.00028516498,0.00009038869,0.000061091785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038830203,0.00028770202,0.000290261,0.00028405094,0.00020870075,0.0005260788,0.00086926634,0.00021349492,0.000921179],"category_scores_gemma":[0.0010400728,0.00020871268,0.00022716375,0.00024858417,0.00039569606,0.00062831107,0.00045571796,0.00057719677,0.00021006969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006588973,0.00036784523,0.0041288002,0.00022078093,0.00007176312,0.00018851356,0.0004258193,0.022532567,0.72726035,0.010455109,0.0015701533,0.23211938],"study_design_scores_gemma":[0.00024216672,0.0009022925,0.0026722304,0.000020048574,0.00009206026,0.0004741344,0.00007440173,0.30669865,0.673458,0.004510039,0.010792382,0.00006360938],"about_ca_topic_score_codex":0.0005061757,"about_ca_topic_score_gemma":0.00084589684,"teacher_disagreement_score":0.000921179,"about_ca_system_score_codex":0.00024642778,"about_ca_system_score_gemma":0.00044671696,"threshold_uncertainty_score":0.0030816793},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31689292,0.0019657782,0.6602791,0.0013185734,0.00013983039,0.00006691774,0.0001798033,0.0020661445,0.01709105],"genre_scores_gemma":[0.8310169,0.00054784474,0.16109097,0.00021666594,0.00006980479,0.00006357247,0.00018362793,0.00011506363,0.0066954787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999744,0.000054583375,0.000012281769,0.0000238074,0.00010575079,0.000059604758],"domain_scores_gemma":[0.9995597,0.0002551243,0.00004483696,0.000055902125,0.000067200366,0.000017219452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003007878,0.000497608,0.00036916952,0.00037787954,0.0003823289,0.00053343474,0.00063855725,0.00024513892,0.0026586803],"category_scores_gemma":[0.0014408056,0.00017220699,0.00021319225,0.00066562206,0.00037030276,0.00096435106,0.0007359851,0.00060988654,0.00038006058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070417265,0.00020498993,0.00519313,0.00018880217,0.000044440952,0.00024097772,0.0001664955,0.4703051,0.04378528,0.030581348,0.0069941916,0.44159105],"study_design_scores_gemma":[0.000058483638,0.0001902101,0.001240363,0.000013888576,0.00001935318,0.000061967214,0.0000445715,0.96270156,0.020283036,0.012472732,0.002899748,0.000014111893],"about_ca_topic_score_codex":0.0017113449,"about_ca_topic_score_gemma":0.005687897,"teacher_disagreement_score":0.0026586803,"about_ca_system_score_codex":0.00041265608,"about_ca_system_score_gemma":0.0010606904,"threshold_uncertainty_score":0.008894205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00392545,0.00023386077,0.9844401,0.00046325324,0.00009010257,0.00021736049,0.000031664527,0.0006847457,0.009913453],"genre_scores_gemma":[0.049134534,0.00048261724,0.9415442,0.00021822266,0.00003748784,0.00085693283,0.00008503027,0.00022706547,0.007413824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982602,0.0005424426,0.0002205858,0.00026535557,0.00059054233,0.00012093343],"domain_scores_gemma":[0.99863344,0.00035625978,0.00018822109,0.00040783087,0.00033192386,0.0000822841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017290406,0.000753931,0.00034098528,0.0006022129,0.00096582033,0.0019524985,0.0012985924,0.0012443311,0.0038789082],"category_scores_gemma":[0.0033784006,0.00070968765,0.0007554614,0.0007323212,0.0017787175,0.0026019996,0.0016192673,0.001580584,0.0015156283],"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.00012381631,0.00009689588,0.0010484754,0.0006834842,0.00006717219,0.00053541694,0.00092450186,0.049851816,0.022099199,0.77528846,0.008090583,0.14119023],"study_design_scores_gemma":[0.00016604936,0.00025024216,0.00042945775,0.0001996966,0.0001171673,0.0013295781,0.00026262918,0.14987141,0.020154877,0.40865466,0.4184919,0.00007238162],"about_ca_topic_score_codex":0.0009221437,"about_ca_topic_score_gemma":0.0016399847,"teacher_disagreement_score":0.0038789082,"about_ca_system_score_codex":0.0008015029,"about_ca_system_score_gemma":0.0015970173,"threshold_uncertainty_score":0.012976289},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5381507,0.0018758286,0.43909878,0.0005392575,0.00014706433,0.00010295385,0.0002238711,0.009874407,0.009987065],"genre_scores_gemma":[0.9019996,0.0003083242,0.088588476,0.00034378673,0.000086048545,0.00006365124,0.00027103798,0.0003458634,0.007993192],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975795,0.000037383877,0.000012786772,0.000047008987,0.00008290686,0.00006197924],"domain_scores_gemma":[0.99922025,0.00019743976,0.00013013047,0.000204158,0.0001918926,0.000056184854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029130478,0.00054153474,0.0005146629,0.0004594581,0.00032794802,0.00089938473,0.0018828624,0.0004571453,0.0037222605],"category_scores_gemma":[0.0010407497,0.0002756912,0.00028848156,0.000559712,0.00043346267,0.001925927,0.0006879262,0.0004391521,0.0010146019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021784583,0.0004655455,0.0062288563,0.0005352449,0.000117841046,0.0005022998,0.0005120857,0.06601033,0.48948008,0.015578677,0.009715545,0.40867493],"study_design_scores_gemma":[0.0004162617,0.0028243884,0.003043013,0.00004282652,0.00022601732,0.0009876664,0.00023478873,0.37744132,0.5766326,0.00781415,0.030237872,0.00009905137],"about_ca_topic_score_codex":0.0010573273,"about_ca_topic_score_gemma":0.0026696736,"teacher_disagreement_score":0.0037222605,"about_ca_system_score_codex":0.00045665877,"about_ca_system_score_gemma":0.00058879284,"threshold_uncertainty_score":0.012452185},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08163307,0.0010911425,0.69686735,0.00071153016,0.0007364422,0.00065434875,0.0008764822,0.19103174,0.02639786],"genre_scores_gemma":[0.70711625,0.0007909524,0.2487946,0.0011843988,0.0003035466,0.0007308023,0.0021300206,0.016449507,0.022499891],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99626875,0.00055462786,0.00026773385,0.00061881467,0.0018207429,0.00046935256],"domain_scores_gemma":[0.9867605,0.0032043303,0.00078525185,0.0072298655,0.001746799,0.000273213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018826455,0.0012190888,0.00086824654,0.00071105716,0.00091315253,0.0016700441,0.0025032987,0.00089852395,0.009815479],"category_scores_gemma":[0.012674822,0.0008214649,0.00073393434,0.000619536,0.0011452673,0.0026247182,0.0026968971,0.0018779892,0.0038283407],"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.0013762928,0.0005252322,0.020678295,0.0017966486,0.0002786124,0.0009919088,0.0017775655,0.025760429,0.19981897,0.031523775,0.07440811,0.6410641],"study_design_scores_gemma":[0.00029405873,0.0013758492,0.019130196,0.00030497997,0.0002984995,0.0019379337,0.0002995358,0.25705743,0.38350573,0.032186817,0.3033487,0.0002602822],"about_ca_topic_score_codex":0.00076222525,"about_ca_topic_score_gemma":0.00084433943,"teacher_disagreement_score":0.009815479,"about_ca_system_score_codex":0.0005865649,"about_ca_system_score_gemma":0.0015115307,"threshold_uncertainty_score":0.03283608},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02418821,0.00046409218,0.97081167,0.00025988513,0.00007054477,0.000049683695,0.000016768927,0.0008363034,0.003302842],"genre_scores_gemma":[0.38342118,0.0007485843,0.6111753,0.00018088,0.00009680885,0.00019700848,0.00010959841,0.00020725322,0.0038634422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929607,0.00024460896,0.00004765067,0.00011519443,0.00016785886,0.00012858983],"domain_scores_gemma":[0.99864155,0.00043757688,0.000072999195,0.00057983445,0.0001664738,0.00010158498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010971581,0.00044828566,0.0005975472,0.00041081273,0.000783201,0.0013830358,0.0016905426,0.0006382789,0.0017239979],"category_scores_gemma":[0.0028456145,0.00035865218,0.0007039601,0.0007073042,0.0008875178,0.0032068978,0.003504211,0.0010385272,0.0004381617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023778502,0.00018517958,0.001974698,0.00029099098,0.00009982893,0.0008941293,0.0005762647,0.3515598,0.0136113,0.20536683,0.005546206,0.41965696],"study_design_scores_gemma":[0.00007044981,0.00012550225,0.0002373103,0.000051479354,0.000045195804,0.00022622745,0.0001304059,0.76779926,0.011186428,0.18627705,0.033821654,0.000028946755],"about_ca_topic_score_codex":0.0013693332,"about_ca_topic_score_gemma":0.001434853,"teacher_disagreement_score":0.0017239979,"about_ca_system_score_codex":0.0005179252,"about_ca_system_score_gemma":0.0007069194,"threshold_uncertainty_score":0.005802393},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9496544,0.0006910595,0.030669032,0.00017569376,0.000069774665,0.0001266432,0.0003516574,0.0027072823,0.015554482],"genre_scores_gemma":[0.97811514,0.0002146744,0.018201288,0.000047590613,0.000012413273,0.000036176658,0.0003176833,0.00019401484,0.002861123],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995142,0.000086473185,0.000022919077,0.000051440464,0.00024202558,0.00008301853],"domain_scores_gemma":[0.9983864,0.0006858183,0.000102189355,0.00015174708,0.00059252843,0.000081192535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007232998,0.00054338784,0.00035173778,0.0004931027,0.00017778056,0.0003512822,0.0008871775,0.00029997705,0.0020638716],"category_scores_gemma":[0.0028429085,0.00021260498,0.00025244197,0.00066844077,0.00029101304,0.00070514786,0.00024018397,0.0003375822,0.00055805687],"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.005639519,0.0010438456,0.021181663,0.0011650498,0.00021566107,0.00094368216,0.00033008907,0.32949695,0.2566438,0.005826629,0.012666543,0.36484662],"study_design_scores_gemma":[0.00022260056,0.005449264,0.012378451,0.000033913493,0.00013803813,0.00040998345,0.00008296419,0.7149111,0.25708875,0.0007080816,0.008527893,0.000048952188],"about_ca_topic_score_codex":0.00215489,"about_ca_topic_score_gemma":0.002201602,"teacher_disagreement_score":0.00215489,"about_ca_system_score_codex":0.00044046514,"about_ca_system_score_gemma":0.0005695764,"threshold_uncertainty_score":0.0069043636},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01013294,0.00030731625,0.9854659,0.00009311002,0.000048280108,0.00008329812,0.000019106074,0.0010496238,0.002800465],"genre_scores_gemma":[0.11141489,0.0002642237,0.88530886,0.000121583646,0.000039898052,0.00010591242,0.00005957659,0.0001325353,0.002552465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960977,0.000058639846,0.000026079184,0.000069494694,0.00018595722,0.000050018076],"domain_scores_gemma":[0.9996239,0.000082880084,0.000040991585,0.000117006464,0.000111577036,0.000023648052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005437287,0.0006212063,0.00044304633,0.00079372764,0.00034890597,0.00037594934,0.0009594602,0.00043046454,0.001205046],"category_scores_gemma":[0.0008816889,0.0003093548,0.00061835407,0.0007156981,0.00038720565,0.00075914664,0.00067774917,0.00067147653,0.00036857996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002216243,0.00023749305,0.00090740557,0.0002725812,0.000095081006,0.0001693997,0.00020873512,0.061235253,0.16069604,0.04783343,0.0026472367,0.7254758],"study_design_scores_gemma":[0.00015501442,0.001383731,0.0015188829,0.000079062105,0.00030154944,0.0009791544,0.00006977951,0.7029825,0.1660629,0.038718034,0.08764321,0.000106149084],"about_ca_topic_score_codex":0.0014613353,"about_ca_topic_score_gemma":0.00308793,"teacher_disagreement_score":0.0014613353,"about_ca_system_score_codex":0.0003934242,"about_ca_system_score_gemma":0.0009973927,"threshold_uncertainty_score":0.0040313005},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0221324,0.0056594815,0.19767544,0.0029045295,0.0034571176,0.00047648043,0.009997822,0.09661713,0.6610796],"genre_scores_gemma":[0.2360291,0.0057212105,0.16845094,0.0031037452,0.00085673505,0.00072218804,0.03946426,0.018072505,0.5275794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992681,0.00008586227,0.00003193048,0.00014290419,0.0003331881,0.0001379975],"domain_scores_gemma":[0.99941385,0.00012165339,0.000024666315,0.00015910035,0.00019341167,0.00008734566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056831527,0.0008241138,0.0005158576,0.0010296028,0.0007177226,0.0023324124,0.002403252,0.0009732855,0.09740554],"category_scores_gemma":[0.0021752848,0.00042657286,0.00055652123,0.00075218646,0.00045264364,0.0031067731,0.0028444862,0.0013119451,0.038517572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010821956,0.00017083243,0.0021968195,0.00066378515,0.00007124102,0.0005364731,0.0002850849,0.00804892,0.014025044,0.10340991,0.37817594,0.49133375],"study_design_scores_gemma":[0.00005947324,0.00008345279,0.000405771,0.000058151585,0.000015281263,0.000340629,0.00004998444,0.0057909195,0.0043274704,0.010025621,0.9788104,0.000032794916],"about_ca_topic_score_codex":0.0022905422,"about_ca_topic_score_gemma":0.0028983087,"teacher_disagreement_score":0.09740554,"about_ca_system_score_codex":0.0005861519,"about_ca_system_score_gemma":0.00097285066,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013253831,0.0005263728,0.94542,0.00022682775,0.00019561495,0.00014030644,0.00016725421,0.0019396213,0.0381301],"genre_scores_gemma":[0.17097937,0.0007950736,0.81221086,0.00010889154,0.00007940392,0.00040352627,0.00040807604,0.00075156696,0.0142632015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984913,0.00036647235,0.00009257697,0.000115080366,0.0007750414,0.00015958596],"domain_scores_gemma":[0.9981887,0.0004776896,0.000075718046,0.0004682828,0.0007019253,0.000087710076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010552447,0.0010481023,0.0014581722,0.0012055811,0.0011625305,0.0025166126,0.0018906451,0.0011928264,0.013053045],"category_scores_gemma":[0.005232278,0.00057764427,0.0010700852,0.0016657559,0.0007325355,0.0017972523,0.0017893509,0.0015658627,0.003387038],"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.00030028893,0.00016536016,0.00085066364,0.00026769488,0.00010121683,0.00016365547,0.00026193552,0.46863183,0.0043529826,0.23946986,0.009631013,0.2758035],"study_design_scores_gemma":[0.0000940728,0.00006874484,0.0001663293,0.000039638377,0.000027674238,0.00014405807,0.000070666545,0.8879479,0.0044151167,0.08275913,0.024227723,0.00003902924],"about_ca_topic_score_codex":0.0035468505,"about_ca_topic_score_gemma":0.003144991,"teacher_disagreement_score":0.013053045,"about_ca_system_score_codex":0.001017584,"about_ca_system_score_gemma":0.0016541337,"threshold_uncertainty_score":0.04366672},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31653878,0.000388922,0.6424853,0.00047433042,0.0002207491,0.00047873065,0.0005533798,0.008853102,0.030006716],"genre_scores_gemma":[0.6753395,0.000183756,0.3102739,0.000184048,0.000038753304,0.00025933958,0.0008369305,0.00029702837,0.012586794],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998889,0.00001244617,0.0000057144407,0.000020592704,0.00004509358,0.000027253884],"domain_scores_gemma":[0.9998196,0.000028011373,0.00001871438,0.000023194423,0.00009490614,0.000015712236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015447765,0.00023685848,0.00023206092,0.00029351076,0.00031038377,0.00035593638,0.00072627363,0.00019953118,0.003987255],"category_scores_gemma":[0.0003349338,0.00015504593,0.0001464444,0.0003452718,0.00014801534,0.00030123664,0.00019521553,0.00044827713,0.0008833223],"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.0011507544,0.00015421948,0.005478167,0.0005185645,0.000087439104,0.0007199974,0.0003373051,0.084312774,0.47686037,0.03809022,0.027499693,0.36479056],"study_design_scores_gemma":[0.00021962813,0.00084141095,0.004315152,0.00006676933,0.000076633216,0.0005629712,0.0001122533,0.47093338,0.40869966,0.0025401628,0.1115705,0.000061485094],"about_ca_topic_score_codex":0.002556074,"about_ca_topic_score_gemma":0.003597477,"teacher_disagreement_score":0.003987255,"about_ca_system_score_codex":0.00058621,"about_ca_system_score_gemma":0.0011393398,"threshold_uncertainty_score":0.013338685},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6774657,0.004449519,0.28629747,0.00042632077,0.00036008793,0.00028550503,0.001069577,0.008514064,0.021131633],"genre_scores_gemma":[0.8606194,0.00038670423,0.12917612,0.0002869475,0.00006229067,0.00012318423,0.0006742235,0.00010002332,0.008571104],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998535,0.000015237649,0.000010094087,0.00003827666,0.00004837207,0.00003443827],"domain_scores_gemma":[0.99988174,0.000011281187,0.00002124267,0.00004084429,0.000025524942,0.000019398825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013926403,0.0002604088,0.00028464192,0.000292008,0.0002591496,0.00038813605,0.001955937,0.00023790346,0.0022457936],"category_scores_gemma":[0.0001707666,0.00016328026,0.0002117573,0.00032550286,0.00016963997,0.00062492787,0.000831745,0.00023712649,0.00041040324],"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.0011824719,0.00048811815,0.008362298,0.00083749107,0.00017820216,0.0006030948,0.00017397819,0.018471843,0.5399698,0.011695056,0.021387989,0.39664966],"study_design_scores_gemma":[0.0003232403,0.0029173936,0.011122508,0.00005922513,0.00021783503,0.002065894,0.00011445812,0.28583574,0.5505963,0.0038415347,0.14277758,0.0001281886],"about_ca_topic_score_codex":0.00049172936,"about_ca_topic_score_gemma":0.001247107,"teacher_disagreement_score":0.0022457936,"about_ca_system_score_codex":0.0002932428,"about_ca_system_score_gemma":0.0003494103,"threshold_uncertainty_score":0.0075128675},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07670356,0.00018722923,0.9110175,0.00019785762,0.00009878188,0.000060311806,0.000064422995,0.0029546,0.008715767],"genre_scores_gemma":[0.57772344,0.00022191547,0.4123594,0.00005242277,0.00006791785,0.00015157045,0.00024349983,0.00025550975,0.008924407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979013,0.000044805016,0.000007405921,0.000020520529,0.000110426394,0.000026646765],"domain_scores_gemma":[0.99966717,0.0001102123,0.000015231149,0.00008746976,0.000100810816,0.000019108023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037820375,0.0003549126,0.00036540657,0.000293017,0.00053999765,0.0004283681,0.000683151,0.00039607854,0.0028660013],"category_scores_gemma":[0.0010584232,0.00014803863,0.00024367828,0.00048956514,0.0003478681,0.0009102438,0.00051900547,0.0004979944,0.000580558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007502704,0.0003189596,0.0020754326,0.00019579037,0.000091466936,0.0007778558,0.00036300966,0.30861825,0.094893016,0.07874125,0.009400934,0.5037738],"study_design_scores_gemma":[0.00011905224,0.00016737115,0.0005603097,0.000009389982,0.00002304317,0.00021385406,0.00004605631,0.9434259,0.030968782,0.015068023,0.00937829,0.000019968198],"about_ca_topic_score_codex":0.0017321422,"about_ca_topic_score_gemma":0.0024630702,"teacher_disagreement_score":0.0028660013,"about_ca_system_score_codex":0.00029820827,"about_ca_system_score_gemma":0.00050093833,"threshold_uncertainty_score":0.009587705},"labels":[],"label_agreement":null},{"id":"W2156742168","doi":"10.1145/1133255.1133995","title":"Shared memory programming for large scale machines","year":2006,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Defense Advanced Research Projects Agency","keywords":"Computer science; Compiler; Parallel computing; Scalability; Runtime system; Distributed memory; Partitioned global address space; Optimizing compiler; Programming paradigm; Shared memory; Asynchronous communication; Programming language; Operating system","score_opus":0.016197497304911726,"score_gpt":0.2706697248421612,"score_spread":0.25447222753724946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156742168","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008209796,0.0007316997,0.9713585,0.0005981201,0.00017304628,0.0001456986,0.00009951921,0.006491926,0.012191839],"genre_scores_gemma":[0.1504133,0.0007057722,0.83451915,0.00029944957,0.00023851579,0.0007363779,0.00047127597,0.0015908555,0.011025288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984585,0.00052263436,0.000104932325,0.0001730705,0.0006105744,0.00013025531],"domain_scores_gemma":[0.99802643,0.00069306593,0.00013918361,0.00081152073,0.00023235475,0.0000973803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014794968,0.0006282188,0.0004672621,0.00042584218,0.00092267536,0.0017763426,0.0018714953,0.0005167454,0.0057198782],"category_scores_gemma":[0.004350062,0.0004723631,0.00062873994,0.0009141955,0.0011628501,0.0021688216,0.002288304,0.001418343,0.0016315876],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000170872,0.000087679815,0.0017000864,0.0005493206,0.00012384992,0.00044095458,0.00071318954,0.08467967,0.01278391,0.6301865,0.03505118,0.23351276],"study_design_scores_gemma":[0.00016260568,0.00012809134,0.0007181365,0.00011896009,0.00006211555,0.00035063873,0.0001462135,0.35238618,0.014766581,0.3967181,0.23439579,0.000046508467],"about_ca_topic_score_codex":0.0010153344,"about_ca_topic_score_gemma":0.0016992084,"teacher_disagreement_score":0.0057198782,"about_ca_system_score_codex":0.0008702982,"about_ca_system_score_gemma":0.0017715201,"threshold_uncertainty_score":0.01913488},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96430045,0.00040064656,0.026865108,0.0001942312,0.000040022052,0.000034792927,0.00043305868,0.0022824605,0.0054492787],"genre_scores_gemma":[0.9888747,0.00006981296,0.010403202,0.000025644693,0.000007582314,0.000030326104,0.00025717102,0.0001066082,0.00022499371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987747,0.00023792498,0.00007448867,0.00014634652,0.00052623363,0.00024025847],"domain_scores_gemma":[0.99673575,0.001679635,0.00026743257,0.00059778016,0.00056161394,0.00015766443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015371009,0.00081381464,0.00058753934,0.0008729326,0.00055179006,0.0007147742,0.001009146,0.00057952886,0.0014384785],"category_scores_gemma":[0.005669755,0.00028324427,0.00045772502,0.0016498702,0.000828415,0.0013080413,0.00082971767,0.001006006,0.00020361715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080273877,0.00022367357,0.009342626,0.0002356993,0.00011324529,0.0001414566,0.0002563946,0.91572684,0.030283593,0.008955796,0.002743821,0.031174088],"study_design_scores_gemma":[0.00003139301,0.00023464065,0.0017191293,0.000007918359,0.000016250486,0.000027817918,0.00005208513,0.97374517,0.022125186,0.0013829719,0.0006418228,0.000015602593],"about_ca_topic_score_codex":0.004396916,"about_ca_topic_score_gemma":0.002996032,"teacher_disagreement_score":0.004396916,"about_ca_system_score_codex":0.0010740212,"about_ca_system_score_gemma":0.0011013986,"threshold_uncertainty_score":0.0087426305},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01690047,0.0012885733,0.9698833,0.0010248038,0.00012483283,0.000075429336,0.000047858088,0.00091124955,0.009743502],"genre_scores_gemma":[0.55509514,0.0024083192,0.43556765,0.00071660907,0.00024875024,0.00038539278,0.00014383151,0.0006923621,0.0047419253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975647,0.0006544793,0.00018605187,0.0004989623,0.00088679034,0.00020904197],"domain_scores_gemma":[0.99503064,0.0021988023,0.00045886848,0.0012704557,0.0008917392,0.00014954622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023803737,0.00087991974,0.0006864272,0.0007455386,0.0007027927,0.0021570064,0.0019327371,0.0013973975,0.0031245677],"category_scores_gemma":[0.009732252,0.0005223172,0.0005487564,0.000932178,0.0024253977,0.0051364987,0.00095272897,0.001668497,0.0010051439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018781418,0.00011795737,0.0010867959,0.00071034284,0.00009844959,0.00018487948,0.000377271,0.18263265,0.04552903,0.5676961,0.007123193,0.19425546],"study_design_scores_gemma":[0.00006102455,0.0002528615,0.00027757962,0.000114346636,0.000078003075,0.00035921746,0.00006345889,0.3585081,0.03665625,0.5799739,0.023588581,0.00006668712],"about_ca_topic_score_codex":0.0006056467,"about_ca_topic_score_gemma":0.0006008089,"teacher_disagreement_score":0.0031245677,"about_ca_system_score_codex":0.0012324126,"about_ca_system_score_gemma":0.0010405355,"threshold_uncertainty_score":0.012588739},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3238468,0.0006626606,0.669111,0.00034006318,0.00003942671,0.00008575281,0.0000386373,0.00085788924,0.005017889],"genre_scores_gemma":[0.9179929,0.00016840312,0.07887892,0.00007670979,0.00002153784,0.0000675419,0.00006924339,0.00011212964,0.0026126513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995191,0.00015486138,0.000029718725,0.00005238091,0.00018846116,0.000055491768],"domain_scores_gemma":[0.9984333,0.0007310746,0.00024402465,0.00036535412,0.00017953107,0.00004680124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000570282,0.0004518069,0.00038871515,0.00037421225,0.000696926,0.00038318656,0.00089353294,0.00026797905,0.0021017862],"category_scores_gemma":[0.0022189398,0.0003277633,0.00016986705,0.0004371783,0.0006599416,0.001676703,0.0010599302,0.00047340803,0.0002933113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014965077,0.00041116637,0.0086852675,0.00064596627,0.00010255566,0.001150808,0.0014676587,0.3330264,0.26759735,0.06760564,0.004301502,0.31350917],"study_design_scores_gemma":[0.0000903509,0.00063784193,0.0014069608,0.0000289641,0.0000914795,0.00040387077,0.0003260185,0.856618,0.10611766,0.027904091,0.0063430606,0.000031732696],"about_ca_topic_score_codex":0.0005248779,"about_ca_topic_score_gemma":0.0019382298,"teacher_disagreement_score":0.0021017862,"about_ca_system_score_codex":0.00033150832,"about_ca_system_score_gemma":0.0005692629,"threshold_uncertainty_score":0.0070311427},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005432998,0.0039598946,0.74803185,0.0043358826,0.0036310041,0.00042768574,0.006588746,0.03777713,0.18981475],"genre_scores_gemma":[0.15437508,0.008849145,0.5857514,0.006422523,0.002826576,0.0008479756,0.02235978,0.016788945,0.20177862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969783,0.0005823711,0.00020252647,0.0005455214,0.0013743191,0.00031699825],"domain_scores_gemma":[0.9959552,0.0008143762,0.00017488358,0.0016467617,0.000966108,0.0004426908],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002216629,0.0011336311,0.00082594156,0.0011987637,0.0012431944,0.0066467933,0.0029302195,0.0015709208,0.06196843],"category_scores_gemma":[0.008783765,0.0007425202,0.0014610055,0.0010850494,0.0013463058,0.009397326,0.005418991,0.002950251,0.02400284],"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.00039532487,0.00009815483,0.0017130885,0.00057387433,0.00009477443,0.00036209164,0.00061437173,0.004212468,0.005080874,0.4295476,0.24305886,0.31424844],"study_design_scores_gemma":[0.000039151433,0.00005210569,0.00015298906,0.0000966132,0.000045091827,0.00028841422,0.00011578877,0.005479593,0.0041041938,0.08987688,0.8997136,0.00003565608],"about_ca_topic_score_codex":0.0033933744,"about_ca_topic_score_gemma":0.005372604,"teacher_disagreement_score":0.93803155,"about_ca_system_score_codex":0.00097386935,"about_ca_system_score_gemma":0.0021149053,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12621768,0.00033622474,0.80293244,0.00038926242,0.00044200715,0.0007719247,0.00421325,0.017830018,0.046867166],"genre_scores_gemma":[0.40913433,0.00030534415,0.56249595,0.00021532625,0.000045205135,0.0019566389,0.0041321297,0.0022397425,0.0194754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975234,0.000058082416,0.000012679646,0.000030695766,0.00011474792,0.000031476844],"domain_scores_gemma":[0.9995554,0.00014986108,0.000019283834,0.000085577245,0.00014799993,0.000041868578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037623922,0.0004766715,0.00060469785,0.00019569653,0.00047774753,0.0004582065,0.0013894202,0.0006847894,0.012038072],"category_scores_gemma":[0.001431263,0.00037025122,0.00038999756,0.00042800623,0.00028564344,0.0005399447,0.00066089263,0.0014760647,0.0018462148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064743654,0.00021921551,0.0028066128,0.00044559684,0.00013249222,0.0005640379,0.00027430884,0.7507489,0.08063049,0.06822093,0.039084956,0.056225017],"study_design_scores_gemma":[0.00009951664,0.00007744637,0.00024040724,0.00001124302,0.000016559316,0.00005962693,0.000016907883,0.94298685,0.02237968,0.0037165238,0.030376902,0.000018321069],"about_ca_topic_score_codex":0.0024339096,"about_ca_topic_score_gemma":0.002430737,"teacher_disagreement_score":0.012038072,"about_ca_system_score_codex":0.00044068712,"about_ca_system_score_gemma":0.0011174482,"threshold_uncertainty_score":0.0402714},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11294964,0.00015367506,0.8746696,0.0002699297,0.00007050441,0.00014232859,0.00011800602,0.005736113,0.0058902013],"genre_scores_gemma":[0.5554268,0.00017403005,0.4370922,0.00015254458,0.00005714871,0.0002183968,0.00039865728,0.00028413444,0.0061962204],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996257,0.00006704975,0.000032117114,0.00008683265,0.0001143263,0.00007400867],"domain_scores_gemma":[0.9994085,0.00014584037,0.000036306727,0.00022367427,0.0001414472,0.00004420575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008212,0.00032725531,0.0004430877,0.0006125461,0.0007942856,0.0011811925,0.0017170536,0.0006085656,0.0019166342],"category_scores_gemma":[0.00096349313,0.0003924271,0.0005482119,0.00073651277,0.0010501927,0.0020302054,0.00082449825,0.00097147754,0.0003530042],"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.001690864,0.0006505962,0.0061078263,0.0003124278,0.00015064055,0.0007483711,0.0009603596,0.24632671,0.15710634,0.28265896,0.010669986,0.2926169],"study_design_scores_gemma":[0.00012378492,0.00023435071,0.0010939046,0.000023241448,0.000065521606,0.0001781067,0.000038066362,0.86074483,0.061598174,0.05304942,0.022790674,0.00005996063],"about_ca_topic_score_codex":0.004125839,"about_ca_topic_score_gemma":0.0042697606,"teacher_disagreement_score":0.004125839,"about_ca_system_score_codex":0.0014984258,"about_ca_system_score_gemma":0.0016492215,"threshold_uncertainty_score":0.010871947},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014619573,0.0056129713,0.09302916,0.0068514524,0.008868932,0.0003997333,0.007106702,0.0060387496,0.85747284],"genre_scores_gemma":[0.2501328,0.006313306,0.053513587,0.0053865085,0.0018397174,0.00055820774,0.026048642,0.0025821347,0.65362513],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99870026,0.00011390034,0.000055041586,0.00034985563,0.0005568777,0.00022401106],"domain_scores_gemma":[0.999017,0.00007190256,0.000044145385,0.00027565748,0.0004809868,0.00011018358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010932877,0.0009051511,0.0007397823,0.0016247674,0.0020172219,0.0034416807,0.0017204686,0.0021616707,0.16860695],"category_scores_gemma":[0.0022154755,0.0003711759,0.0009211488,0.0013551597,0.0007392277,0.0025006772,0.003127666,0.0016750994,0.09288867],"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.00064551254,0.00014969884,0.0029986077,0.0007612811,0.000106150845,0.0008693257,0.00041876032,0.005380867,0.021931462,0.19923747,0.35802004,0.40948078],"study_design_scores_gemma":[0.000038812836,0.000075152515,0.0011544438,0.00014866481,0.000029832487,0.0004628425,0.00016148282,0.004363225,0.010723776,0.023004765,0.95980114,0.000035959907],"about_ca_topic_score_codex":0.003570402,"about_ca_topic_score_gemma":0.0028738177,"teacher_disagreement_score":0.16860695,"about_ca_system_score_codex":0.001817534,"about_ca_system_score_gemma":0.0023208747,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3455613,0.0021164976,0.62201667,0.00053296704,0.00021123668,0.00028905732,0.0012711604,0.009368928,0.01863213],"genre_scores_gemma":[0.92962873,0.0006261038,0.06501083,0.00013395821,0.0000626426,0.000092744835,0.00076754065,0.00012299462,0.0035545544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997749,0.000029234838,0.000012317314,0.000051068946,0.000101807396,0.000030804727],"domain_scores_gemma":[0.9987953,0.0003211856,0.0001334775,0.00036271603,0.0003351783,0.000052104857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026941262,0.0005427387,0.0003499043,0.0003809489,0.0002945609,0.00048170096,0.000971515,0.0003571892,0.003206442],"category_scores_gemma":[0.002028132,0.00023569987,0.00034177548,0.0006497688,0.00027180946,0.0011201377,0.0005494986,0.00037582085,0.000777286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093900843,0.00022497601,0.026462417,0.00034057494,0.00010733712,0.0006990647,0.00025580503,0.36974627,0.075903185,0.024406772,0.010259611,0.4906549],"study_design_scores_gemma":[0.00002651917,0.00020862005,0.0020009363,0.000018220935,0.00003357405,0.0003408074,0.000041196286,0.9531688,0.027321115,0.009857133,0.006961902,0.000021077094],"about_ca_topic_score_codex":0.0028381462,"about_ca_topic_score_gemma":0.0029328833,"teacher_disagreement_score":0.003206442,"about_ca_system_score_codex":0.00041006305,"about_ca_system_score_gemma":0.00075861614,"threshold_uncertainty_score":0.010726571},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98901004,0.0003771734,0.0063694865,0.00004748164,0.000009756848,0.00002954518,0.0003295288,0.0005802302,0.0032466569],"genre_scores_gemma":[0.988889,0.00021223382,0.008048181,0.000016274123,0.000009230506,0.000040857616,0.0014909876,0.000100831116,0.0011925114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938774,0.000075065545,0.000031013835,0.000082314386,0.00028470307,0.00013912833],"domain_scores_gemma":[0.9987897,0.0003803948,0.00010764488,0.00016734314,0.00046893288,0.00008603168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004985095,0.00086403586,0.0005564507,0.00073932274,0.000437026,0.00048353735,0.00070140033,0.00026449395,0.001439411],"category_scores_gemma":[0.0020009722,0.0003250433,0.0003586007,0.0012899749,0.00022370712,0.0007497779,0.00034858982,0.00041630137,0.0003294883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024325955,0.0009943607,0.09108128,0.0010795885,0.000325661,0.002132548,0.00042715436,0.4268765,0.25639972,0.008375388,0.010211398,0.19966382],"study_design_scores_gemma":[0.000054037355,0.0005965294,0.087439954,0.000026168664,0.00006328618,0.00049988943,0.00021703783,0.85131806,0.053246684,0.0020892906,0.0044218306,0.000027203372],"about_ca_topic_score_codex":0.0022431775,"about_ca_topic_score_gemma":0.0028600418,"teacher_disagreement_score":0.0022431775,"about_ca_system_score_codex":0.00043809338,"about_ca_system_score_gemma":0.00064887584,"threshold_uncertainty_score":0.00481534},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029781854,0.00025091847,0.92362094,0.0003745637,0.00014424928,0.00013985454,0.0001517516,0.04035086,0.0051850267],"genre_scores_gemma":[0.47434586,0.00032041216,0.5068251,0.0004280467,0.0000969834,0.00027563874,0.00050055934,0.010371014,0.006836375],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951427,0.0018949116,0.00028196038,0.0005551269,0.0016309491,0.00049430924],"domain_scores_gemma":[0.9828804,0.0059805745,0.0018327342,0.0066458597,0.0020352732,0.0006252559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034604147,0.0015025724,0.00088131055,0.0010998914,0.00074406405,0.0022682499,0.0032550602,0.0012012378,0.0049561085],"category_scores_gemma":[0.02028017,0.00097056956,0.00058055134,0.0005763532,0.0013422654,0.0046838606,0.0033121502,0.0026956096,0.0017477666],"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.002200067,0.00067835697,0.01940776,0.000988669,0.00019770005,0.0010194221,0.0027343235,0.049857862,0.094180495,0.08951345,0.036719855,0.7025021],"study_design_scores_gemma":[0.0003125414,0.0007742784,0.004531712,0.00027982556,0.00017345892,0.0016527078,0.00028315675,0.54903394,0.2933814,0.056644775,0.092604026,0.00032817217],"about_ca_topic_score_codex":0.0012264566,"about_ca_topic_score_gemma":0.000996574,"teacher_disagreement_score":0.0049561085,"about_ca_system_score_codex":0.0006100883,"about_ca_system_score_gemma":0.0015361271,"threshold_uncertainty_score":0.018300653},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018067,0.0005746468,0.4597916,0.0010805678,0.0011888809,0.0014161434,0.020702163,0.16126743,0.3359115],"genre_scores_gemma":[0.1083229,0.00075970637,0.37936378,0.0019312367,0.00022818518,0.0013187247,0.050329503,0.02001469,0.4377314],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99891853,0.00012883199,0.000095184834,0.00031926573,0.0003828986,0.0001553729],"domain_scores_gemma":[0.9982444,0.00018703501,0.00008610772,0.00077210576,0.00060716947,0.00010319651],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00086482207,0.0010457006,0.0006058112,0.0011880894,0.00096663187,0.0028221633,0.001884912,0.0010915794,0.13781093],"category_scores_gemma":[0.0030071437,0.0005214914,0.000771723,0.00092432566,0.00044556722,0.0031118486,0.0031881428,0.0013064675,0.11433238],"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.0010528172,0.00028292823,0.0035558175,0.0009428208,0.000075287135,0.00039930528,0.0005472748,0.002237868,0.024255365,0.08712898,0.30940253,0.570119],"study_design_scores_gemma":[0.00009595913,0.00012990193,0.0010085754,0.00009899576,0.00004032107,0.00044589132,0.00016166818,0.008518698,0.037632115,0.017537456,0.93427825,0.000052128806],"about_ca_topic_score_codex":0.0014117836,"about_ca_topic_score_gemma":0.0023182726,"teacher_disagreement_score":0.86218905,"about_ca_system_score_codex":0.0005972036,"about_ca_system_score_gemma":0.0020323077,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13494013,0.00024996776,0.8571635,0.00014003145,0.00002667948,0.00012590933,0.00036037504,0.0024988938,0.0044945935],"genre_scores_gemma":[0.8953247,0.00024172357,0.10182964,0.00006605223,0.000041494743,0.00023828303,0.000738529,0.00028343833,0.0012360599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988427,0.00027076158,0.00006967661,0.00015367546,0.0005151636,0.00014792163],"domain_scores_gemma":[0.9975115,0.00079933397,0.0002919555,0.00071408367,0.0005846597,0.000098450306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079112436,0.001138463,0.00094989117,0.0011184707,0.00038718365,0.0013175105,0.0011465652,0.0005985812,0.00137844],"category_scores_gemma":[0.005780679,0.00031790708,0.0004398593,0.0013352763,0.00063044316,0.0028690214,0.00097347377,0.0007856678,0.00044218812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019823766,0.000100197394,0.0075441087,0.00009686463,0.00003207957,0.00013877731,0.00016000691,0.8806229,0.02329586,0.02060471,0.0017715254,0.06543469],"study_design_scores_gemma":[0.000002233716,0.000017882167,0.0005765678,0.000003030105,0.0000029148991,0.000016184784,0.000009646548,0.9933293,0.0024849907,0.0032643706,0.0002849973,0.0000079710835],"about_ca_topic_score_codex":0.0036532674,"about_ca_topic_score_gemma":0.0023035256,"teacher_disagreement_score":0.0036532674,"about_ca_system_score_codex":0.0006332802,"about_ca_system_score_gemma":0.0007794619,"threshold_uncertainty_score":0.0072639585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009929917,0.00032729484,0.9764454,0.000094688876,0.00006596161,0.00021005503,0.00005054169,0.005655094,0.0072210594],"genre_scores_gemma":[0.122189164,0.0005811932,0.86973006,0.00011800394,0.00003212962,0.00039751144,0.00034077096,0.00095226406,0.0056589576],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990433,0.00018697327,0.00006884899,0.00008983361,0.0005319758,0.00007904981],"domain_scores_gemma":[0.9987413,0.00028103875,0.0000946652,0.00047078964,0.00035501228,0.000057143232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009675933,0.0006260575,0.00034214385,0.00062119507,0.00032955117,0.00120145,0.0018757364,0.0006115267,0.004071286],"category_scores_gemma":[0.0026050752,0.00054885657,0.00048323878,0.00045763518,0.0004932085,0.0012105809,0.0007048871,0.0011002875,0.0014317967],"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.00027586415,0.00022963743,0.0015856881,0.00086751836,0.00011486379,0.0005837349,0.00062028493,0.081021704,0.22012496,0.11735777,0.013934566,0.5632835],"study_design_scores_gemma":[0.00021528822,0.0007351442,0.0021589764,0.00018582561,0.00014403669,0.0014430514,0.00010045881,0.43109098,0.2609394,0.029444389,0.27341163,0.0001309673],"about_ca_topic_score_codex":0.000761979,"about_ca_topic_score_gemma":0.0008029684,"teacher_disagreement_score":0.004071286,"about_ca_system_score_codex":0.00053677475,"about_ca_system_score_gemma":0.0008810288,"threshold_uncertainty_score":0.01361984},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03052319,0.0003898176,0.9616118,0.00013856268,0.00008422256,0.00006180988,0.00008216225,0.0031155266,0.0039928495],"genre_scores_gemma":[0.40285173,0.00029453394,0.5932082,0.00013960514,0.000032980435,0.00010576711,0.00015881733,0.00012002645,0.0030883427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998543,0.000023232442,0.00001074349,0.000024579196,0.00006866073,0.00001844422],"domain_scores_gemma":[0.9998599,0.00003717387,0.000015290674,0.00005179685,0.00002627634,0.000009551038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017884643,0.00034496255,0.00026132833,0.0003108884,0.0002337974,0.00044618265,0.000805705,0.00025740123,0.0021145318],"category_scores_gemma":[0.0003264563,0.00018233775,0.00028860313,0.00028277125,0.00030982617,0.0005763008,0.0003353546,0.00043487086,0.00037235697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028385062,0.00012505571,0.0011997789,0.00033469324,0.0001106109,0.00028917854,0.000119497774,0.21087074,0.23972872,0.0732405,0.0060754595,0.46762192],"study_design_scores_gemma":[0.000057702116,0.00047122003,0.0007819551,0.00004082922,0.00008417206,0.00032155123,0.000029306135,0.8144051,0.12891044,0.018242372,0.036626432,0.00002897366],"about_ca_topic_score_codex":0.001284937,"about_ca_topic_score_gemma":0.0025714366,"teacher_disagreement_score":0.0021145318,"about_ca_system_score_codex":0.00047296443,"about_ca_system_score_gemma":0.0005888871,"threshold_uncertainty_score":0.0070738196},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06352185,0.015980816,0.4474134,0.030195413,0.0015700624,0.00012664862,0.0005971442,0.00108222,0.4395124],"genre_scores_gemma":[0.80898774,0.013046384,0.108070485,0.003978993,0.005207629,0.00042031147,0.0006518385,0.0016809092,0.057955705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963238,0.00059513433,0.00012588923,0.00062472885,0.0018746845,0.00045580274],"domain_scores_gemma":[0.9913838,0.005200962,0.00044305102,0.00144755,0.0013085759,0.00021602737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024550005,0.0012994144,0.0009722789,0.0017462391,0.0016645335,0.003868825,0.0019269327,0.001256177,0.014972831],"category_scores_gemma":[0.019395862,0.0005845822,0.0012504916,0.0021936556,0.004871801,0.013729001,0.004128736,0.0041333046,0.0025989409],"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.000037375146,0.000021997716,0.0004613083,0.00015958985,0.000015687181,0.000093478644,0.00023637054,0.012470889,0.00047375905,0.95617366,0.0070469165,0.02280897],"study_design_scores_gemma":[0.000020980215,0.000019521312,0.00049279345,0.00005089698,0.000013316111,0.00011089645,0.00006166098,0.034304857,0.0008375958,0.92876434,0.03531038,0.0000127879775],"about_ca_topic_score_codex":0.0045389314,"about_ca_topic_score_gemma":0.0030271902,"teacher_disagreement_score":0.014972831,"about_ca_system_score_codex":0.0035419415,"about_ca_system_score_gemma":0.0018485781,"threshold_uncertainty_score":0.05008912},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13979532,0.0003881888,0.784851,0.00035470034,0.0002043936,0.00022814742,0.000573323,0.020856481,0.052748382],"genre_scores_gemma":[0.50077486,0.00023452079,0.4812329,0.00016864842,0.000042236672,0.0001753681,0.0011418159,0.00073110405,0.015498442],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99977666,0.000032176726,0.000011021653,0.000025771273,0.00011769331,0.00003665625],"domain_scores_gemma":[0.9997211,0.00010270462,0.000021698705,0.00005807246,0.000076622026,0.000019739513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026719837,0.00061314396,0.00030938606,0.00032134005,0.000216574,0.00047120918,0.00085939834,0.00032147302,0.009739999],"category_scores_gemma":[0.0007980973,0.00024207769,0.00032073984,0.00039742142,0.00019924334,0.0003926971,0.0003668117,0.00054669316,0.002341715],"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.0008365449,0.0003820548,0.0045146383,0.0005744137,0.00015779762,0.0011696653,0.00026075548,0.37903857,0.12134353,0.032079376,0.033157825,0.4264848],"study_design_scores_gemma":[0.00022271455,0.0002575799,0.0011444698,0.000032355227,0.000027256825,0.00022461054,0.000048825637,0.94018984,0.03611805,0.0025699139,0.019141281,0.000022962839],"about_ca_topic_score_codex":0.0039479034,"about_ca_topic_score_gemma":0.0073615774,"teacher_disagreement_score":0.009739999,"about_ca_system_score_codex":0.0003810968,"about_ca_system_score_gemma":0.0009375929,"threshold_uncertainty_score":0.032583535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005487225,0.00016897047,0.98173034,0.00022828608,0.000106977575,0.00014068201,0.00009032158,0.005283302,0.006763881],"genre_scores_gemma":[0.19092153,0.00048539529,0.79292554,0.00051129994,0.00014324447,0.0005952714,0.000425597,0.0021290518,0.011863052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99691224,0.0008199151,0.00020579204,0.0005013862,0.0012183876,0.0003422442],"domain_scores_gemma":[0.9987249,0.00037567524,0.000067439316,0.0004755016,0.000265665,0.00009097881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037299888,0.0006380776,0.0008573581,0.0008902641,0.001205504,0.004302269,0.0023715466,0.0013385894,0.0060200794],"category_scores_gemma":[0.0053033335,0.0010940598,0.0016218215,0.0007704969,0.002793379,0.004860431,0.004313918,0.0035532755,0.0023783988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018023324,0.000066698136,0.00063245103,0.00030835407,0.00007610137,0.00042136712,0.0013381451,0.013039237,0.009773018,0.9043057,0.004722483,0.06513625],"study_design_scores_gemma":[0.00015546971,0.00017520368,0.00062495074,0.0003296909,0.00019739392,0.0004739928,0.00033039643,0.1391149,0.031262815,0.57911754,0.24808718,0.00013044702],"about_ca_topic_score_codex":0.0025597895,"about_ca_topic_score_gemma":0.0029198355,"teacher_disagreement_score":0.0060200794,"about_ca_system_score_codex":0.0014779993,"about_ca_system_score_gemma":0.002517424,"threshold_uncertainty_score":0.020139158},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070129624,0.00006731624,0.9311543,0.00008434383,0.000090956135,0.0002784338,0.0004983774,0.048008133,0.012805104],"genre_scores_gemma":[0.10610467,0.00021638053,0.86378443,0.00037616128,0.00005791309,0.0006593481,0.0015953691,0.0080206,0.019185226],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995573,0.00003316442,0.00006517126,0.00010479535,0.00016782476,0.00007175275],"domain_scores_gemma":[0.9989655,0.00029593226,0.00008342657,0.00022443947,0.00039564705,0.000035077348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005128312,0.0009907811,0.00048442913,0.0008881201,0.00042059144,0.0011150218,0.0013488675,0.00051784696,0.017514471],"category_scores_gemma":[0.0017408245,0.0004938135,0.00062506157,0.00051644945,0.00035400005,0.00074002414,0.00048561132,0.0009809784,0.008330408],"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.001006971,0.0003418488,0.002460673,0.0011826598,0.00022299195,0.0009212777,0.00043916484,0.083518505,0.19680542,0.057314046,0.06153428,0.59425217],"study_design_scores_gemma":[0.00034369697,0.0002640567,0.0010758127,0.000119014,0.00012834484,0.0009085844,0.000045968958,0.4866806,0.3022066,0.014858926,0.19324976,0.00011858167],"about_ca_topic_score_codex":0.0019074222,"about_ca_topic_score_gemma":0.0017995808,"teacher_disagreement_score":0.017514471,"about_ca_system_score_codex":0.00071766815,"about_ca_system_score_gemma":0.001621289,"threshold_uncertainty_score":0.058591723},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21103841,0.00064322195,0.7764827,0.00040482782,0.00010767979,0.00016651028,0.000064765896,0.003403043,0.007688758],"genre_scores_gemma":[0.71767205,0.0002525834,0.2792178,0.000091973896,0.00005538751,0.00013269336,0.00011284773,0.00032187512,0.0021427881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995927,0.000081562896,0.000027203982,0.000077113866,0.00013519921,0.000086184395],"domain_scores_gemma":[0.9993327,0.00021095871,0.00009426365,0.00019514158,0.00011226532,0.00005471187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005908914,0.0005634889,0.0006216431,0.00051578705,0.0007717737,0.0008251974,0.0009259988,0.00044031133,0.0028947997],"category_scores_gemma":[0.0018864878,0.0004490087,0.00029486069,0.0006924926,0.00071312767,0.0011172439,0.00076859025,0.0008406562,0.00053539436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00103051,0.00033029699,0.0039920514,0.00021515126,0.00005960873,0.0004539068,0.00081515266,0.3837854,0.18991792,0.06469633,0.008247145,0.34645653],"study_design_scores_gemma":[0.00007466086,0.00008608537,0.00049087056,0.000010736609,0.00001244801,0.00007042929,0.000050912633,0.94714165,0.035554424,0.008902902,0.007587237,0.00001771157],"about_ca_topic_score_codex":0.0026909283,"about_ca_topic_score_gemma":0.004483146,"teacher_disagreement_score":0.0028947997,"about_ca_system_score_codex":0.00079944194,"about_ca_system_score_gemma":0.0014201142,"threshold_uncertainty_score":0.009684026},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4695925,0.00013226864,0.5147706,0.00007919391,0.000028964598,0.00008102124,0.000052398962,0.0023003398,0.01296281],"genre_scores_gemma":[0.8251637,0.00006952272,0.170876,0.000034061315,0.0000059308063,0.000043163112,0.00008498774,0.00011926222,0.0036033485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998293,0.000025457457,0.000009384525,0.000030089906,0.00006312853,0.000042581618],"domain_scores_gemma":[0.9996387,0.000101637255,0.000044447108,0.00009810818,0.000087131004,0.00002997723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019338256,0.0003828862,0.00022293672,0.0003509789,0.0002190877,0.00051566685,0.00063281745,0.00022139993,0.002289159],"category_scores_gemma":[0.0004721464,0.00019350041,0.00030917907,0.00041704933,0.00028623338,0.0006321188,0.00055620045,0.00035289806,0.00030548376],"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.0004856124,0.00025705583,0.0043374537,0.00016554011,0.00006051797,0.0007943535,0.00023405757,0.59188575,0.12210464,0.030650875,0.0015462053,0.24747792],"study_design_scores_gemma":[0.000030569438,0.00047334455,0.0013919749,0.000016567015,0.00003734339,0.0003433533,0.00009267698,0.932234,0.051225662,0.007714043,0.0064138407,0.000026607404],"about_ca_topic_score_codex":0.0013810042,"about_ca_topic_score_gemma":0.0034539143,"teacher_disagreement_score":0.002289159,"about_ca_system_score_codex":0.0003699682,"about_ca_system_score_gemma":0.00049177767,"threshold_uncertainty_score":0.007657945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011558617,0.00007544874,0.83748484,0.00021116275,0.00007106217,0.00022558068,0.0006701111,0.13619834,0.013504921],"genre_scores_gemma":[0.13448909,0.0002945012,0.821067,0.00067964947,0.000054746084,0.0010702794,0.004391002,0.027025111,0.010928625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884355,0.00024274753,0.000115459836,0.00016749364,0.00046473436,0.00016599234],"domain_scores_gemma":[0.9979158,0.00087133516,0.0001505519,0.00060566573,0.00038078375,0.00007583695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017143462,0.0008757455,0.00067446334,0.0008001236,0.00077819615,0.0019542212,0.0025748473,0.0013602873,0.011926153],"category_scores_gemma":[0.0049943114,0.0011747876,0.0010189182,0.00086351606,0.0011271134,0.0024887472,0.00192618,0.0025807114,0.0051088966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016735881,0.00062923704,0.00648661,0.00092617277,0.00022522167,0.0014941636,0.001156275,0.19565484,0.06529929,0.17800741,0.1933546,0.35509256],"study_design_scores_gemma":[0.00048099185,0.00020005617,0.0015302144,0.00012950937,0.00009431015,0.00053082226,0.00006904057,0.66441673,0.07650879,0.03370171,0.22216423,0.00017361103],"about_ca_topic_score_codex":0.003124005,"about_ca_topic_score_gemma":0.0022608591,"teacher_disagreement_score":0.011926153,"about_ca_system_score_codex":0.000985065,"about_ca_system_score_gemma":0.0021852362,"threshold_uncertainty_score":0.039896905},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5232819,0.0006490801,0.39836416,0.0020979072,0.00015061942,0.00037585385,0.00032092974,0.00046011768,0.07429944],"genre_scores_gemma":[0.68889654,0.0005087052,0.29612,0.00031019977,0.00008487336,0.00063310534,0.00034626294,0.00029251876,0.012807838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99782205,0.0010746939,0.00008500365,0.00022338268,0.00055632275,0.00023848048],"domain_scores_gemma":[0.99356985,0.004875913,0.0006626742,0.0003463483,0.00037102457,0.00017409476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024795942,0.0005573162,0.00031982653,0.001003521,0.001373076,0.001516859,0.0008638021,0.0006538308,0.002951636],"category_scores_gemma":[0.0110218115,0.00026880248,0.00048610967,0.0011558419,0.0029912628,0.0031243034,0.0019285291,0.0016463145,0.0001877625],"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.00017238707,0.00013072834,0.0029878917,0.00017519697,0.00002179768,0.00012724707,0.0008506525,0.10619885,0.0014636586,0.85726887,0.0025465216,0.028056234],"study_design_scores_gemma":[0.000093229806,0.00024223264,0.00254171,0.0000864049,0.000018798117,0.00021803736,0.00084820064,0.5167608,0.009420638,0.4438135,0.025899287,0.000057182962],"about_ca_topic_score_codex":0.005102737,"about_ca_topic_score_gemma":0.0025070428,"teacher_disagreement_score":0.005102737,"about_ca_system_score_codex":0.0015587765,"about_ca_system_score_gemma":0.0016850525,"threshold_uncertainty_score":0.013113499},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026796253,0.0031382227,0.4945011,0.003160115,0.0025789798,0.00045767333,0.009810343,0.11269223,0.34686515],"genre_scores_gemma":[0.3341461,0.0016141281,0.33125952,0.0038121447,0.00037911566,0.0008077421,0.020896038,0.017994294,0.28909087],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941134,0.00007298486,0.0000225249,0.00010548087,0.0002976557,0.00009007735],"domain_scores_gemma":[0.99879944,0.0002007852,0.000063681466,0.00037753038,0.00040825788,0.00015025702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005933769,0.00074907154,0.00072942756,0.0007224786,0.0007876205,0.001666549,0.0018971348,0.0014845295,0.09725943],"category_scores_gemma":[0.0027750535,0.0006948754,0.00048367959,0.0009637562,0.0006729256,0.0024049296,0.002113698,0.0015732904,0.0407053],"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.0028935752,0.0002708699,0.002780167,0.0009217999,0.000100109435,0.00080930546,0.0004006177,0.02912639,0.095438026,0.12870814,0.43632394,0.3022271],"study_design_scores_gemma":[0.00027730328,0.00042180732,0.0010353378,0.00013074941,0.000049935465,0.0010077996,0.00006604991,0.07098317,0.06410897,0.028498389,0.83330905,0.00011151096],"about_ca_topic_score_codex":0.0018061617,"about_ca_topic_score_gemma":0.0018440034,"teacher_disagreement_score":0.09725943,"about_ca_system_score_codex":0.0009613805,"about_ca_system_score_gemma":0.0012247104,"threshold_uncertainty_score":0.3253652},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027341677,0.0005334415,0.8749338,0.0010255213,0.0008871787,0.0002919303,0.0007928666,0.029211832,0.06498175],"genre_scores_gemma":[0.45212424,0.0008098241,0.4928934,0.00068887026,0.00064725836,0.0011586071,0.0033645183,0.0034550054,0.04485825],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985386,0.00026428964,0.00007723527,0.0001694203,0.00073473185,0.00021580301],"domain_scores_gemma":[0.9985655,0.00021147532,0.00009453163,0.00048044996,0.00052492507,0.0001231423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009263592,0.00049308536,0.00049911,0.0009040737,0.0012478099,0.0014350265,0.0017789114,0.00064854074,0.009692275],"category_scores_gemma":[0.003798232,0.0004444534,0.00036109315,0.0010966882,0.00049647846,0.0017285526,0.0019626848,0.0016131888,0.0037313055],"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.0012025149,0.00027142427,0.0034541292,0.00056698977,0.00009627351,0.0007964722,0.0008800354,0.07939929,0.07376128,0.3210207,0.16017129,0.35837954],"study_design_scores_gemma":[0.0002942367,0.00016997865,0.0020810713,0.00010412131,0.00004327881,0.00030853506,0.00013546774,0.54908496,0.039787624,0.100888796,0.30697224,0.00012972795],"about_ca_topic_score_codex":0.002210954,"about_ca_topic_score_gemma":0.0021386498,"teacher_disagreement_score":0.009692275,"about_ca_system_score_codex":0.00069025264,"about_ca_system_score_gemma":0.0010589089,"threshold_uncertainty_score":0.032423913},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012748611,0.00031585945,0.9837278,0.00005500757,0.000021280626,0.00002263402,0.000026523323,0.00038909074,0.002693291],"genre_scores_gemma":[0.19704722,0.00059426593,0.7932128,0.0000905587,0.00006529108,0.00014653387,0.00018376907,0.0004464669,0.008213118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985325,0.000023794975,0.000005542819,0.000025762974,0.0000756751,0.000015825344],"domain_scores_gemma":[0.9998754,0.00004556351,0.000015345595,0.00002980438,0.000027181588,0.000006669742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019891666,0.000647772,0.00049143296,0.0005035107,0.00031387637,0.00020720554,0.0005746229,0.00020247781,0.0025512911],"category_scores_gemma":[0.00047129524,0.0002587647,0.00047980962,0.0004460232,0.0003186405,0.00046654642,0.0004970514,0.0007180907,0.00047986224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019062866,0.0000924439,0.0004311856,0.0002681759,0.00006744076,0.00009764236,0.0001589295,0.20123339,0.11585533,0.055370342,0.004135913,0.6220987],"study_design_scores_gemma":[0.00006971734,0.00066685554,0.0007277091,0.00006464393,0.00010076802,0.00034500775,0.000045174853,0.8363259,0.072640195,0.061131403,0.027847048,0.000035643843],"about_ca_topic_score_codex":0.00044836968,"about_ca_topic_score_gemma":0.0011505197,"teacher_disagreement_score":0.0025512911,"about_ca_system_score_codex":0.0001967904,"about_ca_system_score_gemma":0.00035601854,"threshold_uncertainty_score":0.008534908},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050433513,0.00038891556,0.93429345,0.00022871039,0.00016302618,0.000173863,0.000031606352,0.0028516722,0.011435254],"genre_scores_gemma":[0.56989306,0.0002694831,0.4207544,0.00022786958,0.000042970947,0.00028557898,0.00011445858,0.0003624345,0.008049735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996111,0.00008681541,0.000032879085,0.000054779903,0.00014579567,0.0000686862],"domain_scores_gemma":[0.9996013,0.00008283222,0.000032466258,0.00012468884,0.00012269767,0.000036009635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039740966,0.00030205163,0.0002380775,0.0002528187,0.00029692848,0.0010167423,0.001083129,0.000299209,0.0029492122],"category_scores_gemma":[0.0007876671,0.0002375003,0.00034000786,0.00017060642,0.0003209319,0.00066055765,0.0005258108,0.00091959175,0.0008015621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011064125,0.00043433582,0.0032663643,0.0007270774,0.00017341277,0.0006582518,0.0006269748,0.06346288,0.3363336,0.13835508,0.0087350635,0.4461206],"study_design_scores_gemma":[0.00030437057,0.0018102465,0.0036084747,0.00012614072,0.0003268398,0.0015239603,0.0001755864,0.47107756,0.31969348,0.0386992,0.16255476,0.0000993509],"about_ca_topic_score_codex":0.00041761904,"about_ca_topic_score_gemma":0.0007307544,"teacher_disagreement_score":0.0029492122,"about_ca_system_score_codex":0.00025974054,"about_ca_system_score_gemma":0.00076436996,"threshold_uncertainty_score":0.009866059},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48095042,0.0057701683,0.4771305,0.0002705512,0.00037423795,0.00069020333,0.0010170436,0.01849665,0.015300366],"genre_scores_gemma":[0.82033783,0.0016618059,0.1728017,0.00009745217,0.000034557423,0.00018247799,0.001002439,0.0008423133,0.003039502],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967367,0.00074676576,0.0003216882,0.00021449274,0.0017418956,0.00023844701],"domain_scores_gemma":[0.9939674,0.002880982,0.0004932412,0.00085983006,0.001639953,0.00015859907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015911895,0.0008454049,0.0006576724,0.0022469566,0.0003127288,0.0010789165,0.0011542602,0.00042272202,0.002204599],"category_scores_gemma":[0.009276419,0.00041893823,0.00044774843,0.0018820812,0.00020568336,0.0014170673,0.0005564852,0.00049536285,0.00056417816],"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.0039886516,0.00036125866,0.015996015,0.0019323354,0.00030159284,0.0007686145,0.000755587,0.044608634,0.09994585,0.007284057,0.0046715112,0.8193858],"study_design_scores_gemma":[0.00044457865,0.005545348,0.062573835,0.0009325338,0.0005985073,0.004007941,0.0013278427,0.44018754,0.40230286,0.004539709,0.07714343,0.00039595002],"about_ca_topic_score_codex":0.0007750966,"about_ca_topic_score_gemma":0.00092525565,"teacher_disagreement_score":0.0022469566,"about_ca_system_score_codex":0.0005295673,"about_ca_system_score_gemma":0.0005668892,"threshold_uncertainty_score":0.008415103},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110078104,0.00027966299,0.8757609,0.00014909044,0.000033054,0.00007846107,0.00021417612,0.011774203,0.0016323095],"genre_scores_gemma":[0.57439524,0.00013917666,0.423786,0.000036205507,0.000018451306,0.000097417425,0.00039824678,0.0003792335,0.0007501394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995828,0.00012291547,0.000021638301,0.000060441627,0.00018050853,0.000031614363],"domain_scores_gemma":[0.9982316,0.00081413,0.00035588033,0.00029163933,0.00026495906,0.000041718013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041343848,0.0008305672,0.00040415523,0.0006447168,0.0003189675,0.00040005828,0.0010616129,0.00033322474,0.0019207615],"category_scores_gemma":[0.0030960874,0.00043204916,0.0004365455,0.0004904645,0.00031915764,0.00080138724,0.00025058902,0.0004813243,0.00060294545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033677017,0.0001013583,0.008916784,0.00018410083,0.000041155618,0.0001251509,0.000083459316,0.69602126,0.028542759,0.0051734014,0.0026529816,0.25782084],"study_design_scores_gemma":[0.000009469281,0.00003950116,0.00045013527,0.000003569417,0.000005693999,0.000018300154,0.0000033000254,0.9929201,0.0053514997,0.00080037705,0.00039166954,0.0000063792754],"about_ca_topic_score_codex":0.007851482,"about_ca_topic_score_gemma":0.010328489,"teacher_disagreement_score":0.007851482,"about_ca_system_score_codex":0.0006446544,"about_ca_system_score_gemma":0.0021660854,"threshold_uncertainty_score":0.015611589},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17245747,0.0016053581,0.8139495,0.0009809731,0.00014070988,0.000121204794,0.00015061311,0.0007160538,0.0098781185],"genre_scores_gemma":[0.8244242,0.0007818606,0.16980511,0.00016337505,0.000071149945,0.00016949543,0.0001702403,0.00022160875,0.004193002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937844,0.00021625595,0.000032418462,0.00009016248,0.00011342511,0.00016927873],"domain_scores_gemma":[0.9994167,0.00030990655,0.000098237026,0.000073600204,0.000053730204,0.000047790276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006985136,0.0009911645,0.0010596218,0.00043764844,0.00072782044,0.0010079488,0.00086455717,0.0005704342,0.0015734476],"category_scores_gemma":[0.0019876664,0.00048908516,0.0006260701,0.0010192464,0.00079104025,0.0013637631,0.00093040866,0.00080803473,0.0002951079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014138129,0.000052793912,0.00022712648,0.00008856236,0.000017277907,0.00010320599,0.00004619973,0.9494862,0.0050865533,0.02274282,0.0012523358,0.020755472],"study_design_scores_gemma":[0.000029261884,0.000049706458,0.00016093823,0.000006471933,0.0000066975595,0.00002794093,0.000023395647,0.96697456,0.0016407638,0.029907152,0.0011650514,0.0000080934815],"about_ca_topic_score_codex":0.0029904651,"about_ca_topic_score_gemma":0.0028174813,"teacher_disagreement_score":0.0029904651,"about_ca_system_score_codex":0.0011659585,"about_ca_system_score_gemma":0.0009459624,"threshold_uncertainty_score":0.008459628},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001249208,0.00024996957,0.6043482,0.00024568613,0.0006033291,0.00022301025,0.0077097197,0.35562244,0.029748447],"genre_scores_gemma":[0.036208928,0.0011542946,0.45004904,0.0011971566,0.00044007262,0.00096098694,0.021455536,0.38906157,0.099472426],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937457,0.00006372664,0.000076254946,0.00013230232,0.00025134214,0.00010180362],"domain_scores_gemma":[0.9989447,0.0004650909,0.00005615426,0.00016394652,0.00023644327,0.00013358104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087615824,0.0022198386,0.001205592,0.0014127997,0.0006845229,0.003304991,0.003990265,0.0011689506,0.14869268],"category_scores_gemma":[0.003317092,0.0025277464,0.0018351916,0.0011262692,0.00074103824,0.0030122874,0.0027276482,0.003557274,0.072574444],"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.0008579247,0.00011961948,0.00045480853,0.0020319212,0.00009807366,0.00066607574,0.00042858472,0.008068289,0.021619935,0.0331762,0.6410567,0.2914219],"study_design_scores_gemma":[0.00047338742,0.000078364435,0.00029039854,0.00036329895,0.00008618649,0.00074535684,0.00008924127,0.036887277,0.037805915,0.029300356,0.8937518,0.00012833132],"about_ca_topic_score_codex":0.0014412132,"about_ca_topic_score_gemma":0.0019174161,"teacher_disagreement_score":0.14869268,"about_ca_system_score_codex":0.00066229084,"about_ca_system_score_gemma":0.0013146882,"threshold_uncertainty_score":0.49742657},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19270743,0.00024367159,0.8023002,0.000102505604,0.0000284123,0.000035362,0.000017060285,0.000873594,0.003691749],"genre_scores_gemma":[0.6162241,0.00013325806,0.38109946,0.000043716584,0.00001852122,0.000060965725,0.000059573566,0.00007347491,0.0022868395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986756,0.000034597884,0.0000059423814,0.000018109271,0.00005557452,0.000018238117],"domain_scores_gemma":[0.99980086,0.00007432779,0.000020656506,0.000036818266,0.00005135883,0.000016060827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024267413,0.00024047818,0.00031172863,0.00029078007,0.00040008267,0.00028510447,0.00043362053,0.00020847203,0.0010931372],"category_scores_gemma":[0.0006921445,0.00012618101,0.00015874546,0.00049764285,0.00034565417,0.0006816575,0.00046665923,0.00027284518,0.0002152236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010386378,0.00015194081,0.005999804,0.00013946157,0.00006601263,0.0004414232,0.00039568995,0.24446853,0.20019624,0.04186316,0.003498997,0.5017401],"study_design_scores_gemma":[0.000045519646,0.00016716789,0.00074017595,0.000003505027,0.000014361787,0.00013839317,0.00003138767,0.9494026,0.041298818,0.004322653,0.0038236533,0.000011782775],"about_ca_topic_score_codex":0.0017086619,"about_ca_topic_score_gemma":0.003136025,"teacher_disagreement_score":0.0017086619,"about_ca_system_score_codex":0.00027983933,"about_ca_system_score_gemma":0.00036434858,"threshold_uncertainty_score":0.0036569238},"labels":[],"label_agreement":null},{"id":"W2162727661","doi":"10.1016/j.scico.2005.03.008","title":"A selective dynamic compiler for embedded Java virtual machines targeting ARM processors","year":2005,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Porting; Compiler; Operating system; Just-in-time compilation; Java; Embedded system; Embedded Java; Virtual machine; Memory footprint; strictfp; Real time Java; Software","score_opus":0.009300400936536063,"score_gpt":0.28451684635323987,"score_spread":0.2752164454167038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162727661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15756443,0.00065628963,0.76970446,0.00030515992,0.00038735956,0.0001820913,0.00040813186,0.05565647,0.015135538],"genre_scores_gemma":[0.56050676,0.00027744778,0.42095092,0.00036821043,0.000109934925,0.00017357303,0.0009532217,0.0051640333,0.011495888],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99968624,0.000041055606,0.000028686643,0.00006160215,0.00010586688,0.00007656201],"domain_scores_gemma":[0.99949276,0.00012025315,0.000045235785,0.00014860969,0.00014515636,0.000047934915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040239526,0.0005798399,0.00046486332,0.00044469797,0.0004575361,0.0007352666,0.0013628665,0.00033408648,0.0037451552],"category_scores_gemma":[0.0008497856,0.00051505625,0.00042502722,0.00038394163,0.00032646194,0.0007790105,0.000965278,0.00072430307,0.0012795787],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022326447,0.00037694603,0.004232034,0.00044425603,0.00013776973,0.00044250884,0.0003165395,0.049674112,0.2538437,0.025799131,0.032903057,0.62959725],"study_design_scores_gemma":[0.0006753534,0.00063933886,0.0028661282,0.00006382356,0.00026370867,0.00051794027,0.00013926713,0.68420476,0.23984902,0.016745616,0.05393801,0.00009712145],"about_ca_topic_score_codex":0.0011763121,"about_ca_topic_score_gemma":0.003246255,"teacher_disagreement_score":0.0037451552,"about_ca_system_score_codex":0.00039445848,"about_ca_system_score_gemma":0.0013476503,"threshold_uncertainty_score":0.012528837},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045324158,0.0065519386,0.90817666,0.0010149457,0.0006048611,0.00017757727,0.000217133,0.0044075185,0.033525188],"genre_scores_gemma":[0.5186315,0.0039806133,0.46085793,0.00042816362,0.00043101443,0.00031753667,0.00042961934,0.0006401004,0.014283525],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988034,0.0002446003,0.00007435766,0.00020009383,0.000538884,0.00013867061],"domain_scores_gemma":[0.99904543,0.00024299348,0.00008736143,0.00029115452,0.00023898657,0.00009393435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010056932,0.00038594048,0.0005706158,0.00050653407,0.00049975124,0.0015730133,0.001224193,0.00044791662,0.004901357],"category_scores_gemma":[0.0024469702,0.00041982255,0.00046131684,0.0010325231,0.000590263,0.0016419346,0.0011532123,0.0011241388,0.0013222345],"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.0007740331,0.00028544132,0.0029742108,0.00079101004,0.00025892403,0.00040207792,0.0004585349,0.15997753,0.086158894,0.26616514,0.026963528,0.45479074],"study_design_scores_gemma":[0.00016458916,0.0002730954,0.0015980211,0.00013609818,0.000087800974,0.0003432024,0.000074238094,0.70041656,0.035802662,0.15324162,0.10778106,0.00008103414],"about_ca_topic_score_codex":0.0010922067,"about_ca_topic_score_gemma":0.0016927498,"teacher_disagreement_score":0.004901357,"about_ca_system_score_codex":0.0006352339,"about_ca_system_score_gemma":0.0009901064,"threshold_uncertainty_score":0.016396642},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022590745,0.0001111553,0.97263676,0.00013657428,0.000020230416,0.00004453904,0.00002355011,0.0014044254,0.0030320925],"genre_scores_gemma":[0.3686314,0.00015446579,0.6285926,0.00009904551,0.000040414652,0.00017072922,0.000109375025,0.00041857472,0.0017833693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981589,0.0006729602,0.0001269662,0.00018887788,0.0006913717,0.00016105216],"domain_scores_gemma":[0.99525344,0.0024051263,0.00040000907,0.001197949,0.0006047101,0.00013868207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024454994,0.00091079605,0.00076760945,0.00073037914,0.0007454143,0.0011312438,0.0016904428,0.0007946687,0.0019050882],"category_scores_gemma":[0.013190831,0.0007425298,0.00070960075,0.000983485,0.0015812545,0.0017609214,0.002363658,0.0013615335,0.0009788885],"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.0002997479,0.00016348394,0.0037830085,0.00014379989,0.00012097472,0.00029172472,0.0006391109,0.7851898,0.018512996,0.05946405,0.0019121257,0.12947926],"study_design_scores_gemma":[0.000015675503,0.000027252867,0.00008874351,0.000005580979,0.0000046633895,0.000033146865,0.000012344827,0.9822657,0.0028731038,0.013830226,0.0008360571,0.000007576318],"about_ca_topic_score_codex":0.0029762688,"about_ca_topic_score_gemma":0.004978434,"teacher_disagreement_score":0.0029762688,"about_ca_system_score_codex":0.00078220456,"about_ca_system_score_gemma":0.0016926401,"threshold_uncertainty_score":0.012933195},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027279614,0.14617449,0.6722485,0.07208109,0.0025183328,0.00009281965,0.00011798764,0.0026427174,0.07684447],"genre_scores_gemma":[0.2350629,0.11348308,0.6089901,0.0070513897,0.0073255124,0.00024510134,0.0003533076,0.0015149205,0.025973767],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9952512,0.0016305483,0.00036574082,0.0004956079,0.0019004727,0.00035651182],"domain_scores_gemma":[0.9855907,0.008978727,0.0006665024,0.0019546861,0.0024846778,0.00032468067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009795538,0.0008880795,0.0011739972,0.0017611384,0.0014049849,0.0048267473,0.0022278605,0.0027765844,0.006655195],"category_scores_gemma":[0.014327155,0.0006131162,0.00099225,0.0033653297,0.0047929627,0.011167537,0.0027491734,0.0033873855,0.0026450155],"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.00014066261,0.00011741397,0.00089142873,0.001042921,0.000030486379,0.00012608254,0.00046728353,0.010147835,0.002072538,0.42819795,0.015780857,0.5409846],"study_design_scores_gemma":[0.000050188184,0.00016401189,0.0008669735,0.00039793248,0.000028486427,0.00058607676,0.0005988802,0.058048368,0.0034743825,0.70218945,0.23350391,0.00009138906],"about_ca_topic_score_codex":0.0008188577,"about_ca_topic_score_gemma":0.00075779506,"teacher_disagreement_score":0.009795538,"about_ca_system_score_codex":0.0013297468,"about_ca_system_score_gemma":0.0015280471,"threshold_uncertainty_score":0.051804364},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99374205,0.00050091266,0.002425768,0.00010371429,0.000034222518,0.000036858364,0.00030955247,0.001545415,0.0013014202],"genre_scores_gemma":[0.98866767,0.00024198517,0.008837352,0.000059368973,0.000026408967,0.000078517936,0.0009833615,0.00047364843,0.0006316923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951858,0.001464272,0.00039163066,0.0008599092,0.0013910212,0.00070746447],"domain_scores_gemma":[0.95766747,0.029934082,0.003566358,0.0043029366,0.0028255605,0.0017036477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003780153,0.0018231735,0.0007096528,0.0014028851,0.00063054747,0.0010217465,0.0016404073,0.0008087091,0.00096504856],"category_scores_gemma":[0.01935823,0.00067557755,0.00070497545,0.0017821573,0.0012646744,0.001743256,0.00095951924,0.0016855651,0.00031418444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.014698794,0.006782839,0.12345371,0.003159646,0.0010158869,0.0012550956,0.0028254064,0.31261638,0.25172988,0.006762589,0.010746439,0.26495332],"study_design_scores_gemma":[0.0004919708,0.010731786,0.0746614,0.00015920294,0.00046673176,0.0005046174,0.0006687033,0.7281715,0.17550421,0.00230181,0.0061853766,0.0001526785],"about_ca_topic_score_codex":0.0031978274,"about_ca_topic_score_gemma":0.0035357922,"teacher_disagreement_score":0.003780153,"about_ca_system_score_codex":0.0011777725,"about_ca_system_score_gemma":0.0010887054,"threshold_uncertainty_score":0.019991636},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088485375,0.004131173,0.5669691,0.0012765293,0.0016891647,0.00048118696,0.0037033677,0.1756704,0.15759371],"genre_scores_gemma":[0.52850705,0.0011618275,0.317795,0.0008423883,0.0002523208,0.0003809887,0.005094389,0.0072496175,0.13871643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982506,0.000015914373,0.0000071054524,0.00002177923,0.00009647204,0.000033681346],"domain_scores_gemma":[0.9997887,0.000036069836,0.00001710893,0.00005217743,0.00006700034,0.000038868384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020968007,0.00068218494,0.0005876259,0.0006338146,0.00045449263,0.0007779908,0.0020040637,0.000584845,0.032266624],"category_scores_gemma":[0.0005056038,0.00044632048,0.00034041298,0.00064816413,0.00028421998,0.0010398062,0.0007568795,0.0009806447,0.008401958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028973608,0.00027692475,0.0012437232,0.0011259541,0.00019683797,0.00048645344,0.00018541011,0.043853734,0.10623006,0.021913737,0.2729479,0.5486419],"study_design_scores_gemma":[0.000697503,0.001540566,0.0032570066,0.00013151403,0.0002523489,0.0011763624,0.00012501056,0.427028,0.20172001,0.020455366,0.34333128,0.0002850084],"about_ca_topic_score_codex":0.0012233153,"about_ca_topic_score_gemma":0.0020077303,"teacher_disagreement_score":0.032266624,"about_ca_system_score_codex":0.0003676924,"about_ca_system_score_gemma":0.00087605434,"threshold_uncertainty_score":0.10794258},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020674659,0.0029050002,0.94671214,0.0041826,0.00073626044,0.00017477332,0.00007958615,0.0034651202,0.021069875],"genre_scores_gemma":[0.1848757,0.0028364437,0.79651463,0.0006602052,0.000376012,0.00024618584,0.00016689365,0.0011066342,0.0132172275],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983816,0.00042776868,0.000101615595,0.00017772512,0.0007999908,0.00011120693],"domain_scores_gemma":[0.99579287,0.0014618617,0.00025818305,0.0013225926,0.00102815,0.00013630837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020022306,0.000607657,0.00054632465,0.0005095692,0.0012258616,0.0020396234,0.0030561904,0.00084108004,0.004944017],"category_scores_gemma":[0.0064235055,0.00062310975,0.0004423715,0.00081028265,0.00083695276,0.0033639465,0.0011910876,0.001997089,0.002720825],"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.0002833286,0.00023215226,0.0024057406,0.0018694947,0.00021289941,0.00046342707,0.0004693571,0.090527974,0.074961774,0.22981066,0.025218457,0.57354474],"study_design_scores_gemma":[0.00014516598,0.0005318701,0.0028580339,0.0004819661,0.00016409022,0.0011559671,0.00035389443,0.39676142,0.095799476,0.09297547,0.40859357,0.00017907478],"about_ca_topic_score_codex":0.0012243727,"about_ca_topic_score_gemma":0.0022051246,"teacher_disagreement_score":0.004944017,"about_ca_system_score_codex":0.0008974343,"about_ca_system_score_gemma":0.0012861406,"threshold_uncertainty_score":0.016539395},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023319082,0.0013095908,0.81097704,0.00046642535,0.00036621597,0.00042442355,0.0011285933,0.13047935,0.03152924],"genre_scores_gemma":[0.19031097,0.00061934517,0.78045416,0.00047418554,0.00013244987,0.0005010896,0.0017249566,0.010060474,0.015722413],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99926466,0.00010367415,0.00006888316,0.00012336585,0.00030970963,0.00012967478],"domain_scores_gemma":[0.9986022,0.0003164529,0.00009271228,0.0005425601,0.0003757122,0.00007034893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054161606,0.00073927664,0.0005401112,0.0007221609,0.00093426264,0.0010350903,0.0014814071,0.0007539396,0.008485557],"category_scores_gemma":[0.0035323447,0.0005243624,0.00059148594,0.0011802516,0.00045815238,0.0010623074,0.0009367151,0.0011859129,0.0041797603],"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.0007051517,0.00018110787,0.0023399692,0.0005958894,0.00009509898,0.0005761236,0.00029365887,0.049938504,0.06950592,0.10535631,0.1327765,0.6376357],"study_design_scores_gemma":[0.00034527705,0.00032354708,0.0021094198,0.0002114698,0.00012517348,0.001100696,0.00008765945,0.5309772,0.12705417,0.060483463,0.2769972,0.00018471146],"about_ca_topic_score_codex":0.005486378,"about_ca_topic_score_gemma":0.0065121804,"teacher_disagreement_score":0.008485557,"about_ca_system_score_codex":0.0009940852,"about_ca_system_score_gemma":0.0021030998,"threshold_uncertainty_score":0.02838701},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15960944,0.0005943866,0.5979769,0.0003821812,0.00025974383,0.0017089008,0.009167451,0.2171847,0.013116271],"genre_scores_gemma":[0.5288074,0.00040400916,0.43454745,0.00033720836,0.00009632653,0.0026538775,0.012897502,0.014139881,0.0061163097],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99549556,0.0015722915,0.00054625404,0.00043537986,0.0017519349,0.0001985686],"domain_scores_gemma":[0.979937,0.012279469,0.0014579756,0.0020352912,0.00403614,0.0002540507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049105594,0.0022157317,0.0010807815,0.0026133521,0.0003322474,0.0012266238,0.0018958568,0.00063315645,0.006093388],"category_scores_gemma":[0.023248367,0.0006979333,0.0005988688,0.0014826872,0.0004236955,0.0019274501,0.0010847042,0.0010986651,0.0014220848],"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.0050432533,0.0018653928,0.013328158,0.0028030155,0.00048013526,0.0003123397,0.000600555,0.1396184,0.07385473,0.0051153605,0.079538636,0.67744005],"study_design_scores_gemma":[0.00086871604,0.002007451,0.009489601,0.0001635777,0.00015135911,0.00020128425,0.00013952234,0.8248158,0.13083877,0.004248175,0.026888086,0.00018756851],"about_ca_topic_score_codex":0.0017005823,"about_ca_topic_score_gemma":0.0015808068,"teacher_disagreement_score":0.006093388,"about_ca_system_score_codex":0.00059816,"about_ca_system_score_gemma":0.0011908199,"threshold_uncertainty_score":0.025969803},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016137189,0.94651484,0.041728348,0.0005794609,0.0008195422,0.00007653728,0.000065686196,0.0002535559,0.008348344],"genre_scores_gemma":[0.011524625,0.932641,0.04906994,0.0004775453,0.0012934755,0.00010850338,0.0002708424,0.0001074268,0.0045065987],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991709,0.0001211812,0.000082246304,0.00013090261,0.00042156738,0.00007326566],"domain_scores_gemma":[0.99876297,0.000602126,0.00012022564,0.00008991218,0.0003669587,0.000057859215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011255195,0.0011944335,0.0011957694,0.0025697115,0.0005291215,0.0010859439,0.0022755112,0.0012392127,0.0033265103],"category_scores_gemma":[0.0022992962,0.0008436582,0.00087332155,0.005493923,0.00048070992,0.0023765652,0.00076874625,0.0013363373,0.0025283596],"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.00006845109,0.00015349135,0.0004610666,0.007879213,0.00008494027,0.00008482314,0.00009079001,0.00644386,0.0035584543,0.014688301,0.01920913,0.9472775],"study_design_scores_gemma":[0.00006463051,0.00039395742,0.0016160287,0.003905177,0.00019064313,0.0012486399,0.00016116869,0.019903786,0.0062961695,0.016843108,0.94927096,0.00010572625],"about_ca_topic_score_codex":0.0016215135,"about_ca_topic_score_gemma":0.0016481283,"teacher_disagreement_score":0.0033265103,"about_ca_system_score_codex":0.0007823842,"about_ca_system_score_gemma":0.0017303613,"threshold_uncertainty_score":0.011128247},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.813261,0.0030587737,0.15285575,0.00070495554,0.00034364898,0.00022055423,0.0002866556,0.014066508,0.015202163],"genre_scores_gemma":[0.8760033,0.00021363865,0.12068763,0.00012558114,0.000035451292,0.0001434198,0.0003436737,0.0005774551,0.0018698977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991322,0.00019500792,0.00008234915,0.00013887748,0.00026472227,0.00018682163],"domain_scores_gemma":[0.99672383,0.0008618828,0.00028263472,0.0011346259,0.0007005284,0.00029645354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008015469,0.00091889856,0.000731333,0.0008680228,0.0012667038,0.0011336327,0.002635889,0.0007894156,0.0026243874],"category_scores_gemma":[0.004792451,0.00049575494,0.0003212466,0.0022510076,0.000795551,0.0013348757,0.0011946349,0.0010348936,0.0007886002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021215198,0.00060420786,0.01208152,0.0005670805,0.00013738671,0.0009267013,0.0006794896,0.5277042,0.1909444,0.01519022,0.02589171,0.22315161],"study_design_scores_gemma":[0.00028034113,0.0004851706,0.0035275293,0.000026352482,0.000074604046,0.00030896635,0.00014148316,0.81547225,0.16002892,0.0053213863,0.014264643,0.000068419926],"about_ca_topic_score_codex":0.0064370167,"about_ca_topic_score_gemma":0.009297763,"teacher_disagreement_score":0.0064370167,"about_ca_system_score_codex":0.0015101905,"about_ca_system_score_gemma":0.0019914631,"threshold_uncertainty_score":0.012799084},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002963329,0.00029466103,0.9574506,0.0004109081,0.00019359964,0.00010535008,0.00024243288,0.030125821,0.008213285],"genre_scores_gemma":[0.12738408,0.0012984903,0.84105,0.0006984328,0.00052843906,0.0009707832,0.0017170062,0.009327294,0.017025443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974131,0.0006593236,0.00028220264,0.00026388429,0.0010524623,0.0003290096],"domain_scores_gemma":[0.99790025,0.0005604226,0.00016452605,0.00096524024,0.00024908123,0.00016040566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021464056,0.0012282032,0.0010943412,0.0013507825,0.0016207373,0.0036973963,0.0036855864,0.0016349023,0.007228437],"category_scores_gemma":[0.005151811,0.0011274848,0.0017628748,0.001797237,0.0017046883,0.0041244896,0.0049669067,0.00477987,0.0045837504],"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.00049912266,0.00017838141,0.0030491136,0.000947401,0.00019715933,0.0012047277,0.001848078,0.033168055,0.02693503,0.6323662,0.077282324,0.22232445],"study_design_scores_gemma":[0.00014405065,0.0001483885,0.0011629199,0.00019777974,0.00014862572,0.0010088715,0.0001928635,0.25733346,0.02933086,0.18511325,0.52506226,0.0001567011],"about_ca_topic_score_codex":0.0020105133,"about_ca_topic_score_gemma":0.0019026471,"teacher_disagreement_score":0.007228437,"about_ca_system_score_codex":0.0010848277,"about_ca_system_score_gemma":0.0016270386,"threshold_uncertainty_score":0.024181545},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003952409,0.00036611408,0.9741917,0.00082284276,0.0001880434,0.00014509515,0.00011836405,0.0020213467,0.018194107],"genre_scores_gemma":[0.10167185,0.001175656,0.867037,0.000891233,0.00020002406,0.0008007092,0.00043352423,0.0011368343,0.026653241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983706,0.00024738058,0.00016866285,0.00030747982,0.0007213865,0.00018458268],"domain_scores_gemma":[0.99888855,0.0003137477,0.00007845765,0.0003412917,0.00024064635,0.00013732712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019076404,0.0005003988,0.00046176146,0.0008107388,0.0012213617,0.0032830033,0.002064174,0.0009313612,0.002432421],"category_scores_gemma":[0.0025283368,0.0008892819,0.0011997324,0.000978317,0.0025400005,0.0046930704,0.002117344,0.0026499727,0.0012389843],"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.00006972748,0.00006939864,0.0003768262,0.0002814137,0.000024733119,0.0003025048,0.001270632,0.008914953,0.0073118843,0.9048537,0.011181082,0.06534323],"study_design_scores_gemma":[0.00011824973,0.0000827523,0.00030182683,0.0002398702,0.00003947513,0.000839506,0.00026449954,0.07008217,0.008498531,0.62981427,0.28963807,0.00008081661],"about_ca_topic_score_codex":0.0038696374,"about_ca_topic_score_gemma":0.0033391693,"teacher_disagreement_score":0.0038696374,"about_ca_system_score_codex":0.0010193965,"about_ca_system_score_gemma":0.0027887074,"threshold_uncertainty_score":0.010088742},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060131135,0.00014738896,0.989856,0.00007304421,0.000052443454,0.000058869366,0.0002405743,0.0012299381,0.0023286229],"genre_scores_gemma":[0.6474326,0.0009462094,0.33848736,0.00022368769,0.00012761676,0.0007922888,0.0013326422,0.0008686425,0.009788935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859756,0.00028370798,0.00011909512,0.00021071367,0.0006654361,0.00012346775],"domain_scores_gemma":[0.9985026,0.0005118142,0.00016553677,0.00038578003,0.00039665803,0.000037652608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089425646,0.0009578235,0.00072372553,0.000671092,0.00032545975,0.0013785214,0.0022200698,0.0010507876,0.0045469534],"category_scores_gemma":[0.0035676078,0.00061044394,0.0009969805,0.0005387515,0.00057623733,0.001846924,0.00053059956,0.00147143,0.0015166799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008637509,0.00003096834,0.0005659765,0.00010544333,0.000029828863,0.00012688992,0.00007872391,0.93489647,0.0060519897,0.041236207,0.0011328954,0.015658256],"study_design_scores_gemma":[0.000008734759,0.000023467588,0.0000462988,0.000007275975,0.000014557342,0.000030390118,0.0000058594937,0.9881017,0.0020998209,0.0061910055,0.0034650879,0.000005728695],"about_ca_topic_score_codex":0.0033404073,"about_ca_topic_score_gemma":0.0026340468,"teacher_disagreement_score":0.0045469534,"about_ca_system_score_codex":0.000827456,"about_ca_system_score_gemma":0.0013084848,"threshold_uncertainty_score":0.015211046},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8205249,0.0009488829,0.13321811,0.0020542347,0.00025338787,0.000183505,0.00034989507,0.016624853,0.025842212],"genre_scores_gemma":[0.9267321,0.00031491416,0.058329716,0.0005984193,0.000074158845,0.00011994872,0.0004223341,0.0031977072,0.010210699],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99833846,0.00081854244,0.000049146514,0.00019024704,0.0003999436,0.00020356933],"domain_scores_gemma":[0.99581236,0.0023212966,0.00015498638,0.0005807111,0.0005490009,0.0005815752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036527852,0.00077710085,0.00045868504,0.0005155445,0.0006270784,0.0023083286,0.0011510958,0.0009076003,0.008546617],"category_scores_gemma":[0.008705161,0.00031961533,0.00078548404,0.00020999339,0.0007496393,0.0020129152,0.0026527643,0.0012915819,0.0016917821],"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.0038486216,0.002616817,0.030762685,0.0011992274,0.00030345112,0.0068952357,0.13289467,0.014543411,0.15873864,0.020353157,0.1254255,0.5024186],"study_design_scores_gemma":[0.0006873207,0.0043960596,0.070045,0.0008728055,0.0004547534,0.012693385,0.030715173,0.16533925,0.08352542,0.016784584,0.6128385,0.0016477916],"about_ca_topic_score_codex":0.001341296,"about_ca_topic_score_gemma":0.0013593846,"teacher_disagreement_score":0.008546617,"about_ca_system_score_codex":0.0004948994,"about_ca_system_score_gemma":0.0003724262,"threshold_uncertainty_score":0.028591275},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74027866,0.0003590754,0.25147918,0.00027062205,0.000051367995,0.0001032329,0.00010953719,0.00178085,0.0055675744],"genre_scores_gemma":[0.92184985,0.00012292742,0.07611776,0.00002825012,0.000020957203,0.00008452385,0.00017885679,0.000114469214,0.0014823627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996984,0.000062392086,0.00001896731,0.000047925532,0.00010072459,0.00007168237],"domain_scores_gemma":[0.9993401,0.00024632397,0.00009217763,0.00012312552,0.000117765616,0.00008039461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040587914,0.00039828368,0.00053764315,0.0003076231,0.0005774048,0.00044305035,0.0009644961,0.00028175538,0.001485298],"category_scores_gemma":[0.0010596097,0.00036081305,0.00028307553,0.0005453871,0.00055918354,0.00074433745,0.0006349494,0.00038903285,0.00029179038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000628327,0.00018010619,0.0021438468,0.00018860014,0.000057841156,0.0004247135,0.00023607191,0.7611101,0.13102262,0.013212272,0.003526661,0.08726877],"study_design_scores_gemma":[0.00006306722,0.00008425029,0.00046588882,0.0000030292279,0.000007668307,0.000020154574,0.000034209064,0.9810111,0.012837151,0.004662618,0.00080514845,0.000005704551],"about_ca_topic_score_codex":0.0028813495,"about_ca_topic_score_gemma":0.005386652,"teacher_disagreement_score":0.0028813495,"about_ca_system_score_codex":0.0007565042,"about_ca_system_score_gemma":0.00097212614,"threshold_uncertainty_score":0.005729139},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4353674,0.00038305196,0.55817544,0.00024099392,0.000061825456,0.00006395406,0.00003120176,0.0006974049,0.0049787667],"genre_scores_gemma":[0.8980174,0.00008352579,0.100647144,0.000031825435,0.000020391406,0.00005648345,0.000029614142,0.00003660543,0.0010770464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968207,0.00011060775,0.000017652605,0.000044716384,0.000082215425,0.00006270298],"domain_scores_gemma":[0.9993043,0.0003639139,0.000062458384,0.00012491432,0.00008030154,0.000064172964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095326145,0.0002492406,0.00034070923,0.0002687361,0.00061604084,0.00077022123,0.0009010298,0.00033258903,0.0008341336],"category_scores_gemma":[0.0014851736,0.0002534283,0.0002876875,0.0002767388,0.00070520997,0.0015612696,0.0007035891,0.0004582954,0.00014656734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001848767,0.00034268698,0.005544973,0.00012365695,0.00007753391,0.00051068095,0.0006350135,0.504635,0.089899085,0.25100812,0.0017435317,0.14363097],"study_design_scores_gemma":[0.000034923432,0.000074645766,0.00014710495,0.0000045061443,0.000010172897,0.000029372599,0.000015726788,0.9640445,0.0077689784,0.026500901,0.0013599464,0.000009320968],"about_ca_topic_score_codex":0.0008463145,"about_ca_topic_score_gemma":0.0013802731,"teacher_disagreement_score":0.00095326145,"about_ca_system_score_codex":0.000553816,"about_ca_system_score_gemma":0.00057672686,"threshold_uncertainty_score":0.005041361},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014315638,0.00031368685,0.9775839,0.00018782723,0.000054125147,0.000040799892,0.000102199294,0.0031650115,0.00423695],"genre_scores_gemma":[0.5134419,0.00082469074,0.47618896,0.00040935364,0.00011978616,0.00020629648,0.00034381732,0.00065757474,0.0078076245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863595,0.00027716742,0.00006246859,0.00019993095,0.0006452349,0.00017924448],"domain_scores_gemma":[0.99800664,0.00088488957,0.0001855882,0.0005677683,0.00030854545,0.000046636378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006784917,0.00073084247,0.00062271435,0.0017093307,0.000690425,0.0014385318,0.0019265127,0.00076695834,0.005351595],"category_scores_gemma":[0.004715707,0.0003562436,0.0007459888,0.0019280583,0.0016387814,0.0027483003,0.0020078602,0.0017836443,0.0010373124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027569354,0.000067856345,0.0013873143,0.00032740866,0.00004662933,0.00022740423,0.00027542442,0.107197605,0.035893243,0.5019257,0.005030014,0.34734574],"study_design_scores_gemma":[0.00004183936,0.00008255408,0.00040380386,0.00005758868,0.00005625496,0.00014346247,0.00006383532,0.6278342,0.035722114,0.32381132,0.011730407,0.00005251346],"about_ca_topic_score_codex":0.0030412916,"about_ca_topic_score_gemma":0.0027105208,"teacher_disagreement_score":0.005351595,"about_ca_system_score_codex":0.0013878451,"about_ca_system_score_gemma":0.0023668073,"threshold_uncertainty_score":0.01790291},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08440283,0.001544446,0.87248653,0.00032912975,0.00051948935,0.00049416523,0.00085918914,0.0073052254,0.032059003],"genre_scores_gemma":[0.7164623,0.00055840425,0.25912532,0.0004121359,0.00015663545,0.00034593994,0.001228627,0.00061895483,0.02109165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999408,0.00007935834,0.000037750775,0.00014156144,0.00020188707,0.00013135189],"domain_scores_gemma":[0.9988746,0.00029066924,0.00009893531,0.00035423815,0.00030300894,0.00007851883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004203229,0.00071220734,0.0005414227,0.00050245185,0.00053250586,0.0010349472,0.0027083547,0.0005231116,0.0132907],"category_scores_gemma":[0.0013240031,0.00042016627,0.00053140376,0.0006370992,0.00038247363,0.0011357762,0.0011227283,0.0005297109,0.0019106151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026037102,0.0005424114,0.004743674,0.00080278586,0.00025372658,0.0005366835,0.00041789538,0.22150962,0.10142663,0.05409809,0.055405166,0.5576596],"study_design_scores_gemma":[0.00021403618,0.0005497048,0.0011816622,0.000027890952,0.00007311797,0.00028624578,0.000063897234,0.888492,0.04777161,0.016555341,0.044723902,0.00006062976],"about_ca_topic_score_codex":0.0019008731,"about_ca_topic_score_gemma":0.004931834,"teacher_disagreement_score":0.0132907,"about_ca_system_score_codex":0.00092871353,"about_ca_system_score_gemma":0.0017565374,"threshold_uncertainty_score":0.044461846},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7866379,0.0059859487,0.1354286,0.0031127483,0.0008009694,0.00013569604,0.0004252371,0.005245657,0.062227387],"genre_scores_gemma":[0.96530783,0.00076473656,0.028357267,0.00044090583,0.00006562442,0.00006788906,0.00017353131,0.0007466106,0.004075627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989139,0.00024023214,0.000070458926,0.00016611617,0.00042023804,0.00018901823],"domain_scores_gemma":[0.9947665,0.0031029638,0.00037183915,0.00067822775,0.0008422379,0.00023830317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00099124,0.0008911505,0.000522688,0.00085239526,0.0006536059,0.0015236753,0.0013867967,0.0011515256,0.0075136954],"category_scores_gemma":[0.010600588,0.000657549,0.00042499095,0.00097363786,0.00080624147,0.0032876423,0.0014661617,0.0013205531,0.00105599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034111256,0.0004203404,0.013933261,0.0013493792,0.0002672998,0.0015490662,0.0010871625,0.4268595,0.19395149,0.062257636,0.021406798,0.2735069],"study_design_scores_gemma":[0.0003734425,0.002235655,0.0074464967,0.00025584508,0.00031698222,0.00106747,0.0005224269,0.63250667,0.26836398,0.046944477,0.039820436,0.00014622042],"about_ca_topic_score_codex":0.0017872798,"about_ca_topic_score_gemma":0.0019289595,"teacher_disagreement_score":0.0075136954,"about_ca_system_score_codex":0.0009782703,"about_ca_system_score_gemma":0.00055521127,"threshold_uncertainty_score":0.025135815},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002712759,0.0007816789,0.98625433,0.00026283663,0.0000839133,0.00003629264,0.000029300394,0.00020997069,0.00962896],"genre_scores_gemma":[0.5612528,0.0045435205,0.42003727,0.00062740984,0.0007301871,0.00059096166,0.0001662897,0.00033844073,0.011713094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991978,0.00019468271,0.000024804318,0.000114352704,0.0003797211,0.00008866189],"domain_scores_gemma":[0.99887866,0.00067883777,0.000085810796,0.000109177214,0.00019269445,0.00005485463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010642197,0.00074978394,0.0005904698,0.0008938837,0.00062870194,0.0013999756,0.0018375892,0.0009883534,0.0053599956],"category_scores_gemma":[0.003557316,0.00043019032,0.0004958714,0.00095889275,0.0018953363,0.002115807,0.0013549416,0.0012667973,0.0008629021],"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.00006275956,0.000070801776,0.00016831889,0.00020592468,0.000015293159,0.00007355453,0.00013591885,0.363642,0.002758072,0.57957935,0.003157551,0.050130345],"study_design_scores_gemma":[0.000015980357,0.000041337345,0.000032997104,0.000025831787,0.0000063181024,0.000033115255,0.000023317609,0.83045197,0.00080626324,0.16168806,0.006863905,0.000010851723],"about_ca_topic_score_codex":0.0017724052,"about_ca_topic_score_gemma":0.0012175222,"teacher_disagreement_score":0.0053599956,"about_ca_system_score_codex":0.0016988227,"about_ca_system_score_gemma":0.0013368706,"threshold_uncertainty_score":0.017930984},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005209556,0.00011479614,0.9841808,0.00006224221,0.000026516764,0.00007046398,0.00004566053,0.009445323,0.00084463006],"genre_scores_gemma":[0.22736602,0.00024101308,0.7669677,0.00013596348,0.00006349186,0.00034142786,0.00027878987,0.0013865207,0.0032191395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983523,0.00026312456,0.00009608936,0.00027247096,0.00081640366,0.00019966175],"domain_scores_gemma":[0.998161,0.0004926613,0.00023953106,0.00071498565,0.00025864135,0.00013307713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001213834,0.00094090396,0.0007403966,0.0009674809,0.00071644055,0.0013550107,0.0032258308,0.0009885272,0.0025078347],"category_scores_gemma":[0.003145849,0.00067755644,0.0008599045,0.00061187806,0.0011967067,0.0025337539,0.002471853,0.0018684685,0.00081036834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005752453,0.00040331538,0.0054986384,0.0006097564,0.00018682037,0.0005075336,0.0009179394,0.16657948,0.12224219,0.16320632,0.017041292,0.52223146],"study_design_scores_gemma":[0.000086243046,0.00027191683,0.0010974908,0.00007099289,0.000078488345,0.00048262737,0.00006704391,0.8603506,0.062628195,0.027930032,0.04679805,0.00013826463],"about_ca_topic_score_codex":0.0018211674,"about_ca_topic_score_gemma":0.0022086021,"teacher_disagreement_score":0.0032258308,"about_ca_system_score_codex":0.0008768573,"about_ca_system_score_gemma":0.002182352,"threshold_uncertainty_score":0.008389533},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5159261,0.01435711,0.4158974,0.0012989858,0.0003359148,0.0002000554,0.00036608454,0.0050179157,0.046600413],"genre_scores_gemma":[0.9157704,0.001895346,0.07599844,0.00017031546,0.000056956767,0.000032874825,0.00016592658,0.000086111875,0.0058235554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998522,0.00003060774,0.000007750459,0.000020137277,0.000065711174,0.00002363264],"domain_scores_gemma":[0.9998273,0.00004862166,0.000017212207,0.000043652977,0.000052538566,0.000010730748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017090733,0.0002501264,0.0001524155,0.00020851337,0.00024889057,0.0005041747,0.00052602036,0.00032838166,0.002512908],"category_scores_gemma":[0.00064324465,0.000085189415,0.000095557596,0.0004414107,0.00015782795,0.00085741654,0.00042418914,0.00023387544,0.00054916606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059419725,0.00012587574,0.0051523554,0.00050485553,0.000042398453,0.00057199335,0.00020945954,0.04260113,0.3691479,0.021755168,0.009055728,0.5502389],"study_design_scores_gemma":[0.000091062364,0.0014110588,0.005383605,0.00008124769,0.00011558565,0.0016362857,0.00024464607,0.15998544,0.6618766,0.011109569,0.158018,0.00004689626],"about_ca_topic_score_codex":0.00047915496,"about_ca_topic_score_gemma":0.0009488473,"teacher_disagreement_score":0.002512908,"about_ca_system_score_codex":0.00020540174,"about_ca_system_score_gemma":0.00024504453,"threshold_uncertainty_score":0.00840652},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08352246,0.0011025097,0.91068774,0.00026630555,0.000201261,0.00010637841,0.000029413546,0.0013813397,0.0027026164],"genre_scores_gemma":[0.5505185,0.00033767367,0.4475054,0.000102689446,0.00006495829,0.000050809762,0.000066449415,0.00010159999,0.0012519499],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891865,0.00024665793,0.00011932843,0.0001656133,0.0004466198,0.0001031664],"domain_scores_gemma":[0.9977302,0.000822853,0.00025728886,0.00038658344,0.0006123202,0.00019079649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013181448,0.0005380474,0.0006227274,0.0008812136,0.00048548914,0.0010618141,0.0019946329,0.0003978365,0.0007863891],"category_scores_gemma":[0.0043087103,0.0002611953,0.00033332262,0.0008881011,0.00045561374,0.0009614116,0.00057919533,0.0008318753,0.00017723252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008374104,0.0005219564,0.0054877354,0.000297777,0.00012016382,0.00016782591,0.00022889128,0.16968405,0.07726977,0.01894928,0.0027132472,0.7237218],"study_design_scores_gemma":[0.00011986116,0.0003401455,0.0009373169,0.00002138221,0.000050514984,0.0002615306,0.000054872624,0.9407394,0.04344471,0.007125226,0.006879157,0.000025915864],"about_ca_topic_score_codex":0.0021208036,"about_ca_topic_score_gemma":0.002272455,"teacher_disagreement_score":0.0021208036,"about_ca_system_score_codex":0.0010639055,"about_ca_system_score_gemma":0.001639635,"threshold_uncertainty_score":0.007719159},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2429494,0.0060304375,0.71525896,0.001083867,0.00054946647,0.00025466882,0.0007226514,0.012149583,0.021000994],"genre_scores_gemma":[0.843128,0.0005826571,0.14622329,0.0004957914,0.00011354953,0.00010580691,0.00051887805,0.00008925278,0.008742642],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997832,0.00002724669,0.0000177316,0.00004988074,0.00009602594,0.000025811682],"domain_scores_gemma":[0.99946827,0.000093268936,0.00006818582,0.00014976416,0.00018604886,0.000034503486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002049508,0.0002186824,0.00031352017,0.0005275126,0.0006346445,0.0006857799,0.0015558781,0.0005603902,0.0023928497],"category_scores_gemma":[0.00064818637,0.00012561474,0.00022018547,0.0006734812,0.00027227143,0.00093162974,0.00041052458,0.00037587943,0.0004862633],"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.0012543485,0.0003621637,0.0045601362,0.000631989,0.00021861677,0.0010360383,0.00018945326,0.080896825,0.22064464,0.060148757,0.028479373,0.6015777],"study_design_scores_gemma":[0.0003146589,0.001289896,0.0020550063,0.000067680274,0.00027809336,0.0016708948,0.00005347735,0.62254816,0.26533547,0.015704982,0.09060097,0.00008076517],"about_ca_topic_score_codex":0.00088411843,"about_ca_topic_score_gemma":0.0011952382,"teacher_disagreement_score":0.0023928497,"about_ca_system_score_codex":0.00037460309,"about_ca_system_score_gemma":0.00060877757,"threshold_uncertainty_score":0.008004904},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35931587,0.0007143648,0.6330477,0.00024518804,0.00002808205,0.00006270857,0.000247572,0.0013881895,0.0049502878],"genre_scores_gemma":[0.97210807,0.00025933757,0.026323922,0.000021344662,0.000007001566,0.000051982443,0.00016595291,0.000069154994,0.0009933738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994381,0.00010324712,0.00003079794,0.00010286921,0.00025305213,0.000071903516],"domain_scores_gemma":[0.99910754,0.0004432622,0.00012937131,0.00017905705,0.00011825743,0.000022491226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004970211,0.0008160993,0.00055468583,0.00087653194,0.0002701364,0.0010473327,0.00083420036,0.0007187202,0.0007922764],"category_scores_gemma":[0.0045468174,0.00043989136,0.00044098802,0.00071465806,0.00042156142,0.0017065728,0.0005094849,0.00054205913,0.00038959607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008402067,0.00003479295,0.002740705,0.000040555376,0.00002004394,0.000025743706,0.000028683295,0.9579491,0.011810994,0.0049046143,0.00023858118,0.022122161],"study_design_scores_gemma":[0.0000017518578,0.000024646242,0.000746151,0.000004346289,0.0000040401487,0.000014858703,0.000006654857,0.9895074,0.0072702295,0.0021456876,0.00026773164,0.000006524777],"about_ca_topic_score_codex":0.0027562957,"about_ca_topic_score_gemma":0.0017771486,"teacher_disagreement_score":0.0027562957,"about_ca_system_score_codex":0.00091022515,"about_ca_system_score_gemma":0.00063097064,"threshold_uncertainty_score":0.006604135},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9820517,0.0005144885,0.015288983,0.0002351617,0.00002339804,0.000024504174,0.00008172235,0.0004467778,0.0013333145],"genre_scores_gemma":[0.9918258,0.00008563806,0.007813602,0.000033850116,0.0000114028235,0.00001538189,0.00005411462,0.000021960452,0.00013836836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831045,0.00063365535,0.00010598133,0.00028520531,0.00046731462,0.00019734485],"domain_scores_gemma":[0.9910734,0.005207664,0.0008796653,0.0017175934,0.0009182259,0.00020340158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013562564,0.00065795775,0.00033420944,0.00058373675,0.0003311378,0.0006442923,0.0011040369,0.0010868266,0.00054680026],"category_scores_gemma":[0.0101697445,0.00031655672,0.00018914178,0.0012863385,0.00038556155,0.0019840186,0.00043543734,0.00059767446,0.00015645724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0044779303,0.0010778087,0.043969918,0.000279817,0.00027005275,0.00031047894,0.00017959462,0.55194074,0.26528093,0.0035982453,0.0017816208,0.12683296],"study_design_scores_gemma":[0.00021227225,0.003347087,0.014851774,0.000022490905,0.0002071492,0.0004012358,0.00015831673,0.7710079,0.20556438,0.0024443283,0.0016813542,0.000101760015],"about_ca_topic_score_codex":0.0011235292,"about_ca_topic_score_gemma":0.0011546969,"teacher_disagreement_score":0.0013562564,"about_ca_system_score_codex":0.0005402059,"about_ca_system_score_gemma":0.00045872398,"threshold_uncertainty_score":0.007172644},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022579247,0.0001268105,0.9487159,0.00027216243,0.00011968029,0.00007466209,0.000068426096,0.014948613,0.013094369],"genre_scores_gemma":[0.3123957,0.00028492676,0.6772861,0.00023586008,0.00008680854,0.00022535522,0.00029733105,0.0028546052,0.006333388],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924195,0.0002107055,0.000043153945,0.00008231415,0.00033753176,0.00008431698],"domain_scores_gemma":[0.99826294,0.0008862385,0.000062558276,0.00048475934,0.00026145918,0.00004207533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010695134,0.0007120069,0.000466295,0.0004017324,0.0007621614,0.00097207516,0.0013425485,0.00056957826,0.005500826],"category_scores_gemma":[0.0043634656,0.0004569057,0.0005192915,0.00050081324,0.00051109685,0.0011634456,0.0009831121,0.0012543519,0.0017120187],"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.00041202529,0.00030152523,0.0058533526,0.00062663294,0.00020339138,0.00047539786,0.00052674144,0.39093915,0.08738267,0.06794431,0.008948444,0.43638638],"study_design_scores_gemma":[0.00008275705,0.00012277246,0.00071069214,0.000039475777,0.00005533577,0.00010462878,0.000067357985,0.85717833,0.07548375,0.027376404,0.038734816,0.000043673954],"about_ca_topic_score_codex":0.0025772501,"about_ca_topic_score_gemma":0.0028475933,"teacher_disagreement_score":0.005500826,"about_ca_system_score_codex":0.0005408463,"about_ca_system_score_gemma":0.0011516063,"threshold_uncertainty_score":0.0184021},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65121686,0.001440328,0.33323798,0.0005235052,0.00009226397,0.000080698715,0.00009267129,0.0068484126,0.00646729],"genre_scores_gemma":[0.8337193,0.00030185273,0.16267627,0.00021489896,0.000041913718,0.00009192837,0.0002869182,0.00095302064,0.0017138511],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988105,0.00024265735,0.0000848692,0.0001667303,0.0004987764,0.00019646343],"domain_scores_gemma":[0.996653,0.0013565872,0.0004240004,0.0007456495,0.0006608839,0.00015985081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007999601,0.0009883723,0.00078457437,0.00088640733,0.00068590825,0.0010129126,0.0014792904,0.00067625614,0.0010696988],"category_scores_gemma":[0.006126351,0.0003866551,0.0005109819,0.0012578178,0.0007947391,0.00143826,0.001318325,0.0012267546,0.0003863841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008384581,0.00049791444,0.018673737,0.00035088198,0.000108855835,0.00035948286,0.0004604526,0.33169767,0.24161272,0.014794244,0.005055631,0.38554993],"study_design_scores_gemma":[0.00014270555,0.00045271704,0.0034239846,0.00002935449,0.00006831564,0.00026313035,0.00007828984,0.8382975,0.13688369,0.013396087,0.0069223875,0.000041905652],"about_ca_topic_score_codex":0.002150188,"about_ca_topic_score_gemma":0.0034983067,"teacher_disagreement_score":0.002150188,"about_ca_system_score_codex":0.0009608727,"about_ca_system_score_gemma":0.001678205,"threshold_uncertainty_score":0.0069716573},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17439318,0.001487117,0.7466582,0.00055267615,0.00040984034,0.00015516684,0.00024310366,0.010741474,0.065359235],"genre_scores_gemma":[0.639833,0.00089649943,0.3056392,0.00034010105,0.00012546603,0.00012349743,0.0004395987,0.00035612145,0.05224658],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997726,0.000033752764,0.000017333059,0.00004046949,0.00009853261,0.00003737259],"domain_scores_gemma":[0.9997359,0.000067292516,0.000036217076,0.000058918686,0.00006412872,0.00003757528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018257121,0.00034209425,0.00023189152,0.00037837666,0.00021397384,0.0009028182,0.0006793387,0.00024206708,0.009355727],"category_scores_gemma":[0.00046349785,0.0002876291,0.00020722965,0.00046985128,0.00028262168,0.00088844093,0.0006117212,0.0005686033,0.0021667185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009298577,0.00011680153,0.0018151191,0.00050241925,0.000076747725,0.0004795247,0.00022140043,0.083863966,0.3129582,0.08038052,0.016324492,0.5023309],"study_design_scores_gemma":[0.00025736363,0.0012137009,0.002158983,0.000096757336,0.00010015047,0.00080195523,0.000102826176,0.65539515,0.16386682,0.02920923,0.14672348,0.00007367609],"about_ca_topic_score_codex":0.00085314526,"about_ca_topic_score_gemma":0.0015228384,"teacher_disagreement_score":0.009355727,"about_ca_system_score_codex":0.000362708,"about_ca_system_score_gemma":0.0006934911,"threshold_uncertainty_score":0.03129804},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004189128,0.000111865615,0.8578991,0.00017292082,0.00014364131,0.00018755399,0.003224916,0.13329363,0.0045475005],"genre_scores_gemma":[0.011821078,0.0005234999,0.8636297,0.0005574966,0.00018940702,0.0018617802,0.018033354,0.09298032,0.010403293],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976254,0.00048245664,0.00034480277,0.0002778127,0.0010343733,0.00023508594],"domain_scores_gemma":[0.99538594,0.0020495765,0.00028845022,0.001263217,0.0007636449,0.00024913173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038168775,0.0021396372,0.0013396938,0.0021922397,0.000880506,0.0034585309,0.007215381,0.0027153085,0.045678042],"category_scores_gemma":[0.012046916,0.0024092235,0.002417204,0.0025097139,0.0011508184,0.0036321436,0.003638726,0.005208535,0.038608152],"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.0003249632,0.00022090682,0.0012755732,0.0013478353,0.00015748621,0.00085853564,0.0004196443,0.02308215,0.008911078,0.084888496,0.62375075,0.2547626],"study_design_scores_gemma":[0.00037944148,0.00009716281,0.0009267919,0.00043983504,0.000059801903,0.0012165273,0.00006731459,0.12952015,0.023196068,0.10672853,0.73715687,0.00021143322],"about_ca_topic_score_codex":0.002636201,"about_ca_topic_score_gemma":0.0020334588,"teacher_disagreement_score":0.045678042,"about_ca_system_score_codex":0.00087375724,"about_ca_system_score_gemma":0.0025691728,"threshold_uncertainty_score":0.15280831},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065535554,0.000020765998,0.9879752,0.00009048651,0.000019390367,0.00012759631,0.000042746306,0.0027041887,0.002466092],"genre_scores_gemma":[0.071331084,0.00009730707,0.9212789,0.00013145209,0.000009840776,0.0005608909,0.00031719328,0.0019265875,0.0043468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881685,0.00034171436,0.000104378625,0.00016787487,0.00047058373,0.00009866738],"domain_scores_gemma":[0.99634993,0.0014670751,0.0002456059,0.0011598587,0.0006705747,0.00010693309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018019591,0.0009829253,0.00030641278,0.00068572786,0.000498021,0.0012865639,0.0014893691,0.00082721916,0.0030335349],"category_scores_gemma":[0.0073036146,0.00065240724,0.00084487465,0.0005812725,0.0012397221,0.0014779388,0.0014932296,0.0012759854,0.0012250183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030829312,0.00045750977,0.006617642,0.0011570748,0.00015003815,0.001507407,0.0039541153,0.12164993,0.078220665,0.28621417,0.020795587,0.4789676],"study_design_scores_gemma":[0.00029916287,0.000362488,0.0012190077,0.00019557466,0.00014286568,0.0016818856,0.00045495114,0.5100917,0.13792014,0.15653901,0.19097742,0.00011587005],"about_ca_topic_score_codex":0.00093525485,"about_ca_topic_score_gemma":0.0014402891,"teacher_disagreement_score":0.0030335349,"about_ca_system_score_codex":0.00055631844,"about_ca_system_score_gemma":0.0011752045,"threshold_uncertainty_score":0.010148227},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052918773,0.0010120617,0.93914497,0.000235437,0.000080825565,0.000034467525,0.00006771984,0.00073430536,0.0057714535],"genre_scores_gemma":[0.57686746,0.0011822515,0.41533145,0.00010538765,0.000086642154,0.00009278431,0.00022698264,0.000112007,0.005995117],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998702,0.00003105978,0.0000084115745,0.000024505905,0.00004539256,0.000020323125],"domain_scores_gemma":[0.9998536,0.000053405874,0.000025117104,0.000029003586,0.000031253196,0.0000075606495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026098097,0.0003966111,0.00021627912,0.00042737022,0.00030808008,0.00036506064,0.00044277462,0.00035158035,0.002048431],"category_scores_gemma":[0.00074525486,0.00016909219,0.00026550682,0.00057307945,0.00029579576,0.000863533,0.00036927866,0.00033043613,0.00043123175],"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.0002163781,0.000058314938,0.0005949587,0.0003042993,0.000060025068,0.00023296042,0.0001474713,0.26001486,0.10876606,0.20822527,0.005303877,0.4160755],"study_design_scores_gemma":[0.000033611053,0.00016312975,0.00035699012,0.000028750925,0.0000404499,0.00019086739,0.000019567311,0.87836576,0.03239532,0.06682293,0.021559821,0.000022849445],"about_ca_topic_score_codex":0.00055897626,"about_ca_topic_score_gemma":0.0014140981,"teacher_disagreement_score":0.002048431,"about_ca_system_score_codex":0.00054927263,"about_ca_system_score_gemma":0.00033402818,"threshold_uncertainty_score":0.0068526864},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14118063,0.000529737,0.84142303,0.00023193777,0.000111201145,0.00017688482,0.00008692161,0.0065810066,0.009678643],"genre_scores_gemma":[0.74300706,0.000226976,0.24775074,0.00036038697,0.000090656504,0.00012582424,0.00018967756,0.00015426427,0.008094245],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99951196,0.000065342116,0.000028676965,0.00012279417,0.00022055804,0.000050631053],"domain_scores_gemma":[0.9996954,0.000044189987,0.000028759827,0.00009545747,0.000084489206,0.00005175441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025054027,0.0003536413,0.00047290805,0.00029626905,0.00041731022,0.0008303263,0.0011512132,0.000368816,0.0032298337],"category_scores_gemma":[0.00039383097,0.0003820975,0.00028070726,0.00036080444,0.00034357683,0.0007334425,0.001288526,0.00056044734,0.0012153815],"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.0014947772,0.0004997674,0.0060298606,0.00046768665,0.00029239003,0.0010385674,0.0005458102,0.11983559,0.51111513,0.021259718,0.006987454,0.3304332],"study_design_scores_gemma":[0.00014172721,0.0010114082,0.001753898,0.000026321595,0.00013692558,0.0005679858,0.00007995059,0.836521,0.13089995,0.005319406,0.023475915,0.00006545683],"about_ca_topic_score_codex":0.00085221906,"about_ca_topic_score_gemma":0.0010204463,"teacher_disagreement_score":0.0032298337,"about_ca_system_score_codex":0.000317127,"about_ca_system_score_gemma":0.0005119128,"threshold_uncertainty_score":0.010804832},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041393045,0.00021312389,0.95590377,0.00005530457,0.000015886937,0.000030011734,0.000069781905,0.0015285934,0.0007905904],"genre_scores_gemma":[0.74282634,0.00019600487,0.25521302,0.00004315275,0.000027879634,0.00010648046,0.00023816022,0.00015904642,0.0011898301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913186,0.00019671414,0.00003998915,0.00012759579,0.00044839465,0.000055433884],"domain_scores_gemma":[0.9978338,0.0012470215,0.00026922167,0.00027316963,0.00034242566,0.000034439836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057443976,0.00075033115,0.00073897163,0.0011891111,0.0003362808,0.00057981507,0.0009029218,0.0004050416,0.0016230443],"category_scores_gemma":[0.0042888313,0.00042632408,0.00030821285,0.0010911849,0.00031315812,0.0013410833,0.00059308123,0.000505976,0.0005746166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040280548,0.00011826331,0.005337645,0.00014378,0.00007252757,0.000109864,0.00007058499,0.53562397,0.043265507,0.010056369,0.0021551382,0.40264362],"study_design_scores_gemma":[0.000006057567,0.000021508327,0.00062567735,0.0000026913817,0.0000044700855,0.000030514357,0.0000035160936,0.98839766,0.008155846,0.0023716087,0.00037407925,0.000006354921],"about_ca_topic_score_codex":0.0014652838,"about_ca_topic_score_gemma":0.0024081764,"teacher_disagreement_score":0.0016230443,"about_ca_system_score_codex":0.0007076946,"about_ca_system_score_gemma":0.000751379,"threshold_uncertainty_score":0.005429566},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58472526,0.0043144217,0.39157012,0.00071320776,0.000032587683,0.00007608179,0.00028216495,0.00043332184,0.017852787],"genre_scores_gemma":[0.96093005,0.00069246354,0.036818452,0.000039279024,0.000024891071,0.00006314517,0.0001260101,0.0001092523,0.00119652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897134,0.00034700247,0.00004224975,0.00010705168,0.0004293742,0.00010286806],"domain_scores_gemma":[0.99450123,0.0044132485,0.0004308447,0.0002698579,0.0003413852,0.00004334985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016662468,0.00089564675,0.00042541776,0.0008547483,0.00027196706,0.0007459021,0.0005971239,0.00054174947,0.0027077082],"category_scores_gemma":[0.008469989,0.00040371585,0.00045304556,0.0011447427,0.00068287534,0.0024361971,0.0003347726,0.0006662716,0.00023529549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022155413,0.00009413482,0.0028708484,0.0002973965,0.00005142435,0.00009250815,0.00007585639,0.8960079,0.024835655,0.017616231,0.00054304197,0.05729341],"study_design_scores_gemma":[0.000024762658,0.0003872911,0.0027519814,0.000023406434,0.00003372803,0.00015899033,0.00006174995,0.97234476,0.013192432,0.009327619,0.001672441,0.000020829153],"about_ca_topic_score_codex":0.00044654135,"about_ca_topic_score_gemma":0.0008486758,"teacher_disagreement_score":0.0027077082,"about_ca_system_score_codex":0.00068987446,"about_ca_system_score_gemma":0.00037182294,"threshold_uncertainty_score":0.009058237},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4915479,0.0015364386,0.47724617,0.0030202742,0.00027950836,0.00024893618,0.00009008664,0.0061746645,0.019856075],"genre_scores_gemma":[0.5785492,0.0010690958,0.41014004,0.00056706823,0.00007896539,0.00008455784,0.00016383885,0.0030105666,0.0063366485],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99418455,0.002556021,0.00030265108,0.00061076076,0.0016031787,0.00074276887],"domain_scores_gemma":[0.9868384,0.007004314,0.0005660783,0.0030117282,0.0017659632,0.00081345864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0086825015,0.00052799826,0.00049443357,0.00045454552,0.0013530873,0.0025009066,0.002130197,0.00086739776,0.0017354484],"category_scores_gemma":[0.016705627,0.00085393625,0.00054751086,0.00073695934,0.0019895032,0.0051019117,0.0018825918,0.0029617315,0.0005953778],"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.0014513372,0.0020673408,0.019015998,0.0007869988,0.00015803223,0.0019460305,0.038069174,0.045206074,0.12325817,0.047791407,0.015130727,0.7051186],"study_design_scores_gemma":[0.00060680334,0.0040048584,0.017555177,0.00056234276,0.00034510787,0.0058713057,0.007896073,0.19891134,0.37925634,0.03782038,0.34650257,0.0006676457],"about_ca_topic_score_codex":0.002821267,"about_ca_topic_score_gemma":0.0041722925,"teacher_disagreement_score":0.0086825015,"about_ca_system_score_codex":0.0011284465,"about_ca_system_score_gemma":0.0019755212,"threshold_uncertainty_score":0.045918047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47519374,0.0006562058,0.5018408,0.0013162819,0.00006427711,0.00015073603,0.00016249128,0.0048764036,0.015739031],"genre_scores_gemma":[0.9381424,0.00014123303,0.060267005,0.00007081915,0.000024722589,0.00008778605,0.00010658288,0.00029598054,0.0008633263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838424,0.0006966133,0.000072788476,0.0002457764,0.00044894798,0.00015161483],"domain_scores_gemma":[0.99004096,0.006640186,0.000422893,0.0020592536,0.00067331374,0.00016347595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026384625,0.0008077029,0.00058014673,0.00068015466,0.0009008225,0.0012086355,0.0014392684,0.00058477226,0.003270692],"category_scores_gemma":[0.015239194,0.0004749274,0.0003492887,0.0009939295,0.0013358429,0.0032542928,0.0011857491,0.0010436807,0.00041972927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005700628,0.00023446477,0.0044882228,0.00010052221,0.000053217056,0.00018071716,0.0003699919,0.858299,0.036530416,0.020867202,0.0014587302,0.076847404],"study_design_scores_gemma":[0.00002487606,0.000032815835,0.0003156691,0.000005113896,0.000008320248,0.000027890626,0.000028103746,0.9867533,0.006912005,0.005432528,0.0004519055,0.000007461886],"about_ca_topic_score_codex":0.003921907,"about_ca_topic_score_gemma":0.0040835273,"teacher_disagreement_score":0.003921907,"about_ca_system_score_codex":0.0012301925,"about_ca_system_score_gemma":0.0012010941,"threshold_uncertainty_score":0.013953686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14346425,0.013181864,0.74159384,0.0453859,0.0024483588,0.00036679022,0.0000962915,0.0012398346,0.05222285],"genre_scores_gemma":[0.872569,0.0017744175,0.114002064,0.0028914285,0.0014878816,0.0002823701,0.0000324423,0.00022137628,0.0067390543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927193,0.0022851578,0.00037246195,0.0009102812,0.0027054232,0.0010074078],"domain_scores_gemma":[0.97996014,0.010054365,0.0019285573,0.0044773663,0.002385112,0.0011944397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008131594,0.0009124615,0.0011513825,0.0007546465,0.0030950014,0.004816079,0.003306482,0.003590401,0.0031597551],"category_scores_gemma":[0.03135961,0.0008005732,0.0007207075,0.001066981,0.0038104788,0.011299734,0.0038684816,0.0052065914,0.0006494026],"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.00046112784,0.00028209906,0.005374839,0.00046929563,0.00014220808,0.0012481457,0.0013327559,0.11534979,0.009899404,0.7569027,0.0136858355,0.09485186],"study_design_scores_gemma":[0.00015729354,0.00024417086,0.0015825011,0.0001741996,0.0000779485,0.00068725937,0.00040620466,0.56327355,0.0059946342,0.38867337,0.03862322,0.00010562787],"about_ca_topic_score_codex":0.002320686,"about_ca_topic_score_gemma":0.0021019552,"teacher_disagreement_score":0.008131594,"about_ca_system_score_codex":0.0025066375,"about_ca_system_score_gemma":0.0018889434,"threshold_uncertainty_score":0.043004513},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15987086,0.00040481874,0.67161655,0.00032630973,0.0003717409,0.0006258431,0.00076989346,0.0090223355,0.15699168],"genre_scores_gemma":[0.9154663,0.00017302339,0.068215095,0.00012791388,0.000056128883,0.00017243582,0.00042840693,0.00009836637,0.01526231],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996973,0.000065131426,0.00002457297,0.00006909487,0.000098447796,0.000045537883],"domain_scores_gemma":[0.9995704,0.000032544147,0.000026308018,0.00023532222,0.000098165125,0.000037160557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015164183,0.00026097326,0.00025252573,0.0005043292,0.00045609847,0.00059624296,0.0006984433,0.00034813877,0.008690311],"category_scores_gemma":[0.00045733814,0.00012778415,0.00013822943,0.00075837364,0.00043732504,0.00045327534,0.0005448524,0.00051810243,0.002277476],"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.0010229454,0.0002555864,0.003345279,0.00029008172,0.00006657604,0.00030336503,0.00039449005,0.05850791,0.19351459,0.1201447,0.019491676,0.6026628],"study_design_scores_gemma":[0.0007362009,0.0017062413,0.0107607525,0.00009745397,0.00026981113,0.0026712958,0.00021740286,0.3848916,0.24712677,0.048371542,0.30297953,0.00017136619],"about_ca_topic_score_codex":0.000942268,"about_ca_topic_score_gemma":0.001268965,"teacher_disagreement_score":0.008690311,"about_ca_system_score_codex":0.00055765227,"about_ca_system_score_gemma":0.0004819246,"threshold_uncertainty_score":0.029071927},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06870551,0.0009476695,0.9174234,0.00029129608,0.00029581788,0.00013033196,0.00010424697,0.0014657908,0.01063593],"genre_scores_gemma":[0.74421924,0.00026740567,0.24994351,0.00014053308,0.0000839592,0.00007274522,0.00020524186,0.00017555666,0.004891801],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991967,0.0001999843,0.00005671552,0.00010625745,0.00029941252,0.00014088927],"domain_scores_gemma":[0.99880207,0.0003896327,0.00011562494,0.0002467936,0.00028759748,0.00015834863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007379636,0.0004658407,0.00053780025,0.0006849803,0.0005713282,0.0010127757,0.0013627717,0.0003282552,0.0033995563],"category_scores_gemma":[0.0027220335,0.00019443105,0.00032992775,0.0007670428,0.000376665,0.00080931117,0.00064044213,0.0006078702,0.0004021418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010634594,0.0003245721,0.002612947,0.00020384594,0.000051876592,0.0002148874,0.00020141073,0.17954768,0.022927226,0.0411387,0.009255008,0.74245834],"study_design_scores_gemma":[0.000116900104,0.00025497365,0.0006287813,0.000019445297,0.000021928001,0.00026262048,0.00006646839,0.96290654,0.011847335,0.013579546,0.010277154,0.000018308605],"about_ca_topic_score_codex":0.0031438952,"about_ca_topic_score_gemma":0.0035961475,"teacher_disagreement_score":0.0033995563,"about_ca_system_score_codex":0.00097132067,"about_ca_system_score_gemma":0.0019378692,"threshold_uncertainty_score":0.011372626},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2933384,0.0017840519,0.6504238,0.0006151954,0.0002983707,0.0013725805,0.0005276724,0.019359214,0.032280724],"genre_scores_gemma":[0.6961058,0.00044505895,0.28883448,0.00015913713,0.000031843698,0.00046986347,0.0004515264,0.00031085,0.0131914355],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997156,0.00008328769,0.000018476798,0.000036512643,0.00010233869,0.00004374428],"domain_scores_gemma":[0.99953234,0.000094074465,0.000023906736,0.00010674765,0.00021554201,0.000027406331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003872468,0.0003161393,0.0003181087,0.00015689556,0.00017493589,0.00053493143,0.0016242579,0.00060816,0.0065359385],"category_scores_gemma":[0.0008166011,0.00018762506,0.00017400892,0.00021888768,0.00021951384,0.000571369,0.0002697056,0.00036170243,0.0010700806],"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.0012710062,0.0007019331,0.0028808485,0.0016070826,0.00018531174,0.00071434746,0.0004960732,0.056861967,0.48933837,0.014925794,0.020293763,0.4107235],"study_design_scores_gemma":[0.00061673234,0.0046959277,0.003230245,0.00008484539,0.00017782568,0.0012659729,0.00015259345,0.30780342,0.59841555,0.0021498739,0.081338234,0.0000688141],"about_ca_topic_score_codex":0.0010223322,"about_ca_topic_score_gemma":0.0009902886,"teacher_disagreement_score":0.0065359385,"about_ca_system_score_codex":0.00037645752,"about_ca_system_score_gemma":0.00043456236,"threshold_uncertainty_score":0.02186495},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5942543,0.0019394829,0.3168202,0.006800782,0.00023261798,0.000093395916,0.00013248334,0.0007833806,0.078943245],"genre_scores_gemma":[0.96833426,0.0005857153,0.026104037,0.00018259251,0.00020616168,0.00006675101,0.000032785178,0.00006745443,0.004420345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876606,0.00038001811,0.00003124303,0.00015125492,0.0004079411,0.00026357625],"domain_scores_gemma":[0.99624676,0.0016664495,0.00042735742,0.001170567,0.00022581728,0.0002631851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017552795,0.0005775055,0.00082742725,0.00059839664,0.0008916784,0.0022056554,0.0016105367,0.0009192698,0.004411269],"category_scores_gemma":[0.007440121,0.00036395993,0.00056721404,0.00085613143,0.0032258204,0.008041951,0.003376232,0.0020374553,0.00061178475],"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.00024096732,0.0000775443,0.0008199974,0.00015988144,0.000041837313,0.00015944519,0.00026807832,0.057599187,0.0049885064,0.9138652,0.0020298914,0.019749409],"study_design_scores_gemma":[0.00007620096,0.00015648564,0.00038038724,0.000024758063,0.0000324855,0.00011834221,0.00012872268,0.45853782,0.002227753,0.53527176,0.0030238251,0.00002156656],"about_ca_topic_score_codex":0.0015376491,"about_ca_topic_score_gemma":0.001204381,"teacher_disagreement_score":0.004411269,"about_ca_system_score_codex":0.0006274717,"about_ca_system_score_gemma":0.0011119356,"threshold_uncertainty_score":0.014757216},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009820161,0.0006733174,0.9065608,0.0013681583,0.00028009806,0.00017218631,0.00025750743,0.0010204577,0.07984732],"genre_scores_gemma":[0.40382174,0.002030149,0.52374846,0.001027107,0.00056751777,0.0008957194,0.00066406874,0.00070071407,0.066544525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983712,0.00045110728,0.000092979455,0.00030639462,0.0005772796,0.00020120197],"domain_scores_gemma":[0.9984029,0.0005610734,0.00013439487,0.00039747494,0.00038480293,0.000119423436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014841859,0.0005453195,0.0006396418,0.00061888207,0.0011172732,0.0027484363,0.0024843048,0.0014159833,0.012342829],"category_scores_gemma":[0.00474361,0.0005186939,0.0012333672,0.000762792,0.001888306,0.0060093347,0.0020472899,0.0022697062,0.0031029151],"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.000019425179,0.000020994537,0.00016642394,0.000034687862,0.000007615771,0.00005448524,0.00010892793,0.016527072,0.0005528141,0.97159,0.0020978125,0.008819798],"study_design_scores_gemma":[0.000047932102,0.000054256463,0.000110829365,0.000037147904,0.00003070092,0.00017382677,0.000039738134,0.29439205,0.0013752594,0.6389135,0.0648005,0.00002427439],"about_ca_topic_score_codex":0.004859792,"about_ca_topic_score_gemma":0.0039070123,"teacher_disagreement_score":0.012342829,"about_ca_system_score_codex":0.0018088777,"about_ca_system_score_gemma":0.0033308845,"threshold_uncertainty_score":0.04129094},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89490753,0.00076190545,0.08196767,0.00018492845,0.00013450484,0.00022504664,0.0006813601,0.005267737,0.01586936],"genre_scores_gemma":[0.9470525,0.0003323062,0.044646714,0.000039708095,0.00003239697,0.00015975785,0.001179528,0.00032144212,0.006235786],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987453,0.00010971622,0.00006898815,0.00031925968,0.0005852913,0.00017143453],"domain_scores_gemma":[0.9984707,0.00029240243,0.00010720119,0.00022528514,0.0007520893,0.00015216062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049310486,0.00050500385,0.0005090034,0.0013144554,0.0003958619,0.0010743769,0.0008176858,0.00032724373,0.0042738253],"category_scores_gemma":[0.0021028726,0.00023921975,0.00033367457,0.0014236281,0.00024085773,0.00063073315,0.00044824724,0.0005075045,0.0013358225],"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.0048986273,0.0008711079,0.036987014,0.00094041205,0.00020628386,0.0011083421,0.0009899278,0.07430655,0.51355296,0.005996637,0.009715591,0.35042655],"study_design_scores_gemma":[0.00023094553,0.0047423546,0.07242639,0.00009739955,0.00026209548,0.000908168,0.0004652326,0.5929126,0.29382303,0.002127493,0.0318506,0.0001537571],"about_ca_topic_score_codex":0.0018844394,"about_ca_topic_score_gemma":0.0007252981,"teacher_disagreement_score":0.0042738253,"about_ca_system_score_codex":0.0006563334,"about_ca_system_score_gemma":0.00068793935,"threshold_uncertainty_score":0.014297366},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9835312,0.00044261006,0.011433232,0.00006460681,0.00004318481,0.000052658575,0.00016691013,0.00056942686,0.003696284],"genre_scores_gemma":[0.9825096,0.00017498428,0.016021682,0.000011239046,0.000018418881,0.000031107556,0.00033400572,0.0000944616,0.0008045067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984106,0.00037614626,0.000121472636,0.00018837283,0.00057271856,0.00033064655],"domain_scores_gemma":[0.9962333,0.0016615813,0.00022941359,0.0004930285,0.0010801727,0.00030259066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014767437,0.0005830792,0.00047426438,0.0007855607,0.00049094256,0.00064761983,0.0008993183,0.0004611546,0.001737533],"category_scores_gemma":[0.0046494487,0.00023316096,0.0003331209,0.0015968455,0.00035260935,0.0013588818,0.000447764,0.0005287298,0.00035733375],"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.006115077,0.0014103561,0.029525796,0.0006045209,0.00028221033,0.0003940075,0.0005583269,0.62025565,0.1208843,0.0077785715,0.006255714,0.20593534],"study_design_scores_gemma":[0.00016793696,0.0018002804,0.0116697345,0.000014453214,0.00006327781,0.000090543894,0.00016089526,0.9443368,0.037807144,0.0014227835,0.0024354388,0.000030700194],"about_ca_topic_score_codex":0.006843295,"about_ca_topic_score_gemma":0.0042724987,"teacher_disagreement_score":0.006843295,"about_ca_system_score_codex":0.0006720123,"about_ca_system_score_gemma":0.0006759137,"threshold_uncertainty_score":0.013606906},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9548441,0.00019621219,0.04217411,0.00005739725,0.0000300997,0.000064845684,0.00006973201,0.0016307071,0.00093280646],"genre_scores_gemma":[0.97492266,0.000028213692,0.024701387,0.000012171577,0.000007926815,0.00003694323,0.00012016754,0.000047551777,0.00012297454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990575,0.00034629053,0.00006488793,0.0001806342,0.00022611191,0.00012448608],"domain_scores_gemma":[0.9935974,0.0037852952,0.0005382293,0.0008045924,0.0010140955,0.00026030422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024774158,0.0004074455,0.00038890328,0.0005452579,0.00033220593,0.0004331314,0.0008322055,0.000282235,0.0006071728],"category_scores_gemma":[0.012457259,0.00021247084,0.00017876817,0.000496736,0.00040888845,0.00052501354,0.00031483782,0.000338031,0.00009757481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022083675,0.0005129804,0.066484645,0.00017463602,0.00011687577,0.00018973235,0.00017119996,0.7122277,0.027025482,0.0034795518,0.002580312,0.18482846],"study_design_scores_gemma":[0.000081243765,0.0000944538,0.0028554664,0.0000021306837,0.000010525236,0.000016432292,0.000018459861,0.99075997,0.005573444,0.00037569887,0.00020728167,0.0000048723527],"about_ca_topic_score_codex":0.002730959,"about_ca_topic_score_gemma":0.0035098118,"teacher_disagreement_score":0.002730959,"about_ca_system_score_codex":0.0009515456,"about_ca_system_score_gemma":0.0013213821,"threshold_uncertainty_score":0.013101995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09185643,0.00019241651,0.90340745,0.00016545046,0.000008369302,0.000064913984,0.000111521455,0.002579054,0.0016143211],"genre_scores_gemma":[0.88050103,0.00009565278,0.117321305,0.00007684826,0.000012052081,0.00021051291,0.00020524727,0.0003464093,0.0012309882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893695,0.0005354661,0.00003665303,0.0001734658,0.00023933624,0.000078070625],"domain_scores_gemma":[0.9969054,0.0022635618,0.0003287007,0.00025161696,0.00021404838,0.000036719026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016910713,0.0010404182,0.0010628094,0.00080654846,0.00028529996,0.00073102536,0.0012350137,0.0006247891,0.0017978743],"category_scores_gemma":[0.007823495,0.0007003533,0.00085044256,0.00075546245,0.00039535936,0.0011450889,0.00050469924,0.0013010281,0.0005392133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044462933,0.00004242019,0.0011937412,0.000025358799,0.000032914108,0.000013739811,0.000021494207,0.9773162,0.0023618601,0.0008964273,0.00022453103,0.01782683],"study_design_scores_gemma":[0.0000028891845,0.000010331255,0.000070301525,0.0000011350522,0.0000027225476,0.0000027272822,0.0000013199889,0.99906915,0.00043633563,0.0003519628,0.000049473536,0.0000015934669],"about_ca_topic_score_codex":0.003727438,"about_ca_topic_score_gemma":0.0056530396,"teacher_disagreement_score":0.003727438,"about_ca_system_score_codex":0.0006977814,"about_ca_system_score_gemma":0.0011320738,"threshold_uncertainty_score":0.008943379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08137969,0.0001484928,0.9078648,0.0007610219,0.000097374024,0.00014328911,0.0003022878,0.0027388653,0.006564171],"genre_scores_gemma":[0.7994804,0.00017050876,0.19595882,0.0002886594,0.0000795756,0.00034748658,0.00049922906,0.00024713244,0.0029281878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943895,0.0017957747,0.00053878484,0.0010294368,0.0017993352,0.0004472689],"domain_scores_gemma":[0.96955925,0.019187268,0.0016293847,0.0070967074,0.0022510195,0.00027643595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039774464,0.0004905431,0.00073308893,0.0007721507,0.0013532316,0.0020527598,0.001779218,0.0012562135,0.002244292],"category_scores_gemma":[0.025492137,0.0006851818,0.0013697011,0.000758357,0.0032466252,0.0049060807,0.0024751294,0.0026688576,0.00043879115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004668479,0.00024383415,0.0043839137,0.00052566413,0.00015141538,0.0008210151,0.00094522675,0.118708655,0.048316743,0.7504476,0.004365798,0.07062326],"study_design_scores_gemma":[0.0001200849,0.000093944225,0.0004633111,0.000056636738,0.0000725899,0.00019149129,0.00009067069,0.4276275,0.05335156,0.51066667,0.0072269305,0.00003859054],"about_ca_topic_score_codex":0.0025423684,"about_ca_topic_score_gemma":0.002792168,"teacher_disagreement_score":0.0039774464,"about_ca_system_score_codex":0.0015259599,"about_ca_system_score_gemma":0.0034792142,"threshold_uncertainty_score":0.021035016},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9940613,0.00032200516,0.0027727322,0.00006995374,0.000028166352,0.000027189883,0.00022181062,0.001606427,0.00089038594],"genre_scores_gemma":[0.99084705,0.00011748701,0.007617103,0.00003660303,0.000017372391,0.000051340372,0.0005925118,0.00036495202,0.00035567445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964148,0.0011405917,0.00027262667,0.00061110855,0.0010500631,0.00051086064],"domain_scores_gemma":[0.96934783,0.021292504,0.003035429,0.0029360796,0.0022591949,0.0011289723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029709777,0.001487161,0.0005688943,0.0012676162,0.00049952883,0.00083091954,0.0014139506,0.0005734969,0.0007924621],"category_scores_gemma":[0.013169,0.00055918115,0.0005359606,0.0014992581,0.0009970374,0.0012457513,0.0008218403,0.0013018207,0.00021845776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011262851,0.00579984,0.12178923,0.0021753097,0.000852754,0.0011430818,0.0025024952,0.30302152,0.29673943,0.0053030644,0.009186231,0.2402242],"study_design_scores_gemma":[0.00036735594,0.007864415,0.05676745,0.00010315508,0.00030675053,0.00033440356,0.00039835362,0.73596376,0.1921432,0.0016081877,0.0040286444,0.00011429785],"about_ca_topic_score_codex":0.0031534832,"about_ca_topic_score_gemma":0.0029633036,"teacher_disagreement_score":0.0031534832,"about_ca_system_score_codex":0.0010498516,"about_ca_system_score_gemma":0.000836164,"threshold_uncertainty_score":0.015712202},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09214973,0.00012875786,0.8991518,0.00009774991,0.000020751688,0.000057784153,0.00011709512,0.0045111836,0.0037652375],"genre_scores_gemma":[0.71809894,0.00013256063,0.27943546,0.000038371203,0.0000112171,0.000115809366,0.00030853265,0.00037827235,0.0014808394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955374,0.0001409185,0.000016922506,0.00005235835,0.00017589131,0.00006011428],"domain_scores_gemma":[0.998684,0.00093561184,0.00007874701,0.00017838916,0.00009754227,0.000025766341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003801354,0.00053602573,0.0003506961,0.00054058194,0.0002535958,0.00038147278,0.0010827978,0.00033426998,0.0030794863],"category_scores_gemma":[0.0027392858,0.00024085381,0.00045824322,0.00044389602,0.00069833716,0.00092207955,0.0007689389,0.00056323735,0.000254837],"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.00029258887,0.000090242356,0.002310232,0.00028645888,0.00007132866,0.00032270973,0.00030855718,0.7051676,0.045563392,0.04619508,0.0012051,0.19818673],"study_design_scores_gemma":[0.000015031167,0.000040038034,0.00023666625,0.000009002568,0.000016286362,0.000030044008,0.00001682971,0.9687825,0.019794738,0.00979086,0.0012604949,0.0000075593207],"about_ca_topic_score_codex":0.0024772119,"about_ca_topic_score_gemma":0.0036977103,"teacher_disagreement_score":0.0030794863,"about_ca_system_score_codex":0.00047814072,"about_ca_system_score_gemma":0.00062722963,"threshold_uncertainty_score":0.010301888},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17262597,0.00093978347,0.8091913,0.00073694665,0.000074139854,0.000059402177,0.00037839878,0.0011675205,0.014826523],"genre_scores_gemma":[0.93330437,0.00037187224,0.06055051,0.00014324857,0.00003343851,0.00011368774,0.0002736515,0.00013617,0.0050729127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981076,0.000057881534,0.00000739364,0.000036455225,0.000062782434,0.000024723078],"domain_scores_gemma":[0.99955016,0.00024241359,0.000051504463,0.000050226892,0.0000893806,0.000016272666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041015842,0.0005291886,0.0005828422,0.00040855826,0.00021019531,0.0005668722,0.0009099849,0.00063568755,0.0018224267],"category_scores_gemma":[0.0020586653,0.0003051202,0.00046543486,0.00054290175,0.00027809246,0.00074688654,0.00034582656,0.0008077283,0.00035431897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012146045,0.000008753384,0.00046978614,0.000008276693,0.000005951741,0.000008380599,0.0000062210047,0.99252206,0.00018042176,0.0006564556,0.00021564087,0.0059058806],"study_design_scores_gemma":[6.3896476e-7,0.000002317732,0.000042136286,9.205692e-7,7.9320273e-7,0.0000016948468,7.9162476e-7,0.9994374,0.000060751983,0.00036972287,0.000082139435,6.766575e-7],"about_ca_topic_score_codex":0.00979675,"about_ca_topic_score_gemma":0.011006894,"teacher_disagreement_score":0.00979675,"about_ca_system_score_codex":0.0005911283,"about_ca_system_score_gemma":0.00065284356,"threshold_uncertainty_score":0.019479454},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22568591,0.14392869,0.26657927,0.20267177,0.004800243,0.00017073716,0.0008581369,0.0038256699,0.15147954],"genre_scores_gemma":[0.8646586,0.02134208,0.0844518,0.004445673,0.0025801465,0.00017575073,0.00025902956,0.0006705395,0.021416375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987663,0.00041112932,0.000055632663,0.000119773315,0.0004393674,0.00020788179],"domain_scores_gemma":[0.9975629,0.0012290428,0.0001543241,0.00032775674,0.00049346004,0.00023240813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024269475,0.00042291568,0.0008970833,0.0005189068,0.001675093,0.0035942632,0.0024134757,0.0015421199,0.0072859866],"category_scores_gemma":[0.009566111,0.00044633108,0.00028966359,0.0011754642,0.0016762775,0.00562439,0.0022824449,0.0028251694,0.0013583235],"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.0003984162,0.00020330718,0.0023010103,0.0006120466,0.000097271535,0.0002781953,0.00047435958,0.17697845,0.004688687,0.41909212,0.12128249,0.27359378],"study_design_scores_gemma":[0.000079146324,0.000114655995,0.0014756102,0.00019398482,0.000038427883,0.00022711047,0.00055614806,0.45406425,0.0033093216,0.42084002,0.119025305,0.00007611043],"about_ca_topic_score_codex":0.0041346983,"about_ca_topic_score_gemma":0.0064990027,"teacher_disagreement_score":0.0072859866,"about_ca_system_score_codex":0.0017012869,"about_ca_system_score_gemma":0.0019726548,"threshold_uncertainty_score":0.024374068},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043188196,0.0031204994,0.8188956,0.0018853833,0.0008277613,0.00029548083,0.0019595958,0.064171076,0.065656446],"genre_scores_gemma":[0.3378064,0.0036783577,0.55864537,0.000790068,0.00047700916,0.00060225726,0.0044698864,0.003234304,0.09029635],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993993,0.00013857825,0.000032631648,0.00018444328,0.00019405737,0.00005097878],"domain_scores_gemma":[0.9991179,0.00021744252,0.00005029987,0.0002505222,0.00028850936,0.00007538702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006865665,0.0007408109,0.0004041444,0.00082553906,0.00041436293,0.0023952618,0.00083687867,0.00052406685,0.031012664],"category_scores_gemma":[0.0025766178,0.0003219137,0.0003067255,0.00084878656,0.00035174697,0.0012598891,0.0009189336,0.00068278034,0.0112530105],"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.0005856071,0.00010135216,0.0023684325,0.00030252367,0.000051336676,0.00016527536,0.00023056638,0.017173069,0.019780284,0.023023454,0.043283157,0.892935],"study_design_scores_gemma":[0.00022113802,0.00030730257,0.0035573519,0.0002185196,0.00010972996,0.0005163583,0.00023251642,0.32916394,0.04417616,0.018864652,0.6025479,0.00008444171],"about_ca_topic_score_codex":0.004534224,"about_ca_topic_score_gemma":0.003852581,"teacher_disagreement_score":0.031012664,"about_ca_system_score_codex":0.00069572625,"about_ca_system_score_gemma":0.0010677329,"threshold_uncertainty_score":0.103747666},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09048255,0.010266992,0.7758867,0.054922976,0.0021621431,0.00042261675,0.000094662115,0.001616634,0.06414469],"genre_scores_gemma":[0.7739784,0.0019550181,0.20527883,0.0050177546,0.0015991165,0.00038451114,0.000052146617,0.00035236063,0.011381871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940169,0.0016414507,0.0003749352,0.000900828,0.0021644204,0.0009014145],"domain_scores_gemma":[0.9839243,0.007496531,0.0013386147,0.004335086,0.0018239742,0.0010813422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066690287,0.00068815047,0.0010108607,0.00082387467,0.003586401,0.0048517575,0.0034539963,0.00413815,0.0036470022],"category_scores_gemma":[0.027893146,0.0010356654,0.0007250009,0.0010761028,0.004444755,0.011326039,0.004301064,0.0066164955,0.0010282927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028297884,0.00021017926,0.0049622064,0.00037141054,0.00008506437,0.0014517839,0.0016018839,0.044893704,0.008612646,0.8216121,0.02024408,0.09567188],"study_design_scores_gemma":[0.00013718395,0.00015575993,0.0012921741,0.00021513984,0.000055279463,0.0013078587,0.0005368214,0.4437241,0.007505209,0.46819344,0.07677659,0.0001004226],"about_ca_topic_score_codex":0.001966302,"about_ca_topic_score_gemma":0.0021984787,"teacher_disagreement_score":0.0066690287,"about_ca_system_score_codex":0.00221089,"about_ca_system_score_gemma":0.002084939,"threshold_uncertainty_score":0.035269618},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03243983,0.0024030833,0.9551831,0.0006030247,0.00012953285,0.00008620483,0.00003111612,0.00096327014,0.008160864],"genre_scores_gemma":[0.4635589,0.0023339365,0.5232674,0.00043224345,0.00013522984,0.00017136408,0.00008732553,0.00018179239,0.009831836],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99957365,0.00007789884,0.000023242628,0.00008168199,0.00016681156,0.00007671351],"domain_scores_gemma":[0.9997061,0.00006243489,0.000031002925,0.00010983454,0.000058767717,0.00003184835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043699375,0.00027052223,0.00036535415,0.00039933814,0.0003608036,0.001031854,0.0012824043,0.0004906139,0.0022117558],"category_scores_gemma":[0.0006995138,0.0003505442,0.00037532818,0.0003304837,0.0006047918,0.001774388,0.000968565,0.0008949648,0.0005293715],"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.0003016332,0.00021720302,0.0019902894,0.000369473,0.00016765152,0.00039568834,0.0003552701,0.14127724,0.12608795,0.19592233,0.004314637,0.52860063],"study_design_scores_gemma":[0.0001134078,0.00028084256,0.00074444234,0.00005920324,0.0000832492,0.0003396669,0.00007620123,0.7782284,0.042769283,0.12445892,0.052786376,0.00006003756],"about_ca_topic_score_codex":0.00089879497,"about_ca_topic_score_gemma":0.0018425031,"teacher_disagreement_score":0.0022117558,"about_ca_system_score_codex":0.0005494891,"about_ca_system_score_gemma":0.0009859463,"threshold_uncertainty_score":0.0073990226},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9847131,0.00029626524,0.013163739,0.000093083356,0.000011870039,0.00001812746,0.00011631803,0.00020831665,0.0013791297],"genre_scores_gemma":[0.9975177,0.00006743287,0.00191208,0.000018211626,0.000006613797,0.0000127941985,0.000053594777,0.000039298,0.00037232458],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943095,0.0001180462,0.00002728745,0.00013915662,0.00019273371,0.00009172394],"domain_scores_gemma":[0.99496377,0.0036334347,0.0004525336,0.0004442521,0.00042739196,0.000078780184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005285897,0.00050927955,0.00044719988,0.000395846,0.00024542728,0.0005144893,0.0006183759,0.00039896372,0.0017037304],"category_scores_gemma":[0.004797229,0.00029262726,0.0002820932,0.0006488919,0.00035858137,0.0011646448,0.00035304393,0.00045480125,0.00028325425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020803094,0.0006486079,0.034149457,0.0005070674,0.00017406324,0.0005344324,0.00033672547,0.35875422,0.50588006,0.00158018,0.0009821663,0.094372764],"study_design_scores_gemma":[0.000041603736,0.0015369233,0.024513457,0.000018079589,0.00014048803,0.0002196581,0.00014168838,0.6799133,0.29138607,0.00125202,0.00080044346,0.00003640632],"about_ca_topic_score_codex":0.001214144,"about_ca_topic_score_gemma":0.0014062097,"teacher_disagreement_score":0.0017037304,"about_ca_system_score_codex":0.0003656618,"about_ca_system_score_gemma":0.00035025371,"threshold_uncertainty_score":0.005699575},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049773436,0.00010119739,0.94687146,0.00015009772,0.000030286228,0.00008142714,0.00011728371,0.0014607196,0.0014140373],"genre_scores_gemma":[0.71074235,0.00020086282,0.28359973,0.000107994325,0.00011082758,0.00040671503,0.00049482135,0.00052822987,0.0038084383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988477,0.00028462333,0.000079622914,0.00021265363,0.00040275056,0.00017265089],"domain_scores_gemma":[0.9960284,0.0016487645,0.00039643794,0.0013976498,0.00032706538,0.00020158043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018364053,0.00078270526,0.00074183877,0.0011495228,0.0010206281,0.0018560764,0.0020777578,0.0010236333,0.0021758396],"category_scores_gemma":[0.0060497783,0.00054994185,0.0015998008,0.0009885489,0.001690656,0.0035559644,0.001546731,0.0016159605,0.00031469588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033276752,0.0002028665,0.0043470846,0.0000765382,0.00008576124,0.0002168329,0.00028265634,0.81031275,0.008754636,0.14276944,0.0010697228,0.03154896],"study_design_scores_gemma":[0.000008828936,0.000020703601,0.000117637464,0.0000028604513,0.00001503799,0.000016337055,0.00001337453,0.96777767,0.001028421,0.030523691,0.00047000695,0.0000053388817],"about_ca_topic_score_codex":0.0067947158,"about_ca_topic_score_gemma":0.005435232,"teacher_disagreement_score":0.0067947158,"about_ca_system_score_codex":0.0014599945,"about_ca_system_score_gemma":0.0017044353,"threshold_uncertainty_score":0.013510346},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89652205,0.002175906,0.093400374,0.0006576507,0.0001251075,0.000085288564,0.0001233429,0.003261636,0.003648516],"genre_scores_gemma":[0.9809869,0.00024660685,0.018035036,0.000089507965,0.00002711192,0.00002441855,0.00007994754,0.000120588535,0.00038985675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992599,0.00014352569,0.000035211648,0.00013180144,0.00023900779,0.00019052236],"domain_scores_gemma":[0.9984946,0.00065120944,0.00012260626,0.00048092307,0.00017202031,0.00007861767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057220587,0.00081346,0.0006506292,0.0005612679,0.0008098689,0.00096542796,0.001356688,0.00051162357,0.0006762204],"category_scores_gemma":[0.0037285148,0.00046349628,0.00029884322,0.0012176272,0.00075569033,0.001919328,0.0009641346,0.0009010268,0.00023133565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018393305,0.00050519686,0.04893609,0.0004490675,0.00020320319,0.0010665795,0.0007624834,0.42513642,0.13631575,0.01319331,0.007591495,0.3640011],"study_design_scores_gemma":[0.000046008034,0.0004522586,0.004556773,0.000017209235,0.000061000115,0.00022043563,0.00012856217,0.9440562,0.041255776,0.005774849,0.003390911,0.000040009316],"about_ca_topic_score_codex":0.0057504154,"about_ca_topic_score_gemma":0.008181124,"teacher_disagreement_score":0.0057504154,"about_ca_system_score_codex":0.000775996,"about_ca_system_score_gemma":0.0012948199,"threshold_uncertainty_score":0.011433899},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016853776,0.00045624468,0.9517654,0.0008528892,0.00022301063,0.0002911135,0.00021481482,0.0037332885,0.025609542],"genre_scores_gemma":[0.2923461,0.0008494824,0.67860913,0.0007178974,0.00026668,0.00072196126,0.00071514706,0.0027778703,0.02299576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650574,0.00092445366,0.00027997224,0.0006876419,0.001295353,0.0003068961],"domain_scores_gemma":[0.9931229,0.0011698904,0.00041202692,0.0038973633,0.0011789367,0.00021896353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035732854,0.0010054201,0.0010380232,0.0012319466,0.0022226295,0.0040634186,0.003364631,0.00086893304,0.00728628],"category_scores_gemma":[0.00752987,0.00088022626,0.0015460507,0.0024981105,0.0032369432,0.008253648,0.006199896,0.0027696574,0.0025722098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024790165,0.0001634639,0.0027683731,0.000597404,0.00010298169,0.0003754537,0.0027441983,0.030330176,0.023366885,0.7785977,0.016862923,0.14384252],"study_design_scores_gemma":[0.00010424467,0.00026594347,0.0013306035,0.00016126125,0.0001394021,0.0006877446,0.0005245635,0.11861458,0.03703497,0.6596336,0.18138854,0.00011455045],"about_ca_topic_score_codex":0.0022469128,"about_ca_topic_score_gemma":0.0038978187,"teacher_disagreement_score":0.00728628,"about_ca_system_score_codex":0.0017453416,"about_ca_system_score_gemma":0.0039410037,"threshold_uncertainty_score":0.024375021},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23885396,0.00053729623,0.73384005,0.00048472342,0.00025775502,0.00011435596,0.000115667855,0.002462838,0.023333348],"genre_scores_gemma":[0.82787836,0.0001515365,0.16224048,0.000093120885,0.00010928462,0.00010255486,0.00023939097,0.00024833565,0.008937052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997516,0.000048143025,0.000013987376,0.0000269101,0.00010795374,0.00005144537],"domain_scores_gemma":[0.99941504,0.00022208349,0.000030384857,0.00012943248,0.00016322166,0.00003982706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033199252,0.0004033083,0.00032803215,0.00047371458,0.00058042625,0.0006233924,0.0012226951,0.00034514806,0.0053107063],"category_scores_gemma":[0.0017117652,0.00014928536,0.00018459703,0.00046668097,0.0002611766,0.0010866356,0.0008037852,0.0003835495,0.0008537402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019555464,0.00044235302,0.0019023553,0.00022987304,0.00005216865,0.00031307695,0.00031934565,0.17338964,0.10565164,0.031571325,0.014855956,0.66931665],"study_design_scores_gemma":[0.00007172012,0.00008947103,0.0004703314,0.0000065840413,0.000011096132,0.000056026027,0.000043306733,0.9749204,0.016059881,0.0056097913,0.0026523075,0.000009117016],"about_ca_topic_score_codex":0.0017628974,"about_ca_topic_score_gemma":0.0048801024,"teacher_disagreement_score":0.0053107063,"about_ca_system_score_codex":0.00043790153,"about_ca_system_score_gemma":0.0006252415,"threshold_uncertainty_score":0.017766118},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9076144,0.00016662246,0.06715499,0.00018469793,0.00017820457,0.00035226997,0.0004993226,0.017523348,0.00632611],"genre_scores_gemma":[0.9287076,0.00010458032,0.064362206,0.000078008205,0.000041125004,0.0004030537,0.00094966264,0.0014905474,0.0038633458],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885404,0.00024145366,0.0000952437,0.00021107878,0.00042158805,0.00017656031],"domain_scores_gemma":[0.9965078,0.0010808228,0.0001915552,0.0011129815,0.00069813983,0.00040861405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017218245,0.0005598107,0.00047788164,0.00039703876,0.0007831264,0.0007599316,0.0014493619,0.00032316678,0.007173804],"category_scores_gemma":[0.0035261617,0.0003646045,0.00027460518,0.0004571501,0.00070423883,0.0010559562,0.0009926425,0.0011614127,0.0008558529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013979723,0.0037049009,0.020572798,0.00069271005,0.00023276039,0.0009398995,0.0019506026,0.07441314,0.6631958,0.022679383,0.016167935,0.1814704],"study_design_scores_gemma":[0.0013721111,0.0035802212,0.020221919,0.000063742526,0.00013122559,0.0003347299,0.00036166227,0.4589608,0.4786838,0.0031724204,0.03299488,0.00012250376],"about_ca_topic_score_codex":0.0018664268,"about_ca_topic_score_gemma":0.00157793,"teacher_disagreement_score":0.007173804,"about_ca_system_score_codex":0.0010044579,"about_ca_system_score_gemma":0.0015025131,"threshold_uncertainty_score":0.023998797},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034578055,0.00033115005,0.9463059,0.00013295417,0.00009992635,0.00016112668,0.00013710384,0.01244437,0.0058094156],"genre_scores_gemma":[0.6020746,0.00019346864,0.391246,0.00017112034,0.00006993604,0.00030097956,0.00036946769,0.0014751292,0.0040992834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993236,0.000116638366,0.000040176885,0.00011724662,0.0002823094,0.00012008807],"domain_scores_gemma":[0.9995049,0.00011314709,0.000039169397,0.00012997256,0.00014474384,0.00006798281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007856959,0.0006431444,0.0008214528,0.00078357547,0.00085925014,0.0011283305,0.0020137345,0.00072758674,0.0046247984],"category_scores_gemma":[0.0020472724,0.00038562017,0.00053182995,0.00058402197,0.00040229288,0.0008698787,0.001097321,0.0009123177,0.0010688335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010220348,0.0006167216,0.004634159,0.00040587806,0.000227443,0.00031135482,0.00035195562,0.44045827,0.115199216,0.035258487,0.014068502,0.3874459],"study_design_scores_gemma":[0.000054817374,0.000040268973,0.00034443862,0.0000084580715,0.000018994688,0.000035088673,0.000018609968,0.98114485,0.010203361,0.0036463942,0.0044649336,0.000019886756],"about_ca_topic_score_codex":0.0031716153,"about_ca_topic_score_gemma":0.0033896691,"teacher_disagreement_score":0.0046247984,"about_ca_system_score_codex":0.0007085098,"about_ca_system_score_gemma":0.0012749054,"threshold_uncertainty_score":0.015471458},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120457724,0.012883041,0.72126657,0.0048527694,0.00070259266,0.00024813536,0.0010392425,0.0028671343,0.13568273],"genre_scores_gemma":[0.72660047,0.006293265,0.21765403,0.0015771681,0.00088977616,0.0007232145,0.0013027203,0.0011792133,0.04378026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988764,0.0002267022,0.00007264477,0.00029015073,0.00031705614,0.00021703033],"domain_scores_gemma":[0.9973815,0.0008561272,0.00028164926,0.0008956991,0.0004426906,0.00014229878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082465186,0.00061340176,0.00052789715,0.0011856592,0.0011098953,0.0023220056,0.001563726,0.0008664098,0.008007796],"category_scores_gemma":[0.0037346624,0.00045402977,0.00037763882,0.0015687048,0.0024406745,0.005415251,0.001987272,0.001669321,0.0019447644],"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.00029550848,0.000097250966,0.0024209977,0.00029634876,0.000028016639,0.000113040456,0.000357665,0.03298354,0.008516916,0.778676,0.013228585,0.16298606],"study_design_scores_gemma":[0.000078259356,0.00037710794,0.0026026901,0.00019994426,0.00006970003,0.00039045006,0.00024421824,0.11309671,0.012301087,0.7437051,0.12688051,0.000054254702],"about_ca_topic_score_codex":0.0016683937,"about_ca_topic_score_gemma":0.0018717715,"teacher_disagreement_score":0.008007796,"about_ca_system_score_codex":0.001337052,"about_ca_system_score_gemma":0.0013305176,"threshold_uncertainty_score":0.026788771},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003229786,0.1146402,0.08261997,0.11304686,0.017976334,0.00016886015,0.0015934949,0.012882653,0.6538419],"genre_scores_gemma":[0.022659173,0.06438057,0.068005,0.061588265,0.007677663,0.00040615973,0.004020675,0.010594659,0.7606678],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974088,0.0007192411,0.00015381162,0.00047280113,0.0008497051,0.00039562315],"domain_scores_gemma":[0.9975497,0.0005321043,0.0001157861,0.00034856203,0.0010112468,0.00044249723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028128815,0.0012887924,0.00066001265,0.0034603307,0.0028357438,0.00909562,0.0026229748,0.003556081,0.08094421],"category_scores_gemma":[0.0065219216,0.00076908333,0.0013569464,0.0044291224,0.0026231145,0.021352002,0.0042861234,0.007244826,0.07041807],"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.00007941457,0.000079031895,0.00041374523,0.00048601738,0.000014546002,0.00016372277,0.00079589034,0.00030619965,0.0009507314,0.20119779,0.56176007,0.23375292],"study_design_scores_gemma":[0.0000018153438,0.000011644406,0.00005924796,0.00011427817,0.000001841782,0.000095278694,0.00009068616,0.00008695898,0.00013924912,0.0044230577,0.99496573,0.000010118621],"about_ca_topic_score_codex":0.004929476,"about_ca_topic_score_gemma":0.0053003607,"teacher_disagreement_score":0.08094421,"about_ca_system_score_codex":0.0049419254,"about_ca_system_score_gemma":0.0034416004,"threshold_uncertainty_score":0.27078533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3555296,0.008557447,0.5780733,0.0010619559,0.0012523786,0.0003740037,0.0011838685,0.024277873,0.029689588],"genre_scores_gemma":[0.86560667,0.0010361252,0.111572795,0.00073356205,0.0001393987,0.0002870033,0.0011686836,0.0004997104,0.01895614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967456,0.000033776432,0.000022780947,0.00009023738,0.0001019222,0.00007677506],"domain_scores_gemma":[0.99906963,0.00018292175,0.000095396346,0.00033815106,0.00025465435,0.000059264188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024666428,0.0007238514,0.00048311538,0.0005130882,0.00085903483,0.0009779414,0.0033920072,0.00052985456,0.0071789757],"category_scores_gemma":[0.000987999,0.00032757368,0.0004312507,0.0010494211,0.00045748163,0.0027417487,0.0014167615,0.00088452164,0.0015101805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00237417,0.00074660673,0.011912447,0.00092376996,0.0003191436,0.000988174,0.0009655504,0.11835869,0.11806392,0.03244496,0.054600973,0.65830165],"study_design_scores_gemma":[0.00026604702,0.0014921929,0.0028082216,0.00010500144,0.00038285385,0.0009236963,0.00039393402,0.6842017,0.17463984,0.024824219,0.10979801,0.0001643609],"about_ca_topic_score_codex":0.0031456966,"about_ca_topic_score_gemma":0.0057337005,"teacher_disagreement_score":0.0071789757,"about_ca_system_score_codex":0.00062850956,"about_ca_system_score_gemma":0.0016418236,"threshold_uncertainty_score":0.024016023},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017609945,0.00030260338,0.9765761,0.00013617685,0.000107852335,0.000087600994,0.000037549195,0.0020528627,0.0030892685],"genre_scores_gemma":[0.50670505,0.0001823929,0.48738256,0.00014461052,0.000045986922,0.00012929543,0.00008774259,0.00008654785,0.005235798],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99970156,0.00004012005,0.000026313628,0.00006783595,0.00014415896,0.000019861622],"domain_scores_gemma":[0.9997379,0.000062551604,0.000041275813,0.000043123764,0.000102032434,0.0000131043535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002759108,0.00036256606,0.00038308138,0.00022528721,0.00040026673,0.0007980908,0.00061090634,0.00043232084,0.0027426707],"category_scores_gemma":[0.0006948678,0.00018386729,0.00014903433,0.0002269858,0.00027105564,0.000288122,0.00018684329,0.0004574282,0.00071438635],"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.0005588063,0.00014829272,0.0011687023,0.00042404459,0.000072500865,0.00033174374,0.00020555305,0.2326751,0.1355569,0.017984727,0.0074285995,0.603445],"study_design_scores_gemma":[0.000101145444,0.0003346857,0.0006199095,0.00002573956,0.000025658195,0.00022024123,0.000014902856,0.9472748,0.037685167,0.0015298586,0.012143834,0.000024102379],"about_ca_topic_score_codex":0.0022318857,"about_ca_topic_score_gemma":0.0031520533,"teacher_disagreement_score":0.0027426707,"about_ca_system_score_codex":0.000483909,"about_ca_system_score_gemma":0.00087603513,"threshold_uncertainty_score":0.009175181},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54718256,0.006215211,0.43044063,0.00060586235,0.0004051466,0.00008132905,0.00018232336,0.0031256143,0.011761383],"genre_scores_gemma":[0.9570392,0.0006138991,0.03832251,0.00013147696,0.000036665802,0.00002248943,0.00006793675,0.00006521897,0.0037006862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975973,0.000025773195,0.000008883751,0.00003771727,0.00012649142,0.00004142298],"domain_scores_gemma":[0.99900204,0.00028243964,0.00014984813,0.0002473945,0.00029328544,0.000025006148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025273577,0.00030511612,0.00028743446,0.00035192157,0.0002949023,0.00039810906,0.0008359684,0.00040629608,0.0010652407],"category_scores_gemma":[0.0016569312,0.00015204535,0.00019818872,0.00044426092,0.00027074027,0.0006537507,0.0003802387,0.00051501085,0.00028507458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007276214,0.00021936826,0.006706334,0.0005143018,0.00011886546,0.0005076889,0.00016199214,0.312853,0.323785,0.021968722,0.006209418,0.32622766],"study_design_scores_gemma":[0.000054402517,0.0005121062,0.0032837228,0.0000424454,0.00008171529,0.00041670207,0.000041558946,0.6180331,0.36360928,0.00505905,0.008832759,0.000033063952],"about_ca_topic_score_codex":0.0010190192,"about_ca_topic_score_gemma":0.0014415962,"teacher_disagreement_score":0.0010652407,"about_ca_system_score_codex":0.00030528897,"about_ca_system_score_gemma":0.00051533274,"threshold_uncertainty_score":0.0035636425},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2776891,0.0027393536,0.69915545,0.00046562037,0.00056398666,0.00015168497,0.00034185313,0.007328252,0.011564676],"genre_scores_gemma":[0.7072675,0.000793434,0.27257684,0.00022644905,0.00035933178,0.00012585195,0.0009439004,0.00061379554,0.017092802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998855,0.0003138455,0.00006231283,0.00010740888,0.0005026053,0.00015892787],"domain_scores_gemma":[0.9946213,0.0029929033,0.00031953116,0.000996759,0.0009436135,0.00012590659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011951091,0.0015908419,0.0013190743,0.0013495815,0.00066368247,0.0010787053,0.0012798193,0.00072401075,0.0062242886],"category_scores_gemma":[0.005794431,0.0007666379,0.00065868173,0.0015950766,0.00034297843,0.0018089637,0.0012530122,0.0019028671,0.0014575877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013045729,0.00044722873,0.00585057,0.00020473426,0.00013389513,0.00025780575,0.00012292158,0.113087215,0.024284739,0.007000766,0.009275238,0.8380304],"study_design_scores_gemma":[0.000062324,0.00042437625,0.0026119107,0.000041795294,0.00017237231,0.00018906838,0.000038686892,0.9619169,0.025065128,0.00611547,0.0033342969,0.00002771718],"about_ca_topic_score_codex":0.0021435083,"about_ca_topic_score_gemma":0.009270471,"teacher_disagreement_score":0.0062242886,"about_ca_system_score_codex":0.00048164465,"about_ca_system_score_gemma":0.0016848119,"threshold_uncertainty_score":0.020822287},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9224308,0.0027922709,0.06324147,0.00055467925,0.00014050385,0.00015571949,0.00028187962,0.0005822265,0.009820408],"genre_scores_gemma":[0.9782696,0.00026219623,0.020811751,0.000055876728,0.00001669851,0.00006546191,0.00011034911,0.000048907288,0.0003591715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977798,0.0011705371,0.00008980766,0.00018638808,0.00039283463,0.00038057394],"domain_scores_gemma":[0.9757739,0.020416627,0.0011422031,0.0010650455,0.0011835593,0.0004187062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004855479,0.0010598642,0.0009089611,0.001699062,0.00060390215,0.0012769379,0.0010782942,0.0012185373,0.0011554208],"category_scores_gemma":[0.015126523,0.00046525363,0.0006440342,0.0013344593,0.00068069185,0.0010037826,0.0005163579,0.0009092058,0.00016045614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000327132,0.00016591941,0.00221863,0.00010123982,0.00011378456,0.00002735015,0.000043864256,0.9813017,0.0011595443,0.0020178389,0.00036388703,0.012158985],"study_design_scores_gemma":[0.000038326307,0.00024738518,0.0011352677,0.000019345924,0.00006370584,0.000015072915,0.00004986209,0.9961133,0.0011801631,0.00087311043,0.0002564367,0.00000795348],"about_ca_topic_score_codex":0.0050229775,"about_ca_topic_score_gemma":0.004042063,"teacher_disagreement_score":0.0050229775,"about_ca_system_score_codex":0.0022818802,"about_ca_system_score_gemma":0.0019477431,"threshold_uncertainty_score":0.025678575},"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":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004995733,0.00048047572,0.0026647747,0.00022927625,0.00031768865,0.00006499184,0.9872154,0.0025423176,0.0059854765],"genre_scores_gemma":[0.0029936638,0.00040394597,0.0050825733,0.0003628366,0.00010070173,0.00035441667,0.98136985,0.0023183937,0.007013623],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99815035,0.00015227376,0.00021436311,0.00046549444,0.0007476994,0.00026975],"domain_scores_gemma":[0.99383307,0.0025201635,0.00051333953,0.0011110939,0.0012495748,0.0007727391],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020932814,0.0023729468,0.0028767842,0.0063625183,0.0032778801,0.0032355308,0.0047003906,0.0023688066,0.6800386],"category_scores_gemma":[0.011651869,0.0018158002,0.0016338566,0.0085177235,0.0006852781,0.0032472569,0.0021212464,0.0033845166,0.40345153],"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.00035219316,0.00008845776,0.0008578572,0.001659147,0.000064840075,0.00009748187,0.000055361677,0.00057717634,0.0037182327,0.0020194245,0.97948575,0.011023991],"study_design_scores_gemma":[0.00043457904,0.00008790588,0.006171171,0.00039517245,0.000113351365,0.00040165518,0.000067613386,0.0009604811,0.004833293,0.007518007,0.9789176,0.00009934838],"about_ca_topic_score_codex":0.011561876,"about_ca_topic_score_gemma":0.01620021,"teacher_disagreement_score":0.6800386,"about_ca_system_score_codex":0.0020149893,"about_ca_system_score_gemma":0.0033344957,"threshold_uncertainty_score":0.45638615},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5467579,0.014516964,0.30890268,0.0075170887,0.0011839254,0.00009559699,0.00021153639,0.0010287515,0.11978561],"genre_scores_gemma":[0.98083556,0.0013174582,0.014078495,0.00014283434,0.00014329425,0.000041786556,0.000036938527,0.000032529628,0.003371032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99985087,0.00004496788,0.000005071799,0.00002106963,0.00005704485,0.000020815627],"domain_scores_gemma":[0.9995945,0.00021254124,0.000024701472,0.00005159406,0.000069195245,0.000047459696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003890477,0.0001248006,0.0003603227,0.00032089365,0.0006705815,0.0010761705,0.00039396278,0.000495326,0.0027228699],"category_scores_gemma":[0.0011606307,0.00013745225,0.00016088648,0.00043426355,0.0014641575,0.0015357967,0.0009915394,0.00070634735,0.0002360451],"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.000101565085,0.000033047905,0.00055584096,0.00014363682,0.00002649524,0.00015253983,0.00016615319,0.050820336,0.010354621,0.91844326,0.0031116433,0.01609088],"study_design_scores_gemma":[0.000043263462,0.00007029509,0.00062326103,0.000032243315,0.000013812137,0.00009890421,0.00011894509,0.33800456,0.004287677,0.6436054,0.013077188,0.000024492181],"about_ca_topic_score_codex":0.0008344157,"about_ca_topic_score_gemma":0.00093915657,"teacher_disagreement_score":0.0027228699,"about_ca_system_score_codex":0.00057157,"about_ca_system_score_gemma":0.00035572474,"threshold_uncertainty_score":0.009108901},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17520384,0.0033254616,0.7653382,0.0004903223,0.0001990905,0.00006843665,0.00045558217,0.00086482044,0.054054294],"genre_scores_gemma":[0.96387786,0.0009630374,0.018051611,0.000067979854,0.00003037613,0.000041480853,0.00013605304,0.00013113224,0.016700517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998796,0.000018433167,0.000005548471,0.000018159522,0.00005338389,0.000024800564],"domain_scores_gemma":[0.99983346,0.00008208607,0.00001690127,0.000021832982,0.000038258848,0.000007453689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016239322,0.0005001177,0.00039248096,0.00031959216,0.0002003498,0.0007600351,0.0011864048,0.0005154185,0.004164492],"category_scores_gemma":[0.0006069483,0.00029164104,0.0004153069,0.00048415354,0.00028761372,0.0008762188,0.00025592005,0.00053478923,0.0006818456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033003853,0.000015640862,0.00025100025,0.000039849143,0.000009634089,0.000054322125,0.000019648744,0.9758245,0.0036098151,0.011301412,0.00036817143,0.008473025],"study_design_scores_gemma":[8.292349e-7,0.0000042369356,0.00005853334,0.000002496054,0.0000020954499,0.000009956139,0.0000021102842,0.9980369,0.0004941005,0.001162278,0.00022511039,0.000001410346],"about_ca_topic_score_codex":0.0045907665,"about_ca_topic_score_gemma":0.005149095,"teacher_disagreement_score":0.0045907665,"about_ca_system_score_codex":0.00083991844,"about_ca_system_score_gemma":0.00048833404,"threshold_uncertainty_score":0.013931572},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067032673,0.0027239376,0.96092665,0.0006575514,0.00046113142,0.00019005651,0.001041091,0.010193178,0.017103229],"genre_scores_gemma":[0.07988312,0.001281188,0.90782684,0.0004929058,0.00019011278,0.0003825683,0.0010532907,0.0018833304,0.0070065362],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983657,0.00042962085,0.0001770696,0.00034615505,0.00054638,0.00013498432],"domain_scores_gemma":[0.9951454,0.0017543266,0.00042185208,0.001744248,0.0008130016,0.00012117934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014444669,0.0010906804,0.0009014493,0.0017397403,0.0009955771,0.0029104317,0.0028230734,0.0011764208,0.027089102],"category_scores_gemma":[0.010304088,0.00073665247,0.000814827,0.004315272,0.0011152017,0.006000708,0.001902532,0.001370347,0.011422178],"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.0006932633,0.00017395252,0.0013408939,0.0010690012,0.00008456983,0.00022941422,0.00038511286,0.04103215,0.026450707,0.34759906,0.043192957,0.53774893],"study_design_scores_gemma":[0.0002702942,0.0007623711,0.00080655166,0.00028894373,0.000108912,0.0010183209,0.00028729276,0.13533424,0.049964678,0.5146514,0.29632607,0.00018098604],"about_ca_topic_score_codex":0.0011998815,"about_ca_topic_score_gemma":0.0019824593,"teacher_disagreement_score":0.027089102,"about_ca_system_score_codex":0.0013411465,"about_ca_system_score_gemma":0.0015820061,"threshold_uncertainty_score":0.09062201},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010306964,0.0017414738,0.9744513,0.000825756,0.00013471673,0.00015883186,0.00038599526,0.00021301735,0.02105821],"genre_scores_gemma":[0.05086429,0.0047028563,0.9298001,0.00037003143,0.00027722667,0.00093096984,0.0009749025,0.0004005327,0.011679094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755645,0.0009684247,0.00013997033,0.00028086975,0.0008470111,0.00020720114],"domain_scores_gemma":[0.99580824,0.0032617662,0.00019037047,0.00022365374,0.00045204296,0.0000638451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028027322,0.00203763,0.0014520433,0.0015754768,0.0012176852,0.0028652358,0.0025149444,0.0015734858,0.013941203],"category_scores_gemma":[0.008954573,0.0013710676,0.0020723103,0.004703461,0.0019263688,0.0025604337,0.0020988518,0.004779861,0.0028757392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040737832,0.00006119218,0.0001522393,0.00043606205,0.00006858848,0.00013777317,0.00016961896,0.39550057,0.0006254622,0.5117053,0.015804008,0.07529842],"study_design_scores_gemma":[0.00004819889,0.000023037239,0.000071622504,0.0001400411,0.000022818038,0.000057179383,0.000063889645,0.5807785,0.00042581113,0.3886267,0.029718827,0.000023427776],"about_ca_topic_score_codex":0.012144057,"about_ca_topic_score_gemma":0.011175549,"teacher_disagreement_score":0.013941203,"about_ca_system_score_codex":0.0028299422,"about_ca_system_score_gemma":0.003730373,"threshold_uncertainty_score":0.046637952},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005643455,0.0058823396,0.019017683,0.010483828,0.0088869305,0.00036821765,0.007950668,0.0129359225,0.928831],"genre_scores_gemma":[0.025893211,0.003746156,0.010104947,0.003499913,0.00093087356,0.00022397083,0.008016536,0.0031644993,0.9444199],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791783,0.0002042796,0.00010691829,0.00064049405,0.0008284662,0.00030197907],"domain_scores_gemma":[0.996693,0.00039251268,0.00021429278,0.0006759237,0.0012858291,0.0007383755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012593804,0.0014896798,0.0009761494,0.0025720359,0.0028641596,0.007175489,0.0029433975,0.003986577,0.5916217],"category_scores_gemma":[0.0043581696,0.0007636976,0.0008897523,0.0022949064,0.001240467,0.0043960414,0.004981776,0.0031757185,0.4095484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050518796,0.00015587521,0.0019054123,0.0007382049,0.000041567015,0.0011201459,0.00040788163,0.0007840096,0.0057885903,0.039356716,0.60975295,0.3394435],"study_design_scores_gemma":[0.000025413761,0.000036919297,0.00042856167,0.00010180775,0.000009097481,0.00047628544,0.0000936927,0.00033445048,0.0011112714,0.0031765236,0.9941896,0.000016325692],"about_ca_topic_score_codex":0.0036670484,"about_ca_topic_score_gemma":0.005563714,"teacher_disagreement_score":0.5916217,"about_ca_system_score_codex":0.0025172732,"about_ca_system_score_gemma":0.004178316,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30702028,0.0015277915,0.66168183,0.0013395861,0.00036395655,0.00015569026,0.00045717382,0.011472793,0.01598091],"genre_scores_gemma":[0.8140386,0.00033453293,0.1792048,0.0004348116,0.00006177924,0.00014617841,0.00047765323,0.0013107102,0.003990954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961688,0.0011624736,0.00030717382,0.0004134972,0.001159347,0.00078861386],"domain_scores_gemma":[0.9918464,0.0023608364,0.0004931469,0.0040042046,0.0009137067,0.0003817493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028246443,0.0008725043,0.0011859717,0.00065317407,0.0013597077,0.002929867,0.0035656404,0.0011096484,0.004080651],"category_scores_gemma":[0.011550939,0.00081992464,0.00071819674,0.0012324613,0.0018599312,0.0043870118,0.0038077217,0.0021252392,0.0009272334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024849866,0.00041653673,0.011919439,0.0008308079,0.00019455068,0.0006660136,0.0010809577,0.38283777,0.08380327,0.24924935,0.025951367,0.240565],"study_design_scores_gemma":[0.00017952293,0.0002242646,0.00074499834,0.00006682607,0.00005800006,0.00014170655,0.00025941196,0.8062225,0.036529187,0.13525233,0.020269936,0.000051370604],"about_ca_topic_score_codex":0.0050694896,"about_ca_topic_score_gemma":0.013728826,"teacher_disagreement_score":0.0050694896,"about_ca_system_score_codex":0.0016666419,"about_ca_system_score_gemma":0.0033956293,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1400862,0.0072302264,0.6173823,0.0022254572,0.0011846895,0.00024096043,0.0020182913,0.019436233,0.21019563],"genre_scores_gemma":[0.58169454,0.0023852496,0.21626563,0.0015190897,0.00019982793,0.00024452162,0.0024050751,0.0011440204,0.19414197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959105,0.000026197122,0.000026405336,0.0001095375,0.0001902666,0.000056469722],"domain_scores_gemma":[0.99966276,0.000057208388,0.00003373972,0.000109478206,0.00011416232,0.00002266016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020254152,0.00047801877,0.00047936715,0.00061105605,0.000622374,0.0012302605,0.0010557319,0.0008951017,0.025099203],"category_scores_gemma":[0.0008323376,0.00029920074,0.00025758,0.00074780383,0.00039018446,0.0023935088,0.00096693856,0.00087052706,0.009247537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008651149,0.00013898069,0.0018275236,0.00052967,0.00007447867,0.0008263231,0.00035513018,0.01806874,0.17486192,0.11024655,0.056151222,0.63605434],"study_design_scores_gemma":[0.00010616393,0.0005488886,0.00091950555,0.00017455549,0.000079989375,0.0017634237,0.00014990587,0.118671164,0.32178518,0.046626154,0.5090408,0.00013425396],"about_ca_topic_score_codex":0.0008445953,"about_ca_topic_score_gemma":0.0018523169,"teacher_disagreement_score":0.025099203,"about_ca_system_score_codex":0.00085974886,"about_ca_system_score_gemma":0.00067079277,"threshold_uncertainty_score":0.08396512},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014554346,0.0009444113,0.96439725,0.0006436888,0.00018363488,0.00006893615,0.00010291989,0.0016439543,0.030559748],"genre_scores_gemma":[0.04058437,0.0024552362,0.92615354,0.00043256168,0.0001608521,0.00026895327,0.00036145328,0.0011499622,0.02843304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985788,0.00047043702,0.00008335388,0.00019595797,0.0005840897,0.00008740728],"domain_scores_gemma":[0.9986714,0.00046197578,0.00007929199,0.00034476194,0.00038416343,0.000058381334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018472351,0.0010359368,0.00050945266,0.0010810606,0.0008977674,0.004214009,0.0019146886,0.001036144,0.016000038],"category_scores_gemma":[0.003163264,0.00055511127,0.00091781357,0.0012301303,0.001982868,0.004406449,0.0021475458,0.0019511889,0.0061282385],"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.00004521685,0.000030558742,0.00025913125,0.00071820384,0.000039522838,0.00012733016,0.0004157148,0.014848098,0.004830441,0.6184728,0.022243354,0.3379697],"study_design_scores_gemma":[0.000041388732,0.00008197345,0.00011337339,0.00035716817,0.000058225753,0.00032049828,0.00034085222,0.04972689,0.013375564,0.4037614,0.5317933,0.000029385836],"about_ca_topic_score_codex":0.0008119046,"about_ca_topic_score_gemma":0.0015026304,"teacher_disagreement_score":0.016000038,"about_ca_system_score_codex":0.00082193007,"about_ca_system_score_gemma":0.0017972003,"threshold_uncertainty_score":0.053525448},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121098466,0.017317528,0.6750895,0.005560616,0.0024651801,0.00036292084,0.0010533911,0.016817948,0.16023448],"genre_scores_gemma":[0.5741713,0.0056699505,0.3743498,0.0014567588,0.0004229486,0.00035754556,0.0017673958,0.0011601868,0.04064414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968624,0.00004112359,0.000018081228,0.00005108897,0.00015858558,0.00004478477],"domain_scores_gemma":[0.9996369,0.000051182324,0.000031047257,0.00010325476,0.00013828509,0.000039301874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000252105,0.00036794154,0.00040251572,0.00053109514,0.00057402713,0.0012767427,0.0010586734,0.0004922119,0.0068690754],"category_scores_gemma":[0.0010248447,0.00028417175,0.0005346253,0.0008475371,0.0004113853,0.0009530994,0.0011387902,0.0012722985,0.0021026155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005441709,0.00017472154,0.007044311,0.0008621652,0.00017850853,0.00081495394,0.0006602949,0.079974316,0.120439276,0.25112686,0.1405147,0.3976656],"study_design_scores_gemma":[0.00012075398,0.00031424378,0.0031400905,0.00017861283,0.00009729291,0.0009493428,0.00013320349,0.42507952,0.03238713,0.058456153,0.47906137,0.000082373925],"about_ca_topic_score_codex":0.0028636164,"about_ca_topic_score_gemma":0.0043245465,"teacher_disagreement_score":0.0068690754,"about_ca_system_score_codex":0.0009714674,"about_ca_system_score_gemma":0.00093088,"threshold_uncertainty_score":0.022979379},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8043745,0.00029741382,0.18846424,0.00022496589,0.000107659056,0.0002221813,0.00036350405,0.0018020894,0.0041435035],"genre_scores_gemma":[0.9778071,0.00008394671,0.01899658,0.00007707101,0.000018585524,0.00008982912,0.00026620744,0.00012467876,0.0025360363],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99874485,0.00016204115,0.00010505355,0.00012516412,0.00076525274,0.00009775328],"domain_scores_gemma":[0.99684227,0.0013608309,0.0003856906,0.0003915283,0.000930124,0.00008950508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010041182,0.00032723034,0.00053077354,0.00060768455,0.00056234875,0.00060891104,0.0007927514,0.0006351549,0.0021137896],"category_scores_gemma":[0.004996364,0.00024801365,0.00021870388,0.0008159178,0.0003454053,0.0010235622,0.0006037557,0.0004980547,0.0005806745],"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.0019243906,0.0002541161,0.015955998,0.00036238524,0.000055036333,0.00080747757,0.0011837974,0.01165356,0.8449049,0.0037589478,0.0022959928,0.11684337],"study_design_scores_gemma":[0.00011131435,0.0027105012,0.01678618,0.000040368133,0.000041709816,0.00088265457,0.00019276714,0.055759024,0.91454834,0.0012770593,0.007596009,0.00005405481],"about_ca_topic_score_codex":0.0008402634,"about_ca_topic_score_gemma":0.00090118306,"teacher_disagreement_score":0.0021137896,"about_ca_system_score_codex":0.00060322625,"about_ca_system_score_gemma":0.00040093696,"threshold_uncertainty_score":0.0070713162},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94311965,0.00032993188,0.052263107,0.00008859821,0.00003155294,0.000047822916,0.00011500174,0.00037536083,0.003628846],"genre_scores_gemma":[0.9909016,0.000033923876,0.00864557,0.000008287234,0.0000031350064,0.000016251508,0.00008129762,0.000015917218,0.00029402843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993249,0.00022048964,0.000044750654,0.00008435229,0.00022076843,0.00010469957],"domain_scores_gemma":[0.99649733,0.0018992481,0.00040019804,0.00039184472,0.00066286477,0.00014848118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012350925,0.00057956256,0.00036717558,0.0009782363,0.0003310305,0.00052637124,0.0006764237,0.00040967175,0.0011026936],"category_scores_gemma":[0.0063937563,0.00016661036,0.00030541822,0.0007923074,0.00042615467,0.0006833477,0.00048766486,0.00029256367,0.00009269236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022271831,0.000071196046,0.0053062052,0.000059711143,0.000032965818,0.000039023824,0.000031724634,0.9582214,0.003625744,0.002299837,0.0003079507,0.029781718],"study_design_scores_gemma":[0.0000067135893,0.00018229973,0.0025181305,0.000004191584,0.0000072124794,0.00001598487,0.000021991882,0.9931999,0.0028752827,0.000977074,0.00018672788,0.0000046024657],"about_ca_topic_score_codex":0.0045867087,"about_ca_topic_score_gemma":0.004288526,"teacher_disagreement_score":0.0045867087,"about_ca_system_score_codex":0.00092016323,"about_ca_system_score_gemma":0.00069321255,"threshold_uncertainty_score":0.0091199875},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031169783,0.028089067,0.45150778,0.09682749,0.14461526,0.0012767847,0.007568141,0.018854689,0.22009103],"genre_scores_gemma":[0.1290872,0.013465669,0.21134956,0.014171964,0.026416257,0.0014861837,0.0139141455,0.013586264,0.5765227],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99536777,0.000873229,0.00016510424,0.00070203975,0.0022463065,0.00064559845],"domain_scores_gemma":[0.9925775,0.00111318,0.00016523553,0.0009008533,0.0035682248,0.0016751068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010635458,0.0020233141,0.0011046717,0.0015250599,0.0017670703,0.005465917,0.0037077444,0.003090604,0.03716701],"category_scores_gemma":[0.008416065,0.0010958654,0.0012934802,0.0010294847,0.0012884093,0.003405832,0.0051161824,0.006559953,0.024545528],"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.00061500975,0.000368462,0.0006142981,0.0002682237,0.000060387436,0.00035084816,0.00015006935,0.004899665,0.007846292,0.013426395,0.82585996,0.14554048],"study_design_scores_gemma":[0.00018008288,0.00026167993,0.0010569992,0.00026624626,0.00004877366,0.000286368,0.00013939689,0.0152509175,0.020067561,0.013875613,0.94848895,0.0000774086],"about_ca_topic_score_codex":0.003067048,"about_ca_topic_score_gemma":0.007236589,"teacher_disagreement_score":0.03716701,"about_ca_system_score_codex":0.00256043,"about_ca_system_score_gemma":0.005488054,"threshold_uncertainty_score":0.124336064},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96419907,0.004493927,0.00394955,0.00020038715,0.00006502281,0.00008813004,0.016427938,0.00039209213,0.010183853],"genre_scores_gemma":[0.9792128,0.002385499,0.0022217096,0.00008014869,0.00009753318,0.000055738332,0.013932889,0.00009258665,0.0019210305],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9978551,0.0002900382,0.00034755794,0.00044824788,0.0009044526,0.00015458721],"domain_scores_gemma":[0.986019,0.003522575,0.002956924,0.001723804,0.0053320634,0.0004456552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013354905,0.00036428485,0.0003828065,0.0038419669,0.00039541136,0.00083956914,0.00037678098,0.00026907687,0.0012129898],"category_scores_gemma":[0.008261254,0.00024081272,0.00033765173,0.007399189,0.00037313023,0.0013303675,0.000473367,0.00049071637,0.0008782583],"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.00029683902,0.00012799205,0.892471,0.0004007432,0.00020898065,0.00025650818,0.00036105452,0.005445821,0.0040923664,0.0010248118,0.005032778,0.09028105],"study_design_scores_gemma":[0.000005797115,0.00040842337,0.96613353,0.00006643361,0.00008990439,0.00095341244,0.0002762392,0.003967218,0.0060058422,0.00037926264,0.021671992,0.000041846044],"about_ca_topic_score_codex":0.0028801074,"about_ca_topic_score_gemma":0.00273095,"teacher_disagreement_score":0.0038419669,"about_ca_system_score_codex":0.00068039907,"about_ca_system_score_gemma":0.0004031507,"threshold_uncertainty_score":0.007062793},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014092555,0.00025555058,0.964352,0.00035255117,0.00011929251,0.00025348668,0.00009818483,0.013985922,0.0064904317],"genre_scores_gemma":[0.38327575,0.00032855914,0.60070693,0.0012632562,0.00015849929,0.0007492612,0.00037182722,0.0018704336,0.011275481],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99818486,0.0003096394,0.00017702757,0.00044457827,0.0005976225,0.00028630302],"domain_scores_gemma":[0.9968988,0.0004499506,0.00039496896,0.001153634,0.0008545873,0.00024801673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015597051,0.0008121336,0.0007068181,0.00084536464,0.0007745369,0.0020152607,0.0023788817,0.0011392583,0.005739823],"category_scores_gemma":[0.0038649878,0.0009052843,0.0005037534,0.00045594,0.001019226,0.0027622064,0.0025016398,0.0017662959,0.002660174],"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.0014786731,0.00087873824,0.011299367,0.0015362151,0.00027353616,0.0007872047,0.002194309,0.03910093,0.19760916,0.19863684,0.03586594,0.51033914],"study_design_scores_gemma":[0.00030201336,0.0019059101,0.004494417,0.0003029071,0.0006048424,0.002063454,0.00026298486,0.3980028,0.2461962,0.060257748,0.28533226,0.00027452866],"about_ca_topic_score_codex":0.00052439386,"about_ca_topic_score_gemma":0.000702722,"teacher_disagreement_score":0.005739823,"about_ca_system_score_codex":0.0008732766,"about_ca_system_score_gemma":0.0014940298,"threshold_uncertainty_score":0.019201696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009774821,0.000060967843,0.9957908,0.000053974352,0.000050887855,0.000041117866,0.000021265634,0.00146038,0.0015432155],"genre_scores_gemma":[0.039439715,0.00016968598,0.95588034,0.00013953583,0.0000642741,0.0001638291,0.00013515636,0.0007359493,0.0032715285],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939716,0.000102139966,0.000042052492,0.00008299415,0.00028537476,0.000090341906],"domain_scores_gemma":[0.9993488,0.000103174214,0.00004103333,0.00019130604,0.00025981021,0.00005591619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067922665,0.0010029414,0.0007232295,0.00090174185,0.0005897875,0.0013005857,0.0023088437,0.00093990937,0.0057778736],"category_scores_gemma":[0.0021769872,0.00048871845,0.001112715,0.000638882,0.00076027785,0.0013606559,0.0017308351,0.0023160405,0.0023949086],"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.00017991323,0.00045086423,0.0009503813,0.0004256522,0.00011092593,0.00039914125,0.00038030863,0.18051894,0.04738575,0.27952886,0.020586725,0.46908256],"study_design_scores_gemma":[0.000055601173,0.00015445949,0.00025978545,0.000046687474,0.000031340034,0.0003564907,0.000044832545,0.8423101,0.023702959,0.08103517,0.051964488,0.00003817989],"about_ca_topic_score_codex":0.0035021587,"about_ca_topic_score_gemma":0.004596529,"teacher_disagreement_score":0.0057778736,"about_ca_system_score_codex":0.00081219827,"about_ca_system_score_gemma":0.001421049,"threshold_uncertainty_score":0.019328892},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012759411,0.0008224316,0.6928585,0.00049763307,0.00043276112,0.00037950886,0.006138754,0.2636136,0.022497343],"genre_scores_gemma":[0.051910292,0.0009745705,0.8122929,0.0006611931,0.00011683458,0.0010814613,0.018970823,0.08341411,0.030577846],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99863404,0.00021146603,0.00015643064,0.00018515348,0.0006596561,0.00015320792],"domain_scores_gemma":[0.9975673,0.000921845,0.00024490035,0.0002664932,0.0008758083,0.0001237189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011989682,0.0014281023,0.0006323378,0.0011419186,0.00044600727,0.0016554703,0.0023265823,0.00074829994,0.031970307],"category_scores_gemma":[0.0059725232,0.0011319547,0.00095509144,0.0008241695,0.0005147588,0.002011213,0.0019070205,0.0022016075,0.026370555],"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.0011781759,0.0002911509,0.004229782,0.001822532,0.00017104768,0.0011362302,0.0011370009,0.044594396,0.046043117,0.059955176,0.4352114,0.40423012],"study_design_scores_gemma":[0.00037293363,0.00024997734,0.0016844444,0.00040658648,0.00006506103,0.00083435717,0.00022353484,0.16838269,0.113690615,0.019779878,0.6941456,0.00016433863],"about_ca_topic_score_codex":0.0011509473,"about_ca_topic_score_gemma":0.0016792854,"teacher_disagreement_score":0.031970307,"about_ca_system_score_codex":0.00069614773,"about_ca_system_score_gemma":0.0022948168,"threshold_uncertainty_score":0.1069513},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33772215,0.0014869196,0.6443861,0.0005550064,0.00011197776,0.00013033673,0.00021285505,0.0061406284,0.009254051],"genre_scores_gemma":[0.7497641,0.00017227467,0.24701545,0.00009934236,0.000028082117,0.000051195715,0.00024360047,0.0003680482,0.0022578973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998689,0.0003643112,0.00009136637,0.00019940021,0.0004173488,0.00023858526],"domain_scores_gemma":[0.99794096,0.0009878502,0.00031820283,0.00032453763,0.00031890007,0.00010947115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012046334,0.0007724105,0.00090177875,0.001868399,0.0006714176,0.0012793654,0.0012465827,0.0006467834,0.002310018],"category_scores_gemma":[0.003891313,0.0004262107,0.0006925767,0.0014888239,0.0006997245,0.0013938906,0.00095765194,0.0007098114,0.0004871963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046561527,0.00016040518,0.0052652275,0.00010113571,0.00007467798,0.000137763,0.00011325905,0.7685713,0.008747322,0.010921959,0.0031834904,0.2022578],"study_design_scores_gemma":[0.000021675032,0.000053692485,0.00042591765,0.000008640095,0.000015972337,0.000036489913,0.000021511092,0.9913202,0.003975435,0.0033575078,0.00075107557,0.000011771492],"about_ca_topic_score_codex":0.0054482697,"about_ca_topic_score_gemma":0.0074720467,"teacher_disagreement_score":0.0054482697,"about_ca_system_score_codex":0.0020839742,"about_ca_system_score_gemma":0.0028295738,"threshold_uncertainty_score":0.0151203275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01727317,0.00037885742,0.5678948,0.00035896362,0.00063250156,0.00040396774,0.003466963,0.3859704,0.023620266],"genre_scores_gemma":[0.21144451,0.0006170662,0.57468796,0.0014987298,0.00044406613,0.0017415538,0.025917495,0.16154371,0.022104949],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791163,0.00023170008,0.00016807514,0.00035531458,0.0010066319,0.0003266161],"domain_scores_gemma":[0.9956267,0.0009303255,0.0003081398,0.0011572652,0.0017255092,0.00025209863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015345679,0.0017164937,0.00077754306,0.00123944,0.00077658636,0.001941877,0.0046043484,0.0011553189,0.017007219],"category_scores_gemma":[0.007688441,0.0010979285,0.0011690158,0.00095920026,0.001010375,0.0018952984,0.0027823178,0.0028439101,0.009203094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017421992,0.0006152176,0.009973705,0.0017454695,0.0003525288,0.0013759393,0.0010417582,0.070497125,0.05821168,0.061498392,0.42841083,0.36453518],"study_design_scores_gemma":[0.00036740987,0.00030831827,0.0054511377,0.00030448806,0.00015820573,0.00055335625,0.00016274385,0.39943016,0.13407561,0.029532634,0.42928016,0.00037593],"about_ca_topic_score_codex":0.008665928,"about_ca_topic_score_gemma":0.007905938,"teacher_disagreement_score":0.017007219,"about_ca_system_score_codex":0.0016451558,"about_ca_system_score_gemma":0.0026604724,"threshold_uncertainty_score":0.05689484},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072097695,0.10264496,0.42248243,0.006693454,0.0055575655,0.00040577815,0.0010713075,0.009210541,0.44472426],"genre_scores_gemma":[0.123044915,0.13355865,0.31643867,0.002166499,0.0051724277,0.0005312235,0.002519107,0.004199383,0.41236916],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952674,0.000040612857,0.000010526637,0.000063818516,0.0003189852,0.000039430433],"domain_scores_gemma":[0.99985385,0.00003865901,0.0000087523595,0.000027741906,0.000036515044,0.00003459101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024730217,0.0010989022,0.0005701613,0.0009169731,0.0009334752,0.0022567261,0.0015851491,0.0007226536,0.014577633],"category_scores_gemma":[0.00045588592,0.00044205473,0.00023713463,0.0030673207,0.0010223128,0.002554193,0.0014229896,0.0013972437,0.00877411],"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.00007724137,0.000044697397,0.00023328178,0.0007391745,0.000025389381,0.00017867624,0.00028354363,0.0068900613,0.006167282,0.18957593,0.4874853,0.30829948],"study_design_scores_gemma":[0.000015500706,0.000027710477,0.0002705521,0.00013435606,0.000010373151,0.00041441753,0.000071525275,0.009320003,0.0021796997,0.050952174,0.9365793,0.00002431706],"about_ca_topic_score_codex":0.0014261378,"about_ca_topic_score_gemma":0.0022084706,"teacher_disagreement_score":0.014577633,"about_ca_system_score_codex":0.00095321285,"about_ca_system_score_gemma":0.0013485915,"threshold_uncertainty_score":0.04876703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033054933,0.00013022748,0.96267086,0.00006723121,0.000018772142,0.000061919105,0.000025887946,0.0015074646,0.0024626055],"genre_scores_gemma":[0.32624504,0.000096420335,0.6704696,0.0000545027,0.000018369723,0.0001438411,0.00007580913,0.0002541473,0.0026422667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996829,0.00006564569,0.00003360293,0.00005235338,0.00011994511,0.000045571334],"domain_scores_gemma":[0.9994898,0.00018664093,0.00008806882,0.00014417186,0.00007060969,0.000020664616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005007331,0.00038577832,0.00022532888,0.00046737748,0.00037473807,0.0004705319,0.0007371065,0.00022825104,0.002983853],"category_scores_gemma":[0.00097258977,0.00030018616,0.00041950133,0.0003008744,0.00044655983,0.0005510038,0.0004928018,0.00063910283,0.00043005275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036019264,0.00018521714,0.002630114,0.00049083156,0.000080690515,0.00033742536,0.000550686,0.2438466,0.2688096,0.064614825,0.0026866423,0.4154072],"study_design_scores_gemma":[0.00013155308,0.0004937314,0.0008206783,0.00003772572,0.000063357715,0.00015567122,0.000074950396,0.8150281,0.15202181,0.014748371,0.016394563,0.000029541785],"about_ca_topic_score_codex":0.000887626,"about_ca_topic_score_gemma":0.0017207855,"teacher_disagreement_score":0.002983853,"about_ca_system_score_codex":0.00063783716,"about_ca_system_score_gemma":0.0006745266,"threshold_uncertainty_score":0.00998193},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029502148,0.00022264736,0.9754837,0.00009302219,0.00008027399,0.00021553213,0.00010252798,0.01411109,0.0067409705],"genre_scores_gemma":[0.028619522,0.0004981449,0.9487993,0.00018114617,0.000091703456,0.0005616267,0.0007723881,0.0032640737,0.017212102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994215,0.00011803517,0.00005786027,0.0001177085,0.000229974,0.00005496794],"domain_scores_gemma":[0.99948335,0.00016443715,0.000036785135,0.00015317816,0.00009693847,0.00006515805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008962341,0.0008321806,0.0006124352,0.00057523587,0.00095923856,0.0016908556,0.0021411516,0.0009730871,0.009460151],"category_scores_gemma":[0.0013080686,0.0007526747,0.0007818096,0.0006302963,0.0009844783,0.0018315868,0.0017182628,0.002417366,0.0052520935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004443806,0.00028222235,0.0013037338,0.0011386735,0.00011688273,0.0011064055,0.0018464703,0.035128273,0.104232095,0.29541832,0.06563767,0.4933449],"study_design_scores_gemma":[0.0003886918,0.00045483647,0.0012643303,0.00029803,0.00012941605,0.0022793447,0.00012104665,0.22495373,0.0518095,0.07056381,0.64759743,0.00013987768],"about_ca_topic_score_codex":0.00090921886,"about_ca_topic_score_gemma":0.0010186533,"teacher_disagreement_score":0.009460151,"about_ca_system_score_codex":0.00044438653,"about_ca_system_score_gemma":0.0014617174,"threshold_uncertainty_score":0.031647384},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05780363,0.000716838,0.9028064,0.00030907273,0.000118239994,0.00014291152,0.00017160212,0.02087883,0.017052516],"genre_scores_gemma":[0.47289005,0.00064082176,0.5147614,0.00025371896,0.000043614036,0.00025521897,0.00061846693,0.0024871158,0.008049577],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932635,0.00015138308,0.00004826024,0.000076659955,0.00026521803,0.00013224434],"domain_scores_gemma":[0.99892277,0.0004146465,0.00009126817,0.0001907873,0.00031322418,0.00006732337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009467427,0.00077849283,0.00042184346,0.00094009977,0.0004999652,0.0012750833,0.0024643992,0.0008644299,0.008113457],"category_scores_gemma":[0.0023854668,0.0005113208,0.00055512163,0.0008178857,0.00062812306,0.0020817996,0.0011932657,0.0007776746,0.002019502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002174094,0.0005723047,0.008186569,0.0019728844,0.00021427304,0.0016700418,0.0012628825,0.21321519,0.086312115,0.1204492,0.031220954,0.5327495],"study_design_scores_gemma":[0.0003575478,0.00080364215,0.0012128202,0.00022266973,0.00008989466,0.0005452233,0.0002936646,0.80940753,0.07151178,0.029325087,0.08612006,0.00011011078],"about_ca_topic_score_codex":0.0024602683,"about_ca_topic_score_gemma":0.0032219666,"teacher_disagreement_score":0.008113457,"about_ca_system_score_codex":0.0008429098,"about_ca_system_score_gemma":0.00089955353,"threshold_uncertainty_score":0.027142167},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1310958,0.0208302,0.79916227,0.0049312254,0.00094245747,0.00012501661,0.00012387488,0.00065216975,0.04213706],"genre_scores_gemma":[0.9299045,0.0039169574,0.05751222,0.00060424366,0.00052142196,0.00018121036,0.000072649294,0.0001527508,0.0071340585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99651957,0.0009437425,0.00017223567,0.0006112944,0.0012531946,0.0004999857],"domain_scores_gemma":[0.99210054,0.005279425,0.0006338718,0.0010021197,0.00078155386,0.00020248517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029793682,0.0004997429,0.0007295072,0.0009180064,0.0013532632,0.0020611226,0.0011044508,0.0010444212,0.001347744],"category_scores_gemma":[0.011909712,0.0007759646,0.0007331081,0.0006283024,0.0036309217,0.0033024065,0.0021582444,0.0031978393,0.00029438123],"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.00038915605,0.000067020985,0.0026528826,0.00036275596,0.000048094655,0.0003664937,0.0005356262,0.124805175,0.008520662,0.81332886,0.0022072804,0.046716046],"study_design_scores_gemma":[0.000038667764,0.00014082046,0.0010213822,0.00013198073,0.00003674369,0.00022136827,0.00007202674,0.27041876,0.0064212936,0.7087831,0.012654271,0.000059584163],"about_ca_topic_score_codex":0.001909525,"about_ca_topic_score_gemma":0.0016893061,"teacher_disagreement_score":0.0029793682,"about_ca_system_score_codex":0.0017135532,"about_ca_system_score_gemma":0.0018245504,"threshold_uncertainty_score":0.015756607},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22574197,0.04676338,0.5163102,0.003702082,0.0012205563,0.0003531357,0.0022810441,0.025300805,0.17832677],"genre_scores_gemma":[0.80677485,0.0037729072,0.13234574,0.0013562217,0.00021193096,0.00022140554,0.0015986338,0.0014864077,0.052231774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997445,0.000033776832,0.000010095817,0.00004642074,0.00009227114,0.000072972434],"domain_scores_gemma":[0.99968815,0.0000712999,0.000022711492,0.000091409725,0.00009510258,0.000031305983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018605147,0.00073070946,0.00043357717,0.00037260447,0.00067802763,0.001263596,0.0023244536,0.0006107943,0.009716612],"category_scores_gemma":[0.0007902368,0.00039603925,0.00035160902,0.0010892214,0.00032691166,0.0016799842,0.0010536787,0.0010407706,0.0016953939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014408936,0.0003250507,0.0021124352,0.0013397178,0.00017493415,0.0003594864,0.0005259493,0.10910438,0.07411451,0.06503734,0.15289158,0.59257376],"study_design_scores_gemma":[0.00028775597,0.000710938,0.0020690856,0.00029244603,0.00028995785,0.0006368764,0.00034292272,0.58217555,0.116932794,0.07082238,0.22530504,0.00013419776],"about_ca_topic_score_codex":0.0044773873,"about_ca_topic_score_gemma":0.0143544255,"teacher_disagreement_score":0.009716612,"about_ca_system_score_codex":0.0013425037,"about_ca_system_score_gemma":0.001530565,"threshold_uncertainty_score":0.032505274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020660799,0.00043991138,0.9656839,0.0002079499,0.00015774286,0.000074956115,0.000094322546,0.0020426812,0.010637824],"genre_scores_gemma":[0.20015606,0.00051809644,0.78435344,0.00026379232,0.00010535579,0.00023713331,0.0006000337,0.0018287154,0.0119374255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999416,0.00016540148,0.00003181016,0.00005647448,0.00022341225,0.00010698347],"domain_scores_gemma":[0.9991135,0.0003651344,0.000088485125,0.0001475196,0.0002227896,0.00006252924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006920129,0.0010471656,0.00088450476,0.0005844468,0.00062885234,0.00075541786,0.0009583507,0.0005837565,0.006480933],"category_scores_gemma":[0.0021857095,0.0003923867,0.00053867546,0.00065932865,0.00067701226,0.00081029074,0.00078837556,0.0013230174,0.0022765615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063488865,0.00033265693,0.0011731627,0.00039776304,0.00007225864,0.0003249988,0.00035197916,0.4855049,0.064114176,0.121575505,0.01935375,0.306164],"study_design_scores_gemma":[0.00004479264,0.00009165033,0.00013334089,0.000023310187,0.000014327638,0.00006428683,0.000036731715,0.9570467,0.017495517,0.014230199,0.010802401,0.000016751665],"about_ca_topic_score_codex":0.005058858,"about_ca_topic_score_gemma":0.0079029165,"teacher_disagreement_score":0.006480933,"about_ca_system_score_codex":0.000712736,"about_ca_system_score_gemma":0.0014609082,"threshold_uncertainty_score":0.021680892},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8824687,0.0016667388,0.09757751,0.00021919054,0.0001890788,0.00014642654,0.00023959082,0.010109648,0.0073831803],"genre_scores_gemma":[0.94595414,0.00015828203,0.051958576,0.000053403448,0.0000168674,0.000057399855,0.0003439175,0.00039651684,0.0010608721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972459,0.0009134548,0.0001740188,0.0003034163,0.0009572997,0.00040583784],"domain_scores_gemma":[0.99201024,0.00431392,0.00047415105,0.0010128552,0.00183956,0.00034925612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028861596,0.0012816901,0.00064870703,0.0010597475,0.00046691572,0.0011557186,0.0031197101,0.00078343577,0.0026809587],"category_scores_gemma":[0.0085207205,0.00034607324,0.00050317653,0.0009686461,0.00083656015,0.0022453365,0.001185404,0.0007839145,0.00038886842],"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.00485545,0.0011790987,0.009502979,0.001175622,0.00026307403,0.0004936926,0.00033127208,0.7045101,0.042510837,0.010405882,0.0068389447,0.21793303],"study_design_scores_gemma":[0.0001939666,0.0012106091,0.0017266339,0.000028762784,0.00005145783,0.00006877805,0.000106091305,0.9684409,0.024497041,0.0014922001,0.002154639,0.000029005907],"about_ca_topic_score_codex":0.0073437444,"about_ca_topic_score_gemma":0.0066291164,"teacher_disagreement_score":0.0073437444,"about_ca_system_score_codex":0.0013963266,"about_ca_system_score_gemma":0.0012602307,"threshold_uncertainty_score":0.015263677},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9941203,0.0000612754,0.0042333007,0.00004118924,0.000010725239,0.000040335213,0.00045596008,0.00028965675,0.0007471767],"genre_scores_gemma":[0.9920027,0.00007391352,0.006362696,0.000028506964,0.000008118063,0.000053021864,0.0010880439,0.000051195177,0.00033187214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994019,0.00009236875,0.000055027176,0.00011513645,0.00021984731,0.00011571547],"domain_scores_gemma":[0.9984951,0.0006312723,0.0001063314,0.00025856413,0.0004349166,0.000073821604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039043408,0.0006025505,0.0003581562,0.00085346686,0.0006473985,0.00062382873,0.00070325297,0.00046348877,0.00068657275],"category_scores_gemma":[0.002527567,0.00022976768,0.00036174915,0.0016412032,0.0003837078,0.000897159,0.00041234406,0.0005392737,0.00018679984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015499174,0.0017184793,0.15675749,0.0008173823,0.00037524858,0.0016701341,0.0016847067,0.3856259,0.30676973,0.0043731737,0.008134368,0.13052356],"study_design_scores_gemma":[0.000050393166,0.0012214842,0.06012875,0.000020743615,0.00006766659,0.0003470569,0.00084283325,0.77605593,0.15630615,0.0015316082,0.003365384,0.00006203001],"about_ca_topic_score_codex":0.004181954,"about_ca_topic_score_gemma":0.00706088,"teacher_disagreement_score":0.004181954,"about_ca_system_score_codex":0.00078143645,"about_ca_system_score_gemma":0.0006073777,"threshold_uncertainty_score":0.008315206},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019378528,0.0004791552,0.6320801,0.0018013162,0.0005343584,0.0017134873,0.008119203,0.31960666,0.016287168],"genre_scores_gemma":[0.24370672,0.0006018791,0.6372669,0.0013653669,0.00023009605,0.005433973,0.03278997,0.069589496,0.0090156635],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9746056,0.009724885,0.0019687882,0.004317257,0.008043054,0.0013403931],"domain_scores_gemma":[0.9521503,0.015293757,0.002110322,0.023613168,0.004622922,0.0022094736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024618147,0.0021297743,0.0021115055,0.0025374289,0.001213106,0.0045878147,0.008815679,0.0016319645,0.020288523],"category_scores_gemma":[0.043336473,0.001770196,0.0016983473,0.002843902,0.0025657888,0.007911494,0.008558767,0.00561823,0.010608913],"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.007374956,0.0026825273,0.012483485,0.0030142807,0.0009760521,0.0013699428,0.0026181533,0.09623821,0.057157133,0.08694759,0.35475874,0.37437892],"study_design_scores_gemma":[0.002006329,0.0010177891,0.005725706,0.00043897497,0.00018283316,0.00034986308,0.0004528443,0.5195968,0.06289583,0.10459156,0.3023066,0.00043480453],"about_ca_topic_score_codex":0.001961838,"about_ca_topic_score_gemma":0.0015354824,"teacher_disagreement_score":0.024618147,"about_ca_system_score_codex":0.0016748026,"about_ca_system_score_gemma":0.0035985867,"threshold_uncertainty_score":0.13019478},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21689111,0.00025627218,0.76902205,0.0003907766,0.0001668699,0.00016917005,0.000119467244,0.007526055,0.005458239],"genre_scores_gemma":[0.8790271,0.00010659216,0.117751904,0.000098962,0.000047672147,0.0001029309,0.00022177062,0.0007064315,0.0019366335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99028325,0.0033259117,0.00060925755,0.0013474432,0.0032231905,0.0012109892],"domain_scores_gemma":[0.9518195,0.027308201,0.004476041,0.012779037,0.0031531618,0.00046407105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056279534,0.0007525284,0.001117832,0.0011439152,0.0017321158,0.0034816787,0.0026853664,0.0020277114,0.0015493392],"category_scores_gemma":[0.041285057,0.0011931156,0.00072954124,0.0010984129,0.0040687616,0.0053196177,0.0046627764,0.0029828714,0.00046971356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020435231,0.000509354,0.036148373,0.00067028194,0.00018430223,0.0012369385,0.0036152294,0.29325238,0.05677727,0.35999748,0.005385443,0.2401794],"study_design_scores_gemma":[0.00007134515,0.00017450342,0.002312698,0.00011059073,0.00008348989,0.0003376008,0.00036872385,0.7584,0.09010262,0.14172085,0.006244895,0.00007264679],"about_ca_topic_score_codex":0.0021098685,"about_ca_topic_score_gemma":0.002337033,"teacher_disagreement_score":0.0056279534,"about_ca_system_score_codex":0.0014531604,"about_ca_system_score_gemma":0.0029045797,"threshold_uncertainty_score":0.029763877},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76045775,0.0024354155,0.22932746,0.0004095325,0.00006194126,0.000028866358,0.000040638537,0.0015929346,0.0056454292],"genre_scores_gemma":[0.9455995,0.00046379885,0.052275553,0.000034409913,0.000028598133,0.000015963351,0.00005477319,0.000058277685,0.0014691747],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999863,0.000050317798,0.000008388468,0.000016728085,0.00003443285,0.000027111326],"domain_scores_gemma":[0.99959177,0.000113885966,0.00008561963,0.00009267644,0.00009848181,0.000017541848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023949658,0.00030314765,0.00018516535,0.00041978693,0.00027667996,0.00044624944,0.0003877052,0.00023361424,0.00080305414],"category_scores_gemma":[0.00059036625,0.000164753,0.0001426088,0.0006781142,0.00020199361,0.0009682406,0.00029372098,0.0003375563,0.00017422292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048510396,0.0002930382,0.0075351945,0.00047259295,0.00013141641,0.0004407072,0.0004801222,0.23423325,0.51134664,0.01430819,0.0032518173,0.22702187],"study_design_scores_gemma":[0.000071774375,0.0013984245,0.0035951042,0.000058329897,0.0001682666,0.0004630323,0.00017591055,0.73867816,0.23481958,0.003249849,0.017265167,0.000056429595],"about_ca_topic_score_codex":0.0007728983,"about_ca_topic_score_gemma":0.0029093565,"teacher_disagreement_score":0.00080305414,"about_ca_system_score_codex":0.0002557054,"about_ca_system_score_gemma":0.00029903275,"threshold_uncertainty_score":0.0026865005},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83204925,0.0007057537,0.14792532,0.0003090774,0.00007057645,0.00016163167,0.00024782165,0.007475908,0.011054601],"genre_scores_gemma":[0.9329692,0.00010623316,0.06533337,0.00008899219,0.000011689889,0.00009208869,0.00023443993,0.0006684526,0.00049544766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989022,0.00032067148,0.00006163349,0.0002181609,0.00028302587,0.00021421628],"domain_scores_gemma":[0.99772066,0.0011205735,0.00017911213,0.00052873674,0.00032623982,0.00012463231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001221054,0.001242354,0.001069355,0.0010788646,0.0007020737,0.0011854945,0.0018514197,0.00077002164,0.0019452132],"category_scores_gemma":[0.0062392927,0.00048087325,0.00047832643,0.00091792893,0.0008328481,0.001247886,0.0010239015,0.00097145763,0.0005136668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007093992,0.00044155036,0.009909684,0.00029043923,0.0001455065,0.00021650035,0.00042324324,0.7237512,0.055464514,0.0037732795,0.003095898,0.20177875],"study_design_scores_gemma":[0.00007364789,0.00016210673,0.001390766,0.00002144024,0.000025265042,0.00004361642,0.000121592406,0.96835494,0.025093684,0.0029524378,0.0017266502,0.000033858345],"about_ca_topic_score_codex":0.0023569344,"about_ca_topic_score_gemma":0.0031472042,"teacher_disagreement_score":0.0023569344,"about_ca_system_score_codex":0.0008675783,"about_ca_system_score_gemma":0.0012051511,"threshold_uncertainty_score":0.0065074563},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13158473,0.00080779614,0.8300424,0.00063293823,0.00033379783,0.0002283288,0.00066396,0.015395276,0.020310817],"genre_scores_gemma":[0.6971266,0.00036445705,0.29335892,0.00020224034,0.00008862145,0.00012986755,0.0010190606,0.00030081376,0.0074094455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987614,0.000014835574,0.0000068745667,0.0000346942,0.00004794493,0.000019542213],"domain_scores_gemma":[0.999843,0.000028115497,0.000012860826,0.000039096165,0.00004661218,0.00003028938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024525746,0.0003175978,0.00019333701,0.00029194565,0.00036754753,0.00061906996,0.00080189516,0.00019484862,0.004596088],"category_scores_gemma":[0.00033167205,0.00018587665,0.00026078173,0.00027877657,0.00028087592,0.0005862564,0.0005132677,0.00037367106,0.00074937503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001135789,0.0004552086,0.008064618,0.00041343624,0.00016957028,0.0010666653,0.00033126035,0.24647067,0.18290496,0.040433656,0.06637551,0.45217863],"study_design_scores_gemma":[0.00021123269,0.00049850583,0.0025185025,0.00005285422,0.000051007188,0.00033202974,0.0000847394,0.8522488,0.0756166,0.016820027,0.05150108,0.00006467274],"about_ca_topic_score_codex":0.0022337225,"about_ca_topic_score_gemma":0.003913779,"teacher_disagreement_score":0.004596088,"about_ca_system_score_codex":0.0004481009,"about_ca_system_score_gemma":0.00059090834,"threshold_uncertainty_score":0.015375435},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92634815,0.0017796934,0.041323334,0.00044218844,0.0001263227,0.00014545368,0.0020981687,0.0011068566,0.0266298],"genre_scores_gemma":[0.9906465,0.00034582755,0.006777161,0.000025822153,0.000009231747,0.00008043442,0.0007642629,0.000040388615,0.0013105028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992489,0.00026492873,0.00005032201,0.00007914355,0.0002098595,0.00014680554],"domain_scores_gemma":[0.9967722,0.0021149889,0.00018305419,0.00021043967,0.0006495191,0.00006972294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000793162,0.0005735453,0.00048913766,0.0007178591,0.00033610195,0.0005576956,0.00081126584,0.00057922513,0.002384382],"category_scores_gemma":[0.003203607,0.00020844837,0.0004244504,0.001201553,0.00027304114,0.0006554964,0.0002869561,0.0006069729,0.00022617393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023362423,0.00015157745,0.0034629866,0.00017333071,0.00006318219,0.000067015324,0.0000575485,0.98006815,0.004030522,0.002781118,0.0013269655,0.007584094],"study_design_scores_gemma":[0.00001678017,0.00011382289,0.0009037886,0.000008851995,0.000018073368,0.000015591362,0.000024269562,0.9954888,0.0022956473,0.00038135058,0.0007260473,0.000006988481],"about_ca_topic_score_codex":0.009433999,"about_ca_topic_score_gemma":0.005049883,"teacher_disagreement_score":0.009433999,"about_ca_system_score_codex":0.0008932303,"about_ca_system_score_gemma":0.0007185586,"threshold_uncertainty_score":0.018758118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20274967,0.0025978049,0.73139614,0.0012099177,0.00059934694,0.00019581293,0.00029918592,0.015578567,0.045373607],"genre_scores_gemma":[0.81558293,0.00089985604,0.16977048,0.00071588805,0.00013064685,0.0001459137,0.0002932993,0.00040028762,0.012060633],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996891,0.00004740976,0.00001271591,0.000049808164,0.0001419796,0.000059067377],"domain_scores_gemma":[0.99951184,0.00005780522,0.000048058,0.00020952731,0.00014661258,0.000026298449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002000312,0.00042399124,0.00025599007,0.0003954059,0.00040207067,0.0012312939,0.0017545477,0.0004965125,0.0025078477],"category_scores_gemma":[0.00060345395,0.00024614367,0.000328808,0.00044963165,0.0005032888,0.0012172167,0.00083107315,0.0007109484,0.0007540937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002989256,0.00039263058,0.0058945697,0.0005532234,0.00016028207,0.0006850689,0.00061401393,0.1291148,0.39344463,0.112358525,0.020306073,0.3361772],"study_design_scores_gemma":[0.000046488185,0.0007426259,0.0026025958,0.00009059494,0.00011920456,0.0006667059,0.00031573293,0.5176221,0.34544647,0.021194888,0.11104562,0.0001069238],"about_ca_topic_score_codex":0.0011496859,"about_ca_topic_score_gemma":0.0020189052,"teacher_disagreement_score":0.0025078477,"about_ca_system_score_codex":0.000579817,"about_ca_system_score_gemma":0.00083760655,"threshold_uncertainty_score":0.008389533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09586866,0.00057979574,0.7570893,0.00020402747,0.0002680644,0.00047596643,0.00044915275,0.13342166,0.011643271],"genre_scores_gemma":[0.6918069,0.00039945717,0.26833642,0.0010138317,0.00022288837,0.00063327514,0.0023272075,0.013908905,0.021351114],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843866,0.0002169907,0.00018592582,0.00021143556,0.0007543365,0.00019261177],"domain_scores_gemma":[0.99646735,0.0008988802,0.00036395795,0.0012769689,0.00073075027,0.00026203887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011640537,0.0010059079,0.00060701853,0.00051309547,0.000721016,0.0017273526,0.0027485774,0.0007638839,0.006991096],"category_scores_gemma":[0.0044707013,0.00071217417,0.0005402556,0.00051646965,0.0007787614,0.0023369163,0.0019573309,0.002417796,0.0024302711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003318805,0.0017037643,0.02165042,0.0017269286,0.00024158144,0.0013490635,0.0012174378,0.03199882,0.42383853,0.06290525,0.070250966,0.3797984],"study_design_scores_gemma":[0.00043818066,0.0009894384,0.011737686,0.00019835652,0.00022687834,0.001389096,0.00011842567,0.32253182,0.4815107,0.012824546,0.16770564,0.0003291626],"about_ca_topic_score_codex":0.0011511056,"about_ca_topic_score_gemma":0.0013229758,"teacher_disagreement_score":0.006991096,"about_ca_system_score_codex":0.0008930648,"about_ca_system_score_gemma":0.0014695002,"threshold_uncertainty_score":0.023387492},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033166546,0.0004453877,0.93868214,0.00039885024,0.00015379788,0.00012796486,0.0001024335,0.006424786,0.02049807],"genre_scores_gemma":[0.36691225,0.00032474208,0.61709243,0.00042756947,0.00006960317,0.00016568764,0.0003012145,0.0012676707,0.013438871],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941814,0.000089607405,0.00003399291,0.00009612775,0.00025411742,0.000108043365],"domain_scores_gemma":[0.99884295,0.00032197376,0.0000623789,0.0005129928,0.00017695635,0.00008277239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060848787,0.0007105478,0.0006972413,0.0006076234,0.0006025539,0.0012723985,0.0017289806,0.00078279886,0.0046536275],"category_scores_gemma":[0.0014164627,0.0004934389,0.00066232396,0.0008376888,0.0009966509,0.0017286005,0.0019827357,0.0020626169,0.0015006298],"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.00097038416,0.0007053208,0.002196877,0.00052413694,0.0001318372,0.0006520277,0.0006212698,0.09680902,0.22699611,0.19877468,0.016460516,0.4551578],"study_design_scores_gemma":[0.00018817437,0.0004647165,0.0008003159,0.000059203674,0.00010656885,0.00055243314,0.00014897462,0.7519396,0.08097763,0.124989815,0.03968026,0.000092254566],"about_ca_topic_score_codex":0.00080984074,"about_ca_topic_score_gemma":0.0022137845,"teacher_disagreement_score":0.0046536275,"about_ca_system_score_codex":0.00050211366,"about_ca_system_score_gemma":0.001036614,"threshold_uncertainty_score":0.015567958},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36590838,0.0037281686,0.49349606,0.0013186658,0.00081055064,0.00023105562,0.0008295334,0.009542285,0.124135226],"genre_scores_gemma":[0.8528951,0.00048675266,0.08162521,0.00040373002,0.00011080859,0.000097923556,0.0007915218,0.00022126695,0.063367635],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998584,0.00000879931,0.000010773955,0.000032657663,0.00005900581,0.000030383584],"domain_scores_gemma":[0.9998485,0.000015444353,0.000014196493,0.000030358027,0.0000742238,0.000017209288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007840528,0.0002956156,0.00023725336,0.00033496477,0.00028823165,0.00061849115,0.00057921495,0.0002788138,0.00993217],"category_scores_gemma":[0.00034618098,0.00015173078,0.00013708863,0.00033682448,0.00009992241,0.00072007556,0.0005613771,0.0004968655,0.002556903],"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.0016619494,0.0007141824,0.003195936,0.0005840533,0.00008448282,0.0010371358,0.00017642946,0.029108888,0.30823794,0.026659235,0.048419755,0.5801201],"study_design_scores_gemma":[0.00039644874,0.0013499389,0.0031971966,0.00009496942,0.00016285646,0.002307,0.00016840563,0.5616347,0.258433,0.019192507,0.15297934,0.00008350808],"about_ca_topic_score_codex":0.0003012889,"about_ca_topic_score_gemma":0.0006991586,"teacher_disagreement_score":0.00993217,"about_ca_system_score_codex":0.00019006887,"about_ca_system_score_gemma":0.0004238132,"threshold_uncertainty_score":0.03322637},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30796793,0.0004674838,0.67368835,0.00029453033,0.00007976393,0.00014819353,0.00016153837,0.011549103,0.005643195],"genre_scores_gemma":[0.71757203,0.00022041705,0.27712923,0.00014674975,0.000020202786,0.00012502233,0.00020805017,0.0011490587,0.0034291898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987847,0.00022223021,0.000085756015,0.00017512137,0.00055050285,0.00018167833],"domain_scores_gemma":[0.9980369,0.0008531952,0.00021692035,0.0005627022,0.00028310908,0.00004714014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007686276,0.0006194882,0.00039035783,0.0006110362,0.00051629666,0.0011535864,0.0016089343,0.00040051312,0.001361389],"category_scores_gemma":[0.003586166,0.00051233405,0.0006849562,0.00065280596,0.0006463961,0.0021248155,0.00080222153,0.0009747555,0.0003552506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007769451,0.0003173172,0.012673052,0.00044798068,0.00010766429,0.00041381133,0.00085423875,0.4267013,0.24423075,0.06698584,0.004166816,0.24232428],"study_design_scores_gemma":[0.000037922913,0.00026139995,0.0025886944,0.000035222794,0.000075577984,0.00012649546,0.00009760968,0.85348874,0.11851926,0.015454226,0.009263145,0.000051751096],"about_ca_topic_score_codex":0.0022669188,"about_ca_topic_score_gemma":0.0034702832,"teacher_disagreement_score":0.0022669188,"about_ca_system_score_codex":0.0009991046,"about_ca_system_score_gemma":0.0015750268,"threshold_uncertainty_score":0.0072490573},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74230766,0.0010902107,0.24315795,0.00050406816,0.00008143841,0.000051721287,0.00007190822,0.008749131,0.003985945],"genre_scores_gemma":[0.95846957,0.000094936666,0.040492203,0.00006527821,0.000023343238,0.000023717424,0.000039022507,0.0001888059,0.00060315215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919564,0.00022136768,0.00006368303,0.00009744215,0.000285769,0.00013610028],"domain_scores_gemma":[0.99733007,0.0011534553,0.0005357021,0.0005273405,0.00036614583,0.00008723123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011204701,0.0004394316,0.00035200443,0.00073797797,0.00043385438,0.0010048925,0.001021365,0.00028835863,0.0010638351],"category_scores_gemma":[0.004332543,0.00043415718,0.00023053946,0.0006787883,0.00063148385,0.0013510617,0.0008592887,0.00047368312,0.00020992971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021423972,0.00032920495,0.032485597,0.00036209336,0.00011564957,0.00038126874,0.0008926974,0.19349803,0.30084473,0.01863858,0.004549675,0.44576007],"study_design_scores_gemma":[0.00010692683,0.0005821376,0.0037680017,0.00003291291,0.00014104844,0.00015191674,0.00009919209,0.74815536,0.23563752,0.007029304,0.004241315,0.000054425767],"about_ca_topic_score_codex":0.0017741177,"about_ca_topic_score_gemma":0.0029077425,"teacher_disagreement_score":0.0017741177,"about_ca_system_score_codex":0.0006500212,"about_ca_system_score_gemma":0.0016532156,"threshold_uncertainty_score":0.0059256554},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6237633,0.0014514657,0.2514364,0.0014483585,0.0008096497,0.0005853689,0.003244943,0.04071487,0.07654564],"genre_scores_gemma":[0.7750346,0.0005324481,0.20995767,0.00024243804,0.000051847197,0.000521448,0.0038894603,0.003471172,0.006298985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902177,0.00024496356,0.000081749386,0.00010762225,0.0003179644,0.00022591413],"domain_scores_gemma":[0.9965618,0.001192172,0.00009343955,0.0009185025,0.0008407996,0.0003932444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015553174,0.00074004603,0.00093227305,0.00090616936,0.0011093144,0.0012313143,0.0025692326,0.00082152715,0.008788134],"category_scores_gemma":[0.00685318,0.00048587483,0.0007344378,0.0014866231,0.00056918454,0.0018463491,0.0012389366,0.0014308167,0.0016205976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006675228,0.00145183,0.008132135,0.0009635094,0.00046288004,0.00028920308,0.0004275282,0.5893038,0.017778015,0.058416717,0.035202157,0.28089705],"study_design_scores_gemma":[0.00041775155,0.0003841251,0.0026985162,0.000035558623,0.00007052987,0.000064864646,0.00019983701,0.95403636,0.018335277,0.011040791,0.012646812,0.000069571295],"about_ca_topic_score_codex":0.007689423,"about_ca_topic_score_gemma":0.009854144,"teacher_disagreement_score":0.008788134,"about_ca_system_score_codex":0.00095147855,"about_ca_system_score_gemma":0.0025828222,"threshold_uncertainty_score":0.029399276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054346733,0.0021639944,0.91195035,0.00043370848,0.00024485996,0.00012273538,0.00048521123,0.007814396,0.02243805],"genre_scores_gemma":[0.29241943,0.0014493095,0.68952924,0.0003414214,0.00015008781,0.0003530256,0.0018950978,0.004308733,0.00955365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905187,0.00024561028,0.000037273636,0.00009661666,0.00045546977,0.00011317932],"domain_scores_gemma":[0.99862444,0.0005627557,0.000083831066,0.00019928676,0.0004619878,0.00006774102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007379776,0.0010956586,0.0008046275,0.000648229,0.00056281127,0.0010676658,0.00171698,0.0007113968,0.0071992115],"category_scores_gemma":[0.0049421242,0.0003612915,0.00055756135,0.0012331506,0.0005381269,0.0013993717,0.0016331394,0.0008907112,0.0018433584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037353524,0.00013908104,0.002798693,0.00058346434,0.000117289324,0.00026294045,0.00017325429,0.62396485,0.017613461,0.034308773,0.014572826,0.30509186],"study_design_scores_gemma":[0.000027547489,0.000046310743,0.00039243847,0.000038323302,0.000013495123,0.000048105885,0.000022128232,0.9718641,0.007958947,0.0074869706,0.012089656,0.000012063862],"about_ca_topic_score_codex":0.0049343524,"about_ca_topic_score_gemma":0.005406918,"teacher_disagreement_score":0.0071992115,"about_ca_system_score_codex":0.0007288463,"about_ca_system_score_gemma":0.0011963083,"threshold_uncertainty_score":0.024083734},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049890444,0.00045640147,0.9448183,0.00027372662,0.00010211741,0.00007291546,0.00005395541,0.00042416036,0.0039079995],"genre_scores_gemma":[0.4977235,0.00030774015,0.4957212,0.00014357507,0.00008821698,0.00018557876,0.00015791315,0.00023925095,0.0054330453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999772,0.00006777942,0.000014643098,0.000035110355,0.000072800874,0.000037641305],"domain_scores_gemma":[0.99901617,0.00058623054,0.00008747659,0.000091357084,0.00015643037,0.00006216367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076109334,0.0005932378,0.0006601372,0.00042815192,0.00062958756,0.0007681037,0.0011195734,0.00056029006,0.003528468],"category_scores_gemma":[0.0034334688,0.0003274216,0.00030662434,0.0006475763,0.00043976956,0.00095033104,0.00079178344,0.00090493506,0.0004896592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016921916,0.000079071186,0.00039807658,0.00009090776,0.000020658825,0.00002874251,0.000077150056,0.90072936,0.0033238141,0.014046741,0.002342555,0.07869364],"study_design_scores_gemma":[0.000016585367,0.000013587605,0.00004894588,0.0000016474585,0.0000027090339,0.0000036262843,0.000008051257,0.9951498,0.00027785663,0.0041988343,0.00027641832,0.0000020732036],"about_ca_topic_score_codex":0.004525926,"about_ca_topic_score_gemma":0.010810181,"teacher_disagreement_score":0.004525926,"about_ca_system_score_codex":0.0007231671,"about_ca_system_score_gemma":0.0015597823,"threshold_uncertainty_score":0.011803925},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002136283,0.064313285,0.9040966,0.0016031163,0.00047924905,0.00036221324,0.00019713223,0.0014425865,0.025369545],"genre_scores_gemma":[0.01935983,0.080658115,0.8893662,0.00084865803,0.0007236038,0.0011631651,0.00048780715,0.00068747066,0.0067051584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.996734,0.0006974205,0.0003834659,0.0004701715,0.0015700374,0.00014490723],"domain_scores_gemma":[0.99811953,0.00084215804,0.00010881909,0.0004197527,0.000425903,0.00008383265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028306057,0.0018359605,0.0014635336,0.0027227392,0.001534389,0.004482989,0.0035110563,0.002252907,0.004670358],"category_scores_gemma":[0.004821954,0.0020130666,0.0017254329,0.0050842827,0.0022909509,0.0072331335,0.002144105,0.004052453,0.0031904168],"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.00008827945,0.000114940856,0.0005742701,0.004193488,0.00009011191,0.00019221418,0.0005441891,0.013420896,0.005239908,0.5632477,0.014823721,0.39747018],"study_design_scores_gemma":[0.00007333615,0.00019969654,0.00034522012,0.0013698195,0.000059663103,0.00080303825,0.00022125534,0.043094058,0.007953629,0.3118622,0.63389856,0.000119515105],"about_ca_topic_score_codex":0.00088030886,"about_ca_topic_score_gemma":0.0008761508,"teacher_disagreement_score":0.004670358,"about_ca_system_score_codex":0.0018493694,"about_ca_system_score_gemma":0.0018680833,"threshold_uncertainty_score":0.0156238675},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8287276,0.001027371,0.1619445,0.00041338685,0.00013766183,0.00015691636,0.00023874054,0.004684289,0.002669525],"genre_scores_gemma":[0.93658376,0.00015598125,0.061754126,0.00011820266,0.000025317328,0.000070175774,0.00020008956,0.00060310966,0.00048927293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942509,0.0015579121,0.000348067,0.00070640905,0.0026740227,0.00046268557],"domain_scores_gemma":[0.9522841,0.02818356,0.004028534,0.008991117,0.006036005,0.0004766967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038695766,0.0010271994,0.00059464056,0.0008943271,0.00072031206,0.0009116378,0.0011864603,0.00055919634,0.00084596255],"category_scores_gemma":[0.05113979,0.0005875959,0.00040991156,0.0008052487,0.0008445394,0.002504971,0.0009522067,0.0014458644,0.00026994615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002659166,0.0010344972,0.07732595,0.00080416957,0.00023198556,0.00045215667,0.0015539546,0.312013,0.15070663,0.006663155,0.0040666875,0.4424887],"study_design_scores_gemma":[0.00012161328,0.0012343768,0.027705006,0.00012920763,0.00018642364,0.00026900566,0.00042397642,0.7126922,0.24759977,0.00469286,0.0048288666,0.000116715906],"about_ca_topic_score_codex":0.0032698184,"about_ca_topic_score_gemma":0.0047217337,"teacher_disagreement_score":0.0038695766,"about_ca_system_score_codex":0.0007621424,"about_ca_system_score_gemma":0.0017100052,"threshold_uncertainty_score":0.02046454},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006721701,0.00042986136,0.97759527,0.00028152415,0.00016978216,0.00012233767,0.00022434468,0.004366338,0.01008889],"genre_scores_gemma":[0.10903946,0.0008158508,0.8740029,0.00025408322,0.000120644465,0.0007518931,0.00090561603,0.0018528709,0.012256743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996612,0.000084461186,0.000017807522,0.00005357744,0.00013431668,0.00004871364],"domain_scores_gemma":[0.99975806,0.000045747114,0.000013612541,0.00006331086,0.000082688384,0.00003660596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033600137,0.0005549314,0.0009668146,0.00043835284,0.0008941832,0.001330932,0.002518368,0.00091888587,0.005043126],"category_scores_gemma":[0.0010319469,0.00044157187,0.0008867465,0.0012061921,0.00054130197,0.0012847999,0.0015736223,0.0019992325,0.002474442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002930408,0.00026637505,0.0013908442,0.00046150878,0.00024958793,0.0005171508,0.00047700724,0.38558212,0.01508229,0.3186444,0.053014923,0.22402081],"study_design_scores_gemma":[0.00006540673,0.000063490756,0.0001740225,0.000031655818,0.00003139836,0.0001320407,0.000029010058,0.915156,0.0030093496,0.03813047,0.043141723,0.00003538754],"about_ca_topic_score_codex":0.006157376,"about_ca_topic_score_gemma":0.0054672495,"teacher_disagreement_score":0.006157376,"about_ca_system_score_codex":0.00050477503,"about_ca_system_score_gemma":0.001476272,"threshold_uncertainty_score":0.016870916},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62634766,0.00635541,0.19118287,0.0025687462,0.0010361539,0.00040907014,0.0008886815,0.011223557,0.1599878],"genre_scores_gemma":[0.8271998,0.0009225096,0.1250238,0.0002944338,0.000071617804,0.00021579728,0.00093270716,0.00037402532,0.04496534],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99979454,0.000022570186,0.000005433727,0.000029627941,0.000103302365,0.00004443988],"domain_scores_gemma":[0.9998673,0.000017045377,0.000009342456,0.000012901826,0.000074475145,0.000018953335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021124589,0.00035020296,0.00033697128,0.00025920273,0.00032856484,0.0005662795,0.00079610955,0.000257269,0.007452569],"category_scores_gemma":[0.00056279893,0.00014821053,0.00017897761,0.0004672434,0.00015241404,0.0005183198,0.00032896793,0.0006632218,0.0012650978],"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.0029658794,0.00046266196,0.0032269242,0.0004450646,0.000080238584,0.00074145786,0.00042921945,0.08644456,0.28121334,0.033418752,0.16597137,0.42460045],"study_design_scores_gemma":[0.0006397195,0.0022879138,0.005899491,0.000082641745,0.00006741446,0.00040003523,0.00016610953,0.64252543,0.13063045,0.005115243,0.21209894,0.000086534565],"about_ca_topic_score_codex":0.0052365437,"about_ca_topic_score_gemma":0.013497685,"teacher_disagreement_score":0.007452569,"about_ca_system_score_codex":0.00085376255,"about_ca_system_score_gemma":0.0012625392,"threshold_uncertainty_score":0.024931371},"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":"software","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017950542,0.00018832668,0.03882579,0.00048116155,0.0007968419,0.00026875196,0.019517174,0.8868716,0.051255297],"genre_scores_gemma":[0.022249164,0.00034182452,0.03390646,0.0015610904,0.00080957374,0.00097627996,0.05612143,0.724999,0.15903515],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980806,0.00016275611,0.00017689061,0.000450078,0.00073183526,0.00039777713],"domain_scores_gemma":[0.99046785,0.0010520071,0.0005067256,0.00365885,0.003452436,0.00086205284],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002148843,0.00359216,0.0018540279,0.003349758,0.0013196209,0.0031577924,0.0054833423,0.0016301777,0.51886463],"category_scores_gemma":[0.014569552,0.00338873,0.0017755404,0.0020070854,0.00080996926,0.008006917,0.004672526,0.0045856726,0.5099868],"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.00038038677,0.000073062954,0.0007779103,0.0001781768,0.000024117402,0.000058579102,0.0001193771,0.00021660666,0.0014979913,0.001470347,0.95338625,0.041817196],"study_design_scores_gemma":[0.00023470925,0.00006744011,0.0026516912,0.00010858938,0.00005744353,0.00026347273,0.000065208296,0.0020552594,0.0177318,0.003448042,0.9731162,0.00020005432],"about_ca_topic_score_codex":0.0035407904,"about_ca_topic_score_gemma":0.0022308442,"teacher_disagreement_score":0.48113537,"about_ca_system_score_codex":0.002393148,"about_ca_system_score_gemma":0.0017283339,"threshold_uncertainty_score":0.6862812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071895614,0.00038040825,0.8509138,0.0005901224,0.00027924712,0.00020743535,0.0006372165,0.045965582,0.029130554],"genre_scores_gemma":[0.42393088,0.0004127125,0.5462834,0.0007374361,0.0001476582,0.0008117059,0.0020012774,0.010142786,0.015532065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835384,0.0004449957,0.000104766346,0.00023234276,0.0006556001,0.00020851893],"domain_scores_gemma":[0.9941397,0.0016694565,0.0004422377,0.0019035542,0.0015850007,0.00026004424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017876074,0.0009442902,0.0005173676,0.00054626446,0.0007947641,0.0022498223,0.00448424,0.0012282243,0.0038516459],"category_scores_gemma":[0.006864626,0.00068166497,0.00088781974,0.0010088538,0.0010983518,0.0024811837,0.0017664732,0.0024939135,0.0018166701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014763924,0.0005714471,0.012855188,0.001060504,0.0003507224,0.00083223725,0.0016727245,0.41547033,0.045272116,0.25468,0.053877234,0.21188106],"study_design_scores_gemma":[0.00021446713,0.00024189032,0.0012806936,0.00009778585,0.000102685204,0.00021454385,0.000085018124,0.8045948,0.03534427,0.043695867,0.113999106,0.00012887488],"about_ca_topic_score_codex":0.006823903,"about_ca_topic_score_gemma":0.008485074,"teacher_disagreement_score":0.006823903,"about_ca_system_score_codex":0.0013695838,"about_ca_system_score_gemma":0.003986073,"threshold_uncertainty_score":0.013568342},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10248661,0.0008436129,0.869104,0.0003801241,0.00015166592,0.000043784887,0.00024641532,0.007260278,0.019483557],"genre_scores_gemma":[0.73138463,0.00039491354,0.25903365,0.00016999684,0.000048376933,0.000059702972,0.00038428928,0.00052498723,0.007999522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966574,0.000045029246,0.000012752932,0.000036936828,0.00018771797,0.00005184634],"domain_scores_gemma":[0.99944407,0.00013093151,0.000039011302,0.00019650238,0.00016769505,0.000021764617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020278229,0.00040529994,0.0005193207,0.00040985763,0.00034780457,0.00080715545,0.00090115133,0.0004105735,0.004365092],"category_scores_gemma":[0.0019148197,0.00022741276,0.00030475532,0.00094450207,0.00033317268,0.0010735906,0.0005394282,0.0008436128,0.00081883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009766786,0.00012961056,0.005508192,0.00017168369,0.000078121164,0.0005786113,0.00026808746,0.50394785,0.1053066,0.06628317,0.018746812,0.29800463],"study_design_scores_gemma":[0.000019644503,0.000036905632,0.00037093583,0.000008641303,0.0000074394147,0.000078279954,0.000017311762,0.9703138,0.016900377,0.005506848,0.006731751,0.000008125366],"about_ca_topic_score_codex":0.0075264685,"about_ca_topic_score_gemma":0.007230535,"teacher_disagreement_score":0.0075264685,"about_ca_system_score_codex":0.0009053762,"about_ca_system_score_gemma":0.0006097235,"threshold_uncertainty_score":0.014965296},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7536792,0.0042753755,0.10739641,0.009289775,0.00043149895,0.00059134356,0.00045761777,0.002387612,0.121491104],"genre_scores_gemma":[0.89146537,0.0017134579,0.082046814,0.0009131476,0.00006672762,0.00017688658,0.00037281337,0.00061803515,0.022626765],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.997726,0.0007904785,0.00007311752,0.00017970303,0.00093592703,0.00029468726],"domain_scores_gemma":[0.9973247,0.0012407957,0.0001625581,0.00050673826,0.00044668902,0.00031849285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015688214,0.00048599986,0.0003250089,0.0006745015,0.0019217804,0.0020422311,0.0016997107,0.002106168,0.0026055002],"category_scores_gemma":[0.0057897493,0.00025728764,0.00048187407,0.0011726359,0.0017936246,0.0016939742,0.0015997369,0.0018907036,0.0009880724],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010132294,0.0027767716,0.040682886,0.0012852793,0.00014511438,0.0818832,0.015714927,0.14140786,0.033317246,0.2112123,0.07845507,0.3921061],"study_design_scores_gemma":[0.0002691115,0.0017723762,0.014629379,0.0005710643,0.000115687464,0.03888608,0.011758707,0.22192244,0.06184135,0.06900699,0.5790255,0.0002012687],"about_ca_topic_score_codex":0.0058123246,"about_ca_topic_score_gemma":0.008257817,"teacher_disagreement_score":0.0058123246,"about_ca_system_score_codex":0.0013585116,"about_ca_system_score_gemma":0.0014428303,"threshold_uncertainty_score":0.011556983},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010816004,0.00076381036,0.9722678,0.00057121925,0.00013007995,0.000102412116,0.00009425608,0.0005732138,0.014681168],"genre_scores_gemma":[0.27963507,0.0014190605,0.7000867,0.000329472,0.00024399793,0.00044479675,0.00033327672,0.0005857146,0.016921889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988524,0.00025746308,0.000050523387,0.00014428726,0.0006013862,0.00009396592],"domain_scores_gemma":[0.99949086,0.00013912849,0.000022347596,0.00025011858,0.000078736564,0.000018722829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054232427,0.0005191047,0.0007857071,0.00037031635,0.0006238385,0.0013271,0.0011016211,0.0005294545,0.003400209],"category_scores_gemma":[0.0013996263,0.00031777073,0.0010950853,0.00053554645,0.0014570118,0.0019810211,0.001274149,0.0022395295,0.0011279383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001319152,0.000116324205,0.0003151663,0.00023239506,0.000043788048,0.00013938684,0.00023592442,0.13665034,0.010029903,0.7680984,0.005677397,0.07832915],"study_design_scores_gemma":[0.000043047155,0.000073286115,0.0001695388,0.00002701602,0.000019970696,0.0001298841,0.00004390732,0.4100057,0.0055121887,0.53838986,0.04556623,0.000019337682],"about_ca_topic_score_codex":0.0011546836,"about_ca_topic_score_gemma":0.001608762,"teacher_disagreement_score":0.003400209,"about_ca_system_score_codex":0.00072252646,"about_ca_system_score_gemma":0.00078517606,"threshold_uncertainty_score":0.011374831},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05435948,0.00043660132,0.92799604,0.00024154127,0.00003425183,0.000060860963,0.00010496614,0.015044526,0.0017216743],"genre_scores_gemma":[0.54130614,0.00030460604,0.45377216,0.00013078966,0.000033483095,0.00007954612,0.00029395334,0.0019472657,0.0021319878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979627,0.00047141378,0.00011844974,0.0004904935,0.00080365577,0.0001533143],"domain_scores_gemma":[0.99193704,0.0021751013,0.0010824633,0.0040962496,0.00061739725,0.00009185936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009564606,0.0012544714,0.00076069706,0.001277374,0.0004695616,0.0013686676,0.0014167144,0.0006396113,0.0014477762],"category_scores_gemma":[0.008963181,0.0006065322,0.0005206205,0.0011775111,0.00087399746,0.0025401083,0.0009354941,0.001326208,0.00093448075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004749548,0.00024869872,0.016663434,0.00035533376,0.00011645219,0.00021004719,0.00036242142,0.074323036,0.14038627,0.011286471,0.0035023058,0.75207067],"study_design_scores_gemma":[0.000039555012,0.0002803559,0.006022551,0.000083533225,0.000073218034,0.0006440718,0.000089806024,0.7340851,0.22981296,0.018274266,0.010531194,0.00006335436],"about_ca_topic_score_codex":0.0015055534,"about_ca_topic_score_gemma":0.0019321138,"teacher_disagreement_score":0.0015055534,"about_ca_system_score_codex":0.00055301894,"about_ca_system_score_gemma":0.0016437819,"threshold_uncertainty_score":0.0050582886},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009544888,0.0021200415,0.67515653,0.0013272905,0.00089889514,0.0010894757,0.0010815831,0.029628739,0.2791526],"genre_scores_gemma":[0.16282882,0.00523511,0.46101695,0.0011793126,0.00047271288,0.001963637,0.0035776712,0.01783089,0.345895],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99809104,0.00031755885,0.00009745034,0.0003535279,0.00086384726,0.0002765603],"domain_scores_gemma":[0.9980599,0.0007435375,0.000105745676,0.00045347816,0.00049281213,0.00014441677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015083409,0.0008733206,0.00072654913,0.0006769287,0.0011073791,0.003241309,0.001414919,0.0008953916,0.040040173],"category_scores_gemma":[0.0075896583,0.0006781979,0.00060305867,0.0006083426,0.0012343685,0.0033062855,0.0024706537,0.0029983202,0.024608232],"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.00042641346,0.00024089565,0.0011984652,0.0008811523,0.000020244546,0.0002704385,0.0022756704,0.005019218,0.015165822,0.42752564,0.08207134,0.46490473],"study_design_scores_gemma":[0.000049670754,0.0001234928,0.0007469535,0.00047864736,0.000023465982,0.00025062865,0.00028398892,0.011905514,0.027606225,0.086443394,0.8720385,0.000049578284],"about_ca_topic_score_codex":0.001561165,"about_ca_topic_score_gemma":0.0011773126,"teacher_disagreement_score":0.040040173,"about_ca_system_score_codex":0.0009448873,"about_ca_system_score_gemma":0.0021935115,"threshold_uncertainty_score":0.13394767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016040675,0.13192914,0.5123997,0.013698745,0.0028969592,0.00016516297,0.00011162991,0.0007678854,0.32199007],"genre_scores_gemma":[0.6380461,0.10403637,0.14493123,0.0051681283,0.0037357176,0.00060697226,0.00013615371,0.00034389793,0.10299545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998454,0.00037208525,0.00007209701,0.00033733185,0.0006228713,0.00014159417],"domain_scores_gemma":[0.998804,0.00060662604,0.00010246665,0.00019720155,0.00023246105,0.000057239482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00141381,0.000495162,0.00050983176,0.0014250021,0.0013417023,0.0031441255,0.001000797,0.0018613444,0.0065541016],"category_scores_gemma":[0.0033366738,0.00036579394,0.0005461372,0.0015516409,0.0047513763,0.0047412557,0.0022260225,0.002787798,0.0023694918],"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.000015124596,0.000013049076,0.00021459097,0.00014070509,0.0000072845482,0.00009698013,0.00019434179,0.0018019383,0.0011777842,0.9507138,0.0032574493,0.042366948],"study_design_scores_gemma":[0.000012779324,0.00008568425,0.00027998432,0.00022573696,0.000016558566,0.00043566164,0.00013804104,0.013385933,0.002779984,0.7593632,0.22323163,0.000044817334],"about_ca_topic_score_codex":0.0010458989,"about_ca_topic_score_gemma":0.00038039626,"teacher_disagreement_score":0.0065541016,"about_ca_system_score_codex":0.002012606,"about_ca_system_score_gemma":0.0013198113,"threshold_uncertainty_score":0.021925628},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081414595,0.00020266719,0.9102612,0.00061281724,0.00004306606,0.00012292352,0.00023317375,0.0022724387,0.004837076],"genre_scores_gemma":[0.819075,0.00041079347,0.17520235,0.0004456047,0.00015464443,0.00034691123,0.0007237736,0.00088607083,0.0027547982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923482,0.0022148234,0.0006600916,0.0014596757,0.0023412593,0.00097604253],"domain_scores_gemma":[0.939269,0.043306395,0.0031173236,0.009650307,0.003831091,0.0008258175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064019314,0.00086789334,0.0008696325,0.0011631398,0.0013157693,0.0029070515,0.0026067733,0.0016685225,0.0037562505],"category_scores_gemma":[0.039121505,0.0010633715,0.0023272696,0.0008883038,0.0053986316,0.0072674616,0.004282001,0.0047412766,0.00057260797],"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.0003878119,0.0003560877,0.010945426,0.00072275475,0.0003996651,0.0014611838,0.0021702235,0.21441424,0.05568083,0.607308,0.0028892923,0.10326456],"study_design_scores_gemma":[0.00007943795,0.00015238629,0.0010614529,0.0000934652,0.0001106093,0.00026087931,0.000271128,0.37985268,0.051479895,0.5603409,0.0062402603,0.00005685182],"about_ca_topic_score_codex":0.0024451797,"about_ca_topic_score_gemma":0.001860032,"teacher_disagreement_score":0.0064019314,"about_ca_system_score_codex":0.002296857,"about_ca_system_score_gemma":0.002323891,"threshold_uncertainty_score":0.033857048},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5395683,0.001350811,0.4242625,0.00093106367,0.00012127405,0.00012713205,0.00028390475,0.000495826,0.032859217],"genre_scores_gemma":[0.96327287,0.0002476935,0.03217915,0.000057921363,0.00003839923,0.00007678612,0.00023077012,0.00007259807,0.0038238438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996722,0.00007178051,0.00000774054,0.00006587559,0.00010935923,0.00007308632],"domain_scores_gemma":[0.9991702,0.00023295182,0.00012265834,0.00020602714,0.00021013174,0.00005803597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039406045,0.00030579205,0.0003276377,0.0007151595,0.00068791345,0.00080420123,0.0007022718,0.0006468481,0.0036093262],"category_scores_gemma":[0.0028836876,0.00026902222,0.0005281191,0.00071961695,0.0005844441,0.0021992098,0.0006874586,0.0006542478,0.00038262605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012225205,0.000090002475,0.01563124,0.0001316498,0.00008657549,0.0004366843,0.0003670604,0.6029673,0.007857324,0.32194778,0.0050680256,0.04529415],"study_design_scores_gemma":[0.00001680605,0.000047012032,0.0025456455,0.000011552425,0.000026052967,0.00008888756,0.00009811867,0.89681756,0.0011322043,0.09596018,0.0032466978,0.0000093081835],"about_ca_topic_score_codex":0.003295436,"about_ca_topic_score_gemma":0.0033040408,"teacher_disagreement_score":0.0036093262,"about_ca_system_score_codex":0.0009879717,"about_ca_system_score_gemma":0.0008318535,"threshold_uncertainty_score":0.012074411},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07190366,0.0019483975,0.70271105,0.0016613699,0.0009028362,0.00029996416,0.00041711086,0.017544853,0.2026108],"genre_scores_gemma":[0.4099018,0.0021481472,0.41241306,0.0012198278,0.00031064815,0.000363457,0.00082576537,0.0016151933,0.17120214],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998578,0.00002676624,0.000005280834,0.000026663769,0.000059001104,0.000024564706],"domain_scores_gemma":[0.9999169,0.000019556266,0.000007076801,0.000021054231,0.000027031796,0.00000839746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011806287,0.0003267574,0.00029720349,0.0004065595,0.00046942153,0.0006945699,0.0007514267,0.00039110598,0.013545115],"category_scores_gemma":[0.00045591287,0.0002067875,0.00023246508,0.0004813897,0.00045296006,0.0006557866,0.0008722761,0.00063517276,0.005076233],"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.00065324863,0.00011797598,0.0014890588,0.00081790454,0.000063820255,0.001342629,0.00046746925,0.119557366,0.18934456,0.257895,0.038588114,0.38966292],"study_design_scores_gemma":[0.00009190309,0.00042318343,0.0009757108,0.00011847049,0.000045667734,0.00055565865,0.00017388501,0.37612584,0.096606776,0.035203185,0.48963976,0.00003995762],"about_ca_topic_score_codex":0.0017303119,"about_ca_topic_score_gemma":0.0019496704,"teacher_disagreement_score":0.013545115,"about_ca_system_score_codex":0.00043627512,"about_ca_system_score_gemma":0.0005086176,"threshold_uncertainty_score":0.04531294},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041007724,0.00017822874,0.9381022,0.0001335814,0.00022327791,0.00023836929,0.0001290327,0.0150310965,0.0049565737],"genre_scores_gemma":[0.30948243,0.00027313843,0.67260796,0.0002441002,0.00010138811,0.00045252696,0.0008346702,0.0041675917,0.0118361935],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999033,0.00011587181,0.00008754867,0.00028785,0.0003042234,0.00017166063],"domain_scores_gemma":[0.99915195,0.0001567614,0.00005705561,0.00027811126,0.00029332863,0.00006273831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066224445,0.00052324677,0.0005985578,0.00073803106,0.0006574324,0.0011141283,0.0010665085,0.00033509062,0.0051109837],"category_scores_gemma":[0.0020565377,0.00040468667,0.0006207582,0.00062946306,0.00043129138,0.0019117666,0.0011439605,0.0008708614,0.0010304658],"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.00064877304,0.00029933304,0.00593651,0.00035539255,0.00009087751,0.0003365559,0.0008082613,0.011072647,0.07719308,0.036348615,0.019536855,0.84737307],"study_design_scores_gemma":[0.00046607348,0.0004636921,0.0041385475,0.000109291985,0.00019639435,0.00091728196,0.0003575524,0.5427789,0.21005256,0.081245996,0.15911722,0.00015642327],"about_ca_topic_score_codex":0.0020533332,"about_ca_topic_score_gemma":0.0018303083,"teacher_disagreement_score":0.0051109837,"about_ca_system_score_codex":0.0004515471,"about_ca_system_score_gemma":0.001215858,"threshold_uncertainty_score":0.01709795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5432981,0.009657872,0.35875145,0.0020652777,0.00025861594,0.00021247154,0.0002925962,0.0029160797,0.08254747],"genre_scores_gemma":[0.93544745,0.0015306377,0.056988828,0.00028125886,0.00006178131,0.00018807451,0.0002295036,0.00026871046,0.0050038644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857605,0.00030894298,0.000070043694,0.0002515423,0.0006039996,0.00018951952],"domain_scores_gemma":[0.99681133,0.0014084108,0.00018874598,0.00074576266,0.0006094358,0.00023634074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001251088,0.00044467914,0.0005970354,0.0006368352,0.0007312552,0.0027010478,0.0015965498,0.0010904637,0.003498275],"category_scores_gemma":[0.007964865,0.0006172012,0.00039384898,0.00061700423,0.0011896883,0.0035489425,0.0018373206,0.001397092,0.0009806686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006424454,0.0002659539,0.010927341,0.0007203375,0.0001970396,0.0009811353,0.0011833047,0.3722075,0.08805253,0.37613958,0.009458501,0.13922432],"study_design_scores_gemma":[0.000070360205,0.00032560615,0.0049778633,0.00014700579,0.000063014086,0.0007064129,0.0004034102,0.8170815,0.021186678,0.11843005,0.03654913,0.0000589824],"about_ca_topic_score_codex":0.0021908882,"about_ca_topic_score_gemma":0.0014334132,"teacher_disagreement_score":0.003498275,"about_ca_system_score_codex":0.0017555718,"about_ca_system_score_gemma":0.00075009983,"threshold_uncertainty_score":0.012737572},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33287886,0.00071570766,0.6306141,0.00031626708,0.00011063335,0.00021637113,0.001123946,0.028303541,0.0057205874],"genre_scores_gemma":[0.8279833,0.00016378846,0.16871797,0.0001006228,0.000022818469,0.00010698357,0.00067850825,0.000906003,0.0013199468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884295,0.00024444904,0.00010403471,0.00019167917,0.00048205417,0.00013484023],"domain_scores_gemma":[0.9957761,0.0018125375,0.0006012019,0.0011194597,0.00059703435,0.00009353209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009373178,0.000684869,0.00039681667,0.0010900213,0.00037906843,0.00070135714,0.0006789306,0.00027175221,0.0019276326],"category_scores_gemma":[0.0050040316,0.0005245431,0.00038053282,0.00093187165,0.00045103734,0.001295628,0.0007159345,0.00082668604,0.0005255681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017377582,0.00037731376,0.045833353,0.0004731214,0.0001206142,0.0005963654,0.0010456358,0.07391154,0.31274378,0.014889954,0.008953266,0.5393173],"study_design_scores_gemma":[0.00005577798,0.00034515472,0.009913574,0.00007069763,0.00005816127,0.00032622527,0.000125753,0.61057454,0.35157144,0.014204529,0.012674284,0.00007983664],"about_ca_topic_score_codex":0.0015127157,"about_ca_topic_score_gemma":0.0028908988,"teacher_disagreement_score":0.0019276326,"about_ca_system_score_codex":0.000532279,"about_ca_system_score_gemma":0.0012331471,"threshold_uncertainty_score":0.0064486265},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69683605,0.008264689,0.22110382,0.0015836863,0.0011333184,0.0015954111,0.0037446318,0.028404169,0.03733423],"genre_scores_gemma":[0.73833376,0.0013946221,0.2505493,0.00036419212,0.00014635202,0.00069935765,0.0034763308,0.001301618,0.0037344184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947803,0.0010121204,0.00041364765,0.00076088955,0.0022388736,0.0007941694],"domain_scores_gemma":[0.98136985,0.011443804,0.00078012614,0.00263714,0.0029542285,0.0008149158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041580778,0.0018348597,0.0019900023,0.0026894761,0.0015780885,0.001382303,0.0042597414,0.0020827418,0.006522261],"category_scores_gemma":[0.018799055,0.00076117023,0.0007268719,0.0046695885,0.0016052037,0.0040919525,0.0018148758,0.0020417455,0.0018572942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008095129,0.0075332676,0.009866778,0.0036428724,0.0004541088,0.0005718557,0.00068039383,0.50118107,0.028954422,0.023646688,0.06514305,0.35023037],"study_design_scores_gemma":[0.0008549508,0.0016958817,0.0020434526,0.00008192247,0.00007719764,0.00027457828,0.00028337812,0.9538968,0.024060767,0.010079674,0.0065688533,0.000082491795],"about_ca_topic_score_codex":0.009208796,"about_ca_topic_score_gemma":0.0071337787,"teacher_disagreement_score":0.009208796,"about_ca_system_score_codex":0.0022910263,"about_ca_system_score_gemma":0.0022507869,"threshold_uncertainty_score":0.0219903},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14182404,0.00031606344,0.73079413,0.00043379015,0.00015638593,0.0004436738,0.0009794397,0.0335797,0.091472834],"genre_scores_gemma":[0.59643334,0.00030288365,0.32498676,0.00035678447,0.000053380627,0.00049116876,0.0025151148,0.0028869943,0.07197361],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998566,0.00002301394,0.0000064115816,0.000027606378,0.000043570904,0.000042750096],"domain_scores_gemma":[0.9998845,0.000025254913,0.000007954082,0.00003923423,0.00002681504,0.000016226155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024290885,0.0004316266,0.00020109348,0.00021657627,0.000398801,0.00063047954,0.00078261987,0.00024440355,0.011956669],"category_scores_gemma":[0.0003746565,0.00022913501,0.00028252872,0.00018922584,0.00028428342,0.0006230055,0.0007657646,0.0005229117,0.002853447],"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.0019200838,0.00030002696,0.00889314,0.00080408156,0.00017549882,0.003117785,0.0012802572,0.10182644,0.22954187,0.14118908,0.13634317,0.3746086],"study_design_scores_gemma":[0.00034598578,0.00039951672,0.006171329,0.00014376885,0.00006901249,0.0008431857,0.00029658774,0.4983339,0.21790008,0.03260044,0.24280547,0.00009065104],"about_ca_topic_score_codex":0.0014138274,"about_ca_topic_score_gemma":0.0037047933,"teacher_disagreement_score":0.011956669,"about_ca_system_score_codex":0.0003340954,"about_ca_system_score_gemma":0.0004242423,"threshold_uncertainty_score":0.03999901},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01749526,0.00029911805,0.78097034,0.00037616512,0.00016491015,0.00061993214,0.014220932,0.17980239,0.006050914],"genre_scores_gemma":[0.3479022,0.0005501101,0.5861075,0.00035039164,0.00011553864,0.00305491,0.032584213,0.021274354,0.00806073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742496,0.00077201653,0.00036882763,0.00036234813,0.00088191027,0.00018991152],"domain_scores_gemma":[0.98221254,0.009050257,0.0008964164,0.0052039437,0.002371798,0.00026505222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027966963,0.0015738411,0.0005652522,0.0016464752,0.0006936871,0.0019189682,0.0030210572,0.0013532264,0.022695294],"category_scores_gemma":[0.022462288,0.000986315,0.0007178905,0.0012414526,0.0008580102,0.0039625545,0.0014232689,0.0018881776,0.0047697844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039212103,0.00090044906,0.009640681,0.0020358341,0.00020860959,0.0011000814,0.0013600785,0.14753985,0.041246627,0.09117439,0.14401062,0.55686164],"study_design_scores_gemma":[0.00063737575,0.0006622222,0.0023583085,0.000492164,0.000084341256,0.0005129628,0.00020237378,0.6270725,0.12741517,0.07783159,0.16253127,0.00019974918],"about_ca_topic_score_codex":0.0027215702,"about_ca_topic_score_gemma":0.0024384442,"teacher_disagreement_score":0.022695294,"about_ca_system_score_codex":0.0013799281,"about_ca_system_score_gemma":0.0016480915,"threshold_uncertainty_score":0.07592332},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038923682,0.00025750115,0.9917109,0.00026406808,0.00007511126,0.00003935681,0.00012413466,0.00042202504,0.0032144196],"genre_scores_gemma":[0.47956902,0.0006855423,0.49263352,0.00052245974,0.00025077982,0.00040375485,0.0007479178,0.0010866598,0.024100399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847096,0.00063978654,0.00009280554,0.00029336166,0.00036802725,0.00013496366],"domain_scores_gemma":[0.99083954,0.0064394493,0.00032505105,0.0014103055,0.0006979445,0.00028773825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033830518,0.00060964044,0.0007338421,0.000871783,0.0007498301,0.0016686859,0.002391393,0.0017752732,0.009654273],"category_scores_gemma":[0.017666139,0.0010723282,0.0012542021,0.0009370704,0.0022138897,0.0030583413,0.0028952993,0.0031160037,0.0022575916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015931299,0.00007526352,0.0008592435,0.00012698208,0.000073711286,0.00031813636,0.00038425438,0.18008748,0.0031060928,0.71854514,0.006083737,0.09018054],"study_design_scores_gemma":[0.00001802138,0.00002112089,0.00010413878,0.000041086492,0.000015609121,0.000096081545,0.000019939385,0.7465732,0.0012919547,0.24848789,0.0033158425,0.000015110407],"about_ca_topic_score_codex":0.0028670905,"about_ca_topic_score_gemma":0.0053292424,"teacher_disagreement_score":0.009654273,"about_ca_system_score_codex":0.0010730507,"about_ca_system_score_gemma":0.0012396896,"threshold_uncertainty_score":0.032296777},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0675645,0.00081513345,0.8611284,0.00053841976,0.00041828008,0.00034216113,0.00035547925,0.006968072,0.061869483],"genre_scores_gemma":[0.20554547,0.00029031557,0.76033473,0.00018401019,0.00006814126,0.00017608145,0.00064433255,0.0012253415,0.03153158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963164,0.00006439387,0.000017074137,0.00010648178,0.000114129056,0.00006626988],"domain_scores_gemma":[0.9996867,0.00008089611,0.000016995034,0.00010247342,0.00007791724,0.00003498323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039650922,0.00058092555,0.0009121525,0.0006734202,0.001083064,0.0011686021,0.0016103175,0.0006544309,0.009185271],"category_scores_gemma":[0.0008819208,0.0005488911,0.0009200178,0.00061314105,0.00046814865,0.0009338982,0.0013861847,0.0009568389,0.0022133633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008490115,0.0003572778,0.0010035807,0.00039602324,0.00016901945,0.0003585083,0.0004324105,0.33604392,0.033503465,0.069694325,0.024587216,0.5326053],"study_design_scores_gemma":[0.0000830164,0.00010244442,0.0004510475,0.000030387762,0.00005209058,0.00018096101,0.00010978385,0.94102496,0.009405954,0.02434146,0.024190716,0.000027213136],"about_ca_topic_score_codex":0.005838286,"about_ca_topic_score_gemma":0.014366155,"teacher_disagreement_score":0.009185271,"about_ca_system_score_codex":0.00078460993,"about_ca_system_score_gemma":0.0012097768,"threshold_uncertainty_score":0.030727863},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004348535,0.0023374243,0.9483558,0.0019840659,0.0003033016,0.00018404053,0.00023973256,0.0009384657,0.041308697],"genre_scores_gemma":[0.16235581,0.0034239448,0.79795074,0.001092916,0.00076636503,0.0013034947,0.0007104481,0.0008473447,0.031548932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99617416,0.001250932,0.00032114165,0.0005082367,0.0013127363,0.00043288208],"domain_scores_gemma":[0.99836737,0.00051115156,0.00014437022,0.00036026168,0.000501915,0.00011498327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042689075,0.0015216578,0.0009879081,0.0018746476,0.00275125,0.0051443432,0.0050729974,0.0030339297,0.0063024797],"category_scores_gemma":[0.0050827754,0.0013170494,0.0028603463,0.0022465512,0.0044280584,0.008369539,0.004574878,0.006483267,0.0025654046],"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.0000054406914,0.000009735724,0.0000521972,0.000032484866,0.0000046758914,0.000066354434,0.00026783074,0.0031220347,0.00021982046,0.990071,0.0017419232,0.004406505],"study_design_scores_gemma":[0.000031268235,0.00004271392,0.00013004785,0.0001745468,0.000038831724,0.0002141625,0.00024559823,0.053260848,0.0012276574,0.7629584,0.18163295,0.000042867847],"about_ca_topic_score_codex":0.010136898,"about_ca_topic_score_gemma":0.00715476,"teacher_disagreement_score":0.010136898,"about_ca_system_score_codex":0.0036678673,"about_ca_system_score_gemma":0.00401004,"threshold_uncertainty_score":0.026612341},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051077553,0.0035851712,0.015019952,0.029357623,0.0012554962,0.00011163925,0.00087564,0.0019215917,0.94276524],"genre_scores_gemma":[0.18236709,0.008840246,0.012079365,0.011447304,0.0016371388,0.00031453618,0.0025423816,0.0030041519,0.77776784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99716884,0.0005411684,0.00009329188,0.00037663718,0.0013405739,0.00047954606],"domain_scores_gemma":[0.9960751,0.0007226833,0.00023603447,0.0010569211,0.0011006104,0.0008085927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026818311,0.00065400533,0.0006019882,0.0018227225,0.002046834,0.010218478,0.001808522,0.002429647,0.2216261],"category_scores_gemma":[0.014410232,0.00035335674,0.00061907264,0.0022436962,0.0022463258,0.011631366,0.007742118,0.003721622,0.08960143],"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.000110828245,0.000084165935,0.0013967579,0.00026598712,0.00002592136,0.0004337864,0.00067041337,0.00072563183,0.0007957291,0.5182486,0.29668796,0.18055433],"study_design_scores_gemma":[0.000013874359,0.000025497859,0.0005096465,0.0001602596,0.000006574811,0.00031188224,0.0004380982,0.00051685586,0.00038467883,0.08602343,0.91159445,0.00001476708],"about_ca_topic_score_codex":0.0023015398,"about_ca_topic_score_gemma":0.002656409,"teacher_disagreement_score":0.2216261,"about_ca_system_score_codex":0.0026857813,"about_ca_system_score_gemma":0.0042389235,"threshold_uncertainty_score":0.7414132},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013358031,0.00051119004,0.95254755,0.00041040604,0.00014709271,0.00015504575,0.0010154779,0.008034613,0.023820573],"genre_scores_gemma":[0.17646918,0.00050555094,0.80449647,0.00028585098,0.0000850383,0.0004757248,0.0019801236,0.0016466634,0.014055408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944,0.00008862656,0.00003491448,0.00008440023,0.000263513,0.00008854731],"domain_scores_gemma":[0.9994777,0.0001278562,0.000017396129,0.00017099787,0.00018465049,0.00002137664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003338394,0.0007355343,0.0007021607,0.0007794804,0.0010676358,0.0010953487,0.0013327898,0.0005920623,0.015572379],"category_scores_gemma":[0.0016582791,0.00030736305,0.00084691425,0.0014121198,0.0004985069,0.0012128437,0.0011181366,0.0010115037,0.006116989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038593996,0.00022975306,0.0012662265,0.0008804388,0.00014358998,0.00029420297,0.00037768847,0.13988392,0.019647652,0.19245279,0.07056365,0.5738741],"study_design_scores_gemma":[0.00013751432,0.00012367021,0.0007551234,0.00006464045,0.00006121909,0.00042123708,0.00021440844,0.5708006,0.041032977,0.21949603,0.16682494,0.00006762255],"about_ca_topic_score_codex":0.0052613537,"about_ca_topic_score_gemma":0.009188435,"teacher_disagreement_score":0.015572379,"about_ca_system_score_codex":0.0007221698,"about_ca_system_score_gemma":0.001439753,"threshold_uncertainty_score":0.052094758},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05785507,0.026234373,0.808999,0.03645723,0.005393393,0.00020775215,0.00037513758,0.012379666,0.05209832],"genre_scores_gemma":[0.5772706,0.026137272,0.3423247,0.009357163,0.0041690334,0.00044012335,0.0006172868,0.003596846,0.036086902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997985,0.00049647095,0.00007529493,0.0002721804,0.0008019343,0.00036900482],"domain_scores_gemma":[0.99643195,0.0012709703,0.00016651514,0.0012592996,0.00048404813,0.0003872178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026841112,0.000956262,0.0007487451,0.0006784281,0.0012971114,0.004225803,0.0033434725,0.00150685,0.0069529223],"category_scores_gemma":[0.007845059,0.000904676,0.0008838073,0.0007061246,0.0028342635,0.013707092,0.0037203687,0.009407416,0.0026325115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005388024,0.00031237723,0.004415793,0.00071987265,0.00012622541,0.00037834002,0.0016415098,0.02807614,0.015564623,0.47846216,0.07940567,0.39035854],"study_design_scores_gemma":[0.0001846492,0.0005081283,0.0009574505,0.0005903257,0.00017131543,0.0006828822,0.00074569805,0.1463687,0.024812257,0.37956372,0.44524595,0.00016901917],"about_ca_topic_score_codex":0.0022556602,"about_ca_topic_score_gemma":0.003191166,"teacher_disagreement_score":0.0069529223,"about_ca_system_score_codex":0.0013780172,"about_ca_system_score_gemma":0.0030433931,"threshold_uncertainty_score":0.023259819},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052988017,0.0022041185,0.70384854,0.0007435429,0.0003560184,0.00043205384,0.012017622,0.23111118,0.043988064],"genre_scores_gemma":[0.10330996,0.0029123686,0.73982084,0.0021484015,0.00037363893,0.002358671,0.056310326,0.047208343,0.0455575],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873513,0.00023585188,0.00010084225,0.00012652023,0.00061952247,0.00018205208],"domain_scores_gemma":[0.9985501,0.0003499999,0.000098239216,0.00043776887,0.0004020125,0.00016186484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010760019,0.001582464,0.0011391578,0.0016683643,0.0010911849,0.0027499604,0.003960705,0.0012666254,0.039791983],"category_scores_gemma":[0.0037009106,0.0010522832,0.0018112728,0.0022135128,0.00073930447,0.0025293399,0.0031795169,0.003507451,0.025895016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004601481,0.0002431784,0.0013989261,0.0017761094,0.00021798733,0.0004163618,0.0002927519,0.04562066,0.01169658,0.1621045,0.5428374,0.23293544],"study_design_scores_gemma":[0.00036708728,0.00011937214,0.0008259205,0.00029281914,0.00008057727,0.00021142706,0.000045548997,0.24400951,0.019927213,0.11484033,0.6191263,0.00015391156],"about_ca_topic_score_codex":0.003960562,"about_ca_topic_score_gemma":0.0071060616,"teacher_disagreement_score":0.039791983,"about_ca_system_score_codex":0.0013691064,"about_ca_system_score_gemma":0.004000863,"threshold_uncertainty_score":0.13311738},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44477823,0.00039889844,0.52465856,0.0004714776,0.00013124164,0.00009313128,0.00025265059,0.0013093346,0.027906455],"genre_scores_gemma":[0.96460176,0.000056286823,0.03249121,0.000030900163,0.00001095545,0.000029073062,0.000053439395,0.00007226958,0.0026541234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99993885,0.000012850693,0.0000020786479,0.000011186458,0.000013834684,0.00002127109],"domain_scores_gemma":[0.9998925,0.00003723497,0.0000151409995,0.000010360073,0.000032597938,0.000012265508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013193865,0.00044808915,0.00032924276,0.00031490927,0.000337583,0.00037674993,0.00028257156,0.00036493503,0.0040056603],"category_scores_gemma":[0.00068170816,0.00018258636,0.0001664084,0.000233255,0.00019570287,0.00029310386,0.00028186795,0.00024856758,0.0005344987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019723392,0.000059416434,0.0012383731,0.00009469725,0.0000177844,0.000100006306,0.000062216124,0.89738667,0.036709044,0.003992652,0.0023822365,0.057759624],"study_design_scores_gemma":[0.00003175764,0.0002123867,0.0014410114,0.000014483492,0.000016296332,0.0000485354,0.00012480473,0.9788148,0.014636267,0.003446469,0.0012062789,0.000006998218],"about_ca_topic_score_codex":0.0011646238,"about_ca_topic_score_gemma":0.0025769463,"teacher_disagreement_score":0.0040056603,"about_ca_system_score_codex":0.0003969383,"about_ca_system_score_gemma":0.0005866655,"threshold_uncertainty_score":0.013400316},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008869835,0.0039952784,0.95392525,0.014173357,0.000980286,0.00017803625,0.0002708256,0.0019242978,0.015682835],"genre_scores_gemma":[0.2902539,0.005405469,0.6869109,0.004877081,0.0011123032,0.0007796724,0.00043725796,0.0018395876,0.008383703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9721556,0.011987917,0.0033938468,0.0029235368,0.0079866415,0.0015524927],"domain_scores_gemma":[0.94695836,0.022881143,0.002622568,0.017961632,0.008879855,0.00069639547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026051283,0.0013923753,0.0019851907,0.0023859139,0.0030939819,0.007752239,0.009432787,0.0040126177,0.005196761],"category_scores_gemma":[0.07016413,0.0018032445,0.0024819933,0.0036162864,0.008846247,0.02273645,0.0071896305,0.009988497,0.0020749252],"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.000094757,0.00004364747,0.0008552213,0.00053479354,0.000055201417,0.00026411706,0.001018723,0.019651921,0.0006872096,0.9140772,0.010360789,0.05235628],"study_design_scores_gemma":[0.000028776187,0.000044545417,0.00015587205,0.00041428814,0.000036721474,0.00048009,0.00038701677,0.04419635,0.0029410352,0.9155605,0.03566679,0.000088044544],"about_ca_topic_score_codex":0.0050806105,"about_ca_topic_score_gemma":0.0046387445,"teacher_disagreement_score":0.026051283,"about_ca_system_score_codex":0.003529508,"about_ca_system_score_gemma":0.0047706403,"threshold_uncertainty_score":0.13777399},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2015384,0.01603924,0.65936464,0.0030632843,0.0017081636,0.00014019127,0.0005233679,0.010659385,0.10696337],"genre_scores_gemma":[0.62933964,0.003232364,0.3426309,0.00079058413,0.00046620806,0.00013900196,0.0005812183,0.0010539102,0.02176622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994879,0.00008510934,0.000031068485,0.00011277953,0.0001893817,0.000093825685],"domain_scores_gemma":[0.9990747,0.00022369043,0.00006002865,0.00034544003,0.00020394826,0.00009219859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006014784,0.00075692567,0.00054817006,0.0003917093,0.00037500524,0.0014199804,0.0024195793,0.0007300517,0.009897516],"category_scores_gemma":[0.002009207,0.0005218091,0.00032854386,0.00092584034,0.00041597112,0.002822508,0.0014154589,0.0016741643,0.0022024265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011125209,0.0002825756,0.0023083685,0.00087448116,0.00016142217,0.00022988074,0.00027605085,0.11075348,0.18362446,0.13992858,0.037555672,0.5228925],"study_design_scores_gemma":[0.00012319848,0.00074539345,0.0029371814,0.0002869566,0.00015336275,0.00039461447,0.0001658068,0.5931356,0.13243364,0.115146264,0.15435888,0.00011914143],"about_ca_topic_score_codex":0.0006137956,"about_ca_topic_score_gemma":0.0011320814,"teacher_disagreement_score":0.009897516,"about_ca_system_score_codex":0.0007534458,"about_ca_system_score_gemma":0.00050365017,"threshold_uncertainty_score":0.03311056},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01962394,0.0013431452,0.9652587,0.0009190735,0.00022841296,0.000040982504,0.00017658115,0.00052012014,0.011889024],"genre_scores_gemma":[0.85106444,0.003647948,0.121388055,0.00037826935,0.00046463186,0.0003086211,0.0006215315,0.00042044782,0.021705918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997404,0.00006637671,0.0000142560475,0.000025921829,0.00013264705,0.00002033648],"domain_scores_gemma":[0.99970716,0.00008542845,0.000034303208,0.00004610585,0.00010840504,0.000018485276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031111878,0.00076683157,0.00045922227,0.00033904618,0.00028008464,0.00080904056,0.0006212913,0.00052279705,0.003116768],"category_scores_gemma":[0.0011169214,0.00023586737,0.00051490066,0.000379475,0.00028401034,0.0008584143,0.0007072648,0.0007342635,0.000722131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035699584,0.00004404797,0.00038383747,0.000065036256,0.000027995016,0.000059338294,0.00003599063,0.9296384,0.007601041,0.04101447,0.0045221024,0.016572088],"study_design_scores_gemma":[0.0000013304517,0.000009127929,0.000057330937,0.0000033633876,0.0000021464737,0.000011634731,0.0000028141312,0.99419206,0.00078040926,0.0035314707,0.0014053398,0.0000030629074],"about_ca_topic_score_codex":0.0009568389,"about_ca_topic_score_gemma":0.0004045368,"teacher_disagreement_score":0.003116768,"about_ca_system_score_codex":0.0005070522,"about_ca_system_score_gemma":0.00037333605,"threshold_uncertainty_score":0.010426581},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39203554,0.0033630894,0.5575574,0.00061172066,0.00030294617,0.00022127331,0.00034022442,0.007406651,0.03816115],"genre_scores_gemma":[0.9409128,0.00030253807,0.052061535,0.0001706324,0.00005326641,0.00006488945,0.0003067124,0.00031917813,0.005808338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888533,0.00019928903,0.000058024794,0.00019418726,0.0003319829,0.00033118448],"domain_scores_gemma":[0.99853694,0.00029553747,0.00016054582,0.00042453213,0.00047617627,0.00010626206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005758436,0.0006565927,0.0005890044,0.00066296087,0.00085050904,0.0009066772,0.0022455673,0.0004029701,0.0030340222],"category_scores_gemma":[0.0017580799,0.00036742262,0.00039287383,0.0009723929,0.00036163226,0.0011795779,0.0011198497,0.00068233476,0.00065908174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001847112,0.0008913125,0.012794531,0.0004487551,0.00027487107,0.0004389016,0.00048078646,0.36149666,0.10145627,0.02772,0.022724688,0.46942613],"study_design_scores_gemma":[0.00005547326,0.00027713075,0.002621199,0.00001592215,0.00006500274,0.00016129045,0.000121871555,0.93112063,0.04855918,0.0076150554,0.009352196,0.000035057223],"about_ca_topic_score_codex":0.0031912222,"about_ca_topic_score_gemma":0.0110311555,"teacher_disagreement_score":0.0031912222,"about_ca_system_score_codex":0.0011176079,"about_ca_system_score_gemma":0.0019797338,"threshold_uncertainty_score":0.010149837},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05890015,0.0058417404,0.73952955,0.0006209176,0.0018349993,0.00043058768,0.0012003374,0.0389874,0.15265426],"genre_scores_gemma":[0.388383,0.003434201,0.35634995,0.0005394136,0.00043909438,0.0002887972,0.0052750856,0.0038153003,0.24147528],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99984896,0.000016550777,0.000010338521,0.000023716757,0.000081285194,0.000019084122],"domain_scores_gemma":[0.99991465,0.000013672443,0.000007505125,0.000013644334,0.000032436597,0.000018076116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014833297,0.00050650386,0.00023555993,0.00043999305,0.00019426316,0.0006220277,0.0005941831,0.00022780642,0.024788862],"category_scores_gemma":[0.00034325387,0.00017091172,0.00014907966,0.0004064801,0.00018232367,0.00068968313,0.00046736057,0.0005195839,0.005147866],"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.0006895823,0.00007647399,0.00062261504,0.0004344512,0.000033200937,0.00039436476,0.00012855722,0.008946934,0.17620684,0.0282339,0.09595754,0.6882756],"study_design_scores_gemma":[0.00025529732,0.0009721774,0.002300761,0.00011749058,0.000050019666,0.0018949546,0.00009134474,0.05821397,0.14226626,0.008686282,0.7850498,0.000101650054],"about_ca_topic_score_codex":0.0004324175,"about_ca_topic_score_gemma":0.0011778538,"teacher_disagreement_score":0.024788862,"about_ca_system_score_codex":0.00022052835,"about_ca_system_score_gemma":0.0003376804,"threshold_uncertainty_score":0.08292699},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4004202,0.0048567536,0.5468001,0.00042634868,0.00048724687,0.00018917953,0.0006854357,0.0061604558,0.039974272],"genre_scores_gemma":[0.9256682,0.0006972076,0.065635845,0.000204558,0.000070481576,0.00006607065,0.0003139378,0.00006171561,0.007281985],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999031,0.000010504311,0.0000079343945,0.00002350106,0.000035966204,0.000018908155],"domain_scores_gemma":[0.99979097,0.000031641008,0.00004568749,0.00006121853,0.00005487929,0.000015711697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000101537815,0.00021465246,0.00018637729,0.00038673825,0.00017995934,0.0005586429,0.0012473904,0.00025168856,0.0028268544],"category_scores_gemma":[0.00024109046,0.00013322703,0.00021399322,0.00039187717,0.00022275571,0.001212253,0.0004903252,0.00029230688,0.0006597014],"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.00055862166,0.00012437318,0.0014829022,0.0005542348,0.00011360339,0.000572001,0.00018897421,0.03758515,0.36900124,0.068127185,0.008139141,0.51355255],"study_design_scores_gemma":[0.00012407487,0.0017744664,0.0019465629,0.00010569445,0.00021919915,0.0016712715,0.000122314,0.3444126,0.5457809,0.030854665,0.0728788,0.00010936804],"about_ca_topic_score_codex":0.0001690635,"about_ca_topic_score_gemma":0.00044230954,"teacher_disagreement_score":0.0028268544,"about_ca_system_score_codex":0.00026165292,"about_ca_system_score_gemma":0.00025790412,"threshold_uncertainty_score":0.009456694},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012439993,0.017300453,0.888684,0.002654595,0.004638365,0.00016722646,0.0010282941,0.013818122,0.07046499],"genre_scores_gemma":[0.0318703,0.022219706,0.855947,0.0014766196,0.004657801,0.0008275154,0.0028311836,0.0062196916,0.07395018],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915874,0.00015072117,0.000061105355,0.00013370423,0.00043861382,0.00005715915],"domain_scores_gemma":[0.9987255,0.00025621065,0.000050502233,0.00020656349,0.00067122997,0.00008998009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074027386,0.0009928377,0.000674553,0.0014035392,0.00050376036,0.0017624787,0.0015053864,0.00085392076,0.029870141],"category_scores_gemma":[0.0030111235,0.00092595327,0.00072864076,0.002329893,0.0005316617,0.002045571,0.0012373333,0.002779648,0.015609291],"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.000075105156,0.00007333723,0.00040566202,0.0007618981,0.00009005488,0.00026256283,0.00013929441,0.01981905,0.00934381,0.09956972,0.36717722,0.50228226],"study_design_scores_gemma":[0.000017816437,0.000033927743,0.00033655626,0.000196149,0.000015785088,0.00028443703,0.000023128592,0.053230822,0.00438108,0.06076502,0.88067037,0.000044929297],"about_ca_topic_score_codex":0.0019228918,"about_ca_topic_score_gemma":0.0016860203,"teacher_disagreement_score":0.029870141,"about_ca_system_score_codex":0.00072234333,"about_ca_system_score_gemma":0.0008746094,"threshold_uncertainty_score":0.09992564},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007645167,0.0012769749,0.03189927,0.00040775913,0.00043536385,0.00022244886,0.2567749,0.59459233,0.11362642],"genre_scores_gemma":[0.0073305573,0.0013814459,0.019714572,0.0007472503,0.00022117564,0.00043606883,0.42918614,0.37753505,0.16344781],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992995,0.000059964106,0.000059671347,0.0001217949,0.00031870411,0.00014036769],"domain_scores_gemma":[0.9987896,0.00022805505,0.000050678103,0.00032871295,0.00046522258,0.00013778497],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00085719716,0.0025621222,0.0020388346,0.00232282,0.0005916788,0.0041180663,0.0036065097,0.0016044964,0.7571479],"category_scores_gemma":[0.0042070653,0.0019778109,0.002313412,0.0024802266,0.0003775776,0.003341174,0.003913643,0.0019751969,0.8123825],"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.00018805693,0.000028588005,0.00019021292,0.00070335006,0.000036076606,0.000037698002,0.000036939888,0.00047814002,0.0010541943,0.0012015591,0.9488855,0.047159553],"study_design_scores_gemma":[0.00013152928,0.0000347559,0.0007678195,0.00023654327,0.000028778666,0.00012325199,0.000020491478,0.0018318209,0.0030175177,0.0032620816,0.9904739,0.000071364346],"about_ca_topic_score_codex":0.0034629067,"about_ca_topic_score_gemma":0.0037574996,"teacher_disagreement_score":0.24285209,"about_ca_system_score_codex":0.0009854856,"about_ca_system_score_gemma":0.0009440099,"threshold_uncertainty_score":0.346399},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76991147,0.0008443436,0.22305645,0.000101563,0.00009300082,0.00020544678,0.00011847426,0.0016861977,0.003983111],"genre_scores_gemma":[0.85741323,0.00017263096,0.14106481,0.000027729191,0.000013781248,0.000090765614,0.00019809497,0.000091816524,0.0009270285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889886,0.0003794443,0.00008703547,0.00016630196,0.00036115784,0.000107203596],"domain_scores_gemma":[0.99600595,0.0022493906,0.00039437972,0.00051087805,0.0007354652,0.000103873266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00154898,0.00064605277,0.0005023137,0.0010120122,0.00033098535,0.0005509334,0.00079153344,0.00067026203,0.0009327836],"category_scores_gemma":[0.0067307153,0.00026499043,0.0003007637,0.00092105224,0.00029316006,0.00059744896,0.0004664724,0.0003852149,0.00026733315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089246174,0.00025859216,0.006096842,0.00024346248,0.00006083567,0.000083691346,0.000116728595,0.790291,0.019988783,0.0022671532,0.0007349701,0.17896546],"study_design_scores_gemma":[0.000013193264,0.0003729764,0.001318681,0.000006919916,0.000009584218,0.000038723316,0.000038240145,0.9843016,0.012857818,0.00049466727,0.00054097176,0.000006704314],"about_ca_topic_score_codex":0.0024269165,"about_ca_topic_score_gemma":0.0023147848,"teacher_disagreement_score":0.0024269165,"about_ca_system_score_codex":0.0007340868,"about_ca_system_score_gemma":0.0007946169,"threshold_uncertainty_score":0.008191884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056382053,0.021699289,0.50791484,0.00063479994,0.0018737924,0.00037630385,0.00053823617,0.006464316,0.40411636],"genre_scores_gemma":[0.1587816,0.01843646,0.31523713,0.00056626875,0.0004149429,0.00012847889,0.001301591,0.00095666357,0.50417686],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998585,0.000005534487,0.000004699558,0.00002126865,0.0000994618,0.000010587639],"domain_scores_gemma":[0.99993825,0.000015629867,0.0000031297197,0.000008547725,0.000030673407,0.000003820862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008888382,0.00064404425,0.00031924315,0.0005210159,0.0002940157,0.0010179926,0.00075411523,0.0004409321,0.0113491295],"category_scores_gemma":[0.00018071524,0.0002906437,0.00028767023,0.00069854956,0.00022801699,0.00094340707,0.00029558688,0.0006832418,0.004943722],"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.00011662158,0.000056837474,0.0003059943,0.00047177612,0.000021413642,0.000275426,0.0002605866,0.008956786,0.108835936,0.03919291,0.019670185,0.8218356],"study_design_scores_gemma":[0.000028204795,0.00027053204,0.0009876867,0.00023917507,0.00003599843,0.0014107799,0.000121451136,0.058245026,0.13365372,0.008477202,0.79649013,0.000040099712],"about_ca_topic_score_codex":0.0006780066,"about_ca_topic_score_gemma":0.001188447,"teacher_disagreement_score":0.0113491295,"about_ca_system_score_codex":0.0004346699,"about_ca_system_score_gemma":0.00034550164,"threshold_uncertainty_score":0.03796667},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025115286,0.2339191,0.5648968,0.013769012,0.010690355,0.000093435,0.00043914287,0.001099306,0.17258139],"genre_scores_gemma":[0.06591521,0.22961107,0.2946258,0.0050450605,0.021521444,0.0006826809,0.00076703046,0.0016912443,0.38014048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927145,0.00015700817,0.000045734614,0.00009199066,0.00039389942,0.000039846072],"domain_scores_gemma":[0.99867344,0.00077226997,0.000077095276,0.00019638347,0.00022949328,0.00005125705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009027829,0.0015009608,0.0021641983,0.001695423,0.0006952225,0.0030995703,0.0012407925,0.0020148666,0.021259557],"category_scores_gemma":[0.0028911422,0.00063841365,0.0007320201,0.0028424745,0.0022889944,0.004153338,0.0018004245,0.0045042923,0.011811123],"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.000014286118,0.000039006514,0.00010110073,0.0006778497,0.000033098648,0.000043345426,0.00009949023,0.0042407853,0.00094250357,0.75966746,0.10380685,0.13033417],"study_design_scores_gemma":[0.000009574712,0.000017580922,0.00020582808,0.00013654787,0.00001640226,0.00014236127,0.000026148695,0.015736923,0.00045030104,0.7272997,0.2559416,0.000016975651],"about_ca_topic_score_codex":0.00053001597,"about_ca_topic_score_gemma":0.0005244016,"teacher_disagreement_score":0.021259557,"about_ca_system_score_codex":0.0010891935,"about_ca_system_score_gemma":0.0012386556,"threshold_uncertainty_score":0.07112026},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088675803,0.3709889,0.10859156,0.0070846495,0.012986339,0.00022696923,0.0023078886,0.0042447317,0.4926822],"genre_scores_gemma":[0.0095315175,0.43951133,0.102418855,0.0031175618,0.004419756,0.0005558828,0.0039130123,0.0020313524,0.43450084],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991886,0.000060179027,0.000050800183,0.00007579867,0.0005825361,0.000042043233],"domain_scores_gemma":[0.9989452,0.00048686037,0.000044183405,0.00012520739,0.0003297102,0.00006879878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005803442,0.0014597491,0.0016739857,0.002889331,0.0007681769,0.0036783463,0.0017457713,0.0011369854,0.062998004],"category_scores_gemma":[0.0020273458,0.00097525516,0.00072255713,0.0084902635,0.00075288344,0.0045027784,0.001280959,0.0031258734,0.03552572],"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.000017636707,0.000049719038,0.000078715755,0.001506093,0.000028376398,0.000041114494,0.00012516398,0.0018772674,0.001394337,0.1359001,0.5339684,0.32501316],"study_design_scores_gemma":[0.000007841103,0.000011594334,0.00015308427,0.00039034532,0.000009809382,0.00013859705,0.000027656066,0.0012329336,0.00030157637,0.032941118,0.9647736,0.00001184328],"about_ca_topic_score_codex":0.0014221084,"about_ca_topic_score_gemma":0.002611378,"teacher_disagreement_score":0.062998004,"about_ca_system_score_codex":0.0013714116,"about_ca_system_score_gemma":0.0025392214,"threshold_uncertainty_score":0.21074927},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019796092,0.052401766,0.54123193,0.0040661315,0.0037020412,0.00023326659,0.0010175416,0.017563695,0.35998747],"genre_scores_gemma":[0.15055528,0.036086813,0.36538345,0.0016304607,0.0010216628,0.00036619144,0.0027208445,0.0035734326,0.4386619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981886,0.00002023733,0.000009664894,0.000025189465,0.000097331606,0.00002873278],"domain_scores_gemma":[0.9998766,0.00002713464,0.00000708441,0.000038474995,0.000029430757,0.00002132863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035428838,0.00086315087,0.00037652068,0.00039834328,0.0003312783,0.0014944224,0.001362173,0.0005658889,0.024037423],"category_scores_gemma":[0.00054358697,0.00067288167,0.00039535877,0.0005997848,0.00040893798,0.0025114254,0.001260888,0.001976991,0.0065192557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016640926,0.000060781254,0.0002238978,0.0005416886,0.000051386796,0.00014290196,0.00021310656,0.019374773,0.020293806,0.16905929,0.1910842,0.59878784],"study_design_scores_gemma":[0.000068915804,0.00012161458,0.00044722843,0.0002277698,0.00003178823,0.00041315527,0.00006602907,0.058631547,0.010153185,0.116124846,0.81366014,0.00005379277],"about_ca_topic_score_codex":0.00065627525,"about_ca_topic_score_gemma":0.0014400848,"teacher_disagreement_score":0.024037423,"about_ca_system_score_codex":0.0004886618,"about_ca_system_score_gemma":0.0004380128,"threshold_uncertainty_score":0.08041316},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019884508,0.08497789,0.081276886,0.0043504178,0.017861718,0.00022325612,0.0008051371,0.0029438802,0.8055724],"genre_scores_gemma":[0.0077753426,0.033766378,0.018495502,0.0010426983,0.004009848,0.00014461127,0.0007927359,0.0007862301,0.93318677],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999393,0.000042646003,0.000020701886,0.000077040684,0.0004255788,0.000041083935],"domain_scores_gemma":[0.9994282,0.00012134634,0.000029854898,0.000117548545,0.00021339172,0.00008954083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043370074,0.0018912706,0.0014269603,0.0019279252,0.000856655,0.0031157518,0.0012483448,0.0011686422,0.11255742],"category_scores_gemma":[0.0012816137,0.0006328606,0.00046770793,0.0035390144,0.00072597846,0.0028859233,0.0026444974,0.0030074797,0.08662707],"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.000041296433,0.00005826391,0.000090696194,0.00053923175,0.000023264716,0.000065297994,0.000060265345,0.0012126687,0.0037379286,0.044090703,0.46731937,0.48276103],"study_design_scores_gemma":[0.000007952637,0.00003759558,0.00027172817,0.00018173076,0.000009663422,0.00019789886,0.000025162704,0.0024790366,0.0011754095,0.026668377,0.96893144,0.000013902077],"about_ca_topic_score_codex":0.0003915361,"about_ca_topic_score_gemma":0.0007239987,"teacher_disagreement_score":0.11255742,"about_ca_system_score_codex":0.0006718436,"about_ca_system_score_gemma":0.0008925118,"threshold_uncertainty_score":0.37654203},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21043347,0.0015595776,0.7719282,0.0002667805,0.00013875424,0.00020158169,0.0002979099,0.004354781,0.010818916],"genre_scores_gemma":[0.8027038,0.0006678135,0.19035971,0.00015397064,0.000039502753,0.00021626378,0.0003938595,0.00048154942,0.0049835397],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998324,0.0002964049,0.00010860684,0.0002642593,0.000844049,0.00016264684],"domain_scores_gemma":[0.99596304,0.00075640593,0.0004496794,0.0021424892,0.0006322981,0.000056109373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010526638,0.0006626687,0.0005248414,0.00064667093,0.0003918811,0.0009161452,0.0014715623,0.00063810736,0.0016108918],"category_scores_gemma":[0.0053378884,0.00039565383,0.0004581969,0.0006888519,0.00066278555,0.0016066572,0.00069750444,0.00083529286,0.0010498266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003718934,0.00022963576,0.010771732,0.00055573316,0.00010670075,0.0005633263,0.0005737011,0.13653333,0.51803565,0.046963535,0.0037870358,0.28150767],"study_design_scores_gemma":[0.00003109014,0.00050756073,0.0038844321,0.00005729581,0.00009402397,0.0008986683,0.00010936384,0.48008832,0.47721764,0.015035982,0.022016427,0.00005919423],"about_ca_topic_score_codex":0.0007126909,"about_ca_topic_score_gemma":0.0006785926,"teacher_disagreement_score":0.0016108918,"about_ca_system_score_codex":0.0008093578,"about_ca_system_score_gemma":0.0008707772,"threshold_uncertainty_score":0.005872309},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014362796,0.0020033536,0.8211076,0.0006807882,0.0009765815,0.0004402587,0.0010572625,0.09097747,0.068393916],"genre_scores_gemma":[0.119896844,0.0027066465,0.7378073,0.0011559365,0.00033580005,0.00051230285,0.0050858734,0.009544561,0.12295483],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99967873,0.000040858202,0.000019405876,0.00003512493,0.00017955285,0.000046256348],"domain_scores_gemma":[0.99966717,0.00006995672,0.000024780755,0.000092883674,0.00011093918,0.000034224817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028630134,0.00078093325,0.00033921268,0.0007192389,0.00055178005,0.0010611847,0.0010709092,0.0007379773,0.014029894],"category_scores_gemma":[0.0007217997,0.0005226646,0.00042162335,0.0008276275,0.00032416935,0.0010231365,0.0006299345,0.0010971548,0.0101453075],"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.0005032836,0.00038542703,0.0020717569,0.00076440605,0.00010639876,0.0009961528,0.00030873442,0.02248885,0.12721458,0.058284007,0.20619583,0.58068055],"study_design_scores_gemma":[0.00011812124,0.00031669094,0.0010450956,0.0000827127,0.000043016415,0.0011281883,0.00003662277,0.11522164,0.08900575,0.011326595,0.7815862,0.00008935958],"about_ca_topic_score_codex":0.0011530635,"about_ca_topic_score_gemma":0.0024633352,"teacher_disagreement_score":0.014029894,"about_ca_system_score_codex":0.0003850383,"about_ca_system_score_gemma":0.0007139862,"threshold_uncertainty_score":0.046934664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08377022,0.00051541673,0.8448705,0.00059531507,0.0003057374,0.00019745511,0.0003003496,0.026563233,0.04288176],"genre_scores_gemma":[0.40362072,0.0003755304,0.5765326,0.00038557808,0.00018925058,0.00040285435,0.0010910681,0.0034311083,0.013971288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995491,0.00007151135,0.000027890894,0.000072116294,0.00021538307,0.00006390174],"domain_scores_gemma":[0.9987858,0.00028531006,0.00012968361,0.00031968547,0.00042315634,0.00005641067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045480664,0.0010705405,0.0004286522,0.0006540848,0.00058636203,0.0011673572,0.0016910416,0.0008182664,0.0058471933],"category_scores_gemma":[0.002846999,0.00032328698,0.00042357272,0.0009916235,0.00062361173,0.0014029866,0.0013178274,0.0011102114,0.0019749666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075740804,0.00042120897,0.0045718537,0.00055303634,0.00011543064,0.0007647091,0.0006081958,0.21850917,0.050448578,0.087179124,0.025836417,0.6102349],"study_design_scores_gemma":[0.00008709001,0.00014199122,0.00095162215,0.00004901809,0.00003541283,0.0003142167,0.00007628112,0.9053478,0.034914155,0.026112752,0.03192982,0.000039760696],"about_ca_topic_score_codex":0.0037515694,"about_ca_topic_score_gemma":0.003501894,"teacher_disagreement_score":0.0058471933,"about_ca_system_score_codex":0.00065156433,"about_ca_system_score_gemma":0.0011671865,"threshold_uncertainty_score":0.019560814},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7909873,0.002489937,0.17148484,0.0006314391,0.00013126397,0.00007919502,0.0005756643,0.0066061537,0.027014224],"genre_scores_gemma":[0.941899,0.00050085044,0.049895518,0.0001738385,0.000032502885,0.00011720442,0.0006524911,0.00032399286,0.006404646],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996557,0.00003102778,0.000016001612,0.000040243704,0.00021302344,0.000043905868],"domain_scores_gemma":[0.99866736,0.00047476921,0.00012612663,0.00014659324,0.00054800184,0.00003717435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016389937,0.00028474862,0.0002616754,0.00064028095,0.00017460175,0.00041399355,0.0006157051,0.00028353874,0.0033259986],"category_scores_gemma":[0.001474329,0.00023947077,0.00012753802,0.0005568813,0.00020607204,0.0005177048,0.00036628442,0.00041104306,0.0012575478],"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.00052722514,0.00017682355,0.007186167,0.0003491826,0.000040802042,0.00053836894,0.00019865813,0.0387612,0.7144618,0.009454835,0.008088676,0.22021624],"study_design_scores_gemma":[0.00003278469,0.00038983033,0.009106607,0.00004598086,0.00004683827,0.0008005896,0.000084463325,0.2908088,0.6818883,0.0028527032,0.013908847,0.00003435554],"about_ca_topic_score_codex":0.00070156105,"about_ca_topic_score_gemma":0.0010282397,"teacher_disagreement_score":0.0033259986,"about_ca_system_score_codex":0.00030314445,"about_ca_system_score_gemma":0.000406645,"threshold_uncertainty_score":0.011126578},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048720945,0.0028365362,0.8614678,0.001090759,0.00085642777,0.0001544483,0.0006977911,0.0016683518,0.08250696],"genre_scores_gemma":[0.4097089,0.0035962004,0.5513428,0.00045498268,0.00025989435,0.00053031486,0.001269694,0.0017239593,0.031113366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999853,0.000031490523,0.0000056829813,0.000013981432,0.000076055796,0.00001977762],"domain_scores_gemma":[0.9998597,0.00004917795,0.000008134193,0.00003186838,0.000032389562,0.000018755869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021121709,0.0006769352,0.00078494905,0.00025643027,0.0004536285,0.000680725,0.0012531793,0.00069931283,0.004802397],"category_scores_gemma":[0.0006814328,0.0005005899,0.0006347691,0.00071942504,0.00043083853,0.00087089755,0.0007561651,0.0015263486,0.00119294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000862625,0.000081934675,0.00019577489,0.00015997756,0.00006580134,0.000049013277,0.000052006897,0.84952116,0.010356833,0.08922947,0.006905615,0.043296028],"study_design_scores_gemma":[0.000013993096,0.000008550928,0.000055359866,0.000007961841,0.000003677368,0.000007950186,0.000005026491,0.9772135,0.0013253046,0.017141227,0.0042117313,0.0000056976187],"about_ca_topic_score_codex":0.0016260713,"about_ca_topic_score_gemma":0.0019804952,"teacher_disagreement_score":0.004802397,"about_ca_system_score_codex":0.00047113217,"about_ca_system_score_gemma":0.00061979523,"threshold_uncertainty_score":0.016065657},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049314806,0.03308534,0.4987557,0.0045017945,0.0031499593,0.00028368807,0.00095353404,0.010276951,0.4440616],"genre_scores_gemma":[0.061297685,0.04535177,0.46844804,0.0018540741,0.0026671793,0.0008258999,0.002621985,0.0026034173,0.41432995],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995054,0.00008471098,0.000026595566,0.00009574792,0.0002468028,0.00004081183],"domain_scores_gemma":[0.99974054,0.000070282316,0.000010324187,0.00008794275,0.000064900785,0.000025882655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039046016,0.0010126609,0.0008079673,0.0006720991,0.00077896775,0.0025288765,0.0010646188,0.0008773583,0.032823313],"category_scores_gemma":[0.0010242093,0.0003861889,0.00072087377,0.0016843259,0.00065607915,0.002099831,0.0016563911,0.0015285675,0.020725083],"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.000057010166,0.000040268158,0.00021530634,0.000896709,0.00005991584,0.00031853656,0.0004081168,0.00958743,0.0061793933,0.2931169,0.23252194,0.45659846],"study_design_scores_gemma":[0.000014150856,0.000024011304,0.0001936706,0.00015284674,0.000015153289,0.00027862593,0.000030837327,0.00910169,0.0014252804,0.06267435,0.92607117,0.000018334747],"about_ca_topic_score_codex":0.000627284,"about_ca_topic_score_gemma":0.0006396546,"teacher_disagreement_score":0.032823313,"about_ca_system_score_codex":0.0007080754,"about_ca_system_score_gemma":0.0010476465,"threshold_uncertainty_score":0.10980499},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21021552,0.0008584264,0.75812215,0.0006525088,0.00034846648,0.00029075926,0.00057078694,0.017172007,0.0117693],"genre_scores_gemma":[0.64098597,0.00021467276,0.35070047,0.00010286937,0.00008613274,0.0002122456,0.0011143106,0.00096828165,0.005615162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993154,0.00016469417,0.000041141593,0.000078453006,0.00027097293,0.00012937798],"domain_scores_gemma":[0.9981481,0.0004162763,0.0002213943,0.0007365123,0.00033361322,0.00014407033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007538624,0.00080862665,0.0006052246,0.0011558677,0.0013812747,0.00083759305,0.0014495172,0.0004592162,0.0026767612],"category_scores_gemma":[0.003084764,0.00033623047,0.00040866033,0.0011080655,0.00047954835,0.0011334762,0.0010477523,0.0007499427,0.00084396376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059094804,0.00035161467,0.00450407,0.0003298947,0.0001232572,0.0002873847,0.0007142671,0.50820726,0.07985661,0.022451766,0.023739593,0.35884336],"study_design_scores_gemma":[0.000088100154,0.00016651339,0.0012958527,0.000010712641,0.000024452727,0.00007281671,0.00025652317,0.9516566,0.027579477,0.008997046,0.009809111,0.000042859752],"about_ca_topic_score_codex":0.004362794,"about_ca_topic_score_gemma":0.014484569,"teacher_disagreement_score":0.004362794,"about_ca_system_score_codex":0.00083089375,"about_ca_system_score_gemma":0.001407796,"threshold_uncertainty_score":0.008954644},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5484576,0.0031612054,0.35656717,0.00059890264,0.00046881937,0.0006382117,0.0010562825,0.049909193,0.03914267],"genre_scores_gemma":[0.8740598,0.00034794144,0.11230065,0.00031321193,0.00007510323,0.00021247884,0.0010787469,0.0005396032,0.011072476],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99956053,0.00004644948,0.00003083957,0.00009021306,0.00015167349,0.00012027977],"domain_scores_gemma":[0.9995377,0.000068564805,0.00006561531,0.00015438766,0.00010384351,0.000069825095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003105001,0.0005465457,0.00045094726,0.0004922633,0.0003756828,0.00077309017,0.0018222982,0.0002801263,0.007514499],"category_scores_gemma":[0.00083138916,0.00026761266,0.000340944,0.00039308795,0.00035326832,0.0014892919,0.0015144742,0.0006716538,0.0014042566],"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.007176449,0.00071119046,0.0143316565,0.0016465576,0.0004920149,0.0013856422,0.00078987743,0.039336182,0.3724629,0.03424068,0.057735674,0.46969116],"study_design_scores_gemma":[0.0013685513,0.0047002067,0.014245041,0.00015511311,0.00043821588,0.001854274,0.00034986163,0.36698684,0.39030617,0.0073837307,0.21185555,0.0003564624],"about_ca_topic_score_codex":0.0014201548,"about_ca_topic_score_gemma":0.0026520619,"teacher_disagreement_score":0.007514499,"about_ca_system_score_codex":0.0005377472,"about_ca_system_score_gemma":0.00084279454,"threshold_uncertainty_score":0.025138557},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30326807,0.0010224062,0.6814713,0.0006569266,0.00011019022,0.00018863742,0.000109661436,0.003629317,0.009543483],"genre_scores_gemma":[0.8812775,0.00021591327,0.116557956,0.00014441353,0.000022727421,0.00012553472,0.000085760854,0.00020367726,0.0013665434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974626,0.00005895763,0.000013410672,0.000046817582,0.00008004721,0.00005441925],"domain_scores_gemma":[0.9996655,0.000074677715,0.00007104146,0.00007323563,0.00008363851,0.00003187562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003011964,0.00048416146,0.00023541196,0.00028669141,0.00034338984,0.0004812752,0.0010721551,0.00022430834,0.0008706988],"category_scores_gemma":[0.00076823914,0.00023526947,0.00015877225,0.00034340261,0.0002881786,0.0005395737,0.00031132114,0.0004360949,0.00020240195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038017437,0.0002785896,0.005718488,0.00032810587,0.000066514316,0.00029886334,0.00042525117,0.46880513,0.28219157,0.014808485,0.009517739,0.21718107],"study_design_scores_gemma":[0.000038030503,0.00026020184,0.0014509875,0.000013612955,0.000024305331,0.000095069416,0.00004580185,0.9342742,0.052900277,0.0039639464,0.006916781,0.000016799244],"about_ca_topic_score_codex":0.0016594644,"about_ca_topic_score_gemma":0.0040441765,"teacher_disagreement_score":0.0016594644,"about_ca_system_score_codex":0.0006211468,"about_ca_system_score_gemma":0.0009495563,"threshold_uncertainty_score":0.004506707},"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":"software","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005382783,0.0007816587,0.18433169,0.0015057471,0.001957743,0.0005191566,0.18568377,0.49500546,0.12483206],"genre_scores_gemma":[0.040841226,0.0005074792,0.11762041,0.0016766549,0.0006029379,0.0012065809,0.30259034,0.42035073,0.11460372],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989349,0.0001582678,0.00005116121,0.00022584495,0.0004186584,0.00021103125],"domain_scores_gemma":[0.99801445,0.000373474,0.00010776668,0.00048774778,0.0008207312,0.0001958812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010210931,0.0026317367,0.001333372,0.0016141721,0.0010416792,0.0021554038,0.003803363,0.0014182059,0.27466714],"category_scores_gemma":[0.0056264945,0.001670538,0.0021480261,0.0016600412,0.0004822982,0.0028138114,0.001997419,0.0028270413,0.23181129],"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.0001855367,0.000042137362,0.0003974612,0.00022583874,0.00008025595,0.000055331973,0.000040677864,0.0026058601,0.0013843841,0.003926775,0.9745885,0.016467147],"study_design_scores_gemma":[0.00048342228,0.000070437905,0.0018673411,0.00019422952,0.00009926822,0.0001928195,0.00007690249,0.043407574,0.012406481,0.024237473,0.916802,0.0001620513],"about_ca_topic_score_codex":0.009211437,"about_ca_topic_score_gemma":0.007320432,"teacher_disagreement_score":0.27466714,"about_ca_system_score_codex":0.00097495515,"about_ca_system_score_gemma":0.0020763257,"threshold_uncertainty_score":0.91885316},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06407304,0.001126066,0.8589316,0.00090211915,0.00018167753,0.00018917542,0.00040266637,0.057639625,0.016553992],"genre_scores_gemma":[0.4049974,0.00088722334,0.5759443,0.0004628343,0.00010758248,0.0002890507,0.00096618774,0.0060707,0.01027477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892443,0.00019467715,0.000088517845,0.00017176218,0.00050789927,0.000112787566],"domain_scores_gemma":[0.9980679,0.0008282132,0.00020161177,0.0005118254,0.00032915556,0.0000611518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013240051,0.0005176742,0.00033700356,0.00044800458,0.00049674755,0.0015298744,0.0010390002,0.00048188094,0.004080771],"category_scores_gemma":[0.0034811094,0.00067130086,0.00086921995,0.00037142384,0.0007282246,0.0021608018,0.0010654985,0.001535611,0.0013772465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011249114,0.0003192326,0.011379027,0.00095568417,0.00008608522,0.00062025944,0.0016798065,0.03834612,0.1806803,0.18325192,0.029497685,0.552059],"study_design_scores_gemma":[0.00020554302,0.00046977014,0.0029440392,0.00024289597,0.00010968222,0.0005388441,0.00016250087,0.6019723,0.1539094,0.067479506,0.17181672,0.0001488126],"about_ca_topic_score_codex":0.0026344752,"about_ca_topic_score_gemma":0.003396848,"teacher_disagreement_score":0.004080771,"about_ca_system_score_codex":0.0010175431,"about_ca_system_score_gemma":0.0021696794,"threshold_uncertainty_score":0.01365155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02337624,0.0050932956,0.83935225,0.0042543598,0.0007024813,0.000051654395,0.00043847822,0.0013822208,0.12534903],"genre_scores_gemma":[0.8251333,0.008135211,0.09638803,0.0010437625,0.00126268,0.00029037183,0.0004032559,0.0013490948,0.06599428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945337,0.000104730294,0.000013623766,0.00008731587,0.0002635251,0.0000774616],"domain_scores_gemma":[0.9992937,0.00033144245,0.000058647085,0.00014149165,0.00012429793,0.000050517567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006346557,0.001117773,0.0012307597,0.00056653784,0.0006491916,0.0019083576,0.0020755867,0.001502938,0.007359532],"category_scores_gemma":[0.0030248396,0.0006355334,0.00059628475,0.001216312,0.0018260317,0.0032947233,0.0011404096,0.0023619134,0.0022049334],"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.00005447354,0.000035912737,0.00018077884,0.00009011584,0.000019101108,0.00008321376,0.000053652388,0.28865203,0.001314841,0.6802613,0.011239017,0.018015547],"study_design_scores_gemma":[0.000008888003,0.0000118286025,0.00007892028,0.000010343237,0.0000062227223,0.000037442558,0.00000972946,0.5953054,0.0003079931,0.40058282,0.0036306898,0.0000097422735],"about_ca_topic_score_codex":0.00255667,"about_ca_topic_score_gemma":0.0013807412,"teacher_disagreement_score":0.007359532,"about_ca_system_score_codex":0.0011560153,"about_ca_system_score_gemma":0.0010761905,"threshold_uncertainty_score":0.024620116},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015282139,0.00088952045,0.9578746,0.00046700973,0.0005471826,0.00008146371,0.00016457534,0.0035381953,0.021155313],"genre_scores_gemma":[0.70613396,0.0013791355,0.247694,0.0004435406,0.00094847,0.0003403961,0.00097206724,0.0027497367,0.039338764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99449867,0.0007730934,0.00047016895,0.00096571085,0.0025500031,0.0007423866],"domain_scores_gemma":[0.9874801,0.0054712184,0.0008161306,0.004082806,0.0018188198,0.0003309232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003354998,0.0013828197,0.0010975809,0.0023422118,0.0014439112,0.0037839687,0.0024190915,0.0016140299,0.008132302],"category_scores_gemma":[0.016389314,0.0011682076,0.0013956618,0.0019050961,0.0044711195,0.008214443,0.004698111,0.0049032625,0.0019564386],"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.00015191578,0.000053609747,0.00047247065,0.00016157923,0.000022595776,0.0001659254,0.00044022687,0.010936347,0.002950045,0.90639573,0.0045174966,0.07373212],"study_design_scores_gemma":[0.000027808257,0.000040618474,0.00014658191,0.0000708134,0.000033258806,0.00013991215,0.000080246224,0.043138124,0.0080263605,0.9337695,0.014489133,0.000037701004],"about_ca_topic_score_codex":0.0012788007,"about_ca_topic_score_gemma":0.0010193513,"teacher_disagreement_score":0.008132302,"about_ca_system_score_codex":0.0018608015,"about_ca_system_score_gemma":0.0014757168,"threshold_uncertainty_score":0.027205288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35612965,0.0018530989,0.5575731,0.00050218956,0.00046321974,0.00039237438,0.0005135033,0.052778766,0.02979412],"genre_scores_gemma":[0.8377531,0.0004754076,0.15024836,0.00050963653,0.000088544955,0.00018858323,0.0007594044,0.002095863,0.007881062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991455,0.00013686021,0.00004528126,0.00014867159,0.000299462,0.00022419066],"domain_scores_gemma":[0.9982181,0.00035393628,0.00021062598,0.00091709354,0.00020458888,0.00009565425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039354406,0.0011453442,0.000592802,0.00056510384,0.00056561467,0.0011405814,0.0016642562,0.00058639277,0.0031223898],"category_scores_gemma":[0.002537932,0.00054801756,0.00059296784,0.0006418038,0.00067289383,0.0017087758,0.0022861364,0.0010106942,0.0010424043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017109776,0.00073003303,0.017477741,0.0007911559,0.0001850884,0.0011240904,0.001027158,0.093690775,0.18244421,0.023111662,0.0347744,0.6429327],"study_design_scores_gemma":[0.00014184596,0.0007737266,0.0071826344,0.00007526058,0.00012623948,0.00094283745,0.00029828257,0.7551237,0.17963319,0.015098328,0.040489133,0.00011486291],"about_ca_topic_score_codex":0.0022840523,"about_ca_topic_score_gemma":0.002819663,"teacher_disagreement_score":0.0031223898,"about_ca_system_score_codex":0.00047380957,"about_ca_system_score_gemma":0.0013128201,"threshold_uncertainty_score":0.010445416},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5673261,0.00091899635,0.40860522,0.0002959149,0.00024031856,0.00027987215,0.0001419126,0.012929816,0.009261944],"genre_scores_gemma":[0.686456,0.00026082786,0.30750552,0.00015940468,0.000026088144,0.00019304437,0.00040680534,0.0012010741,0.0037912084],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998912,0.00021582111,0.00012141339,0.00020532747,0.00037025867,0.00017520382],"domain_scores_gemma":[0.99794465,0.0007876951,0.00029260255,0.0005538717,0.00036469853,0.000056361765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082985015,0.0007303015,0.0005410611,0.0008078753,0.00036867344,0.00095021015,0.0016091495,0.00035600952,0.0013550945],"category_scores_gemma":[0.0032089057,0.00032352007,0.00048799737,0.0008123302,0.0005576956,0.0012549489,0.0008389681,0.0009603021,0.0005406623],"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.0014021706,0.00065337244,0.01343465,0.00047443327,0.00010897633,0.0004939483,0.0007114938,0.15144354,0.24126118,0.023644399,0.0049975677,0.5613743],"study_design_scores_gemma":[0.0001266136,0.00067702157,0.0025355464,0.000051430503,0.00009396561,0.00028663155,0.00020053146,0.6685751,0.30413678,0.0059066336,0.017333597,0.000076090364],"about_ca_topic_score_codex":0.0020718202,"about_ca_topic_score_gemma":0.003913171,"teacher_disagreement_score":0.0020718202,"about_ca_system_score_codex":0.00078347273,"about_ca_system_score_gemma":0.002273349,"threshold_uncertainty_score":0.005684495},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27714577,0.0011000816,0.7002943,0.00016775458,0.00011581862,0.0001767698,0.00040093026,0.014628446,0.0059700566],"genre_scores_gemma":[0.84727234,0.00037049985,0.14788835,0.00007253941,0.000040985473,0.00008633933,0.00039646856,0.00045283747,0.0034195923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852115,0.0002748963,0.000080358535,0.00019298808,0.0007656346,0.00016499653],"domain_scores_gemma":[0.9956007,0.0015997683,0.00065525033,0.0013324913,0.0007306378,0.00008111577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063439476,0.0010357073,0.00050030224,0.0017963714,0.00032974413,0.0008285649,0.0010269823,0.0005858411,0.0019319629],"category_scores_gemma":[0.0042001694,0.00038925748,0.0003707054,0.0014036275,0.00035077802,0.0011915789,0.0005858755,0.0007604872,0.0006666985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010350372,0.0004653348,0.036932934,0.0005851481,0.00016004535,0.00030149237,0.00051993225,0.058908574,0.20864052,0.009409627,0.0039283093,0.67911303],"study_design_scores_gemma":[0.000054820874,0.0010326671,0.0260935,0.00008159706,0.00014951966,0.00092292484,0.00012924234,0.5638809,0.3831405,0.0045175254,0.019880481,0.00011637321],"about_ca_topic_score_codex":0.0014523634,"about_ca_topic_score_gemma":0.0016468297,"teacher_disagreement_score":0.0019319629,"about_ca_system_score_codex":0.000500041,"about_ca_system_score_gemma":0.001086923,"threshold_uncertainty_score":0.006463051},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31009746,0.0013770106,0.6344497,0.00057756825,0.00042390975,0.00019533181,0.00017496277,0.0045474493,0.04815659],"genre_scores_gemma":[0.8468818,0.0003261035,0.14254306,0.00017152584,0.000072658746,0.000056411463,0.000102463106,0.00011904624,0.009726924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998964,0.00001695241,0.00000703644,0.000011848106,0.00004753392,0.00002018543],"domain_scores_gemma":[0.99971455,0.00010627542,0.000061063074,0.000039456576,0.000057346057,0.00002129607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010860147,0.0002701135,0.00013106328,0.00027694547,0.0002625941,0.00074806256,0.00048744015,0.00019042313,0.0052308934],"category_scores_gemma":[0.0006150655,0.00012079446,0.000119371274,0.00027684253,0.00019387716,0.0004701102,0.00015783352,0.0004587327,0.0005165174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006295965,0.00024475993,0.0027155636,0.00044643757,0.00004054954,0.00047580898,0.0002952064,0.060395256,0.31562015,0.18197644,0.010585706,0.42657453],"study_design_scores_gemma":[0.00021131134,0.001402426,0.0035517197,0.00009718518,0.00008974456,0.00053941406,0.0001583177,0.5733856,0.29691634,0.040502425,0.08308846,0.00005703222],"about_ca_topic_score_codex":0.0013405757,"about_ca_topic_score_gemma":0.0037614808,"teacher_disagreement_score":0.0052308934,"about_ca_system_score_codex":0.0008461068,"about_ca_system_score_gemma":0.000748158,"threshold_uncertainty_score":0.01749909},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102064155,0.00040987646,0.8574445,0.00037527105,0.00019157887,0.00021095674,0.00056774094,0.029354211,0.009381718],"genre_scores_gemma":[0.3032545,0.00018919588,0.6865802,0.0002546475,0.000032877502,0.00027070526,0.00094985304,0.0031854848,0.0052826162],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99925774,0.00016035543,0.00008743235,0.00013520289,0.00023439809,0.00012485776],"domain_scores_gemma":[0.99871707,0.00046125532,0.00010064251,0.00044745643,0.00023100132,0.000042645133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096689654,0.0006179909,0.00042085518,0.0006117331,0.00031048764,0.0011045228,0.0015292554,0.00048113236,0.0039894576],"category_scores_gemma":[0.0026065302,0.00078860816,0.0008022082,0.00060814375,0.000505479,0.002500514,0.0011166214,0.00083728065,0.0008836775],"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.0014204631,0.0004683406,0.0054433714,0.0010844362,0.00017237209,0.0010325266,0.00059923896,0.21405326,0.11277046,0.09961958,0.026970617,0.5363654],"study_design_scores_gemma":[0.0002624106,0.00041733935,0.00079245213,0.00012031724,0.00011051413,0.00043237215,0.000099834055,0.80547494,0.11826501,0.025109485,0.048830368,0.000084926745],"about_ca_topic_score_codex":0.0008665803,"about_ca_topic_score_gemma":0.0014283098,"teacher_disagreement_score":0.0039894576,"about_ca_system_score_codex":0.0006257697,"about_ca_system_score_gemma":0.0017892357,"threshold_uncertainty_score":0.013346076},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03343087,0.00037673957,0.9451532,0.0010779029,0.00021841163,0.00017182034,0.00065531145,0.004239784,0.014676048],"genre_scores_gemma":[0.48041952,0.00060467917,0.4953964,0.0008435478,0.00015387176,0.00074555795,0.0014389609,0.0009769521,0.019420408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800783,0.00039265247,0.00017942548,0.00060282234,0.00056385313,0.00025350437],"domain_scores_gemma":[0.9959577,0.0014385724,0.00029219183,0.001550697,0.0005593621,0.00020156152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010211758,0.0008012891,0.0008574855,0.0005277633,0.0012672438,0.002892722,0.0024808755,0.0013838257,0.00648897],"category_scores_gemma":[0.0056236354,0.000502608,0.0015849228,0.0006270542,0.0029128888,0.0040548774,0.0027523781,0.0021859028,0.0014281947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006300619,0.00013631958,0.0031495045,0.00036106782,0.00008356183,0.00035972157,0.0007336762,0.19698156,0.01374764,0.7166172,0.007375579,0.059824035],"study_design_scores_gemma":[0.00008479263,0.00022285226,0.0003438391,0.00008650278,0.000096216514,0.00019493779,0.00013012631,0.56299937,0.012515033,0.38185665,0.04139783,0.00007178778],"about_ca_topic_score_codex":0.005468844,"about_ca_topic_score_gemma":0.006451314,"teacher_disagreement_score":0.00648897,"about_ca_system_score_codex":0.0014333909,"about_ca_system_score_gemma":0.0025435453,"threshold_uncertainty_score":0.021707773},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030465059,0.07694,0.21440971,0.0039391527,0.018950528,0.00028730574,0.0011782151,0.0051179826,0.67613065],"genre_scores_gemma":[0.00914619,0.029665,0.039243136,0.00094142166,0.0028763318,0.0001722628,0.0010263043,0.0009300204,0.9159993],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996259,0.000029692948,0.000014400672,0.000045977587,0.00026076037,0.000023180975],"domain_scores_gemma":[0.99950683,0.000126423,0.000021686134,0.00008927535,0.0002018566,0.000053971813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028198326,0.0015876052,0.0012485666,0.0012251607,0.0006636411,0.0022033942,0.0010651534,0.00085097144,0.08372239],"category_scores_gemma":[0.0010687577,0.0005903848,0.00034045565,0.0028729376,0.00047567335,0.0022147305,0.0014021085,0.0022343092,0.06764051],"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.000043923636,0.000055701395,0.00010780444,0.00048512995,0.000026303396,0.00007135985,0.000060878498,0.0019743745,0.0044163247,0.03467409,0.49418038,0.4639038],"study_design_scores_gemma":[0.000009284378,0.00003804432,0.00035279812,0.00012353863,0.00001520655,0.00024065604,0.00002280567,0.00521572,0.0014500654,0.022137305,0.9703802,0.000014311331],"about_ca_topic_score_codex":0.00049533666,"about_ca_topic_score_gemma":0.0008813282,"teacher_disagreement_score":0.08372239,"about_ca_system_score_codex":0.0004470258,"about_ca_system_score_gemma":0.00070844026,"threshold_uncertainty_score":0.28007925},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8959454,0.0010726401,0.04018635,0.00022045369,0.00006741455,0.00041618958,0.04290358,0.012793053,0.006394937],"genre_scores_gemma":[0.6443479,0.00066954276,0.16691744,0.00014490845,0.000054943004,0.0007586406,0.18254364,0.0018393935,0.0027236114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992143,0.00008848242,0.000084594445,0.00014334075,0.00037388733,0.00009542399],"domain_scores_gemma":[0.99809355,0.0006240714,0.0002767457,0.0003257644,0.0005985499,0.00008125422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050778344,0.0011801567,0.0002578092,0.0038464465,0.00042334665,0.0005019779,0.000678884,0.0003933856,0.0009243944],"category_scores_gemma":[0.0034070378,0.0003342534,0.00057175825,0.0035592269,0.00029676463,0.0005704168,0.00058940565,0.0006130645,0.0007454942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089714414,0.0013040411,0.18151553,0.0016330094,0.0002530889,0.0014170306,0.00082465465,0.13476527,0.106035665,0.0070447614,0.08576477,0.47854495],"study_design_scores_gemma":[0.00022672134,0.0010865679,0.25319904,0.00015343704,0.00013532198,0.00094229233,0.0007160356,0.55603826,0.11525989,0.007612487,0.0645082,0.000121764075],"about_ca_topic_score_codex":0.005133568,"about_ca_topic_score_gemma":0.008446313,"teacher_disagreement_score":0.005133568,"about_ca_system_score_codex":0.0004436505,"about_ca_system_score_gemma":0.0012424758,"threshold_uncertainty_score":0.010207355},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9108822,0.0031776885,0.073952414,0.0003338159,0.00020638516,0.00023580469,0.00037468414,0.004576679,0.0062604365],"genre_scores_gemma":[0.9826757,0.00024872398,0.016025491,0.00010610542,0.000021175172,0.000048998052,0.00017286373,0.000082398896,0.0006184688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988921,0.0001445511,0.00007759602,0.00028333277,0.0003003925,0.00030194517],"domain_scores_gemma":[0.998156,0.00050312944,0.000207907,0.0003771048,0.0006281763,0.00012771308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006764289,0.0007886302,0.00047054217,0.0007193016,0.0006585292,0.0011922403,0.0024393687,0.00049173407,0.002178874],"category_scores_gemma":[0.0031116726,0.00026862932,0.00020677825,0.00069901865,0.0003936326,0.0015285136,0.00046587203,0.00054456294,0.00047344412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002951434,0.0009105183,0.015758345,0.0008367453,0.00031741394,0.0007846101,0.0004639635,0.40976456,0.21526133,0.0039937133,0.012384099,0.33657324],"study_design_scores_gemma":[0.00013750192,0.0005965348,0.0030878156,0.000035765916,0.00011160505,0.00024611593,0.00022676938,0.8234235,0.16584362,0.0013219952,0.0049132714,0.000055533124],"about_ca_topic_score_codex":0.005270358,"about_ca_topic_score_gemma":0.0060821753,"teacher_disagreement_score":0.005270358,"about_ca_system_score_codex":0.0013102856,"about_ca_system_score_gemma":0.0013186302,"threshold_uncertainty_score":0.010479391},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021893676,0.010509128,0.80652744,0.098464936,0.0026979442,0.00014074109,0.0005789799,0.0031699694,0.05601715],"genre_scores_gemma":[0.49893773,0.015982652,0.4493163,0.010304521,0.0067678886,0.00055376114,0.0009129925,0.002685321,0.014538807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98521674,0.004725584,0.0010311466,0.0029234714,0.005083847,0.0010192723],"domain_scores_gemma":[0.87201935,0.087160416,0.0024450715,0.023861129,0.012528739,0.0019853823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018072335,0.001573958,0.0017080682,0.0015018772,0.0020021324,0.0056043863,0.0068971133,0.0035511844,0.014320699],"category_scores_gemma":[0.104733326,0.0012990631,0.0017082073,0.001956772,0.01216016,0.037008215,0.0053414395,0.015251615,0.0035201656],"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.00022984114,0.00012281093,0.0026594833,0.0005977432,0.00009018469,0.0005553768,0.0011991975,0.032099463,0.0013713145,0.82544214,0.027946154,0.107686326],"study_design_scores_gemma":[0.000039876515,0.000036013786,0.0003319155,0.00024229143,0.000023578086,0.00020755337,0.00027112692,0.036356907,0.0010880538,0.9434403,0.017911466,0.000050900213],"about_ca_topic_score_codex":0.005474563,"about_ca_topic_score_gemma":0.0028111448,"teacher_disagreement_score":0.018072335,"about_ca_system_score_codex":0.0035230014,"about_ca_system_score_gemma":0.0032460855,"threshold_uncertainty_score":0.09557682},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16987477,0.00023082319,0.8185904,0.00012843007,0.000064174965,0.00010553575,0.000106758176,0.0023674872,0.008531667],"genre_scores_gemma":[0.8176416,0.00020190747,0.17994219,0.00003763018,0.00001661114,0.00015459597,0.00010564711,0.00018880877,0.001711045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996113,0.00011192584,0.000017215449,0.000028445747,0.00018697149,0.00004416167],"domain_scores_gemma":[0.999022,0.00059696916,0.000071206734,0.00015592546,0.00011504637,0.00003883243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004949341,0.00057264155,0.00044499416,0.000303156,0.0003945967,0.0004914365,0.0009948683,0.00053242466,0.001485281],"category_scores_gemma":[0.0013874605,0.0003616454,0.0005090323,0.00029700974,0.00038935398,0.00071734784,0.00063958205,0.0007337543,0.00023537717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011601204,0.000053412045,0.0014034647,0.000072863855,0.00003597716,0.00015483584,0.00010122823,0.947188,0.02405783,0.0074531618,0.00047663355,0.018886525],"study_design_scores_gemma":[0.000009909525,0.000037729667,0.00014193934,0.0000028241418,0.0000036661297,0.000027322825,0.0000060993784,0.9933964,0.004818874,0.0008324385,0.00071696145,0.0000058291776],"about_ca_topic_score_codex":0.0017280023,"about_ca_topic_score_gemma":0.0016268146,"teacher_disagreement_score":0.0017280023,"about_ca_system_score_codex":0.0003285924,"about_ca_system_score_gemma":0.0005820867,"threshold_uncertainty_score":0.0049687624},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47711948,0.0059578703,0.47511378,0.0010725945,0.00007545774,0.000113637536,0.00023089573,0.00051744434,0.039798703],"genre_scores_gemma":[0.99050117,0.0009107596,0.005949124,0.00006458331,0.000028476521,0.000039649236,0.000052993026,0.00006199118,0.0023912531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990343,0.00022120976,0.000028902483,0.00011120102,0.00030074368,0.00030370895],"domain_scores_gemma":[0.99750596,0.0014722237,0.00033432548,0.00023604308,0.00038286508,0.00006856652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009772279,0.00072712026,0.00068933034,0.0012762321,0.00054358336,0.0011530756,0.0012116411,0.00076024415,0.0015598179],"category_scores_gemma":[0.006744977,0.00039911494,0.0004518849,0.0009913769,0.00094289077,0.0025058577,0.00091815373,0.0006882984,0.0003885755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008431856,0.0000693005,0.0019151053,0.00009265255,0.000034944023,0.00024480448,0.0001505554,0.9046546,0.007904184,0.0741899,0.00094798603,0.009711549],"study_design_scores_gemma":[0.0000027972374,0.000012098174,0.0002954035,0.000009271323,0.000007246064,0.000048434526,0.00003628592,0.9909039,0.001163949,0.0070496965,0.00046511958,0.000005890064],"about_ca_topic_score_codex":0.0042995308,"about_ca_topic_score_gemma":0.0015792414,"teacher_disagreement_score":0.0042995308,"about_ca_system_score_codex":0.0017400525,"about_ca_system_score_gemma":0.00078580895,"threshold_uncertainty_score":0.012625039},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94209385,0.00042527096,0.04108875,0.0002837834,0.00012204476,0.00019343988,0.0005614894,0.0017853271,0.013445988],"genre_scores_gemma":[0.9775409,0.00012015325,0.015563191,0.000105290696,0.000013861197,0.00013445788,0.0003252564,0.00024575158,0.0059511466],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99977154,0.000023267836,0.000009390384,0.00003812158,0.00010791647,0.00004977656],"domain_scores_gemma":[0.9996588,0.000050118273,0.00007159598,0.00013313162,0.000054232343,0.000032051597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001916333,0.00036283938,0.00022302434,0.00033390083,0.00019385664,0.00038604703,0.0005723002,0.00044985887,0.004591701],"category_scores_gemma":[0.0013029601,0.00018465283,0.00022742512,0.00026929603,0.0003749818,0.0002908197,0.00064216997,0.0004162218,0.00081398344],"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.00018981393,0.000057350862,0.0024891002,0.0002430259,0.000025607267,0.00068796426,0.00028557642,0.01759719,0.93331975,0.004875872,0.002380168,0.037848648],"study_design_scores_gemma":[0.00007340303,0.0014399665,0.017179085,0.000052841842,0.00003408821,0.000739127,0.00011916102,0.036023565,0.89375085,0.0012784507,0.04926389,0.00004554022],"about_ca_topic_score_codex":0.00021767183,"about_ca_topic_score_gemma":0.00023321544,"teacher_disagreement_score":0.004591701,"about_ca_system_score_codex":0.00024424164,"about_ca_system_score_gemma":0.00015744768,"threshold_uncertainty_score":0.015360773},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2716621,0.0033854432,0.7022413,0.0009682978,0.00025546298,0.00012834305,0.00013100788,0.005349688,0.015878394],"genre_scores_gemma":[0.8924975,0.00029255403,0.10312131,0.00013281415,0.000048094393,0.00013129649,0.00019540876,0.00019265205,0.003388313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993506,0.00017605744,0.00003621472,0.00006461774,0.00026219425,0.00011027399],"domain_scores_gemma":[0.9985682,0.00035880768,0.00011505323,0.00042150676,0.00045258395,0.000083808925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000800283,0.0002488047,0.00034466438,0.00051310455,0.0007067106,0.0008489054,0.0013012295,0.0004208347,0.001695791],"category_scores_gemma":[0.0025380102,0.00025665725,0.0002648227,0.00071322045,0.00061040005,0.0011001843,0.0011548228,0.00079755945,0.00029110876],"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.00136445,0.0002850421,0.007856632,0.0003881313,0.00018870171,0.0006277128,0.00069536496,0.4286188,0.07998318,0.1387772,0.023666965,0.31754783],"study_design_scores_gemma":[0.00015651196,0.00021269878,0.0007033402,0.000021346397,0.000039561477,0.00009305476,0.00006992908,0.9556498,0.015344269,0.018062051,0.009624242,0.000023168443],"about_ca_topic_score_codex":0.0032591948,"about_ca_topic_score_gemma":0.007222704,"teacher_disagreement_score":0.0032591948,"about_ca_system_score_codex":0.0007856618,"about_ca_system_score_gemma":0.001265959,"threshold_uncertainty_score":0.006480396},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00782619,0.00013670501,0.91009367,0.00042347057,0.00015862763,0.000050767107,0.00043436003,0.07155048,0.0093257185],"genre_scores_gemma":[0.24546278,0.00048677943,0.6886123,0.0012003535,0.00016102803,0.00025890546,0.0019636052,0.04524636,0.016608002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983919,0.00030300464,0.00017222617,0.000327748,0.00064952247,0.00015554563],"domain_scores_gemma":[0.9950982,0.0019900538,0.00024794255,0.0017652485,0.0007735288,0.00012503198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00136145,0.0009468979,0.00063264015,0.00045564648,0.0005138891,0.0031382232,0.002136452,0.00084600324,0.008978472],"category_scores_gemma":[0.010256591,0.00078133814,0.0009043985,0.0006483578,0.001302297,0.0046150233,0.0019188677,0.002141869,0.0068571568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015402592,0.00026423126,0.0050700624,0.0012153322,0.00015316163,0.0014807261,0.0020881065,0.04127027,0.107751004,0.22776866,0.09845169,0.51294655],"study_design_scores_gemma":[0.0002715507,0.0001848979,0.0011588588,0.00038408683,0.00009328371,0.0010299175,0.00034244076,0.2704566,0.2604797,0.19899179,0.26639894,0.00020787421],"about_ca_topic_score_codex":0.0014893089,"about_ca_topic_score_gemma":0.002341793,"teacher_disagreement_score":0.008978472,"about_ca_system_score_codex":0.00081289856,"about_ca_system_score_gemma":0.0013972983,"threshold_uncertainty_score":0.030036032},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6536356,0.04655086,0.16571239,0.01730057,0.004638428,0.00076312164,0.0029311236,0.01858522,0.08988252],"genre_scores_gemma":[0.47508967,0.020335555,0.39175087,0.004419614,0.0005113106,0.00026990418,0.011731049,0.023913499,0.071978524],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947619,0.0011785321,0.00035553056,0.0007195252,0.0024963163,0.00048824743],"domain_scores_gemma":[0.98068625,0.0035036937,0.00073856756,0.0033648356,0.010985201,0.00072142185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009303875,0.00064310647,0.00039324592,0.0018058188,0.0015540229,0.0019897001,0.0013117404,0.0008602016,0.0020555856],"category_scores_gemma":[0.021786988,0.0006225494,0.00068702665,0.0014991345,0.0011616905,0.0027593512,0.0013230698,0.0030712879,0.0019941174],"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.00044679712,0.00034475137,0.011435601,0.00074546086,0.00010301865,0.0007119359,0.0062624943,0.008018971,0.043304447,0.007609345,0.08671958,0.8342977],"study_design_scores_gemma":[0.000070385584,0.00091290043,0.01620817,0.0009048995,0.00012317374,0.001103375,0.0021865189,0.0049964855,0.059347376,0.0016645957,0.9123265,0.00015554755],"about_ca_topic_score_codex":0.023594936,"about_ca_topic_score_gemma":0.03274379,"teacher_disagreement_score":0.023594936,"about_ca_system_score_codex":0.002737822,"about_ca_system_score_gemma":0.0037085582,"threshold_uncertainty_score":0.04920423},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88514334,0.0018011044,0.10134285,0.00024377296,0.00014541169,0.000065475826,0.00013875835,0.002272667,0.008846635],"genre_scores_gemma":[0.956301,0.0006127698,0.041320648,0.000041173156,0.000027733604,0.000033717384,0.0001996355,0.00016582798,0.001297572],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986619,0.0003891475,0.00009177248,0.0001964445,0.0004031894,0.00025749966],"domain_scores_gemma":[0.99653435,0.0020545875,0.00026987397,0.000677397,0.0003521153,0.00011167467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083244307,0.0008900028,0.0005391887,0.00047100557,0.00034638913,0.000726119,0.00055642927,0.00036288556,0.001458884],"category_scores_gemma":[0.0062278993,0.00036268047,0.0002652164,0.00082402467,0.00030077202,0.0014497738,0.0004735317,0.0005419336,0.0005590423],"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.0046860906,0.00042625837,0.013558799,0.00062091416,0.00015545728,0.00069782836,0.00030982902,0.28037414,0.23067176,0.007582647,0.0042868583,0.45662934],"study_design_scores_gemma":[0.00012541523,0.0022355702,0.019142833,0.00008851582,0.00013400053,0.0011177914,0.00021102342,0.60144895,0.36164588,0.0040264656,0.009729236,0.000094379386],"about_ca_topic_score_codex":0.00083231344,"about_ca_topic_score_gemma":0.0007185353,"teacher_disagreement_score":0.001458884,"about_ca_system_score_codex":0.00039677465,"about_ca_system_score_gemma":0.00038414646,"threshold_uncertainty_score":0.0048804283},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025437953,0.0022913916,0.9798139,0.00026407078,0.00031332782,0.00006884698,0.0003931944,0.008289999,0.00831098],"genre_scores_gemma":[0.012294319,0.008879895,0.94269764,0.0004601626,0.0013688445,0.00066849333,0.0025769803,0.006004503,0.025049211],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984358,0.00025844696,0.00016684206,0.00017237342,0.0008759248,0.00009067256],"domain_scores_gemma":[0.998178,0.0007728098,0.0001223679,0.00036671464,0.0004825195,0.00007765176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013289656,0.0017070408,0.001225868,0.0021306886,0.0008786308,0.00238416,0.0027762703,0.0013338767,0.037352357],"category_scores_gemma":[0.0054213586,0.0012908359,0.00172001,0.004448246,0.0008975827,0.0039274953,0.0025689038,0.004447423,0.028702714],"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.00006557289,0.00013360879,0.000300355,0.0016436913,0.00008176725,0.00029114544,0.00024151044,0.020907482,0.006293049,0.14590636,0.12480556,0.6993298],"study_design_scores_gemma":[0.000057829366,0.000055119526,0.00041797318,0.00034047154,0.000029846944,0.00080578844,0.00004628044,0.07349822,0.0070371553,0.2446115,0.6729926,0.00010730078],"about_ca_topic_score_codex":0.00090031716,"about_ca_topic_score_gemma":0.0010565127,"teacher_disagreement_score":0.037352357,"about_ca_system_score_codex":0.000520394,"about_ca_system_score_gemma":0.0010127645,"threshold_uncertainty_score":0.12495607},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07639373,0.007144347,0.87386286,0.015092681,0.00039287255,0.00017636693,0.000104386876,0.00053499575,0.026297789],"genre_scores_gemma":[0.35457253,0.009158249,0.62287384,0.0016592147,0.0012004722,0.0005890395,0.00013439516,0.00058096874,0.0092314035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982974,0.0008596939,0.00008854854,0.00018846053,0.00039392363,0.00017201126],"domain_scores_gemma":[0.9970289,0.0021273524,0.00017454114,0.00032115736,0.00020295226,0.00014507152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025462927,0.00056007435,0.0010219095,0.00035820843,0.001416985,0.002426965,0.0024768277,0.0012719459,0.0028655655],"category_scores_gemma":[0.00525952,0.00072755385,0.0008369205,0.00087327074,0.0021267515,0.004834764,0.0026198318,0.0028370707,0.000579303],"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.00016018038,0.00014621892,0.0022596554,0.0012556443,0.00019352949,0.00054548215,0.0008119792,0.3496215,0.007652828,0.47047147,0.0104842195,0.15639731],"study_design_scores_gemma":[0.00009230993,0.00015664591,0.000991335,0.00017997091,0.000102712096,0.0004929024,0.00071872777,0.47373834,0.003937556,0.4809798,0.038541436,0.00006828046],"about_ca_topic_score_codex":0.0014132479,"about_ca_topic_score_gemma":0.002538387,"teacher_disagreement_score":0.0028655655,"about_ca_system_score_codex":0.00080306444,"about_ca_system_score_gemma":0.0016330073,"threshold_uncertainty_score":0.013466239},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028107343,0.00010950283,0.9633641,0.000053250584,0.000029461913,0.000094924544,0.00007946074,0.006053529,0.002108307],"genre_scores_gemma":[0.18793367,0.0001635796,0.8060427,0.000085924126,0.000017887842,0.0001831568,0.00044773688,0.0009415017,0.004183788],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999534,0.00010426785,0.000042163312,0.00008597189,0.00019217632,0.000041450014],"domain_scores_gemma":[0.9995229,0.00015820788,0.00006315699,0.00012213612,0.00011600373,0.000017572955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041239534,0.00038284846,0.00024680165,0.0006516879,0.00028685873,0.00043195894,0.0007684423,0.0003505163,0.0025215896],"category_scores_gemma":[0.0015634319,0.00020580205,0.0002246478,0.00079101237,0.00032936488,0.0006566676,0.00042258785,0.00044809023,0.000680083],"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.00040722577,0.00011573598,0.0016673915,0.00013811287,0.000023058537,0.0003257873,0.00023663045,0.03868669,0.12974282,0.042884193,0.00610099,0.77967143],"study_design_scores_gemma":[0.00012571996,0.00036072053,0.0018116964,0.000051324172,0.00005337002,0.0006151596,0.00006219181,0.5554757,0.36086267,0.038740844,0.04177446,0.00006605192],"about_ca_topic_score_codex":0.0013062404,"about_ca_topic_score_gemma":0.0016408445,"teacher_disagreement_score":0.0025215896,"about_ca_system_score_codex":0.00053814665,"about_ca_system_score_gemma":0.0006577922,"threshold_uncertainty_score":0.008435607},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7783025,0.0015764397,0.2152404,0.0003590231,0.00010042632,0.000052469863,0.000042261523,0.0027402018,0.0015864047],"genre_scores_gemma":[0.9568216,0.00011685549,0.04218397,0.000078022626,0.000015500078,0.000014655404,0.000033662658,0.0002409956,0.00049467105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99484104,0.0017089023,0.0003227449,0.0004583964,0.0021867442,0.00048216654],"domain_scores_gemma":[0.96707946,0.020593135,0.004651559,0.004741017,0.0024699299,0.00046489935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029781573,0.0007732883,0.0005449823,0.00051112904,0.0009618093,0.0010071727,0.0014766346,0.00056061754,0.0008785692],"category_scores_gemma":[0.021300022,0.0005987752,0.00049109675,0.00087351043,0.0008827948,0.0022429717,0.0011947163,0.0010070495,0.00014893276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020841225,0.00048147145,0.031447057,0.00045632842,0.00021709982,0.0012779228,0.000789,0.6136775,0.1648915,0.00483195,0.0015582325,0.17828779],"study_design_scores_gemma":[0.000051881525,0.0006298555,0.007924214,0.000026630556,0.00014439256,0.00063226884,0.00018492535,0.87970203,0.107111104,0.0022478814,0.0012775081,0.000067281464],"about_ca_topic_score_codex":0.002301567,"about_ca_topic_score_gemma":0.0038676655,"teacher_disagreement_score":0.0029781573,"about_ca_system_score_codex":0.0010133026,"about_ca_system_score_gemma":0.0014395377,"threshold_uncertainty_score":0.01575023},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1728617,0.00036416392,0.8191452,0.00009266845,0.00003845661,0.0000945124,0.00004636758,0.0014266898,0.0059302496],"genre_scores_gemma":[0.5998877,0.00018030187,0.39830613,0.000033920907,0.000009017002,0.00014642483,0.0000619945,0.00015007485,0.001224414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994266,0.00018577464,0.000020893169,0.000043909575,0.00026957376,0.000053308384],"domain_scores_gemma":[0.99826115,0.0011460722,0.000109589535,0.00026534087,0.00017416922,0.000043587923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008101847,0.0006575317,0.00042109957,0.00061272393,0.00032163734,0.0005801116,0.000662306,0.00043056838,0.0024120559],"category_scores_gemma":[0.0018010545,0.00040679274,0.0005259469,0.0002857982,0.00046672503,0.0007176241,0.0010461495,0.00053008593,0.00024380726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035881676,0.00010373562,0.0025573226,0.00050190307,0.00010903473,0.0008164148,0.00074423436,0.5648309,0.2028337,0.019409351,0.0011660546,0.20656851],"study_design_scores_gemma":[0.00006180449,0.00055056985,0.00091926754,0.00005055393,0.000043194203,0.00053256296,0.00017377094,0.87527156,0.09903458,0.012564454,0.010750571,0.000047110298],"about_ca_topic_score_codex":0.00020648015,"about_ca_topic_score_gemma":0.0002924468,"teacher_disagreement_score":0.0024120559,"about_ca_system_score_codex":0.00022557931,"about_ca_system_score_gemma":0.00030548693,"threshold_uncertainty_score":0.008069098},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49323967,0.0004434872,0.47681874,0.00016718413,0.00010626354,0.00021574413,0.0002758636,0.024057524,0.004675576],"genre_scores_gemma":[0.83897585,0.00015973856,0.1579405,0.00004953234,0.0000101140295,0.00013842914,0.00024121115,0.00087613653,0.0016085483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856263,0.0006870809,0.00007253779,0.00016906348,0.0003495923,0.00015917039],"domain_scores_gemma":[0.9970697,0.0012937342,0.00015214314,0.000848864,0.00043592547,0.00019948855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013239137,0.00058794714,0.00080728164,0.00047123097,0.0006256397,0.0010939424,0.0017726489,0.0007594375,0.0014922781],"category_scores_gemma":[0.0035136046,0.00046877243,0.0005703883,0.0006215747,0.0012337703,0.0013221678,0.0009879825,0.0007699725,0.0003466865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0045493627,0.0006971146,0.009592629,0.0005208682,0.0002756076,0.00060452084,0.0015875701,0.78196925,0.097056955,0.019410975,0.0035175325,0.080217615],"study_design_scores_gemma":[0.0003181483,0.00049780606,0.00074319664,0.000020954878,0.00007644841,0.000115559444,0.00008591541,0.90601224,0.08269236,0.003012804,0.0063642343,0.000060417107],"about_ca_topic_score_codex":0.005108715,"about_ca_topic_score_gemma":0.004498583,"teacher_disagreement_score":0.005108715,"about_ca_system_score_codex":0.00092930434,"about_ca_system_score_gemma":0.0021892868,"threshold_uncertainty_score":0.010157943},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7270415,0.0006954866,0.24861227,0.0002742423,0.0002276886,0.00029869247,0.00013954609,0.01280285,0.009907802],"genre_scores_gemma":[0.84806794,0.0002793801,0.13921368,0.00015803926,0.000049689534,0.000088624765,0.0005492165,0.00087092275,0.010722473],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99972135,0.000024162791,0.000024876628,0.000042115986,0.000120230885,0.00006719855],"domain_scores_gemma":[0.9993868,0.00010389301,0.000069713424,0.00019201227,0.00020505377,0.00004254175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023654096,0.00044673932,0.0002504703,0.0002913834,0.00017286043,0.000352803,0.00057043583,0.00018873031,0.0020971799],"category_scores_gemma":[0.0010939186,0.00018798608,0.00026343693,0.00015658798,0.00014549475,0.00081650546,0.0005084889,0.00047723498,0.00084126],"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.0007072121,0.00020386389,0.00316147,0.00021964965,0.00003668908,0.000920889,0.00055851013,0.012661591,0.7088753,0.002393296,0.00340307,0.26685846],"study_design_scores_gemma":[0.00021608348,0.0029601872,0.019439032,0.0000668957,0.00015731057,0.002744533,0.00023771293,0.13519198,0.74103886,0.00132722,0.09648565,0.00013449763],"about_ca_topic_score_codex":0.0007173424,"about_ca_topic_score_gemma":0.0009371892,"teacher_disagreement_score":0.0020971799,"about_ca_system_score_codex":0.00021720039,"about_ca_system_score_gemma":0.00030212308,"threshold_uncertainty_score":0.0070158243},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23132706,0.00119693,0.745387,0.00028089536,0.00016059288,0.00010045545,0.000106781714,0.0112785585,0.010161659],"genre_scores_gemma":[0.5985739,0.00026199804,0.39387602,0.00013823697,0.000043759115,0.00010348762,0.00029570886,0.0013430605,0.0053639486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946934,0.00008965696,0.000029811314,0.00008295077,0.0002284925,0.0000997596],"domain_scores_gemma":[0.999338,0.00016786573,0.0000752463,0.00023585677,0.00014159283,0.000041363033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034770064,0.00047018033,0.00070393656,0.00054462167,0.0006101854,0.00087160064,0.0011500973,0.00045088795,0.0021035331],"category_scores_gemma":[0.0013018599,0.00036111192,0.00055025826,0.0011806665,0.00040148525,0.0009581708,0.00082291703,0.0005570422,0.0006014835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005221241,0.0003894384,0.007766532,0.0003768675,0.00010751781,0.0003125724,0.00039985025,0.26134065,0.23531874,0.020038556,0.009492027,0.46393514],"study_design_scores_gemma":[0.00012113656,0.0003258915,0.0035886238,0.000020842786,0.00007360742,0.00027909852,0.000103774786,0.88637763,0.07922093,0.012385749,0.017443197,0.00005954183],"about_ca_topic_score_codex":0.003270574,"about_ca_topic_score_gemma":0.0047069155,"teacher_disagreement_score":0.003270574,"about_ca_system_score_codex":0.0008400481,"about_ca_system_score_gemma":0.0009704142,"threshold_uncertainty_score":0.0070370436},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04171704,0.00053079746,0.87503666,0.00048156094,0.00040842057,0.0002843621,0.0007745761,0.051384203,0.029382307],"genre_scores_gemma":[0.37979952,0.00052196527,0.5971515,0.00022826342,0.00015388704,0.0007859561,0.0024219137,0.0024491777,0.016487805],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990701,0.00013520534,0.00006883443,0.00016020058,0.00038844466,0.00017714672],"domain_scores_gemma":[0.99926347,0.00014676877,0.000037961192,0.00027353855,0.00023490898,0.000043361728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061250234,0.000982657,0.00085454213,0.00114488,0.001084684,0.001329522,0.0024017936,0.0006687077,0.009605187],"category_scores_gemma":[0.0025599112,0.00044407675,0.0008358995,0.001828338,0.00049573695,0.0012305727,0.0015287196,0.0010937195,0.003260958],"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.0016342109,0.0005249915,0.005335303,0.0007648156,0.0004283977,0.0011228297,0.00077703455,0.17864768,0.06650107,0.06254044,0.05349152,0.6282317],"study_design_scores_gemma":[0.00016876726,0.00016030367,0.0018045516,0.00003591827,0.000080453145,0.00031545907,0.00012673387,0.81993496,0.07681848,0.028797194,0.07167892,0.00007827604],"about_ca_topic_score_codex":0.0046872427,"about_ca_topic_score_gemma":0.0026371465,"teacher_disagreement_score":0.009605187,"about_ca_system_score_codex":0.00078022806,"about_ca_system_score_gemma":0.0012326292,"threshold_uncertainty_score":0.032132566},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030419935,0.00030361215,0.9579191,0.00022281778,0.00024642193,0.00020125053,0.00018518473,0.0018871882,0.008614343],"genre_scores_gemma":[0.24978687,0.00019807793,0.73933226,0.00021973038,0.000118335396,0.00095404795,0.00036061872,0.00060757686,0.00842244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995196,0.00013162776,0.000019370285,0.000046077595,0.00023172553,0.00005151281],"domain_scores_gemma":[0.9991683,0.00030922293,0.000040779196,0.00013240613,0.00025787627,0.0000914785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008258636,0.000637491,0.0010647684,0.00076493795,0.00095942867,0.0011692513,0.0025956207,0.0016355966,0.006558717],"category_scores_gemma":[0.0019116693,0.00064402004,0.0008098767,0.0010454531,0.0005838917,0.0010144878,0.0016891774,0.0012942491,0.0013954067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003657659,0.0002110823,0.00090928806,0.00014908811,0.00019244444,0.00015023735,0.000087005865,0.83954984,0.007169854,0.03533166,0.0035513784,0.11233231],"study_design_scores_gemma":[0.000038047303,0.000028364751,0.00006947539,0.0000033382103,0.000007661233,0.000012772198,0.0000042205775,0.99600005,0.00052316225,0.0022755186,0.0010297025,0.000007753684],"about_ca_topic_score_codex":0.0029483445,"about_ca_topic_score_gemma":0.0029367846,"teacher_disagreement_score":0.006558717,"about_ca_system_score_codex":0.0005912427,"about_ca_system_score_gemma":0.0009787229,"threshold_uncertainty_score":0.021941066},"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":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050380896,0.096641,0.027740534,0.05369843,0.09312243,0.00011988676,0.00088326115,0.0042553684,0.7185011],"genre_scores_gemma":[0.011388398,0.013720617,0.0058788722,0.005701415,0.0062743197,0.00002528282,0.00027810718,0.0011256937,0.95560724],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99913114,0.00007515586,0.00002808423,0.000088847424,0.00055584963,0.00012085036],"domain_scores_gemma":[0.99866366,0.0002849826,0.00005362821,0.00013244887,0.0005836532,0.00028166783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014376253,0.00084698614,0.0005288301,0.0014292281,0.0028773916,0.0060360846,0.00087713473,0.0016243157,0.11585758],"category_scores_gemma":[0.0025883769,0.00062672736,0.00045840486,0.0011928929,0.0014071454,0.0054196133,0.0020247984,0.003646524,0.06645779],"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.0000621624,0.000031484746,0.00022379801,0.0001603028,0.000010143612,0.0001665546,0.00023341169,0.00024902672,0.002097424,0.020032395,0.84688795,0.12984532],"study_design_scores_gemma":[0.0000022372615,0.000019742416,0.00023721589,0.00007760994,0.0000033170666,0.00019603012,0.00016442925,0.000096397285,0.0007759606,0.004528688,0.9938892,0.000009169228],"about_ca_topic_score_codex":0.0016393478,"about_ca_topic_score_gemma":0.009835403,"teacher_disagreement_score":0.11585758,"about_ca_system_score_codex":0.0015419761,"about_ca_system_score_gemma":0.0013561726,"threshold_uncertainty_score":0.38758218},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5968295,0.0023800565,0.37906075,0.0005173869,0.00022628743,0.00013133184,0.00013709877,0.006264395,0.014453173],"genre_scores_gemma":[0.87769246,0.00031516538,0.11685417,0.00009363037,0.000034126286,0.00011193635,0.0001532845,0.00071659347,0.004028679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983772,0.00062949915,0.000099287936,0.00025193946,0.00030769955,0.0003344088],"domain_scores_gemma":[0.9974287,0.0012388919,0.00022283937,0.0006367178,0.00027728314,0.00019556844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015410277,0.0009321163,0.0007266326,0.0006916361,0.0007926516,0.0019852342,0.0020083943,0.00075028324,0.0041176714],"category_scores_gemma":[0.005092483,0.00071960775,0.0004800851,0.0008040909,0.0012080502,0.002914755,0.0021746608,0.00089837494,0.0008030346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016939224,0.00036508733,0.007167716,0.00056472217,0.00011555206,0.0004803987,0.00072257005,0.6862603,0.069259115,0.061632324,0.00516546,0.16657288],"study_design_scores_gemma":[0.00014624259,0.00039766886,0.0014108457,0.00004693522,0.000070005604,0.00012432048,0.00015173982,0.9278944,0.02948775,0.029732076,0.0105009265,0.000037112386],"about_ca_topic_score_codex":0.0011732727,"about_ca_topic_score_gemma":0.0023933437,"teacher_disagreement_score":0.0041176714,"about_ca_system_score_codex":0.0011380884,"about_ca_system_score_gemma":0.001607289,"threshold_uncertainty_score":0.013774991},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006071272,0.022915877,0.0040220674,0.027035516,0.86356837,0.00022392078,0.0012234588,0.0006787038,0.079725005],"genre_scores_gemma":[0.004310549,0.022929663,0.0018785715,0.011789205,0.5908695,0.00018266952,0.0024138712,0.0009285628,0.36469743],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99825424,0.00017223872,0.00016170058,0.0002769574,0.00094258017,0.00019226846],"domain_scores_gemma":[0.99337786,0.00090345566,0.00045323814,0.00033708534,0.0034654832,0.0014630371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018996503,0.0017422978,0.0014764132,0.0036092936,0.0014469981,0.0054540993,0.0014251085,0.002335987,0.14598523],"category_scores_gemma":[0.0058239116,0.00044970066,0.0009892955,0.0019557124,0.00071771786,0.0033220618,0.0017530875,0.0036533321,0.09177613],"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.00002441477,0.000019092558,0.00008304723,0.00013169016,0.000005306324,0.00003129243,0.00000887983,0.000058436435,0.00026139588,0.00060313835,0.9734212,0.025351986],"study_design_scores_gemma":[0.000005577587,0.000034025645,0.0003742161,0.00013257677,0.0000060280613,0.000082123224,0.000013478281,0.00012891045,0.00015113116,0.00070803455,0.9983552,0.000008806146],"about_ca_topic_score_codex":0.00069462974,"about_ca_topic_score_gemma":0.0025487586,"teacher_disagreement_score":0.14598523,"about_ca_system_score_codex":0.0013210714,"about_ca_system_score_gemma":0.0017982903,"threshold_uncertainty_score":0.48836923},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6309208,0.0016252771,0.2906325,0.0015078591,0.00026807556,0.00026384837,0.0007028677,0.006483468,0.06759522],"genre_scores_gemma":[0.9129354,0.00021278752,0.071134895,0.0002605094,0.00002830807,0.00010784307,0.00016303164,0.00010848013,0.015048694],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999461,0.0000067201318,0.0000037412724,0.00000828474,0.000022051448,0.000013083703],"domain_scores_gemma":[0.9999342,0.000024075713,0.000011722001,0.000009650461,0.000013417275,0.000006911952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000042345106,0.00021645591,0.00010695414,0.00030921414,0.0003055251,0.00052797515,0.00037759275,0.00029468365,0.006949085],"category_scores_gemma":[0.00020599268,0.00016214163,0.000095942996,0.0002216014,0.00013022713,0.00035366663,0.00014940783,0.00028947918,0.00072393456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060182717,0.00022151621,0.0048659355,0.0003833733,0.000044602282,0.00096022047,0.00037447963,0.06798816,0.6526431,0.068637356,0.012137855,0.19114166],"study_design_scores_gemma":[0.00026105135,0.0017971038,0.009478705,0.00009878728,0.0001201822,0.0017040415,0.0002517627,0.5831714,0.30389497,0.019890077,0.079230934,0.00010091192],"about_ca_topic_score_codex":0.0021237754,"about_ca_topic_score_gemma":0.0049930294,"teacher_disagreement_score":0.006949085,"about_ca_system_score_codex":0.00049994374,"about_ca_system_score_gemma":0.00055802765,"threshold_uncertainty_score":0.023247063},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7530287,0.0003562023,0.22652312,0.0005689858,0.00036840877,0.000833531,0.0019891986,0.006520065,0.009811786],"genre_scores_gemma":[0.9582482,0.00011976558,0.03947134,0.00008615144,0.000017077331,0.00032920795,0.0005860975,0.00023973695,0.0009025684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985815,0.0002908207,0.0001307942,0.0002189054,0.00060313084,0.00017477012],"domain_scores_gemma":[0.99578,0.0016703398,0.00026763568,0.001003597,0.0011235917,0.0001548605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015191394,0.00087514,0.0004649134,0.0007674737,0.00049919257,0.00076153077,0.0021012651,0.00076310826,0.003343754],"category_scores_gemma":[0.007261344,0.00038671648,0.0002985943,0.0009547021,0.0005561199,0.0011435079,0.00055382785,0.0011794487,0.00070437207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010155056,0.0017217015,0.014959443,0.000777127,0.00013609645,0.0003180895,0.00037663418,0.7108576,0.17809168,0.010881619,0.008541491,0.0723229],"study_design_scores_gemma":[0.00009685733,0.0010055118,0.002634239,0.00003117546,0.000030956486,0.00008445678,0.00007693619,0.86702883,0.12218296,0.0012037323,0.005585149,0.00003924052],"about_ca_topic_score_codex":0.0016809705,"about_ca_topic_score_gemma":0.0010614177,"teacher_disagreement_score":0.003343754,"about_ca_system_score_codex":0.0009904946,"about_ca_system_score_gemma":0.000874209,"threshold_uncertainty_score":0.011186004},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017830463,0.00022061788,0.96919864,0.00016508553,0.000064708256,0.00013286823,0.00015058584,0.008828331,0.003408772],"genre_scores_gemma":[0.10790771,0.0003502238,0.8849989,0.00012435975,0.000031184307,0.00035076664,0.0008874916,0.0029946717,0.0023547416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999005,0.00021699205,0.00006659594,0.0001307319,0.00047893226,0.00010178237],"domain_scores_gemma":[0.99803907,0.0005794424,0.00019424064,0.0005706018,0.0005464081,0.00007016231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011600411,0.0007957584,0.00047561078,0.000673134,0.0003981641,0.001321644,0.0017601807,0.00082598015,0.0022684215],"category_scores_gemma":[0.004824364,0.00056276325,0.00071613415,0.00069926854,0.0009004424,0.0012189953,0.0013321165,0.0015911987,0.0015796797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043607043,0.00035371832,0.004013023,0.00094118126,0.000092237045,0.0005746471,0.0009470292,0.2576426,0.17558803,0.14557725,0.01834084,0.39549333],"study_design_scores_gemma":[0.000068906294,0.00015946697,0.00069199543,0.0001271652,0.000036578265,0.00022718777,0.00007753477,0.8335135,0.09072946,0.031246083,0.043074146,0.000047981965],"about_ca_topic_score_codex":0.0011042168,"about_ca_topic_score_gemma":0.0011781013,"teacher_disagreement_score":0.0022684215,"about_ca_system_score_codex":0.00066195196,"about_ca_system_score_gemma":0.0015231038,"threshold_uncertainty_score":0.0075886846},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07101954,0.005938225,0.8894835,0.0009127073,0.00041684654,0.00012987913,0.00072111294,0.007515756,0.023862388],"genre_scores_gemma":[0.60136586,0.0016026031,0.37895396,0.00055821904,0.00012795693,0.0002626099,0.001288073,0.0003377897,0.015502925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994392,0.00009005409,0.000039120492,0.00007929712,0.0002834685,0.0000689107],"domain_scores_gemma":[0.99836034,0.0003898123,0.000104475286,0.0006146898,0.00047618558,0.00005452015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005208709,0.00032314277,0.00060265296,0.00066918816,0.0007729712,0.0014048804,0.002185492,0.0006923342,0.005875432],"category_scores_gemma":[0.0031805872,0.000296798,0.0003261042,0.0023014555,0.00050152646,0.0028621245,0.0010663312,0.0010091936,0.0013196649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001201286,0.00022361672,0.0054023876,0.0005833973,0.00018104733,0.00059698697,0.00032618296,0.19999605,0.0265898,0.21935996,0.04862845,0.49691075],"study_design_scores_gemma":[0.00007862707,0.0001716967,0.0005096601,0.00006871664,0.000039590017,0.00029403536,0.00008557954,0.90054625,0.01549264,0.048912864,0.03375806,0.00004233646],"about_ca_topic_score_codex":0.006497676,"about_ca_topic_score_gemma":0.01410137,"teacher_disagreement_score":0.006497676,"about_ca_system_score_codex":0.0013937671,"about_ca_system_score_gemma":0.0024635517,"threshold_uncertainty_score":0.019655287},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58820486,0.0014000471,0.39918995,0.0006322763,0.00031074777,0.000089503556,0.00007432478,0.0055639436,0.0045342953],"genre_scores_gemma":[0.93953174,0.00014773126,0.05858774,0.0000825265,0.000038414713,0.000036849717,0.00006164525,0.00022991,0.0012834057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988232,0.00028421654,0.00008287707,0.00016852029,0.0004017326,0.00023944482],"domain_scores_gemma":[0.9948383,0.0022206786,0.00041516434,0.0013948148,0.000761527,0.00036955494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014604847,0.00092830835,0.0005900799,0.00089753774,0.0012199078,0.0012686701,0.0019677803,0.0005383634,0.0021412738],"category_scores_gemma":[0.009144533,0.00059755147,0.00035212125,0.001018304,0.00075924903,0.0021271969,0.001766105,0.0014872482,0.0003232047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030350578,0.0008738478,0.015557334,0.00035397353,0.00014785999,0.00051767577,0.0011020729,0.33221558,0.1311444,0.021223016,0.0054734717,0.4883557],"study_design_scores_gemma":[0.00004568702,0.00024797485,0.0006701319,0.000015601641,0.000046916404,0.000074759075,0.000115351904,0.96928406,0.023147266,0.0049075754,0.0014274097,0.000017366043],"about_ca_topic_score_codex":0.004314784,"about_ca_topic_score_gemma":0.012117274,"teacher_disagreement_score":0.004314784,"about_ca_system_score_codex":0.000726346,"about_ca_system_score_gemma":0.0031463082,"threshold_uncertainty_score":0.008579314},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11705409,0.0060416963,0.6329145,0.08279388,0.0017549471,0.00025624246,0.00076128845,0.0013472294,0.1570762],"genre_scores_gemma":[0.83154494,0.0021658055,0.14138477,0.0043860953,0.00054823107,0.00050404365,0.00048290388,0.00052250276,0.018460732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9859861,0.007469224,0.0005088004,0.0027238189,0.0027070653,0.00060495746],"domain_scores_gemma":[0.9391001,0.034542732,0.002370692,0.017647676,0.0051671606,0.0011717756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.025606086,0.000949649,0.0011895349,0.001364705,0.0039616833,0.0083971685,0.003489622,0.0043415385,0.018446242],"category_scores_gemma":[0.08549312,0.00078030507,0.0013513635,0.0012585932,0.0219163,0.026309501,0.0078535145,0.008245486,0.0025043315],"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.000059204893,0.00004035979,0.0010260064,0.00010721756,0.00001799601,0.00006222485,0.0015350973,0.0010886586,0.00060746016,0.98550653,0.0013109219,0.0086383],"study_design_scores_gemma":[0.000043647757,0.00006778638,0.0006833038,0.00014435517,0.000017573602,0.00006198321,0.00073046476,0.0045112334,0.0014325748,0.9747965,0.017473595,0.000037098165],"about_ca_topic_score_codex":0.0047525424,"about_ca_topic_score_gemma":0.0038027812,"teacher_disagreement_score":0.025606086,"about_ca_system_score_codex":0.0049041626,"about_ca_system_score_gemma":0.0046983343,"threshold_uncertainty_score":0.13541949},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11127703,0.0021560723,0.83148706,0.0006478125,0.00058264413,0.00029279335,0.0004080959,0.008786994,0.04436145],"genre_scores_gemma":[0.6489972,0.0011818698,0.32329175,0.0004831534,0.00013342462,0.00019691855,0.0006715512,0.00043338755,0.024610722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998673,0.000013825648,0.000008058279,0.000020011763,0.000064501626,0.000026227966],"domain_scores_gemma":[0.9998093,0.000034188775,0.000021736556,0.000046723337,0.00005480927,0.000033250348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026537044,0.0004210273,0.00025462086,0.00032430413,0.00031144463,0.00061556604,0.0010484263,0.0003854412,0.0051226234],"category_scores_gemma":[0.00043135096,0.0002659999,0.00030350016,0.00032864817,0.0005110742,0.0010302671,0.0007706996,0.0010289375,0.0012353449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072276214,0.00038689142,0.0027937486,0.0004195055,0.00010792499,0.0006805968,0.0003426119,0.27443886,0.16218834,0.3091782,0.027975215,0.22076538],"study_design_scores_gemma":[0.00008870015,0.0005763559,0.00051762204,0.00008388676,0.00004372093,0.00028001404,0.000039482034,0.7844338,0.06261455,0.06526571,0.08598531,0.00007079546],"about_ca_topic_score_codex":0.0009437801,"about_ca_topic_score_gemma":0.0016514937,"teacher_disagreement_score":0.0051226234,"about_ca_system_score_codex":0.00050432154,"about_ca_system_score_gemma":0.0007910388,"threshold_uncertainty_score":0.017136931},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000085681575,0.0015083476,0.00021015857,0.01723647,0.9756446,0.0000508334,0.00015548909,0.0001221151,0.0049862913],"genre_scores_gemma":[0.0011190793,0.0031253889,0.0002506927,0.012315863,0.91394335,0.00004667551,0.00022566745,0.00014003835,0.06883327],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984699,0.0001560374,0.00020824488,0.00024041523,0.00077642524,0.00014895723],"domain_scores_gemma":[0.9824025,0.0037645882,0.00087771745,0.0006632335,0.009567638,0.0027243176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029143393,0.0024949173,0.0033107025,0.002480813,0.0019138705,0.005285045,0.0023259316,0.0086542275,0.090668514],"category_scores_gemma":[0.009680606,0.00097614987,0.0021268134,0.0012823623,0.0010507916,0.002684083,0.00076291966,0.010145844,0.060503],"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.00011319847,0.000017343198,0.000032064487,0.0001734395,0.000015312778,0.00006982068,0.0000042089623,0.000025265725,0.00014340077,0.00024376527,0.99314356,0.006018471],"study_design_scores_gemma":[0.0001061697,0.00011659671,0.000731933,0.00017538178,0.000058306887,0.0001776103,0.000029884031,0.00023434433,0.00042996497,0.0009310242,0.9969919,0.000016924121],"about_ca_topic_score_codex":0.0008851869,"about_ca_topic_score_gemma":0.0018280664,"teacher_disagreement_score":0.090668514,"about_ca_system_score_codex":0.0010137965,"about_ca_system_score_gemma":0.0010129281,"threshold_uncertainty_score":0.3033164},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083821915,0.00030740787,0.90660095,0.00029635883,0.000030274528,0.00020058878,0.000029517065,0.0018472559,0.006865755],"genre_scores_gemma":[0.40744302,0.00033964418,0.58702815,0.00014783014,0.000016438811,0.00035113018,0.00009352962,0.00033439,0.0042458805],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991373,0.0002771231,0.00009226022,0.000098940654,0.0002964264,0.00009790722],"domain_scores_gemma":[0.99842936,0.0007081672,0.00012843077,0.0004308332,0.00026428342,0.00003897961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086540484,0.0006487181,0.00028976885,0.00066863926,0.00049787195,0.0013626134,0.0013637416,0.0006905694,0.0034431608],"category_scores_gemma":[0.0037821217,0.00041339884,0.0003673566,0.00063385384,0.0007783644,0.0019697412,0.0008474571,0.0008045159,0.0006654457],"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.0002549695,0.00034570057,0.0023131424,0.0005836274,0.0000701782,0.00024159717,0.0011206777,0.13177928,0.10480062,0.30425707,0.0029376815,0.45129547],"study_design_scores_gemma":[0.00016485903,0.00040938836,0.00081457134,0.00011028988,0.00012019031,0.00031714237,0.0003184354,0.7797103,0.08448948,0.10413671,0.029346827,0.000061839586],"about_ca_topic_score_codex":0.00089779514,"about_ca_topic_score_gemma":0.0016283225,"teacher_disagreement_score":0.0034431608,"about_ca_system_score_codex":0.0006383151,"about_ca_system_score_gemma":0.0008897438,"threshold_uncertainty_score":0.011518478},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49417222,0.008593012,0.43329626,0.001517106,0.00075454934,0.00068515795,0.0011042972,0.033658218,0.026219163],"genre_scores_gemma":[0.7946096,0.0014839852,0.19545943,0.0004953476,0.00010960476,0.0005188259,0.0015866869,0.0013358969,0.004400607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943286,0.000097548786,0.0000326952,0.00009412774,0.00025676333,0.00008607911],"domain_scores_gemma":[0.9991429,0.00026654374,0.00006890249,0.00024451595,0.00021466592,0.00006253387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005229855,0.00076213916,0.000759815,0.0005924826,0.00053990015,0.0009946655,0.0017771189,0.0006436623,0.0018920063],"category_scores_gemma":[0.0026581278,0.00035477965,0.00039873234,0.0015114106,0.0005565101,0.0014731333,0.0007586483,0.0011031396,0.00058617844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015819453,0.0005388314,0.009105917,0.00091564254,0.0002686018,0.0010116645,0.0007271363,0.3976666,0.08005262,0.027134936,0.050848052,0.430148],"study_design_scores_gemma":[0.0002689139,0.00031689185,0.0020499912,0.000051950534,0.000067319714,0.00022458422,0.000079998434,0.92044115,0.04034796,0.014376647,0.021719022,0.000055590088],"about_ca_topic_score_codex":0.0045770262,"about_ca_topic_score_gemma":0.0045753517,"teacher_disagreement_score":0.0045770262,"about_ca_system_score_codex":0.0007656512,"about_ca_system_score_gemma":0.0012794884,"threshold_uncertainty_score":0.009100795},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4050081,0.0027502803,0.5359321,0.001355232,0.0010425531,0.00066200644,0.00041372344,0.02871962,0.024116315],"genre_scores_gemma":[0.89421916,0.00052063266,0.09501316,0.00039056278,0.00017092358,0.00019641894,0.0003955731,0.0013955573,0.0076981033],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990012,0.00020961028,0.00009811549,0.00022310771,0.00023232299,0.0002356379],"domain_scores_gemma":[0.9972638,0.0006964775,0.00029592754,0.0009883646,0.0005041315,0.00025125872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001434443,0.0012006407,0.0004896541,0.00074717164,0.00076424575,0.0015746715,0.0022515687,0.00041836675,0.008571754],"category_scores_gemma":[0.0055636796,0.00045174835,0.00032450145,0.00072280224,0.0005518542,0.0022330806,0.0019158416,0.0009657789,0.0018763507],"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.0027813003,0.00077004527,0.017454218,0.0006146589,0.00025501905,0.00061827636,0.0008289934,0.08254501,0.10421361,0.016998393,0.03322227,0.7396981],"study_design_scores_gemma":[0.0004062149,0.0010430865,0.010677463,0.00015751075,0.0002290435,0.0005609712,0.0005052975,0.800061,0.10227092,0.029352784,0.05453908,0.00019669796],"about_ca_topic_score_codex":0.0033972177,"about_ca_topic_score_gemma":0.007426327,"teacher_disagreement_score":0.008571754,"about_ca_system_score_codex":0.0010393724,"about_ca_system_score_gemma":0.0016122852,"threshold_uncertainty_score":0.028675318},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4892157,0.00107693,0.341379,0.00075294805,0.00031553817,0.00006564909,0.0003813721,0.000997731,0.16581525],"genre_scores_gemma":[0.91829425,0.00036997267,0.032347653,0.00018361407,0.00009788921,0.00004853161,0.00018986728,0.0002818377,0.048186418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997595,0.000044798904,0.000011132308,0.00003441566,0.00006942369,0.00008066756],"domain_scores_gemma":[0.99953794,0.00008800194,0.000060885817,0.000081063845,0.00009129547,0.00014079579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002827241,0.00026816843,0.00045132654,0.0011273683,0.00096462015,0.001440222,0.0006686224,0.00054228364,0.010872878],"category_scores_gemma":[0.0011940474,0.00020242123,0.0004553159,0.00059530686,0.0012065454,0.0020259097,0.0013579897,0.00081355416,0.001665549],"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.000032765096,0.000018753482,0.00021905972,0.000028927288,0.0000049159576,0.00006596776,0.00007533245,0.0014430674,0.0009078746,0.98944026,0.0015604157,0.006202668],"study_design_scores_gemma":[0.00001857707,0.000028303235,0.00037107538,0.000019354899,0.00000987081,0.00021355106,0.00010620605,0.02734436,0.0011355081,0.96421224,0.0065287356,0.000012262439],"about_ca_topic_score_codex":0.0011445922,"about_ca_topic_score_gemma":0.0016109976,"teacher_disagreement_score":0.010872878,"about_ca_system_score_codex":0.00076798437,"about_ca_system_score_gemma":0.00046917124,"threshold_uncertainty_score":0.036373377},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027213337,0.00043523152,0.9691124,0.00022707741,0.00012886773,0.000038611903,0.0000695905,0.001478918,0.0012959685],"genre_scores_gemma":[0.6483775,0.0006091665,0.34820333,0.00033503515,0.0002280128,0.0001496086,0.00020049862,0.0006706716,0.0012261759],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9963362,0.00057250104,0.00022070241,0.0008262197,0.0018190037,0.00022543065],"domain_scores_gemma":[0.9876687,0.004491955,0.0024978782,0.0032792273,0.0018223813,0.00023996992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019849204,0.0011704196,0.0007957845,0.0009734427,0.00052439433,0.0011211584,0.0012390522,0.0008313432,0.0009185637],"category_scores_gemma":[0.01882432,0.0005895759,0.0003450824,0.001026043,0.00090443896,0.0021697807,0.0012031805,0.0021920009,0.0006414742],"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.0007647083,0.00030834018,0.017986907,0.0007512124,0.00020873072,0.00047028277,0.0008557722,0.11428828,0.31376413,0.04026819,0.005558479,0.504775],"study_design_scores_gemma":[0.00007184873,0.0007716809,0.012506568,0.00013332732,0.00010691258,0.0007584275,0.00027255662,0.52232605,0.41003746,0.033498608,0.019301413,0.00021509637],"about_ca_topic_score_codex":0.0009911503,"about_ca_topic_score_gemma":0.0010420608,"teacher_disagreement_score":0.0019849204,"about_ca_system_score_codex":0.00044578747,"about_ca_system_score_gemma":0.0010980353,"threshold_uncertainty_score":0.010497391},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063145487,0.00012647737,0.98660046,0.00009327395,0.00007244784,0.00007056854,0.0001228181,0.00074554037,0.0058539324],"genre_scores_gemma":[0.08112083,0.00027497808,0.90849984,0.00014508537,0.00006943822,0.00020225457,0.0006255506,0.00069061544,0.008371372],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995778,0.00009327943,0.000021846517,0.0000940591,0.00015436707,0.000058773683],"domain_scores_gemma":[0.9989772,0.00032145093,0.00004141377,0.00039106235,0.0002074264,0.00006142176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058900274,0.00063918415,0.0008266687,0.0013276626,0.0009219684,0.00089107954,0.0018627367,0.0010127404,0.01607524],"category_scores_gemma":[0.0021902001,0.0006246378,0.0009865994,0.0017931535,0.00085386547,0.002231925,0.0026575488,0.0015638154,0.0033071844],"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.00015945335,0.00010272643,0.00048616316,0.0003566441,0.000039694412,0.00017363188,0.00032114307,0.030327024,0.015902236,0.16852373,0.019722898,0.76388466],"study_design_scores_gemma":[0.000079357014,0.00011233936,0.00041075493,0.00009941891,0.0000955007,0.0004581809,0.00018085088,0.55210465,0.013604779,0.38421968,0.048588153,0.000046299083],"about_ca_topic_score_codex":0.00087850855,"about_ca_topic_score_gemma":0.0018622112,"teacher_disagreement_score":0.01607524,"about_ca_system_score_codex":0.00037234102,"about_ca_system_score_gemma":0.0007165198,"threshold_uncertainty_score":0.0537771},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24668096,0.00028869457,0.7461142,0.00013054858,0.000037228205,0.000070647795,0.00009953156,0.003555923,0.0030223716],"genre_scores_gemma":[0.94806606,0.000090692,0.05026106,0.000035091256,0.000009058693,0.00004318719,0.00009396541,0.0001379892,0.0012628202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989887,0.00026031618,0.00004519116,0.0002161607,0.00038520663,0.000104492006],"domain_scores_gemma":[0.99863404,0.00055479736,0.00016810765,0.00034746187,0.00023305273,0.00006245442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006575408,0.0005865375,0.00047741403,0.0008083204,0.00036648667,0.0008309662,0.00078338577,0.00039695,0.0014809374],"category_scores_gemma":[0.0034000133,0.00025470852,0.00022277248,0.0007342485,0.0005551079,0.0009846921,0.0010487575,0.0007015674,0.00024291952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008647865,0.00028024867,0.014671175,0.00033376692,0.00014541758,0.0012843385,0.0009821301,0.53954357,0.14541215,0.024982898,0.002043356,0.26945615],"study_design_scores_gemma":[0.000020426136,0.00014019126,0.0017084704,0.000016698075,0.000024538096,0.00010445578,0.000065237466,0.95170873,0.038445253,0.005410868,0.0023423752,0.000012852269],"about_ca_topic_score_codex":0.0021834788,"about_ca_topic_score_gemma":0.0016660152,"teacher_disagreement_score":0.0021834788,"about_ca_system_score_codex":0.0005643099,"about_ca_system_score_gemma":0.00070842745,"threshold_uncertainty_score":0.004954219},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33995566,0.0016112967,0.643773,0.0003290861,0.00013125503,0.00010246592,0.00015362166,0.0047421735,0.009201456],"genre_scores_gemma":[0.896313,0.00019564954,0.100198716,0.00009290202,0.000026072152,0.00007720129,0.0001209761,0.00010182148,0.002873559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996146,0.00008270877,0.000020824107,0.00006884751,0.00013459867,0.00007825408],"domain_scores_gemma":[0.99943787,0.00008041942,0.00005937492,0.00021926578,0.00015480332,0.00004834006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025587247,0.00032632097,0.00051387295,0.0006858406,0.0007753522,0.000511476,0.001251923,0.00036898127,0.001108932],"category_scores_gemma":[0.0010230537,0.0002079164,0.00029627868,0.0012298778,0.0005319308,0.0010165069,0.00083000155,0.0004664495,0.000288448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016672974,0.00040024184,0.00790361,0.0002556835,0.00011995868,0.00068129547,0.0006446298,0.30548254,0.17918746,0.04012336,0.011568482,0.4519655],"study_design_scores_gemma":[0.0000802824,0.00023295375,0.0009924456,0.000015804066,0.000035993515,0.00022610479,0.00006294753,0.9403859,0.04229762,0.007300211,0.008334805,0.000034825178],"about_ca_topic_score_codex":0.0045484817,"about_ca_topic_score_gemma":0.005076874,"teacher_disagreement_score":0.0045484817,"about_ca_system_score_codex":0.00073455326,"about_ca_system_score_gemma":0.0009991731,"threshold_uncertainty_score":0.009044051},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31581706,0.0009478842,0.5828304,0.0004891401,0.00039149963,0.00027527043,0.000960321,0.05116595,0.04712249],"genre_scores_gemma":[0.75611484,0.00021050751,0.21362534,0.00020947855,0.000053363536,0.00026466887,0.0023731338,0.013221561,0.013927046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987777,0.00012267657,0.000060795024,0.00014369302,0.00054475083,0.00035041585],"domain_scores_gemma":[0.9980281,0.00052405946,0.00011673114,0.0003725176,0.0008036786,0.00015487359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005926772,0.00118364,0.00070999074,0.00093122147,0.0006704016,0.0013237238,0.0024834566,0.0006365372,0.008193898],"category_scores_gemma":[0.0038317316,0.00055274466,0.0007508586,0.0009808881,0.00061458617,0.0011985855,0.0016145686,0.0013633098,0.0028889657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017621712,0.0005134677,0.009567643,0.00073259184,0.00018461724,0.00088836317,0.0010896381,0.42810088,0.18205903,0.038422123,0.05591355,0.2807659],"study_design_scores_gemma":[0.00014060063,0.00013843706,0.001513382,0.000026805272,0.000032308795,0.00009448532,0.00012263803,0.89581215,0.07901994,0.006992581,0.016053,0.00005376648],"about_ca_topic_score_codex":0.005097581,"about_ca_topic_score_gemma":0.008232001,"teacher_disagreement_score":0.008193898,"about_ca_system_score_codex":0.0015106573,"about_ca_system_score_gemma":0.0018388901,"threshold_uncertainty_score":0.027411342},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00956082,0.00011715485,0.9869862,0.00009888374,0.000039617764,0.00007058368,0.00007501236,0.0011214088,0.0019303184],"genre_scores_gemma":[0.52977806,0.00041620777,0.46576038,0.00017704256,0.000050563627,0.0002900886,0.00030534627,0.00045764563,0.0027646814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961606,0.0014212278,0.0002875284,0.00053389143,0.0013137974,0.0002829425],"domain_scores_gemma":[0.99522483,0.0019670553,0.0005493037,0.0012682423,0.00093219866,0.00005836814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004255056,0.00061054056,0.00038959534,0.00083452946,0.00058359577,0.0016843068,0.0010361865,0.00051644305,0.0027348956],"category_scores_gemma":[0.007768188,0.0004046074,0.0013132873,0.00034664484,0.001417784,0.0020049356,0.0014745347,0.0012817065,0.00051032746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022727383,0.00019734485,0.004341707,0.0014363943,0.00019796274,0.0005597832,0.0011013426,0.107060015,0.06708902,0.5210447,0.0029516441,0.29379293],"study_design_scores_gemma":[0.00006834546,0.00037904325,0.0009709175,0.00044923148,0.00016820189,0.00047578753,0.00028210698,0.6144693,0.16701329,0.18064776,0.035008036,0.00006801774],"about_ca_topic_score_codex":0.001693467,"about_ca_topic_score_gemma":0.0018045496,"teacher_disagreement_score":0.004255056,"about_ca_system_score_codex":0.0007129914,"about_ca_system_score_gemma":0.0026758895,"threshold_uncertainty_score":0.022503138},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018724788,0.08954139,0.85374576,0.0010137876,0.00043892208,0.00011862197,0.0010447465,0.0017671809,0.0336048],"genre_scores_gemma":[0.43775156,0.23832022,0.28918147,0.00078012823,0.0011343419,0.00046972817,0.003449974,0.0019356221,0.026976908],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994893,0.0001159661,0.000049045244,0.00009747739,0.0002129504,0.000035224297],"domain_scores_gemma":[0.99945873,0.00021756523,0.000045975856,0.000082149105,0.00018145554,0.000014084029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043376835,0.001441833,0.0010275807,0.0014694374,0.00034273032,0.0011364844,0.0017462706,0.0007536871,0.003167251],"category_scores_gemma":[0.0017794349,0.0006110324,0.001190906,0.0030504484,0.00029354938,0.0018418351,0.0004326754,0.0010266233,0.0014050584],"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.00010382068,0.00009817215,0.0036421367,0.0020722782,0.00014249663,0.00031174673,0.00016097906,0.44032532,0.008748185,0.047309645,0.022878652,0.47420657],"study_design_scores_gemma":[0.000009184506,0.00009861795,0.0015336202,0.00034618078,0.000086950895,0.0004692891,0.000067118715,0.85769403,0.004893501,0.020829493,0.113918036,0.0000538803],"about_ca_topic_score_codex":0.0038754977,"about_ca_topic_score_gemma":0.0028164939,"teacher_disagreement_score":0.0038754977,"about_ca_system_score_codex":0.00071565586,"about_ca_system_score_gemma":0.0007177817,"threshold_uncertainty_score":0.0105955005},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1366992,0.0032052845,0.51317215,0.0044978326,0.001481183,0.0006676944,0.00038068253,0.013103989,0.32679194],"genre_scores_gemma":[0.3142282,0.002096833,0.5206165,0.0021905769,0.0003479109,0.00043806733,0.00076242024,0.0015684541,0.15775116],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996332,0.00006111228,0.000012201679,0.000064273045,0.00016867803,0.00006065579],"domain_scores_gemma":[0.9994824,0.000103518,0.000036843976,0.0000673042,0.00012981416,0.00018008669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044995686,0.0004555536,0.00012716786,0.00044995858,0.00044935674,0.0009744778,0.0007626895,0.0008452982,0.025889328],"category_scores_gemma":[0.0013598185,0.00016998971,0.00018352138,0.00040777633,0.0002753988,0.0016428479,0.001221674,0.00084177963,0.009507579],"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.0001354229,0.0006437334,0.0021334828,0.00024618764,0.0000061786054,0.00029027835,0.00067277806,0.001410851,0.029002145,0.030157637,0.051530633,0.8837706],"study_design_scores_gemma":[0.000057265843,0.00097034796,0.0056911283,0.0002306612,0.000016424065,0.002473441,0.00048022214,0.020003367,0.042090643,0.011423411,0.9165032,0.00006001386],"about_ca_topic_score_codex":0.0006276012,"about_ca_topic_score_gemma":0.0013168694,"teacher_disagreement_score":0.025889328,"about_ca_system_score_codex":0.0004438296,"about_ca_system_score_gemma":0.0010062002,"threshold_uncertainty_score":0.08660847},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004448673,0.0007507301,0.98713535,0.00016389838,0.00036878296,0.00013383478,0.000120751676,0.004308674,0.0025692566],"genre_scores_gemma":[0.10949213,0.00060585735,0.8786227,0.00037729973,0.00043502252,0.00028014882,0.00028872653,0.00053040404,0.0093676895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956416,0.00047340026,0.00026676347,0.0010840157,0.0022889425,0.00024528924],"domain_scores_gemma":[0.9930059,0.0020923137,0.0009853273,0.0017942134,0.0018568896,0.00026541587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014565082,0.002320654,0.0017308021,0.004693164,0.0011283632,0.003362879,0.0037519864,0.0017498344,0.004327917],"category_scores_gemma":[0.0063158786,0.0012061731,0.00093088223,0.0028464252,0.0010985417,0.0043741344,0.002507156,0.003528022,0.0020452985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006836915,0.00048427843,0.004555173,0.0005663123,0.00026214987,0.00023673262,0.00025677215,0.021017859,0.11657103,0.04092652,0.011037074,0.8034025],"study_design_scores_gemma":[0.000098882396,0.0005310087,0.0023204081,0.000117503725,0.0003505428,0.0010552064,0.000101225785,0.76223654,0.1532199,0.03782866,0.041914,0.00022611882],"about_ca_topic_score_codex":0.0017622052,"about_ca_topic_score_gemma":0.0031522436,"teacher_disagreement_score":0.004693164,"about_ca_system_score_codex":0.0009892932,"about_ca_system_score_gemma":0.0016700187,"threshold_uncertainty_score":0.014478326},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5014295,0.019617597,0.46935123,0.0018514694,0.00019178475,0.00004946781,0.000118749296,0.0012047064,0.0061854436],"genre_scores_gemma":[0.9265571,0.0017680984,0.06906187,0.00020661006,0.000058611684,0.000044472123,0.00006930054,0.0001517337,0.0020821483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996803,0.00008962672,0.000021412621,0.0000554466,0.00009722758,0.00005601016],"domain_scores_gemma":[0.9992399,0.00027532515,0.00012575334,0.00013161177,0.00017211227,0.0000551921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070513703,0.00028727693,0.00042479532,0.0004281909,0.00038796733,0.0007663304,0.0007706816,0.000563605,0.0011617152],"category_scores_gemma":[0.0023276317,0.00020457867,0.00017550342,0.0003665083,0.00024161719,0.0017294168,0.0005735819,0.00059404894,0.00021530263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007601604,0.00043391334,0.0045510195,0.00063074863,0.00009358028,0.00016592808,0.00047181683,0.33956242,0.28177792,0.046781376,0.004719599,0.32005146],"study_design_scores_gemma":[0.00006739757,0.0005851536,0.0015150136,0.00007555213,0.000065711225,0.00028177342,0.00017677413,0.8871572,0.076382145,0.021475725,0.012176309,0.000041345254],"about_ca_topic_score_codex":0.0005768465,"about_ca_topic_score_gemma":0.001421535,"teacher_disagreement_score":0.0011617152,"about_ca_system_score_codex":0.0006220837,"about_ca_system_score_gemma":0.0008365334,"threshold_uncertainty_score":0.004513502},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82562417,0.003484941,0.15726449,0.0006101053,0.00044447658,0.00017980086,0.000558602,0.0022947008,0.009538712],"genre_scores_gemma":[0.9400497,0.0012912276,0.049597427,0.00021828747,0.000044551303,0.00010641231,0.00043174243,0.00012525648,0.008135347],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996519,0.000020808826,0.000017327942,0.000116260046,0.00014911992,0.00004466679],"domain_scores_gemma":[0.99983394,0.000025488696,0.00004915976,0.000027728498,0.000036985486,0.000026752714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001798031,0.00058850023,0.0004057662,0.0003736905,0.00040884095,0.00058291055,0.00053878664,0.00082058366,0.0012415478],"category_scores_gemma":[0.00019956523,0.00018768232,0.00030216022,0.000308381,0.0004079527,0.00078623096,0.0006159472,0.0007030097,0.0006264568],"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.000023772523,0.00001517128,0.00004715609,0.000047792557,0.000004371746,0.00003339307,0.00000857121,0.00009756852,0.9967259,0.00017892706,0.00018303383,0.002634281],"study_design_scores_gemma":[0.0000053269628,0.000028753158,0.00026073345,0.0000025440904,0.0000028835555,0.000059168495,0.000003801501,0.0011655464,0.9962985,0.000037857866,0.0021289915,0.0000058845903],"about_ca_topic_score_codex":0.0015677335,"about_ca_topic_score_gemma":0.0014198344,"teacher_disagreement_score":0.0015677335,"about_ca_system_score_codex":0.00057826587,"about_ca_system_score_gemma":0.0004063168,"threshold_uncertainty_score":0.0041956306},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09745448,0.0015227551,0.66772944,0.0009099327,0.001282878,0.00036081427,0.0029398785,0.14642806,0.081371784],"genre_scores_gemma":[0.37450063,0.00072433846,0.556848,0.0007567831,0.00028070185,0.0005827104,0.009680936,0.014160336,0.042465568],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985483,0.0001930574,0.00014106894,0.0002242435,0.0006675548,0.00022572806],"domain_scores_gemma":[0.99653757,0.0008116017,0.0001970782,0.00091519696,0.0013942663,0.00014430529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010196865,0.0015204113,0.00069569045,0.0013712778,0.00061619794,0.0024827903,0.0016575751,0.0008083038,0.03084063],"category_scores_gemma":[0.0076614004,0.00065292604,0.00054664235,0.001721658,0.00047745818,0.003551147,0.001570111,0.0018753177,0.017269049],"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.0016605495,0.00039103196,0.0052759727,0.00052321394,0.000082924846,0.000574302,0.0005924275,0.020949531,0.064407736,0.05743327,0.19726907,0.65084],"study_design_scores_gemma":[0.0005510454,0.0005273071,0.0023961787,0.00029972036,0.00009723571,0.0006791666,0.00027750706,0.25257474,0.35257444,0.043123126,0.3466686,0.00023098047],"about_ca_topic_score_codex":0.0022469435,"about_ca_topic_score_gemma":0.0023787878,"teacher_disagreement_score":0.03084063,"about_ca_system_score_codex":0.0006720386,"about_ca_system_score_gemma":0.0013335529,"threshold_uncertainty_score":0.10317218},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32328555,0.00038740275,0.6433468,0.000343395,0.00014664687,0.00026250756,0.00018369219,0.014816789,0.017227262],"genre_scores_gemma":[0.7124972,0.00015327231,0.27902,0.00012709363,0.000045603374,0.0001472401,0.00044782402,0.0013145682,0.0062472546],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990989,0.00014048976,0.000069252426,0.00018521318,0.00035609477,0.00015009752],"domain_scores_gemma":[0.99850756,0.00060090487,0.000114138755,0.0004299319,0.00025746357,0.000089937545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074312586,0.00095560483,0.000525981,0.0005220663,0.000466004,0.0011396381,0.0012556477,0.00044928803,0.006596493],"category_scores_gemma":[0.002920781,0.00036049483,0.0005979665,0.00049719546,0.0006423395,0.0013898835,0.0012701125,0.0009800452,0.0013257476],"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.0022526414,0.0005331674,0.0041901344,0.0008857306,0.00015051059,0.00072789594,0.0008554638,0.2553707,0.34726515,0.022244114,0.0071047503,0.3584197],"study_design_scores_gemma":[0.00024746792,0.0005596093,0.001518661,0.000024365416,0.00006299978,0.0002515381,0.00022414526,0.7840241,0.18750285,0.010399025,0.015145758,0.00003947301],"about_ca_topic_score_codex":0.0019131718,"about_ca_topic_score_gemma":0.0027295635,"teacher_disagreement_score":0.006596493,"about_ca_system_score_codex":0.0006726348,"about_ca_system_score_gemma":0.0009634946,"threshold_uncertainty_score":0.022067487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.327556,0.0017296985,0.6095933,0.00040691256,0.00038042502,0.0002483195,0.00029069252,0.045660134,0.014134556],"genre_scores_gemma":[0.80634457,0.00026115446,0.18721573,0.00023300706,0.0000629375,0.00014536432,0.00037175277,0.0021120624,0.0032535265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987,0.00026079576,0.000085512904,0.00031907108,0.00039612778,0.00023851192],"domain_scores_gemma":[0.998071,0.00045262833,0.00017931708,0.0008343605,0.00023522416,0.000227455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010703355,0.0010223128,0.00062967575,0.0005729309,0.00063456164,0.0009769087,0.0024730938,0.00047645884,0.0023213064],"category_scores_gemma":[0.0033699886,0.0005793204,0.000564029,0.0006784549,0.0010126237,0.001732016,0.0021144685,0.0018549036,0.00073754485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021317021,0.0011158837,0.016165545,0.00074494764,0.00023513853,0.00077134697,0.0008646061,0.20537502,0.29355738,0.051090017,0.02753617,0.40041223],"study_design_scores_gemma":[0.00025456838,0.0004093817,0.0027321347,0.00003321092,0.000058449627,0.0002303642,0.00007430728,0.83721894,0.119418174,0.013745656,0.025738586,0.000086252236],"about_ca_topic_score_codex":0.0034558594,"about_ca_topic_score_gemma":0.0061899736,"teacher_disagreement_score":0.0034558594,"about_ca_system_score_codex":0.0010720014,"about_ca_system_score_gemma":0.0021849305,"threshold_uncertainty_score":0.007777989},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85753113,0.0070457426,0.118783705,0.0016153903,0.00018229433,0.0002074755,0.0008279909,0.007002869,0.0068034343],"genre_scores_gemma":[0.9750396,0.00086524116,0.022826439,0.00012067419,0.000040343155,0.000075817254,0.0003565546,0.00018159069,0.00049380964],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9899434,0.0033793186,0.0007567748,0.0010546155,0.0039997245,0.0008661973],"domain_scores_gemma":[0.9347727,0.04168104,0.0043776575,0.012932688,0.005605841,0.0006299917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00509533,0.0010676165,0.0007606721,0.0014499009,0.00080597604,0.0018848653,0.0028957343,0.0010180271,0.00101567],"category_scores_gemma":[0.042293854,0.0005551126,0.00042446805,0.0030881073,0.0012211063,0.0032170177,0.0012705112,0.0010785162,0.0003991783],"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.0035100742,0.0010039853,0.09000301,0.0026318028,0.00051299826,0.00082943606,0.0013509925,0.19771075,0.13598591,0.007901721,0.006008899,0.5525505],"study_design_scores_gemma":[0.00016082318,0.0026772518,0.049493745,0.0005130392,0.00038119542,0.0014562465,0.0013672578,0.56596035,0.35348004,0.00988233,0.014351209,0.00027644675],"about_ca_topic_score_codex":0.006087006,"about_ca_topic_score_gemma":0.0043330467,"teacher_disagreement_score":0.006087006,"about_ca_system_score_codex":0.0013546164,"about_ca_system_score_gemma":0.0015363181,"threshold_uncertainty_score":0.026947021},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016040675,0.0011071202,0.9218391,0.0020083266,0.0010306,0.0001121949,0.0001397559,0.005712837,0.052009374],"genre_scores_gemma":[0.35206124,0.0019546328,0.5828388,0.004238299,0.0007787753,0.00056972745,0.000665922,0.0029566672,0.05393597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9960932,0.0008739097,0.00033513497,0.0005609426,0.0015488927,0.00058790314],"domain_scores_gemma":[0.9952834,0.0011277407,0.00016533006,0.0018053275,0.001310163,0.00030803765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002615649,0.00078461773,0.00048057997,0.00079174584,0.0011385455,0.0059912363,0.0034729736,0.001990598,0.00637066],"category_scores_gemma":[0.00539524,0.00067592534,0.0006747568,0.00053383247,0.0031580387,0.008441331,0.0050979024,0.0054096803,0.0026392003],"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.00034496238,0.00008068241,0.001211581,0.0003483385,0.000033387263,0.0005600827,0.0011563199,0.0056718956,0.015937183,0.82897365,0.019612921,0.12606902],"study_design_scores_gemma":[0.00015194571,0.00031326106,0.0006369264,0.00043685536,0.0000655751,0.0011717147,0.0004114567,0.044299666,0.036832295,0.3205049,0.59500766,0.00016777364],"about_ca_topic_score_codex":0.001447772,"about_ca_topic_score_gemma":0.0017179848,"teacher_disagreement_score":0.00637066,"about_ca_system_score_codex":0.0014569494,"about_ca_system_score_gemma":0.0012372902,"threshold_uncertainty_score":0.021311998},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35761914,0.001020195,0.62111145,0.0007412619,0.00017579577,0.00014274385,0.00017243765,0.003929922,0.01508703],"genre_scores_gemma":[0.9091829,0.00012410793,0.087851875,0.00011743593,0.000026548658,0.000070403614,0.00012218929,0.00013097326,0.002373501],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992723,0.00020291698,0.00004665048,0.00008753924,0.00028310184,0.00010743869],"domain_scores_gemma":[0.99825853,0.0004120377,0.0001989654,0.000666833,0.00038481795,0.00007877437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010162949,0.00028661842,0.0003508824,0.0004705624,0.0006734754,0.0010204196,0.0012538204,0.00035317775,0.0012772304],"category_scores_gemma":[0.0036320018,0.000304377,0.00023700263,0.0007743783,0.00078714895,0.001315324,0.0012477558,0.00067367055,0.00021978734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014014574,0.0003063538,0.01598201,0.0004947941,0.00017061672,0.0006451495,0.0012865703,0.41570097,0.11495806,0.16662659,0.018036434,0.264391],"study_design_scores_gemma":[0.00013454932,0.0002312064,0.0012007758,0.000022398643,0.000046114626,0.00011362338,0.00015310898,0.9305805,0.026524333,0.030037712,0.010929816,0.000025897136],"about_ca_topic_score_codex":0.00496273,"about_ca_topic_score_gemma":0.011863536,"teacher_disagreement_score":0.00496273,"about_ca_system_score_codex":0.0010390556,"about_ca_system_score_gemma":0.0015382657,"threshold_uncertainty_score":0.009867728},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051119115,0.00057588035,0.8856834,0.00019486899,0.00004382945,0.00018384574,0.0016332668,0.058382817,0.0021829247],"genre_scores_gemma":[0.26334715,0.00035323616,0.7225342,0.0002341814,0.00005262842,0.0002633953,0.0054903105,0.0052284044,0.0024965347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991842,0.00011394032,0.000055512388,0.00023382112,0.00032466068,0.00008778843],"domain_scores_gemma":[0.9980217,0.00083854777,0.00031562085,0.00044130627,0.00031488755,0.0000679046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009061534,0.0014272416,0.0005854788,0.0029313595,0.00048266473,0.0011170135,0.0011206041,0.00057154306,0.002217378],"category_scores_gemma":[0.003215361,0.00052345154,0.001258812,0.0013371501,0.0007100036,0.0022084592,0.0012269246,0.0010606656,0.0012300096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058620336,0.00036640625,0.03210174,0.0009245292,0.00028569187,0.00062005705,0.00080877315,0.09024794,0.09560235,0.015365436,0.01640951,0.7466813],"study_design_scores_gemma":[0.00005570159,0.00045857066,0.0077550095,0.00009571996,0.000103651444,0.00032745415,0.00019378624,0.90045196,0.045784373,0.027036551,0.01766631,0.00007089802],"about_ca_topic_score_codex":0.0042796126,"about_ca_topic_score_gemma":0.005509481,"teacher_disagreement_score":0.0042796126,"about_ca_system_score_codex":0.0006614074,"about_ca_system_score_gemma":0.00159243,"threshold_uncertainty_score":0.0085093975},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8762683,0.0043810923,0.08746977,0.0005732642,0.00020444946,0.00010683528,0.00077478436,0.0022768292,0.027944684],"genre_scores_gemma":[0.95857537,0.0005429551,0.036852118,0.00008825706,0.000017954944,0.000049718987,0.00026638518,0.00006863785,0.0035386705],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99994326,0.000009891321,0.0000024179187,0.000006224614,0.000026955922,0.00001130757],"domain_scores_gemma":[0.9998735,0.000047329235,0.000024993282,0.000016367345,0.000030094394,0.000007670517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011651812,0.00017454916,0.0001694875,0.00016071276,0.00014219491,0.0003373869,0.0005627625,0.00020594556,0.0025895922],"category_scores_gemma":[0.0003281197,0.000090996386,0.00011222843,0.0001925074,0.00009634741,0.00044915124,0.000114113245,0.00017184218,0.00054481556],"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.0008663191,0.00025544656,0.008977397,0.0015819791,0.00015408639,0.001164759,0.00020206119,0.17573664,0.63811004,0.027374117,0.01904169,0.12653539],"study_design_scores_gemma":[0.00020974061,0.0027364572,0.012077921,0.00018769944,0.0001742703,0.0013103546,0.00032210874,0.46985212,0.43311414,0.006403188,0.073536225,0.00007585294],"about_ca_topic_score_codex":0.0004682839,"about_ca_topic_score_gemma":0.0019384706,"teacher_disagreement_score":0.0025895922,"about_ca_system_score_codex":0.0002642696,"about_ca_system_score_gemma":0.0002066521,"threshold_uncertainty_score":0.008662999},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14107944,0.0015200898,0.7894566,0.0011000797,0.00013620449,0.00018354185,0.0016679222,0.003999546,0.06085663],"genre_scores_gemma":[0.9325331,0.00094062515,0.046353683,0.00028578262,0.00007890053,0.0002572322,0.0005536,0.0003090775,0.01868803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952793,0.000075665484,0.00001928882,0.00008857302,0.0002053865,0.00008313898],"domain_scores_gemma":[0.9995302,0.00016713073,0.000057949623,0.00007713772,0.0001506006,0.00001709319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002695984,0.0006951433,0.0005914459,0.0008288536,0.00036721214,0.0010349809,0.0024262317,0.0010764832,0.003271788],"category_scores_gemma":[0.0017640188,0.00046389035,0.0006356952,0.0009116938,0.00046903617,0.0017300138,0.00066915946,0.00057896215,0.001101555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035069443,0.0000343539,0.00046005117,0.000038707654,0.000019954907,0.00006572392,0.000054111668,0.9769006,0.0036356065,0.0099581,0.0012912542,0.0075066173],"study_design_scores_gemma":[0.000002741679,0.0000083604245,0.000077128374,0.0000024926019,0.000003664492,0.000016466978,0.000006065546,0.9975617,0.0005662307,0.0010937639,0.000657547,0.0000039033616],"about_ca_topic_score_codex":0.009281026,"about_ca_topic_score_gemma":0.0036500164,"teacher_disagreement_score":0.009281026,"about_ca_system_score_codex":0.0012330877,"about_ca_system_score_gemma":0.00076010614,"threshold_uncertainty_score":0.018454015},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18044688,0.0016216419,0.79321915,0.0002855794,0.00031377058,0.000251312,0.00010201844,0.0119543765,0.011805287],"genre_scores_gemma":[0.8280453,0.00037518967,0.16403644,0.0002666582,0.000052667096,0.0001024379,0.00013224252,0.00029068423,0.006698351],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99978656,0.000036045378,0.000011647465,0.000046531022,0.00006934298,0.000049790462],"domain_scores_gemma":[0.99979466,0.00003428142,0.000030139581,0.00006485468,0.000044101453,0.000031987547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020795765,0.0003808311,0.00020735494,0.00027116627,0.0002487499,0.0006226224,0.0015800189,0.00026776502,0.002556997],"category_scores_gemma":[0.00050573295,0.00023912989,0.00021752037,0.00018908984,0.0002682656,0.0006636692,0.00049116276,0.00065138744,0.000614113],"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.0015984643,0.00028635064,0.0075149834,0.0006187304,0.0001621689,0.0010727812,0.00045981057,0.053685557,0.41731647,0.02643875,0.015510301,0.4753357],"study_design_scores_gemma":[0.00018156832,0.002371717,0.0052420376,0.00010004488,0.00014915646,0.0023403408,0.000113061986,0.5640927,0.29010436,0.006232228,0.12894708,0.00012574627],"about_ca_topic_score_codex":0.0009040875,"about_ca_topic_score_gemma":0.0011455319,"teacher_disagreement_score":0.002556997,"about_ca_system_score_codex":0.00033201597,"about_ca_system_score_gemma":0.0004615416,"threshold_uncertainty_score":0.008554041},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003968806,0.000057032103,0.93713874,0.0001663444,0.00014214806,0.00021755777,0.00041836372,0.0461355,0.011755422],"genre_scores_gemma":[0.06945571,0.00019265205,0.89275795,0.0006470941,0.0000769424,0.0009570219,0.0015130261,0.02117462,0.013224901],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761355,0.0005529976,0.00031301868,0.0004016996,0.0007980956,0.00032062206],"domain_scores_gemma":[0.99626994,0.0013393707,0.00026458217,0.001271622,0.00065025134,0.00020421355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029801785,0.0015370614,0.0010505525,0.00076543016,0.0009100751,0.0020540457,0.0033832109,0.0010921323,0.026406145],"category_scores_gemma":[0.010273741,0.0010044235,0.0017737512,0.0008314042,0.0014369553,0.0025917804,0.0038644632,0.0036719055,0.010042679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010285178,0.0005218654,0.005081484,0.0016922691,0.0003290568,0.0011460959,0.001163803,0.12635328,0.05619723,0.24418503,0.1312724,0.43102896],"study_design_scores_gemma":[0.00032680348,0.00008647625,0.0010459536,0.00022034456,0.000078077115,0.000510932,0.000113617556,0.66310483,0.07187665,0.06970668,0.19273786,0.00019179612],"about_ca_topic_score_codex":0.0030256188,"about_ca_topic_score_gemma":0.0039612483,"teacher_disagreement_score":0.026406145,"about_ca_system_score_codex":0.0010860085,"about_ca_system_score_gemma":0.0029891604,"threshold_uncertainty_score":0.08833736},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9788052,0.00026788696,0.008455851,0.000059166137,0.000034793225,0.000033982702,0.00014012313,0.00070738455,0.0114955595],"genre_scores_gemma":[0.9915929,0.000083608764,0.0056063365,0.000021187723,0.0000045632446,0.00003137527,0.00019374103,0.0000496954,0.0024166526],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997594,0.000025344276,0.000016274817,0.00004346234,0.00009602934,0.000059490674],"domain_scores_gemma":[0.99962723,0.00009798962,0.000048621157,0.00007718841,0.000103619925,0.00004531121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017110593,0.0002216521,0.00019413797,0.0003910256,0.00015434615,0.0004547,0.00063359266,0.00016085365,0.0037054673],"category_scores_gemma":[0.00092840526,0.00015457519,0.00013104854,0.00031137487,0.000235469,0.00046518975,0.0004580063,0.0002548268,0.0003542163],"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.0057092514,0.00037780337,0.017106358,0.0009549317,0.00016435025,0.0009769902,0.00045304635,0.20639205,0.47490564,0.012532456,0.007767107,0.27265996],"study_design_scores_gemma":[0.0005292137,0.006617043,0.048722476,0.00011880663,0.00019036392,0.00094343716,0.0005583982,0.5782791,0.33241674,0.0024747925,0.029074749,0.000074835065],"about_ca_topic_score_codex":0.001324885,"about_ca_topic_score_gemma":0.0026356345,"teacher_disagreement_score":0.0037054673,"about_ca_system_score_codex":0.00033618338,"about_ca_system_score_gemma":0.000474933,"threshold_uncertainty_score":0.012396038},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8327793,0.0019292808,0.1515803,0.00025123326,0.0000543273,0.00010758581,0.00018543904,0.0014651357,0.011647576],"genre_scores_gemma":[0.94297534,0.00029093004,0.054289073,0.000048395985,0.000016889144,0.00010125159,0.00020510382,0.00024274731,0.0018302511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906856,0.00018281813,0.00004866494,0.00014572294,0.00035360717,0.00020060597],"domain_scores_gemma":[0.9971974,0.0013652752,0.00032745575,0.00042435172,0.0005666358,0.00011878272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009844932,0.0005461526,0.00038506236,0.0010128784,0.00062317686,0.0011686522,0.0016470082,0.00064539054,0.0019448217],"category_scores_gemma":[0.0065033943,0.000271021,0.0003552445,0.0015074722,0.00085627957,0.0013528191,0.0007706217,0.000610544,0.00022274382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052147446,0.0004763,0.02839908,0.00045670342,0.00016280396,0.00051271525,0.000746039,0.7455245,0.02904655,0.05538834,0.00413775,0.13462773],"study_design_scores_gemma":[0.00002863805,0.000058215835,0.0034153503,0.00001742901,0.0000257763,0.000066425,0.00012871345,0.9819312,0.007427607,0.004981899,0.0019062653,0.000012437032],"about_ca_topic_score_codex":0.0073088463,"about_ca_topic_score_gemma":0.005211063,"teacher_disagreement_score":0.0073088463,"about_ca_system_score_codex":0.0015131774,"about_ca_system_score_gemma":0.0012683494,"threshold_uncertainty_score":0.014532626},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3916469,0.0055822255,0.5408508,0.0010428805,0.00025454408,0.00031095743,0.0007533697,0.044448487,0.015109794],"genre_scores_gemma":[0.8644445,0.00047875312,0.13048147,0.0002860601,0.00009196715,0.00025345912,0.0009229079,0.00059549377,0.0024455045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992743,0.00016758681,0.000045710152,0.0000782705,0.00027273796,0.00016135904],"domain_scores_gemma":[0.9987833,0.00031722194,0.00015271058,0.00040694093,0.00025254552,0.00008726025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079333136,0.0007783226,0.0005378987,0.00077825546,0.00070778467,0.001127211,0.0027712502,0.00049852184,0.002468792],"category_scores_gemma":[0.0029572335,0.0003443622,0.00027786347,0.0012556626,0.00048218007,0.0020261586,0.0015570141,0.0008833026,0.0005954045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024589999,0.0009648087,0.013358315,0.0010566011,0.00026630136,0.000452223,0.0004520721,0.26536027,0.09957343,0.047742378,0.0769831,0.49133152],"study_design_scores_gemma":[0.00027760008,0.00044988308,0.001487696,0.000040382154,0.000077211385,0.00013473844,0.00007543689,0.9155817,0.055481363,0.010976124,0.015377976,0.000039961353],"about_ca_topic_score_codex":0.002515069,"about_ca_topic_score_gemma":0.0067410455,"teacher_disagreement_score":0.0027712502,"about_ca_system_score_codex":0.00090781733,"about_ca_system_score_gemma":0.002020295,"threshold_uncertainty_score":0.008258939},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075399196,0.0075638,0.028470693,0.050231796,0.022292232,0.0010959563,0.037824325,0.008143093,0.83683825],"genre_scores_gemma":[0.016333543,0.0061335224,0.012115542,0.0022724224,0.0033789836,0.00035616857,0.01575243,0.0013883279,0.9422691],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99527353,0.00030090185,0.00029533665,0.00088792044,0.0027908448,0.00045154567],"domain_scores_gemma":[0.9869112,0.0007947704,0.0007297694,0.0021347986,0.0073485607,0.0020808438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004649497,0.0012394116,0.0013481965,0.0027454055,0.0014849557,0.0063517652,0.001658317,0.0014004409,0.23961289],"category_scores_gemma":[0.0076312525,0.00039601192,0.00042566663,0.0030414434,0.00079245487,0.0029110792,0.002647923,0.0029409705,0.24233292],"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.000050269988,0.000057519126,0.0005515918,0.00019370375,0.000009518869,0.000048718462,0.00008518987,0.00016199131,0.0009679122,0.024253555,0.86157924,0.1120409],"study_design_scores_gemma":[0.000010978398,0.000018802964,0.000631687,0.000038900096,0.0000044998233,0.00009463543,0.00003194331,0.00028262025,0.0010485566,0.0022262244,0.9956052,0.0000060171465],"about_ca_topic_score_codex":0.0027937256,"about_ca_topic_score_gemma":0.002624778,"teacher_disagreement_score":0.23961289,"about_ca_system_score_codex":0.004937116,"about_ca_system_score_gemma":0.013289723,"threshold_uncertainty_score":0.80158496},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98012197,0.00019598968,0.015492813,0.00010008589,0.000024811203,0.000031794352,0.00018551135,0.0004944658,0.0033526062],"genre_scores_gemma":[0.99391335,0.00007559952,0.0051451195,0.000014056386,0.0000019055404,0.000024615438,0.00010993571,0.000047223948,0.00066815224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996915,0.00006359747,0.000020246143,0.00004990214,0.0001113471,0.00006352873],"domain_scores_gemma":[0.99908423,0.00046232258,0.0000990247,0.00012802352,0.00017473257,0.000051676718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000458998,0.00063503813,0.00036494495,0.00050224026,0.00037999102,0.0007665035,0.00062350865,0.00043222978,0.0026801163],"category_scores_gemma":[0.0020517039,0.00028456515,0.00030531574,0.00055916305,0.00032073952,0.0007466588,0.0004300792,0.00042936974,0.00022808288],"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.0020647112,0.00042269498,0.030171378,0.0004577148,0.00015197048,0.00050153374,0.00047230758,0.73724705,0.16388027,0.0028059513,0.0021215314,0.059702877],"study_design_scores_gemma":[0.000073704905,0.0009569595,0.01662627,0.000035473036,0.00006746973,0.00012821112,0.00023064493,0.887049,0.09100277,0.0008940696,0.0028972467,0.00003814553],"about_ca_topic_score_codex":0.002737214,"about_ca_topic_score_gemma":0.0028209265,"teacher_disagreement_score":0.002737214,"about_ca_system_score_codex":0.00053010514,"about_ca_system_score_gemma":0.00047001772,"threshold_uncertainty_score":0.0089659095},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041029807,0.00015415117,0.9501692,0.00010874808,0.000037683178,0.000080562924,0.00008121523,0.0026423128,0.0056962967],"genre_scores_gemma":[0.29463437,0.00013243119,0.7007245,0.00007936628,0.00003216967,0.0001799354,0.0002615821,0.0006802952,0.0032754412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990514,0.00014366607,0.0000536607,0.00019001233,0.00045454918,0.00010662335],"domain_scores_gemma":[0.99855465,0.0006130565,0.00016706572,0.00027543877,0.00034835862,0.00004151874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008354333,0.00062675634,0.00058420567,0.00065613363,0.00070492737,0.0008575398,0.0007908839,0.0004315739,0.0020558957],"category_scores_gemma":[0.003529469,0.0004156271,0.0007010037,0.0007513307,0.0010144801,0.00077917223,0.0007110701,0.0006963209,0.00056765915],"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.00045902393,0.00022436293,0.0025135807,0.0006996066,0.00007822828,0.00047835338,0.00071929564,0.3753134,0.13362771,0.15543903,0.005781649,0.3246658],"study_design_scores_gemma":[0.00007728294,0.00018055603,0.00025556263,0.000038548773,0.000043337164,0.00013379223,0.00007626028,0.81064326,0.1124577,0.06284854,0.013226151,0.000018910014],"about_ca_topic_score_codex":0.0014285967,"about_ca_topic_score_gemma":0.0020828291,"teacher_disagreement_score":0.0020558957,"about_ca_system_score_codex":0.0007317261,"about_ca_system_score_gemma":0.0013386512,"threshold_uncertainty_score":0.006877601},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050071194,0.0001562611,0.5561295,0.0004347542,0.00018958369,0.0005765378,0.0027947307,0.4268009,0.007910527],"genre_scores_gemma":[0.14931826,0.00086563145,0.694867,0.0019089933,0.00025202017,0.003071397,0.021490667,0.101293944,0.0269321],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976482,0.00032961168,0.00030420293,0.00033303173,0.0010220738,0.00036293577],"domain_scores_gemma":[0.9966354,0.0007253881,0.00029955895,0.00096316996,0.0007111482,0.0006653695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031079783,0.0016818239,0.00114933,0.0013307058,0.0011429323,0.0019373501,0.0068380535,0.0010520081,0.017361829],"category_scores_gemma":[0.007874482,0.0014965956,0.0017298614,0.0013596384,0.0018476326,0.0045755734,0.006786752,0.0044114348,0.012736149],"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.0030559916,0.0011051391,0.010614117,0.0034407654,0.00055147964,0.0017621313,0.0017246046,0.05136009,0.08208814,0.06142471,0.46979737,0.31307536],"study_design_scores_gemma":[0.0008379725,0.00036599964,0.0054310537,0.00025679558,0.00016888107,0.001197846,0.00019005747,0.33208025,0.08672383,0.048204448,0.52411413,0.00042872367],"about_ca_topic_score_codex":0.0031726223,"about_ca_topic_score_gemma":0.0026431696,"teacher_disagreement_score":0.017361829,"about_ca_system_score_codex":0.001620842,"about_ca_system_score_gemma":0.004785901,"threshold_uncertainty_score":0.05808109},"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":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034371387,0.00076536974,0.45953307,0.0002276841,0.00021408063,0.0004096444,0.0073806914,0.49003762,0.0070604784],"genre_scores_gemma":[0.5135586,0.001160427,0.40211558,0.00074634945,0.00021203885,0.0013117841,0.023571344,0.04321205,0.014111841],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975237,0.0003439935,0.00018714236,0.0004530148,0.0012673535,0.0002247448],"domain_scores_gemma":[0.9954776,0.0016310639,0.0005020757,0.0012004888,0.0009807709,0.00020791979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013213797,0.0027929288,0.0010028052,0.0026400439,0.0003564247,0.001534424,0.0021433716,0.00083993963,0.0051196376],"category_scores_gemma":[0.007656793,0.0013207243,0.00082271866,0.0016100714,0.00043502823,0.00218959,0.0016169508,0.0024599044,0.0044312445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002284112,0.0005431617,0.02136683,0.0017539194,0.00038258205,0.00077517255,0.0008911789,0.045695115,0.097340286,0.007602751,0.15168475,0.6696802],"study_design_scores_gemma":[0.00025815098,0.0009073812,0.021968074,0.00024964265,0.00020722707,0.001463133,0.00015055801,0.6037489,0.2085056,0.012963611,0.14916854,0.00040910658],"about_ca_topic_score_codex":0.0016853645,"about_ca_topic_score_gemma":0.0017930722,"teacher_disagreement_score":0.0051196376,"about_ca_system_score_codex":0.0005106148,"about_ca_system_score_gemma":0.0013600949,"threshold_uncertainty_score":0.017126918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003941573,0.00054765743,0.9788199,0.0012235994,0.00008936988,0.00007108641,0.00006172408,0.00015437284,0.015090672],"genre_scores_gemma":[0.6003775,0.002276458,0.3811482,0.00079420855,0.00072779396,0.00076410157,0.00014590987,0.000275059,0.013490758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933965,0.0025056656,0.00033548364,0.0008826371,0.0023839124,0.0004957181],"domain_scores_gemma":[0.9874538,0.0068673007,0.001108267,0.0027393783,0.001362951,0.00046818462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050315117,0.0014657094,0.0009844252,0.0022035628,0.0016231207,0.0040180464,0.0031880203,0.0019144971,0.004549054],"category_scores_gemma":[0.015608912,0.00088450476,0.0014698537,0.0017106321,0.009465792,0.009849265,0.0027663945,0.004015462,0.00062520575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003831421,0.000013594518,0.00009607811,0.000046471283,0.000007725568,0.000024095538,0.00010891084,0.0073879557,0.0003353545,0.9892418,0.0003196635,0.0024145697],"study_design_scores_gemma":[0.000005286159,0.000023179826,0.000107022686,0.000023141902,0.000009943189,0.00006248767,0.00007060544,0.06145824,0.0003662595,0.93231297,0.0055454057,0.000015430627],"about_ca_topic_score_codex":0.001418493,"about_ca_topic_score_gemma":0.00096479384,"teacher_disagreement_score":0.0050315117,"about_ca_system_score_codex":0.003675246,"about_ca_system_score_gemma":0.0017664564,"threshold_uncertainty_score":0.026665926},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3954679,0.00087881275,0.60035574,0.00011316428,0.000027084005,0.000034863882,0.00010128706,0.0009032846,0.0021178399],"genre_scores_gemma":[0.900134,0.00020439773,0.09875008,0.00006241886,0.000012213534,0.00004264601,0.00009177473,0.000034224056,0.000668228],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999936,0.000008211197,0.0000062688314,0.000014111033,0.000026529236,0.000008776909],"domain_scores_gemma":[0.99984014,0.000036342546,0.00004346502,0.000027584765,0.00004398467,0.000008409494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007670633,0.00019477842,0.00019547665,0.0002204413,0.00019441177,0.00024929122,0.0004621287,0.00023391335,0.00035476647],"category_scores_gemma":[0.00026276842,0.00017150889,0.00017105584,0.00030604957,0.00011166459,0.0003917799,0.00017992435,0.00010568302,0.000108601365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019004798,0.00007651578,0.0056576263,0.00020202219,0.000092789356,0.00036736493,0.00013502239,0.15063211,0.65996987,0.0024113632,0.001208064,0.17905726],"study_design_scores_gemma":[0.000026793965,0.00028002108,0.0022981982,0.000013534834,0.00006413131,0.00052333093,0.00006623227,0.81815207,0.17424375,0.0008854087,0.0034238463,0.000022675684],"about_ca_topic_score_codex":0.00081768696,"about_ca_topic_score_gemma":0.0033283022,"teacher_disagreement_score":0.00081768696,"about_ca_system_score_codex":0.00020540605,"about_ca_system_score_gemma":0.00028863587,"threshold_uncertainty_score":0.0016258955},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029250082,0.0040125367,0.38250372,0.001985061,0.0020699005,0.00049895624,0.0064830333,0.05433678,0.5188599],"genre_scores_gemma":[0.2917755,0.0032032828,0.32028767,0.0017795711,0.00057020126,0.0007445274,0.020814938,0.0076492177,0.35317516],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994413,0.00003851014,0.000035904573,0.000117079406,0.00030481396,0.00006242008],"domain_scores_gemma":[0.999178,0.000108803055,0.000046543963,0.0003520552,0.00025616886,0.00005830226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036658745,0.00073768897,0.0005638844,0.0009539442,0.0008421623,0.0018693988,0.0014174734,0.00088146084,0.074335806],"category_scores_gemma":[0.0019383222,0.0004008422,0.0006691821,0.0007511324,0.00059033954,0.0021220713,0.0017228042,0.0008959946,0.030676248],"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.0004897694,0.00010933955,0.0016698969,0.00064786174,0.000078202436,0.00030557078,0.00032885917,0.013767147,0.029860603,0.1968364,0.24831912,0.5075872],"study_design_scores_gemma":[0.00009851328,0.000113261645,0.0006741763,0.00008435269,0.000038263206,0.0005779355,0.00006924305,0.029568577,0.016556613,0.041009348,0.91115385,0.000055935965],"about_ca_topic_score_codex":0.0011740302,"about_ca_topic_score_gemma":0.0013806006,"teacher_disagreement_score":0.074335806,"about_ca_system_score_codex":0.00056871976,"about_ca_system_score_gemma":0.00062625535,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11265338,0.0014499981,0.7117855,0.0010705573,0.00079015346,0.00028045487,0.0022039802,0.14008333,0.029682599],"genre_scores_gemma":[0.51732665,0.0008661722,0.44320717,0.00050528604,0.00033969013,0.0002678535,0.0041517843,0.015562795,0.017772658],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99877816,0.000260708,0.00010184363,0.00025274346,0.0004145908,0.00019194842],"domain_scores_gemma":[0.9971795,0.0006922235,0.00012741522,0.0010255099,0.0008987196,0.000076613534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010829499,0.0011307644,0.00078789605,0.0016781851,0.0009371538,0.002118628,0.0009425446,0.00048366396,0.013647898],"category_scores_gemma":[0.005358218,0.0006809877,0.0008352188,0.0022830106,0.00078778306,0.0020160165,0.0012708155,0.0012547068,0.0036511475],"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.0012375168,0.00013528699,0.004463732,0.00055170275,0.00014447376,0.00039382683,0.00054736494,0.05614264,0.041122496,0.04225276,0.06716641,0.78584176],"study_design_scores_gemma":[0.00036848214,0.00016520398,0.0020360523,0.00021609322,0.0001630092,0.00023260276,0.0003039217,0.66005677,0.15157755,0.08982829,0.09495742,0.00009462046],"about_ca_topic_score_codex":0.0056232726,"about_ca_topic_score_gemma":0.0075831315,"teacher_disagreement_score":0.013647898,"about_ca_system_score_codex":0.0011048575,"about_ca_system_score_gemma":0.0020141187,"threshold_uncertainty_score":0.04565674},"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":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0369004,0.00080173556,0.28411984,0.0006980352,0.0010221275,0.00048739265,0.0045904876,0.6567195,0.014660494],"genre_scores_gemma":[0.26548538,0.0009195263,0.545348,0.0014024939,0.000637999,0.0009906852,0.03283816,0.12550841,0.026869344],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99711597,0.0005529554,0.0002696712,0.00059371645,0.0010189123,0.00044869588],"domain_scores_gemma":[0.9926258,0.0011017746,0.00025756768,0.00251448,0.0031861437,0.0003142163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024066921,0.002134503,0.0016039265,0.003248924,0.0014375686,0.0027432865,0.0035418,0.0010172514,0.027782252],"category_scores_gemma":[0.010800873,0.0015193969,0.0015778908,0.0037875548,0.0007897828,0.003233571,0.0025320228,0.0027349673,0.015938863],"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.0026811867,0.0006375404,0.007486973,0.0008006835,0.00034392843,0.00047878508,0.0007213069,0.0200767,0.06205188,0.011005463,0.31929192,0.57442355],"study_design_scores_gemma":[0.0016640874,0.0005596237,0.0071765757,0.0002729237,0.00040471464,0.00045883295,0.00036406677,0.3969018,0.31964946,0.017583152,0.25465655,0.00030824],"about_ca_topic_score_codex":0.00867089,"about_ca_topic_score_gemma":0.0101849325,"teacher_disagreement_score":0.027782252,"about_ca_system_score_codex":0.0018777765,"about_ca_system_score_gemma":0.0045505785,"threshold_uncertainty_score":0.09294093},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18414092,0.0028193125,0.78837675,0.00031532822,0.00029027034,0.00016125593,0.00020676742,0.006430049,0.017259285],"genre_scores_gemma":[0.7394783,0.0005866973,0.2508484,0.00017429313,0.000069488146,0.00009927345,0.00048056,0.00021349221,0.0080494555],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983203,0.000023472265,0.000010391526,0.00003209049,0.00007076177,0.000031205644],"domain_scores_gemma":[0.99985576,0.000016364213,0.000018309387,0.00003936799,0.000051673487,0.000018407378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016302714,0.00026872024,0.00022431281,0.00028737087,0.00033458468,0.00047899486,0.0010978522,0.00024727342,0.0016920005],"category_scores_gemma":[0.00030186595,0.00012717661,0.0002468798,0.0003548184,0.00015328547,0.00047006318,0.00029104328,0.00046342277,0.000617208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065044715,0.0003004505,0.0030136723,0.00044644036,0.00015159795,0.0006019572,0.0002093879,0.16156031,0.44849283,0.040802583,0.015229229,0.3285411],"study_design_scores_gemma":[0.000078331606,0.0008406549,0.0025210835,0.00003321026,0.00009175964,0.0004464923,0.00004991293,0.86747146,0.08165051,0.0054044714,0.04136397,0.000048161284],"about_ca_topic_score_codex":0.0012277745,"about_ca_topic_score_gemma":0.002566349,"teacher_disagreement_score":0.0016920005,"about_ca_system_score_codex":0.00046066297,"about_ca_system_score_gemma":0.00067206426,"threshold_uncertainty_score":0.0056602955},"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":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02699091,0.00018892686,0.46785682,0.00026918866,0.00018192238,0.0004998209,0.0014364063,0.49438697,0.008189058],"genre_scores_gemma":[0.20718044,0.00039462824,0.67965734,0.00078758533,0.00012573239,0.0014929576,0.006427515,0.088899255,0.015034575],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99887735,0.00020835864,0.00010655934,0.00023961358,0.00043660004,0.00013147258],"domain_scores_gemma":[0.9943251,0.0033516714,0.00040944992,0.00082507776,0.00077476987,0.00031402477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001812324,0.0018749312,0.0006126299,0.0013602684,0.0005443616,0.001031057,0.002628188,0.00096400606,0.0142082125],"category_scores_gemma":[0.008130121,0.0010072562,0.00093827647,0.00074200565,0.0007731587,0.0015637105,0.002167203,0.0025557652,0.0044754343],"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.0023670576,0.0011082127,0.014263527,0.0013261059,0.0002464745,0.0022988732,0.0023398434,0.050386567,0.097248115,0.009461598,0.21769303,0.60126066],"study_design_scores_gemma":[0.0005983081,0.00037690168,0.009958568,0.0003147633,0.000112867216,0.0012344962,0.0002720459,0.64909583,0.12977289,0.009265196,0.1986428,0.00035542707],"about_ca_topic_score_codex":0.0016082198,"about_ca_topic_score_gemma":0.0026821536,"teacher_disagreement_score":0.0142082125,"about_ca_system_score_codex":0.00061066856,"about_ca_system_score_gemma":0.0011548613,"threshold_uncertainty_score":0.047531247},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042725685,0.011690699,0.0050086835,0.22005413,0.069553874,0.00008015253,0.0013809543,0.0015339672,0.68642503],"genre_scores_gemma":[0.013673703,0.0030661998,0.00191967,0.042255703,0.0031936734,0.00003533646,0.0005529488,0.0006490095,0.93465364],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99884367,0.00016150945,0.000040757317,0.00024763614,0.00042711082,0.00027926726],"domain_scores_gemma":[0.99813795,0.00013540965,0.000073037445,0.00024287026,0.000866342,0.00054439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010376178,0.0008905122,0.00065264484,0.0010661229,0.0054354845,0.0094703175,0.0011868299,0.0034772558,0.26935178],"category_scores_gemma":[0.004382409,0.0003148234,0.00073492964,0.0009337549,0.0029959565,0.007132523,0.0043975194,0.008348275,0.19820587],"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.00006867861,0.000044008248,0.000501337,0.00010419798,0.000012698718,0.0001747409,0.0011833899,0.000047005855,0.00065129326,0.06639045,0.86192095,0.06890126],"study_design_scores_gemma":[0.0000026013522,0.000006394168,0.00013728665,0.000049092156,0.0000020606394,0.000058600723,0.0004453066,0.00001181895,0.000080533355,0.003327861,0.9958723,0.0000061115957],"about_ca_topic_score_codex":0.007743459,"about_ca_topic_score_gemma":0.0130756395,"teacher_disagreement_score":0.26935178,"about_ca_system_score_codex":0.0027077857,"about_ca_system_score_gemma":0.0024193102,"threshold_uncertainty_score":0.9010715},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030879755,0.0005278533,0.9555461,0.00060978736,0.00034430978,0.00019334209,0.00040345767,0.0032139802,0.008281399],"genre_scores_gemma":[0.387403,0.00047615194,0.6010547,0.000645101,0.00023033516,0.0005230354,0.0009680213,0.00065541244,0.008044281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992417,0.0001253356,0.000077661454,0.00013781078,0.00031958838,0.00009792932],"domain_scores_gemma":[0.9975292,0.0006001601,0.00015171849,0.001113195,0.00045012118,0.0001555776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008125358,0.0006177247,0.000550306,0.0004223448,0.0006430467,0.0020034038,0.0021395893,0.00063454895,0.0037400245],"category_scores_gemma":[0.0039357604,0.0005771695,0.00065225933,0.0009233834,0.0012493089,0.003166706,0.0021754103,0.0018473311,0.0022031823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001986104,0.0005857312,0.009674421,0.0007187991,0.0001558271,0.00063917297,0.00066813576,0.18448077,0.09378122,0.38292733,0.036232222,0.28815034],"study_design_scores_gemma":[0.00013962555,0.00042860152,0.0007894613,0.000045059067,0.000041020994,0.0003832812,0.0000978036,0.8350172,0.052334204,0.07227958,0.038374454,0.0000696643],"about_ca_topic_score_codex":0.0009469214,"about_ca_topic_score_gemma":0.0015335951,"teacher_disagreement_score":0.0037400245,"about_ca_system_score_codex":0.0007377677,"about_ca_system_score_gemma":0.0017235269,"threshold_uncertainty_score":0.012511611},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12664619,0.00040967547,0.85536814,0.00014685019,0.000052900006,0.00017896968,0.00014671413,0.012805229,0.004245367],"genre_scores_gemma":[0.6398307,0.00009949074,0.3565066,0.00017759467,0.00003835366,0.00031760967,0.00042895955,0.0015195983,0.0010811299],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998212,0.00056494976,0.00009750398,0.0003602556,0.0005839119,0.00018140003],"domain_scores_gemma":[0.99694353,0.0013272285,0.00030529048,0.0007439662,0.00055230956,0.00012766772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016941895,0.001225903,0.0009901362,0.0014272153,0.0006314191,0.0009036487,0.0017500577,0.000670998,0.0018247092],"category_scores_gemma":[0.009694668,0.00061615766,0.0006405275,0.00093741325,0.0007257253,0.0011480001,0.0010764874,0.0011997935,0.00084872346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005442763,0.0005510408,0.0094246175,0.00020192667,0.00015795416,0.00020225893,0.00038463605,0.4288678,0.06453845,0.0059173927,0.005820304,0.48338935],"study_design_scores_gemma":[0.000040090672,0.0001397066,0.0011025105,0.000013742886,0.000020909962,0.0000789632,0.000027750855,0.9806835,0.013887529,0.0025889163,0.0013902609,0.000026053462],"about_ca_topic_score_codex":0.0029017627,"about_ca_topic_score_gemma":0.0042973184,"teacher_disagreement_score":0.0029017627,"about_ca_system_score_codex":0.0006874763,"about_ca_system_score_gemma":0.0011083616,"threshold_uncertainty_score":0.00895983},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15536068,0.0039812294,0.58280414,0.0010722346,0.0010693833,0.00040392627,0.0015539032,0.10426742,0.1494871],"genre_scores_gemma":[0.76563424,0.0006341709,0.17190172,0.0005064286,0.00019055331,0.00027957244,0.0020180093,0.0017508408,0.05708444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999424,0.000067286914,0.000035054712,0.00009710981,0.0002423564,0.00013428518],"domain_scores_gemma":[0.99951184,0.00009907653,0.0000455764,0.00015903085,0.00015516877,0.000029239023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022697885,0.0008709092,0.00049796264,0.0007577163,0.00057843706,0.0009862704,0.001079574,0.00040634352,0.016797362],"category_scores_gemma":[0.0010253302,0.00035791812,0.0002738321,0.001045851,0.00025966627,0.0010170557,0.0008428383,0.0007112134,0.0060186386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020544701,0.00023711774,0.0012725279,0.000599992,0.00006165362,0.0005554353,0.00018278917,0.021151954,0.16909742,0.024706548,0.0680542,0.71202594],"study_design_scores_gemma":[0.00060375454,0.0010331436,0.0045728837,0.00025242005,0.00019741099,0.0010558078,0.0001492614,0.37934777,0.33671293,0.025214482,0.2506311,0.0002291478],"about_ca_topic_score_codex":0.0016807225,"about_ca_topic_score_gemma":0.0030388823,"teacher_disagreement_score":0.016797362,"about_ca_system_score_codex":0.0005330182,"about_ca_system_score_gemma":0.00092092896,"threshold_uncertainty_score":0.056192756},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90179586,0.0010862249,0.07720327,0.0002963791,0.0001556825,0.0000585016,0.00017790658,0.0040095313,0.015216628],"genre_scores_gemma":[0.9648206,0.00018484994,0.032672666,0.00012381643,0.00001864975,0.000033943725,0.00023023822,0.00019634322,0.0017189372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994174,0.00006457918,0.00004586719,0.0001083046,0.00021857483,0.00014520882],"domain_scores_gemma":[0.99908924,0.00027218575,0.00014521417,0.0002871073,0.00013730521,0.000068914036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005413216,0.0007100672,0.0003047998,0.00047148034,0.0002649235,0.000733847,0.0009669381,0.00021819171,0.0030405282],"category_scores_gemma":[0.0020875381,0.00023131515,0.00032062244,0.00059532054,0.00037654795,0.0012975835,0.0009238621,0.00059806625,0.0004920707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022318463,0.0004595658,0.024781354,0.00071724865,0.0001770828,0.0006607696,0.00035680705,0.20442937,0.29064867,0.026999801,0.011967051,0.43657032],"study_design_scores_gemma":[0.00017808456,0.0032767407,0.013152081,0.000065138054,0.00016931674,0.0005667072,0.000273175,0.68365026,0.26796156,0.010759819,0.019863822,0.00008325502],"about_ca_topic_score_codex":0.0017553079,"about_ca_topic_score_gemma":0.0033233566,"teacher_disagreement_score":0.0030405282,"about_ca_system_score_codex":0.0009427637,"about_ca_system_score_gemma":0.0010498225,"threshold_uncertainty_score":0.010171533},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35021344,0.00062088174,0.62620944,0.0002880656,0.00009815175,0.00010371578,0.00016302441,0.018439958,0.0038632394],"genre_scores_gemma":[0.8750478,0.000118725,0.122147895,0.00007524852,0.000022747095,0.00007964603,0.00013144116,0.0006398488,0.0017366234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940825,0.00009178363,0.000039174687,0.00010218358,0.00021792928,0.000140708],"domain_scores_gemma":[0.99887484,0.00043499967,0.00016620476,0.0003019172,0.00018785463,0.000034103792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047454186,0.0006109497,0.00047547385,0.0007440644,0.00033120599,0.000633528,0.0009915078,0.00034492504,0.001319624],"category_scores_gemma":[0.0017947663,0.00032345593,0.00026731225,0.00064855866,0.0007482465,0.00088294665,0.00062478817,0.0005699092,0.0002555514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006865427,0.00029640913,0.0065502985,0.00028626644,0.00006563255,0.00044921375,0.00030412953,0.5502403,0.19246493,0.015952943,0.004404411,0.22829896],"study_design_scores_gemma":[0.000030811738,0.0000803712,0.00053954386,0.000008726295,0.000018618477,0.000041876916,0.000012817947,0.926584,0.0687982,0.002636956,0.0012336985,0.0000143916905],"about_ca_topic_score_codex":0.003764008,"about_ca_topic_score_gemma":0.005255542,"teacher_disagreement_score":0.003764008,"about_ca_system_score_codex":0.00060894847,"about_ca_system_score_gemma":0.0014807231,"threshold_uncertainty_score":0.0074841976},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2103957,0.00046343863,0.75871706,0.00017560714,0.000069179536,0.00011224524,0.00012402244,0.021234216,0.008708569],"genre_scores_gemma":[0.7811426,0.0002580024,0.20874555,0.00017796115,0.00005387593,0.00009976853,0.00034600432,0.0032276628,0.0059485664],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989619,0.00019752994,0.000087296,0.00015524485,0.0003827316,0.00021530522],"domain_scores_gemma":[0.99630654,0.0010047675,0.00040248042,0.0018980327,0.0003207283,0.00006746671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094792247,0.0006356624,0.0005329301,0.00092583644,0.00055366504,0.00086597155,0.0009760946,0.00035722714,0.001892761],"category_scores_gemma":[0.0024337913,0.00054489815,0.000998517,0.0007014384,0.0010554509,0.001393631,0.0014540408,0.0010035583,0.00066258694],"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.00058768556,0.00031365996,0.015375344,0.00086878234,0.00019189328,0.0018073845,0.0018706403,0.0835122,0.27458796,0.074112706,0.005838208,0.54093355],"study_design_scores_gemma":[0.00008675696,0.00045842293,0.005833771,0.0001475918,0.00025029818,0.0021012232,0.00019784736,0.37720454,0.5169224,0.049228784,0.04743933,0.00012893334],"about_ca_topic_score_codex":0.00094299635,"about_ca_topic_score_gemma":0.0015854494,"teacher_disagreement_score":0.001892761,"about_ca_system_score_codex":0.00069565926,"about_ca_system_score_gemma":0.0014952581,"threshold_uncertainty_score":0.00633198},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029254356,0.0061756293,0.91983587,0.005502638,0.0023348392,0.00008185879,0.00010465336,0.0021222846,0.03458794],"genre_scores_gemma":[0.6465282,0.003203108,0.32166678,0.0012284032,0.0013498939,0.00010533611,0.00016528355,0.001006244,0.024746804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770653,0.0008244936,0.00015599691,0.00023202809,0.0009078066,0.00017304177],"domain_scores_gemma":[0.99125224,0.00418886,0.0005217614,0.0027053438,0.0010450291,0.00028681487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032510478,0.0010162232,0.001143235,0.00077398174,0.0008593574,0.0030728912,0.0024648588,0.0016952843,0.011191278],"category_scores_gemma":[0.030210465,0.00051756785,0.00066469336,0.0009925966,0.0030425221,0.004857233,0.0027909996,0.00363057,0.0018465803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005158126,0.00020416238,0.0011271612,0.0007993723,0.00010308636,0.000288737,0.0005041323,0.099052824,0.0047307615,0.59781367,0.014210059,0.28065023],"study_design_scores_gemma":[0.000049629387,0.00009753133,0.00025292224,0.00019702697,0.000033790184,0.00018365178,0.000115027884,0.27138197,0.005395348,0.7120441,0.010212378,0.000036530953],"about_ca_topic_score_codex":0.00040731425,"about_ca_topic_score_gemma":0.00057368795,"teacher_disagreement_score":0.011191278,"about_ca_system_score_codex":0.00053300854,"about_ca_system_score_gemma":0.0008836775,"threshold_uncertainty_score":0.03743857},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2362384,0.0003300762,0.75132895,0.00020182446,0.000051243213,0.00022553423,0.0017709789,0.006986124,0.0028668346],"genre_scores_gemma":[0.73187906,0.00015944762,0.26306367,0.000078637844,0.000035165333,0.00032975283,0.003655945,0.00025212634,0.00054624566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982645,0.00066397316,0.0001181768,0.0002335649,0.0005929919,0.00012681652],"domain_scores_gemma":[0.99352044,0.0034590613,0.00077414484,0.0009776438,0.0011177518,0.0001509453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027334522,0.0012975502,0.00086586183,0.0024050302,0.000449448,0.00097068836,0.0010081711,0.00071396236,0.0014712659],"category_scores_gemma":[0.014019207,0.0005643503,0.00083613297,0.0020413839,0.00032971802,0.0014016525,0.000701293,0.0010995258,0.00060877757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016946472,0.00018200478,0.01621087,0.00010692429,0.000101068355,0.000100503006,0.00009153259,0.8402068,0.00501891,0.0027623912,0.0027189318,0.13233067],"study_design_scores_gemma":[0.0000064922606,0.0000334238,0.0011436342,0.000005737897,0.0000054060597,0.000018024031,0.000011900623,0.99549437,0.0015506388,0.0014049306,0.00031899285,0.000006540572],"about_ca_topic_score_codex":0.004591784,"about_ca_topic_score_gemma":0.0053802277,"teacher_disagreement_score":0.004591784,"about_ca_system_score_codex":0.00082202867,"about_ca_system_score_gemma":0.0013038476,"threshold_uncertainty_score":0.014456034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0624393,0.00016786951,0.9218067,0.00018676456,0.00015065918,0.00015959561,0.00023383561,0.010879179,0.003976102],"genre_scores_gemma":[0.63462377,0.000119633456,0.35994238,0.00024160216,0.000078664096,0.00041520782,0.0005562459,0.001599795,0.0024226701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998412,0.0005445942,0.000093029375,0.00023474015,0.00058545376,0.00013005685],"domain_scores_gemma":[0.9961635,0.0016927017,0.000320284,0.0011311616,0.00056552165,0.00012685472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013981994,0.00076948287,0.00048492328,0.0008486022,0.0003729757,0.001043914,0.0015305089,0.00043219517,0.0036425588],"category_scores_gemma":[0.008698267,0.00044008557,0.00048016701,0.000641716,0.00078991265,0.0013993211,0.0012625373,0.0010890871,0.00092898705],"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.0018010344,0.00039218037,0.016501876,0.00049685227,0.00017942762,0.00052273495,0.0009790178,0.4182181,0.09207615,0.06558041,0.010876794,0.39237544],"study_design_scores_gemma":[0.000068551424,0.00016800282,0.00046203355,0.000017438046,0.000018407569,0.00010013288,0.00004012355,0.9344126,0.048103586,0.010379579,0.0062077907,0.000021807347],"about_ca_topic_score_codex":0.0009168403,"about_ca_topic_score_gemma":0.0012563601,"teacher_disagreement_score":0.0036425588,"about_ca_system_score_codex":0.000594708,"about_ca_system_score_gemma":0.0009212198,"threshold_uncertainty_score":0.012185574},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13520928,0.002113503,0.47552034,0.0011548968,0.001197422,0.0008795628,0.012669553,0.026958518,0.3442969],"genre_scores_gemma":[0.5596096,0.0020219304,0.23975363,0.00075010036,0.00017095641,0.0011323958,0.031880397,0.013101525,0.15157944],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999549,0.00002549592,0.0000253467,0.0000524998,0.00026928633,0.00007835992],"domain_scores_gemma":[0.9990206,0.00009101946,0.000049349324,0.00013532092,0.0006538968,0.000049855244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004027153,0.001035397,0.00034340165,0.0011134953,0.0006872169,0.0014742911,0.0008829458,0.00037533572,0.034756616],"category_scores_gemma":[0.0019277178,0.0003603768,0.00027659268,0.0008444529,0.00021067224,0.001512126,0.00083731214,0.00070407847,0.008248591],"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.00076043175,0.00023793937,0.005254097,0.0010349118,0.000056324487,0.00079576485,0.0004588033,0.041100875,0.11805204,0.039084285,0.31123328,0.48193118],"study_design_scores_gemma":[0.00006294567,0.00020750817,0.0064088386,0.00029827736,0.000058171114,0.0010331334,0.00041985497,0.24395105,0.20244198,0.010668908,0.53431755,0.00013175742],"about_ca_topic_score_codex":0.004155267,"about_ca_topic_score_gemma":0.006521201,"teacher_disagreement_score":0.034756616,"about_ca_system_score_codex":0.00051905296,"about_ca_system_score_gemma":0.0013205708,"threshold_uncertainty_score":0.11627251},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14236467,0.0043840297,0.75711584,0.0025199456,0.0011627006,0.00033624354,0.0016336779,0.031818982,0.058663905],"genre_scores_gemma":[0.5830654,0.001354222,0.3849074,0.0006880138,0.0003435769,0.00017266939,0.0014491058,0.0003506219,0.027669141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998579,0.000010570894,0.0000075122316,0.000024988314,0.000080027225,0.000019051722],"domain_scores_gemma":[0.9998367,0.000029171028,0.000014146306,0.000030828793,0.00006467631,0.000024410154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018752617,0.0003309661,0.0003406704,0.00037460844,0.00035211002,0.0005650772,0.0007374135,0.00041977054,0.011842252],"category_scores_gemma":[0.0004889614,0.00022057164,0.00025466285,0.00058338855,0.00017149941,0.0008025863,0.0004898186,0.00079587696,0.0040508104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008952439,0.00023855963,0.0028482813,0.0007541597,0.00006931499,0.000668725,0.0001544764,0.020059079,0.4180676,0.036794975,0.06496516,0.45448443],"study_design_scores_gemma":[0.0002779514,0.0011536694,0.003492769,0.000117187905,0.00008194793,0.0014401148,0.000094921204,0.5084102,0.2613921,0.014854897,0.20858625,0.00009795013],"about_ca_topic_score_codex":0.00052488246,"about_ca_topic_score_gemma":0.00080281694,"teacher_disagreement_score":0.011842252,"about_ca_system_score_codex":0.00035824277,"about_ca_system_score_gemma":0.00087950274,"threshold_uncertainty_score":0.039616287},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042039813,0.000090007605,0.99318767,0.00005197832,0.000033239354,0.000021543232,0.00003312199,0.00034807133,0.0020303403],"genre_scores_gemma":[0.76868725,0.00049056427,0.22235534,0.000069413174,0.00007146117,0.00023070764,0.00030470593,0.00035053698,0.0074400473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994135,0.00019492891,0.000038057227,0.00009586182,0.00021456153,0.000043144562],"domain_scores_gemma":[0.9995049,0.00012814938,0.00008401845,0.00007796038,0.0001835109,0.00002148075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007998145,0.0009938807,0.000674134,0.00036307398,0.0003745349,0.0009420728,0.000633088,0.0005451935,0.0027982646],"category_scores_gemma":[0.0013047776,0.00020964787,0.0007195426,0.00044438674,0.00072602835,0.0009051809,0.0007420339,0.0010137478,0.0009224276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013444717,0.00008253158,0.00031011255,0.00024174748,0.000051898063,0.00011921224,0.00017528763,0.7936706,0.028196998,0.07628801,0.001672521,0.099056676],"study_design_scores_gemma":[0.0000061309997,0.00010233595,0.00007879634,0.000006167652,0.0000071881614,0.000028658857,0.000012433777,0.9881223,0.002983014,0.0060533225,0.0025878197,0.000011812064],"about_ca_topic_score_codex":0.0034756006,"about_ca_topic_score_gemma":0.0015989403,"teacher_disagreement_score":0.0034756006,"about_ca_system_score_codex":0.00048701846,"about_ca_system_score_gemma":0.00079760276,"threshold_uncertainty_score":0.009361088},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027646045,0.00033328784,0.5247955,0.00017166154,0.00024635412,0.00037206628,0.0032619284,0.44378564,0.024269065],"genre_scores_gemma":[0.055177964,0.001024136,0.70735717,0.0008069889,0.00032834808,0.0017020566,0.021944918,0.11745826,0.09420007],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978854,0.00027594937,0.0001969086,0.0003226735,0.0011046209,0.00021449801],"domain_scores_gemma":[0.99758804,0.00069684075,0.00017316814,0.00043645085,0.0009920591,0.00011343287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017926636,0.0018651311,0.0011846347,0.001544027,0.00077410415,0.0026648995,0.0033528223,0.0006066617,0.07833688],"category_scores_gemma":[0.0047438038,0.0015547118,0.0011202141,0.0011395409,0.0007740094,0.0028966528,0.0018726082,0.002834203,0.041144896],"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.00092391425,0.00012987106,0.0012922394,0.00080239493,0.00012103086,0.00035602102,0.0006071516,0.0047765644,0.019388564,0.031153554,0.5204233,0.42002535],"study_design_scores_gemma":[0.00035638988,0.00025840924,0.0016554941,0.00022165057,0.000084663334,0.0006748363,0.00015583468,0.10274432,0.09648171,0.022854704,0.77431536,0.00019665695],"about_ca_topic_score_codex":0.0022683416,"about_ca_topic_score_gemma":0.002858462,"teacher_disagreement_score":0.07833688,"about_ca_system_score_codex":0.0008520128,"about_ca_system_score_gemma":0.002166366,"threshold_uncertainty_score":0.26206297},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014079304,0.002389315,0.25092506,0.0022191834,0.0020346437,0.00073224225,0.02301103,0.2738186,0.4307906],"genre_scores_gemma":[0.16634485,0.0025177442,0.34828478,0.003573933,0.0008455182,0.0012914698,0.1313029,0.054254346,0.29158452],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982955,0.00017740752,0.000115217015,0.00038739224,0.00075627456,0.0002682877],"domain_scores_gemma":[0.99839324,0.00019955914,0.00008198651,0.0006543149,0.000528166,0.0001427038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008547604,0.0016514269,0.0010079339,0.0015603884,0.0013201358,0.0036048258,0.0037669274,0.0014036008,0.116141796],"category_scores_gemma":[0.0034307714,0.00094577984,0.0014831687,0.0018636556,0.0006383099,0.0038655996,0.004271458,0.0021054416,0.09595275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006917719,0.00020673413,0.0020456023,0.00088283647,0.00010010881,0.00033790432,0.00022753683,0.008043678,0.009214886,0.056640506,0.563743,0.35786545],"study_design_scores_gemma":[0.00009473467,0.00010394114,0.0011409194,0.00009743883,0.000035127094,0.00036487385,0.00008230659,0.031355932,0.011400646,0.019734368,0.9355245,0.000065280234],"about_ca_topic_score_codex":0.0030909905,"about_ca_topic_score_gemma":0.0038792952,"teacher_disagreement_score":0.116141796,"about_ca_system_score_codex":0.001282962,"about_ca_system_score_gemma":0.0018724601,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045734406,0.0011106727,0.94746864,0.0007739372,0.000121296835,0.00008150376,0.000058595997,0.0014452819,0.0032056295],"genre_scores_gemma":[0.76935494,0.00070678577,0.22682554,0.0002670105,0.00006996382,0.000104042185,0.000104491744,0.000204324,0.0023627896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992951,0.00017688812,0.00003204333,0.00011427629,0.00025827452,0.00012341376],"domain_scores_gemma":[0.9989441,0.00046424536,0.00010158834,0.00016967443,0.00022672038,0.00009369356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016522282,0.0007570801,0.0005379008,0.00038827886,0.00096335274,0.0014209442,0.0016729509,0.00069359224,0.0019199289],"category_scores_gemma":[0.002831532,0.0004321931,0.0003440613,0.0005508602,0.0006478077,0.0023085284,0.0009932223,0.0013124658,0.00030448876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013051169,0.00013995972,0.0011082707,0.00011994886,0.000028914592,0.000059778587,0.00008347754,0.850599,0.009668952,0.03787901,0.005088695,0.095093474],"study_design_scores_gemma":[0.0000122429265,0.000035827507,0.0001279545,0.0000054652282,0.0000046706828,0.000019241163,0.000020594305,0.9852732,0.0014793838,0.01153518,0.0014780096,0.000008283717],"about_ca_topic_score_codex":0.0037287239,"about_ca_topic_score_gemma":0.006680683,"teacher_disagreement_score":0.0037287239,"about_ca_system_score_codex":0.0015950516,"about_ca_system_score_gemma":0.0025785472,"threshold_uncertainty_score":0.011572957},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80547196,0.0005808696,0.1811361,0.0003200197,0.000045514364,0.000062010375,0.0003310374,0.0012160331,0.010836442],"genre_scores_gemma":[0.985081,0.000106180276,0.014106677,0.000016313037,0.000004733856,0.000027435279,0.00013133576,0.000096595206,0.00042979768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997912,0.00004729827,0.0000065737227,0.000050045623,0.000059794267,0.000045046407],"domain_scores_gemma":[0.9992993,0.00033889923,0.00009033883,0.00007442523,0.00015201031,0.000045115536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024012076,0.0006175381,0.0005484398,0.00070486194,0.00029913255,0.00065933965,0.0005416398,0.00055315386,0.0012528038],"category_scores_gemma":[0.0029567697,0.00040841397,0.00032524415,0.00071078143,0.0004580013,0.0008264112,0.00026620846,0.00042763364,0.0003802889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004347762,0.00002010255,0.0026246167,0.000020452837,0.0000058501873,0.00003731677,0.000012671884,0.98865813,0.002535037,0.0006863988,0.00029303442,0.0050629326],"study_design_scores_gemma":[0.0000024469473,0.000010531563,0.000491092,0.000002656858,0.0000023588548,0.000007427214,0.0000052206115,0.9978083,0.0010830825,0.00048369364,0.00010004932,0.0000031914542],"about_ca_topic_score_codex":0.004563637,"about_ca_topic_score_gemma":0.0049214032,"teacher_disagreement_score":0.004563637,"about_ca_system_score_codex":0.0009290671,"about_ca_system_score_gemma":0.00089897384,"threshold_uncertainty_score":0.0090741515},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007751707,0.00045058233,0.019732941,0.0008427345,0.0011159813,0.00016165616,0.04092772,0.81014585,0.12584738],"genre_scores_gemma":[0.009601068,0.0004386553,0.017117737,0.0011079448,0.00026114838,0.0002837181,0.06016425,0.8190064,0.09201913],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99772686,0.00026673774,0.00012847304,0.00033885104,0.0010728526,0.00046626176],"domain_scores_gemma":[0.9948078,0.00067304086,0.00016508,0.0019757478,0.0017896593,0.00058872625],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023414765,0.0034424851,0.001622776,0.0022760252,0.0014398235,0.007794858,0.0063012973,0.0030770514,0.67208093],"category_scores_gemma":[0.012901737,0.0032322416,0.0022651765,0.0021133057,0.0011170901,0.009695529,0.0074372585,0.004444703,0.7396316],"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.00019928683,0.00002400599,0.00015474834,0.0002111507,0.000015156714,0.00002895101,0.000047287576,0.00022012513,0.00058322155,0.0017920897,0.9797029,0.017021053],"study_design_scores_gemma":[0.00013623352,0.000031101164,0.0004962199,0.00012932633,0.000012786359,0.00010749039,0.0000513971,0.0008711448,0.004320987,0.003990041,0.9897628,0.00009041228],"about_ca_topic_score_codex":0.008348966,"about_ca_topic_score_gemma":0.0063226367,"teacher_disagreement_score":0.67208093,"about_ca_system_score_codex":0.0023234023,"about_ca_system_score_gemma":0.0016897307,"threshold_uncertainty_score":0.46773672},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1438999,0.0021188932,0.6032334,0.0023880864,0.00067183,0.0003036712,0.0025275678,0.1664885,0.078368135],"genre_scores_gemma":[0.4521555,0.0008163734,0.4798135,0.0010765416,0.0002452058,0.00061776856,0.005614465,0.03028822,0.029372422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809307,0.0003838668,0.00016092119,0.00022207906,0.00078948005,0.0003506599],"domain_scores_gemma":[0.99556434,0.0008685432,0.00025172922,0.0014948572,0.0016357829,0.00018473086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015694683,0.0012473179,0.00058812875,0.00084462186,0.0009260076,0.0022827662,0.0037677416,0.0011272883,0.0064654],"category_scores_gemma":[0.0071520195,0.0008526402,0.0008636733,0.001670173,0.00062635506,0.002542603,0.0013842777,0.002036924,0.0037869196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030203983,0.0008331204,0.020459788,0.0010913867,0.00029650913,0.0013051106,0.0011948989,0.105410725,0.078714624,0.0909681,0.20930025,0.4874051],"study_design_scores_gemma":[0.00041712192,0.00034187522,0.006517086,0.00032255467,0.00021434543,0.0007509089,0.0003576247,0.52182806,0.105522804,0.03870769,0.32475066,0.00026927408],"about_ca_topic_score_codex":0.00655799,"about_ca_topic_score_gemma":0.0119107785,"teacher_disagreement_score":0.00655799,"about_ca_system_score_codex":0.0013780128,"about_ca_system_score_gemma":0.002807494,"threshold_uncertainty_score":0.021628916},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84812677,0.0022153168,0.13918707,0.00022104512,0.000059654263,0.00019297887,0.00039296492,0.0008854724,0.00871877],"genre_scores_gemma":[0.9768132,0.00019690978,0.021667618,0.00005382161,0.000010088142,0.000066186185,0.00009120733,0.000021816251,0.0010791387],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983287,0.0000350718,0.000008337928,0.000031104384,0.00006724578,0.00002540085],"domain_scores_gemma":[0.9996911,0.00005329316,0.000053737273,0.0000314483,0.00014548996,0.00002495124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001572003,0.00033507112,0.00029208206,0.0002902707,0.00023908498,0.0005745947,0.0011974233,0.00044681213,0.00087510276],"category_scores_gemma":[0.00028558055,0.00015541865,0.00019770971,0.00033213498,0.00014003328,0.0005192682,0.00022474313,0.00014003609,0.0002604771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010732475,0.0003111789,0.009222412,0.00067713985,0.00029687947,0.0006742112,0.00019107478,0.3770405,0.52442145,0.0038235204,0.001982339,0.08028595],"study_design_scores_gemma":[0.00009672463,0.0026829736,0.003016957,0.00002568421,0.0001638347,0.00038580972,0.00008899149,0.85421664,0.13330027,0.0004468809,0.005534098,0.000041076808],"about_ca_topic_score_codex":0.0017417645,"about_ca_topic_score_gemma":0.0026920892,"teacher_disagreement_score":0.0017417645,"about_ca_system_score_codex":0.00054146635,"about_ca_system_score_gemma":0.0005851296,"threshold_uncertainty_score":0.0039286017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11792194,0.0003554558,0.87606823,0.000069255904,0.000050082024,0.0001176172,0.00003359611,0.0024366542,0.0029471654],"genre_scores_gemma":[0.8740855,0.00009137999,0.12429201,0.000038599104,0.000019906403,0.000088129374,0.000042735504,0.00009683274,0.0012449854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99956316,0.00009872697,0.000025451654,0.00009910648,0.00015863245,0.00005491552],"domain_scores_gemma":[0.99938226,0.00023933107,0.00012771972,0.00010288211,0.00011946879,0.0000282986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000463398,0.0005999183,0.00034529882,0.00044227118,0.00022239982,0.0003711152,0.0007080923,0.00021924922,0.0012597134],"category_scores_gemma":[0.0015780628,0.00018941755,0.00024747604,0.00024396865,0.0002133765,0.00036743766,0.0003073147,0.00040039746,0.00020935186],"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.00044651952,0.00018561339,0.0034533702,0.00016608345,0.00010293372,0.00028574848,0.00017589786,0.4325594,0.13229236,0.003110954,0.0012485766,0.4259725],"study_design_scores_gemma":[0.000029520483,0.00022404165,0.0019143133,0.000011673533,0.000038313327,0.00014053086,0.000027302318,0.9587158,0.035546474,0.0010465963,0.002283703,0.000021786642],"about_ca_topic_score_codex":0.0008648229,"about_ca_topic_score_gemma":0.0012936625,"teacher_disagreement_score":0.0012597134,"about_ca_system_score_codex":0.00030704174,"about_ca_system_score_gemma":0.00053471886,"threshold_uncertainty_score":0.0042141676},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055873368,0.00082933076,0.65108305,0.00031640186,0.00033401555,0.00042744796,0.0010605794,0.2636795,0.026396235],"genre_scores_gemma":[0.6902225,0.0006905153,0.23083375,0.0006507633,0.00016785356,0.0006190055,0.0028163998,0.036932137,0.037067167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881554,0.00016486458,0.000083730054,0.00015808806,0.0004977701,0.00028006165],"domain_scores_gemma":[0.998987,0.00028530008,0.00011138054,0.00027368547,0.00023566445,0.00010690675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001168176,0.0010777956,0.0004936765,0.00083032117,0.00059792376,0.0013277669,0.0017418641,0.0007702679,0.019143907],"category_scores_gemma":[0.0032627983,0.0008038365,0.00067799113,0.0003105578,0.0009307279,0.0020656108,0.0022506102,0.00163739,0.0065372176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0048403684,0.00043707713,0.014769617,0.0014974525,0.0002334898,0.0010901246,0.002136425,0.031150848,0.15198477,0.17144436,0.15368377,0.4667317],"study_design_scores_gemma":[0.0008117854,0.0010232163,0.0056819334,0.00039604522,0.0001752424,0.0010352914,0.0002786781,0.23781939,0.1949169,0.036879662,0.5205155,0.00046626382],"about_ca_topic_score_codex":0.0027883572,"about_ca_topic_score_gemma":0.0026151438,"teacher_disagreement_score":0.019143907,"about_ca_system_score_codex":0.0013500282,"about_ca_system_score_gemma":0.0015037525,"threshold_uncertainty_score":0.06404275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010997241,0.00036408426,0.9852357,0.000085312524,0.000082996805,0.00003982055,0.000036334215,0.00036715055,0.0027914871],"genre_scores_gemma":[0.5702572,0.00076297077,0.42116213,0.00011514259,0.000058140624,0.00017545867,0.00022566,0.00021178662,0.0070314817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970657,0.00007091386,0.000019996223,0.000058498725,0.00009593822,0.000048057187],"domain_scores_gemma":[0.9996847,0.00012511296,0.00004906002,0.00004396781,0.00007587291,0.000021215486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054314546,0.0004833911,0.000531403,0.00037410774,0.0005474681,0.00068964146,0.0009938286,0.0003704369,0.002218146],"category_scores_gemma":[0.0009287242,0.00023014414,0.00040205286,0.00054263143,0.00035039854,0.0011590299,0.0006014864,0.000718636,0.00046396485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014384583,0.00005394373,0.00028590826,0.00011477121,0.000033352422,0.00006639832,0.000049500133,0.85839427,0.0074972683,0.043234203,0.0020828743,0.08804367],"study_design_scores_gemma":[0.000008376236,0.000024397365,0.000052505675,0.0000045606434,0.0000058203486,0.000020668547,0.000011744786,0.9873447,0.0020633296,0.008516525,0.0019418413,0.0000055367127],"about_ca_topic_score_codex":0.0013646114,"about_ca_topic_score_gemma":0.0018522278,"teacher_disagreement_score":0.002218146,"about_ca_system_score_codex":0.00090496655,"about_ca_system_score_gemma":0.00091258856,"threshold_uncertainty_score":0.0074204803},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4865799,0.0024708018,0.48176947,0.0016626038,0.00021127013,0.0002675176,0.00017135598,0.014682383,0.012184658],"genre_scores_gemma":[0.8264348,0.0005434183,0.16741797,0.00026032425,0.00008059302,0.00012813137,0.00016416784,0.0014167082,0.003553817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99610305,0.0007686657,0.00029142346,0.0006088215,0.0016233167,0.00060476526],"domain_scores_gemma":[0.9903044,0.0049858945,0.000757857,0.0019769392,0.001597886,0.00037699175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00366133,0.00210153,0.0007476282,0.0017231044,0.0010144472,0.0025461935,0.0028245945,0.0011248845,0.002742694],"category_scores_gemma":[0.017309306,0.0008340215,0.00045026856,0.0015877972,0.0009768528,0.004322036,0.0022857275,0.0017649006,0.0014402816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032733602,0.0006812101,0.013867615,0.0005804303,0.00013473797,0.0009852006,0.0011263316,0.14811172,0.27970925,0.017805077,0.0090195285,0.5247056],"study_design_scores_gemma":[0.0001532166,0.00062822906,0.0040298095,0.0000843043,0.00009009975,0.00045990958,0.0002603366,0.7172755,0.24432136,0.021575376,0.01100649,0.000115337956],"about_ca_topic_score_codex":0.0014181309,"about_ca_topic_score_gemma":0.0020265558,"teacher_disagreement_score":0.00366133,"about_ca_system_score_codex":0.0012211499,"about_ca_system_score_gemma":0.0013596357,"threshold_uncertainty_score":0.019363225},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007983331,0.00035031128,0.97047126,0.00059076794,0.00016747268,0.00005642011,0.00020359519,0.0003909106,0.019785974],"genre_scores_gemma":[0.36062855,0.0015219074,0.61983395,0.0006718939,0.0005097433,0.000282097,0.00062169746,0.00029326932,0.015636876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895597,0.00022674014,0.00010732808,0.00026699298,0.0003406637,0.000102330676],"domain_scores_gemma":[0.99910516,0.00021649041,0.00012088076,0.00018925952,0.00029178848,0.000076354445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015387352,0.0005749744,0.00042135274,0.0012951436,0.0010653686,0.0023440588,0.0011915131,0.0007362068,0.006256399],"category_scores_gemma":[0.0026807892,0.00030263187,0.0015113896,0.0012052808,0.0028032123,0.0055189957,0.0019321983,0.0022440217,0.0012589259],"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.000008271163,0.000007670833,0.000067164765,0.000028432814,0.0000059729623,0.000046068082,0.00006735797,0.0045535583,0.0007889964,0.9865458,0.00060998637,0.0072706],"study_design_scores_gemma":[0.0000070495266,0.000026049827,0.000099493605,0.00002420726,0.000014395578,0.00017148412,0.000049439637,0.05407384,0.001058591,0.9250047,0.019453635,0.000017054917],"about_ca_topic_score_codex":0.0028115513,"about_ca_topic_score_gemma":0.0027794563,"teacher_disagreement_score":0.006256399,"about_ca_system_score_codex":0.0012492988,"about_ca_system_score_gemma":0.0012021643,"threshold_uncertainty_score":0.020929754},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111796275,0.00062955276,0.82560474,0.00163544,0.0004253822,0.00018347152,0.00024334883,0.04656991,0.0129118385],"genre_scores_gemma":[0.50638384,0.0004946512,0.46138948,0.0014752919,0.00013794887,0.00018133355,0.0006483229,0.018299751,0.01098941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674976,0.0006906699,0.00026454957,0.0006624193,0.0011279943,0.0005047301],"domain_scores_gemma":[0.9869479,0.0026641502,0.0006994627,0.008094024,0.0012403956,0.00035401608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003438702,0.0011274312,0.00062973786,0.00058614323,0.000875993,0.0031573346,0.0026984916,0.0011369317,0.0036650456],"category_scores_gemma":[0.020777754,0.0012821808,0.0013310906,0.0005465632,0.0026926897,0.008073229,0.003669295,0.0045559322,0.0029013364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002126983,0.000533346,0.035679486,0.0008842522,0.0002640977,0.000944652,0.0044617997,0.06324046,0.20614104,0.17658287,0.025091939,0.48404905],"study_design_scores_gemma":[0.00021512227,0.00069918815,0.0057760705,0.00055592996,0.00039830164,0.00091864227,0.000604837,0.39901572,0.281628,0.15057844,0.15923929,0.00037042156],"about_ca_topic_score_codex":0.0031807658,"about_ca_topic_score_gemma":0.003800867,"teacher_disagreement_score":0.0036650456,"about_ca_system_score_codex":0.0011125231,"about_ca_system_score_gemma":0.0035736486,"threshold_uncertainty_score":0.018185794},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33759546,0.00084298564,0.6498174,0.00045788797,0.0002009437,0.00013762957,0.00009447809,0.0007914417,0.010061751],"genre_scores_gemma":[0.9752295,0.0001546221,0.02165555,0.00002890271,0.000041890282,0.000058287384,0.000032589855,0.00004974746,0.0027489695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995035,0.0001073989,0.000035884623,0.00008113607,0.00015948137,0.000112714624],"domain_scores_gemma":[0.99827623,0.0007183078,0.00024418018,0.00033438715,0.00029319036,0.00013367941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010526523,0.00039402474,0.00054529327,0.0003489441,0.00069451064,0.001474826,0.0016111839,0.00036589804,0.0023339775],"category_scores_gemma":[0.004015584,0.00023311563,0.00023160226,0.0004693403,0.0007341953,0.0010281805,0.000985819,0.0006418017,0.00023043904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012521351,0.00036289188,0.0021681862,0.0003044848,0.00006697765,0.0003650448,0.00055239705,0.72288465,0.07572762,0.120778844,0.0032307268,0.07230613],"study_design_scores_gemma":[0.00003023957,0.000050379076,0.00023600209,0.000004366306,0.000008510132,0.000021737147,0.00003063188,0.9821394,0.00398476,0.012880217,0.00060617813,0.000007557658],"about_ca_topic_score_codex":0.0041976967,"about_ca_topic_score_gemma":0.005543281,"teacher_disagreement_score":0.0041976967,"about_ca_system_score_codex":0.0007993074,"about_ca_system_score_gemma":0.0010395631,"threshold_uncertainty_score":0.008346498},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12480318,0.003292958,0.7850865,0.00035495328,0.00045708532,0.00028161312,0.0004826964,0.043312915,0.04192803],"genre_scores_gemma":[0.5972795,0.0012797035,0.3726082,0.00063152,0.00012648577,0.00038695123,0.0016336998,0.0016157432,0.024438111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997954,0.00002737608,0.00001348968,0.000030232875,0.00008458151,0.000048985832],"domain_scores_gemma":[0.9997801,0.000031742427,0.000037357266,0.00004711101,0.000063111336,0.000040614323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022732087,0.0006082965,0.000282083,0.0005335695,0.00026875176,0.0008920382,0.0011878273,0.0003657746,0.0052085305],"category_scores_gemma":[0.00047101112,0.0003219137,0.00038808,0.00034158264,0.00042283887,0.0006055232,0.00072350074,0.0010460424,0.0022552428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013227012,0.00021891024,0.004564775,0.0009739713,0.00022797564,0.0013595701,0.0005240017,0.07393542,0.38231352,0.08118023,0.05463157,0.39874738],"study_design_scores_gemma":[0.00047193147,0.0027477527,0.0054978225,0.00020656166,0.00026021106,0.0024216098,0.00014145108,0.38198924,0.22125737,0.02264947,0.3621264,0.00023016297],"about_ca_topic_score_codex":0.0010488054,"about_ca_topic_score_gemma":0.0022543587,"teacher_disagreement_score":0.0052085305,"about_ca_system_score_codex":0.000386469,"about_ca_system_score_gemma":0.0011307045,"threshold_uncertainty_score":0.017424226},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5295198,0.0030263832,0.44474614,0.0004137082,0.00023386386,0.0002744217,0.00024690467,0.0086946795,0.012844102],"genre_scores_gemma":[0.8299303,0.00024541313,0.16725934,0.00010843008,0.000027258528,0.000103982464,0.00017718434,0.00034786493,0.0018001159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996438,0.00008639832,0.000025981491,0.00005048103,0.000119432254,0.00007397274],"domain_scores_gemma":[0.9993369,0.00021247836,0.00010236502,0.00015494408,0.00013889735,0.000054373217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057733955,0.00057756493,0.00031421948,0.00035047668,0.00033063244,0.00049208757,0.0010273777,0.00026448083,0.0019036261],"category_scores_gemma":[0.0012546076,0.00029528068,0.00034366216,0.0003580782,0.00026569146,0.0007637197,0.00052894425,0.00046886833,0.00037908956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014956885,0.00045015442,0.012503812,0.00061807217,0.00018542132,0.0002680705,0.0002529682,0.4450859,0.1375358,0.011737308,0.008688088,0.38117868],"study_design_scores_gemma":[0.000118156466,0.0003998272,0.0012391281,0.000018844408,0.000045475506,0.0000718122,0.000034316497,0.94656986,0.042792615,0.003203128,0.005488687,0.000018157349],"about_ca_topic_score_codex":0.0011219815,"about_ca_topic_score_gemma":0.0026390236,"teacher_disagreement_score":0.0019036261,"about_ca_system_score_codex":0.00047235118,"about_ca_system_score_gemma":0.0010297564,"threshold_uncertainty_score":0.0063682795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11311388,0.001037423,0.85665005,0.002260677,0.00013485647,0.00012335405,0.00031734386,0.0011595917,0.0252027],"genre_scores_gemma":[0.9423848,0.0006407182,0.049926177,0.0002149603,0.00010843926,0.00020306744,0.00016352258,0.00038098663,0.005977313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998648,0.00036852682,0.00003052869,0.00025144746,0.00039556768,0.00030600818],"domain_scores_gemma":[0.9973907,0.001852345,0.00028693592,0.00017536929,0.00016190573,0.00013282488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016425366,0.0014177563,0.0013101863,0.00053469086,0.0008298896,0.0017361781,0.0015259192,0.0012688199,0.0029482741],"category_scores_gemma":[0.005557362,0.0006821989,0.0006930742,0.00080484326,0.0019721359,0.0026786483,0.0024540923,0.0020709638,0.00024206338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015885638,0.000013628717,0.00007704541,0.000026347416,0.000006326118,0.000034997684,0.000016851638,0.9805793,0.00080021244,0.016394773,0.00036623242,0.0016684404],"study_design_scores_gemma":[0.0000028256302,0.0000052430287,0.000027805298,0.000002788399,0.0000014113155,0.000004099088,0.0000069998737,0.9919342,0.00022022828,0.007590347,0.00020198183,0.0000020867997],"about_ca_topic_score_codex":0.008253955,"about_ca_topic_score_gemma":0.0058572334,"teacher_disagreement_score":0.008253955,"about_ca_system_score_codex":0.0025480192,"about_ca_system_score_gemma":0.0019846908,"threshold_uncertainty_score":0.018487275},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08001994,0.0008265903,0.7156154,0.0053162873,0.0024162396,0.003325669,0.004436979,0.12486322,0.06317968],"genre_scores_gemma":[0.33421806,0.00095792307,0.6140366,0.0032489146,0.0003948856,0.004527077,0.007938906,0.014067616,0.020610005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969433,0.0010451243,0.00017924707,0.0004980365,0.00092611375,0.00040820477],"domain_scores_gemma":[0.9952938,0.0013995904,0.00022004319,0.001655635,0.0008052546,0.0006255923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005647232,0.00084962,0.00074837275,0.0009802814,0.0012164401,0.00223084,0.0031363114,0.0013073258,0.013175497],"category_scores_gemma":[0.0097846985,0.00068353297,0.0010292513,0.00045421676,0.0017901345,0.005973774,0.0041034413,0.004012084,0.0048935097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0051390873,0.0029042354,0.01709179,0.0027904068,0.00058035145,0.0031197993,0.0035525658,0.11716863,0.16007404,0.2088374,0.20874158,0.27000016],"study_design_scores_gemma":[0.00089547696,0.0017321956,0.006586013,0.0005465636,0.00018220392,0.00091228343,0.001045431,0.32020858,0.08748824,0.07348087,0.506414,0.00050819403],"about_ca_topic_score_codex":0.0023599144,"about_ca_topic_score_gemma":0.0027802493,"teacher_disagreement_score":0.013175497,"about_ca_system_score_codex":0.0011707324,"about_ca_system_score_gemma":0.0016627825,"threshold_uncertainty_score":0.044076383},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019969298,0.0001349625,0.9652073,0.0005894012,0.0001015071,0.00009739794,0.00018733041,0.000880351,0.01283249],"genre_scores_gemma":[0.49618313,0.00035344576,0.48862302,0.0006256286,0.00016585083,0.0006004556,0.0005613144,0.0005022045,0.012384928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989122,0.00019172445,0.0001289979,0.00019230382,0.0004068188,0.0001680748],"domain_scores_gemma":[0.9990171,0.00030182517,0.00009213193,0.00022325706,0.0002818635,0.00008369466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010231156,0.0006806675,0.0005223884,0.0008755257,0.0009983139,0.0021825077,0.0013010349,0.0007962943,0.00475395],"category_scores_gemma":[0.0018085007,0.000490511,0.0011413809,0.0007683332,0.0039221006,0.004427163,0.0026352545,0.0018014868,0.0007825258],"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.000022543474,0.000018233122,0.0001609771,0.00005670851,0.000007676683,0.00009563455,0.00027308645,0.00686744,0.002719134,0.9820049,0.0006329177,0.0071407827],"study_design_scores_gemma":[0.00003417713,0.000060487146,0.00014304335,0.00003308397,0.00003338163,0.00015202553,0.00020107177,0.087238334,0.0076106195,0.8783339,0.026131965,0.00002788496],"about_ca_topic_score_codex":0.0020563086,"about_ca_topic_score_gemma":0.0019211958,"teacher_disagreement_score":0.00475395,"about_ca_system_score_codex":0.0012752266,"about_ca_system_score_gemma":0.0016007181,"threshold_uncertainty_score":0.015903533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23063783,0.00093709154,0.7609642,0.00016189589,0.000070751565,0.00020789944,0.00037816068,0.0037782148,0.00286388],"genre_scores_gemma":[0.88031,0.00028918497,0.117767625,0.000033802073,0.000053138887,0.00008934251,0.00036016607,0.00014220337,0.0009545631],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994831,0.000092716575,0.000042245767,0.00013227391,0.00018480969,0.00006476396],"domain_scores_gemma":[0.99488044,0.002495087,0.0012490412,0.0004095942,0.00077496393,0.00019087449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060135114,0.00079288695,0.00061243057,0.0022779168,0.00048050578,0.0006635149,0.0006380514,0.0003285774,0.0013342428],"category_scores_gemma":[0.004877824,0.0003232774,0.00035772606,0.0011087265,0.00036017588,0.0011428044,0.0005152173,0.00059082865,0.0004977021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001961886,0.00034689438,0.094657734,0.00068240974,0.00015743876,0.00037046443,0.0005877334,0.18179776,0.07294775,0.0051256786,0.0027759848,0.6385883],"study_design_scores_gemma":[0.00003890598,0.00030159883,0.016777653,0.000053179996,0.000070651615,0.00041710358,0.00013736737,0.92914104,0.046770513,0.0034437757,0.0027825914,0.00006565663],"about_ca_topic_score_codex":0.0026636727,"about_ca_topic_score_gemma":0.003763191,"teacher_disagreement_score":0.0026636727,"about_ca_system_score_codex":0.0003537381,"about_ca_system_score_gemma":0.0009422114,"threshold_uncertainty_score":0.0052963495},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038774107,0.0023776845,0.05494247,0.0049100374,0.0042840033,0.00053396134,0.011815075,0.043757122,0.87350225],"genre_scores_gemma":[0.040181816,0.00288556,0.049302537,0.0040247054,0.0009173912,0.0007479803,0.032956526,0.012350206,0.8566332],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983152,0.00017786268,0.000112746944,0.00044169292,0.0007046251,0.00024787904],"domain_scores_gemma":[0.99723935,0.0002861718,0.00013057406,0.0009918845,0.00091398385,0.00043813148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013358925,0.001325896,0.0009149933,0.0019851234,0.0017510301,0.0057719275,0.002996136,0.0021997467,0.4008659],"category_scores_gemma":[0.004355321,0.00077165524,0.0010294528,0.0017241833,0.0008076106,0.003968636,0.005112082,0.0022483456,0.3310575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043079356,0.00014183686,0.0013540108,0.0006243995,0.00004561572,0.00039626542,0.00020217478,0.00093143835,0.00724568,0.03891506,0.6823449,0.2673678],"study_design_scores_gemma":[0.000043928594,0.000026616512,0.00042488976,0.00008626695,0.0000099991885,0.00022228042,0.000044248653,0.001456672,0.0016602142,0.003953667,0.992054,0.000017309192],"about_ca_topic_score_codex":0.005334558,"about_ca_topic_score_gemma":0.0064978884,"teacher_disagreement_score":0.4008659,"about_ca_system_score_codex":0.0017510569,"about_ca_system_score_gemma":0.002850948,"threshold_uncertainty_score":0},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00097634207,0.00022619852,0.06667412,0.0003091098,0.00037564005,0.00011040975,0.020958489,0.89278275,0.017587008],"genre_scores_gemma":[0.01700989,0.0004089668,0.06072108,0.00065115804,0.00012832887,0.00058498495,0.04824382,0.83875227,0.033499587],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981212,0.00028826774,0.00012854674,0.00039475807,0.00073839055,0.00032888385],"domain_scores_gemma":[0.9966899,0.0007466687,0.00016834424,0.001147586,0.0009174562,0.00032999425],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0030096222,0.0032926726,0.0026134343,0.0019381773,0.0011784991,0.0047094184,0.007437597,0.002846286,0.33274865],"category_scores_gemma":[0.010186159,0.0032585782,0.0030528929,0.0015106479,0.0014373543,0.0050577493,0.004722982,0.0062338044,0.36819458],"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.0008417015,0.00010946468,0.0012901868,0.0010135648,0.0001218347,0.00016376523,0.00029611553,0.0016727768,0.0044665807,0.011427948,0.93026316,0.048332896],"study_design_scores_gemma":[0.00043049327,0.00009104208,0.0020630509,0.00038348412,0.00006886834,0.0003493015,0.0000868462,0.014408076,0.029565584,0.019303419,0.9329964,0.00025339006],"about_ca_topic_score_codex":0.004630852,"about_ca_topic_score_gemma":0.0025708266,"teacher_disagreement_score":0.33274865,"about_ca_system_score_codex":0.0023172782,"about_ca_system_score_gemma":0.0027818177,"threshold_uncertainty_score":0.9517531},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7331834,0.0063074436,0.22106323,0.001276713,0.0007137519,0.00020949906,0.0012184862,0.009411095,0.026616365],"genre_scores_gemma":[0.91201746,0.00074691215,0.079597235,0.0003850506,0.000092553884,0.00013926126,0.0011032879,0.000503439,0.005414844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994567,0.00011276461,0.0000331744,0.000060054583,0.00023899536,0.00009833412],"domain_scores_gemma":[0.9987991,0.00033618396,0.00006184531,0.00041886306,0.0003350016,0.000049024926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004394561,0.00036173366,0.0004938469,0.00080810016,0.00061546953,0.0010814231,0.0012517906,0.0005484283,0.002398501],"category_scores_gemma":[0.003721861,0.0002757096,0.00025428727,0.0022966014,0.00043638019,0.0012522212,0.0008166957,0.00075307785,0.0005157249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024691056,0.00042998174,0.013251552,0.00042269708,0.0002320062,0.00078653713,0.0005276256,0.25301003,0.043125555,0.042839408,0.03851679,0.6043887],"study_design_scores_gemma":[0.00012318535,0.00028197787,0.004003273,0.00006169082,0.00008595633,0.0003484809,0.00024153235,0.9122533,0.050054673,0.019173877,0.013319076,0.000053085958],"about_ca_topic_score_codex":0.0038856098,"about_ca_topic_score_gemma":0.008575844,"teacher_disagreement_score":0.0038856098,"about_ca_system_score_codex":0.00062289153,"about_ca_system_score_gemma":0.0012246228,"threshold_uncertainty_score":0.008023739},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120787844,0.0025223335,0.8154316,0.0007211443,0.00069665216,0.00027172442,0.0007674323,0.015402213,0.043399025],"genre_scores_gemma":[0.5869913,0.0008803348,0.38569626,0.0005812378,0.0002019075,0.00023704185,0.0016852934,0.0002688268,0.023457894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998605,0.000015829624,0.000009909819,0.000028386326,0.000055084252,0.000030236577],"domain_scores_gemma":[0.9998286,0.000027837088,0.000014291583,0.000034745397,0.000066644934,0.000027839316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001856517,0.0005750552,0.00043594258,0.0005521396,0.00044336973,0.000592265,0.0013710075,0.00043142788,0.009769008],"category_scores_gemma":[0.0003628188,0.000257538,0.00036092347,0.0009447892,0.00021831552,0.0009345983,0.00065155415,0.0008017191,0.003124602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013975557,0.0006631173,0.0038144886,0.0007391899,0.00017705385,0.0010712005,0.0003684533,0.04093227,0.31028584,0.07214067,0.072976075,0.4954341],"study_design_scores_gemma":[0.0003437139,0.0019714118,0.0025485652,0.000120656194,0.00017646603,0.0012470149,0.00009207532,0.7124232,0.13072802,0.028009513,0.122173175,0.00016621647],"about_ca_topic_score_codex":0.0010800111,"about_ca_topic_score_gemma":0.0020330322,"teacher_disagreement_score":0.009769008,"about_ca_system_score_codex":0.00055705645,"about_ca_system_score_gemma":0.0010163423,"threshold_uncertainty_score":0.03268051},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1126959,0.0056486903,0.68220425,0.013951848,0.0020567046,0.0011463093,0.0007890596,0.035197478,0.14630969],"genre_scores_gemma":[0.46094945,0.0053004455,0.49713987,0.0026805114,0.00038714832,0.000432205,0.0021286195,0.0035647259,0.027416978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986533,0.0002068614,0.00008623291,0.00021995684,0.00037051176,0.0004632002],"domain_scores_gemma":[0.99872667,0.00010249635,0.0000467011,0.00045199064,0.00019185545,0.0004803406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018797608,0.0006032717,0.00057380827,0.00088620296,0.0018843926,0.0040323515,0.0021948614,0.0014429614,0.005340664],"category_scores_gemma":[0.0025604616,0.000882825,0.0011273082,0.00092808815,0.0011641047,0.00793861,0.0075982967,0.0030098855,0.0036632752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005489382,0.000493031,0.010266593,0.000653843,0.00021220172,0.0036335282,0.0015242787,0.04934216,0.027159534,0.45186266,0.10827871,0.3460245],"study_design_scores_gemma":[0.0001417607,0.0002689523,0.0035433096,0.000568111,0.00011117315,0.0017193409,0.0013623616,0.17010324,0.013219156,0.13670513,0.6720665,0.00019087798],"about_ca_topic_score_codex":0.0052571828,"about_ca_topic_score_gemma":0.006422702,"teacher_disagreement_score":0.005340664,"about_ca_system_score_codex":0.0012061346,"about_ca_system_score_gemma":0.0020767308,"threshold_uncertainty_score":0.017866313},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1998073,0.017521845,0.69329715,0.004300766,0.0012221617,0.00031131596,0.00037612376,0.0033629548,0.079800345],"genre_scores_gemma":[0.8209959,0.0030826654,0.1586968,0.00069555215,0.0005334634,0.00012052226,0.00036509865,0.00040814382,0.015101741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995043,0.000111063055,0.000017021468,0.00008368741,0.00019346608,0.000090427806],"domain_scores_gemma":[0.99900466,0.00022236288,0.0000776169,0.00036951096,0.0002449879,0.00008083213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013022814,0.0009429348,0.00048563472,0.00057263114,0.00063809915,0.0010456803,0.00269456,0.00069438387,0.0063695274],"category_scores_gemma":[0.0018861244,0.00020571651,0.0003555998,0.0006307422,0.0006131548,0.002516835,0.001383763,0.0008384263,0.0011562901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000497853,0.00042598875,0.0018134251,0.0006125554,0.00013303975,0.00037072893,0.0005071213,0.095158644,0.07245268,0.13078807,0.024959091,0.67228085],"study_design_scores_gemma":[0.00010304212,0.0014615137,0.0011618126,0.00019962437,0.00018997044,0.00075038767,0.00038068672,0.7318742,0.08127217,0.0763514,0.106182404,0.0000727642],"about_ca_topic_score_codex":0.00044172342,"about_ca_topic_score_gemma":0.0009159824,"teacher_disagreement_score":0.0063695274,"about_ca_system_score_codex":0.00042451415,"about_ca_system_score_gemma":0.0007039486,"threshold_uncertainty_score":0.021308184},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15423231,0.0033157847,0.7104531,0.0053052558,0.00023002569,0.0001483422,0.00042894162,0.0005900074,0.1252963],"genre_scores_gemma":[0.9530576,0.0012149321,0.023332214,0.00040109947,0.00009099056,0.00012034616,0.00008868582,0.00015128742,0.021542797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997029,0.00008524993,0.000007863968,0.000033338056,0.00007920081,0.000091426075],"domain_scores_gemma":[0.99906737,0.0005357667,0.00008898065,0.000097771794,0.00013775693,0.00007235917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079108815,0.0005662973,0.00060801447,0.0006162102,0.00054227514,0.0012192538,0.0017797446,0.0013334126,0.0073226364],"category_scores_gemma":[0.0035921207,0.0004239712,0.0005001361,0.0005920544,0.0012773199,0.0027053324,0.0012597614,0.001158489,0.0006479841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005059033,0.000057403602,0.00053484744,0.000089344816,0.00001733861,0.00012755491,0.00012872685,0.773592,0.0019340267,0.21465458,0.002511575,0.006302022],"study_design_scores_gemma":[0.0000047981075,0.0000063523325,0.00006737167,0.000006408453,0.000002581428,0.000011660574,0.000023362118,0.96712875,0.00010857077,0.032030046,0.00060597825,0.0000041403077],"about_ca_topic_score_codex":0.0048685004,"about_ca_topic_score_gemma":0.0042573675,"teacher_disagreement_score":0.0073226364,"about_ca_system_score_codex":0.0012128361,"about_ca_system_score_gemma":0.0009963395,"threshold_uncertainty_score":0.024496675},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79043007,0.002926678,0.14776425,0.00055307715,0.00040904866,0.00021739509,0.00052715855,0.043934997,0.0132374],"genre_scores_gemma":[0.88645923,0.00035456737,0.10526486,0.00013595386,0.0000445392,0.00010572286,0.0010374966,0.0031492733,0.0034483331],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99754995,0.0003203938,0.00012550749,0.00041270428,0.0010560978,0.000535338],"domain_scores_gemma":[0.9959454,0.0011150234,0.00020419066,0.0012843636,0.0012493554,0.00020172057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018597427,0.0012569586,0.00084912224,0.0011089626,0.0012450153,0.0017087808,0.0025141167,0.0006343715,0.0016203746],"category_scores_gemma":[0.007028422,0.00058263086,0.0007665539,0.0017049594,0.0006649164,0.0026186348,0.0012484143,0.0021463037,0.00080717314],"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.002030036,0.00094066345,0.027018227,0.00061474624,0.00033223454,0.00057841226,0.0011645247,0.13096862,0.34058663,0.0069187055,0.024548681,0.4642985],"study_design_scores_gemma":[0.00024846592,0.00084475556,0.013003608,0.00008257919,0.00020782769,0.00022821313,0.0002662774,0.5828053,0.3747343,0.002465307,0.02493547,0.00017787416],"about_ca_topic_score_codex":0.0115557965,"about_ca_topic_score_gemma":0.012614285,"teacher_disagreement_score":0.0115557965,"about_ca_system_score_codex":0.0014474412,"about_ca_system_score_gemma":0.0040402357,"threshold_uncertainty_score":0.022977054},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78874767,0.0016490782,0.20441872,0.00021258114,0.000113561015,0.000039153147,0.000054211843,0.0013127063,0.0034523928],"genre_scores_gemma":[0.9866816,0.00012677228,0.012186946,0.000052126223,0.000027451933,0.000014397886,0.00003815935,0.000041695526,0.0008308267],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996909,0.000034307915,0.000024649633,0.00006324276,0.00013431873,0.000052652475],"domain_scores_gemma":[0.999151,0.00026099142,0.00014410292,0.00020507186,0.00018854794,0.000050259245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026050367,0.00032195944,0.00040026734,0.0003791837,0.000527399,0.0004504886,0.0011300311,0.00026823644,0.000641237],"category_scores_gemma":[0.001173151,0.00013629862,0.00023483516,0.00042515525,0.0002541477,0.00097255636,0.0005273525,0.0003899063,0.00016427753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007028063,0.0003805915,0.008953336,0.00019781975,0.000111962756,0.00045777945,0.0005834526,0.09487813,0.64990073,0.0054119993,0.0024094188,0.23601207],"study_design_scores_gemma":[0.000045994577,0.0012373962,0.0040784376,0.000029749337,0.00013893386,0.0013526309,0.00030800287,0.5652243,0.41702232,0.0036747395,0.00683172,0.00005568434],"about_ca_topic_score_codex":0.00049954146,"about_ca_topic_score_gemma":0.0017405619,"teacher_disagreement_score":0.0011300311,"about_ca_system_score_codex":0.00034834465,"about_ca_system_score_gemma":0.00043723127,"threshold_uncertainty_score":0.0025274158},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07719432,0.0033404648,0.70989895,0.0012118593,0.001791902,0.0006411613,0.002102295,0.031717863,0.17210117],"genre_scores_gemma":[0.4540347,0.0013680701,0.44872287,0.0024447616,0.00035201525,0.00038910023,0.004751576,0.003874367,0.08406247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996649,0.00001869222,0.000011603852,0.0000660044,0.0001328814,0.00010602921],"domain_scores_gemma":[0.99963605,0.000034511122,0.000026012876,0.00016242659,0.00009178765,0.00004925697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020182015,0.00059157755,0.00037272632,0.00035192037,0.00031540383,0.00093165325,0.0014314334,0.00042201095,0.0149479415],"category_scores_gemma":[0.00068582396,0.00024402377,0.00032570277,0.0005258321,0.00045269783,0.0012462242,0.0015990501,0.0008646865,0.0035579554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001039004,0.000315246,0.0040609427,0.00078470184,0.00007262654,0.00044042428,0.00023636382,0.041245557,0.12062587,0.09039971,0.113219425,0.62756014],"study_design_scores_gemma":[0.0001610701,0.00067456224,0.0024985203,0.00007975556,0.00008636883,0.00071959646,0.00007937812,0.15105274,0.07390472,0.033012994,0.7376354,0.000094938056],"about_ca_topic_score_codex":0.0021720892,"about_ca_topic_score_gemma":0.0047045755,"teacher_disagreement_score":0.0149479415,"about_ca_system_score_codex":0.00057243527,"about_ca_system_score_gemma":0.0012267178,"threshold_uncertainty_score":0},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05399304,0.0008631194,0.8387038,0.002364682,0.0010778389,0.0025385963,0.0006820424,0.013608968,0.08616787],"genre_scores_gemma":[0.35000005,0.0013124737,0.6022974,0.0011723705,0.00064495724,0.0019399547,0.0028442808,0.0010180011,0.038770463],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99461234,0.0011538253,0.0005678623,0.0003059866,0.002956556,0.00040345304],"domain_scores_gemma":[0.9913038,0.0009342016,0.0003221035,0.0026842116,0.004504987,0.00025073177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047987225,0.0005187767,0.0004793406,0.0010461236,0.0009459786,0.0015375247,0.0028700926,0.0008970756,0.0051772096],"category_scores_gemma":[0.014684013,0.00047728364,0.0005171746,0.0015632422,0.00075446354,0.0041590747,0.0025042181,0.002887109,0.001478069],"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.0010957014,0.0007406491,0.0033329863,0.0005420883,0.00010188263,0.0010761078,0.0014981441,0.029419878,0.06350889,0.3201355,0.07499411,0.50355405],"study_design_scores_gemma":[0.0004578055,0.0012214364,0.0018425464,0.00019186182,0.00016414287,0.0014469858,0.00036373403,0.31444985,0.07858038,0.052198436,0.5488197,0.00026304455],"about_ca_topic_score_codex":0.004272397,"about_ca_topic_score_gemma":0.004898119,"teacher_disagreement_score":0.0051772096,"about_ca_system_score_codex":0.0012577862,"about_ca_system_score_gemma":0.0034785133,"threshold_uncertainty_score":0.025378406},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43996432,0.00038334442,0.5517216,0.000083272345,0.000024551748,0.00007758972,0.0001481968,0.0063325376,0.0012646646],"genre_scores_gemma":[0.9064425,0.00011095429,0.092371196,0.000018611578,0.000004983474,0.000026588557,0.000156618,0.0001877091,0.0006808731],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99965966,0.000052235817,0.000016422313,0.0000806962,0.00015833807,0.00003255941],"domain_scores_gemma":[0.9988011,0.00037593182,0.0002789357,0.00038164694,0.0001264034,0.00003587644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026599813,0.0005269184,0.0002925592,0.0008081286,0.00023967681,0.00031929216,0.0005321522,0.00025591833,0.0004919197],"category_scores_gemma":[0.0019970054,0.00021659899,0.00021411752,0.0005088836,0.0003138279,0.0006234676,0.00034933968,0.0004951894,0.0001517208],"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.00049772125,0.00027468093,0.029476343,0.0003022156,0.00008638803,0.0004657905,0.00047828883,0.16267322,0.23505206,0.0027794065,0.0011776416,0.5667363],"study_design_scores_gemma":[0.000009199043,0.00015914794,0.011498898,0.000014737129,0.000018985174,0.0003078935,0.000051440675,0.8578326,0.12650722,0.0021370028,0.0014442243,0.00001856021],"about_ca_topic_score_codex":0.0016578623,"about_ca_topic_score_gemma":0.0025613704,"teacher_disagreement_score":0.0016578623,"about_ca_system_score_codex":0.00026330331,"about_ca_system_score_gemma":0.00045463193,"threshold_uncertainty_score":0.0032963753},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3531566,0.0009864302,0.6163503,0.00047074407,0.0002196031,0.00018065627,0.0001701025,0.0039010611,0.024564553],"genre_scores_gemma":[0.86774564,0.0002269032,0.12684561,0.000117795345,0.000048345144,0.000052807492,0.000106401865,0.00013066242,0.0047259405],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99988866,0.000016850861,0.000008035995,0.000014133099,0.00005112905,0.000021186714],"domain_scores_gemma":[0.999746,0.000084504696,0.000061008126,0.000034378983,0.00005555542,0.000018527791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011396393,0.0002801971,0.00013722674,0.0002942061,0.00028176905,0.0007002799,0.0006310269,0.00017176813,0.0037486334],"category_scores_gemma":[0.00063148263,0.00013879008,0.00012182256,0.0003993484,0.00017185824,0.00052310387,0.00018070595,0.00042815495,0.0004231286],"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.0005783414,0.00030724268,0.0026232898,0.00042825195,0.000056138622,0.00035748957,0.00024233217,0.116079785,0.34010378,0.12726161,0.01066205,0.40129966],"study_design_scores_gemma":[0.00016187645,0.0009341983,0.002225276,0.000057241698,0.00007738629,0.00030697463,0.00012650632,0.7123982,0.2244515,0.02829889,0.030919507,0.00004253209],"about_ca_topic_score_codex":0.0017713155,"about_ca_topic_score_gemma":0.006281589,"teacher_disagreement_score":0.0037486334,"about_ca_system_score_codex":0.0010094292,"about_ca_system_score_gemma":0.0009507363,"threshold_uncertainty_score":0.0125404},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016417127,0.0046274033,0.96126765,0.00065599114,0.00018541624,0.00009910882,0.00008313976,0.00078543165,0.015878715],"genre_scores_gemma":[0.4137506,0.00786338,0.5565214,0.0008498032,0.00021264641,0.0002842697,0.00022190058,0.0004959246,0.01980011],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977785,0.000026956732,0.00001532646,0.000033970107,0.0001236289,0.000022271068],"domain_scores_gemma":[0.9997547,0.000055479028,0.000045264813,0.000037257618,0.00009506992,0.000012198926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023841302,0.00045449784,0.00035528583,0.00046242346,0.00036756712,0.0008141339,0.0010225577,0.00054565904,0.003358833],"category_scores_gemma":[0.0006453078,0.00028139562,0.00032799746,0.000477534,0.00028022382,0.001254021,0.000501657,0.0008821754,0.0012483051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017660641,0.00012601634,0.0011131807,0.0011463545,0.000111785026,0.00038917217,0.00041122962,0.09362309,0.3538743,0.17381643,0.013799865,0.3614119],"study_design_scores_gemma":[0.00007738479,0.0005859938,0.0010156987,0.0003630389,0.00016397932,0.0017664257,0.00015628253,0.57081157,0.15654719,0.108529925,0.15989503,0.000087525215],"about_ca_topic_score_codex":0.000489125,"about_ca_topic_score_gemma":0.001343497,"teacher_disagreement_score":0.003358833,"about_ca_system_score_codex":0.0006553271,"about_ca_system_score_gemma":0.0006810546,"threshold_uncertainty_score":0.011236429},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002847922,0.9290757,0.04893391,0.0012755889,0.00092321745,0.000070188784,0.00029471944,0.000990276,0.0155884735],"genre_scores_gemma":[0.021018917,0.9330532,0.03476341,0.000917461,0.0015033687,0.0001233012,0.0014640768,0.00039517955,0.006761145],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915504,0.00014844292,0.00008004673,0.00017949044,0.0003710891,0.00006581558],"domain_scores_gemma":[0.99811137,0.0011671813,0.000100470264,0.00014410159,0.00043154132,0.000045402598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009925966,0.0013653934,0.0012837193,0.0024974071,0.00032376507,0.0013538284,0.0016949904,0.0009622405,0.0069719087],"category_scores_gemma":[0.003958856,0.00064813043,0.0010493582,0.0047905226,0.00040139968,0.002587342,0.0008101614,0.0013316935,0.0042470284],"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.00004706052,0.000070442096,0.00078583724,0.006264987,0.00007707123,0.000064064894,0.000050694875,0.0072047617,0.0010936887,0.008306145,0.029784068,0.9462511],"study_design_scores_gemma":[0.000032424214,0.00024200999,0.0021585922,0.0050182547,0.00022528811,0.0007631545,0.0001264141,0.03040833,0.005306178,0.021369608,0.9342517,0.000098054115],"about_ca_topic_score_codex":0.0013198233,"about_ca_topic_score_gemma":0.0013416295,"teacher_disagreement_score":0.0069719087,"about_ca_system_score_codex":0.0005045576,"about_ca_system_score_gemma":0.0014285226,"threshold_uncertainty_score":0.023323298},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14941177,0.0029477458,0.6215742,0.0010217427,0.0023951433,0.00036447778,0.0016597651,0.20012856,0.020496542],"genre_scores_gemma":[0.36584952,0.000640498,0.57008034,0.0007871816,0.00036956952,0.00037040305,0.0043691294,0.02573772,0.031795643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876726,0.000257558,0.00009755208,0.00015929261,0.00047451272,0.00024397922],"domain_scores_gemma":[0.9975715,0.00092695374,0.00019108587,0.0005518943,0.0005495377,0.0002090135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012832107,0.0013549152,0.0007806646,0.00083153736,0.0006764135,0.0013460809,0.0028875347,0.000856322,0.009528617],"category_scores_gemma":[0.0036540248,0.0009709136,0.00085105735,0.00076484284,0.00065022724,0.0032145267,0.0017925305,0.002029112,0.0034456046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038643596,0.0010839419,0.0053931926,0.0008657625,0.00028488957,0.0007053587,0.000638558,0.07559586,0.14637424,0.023607077,0.20193714,0.53964967],"study_design_scores_gemma":[0.0012994226,0.0012610967,0.0025095025,0.00011060259,0.0002657797,0.0004022369,0.00018033342,0.73176616,0.15249379,0.017471366,0.09205685,0.00018282753],"about_ca_topic_score_codex":0.0018772199,"about_ca_topic_score_gemma":0.005185655,"teacher_disagreement_score":0.009528617,"about_ca_system_score_codex":0.0004911864,"about_ca_system_score_gemma":0.0027179362,"threshold_uncertainty_score":0.031876385},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07722217,0.008195107,0.48690507,0.008065376,0.004144204,0.00048089243,0.003559349,0.033194005,0.37823385],"genre_scores_gemma":[0.7596149,0.0034406993,0.16518344,0.0023420698,0.00085982383,0.000691193,0.004834916,0.015531964,0.047501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99415874,0.0009374181,0.00018507587,0.00077889056,0.003191116,0.00074871356],"domain_scores_gemma":[0.9914937,0.0019276105,0.00029420413,0.0025153502,0.0033709155,0.00039824174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043152818,0.0011751982,0.000891734,0.0013447981,0.00090221106,0.004384944,0.0020108386,0.0012096053,0.016464213],"category_scores_gemma":[0.014335413,0.0008810871,0.0007898648,0.0017436849,0.0009658916,0.004359937,0.0031829432,0.0034615349,0.008924031],"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.0008351997,0.00045295208,0.0037433302,0.00096753764,0.00016613606,0.00020209774,0.0005160655,0.14179388,0.07565561,0.36877924,0.12235301,0.28453502],"study_design_scores_gemma":[0.00017253362,0.00053703226,0.003411551,0.00032783745,0.000112672744,0.00037051868,0.0002514876,0.35688266,0.13619721,0.17796618,0.3235309,0.00023940857],"about_ca_topic_score_codex":0.0012833873,"about_ca_topic_score_gemma":0.0012747693,"teacher_disagreement_score":0.016464213,"about_ca_system_score_codex":0.0022541818,"about_ca_system_score_gemma":0.0037351577,"threshold_uncertainty_score":0.055078268},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79968345,0.00093238906,0.1254427,0.0030823336,0.00046392131,0.0004567095,0.0005920386,0.0034022275,0.06594427],"genre_scores_gemma":[0.84292245,0.00041019093,0.13574173,0.00049245777,0.00007443979,0.0003139162,0.00055169355,0.0007382581,0.018754873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987233,0.00037344638,0.00005272778,0.00017707476,0.00040551028,0.00026790658],"domain_scores_gemma":[0.99713457,0.0011420504,0.00017950284,0.0006965845,0.00041970678,0.00042759307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014849189,0.0005009063,0.00030530294,0.00035527718,0.0013180916,0.0013271866,0.0017662536,0.0013783212,0.0025715441],"category_scores_gemma":[0.003899632,0.00030450238,0.00057592045,0.0006454671,0.0013835569,0.0014344328,0.0013402726,0.0016966825,0.00090210873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020275223,0.0028530613,0.05479833,0.0011537401,0.00024237354,0.012267798,0.0066765463,0.39412993,0.0925525,0.17121612,0.053561755,0.20852034],"study_design_scores_gemma":[0.00041654689,0.0023047975,0.019172318,0.00018564898,0.00015100873,0.003889296,0.0023543653,0.640783,0.04833583,0.03305788,0.24916236,0.00018688284],"about_ca_topic_score_codex":0.007884491,"about_ca_topic_score_gemma":0.012274749,"teacher_disagreement_score":0.007884491,"about_ca_system_score_codex":0.001031138,"about_ca_system_score_gemma":0.0012340889,"threshold_uncertainty_score":0.015677214},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007750106,0.00026205284,0.9827003,0.00008598788,0.0000680762,0.00010458214,0.00015898795,0.0038017703,0.0050680507],"genre_scores_gemma":[0.24372543,0.00029530478,0.7489361,0.00011096723,0.000051253824,0.00042815946,0.00047329336,0.0002860139,0.0056934357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980897,0.000053206502,0.00001641703,0.00003131651,0.00007104501,0.000019044652],"domain_scores_gemma":[0.99975127,0.000115634764,0.000020084653,0.00006608518,0.000037723858,0.000009063713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003400521,0.00044445597,0.0002950128,0.00033025662,0.00024906648,0.00060310034,0.0005994513,0.00042175155,0.008479688],"category_scores_gemma":[0.0007314274,0.0002830372,0.000472991,0.00026881913,0.00030470217,0.00060693873,0.00031659444,0.0008431756,0.0021372295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004945892,0.00022235395,0.0008817456,0.0006101421,0.000095109455,0.00024228843,0.00013901808,0.25924218,0.17561634,0.17733192,0.007995546,0.37712878],"study_design_scores_gemma":[0.0000858167,0.00033017818,0.00031252892,0.00007239618,0.000057204583,0.00008974792,0.0000111899235,0.85228425,0.0668652,0.034110006,0.045755282,0.000026163683],"about_ca_topic_score_codex":0.00096875045,"about_ca_topic_score_gemma":0.001863533,"teacher_disagreement_score":0.008479688,"about_ca_system_score_codex":0.00042568025,"about_ca_system_score_gemma":0.0008683847,"threshold_uncertainty_score":0.0283674},"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":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007874209,0.07661824,0.36483544,0.03885555,0.33539337,0.0008775426,0.0022564118,0.006343986,0.16694526],"genre_scores_gemma":[0.05394142,0.06870042,0.1423335,0.007857436,0.0694239,0.0009387475,0.006090671,0.002894556,0.6478193],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984688,0.00025106335,0.00011244374,0.000283484,0.0007381534,0.00014588497],"domain_scores_gemma":[0.99602294,0.0005391796,0.00010543981,0.0004266474,0.0022053446,0.00070036825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024223076,0.0016090362,0.0023341887,0.0016425858,0.0017073936,0.0054945615,0.0014843153,0.0025067744,0.064644694],"category_scores_gemma":[0.003434438,0.00059042533,0.0010814221,0.0024246962,0.0008413987,0.0031897952,0.0020093827,0.004749611,0.028811753],"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.0003104092,0.00011982776,0.00025005636,0.00036222898,0.000044020457,0.00009510885,0.000042526262,0.001285058,0.0035006616,0.009211103,0.7057222,0.27905685],"study_design_scores_gemma":[0.00007098176,0.00022814548,0.00077380537,0.0003533908,0.00007543866,0.00032219573,0.0000755215,0.016015487,0.0035021328,0.0123187285,0.96621877,0.000045416364],"about_ca_topic_score_codex":0.0029352407,"about_ca_topic_score_gemma":0.0037640186,"teacher_disagreement_score":0.064644694,"about_ca_system_score_codex":0.00086152507,"about_ca_system_score_gemma":0.0024596762,"threshold_uncertainty_score":0.21625805},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9171581,0.00067363685,0.06875727,0.00028085808,0.00011597965,0.00011445979,0.00028205334,0.0021075096,0.0105099995],"genre_scores_gemma":[0.925095,0.0003280797,0.072282195,0.000028559605,0.000029053987,0.00008050604,0.0005970398,0.000105015686,0.0014545439],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989318,0.00027081207,0.000102271035,0.0001252739,0.00045484558,0.00011484723],"domain_scores_gemma":[0.9977703,0.001038115,0.00018333171,0.00026704918,0.00063870655,0.000102567574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012043678,0.0004644629,0.000508936,0.0008574271,0.00045623025,0.00069192983,0.0005826601,0.000500908,0.0013419285],"category_scores_gemma":[0.0040116725,0.00018886822,0.00039698975,0.0016948881,0.0003099015,0.00086911686,0.0003703377,0.00044728967,0.00031614833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021982712,0.0011287993,0.044198647,0.0011543095,0.00041808173,0.0006515135,0.00075898814,0.5203693,0.14070466,0.0071424437,0.0058905752,0.2753845],"study_design_scores_gemma":[0.00007035144,0.0009787256,0.016256044,0.000027163227,0.00007390846,0.0001462722,0.00021157919,0.8862253,0.09177992,0.0015462277,0.0026455661,0.000039021077],"about_ca_topic_score_codex":0.002557633,"about_ca_topic_score_gemma":0.0014983382,"teacher_disagreement_score":0.002557633,"about_ca_system_score_codex":0.00040114342,"about_ca_system_score_gemma":0.0006136377,"threshold_uncertainty_score":0.006369412},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8919763,0.0022856398,0.078799844,0.00027973842,0.00021079586,0.00007684066,0.00025516492,0.0036759821,0.022439772],"genre_scores_gemma":[0.9609185,0.00035882642,0.034986455,0.0000878079,0.000022142935,0.000030331483,0.00015003557,0.000083485225,0.00336245],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99991226,0.000012197265,0.000005155956,0.000012145404,0.000033743505,0.000024470644],"domain_scores_gemma":[0.99982905,0.00004627323,0.00003371085,0.00003568762,0.0000419929,0.000013251031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012426553,0.0002521771,0.00017969958,0.000234329,0.00011496175,0.00032411836,0.0007019694,0.00020235815,0.0023055573],"category_scores_gemma":[0.00043447164,0.000117047406,0.0001543366,0.00021104055,0.00010929097,0.0007055148,0.00025014693,0.00017019131,0.00056171964],"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.0008147206,0.00031080804,0.0048556235,0.00076035573,0.00011408707,0.00083360664,0.00017452335,0.09866058,0.6946908,0.010499305,0.006627496,0.18165801],"study_design_scores_gemma":[0.00021040156,0.0034341477,0.006305901,0.0001049399,0.00020285361,0.0010559711,0.00013839747,0.3164145,0.6124496,0.003137874,0.05647197,0.000073500945],"about_ca_topic_score_codex":0.0004939547,"about_ca_topic_score_gemma":0.0015512133,"teacher_disagreement_score":0.0023055573,"about_ca_system_score_codex":0.00023548133,"about_ca_system_score_gemma":0.00018539006,"threshold_uncertainty_score":0.0077129006},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032214925,0.00020298752,0.95461994,0.00017206557,0.00005934428,0.00011950912,0.000114225135,0.008117251,0.004379735],"genre_scores_gemma":[0.2437864,0.00020570941,0.7494114,0.000117325,0.000052671825,0.00021108432,0.00068454485,0.0012454509,0.0042853723],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991442,0.00015220429,0.000044312143,0.0001817952,0.0003966068,0.00008085298],"domain_scores_gemma":[0.99887925,0.00023639102,0.000104152256,0.0003873289,0.00036959973,0.000023265366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003700095,0.0006585311,0.00044584784,0.0007652722,0.00056812924,0.0006487145,0.0007751767,0.00031660259,0.0028363895],"category_scores_gemma":[0.0019246506,0.00028385333,0.00046477493,0.0007284811,0.0005036065,0.0008116354,0.0006505775,0.0010076886,0.0015188125],"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.0001969061,0.00015435909,0.0019433287,0.0003106276,0.000053594224,0.00013877309,0.0002846312,0.0557177,0.23755231,0.024544632,0.0069288383,0.6721742],"study_design_scores_gemma":[0.000065006985,0.00025955646,0.0026472614,0.000043173764,0.00003434283,0.00023673468,0.00006991313,0.6534551,0.29341263,0.018016748,0.031718627,0.000040886625],"about_ca_topic_score_codex":0.0014800627,"about_ca_topic_score_gemma":0.0017056868,"teacher_disagreement_score":0.0028363895,"about_ca_system_score_codex":0.00052843406,"about_ca_system_score_gemma":0.0014353901,"threshold_uncertainty_score":0.009488642},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030989368,0.00074526947,0.23200884,0.00076314464,0.0006097732,0.0003152424,0.034811717,0.6812384,0.046408724],"genre_scores_gemma":[0.051744837,0.001322213,0.24190362,0.0018267405,0.0006099373,0.0011801687,0.14657779,0.47843087,0.07640381],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99698454,0.00042399098,0.00036738004,0.00045366312,0.0013949354,0.00037550658],"domain_scores_gemma":[0.99609935,0.0006078058,0.00022764804,0.001234368,0.0015347329,0.00029600062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029313136,0.0022455426,0.0012583948,0.002020094,0.0011580334,0.0037445044,0.0045845364,0.0021136375,0.09799854],"category_scores_gemma":[0.008428924,0.0020780843,0.0012174845,0.0025183656,0.0009212936,0.0050166636,0.0027237958,0.0051099635,0.15586667],"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.00047096654,0.00009485841,0.0005904873,0.00052159495,0.000049302842,0.000078906174,0.00013827797,0.0023667903,0.006369553,0.01872471,0.90062666,0.06996783],"study_design_scores_gemma":[0.0003318284,0.000078468984,0.0007976469,0.00020269761,0.00004280761,0.0002527848,0.000046900233,0.019680465,0.037251554,0.026487846,0.9146508,0.00017619593],"about_ca_topic_score_codex":0.004010261,"about_ca_topic_score_gemma":0.003003843,"teacher_disagreement_score":0.09799854,"about_ca_system_score_codex":0.0015002042,"about_ca_system_score_gemma":0.0023980662,"threshold_uncertainty_score":0.32783777},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16857459,0.0016148858,0.6434431,0.00036741083,0.0005778395,0.0005048412,0.0014342512,0.1743675,0.009115599],"genre_scores_gemma":[0.6070019,0.0003500427,0.37541848,0.00052794645,0.00013192087,0.0003420599,0.0028623284,0.0047320984,0.008633198],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875224,0.00016541684,0.00012295984,0.00024252912,0.0005389027,0.0001779446],"domain_scores_gemma":[0.9981997,0.00038963844,0.00028625812,0.0005505207,0.00049330486,0.00008046455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009860989,0.00141269,0.0005070072,0.0010841866,0.00043148937,0.0008445869,0.002257916,0.0003568997,0.004062224],"category_scores_gemma":[0.0023332946,0.0007256666,0.00082334684,0.00069784024,0.00070315273,0.0015521876,0.0012478491,0.001116329,0.0013128164],"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.003495902,0.00059912587,0.019169679,0.0011145516,0.0002745923,0.00051250943,0.00060828833,0.09600078,0.22847158,0.018188173,0.05571318,0.5758517],"study_design_scores_gemma":[0.00050674076,0.0012825578,0.0042007044,0.00007662248,0.0001785225,0.0003119108,0.0001323241,0.61332726,0.3222978,0.0075976583,0.04992105,0.00016682407],"about_ca_topic_score_codex":0.0028178496,"about_ca_topic_score_gemma":0.005496151,"teacher_disagreement_score":0.004062224,"about_ca_system_score_codex":0.00088276697,"about_ca_system_score_gemma":0.0030018687,"threshold_uncertainty_score":0.013589501},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35008228,0.035100333,0.41862667,0.002259562,0.0010478388,0.0008221938,0.001134476,0.0027660532,0.18816052],"genre_scores_gemma":[0.71122336,0.015018887,0.25395846,0.0002791976,0.0005986453,0.00034657112,0.0017182148,0.0003939465,0.0164627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977603,0.0004662898,0.00017958842,0.00033105383,0.001052146,0.00021058138],"domain_scores_gemma":[0.9957651,0.0019024245,0.00019120537,0.0003786814,0.00165926,0.00010328024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001769379,0.00068252045,0.0007281746,0.003071343,0.0007814916,0.0015163487,0.00090310245,0.00058611925,0.006612022],"category_scores_gemma":[0.0072051375,0.00021702939,0.0008516183,0.0064630914,0.000340038,0.0019458686,0.00048121193,0.0005434627,0.00083039707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010977982,0.0004749859,0.0088587245,0.0016782477,0.00025504036,0.00022019615,0.00021946283,0.15209545,0.0080772685,0.0363698,0.013830429,0.7768226],"study_design_scores_gemma":[0.00018201681,0.0014646113,0.01593373,0.00018745394,0.00042903394,0.00095704454,0.000539922,0.84190667,0.029539637,0.030653069,0.07813078,0.00007600792],"about_ca_topic_score_codex":0.0044754874,"about_ca_topic_score_gemma":0.0023095785,"teacher_disagreement_score":0.006612022,"about_ca_system_score_codex":0.0012940684,"about_ca_system_score_gemma":0.0017678239,"threshold_uncertainty_score":0.022119462},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21001826,0.0019253703,0.7659125,0.0008077856,0.00021450817,0.00024155692,0.00077046355,0.0103333555,0.009776279],"genre_scores_gemma":[0.7292715,0.0008883856,0.26087743,0.00027329594,0.0001337942,0.00022352357,0.0015328678,0.00055835425,0.006240912],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894124,0.00017510656,0.00007043996,0.00030476687,0.00027144895,0.00023698132],"domain_scores_gemma":[0.99867,0.00041920727,0.00008283702,0.00045506688,0.0002777834,0.000095110336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006906728,0.0007910848,0.00095345225,0.00058159034,0.0009911772,0.001695156,0.0017381402,0.00089435955,0.0034579276],"category_scores_gemma":[0.0022621707,0.000570646,0.00054007076,0.0015149812,0.00071928755,0.0021065702,0.0012488681,0.0010509543,0.0015149083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038288967,0.0006975802,0.008601552,0.00093278644,0.0002965629,0.0018987041,0.0009962649,0.24497347,0.21274371,0.045719992,0.0616211,0.4176893],"study_design_scores_gemma":[0.00015499715,0.00034660337,0.0016026761,0.000024748959,0.000050004142,0.00037463463,0.00018155201,0.9134941,0.04559226,0.020850435,0.017283196,0.000044857847],"about_ca_topic_score_codex":0.006228732,"about_ca_topic_score_gemma":0.007499549,"teacher_disagreement_score":0.006228732,"about_ca_system_score_codex":0.0007684603,"about_ca_system_score_gemma":0.0010812217,"threshold_uncertainty_score":0.012384951},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04438717,0.0007939002,0.74175197,0.00056410645,0.00024852745,0.00023719993,0.0023293337,0.19924694,0.010440923],"genre_scores_gemma":[0.417138,0.00058712036,0.5540594,0.00062075816,0.00013059349,0.00045398966,0.0048696436,0.009579506,0.012561036],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99926955,0.000133306,0.000057599562,0.00015635637,0.00029223642,0.000090969756],"domain_scores_gemma":[0.99814343,0.0008144778,0.00027959468,0.00032301774,0.000341122,0.000098364355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014002275,0.0018909628,0.00057998195,0.0013465701,0.00027593944,0.0009584684,0.0018801705,0.0006380852,0.012832795],"category_scores_gemma":[0.0064154365,0.00071785296,0.0008074924,0.00058917876,0.00032200673,0.001577046,0.00090551167,0.0012934955,0.0030753552],"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.0015908269,0.00027814784,0.01594704,0.0007752372,0.0001682898,0.00022523121,0.00019555833,0.16528511,0.042907845,0.011009037,0.08411328,0.67750436],"study_design_scores_gemma":[0.00006754901,0.00027948958,0.0009799735,0.000048992133,0.000047247602,0.00008652001,0.000028571134,0.9464165,0.03393854,0.0040347264,0.0140378205,0.0000340527],"about_ca_topic_score_codex":0.0013432673,"about_ca_topic_score_gemma":0.003794854,"teacher_disagreement_score":0.012832795,"about_ca_system_score_codex":0.0008424424,"about_ca_system_score_gemma":0.0016618044,"threshold_uncertainty_score":0.042929947},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18879406,0.00044069436,0.7895394,0.00036382885,0.00007818545,0.00021605735,0.00017859606,0.011334986,0.009054202],"genre_scores_gemma":[0.64952,0.000098434575,0.347772,0.00024420573,0.000030116482,0.00022249365,0.0002641656,0.0008348089,0.0010138218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998713,0.0003139703,0.00008503549,0.00031108846,0.0004139692,0.00016296582],"domain_scores_gemma":[0.9980684,0.0007234448,0.0002074839,0.00053133053,0.00036543625,0.00010398001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014022699,0.001222405,0.00095996447,0.0011007687,0.0006013188,0.0010343672,0.0021494832,0.00092842156,0.002239603],"category_scores_gemma":[0.0059556803,0.00059515657,0.00043877945,0.00076091493,0.0008666591,0.0011891214,0.001007534,0.0012441487,0.0008102939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054248713,0.0005217901,0.005985563,0.00018876416,0.00012013854,0.00014973473,0.00029204026,0.557605,0.06430094,0.0082802605,0.0067564016,0.35525686],"study_design_scores_gemma":[0.00005083508,0.000106013984,0.0005762429,0.000012048153,0.000011663857,0.00004094811,0.000031491483,0.97965425,0.015067152,0.0028726791,0.0015534349,0.000023207876],"about_ca_topic_score_codex":0.0026536477,"about_ca_topic_score_gemma":0.003405186,"teacher_disagreement_score":0.0026536477,"about_ca_system_score_codex":0.0009393539,"about_ca_system_score_gemma":0.0015086792,"threshold_uncertainty_score":0.0074922442},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47759914,0.0028285997,0.5040438,0.00026517818,0.00017943383,0.00014799008,0.00038102793,0.008329192,0.006225611],"genre_scores_gemma":[0.85408294,0.00042147536,0.14021145,0.00012151634,0.00003163927,0.000109999375,0.0007422952,0.00020751887,0.0040711537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998547,0.000018096074,0.000012996281,0.000025946756,0.000057304725,0.000030949923],"domain_scores_gemma":[0.9996118,0.00003881258,0.000063871565,0.00013571218,0.00012522332,0.000024634992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001550579,0.00039052995,0.0003879172,0.0005086142,0.0005224521,0.0004619963,0.0016405781,0.00022585629,0.001173617],"category_scores_gemma":[0.00045503041,0.00017979453,0.00023822782,0.0008673225,0.00026561823,0.0009874654,0.0004903766,0.00034595103,0.00017699339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00125524,0.0003327433,0.014135181,0.0005336691,0.00021537681,0.00045919674,0.00027157328,0.12104637,0.24845022,0.020579295,0.01835308,0.5743681],"study_design_scores_gemma":[0.0001939181,0.0010231818,0.0066616326,0.00003820302,0.00016993417,0.00072348345,0.00010660996,0.8161452,0.14500333,0.005515653,0.024320217,0.000098668264],"about_ca_topic_score_codex":0.00380487,"about_ca_topic_score_gemma":0.013173828,"teacher_disagreement_score":0.00380487,"about_ca_system_score_codex":0.0005710843,"about_ca_system_score_gemma":0.0012431317,"threshold_uncertainty_score":0.0075654387},"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":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030005523,0.00039552143,0.32489938,0.0006586991,0.00038457962,0.00030718328,0.01797376,0.61707866,0.035301704],"genre_scores_gemma":[0.12726754,0.0012116851,0.47680378,0.002160285,0.0005477569,0.0016177471,0.15338579,0.15682487,0.08018062],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986601,0.00014112146,0.00010429041,0.00034645744,0.0005697499,0.00017830309],"domain_scores_gemma":[0.9978715,0.0005909264,0.00008433812,0.0006877909,0.00049305137,0.0002723595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001633323,0.0025587354,0.001233466,0.0017794349,0.0010671228,0.0046043443,0.0038683948,0.0012574255,0.10744315],"category_scores_gemma":[0.006861211,0.0016112,0.0017005516,0.0022459594,0.0010703641,0.0053639826,0.0038213874,0.0034017796,0.058743484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012642656,0.0001654189,0.0016773622,0.0008103246,0.00018303446,0.00036599961,0.00062311435,0.006823042,0.011588737,0.032949205,0.8015203,0.14202933],"study_design_scores_gemma":[0.0006240961,0.00016478078,0.0022277283,0.00018482789,0.000097733624,0.00036071206,0.00021640904,0.14814597,0.0565466,0.057814293,0.73337674,0.00024012278],"about_ca_topic_score_codex":0.0075162486,"about_ca_topic_score_gemma":0.0055177216,"teacher_disagreement_score":0.10744315,"about_ca_system_score_codex":0.0016927981,"about_ca_system_score_gemma":0.002473737,"threshold_uncertainty_score":0.35943317},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040285755,0.00071549474,0.94835097,0.0006492883,0.00011917807,0.000049088572,0.00010014078,0.0015792166,0.008150846],"genre_scores_gemma":[0.7100196,0.00083755696,0.2832975,0.0002715485,0.00010150733,0.00012046352,0.00020985604,0.00037615607,0.0047658156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993204,0.00013207982,0.000036149584,0.00011077713,0.00030726177,0.0000934568],"domain_scores_gemma":[0.9977198,0.0013393833,0.00017035023,0.00044474195,0.00025878855,0.00006688644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011621303,0.00070733624,0.00053153245,0.00064488454,0.00038913116,0.0015227572,0.0013194927,0.00057051715,0.0050066058],"category_scores_gemma":[0.009205016,0.0005746139,0.00046304963,0.00068425096,0.00094077754,0.0047820797,0.0015485553,0.0023600333,0.0011167193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045434327,0.00018153896,0.0036225114,0.00032918603,0.00008065001,0.0001764026,0.00018646423,0.24942525,0.01740315,0.40897256,0.0078001274,0.31136775],"study_design_scores_gemma":[0.000019510318,0.00007402079,0.00016246903,0.000027673032,0.000014819909,0.000063243824,0.000024598825,0.81734794,0.009064705,0.16910131,0.004086587,0.000013042987],"about_ca_topic_score_codex":0.0014781774,"about_ca_topic_score_gemma":0.0030488346,"teacher_disagreement_score":0.0050066058,"about_ca_system_score_codex":0.001102743,"about_ca_system_score_gemma":0.0011582468,"threshold_uncertainty_score":0.016748786},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017643899,0.0005798937,0.76794773,0.0047262814,0.0026050077,0.0025730152,0.048349388,0.093998246,0.06157651],"genre_scores_gemma":[0.09571031,0.00023285887,0.72226715,0.00091195933,0.00034028184,0.0013521059,0.120782614,0.010378895,0.048023887],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9965682,0.0010122372,0.00026631774,0.0006165886,0.0012572494,0.0002793721],"domain_scores_gemma":[0.98334885,0.0033339146,0.0002667101,0.0048937206,0.0075537814,0.0006029747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005006694,0.00084490725,0.0007436954,0.0012085646,0.0012399537,0.0034747797,0.0028944542,0.0020407778,0.070404194],"category_scores_gemma":[0.031247519,0.0011579175,0.00096252025,0.0011480313,0.0006566087,0.004070969,0.0027667484,0.0026078718,0.048125837],"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.0012173179,0.0004625766,0.0012216863,0.00063595246,0.00024940202,0.00036568433,0.0005366197,0.015989583,0.010675953,0.029251065,0.72274953,0.21664464],"study_design_scores_gemma":[0.00097071193,0.00043417438,0.0029367032,0.00036770987,0.00017097013,0.0006997432,0.00053575047,0.21556197,0.047797006,0.094977334,0.63533336,0.00021452662],"about_ca_topic_score_codex":0.011039867,"about_ca_topic_score_gemma":0.0141180605,"teacher_disagreement_score":0.070404194,"about_ca_system_score_codex":0.0009589868,"about_ca_system_score_gemma":0.0047493293,"threshold_uncertainty_score":0.23552549},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034037884,0.000036820224,0.98925203,0.00017902942,0.000029993584,0.00006277114,0.00004501703,0.005479735,0.0015108233],"genre_scores_gemma":[0.086337484,0.00024068217,0.905677,0.00028640652,0.000090792535,0.00035529665,0.00023132759,0.003225266,0.0035556902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997027,0.0007779076,0.00036349928,0.000703099,0.00092521514,0.0002033857],"domain_scores_gemma":[0.9904739,0.004555675,0.0009409289,0.003000544,0.000684216,0.00034469337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066838954,0.0012702656,0.00073968293,0.00087174645,0.0011930974,0.0037540097,0.0045274603,0.0013975452,0.004050808],"category_scores_gemma":[0.013981884,0.0012502589,0.0022030314,0.00086039514,0.0038843234,0.008481778,0.0033888684,0.004064467,0.0010691605],"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.00047318652,0.00022238017,0.0041263173,0.0006531008,0.00015102417,0.0006780486,0.005120894,0.032593746,0.028021676,0.7393199,0.010893394,0.17774636],"study_design_scores_gemma":[0.00026843208,0.00029640892,0.0011299915,0.00041372332,0.0002662977,0.0014920207,0.0005770887,0.34501463,0.048025075,0.4000205,0.20225187,0.00024391958],"about_ca_topic_score_codex":0.002272777,"about_ca_topic_score_gemma":0.0025432706,"teacher_disagreement_score":0.0066838954,"about_ca_system_score_codex":0.00088573823,"about_ca_system_score_gemma":0.0026854798,"threshold_uncertainty_score":0.035348296},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069552384,0.0029822504,0.7548495,0.0013436736,0.0018910022,0.0005601767,0.029078735,0.121495344,0.01824685],"genre_scores_gemma":[0.27098674,0.0005274109,0.61797196,0.0005202587,0.00032474488,0.00053629326,0.08758103,0.008242364,0.013309207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963111,0.0013353893,0.00027221045,0.001351062,0.00049407146,0.00023606406],"domain_scores_gemma":[0.99340034,0.0032223437,0.00019742145,0.0013493559,0.0015829324,0.00024760165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041255453,0.002157532,0.0015293458,0.00310576,0.0023123566,0.0030719682,0.0034474176,0.0022059043,0.016385263],"category_scores_gemma":[0.016178293,0.0011330545,0.0012792898,0.002474415,0.0009742912,0.00694793,0.004120615,0.0039900416,0.020202821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013761054,0.0006062953,0.0029393903,0.0012461204,0.0004277088,0.0010080575,0.0016035952,0.0180619,0.023570323,0.012034353,0.19429837,0.7428278],"study_design_scores_gemma":[0.0002958214,0.00032130012,0.0035855123,0.00037149107,0.00037355872,0.0009225444,0.001770788,0.7878547,0.04582021,0.04887646,0.10952646,0.0002811727],"about_ca_topic_score_codex":0.010778536,"about_ca_topic_score_gemma":0.023188358,"teacher_disagreement_score":0.016385263,"about_ca_system_score_codex":0.0010369562,"about_ca_system_score_gemma":0.0038103939,"threshold_uncertainty_score":0.05481416},"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":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019820089,0.0014139354,0.25781313,0.0007327796,0.0005217451,0.0016780052,0.12504865,0.47206107,0.120910585],"genre_scores_gemma":[0.15710264,0.0013591513,0.26477033,0.0014540135,0.00024834753,0.0033626615,0.41719815,0.05049625,0.104008496],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992756,0.0000881807,0.000059223294,0.00015945641,0.0003155798,0.00010197095],"domain_scores_gemma":[0.9992955,0.00008696165,0.000032826505,0.00025253388,0.0002721521,0.000059964204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081079017,0.0012093569,0.0010820177,0.0013230861,0.0006701139,0.0020647477,0.003032352,0.0009902546,0.09107592],"category_scores_gemma":[0.002272215,0.0006958864,0.0006491839,0.0011200898,0.00032627897,0.0020889402,0.0015524013,0.0013481812,0.07234047],"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.0021386603,0.0003123877,0.001733427,0.0019877176,0.00014958809,0.00033122985,0.00020227072,0.028141102,0.030351877,0.013982536,0.7303955,0.1902737],"study_design_scores_gemma":[0.0006170764,0.0003031365,0.0021810972,0.00017640293,0.00014421705,0.00051209074,0.00006628321,0.14585517,0.046349082,0.012518771,0.7910867,0.00019000268],"about_ca_topic_score_codex":0.006089265,"about_ca_topic_score_gemma":0.004267308,"teacher_disagreement_score":0.09107592,"about_ca_system_score_codex":0.00087130466,"about_ca_system_score_gemma":0.0012099803,"threshold_uncertainty_score":0.30467933},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27929217,0.0043938546,0.6464375,0.0022506255,0.0005658336,0.0007031639,0.011109426,0.04898561,0.006261762],"genre_scores_gemma":[0.49417576,0.0011152314,0.47850996,0.0006310839,0.00017426391,0.00041457062,0.01756977,0.0009065065,0.006502802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985683,0.00024581188,0.0001740091,0.0004080389,0.000518177,0.000085674255],"domain_scores_gemma":[0.9931779,0.003370006,0.0005961351,0.00079263037,0.0017914276,0.00027184808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012065363,0.0014828242,0.0009421509,0.0043153497,0.0005175491,0.0010144811,0.0014171117,0.0011796441,0.0025113442],"category_scores_gemma":[0.01277968,0.0005149534,0.0007637612,0.0019548025,0.00030154322,0.0017520582,0.0006894325,0.0010225908,0.0015064175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081256294,0.00059110846,0.08737079,0.0010047706,0.00044440312,0.0006636307,0.00041596318,0.055290125,0.009577048,0.0018066599,0.08018278,0.76184005],"study_design_scores_gemma":[0.00015962892,0.00027550696,0.009544846,0.00013993219,0.00020525788,0.00052717776,0.00019007323,0.9491613,0.010656044,0.0061277137,0.022935467,0.00007713078],"about_ca_topic_score_codex":0.007928837,"about_ca_topic_score_gemma":0.021686515,"teacher_disagreement_score":0.007928837,"about_ca_system_score_codex":0.00038276066,"about_ca_system_score_gemma":0.001374718,"threshold_uncertainty_score":0.015765369},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045091296,0.0017330114,0.9097764,0.0006652077,0.0008540739,0.00011930156,0.0035239088,0.030650599,0.048168395],"genre_scores_gemma":[0.09080731,0.0026000116,0.7775349,0.0013660411,0.0007974493,0.00075127283,0.009350139,0.016848285,0.099944584],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908423,0.00011580451,0.00007970392,0.00019887129,0.00039732197,0.00012405848],"domain_scores_gemma":[0.999201,0.00020118416,0.000048661874,0.0003124956,0.00017113828,0.00006545237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005944391,0.0012881143,0.0010740039,0.0012970275,0.0012785997,0.0034108916,0.0023858354,0.00078929716,0.045882326],"category_scores_gemma":[0.0027271542,0.0010066077,0.0012972456,0.0032137933,0.0010821115,0.006267582,0.0035644628,0.0030280896,0.025774995],"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.00050518976,0.00009150199,0.00029246978,0.0007222644,0.00005003592,0.00016106771,0.00027169872,0.008667351,0.0068123457,0.26654208,0.19002354,0.5258604],"study_design_scores_gemma":[0.00009569375,0.00012654605,0.00029954463,0.00016795834,0.000041639025,0.00039656318,0.000085582804,0.034451444,0.016361812,0.30031288,0.64755327,0.00010709581],"about_ca_topic_score_codex":0.0013929822,"about_ca_topic_score_gemma":0.0017606516,"teacher_disagreement_score":0.045882326,"about_ca_system_score_codex":0.0010421526,"about_ca_system_score_gemma":0.0013610881,"threshold_uncertainty_score":0.15349162},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13240124,0.0006150676,0.863132,0.00015144679,0.00004875853,0.000052423984,0.00004626215,0.0010774974,0.0024753232],"genre_scores_gemma":[0.8831259,0.00017867297,0.11529844,0.00004602428,0.000026500746,0.000060101385,0.00005963993,0.00010386767,0.0011007739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996207,0.00011105607,0.000018623463,0.00008248643,0.0001054594,0.000061662104],"domain_scores_gemma":[0.99957496,0.00012928355,0.00005998006,0.00009477837,0.000099666766,0.000041446696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047154038,0.00056894263,0.0005042047,0.00037137626,0.0005549579,0.00038708662,0.00077893096,0.00026891578,0.0009739719],"category_scores_gemma":[0.0016376511,0.00019470265,0.00026577833,0.00038786695,0.0002652576,0.0008905733,0.00061703834,0.0005184754,0.00016808188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018554096,0.00012108088,0.001054814,0.000094180155,0.00002095044,0.00012942399,0.00013325873,0.77444494,0.06351673,0.0077718785,0.0018059323,0.15072127],"study_design_scores_gemma":[0.0000059796275,0.000085471554,0.00023620707,0.0000033885667,0.0000062963445,0.000049745027,0.000018545667,0.9900731,0.0071637146,0.0017793716,0.00057023164,0.000007980561],"about_ca_topic_score_codex":0.0011166353,"about_ca_topic_score_gemma":0.0013586986,"teacher_disagreement_score":0.0011166353,"about_ca_system_score_codex":0.00045382357,"about_ca_system_score_gemma":0.00080158695,"threshold_uncertainty_score":0.003292799},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10132175,0.0016167538,0.85191953,0.0011531125,0.00012230268,0.00010485455,0.00071404316,0.00047574332,0.04257188],"genre_scores_gemma":[0.92623293,0.0014797875,0.048198033,0.00042454098,0.000075417396,0.0002740432,0.00035249715,0.00020443428,0.022758445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991095,0.00002212212,0.0000039245274,0.000016934915,0.000029813054,0.000016224543],"domain_scores_gemma":[0.9998872,0.000043124033,0.000017322584,0.000012309399,0.00003131538,0.000008711664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015864105,0.00045881362,0.00035960978,0.00026885504,0.00031729636,0.00063315977,0.00090646686,0.0007709563,0.0029289604],"category_scores_gemma":[0.00048174706,0.00028766968,0.0004847331,0.00041189857,0.00037056618,0.0009928746,0.00041840842,0.0004973436,0.0005298705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011659426,0.000011414213,0.00024199484,0.000020062356,0.00000675314,0.00007590229,0.000024010535,0.9841223,0.0024358288,0.010042503,0.0005766365,0.0024309997],"study_design_scores_gemma":[0.0000019885522,0.0000065714758,0.00007299329,0.0000017473728,0.0000023381942,0.000011847747,0.000005649514,0.99742043,0.0001554571,0.0016890771,0.00063010113,0.0000017109694],"about_ca_topic_score_codex":0.0043768934,"about_ca_topic_score_gemma":0.0043674363,"teacher_disagreement_score":0.0043768934,"about_ca_system_score_codex":0.0005772373,"about_ca_system_score_gemma":0.0005738017,"threshold_uncertainty_score":0.009798408},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47402743,0.0017051533,0.5009085,0.00052587903,0.00024461883,0.000074462296,0.0000976317,0.0050099296,0.017406406],"genre_scores_gemma":[0.92673534,0.00043956947,0.069895454,0.00015952371,0.00004713318,0.000046104393,0.00010490835,0.00040694317,0.0021649722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996954,0.00005704235,0.000013898115,0.000045074747,0.00012101644,0.00006761297],"domain_scores_gemma":[0.9993278,0.00020382958,0.000067595705,0.00026981588,0.000075243806,0.000055749737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027745924,0.0005118233,0.00043812158,0.00033663813,0.00037998814,0.00067545363,0.0008854302,0.00032218362,0.0014969041],"category_scores_gemma":[0.0014469065,0.0002456382,0.00031831654,0.0004392239,0.0007565255,0.0008871475,0.0014390058,0.0008725459,0.0005020875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077574176,0.00027538402,0.004660976,0.00034909713,0.000111607515,0.00079977216,0.00066231453,0.42216137,0.27811676,0.06213558,0.0072732493,0.22267811],"study_design_scores_gemma":[0.00006200391,0.00019842389,0.0010672094,0.000024924688,0.000028719127,0.0002083528,0.0000749927,0.9058072,0.054774776,0.024442041,0.0132812755,0.00002999486],"about_ca_topic_score_codex":0.00076189375,"about_ca_topic_score_gemma":0.0010411965,"teacher_disagreement_score":0.0014969041,"about_ca_system_score_codex":0.00036195858,"about_ca_system_score_gemma":0.00047315945,"threshold_uncertainty_score":0.005007684},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03545993,0.0013734341,0.94499916,0.00046777428,0.00036787492,0.00006762477,0.00012948895,0.0059146034,0.011220236],"genre_scores_gemma":[0.33475038,0.000806917,0.6529323,0.00040215228,0.00016205786,0.0001966976,0.00033472056,0.0035373184,0.006877472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812406,0.00062118086,0.0001056294,0.00028693094,0.00057326537,0.00028882828],"domain_scores_gemma":[0.99582666,0.002174741,0.0002764175,0.0011190053,0.00043602983,0.00016722504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016376378,0.0009643928,0.0010816961,0.00087171444,0.00086047745,0.0023978143,0.002159669,0.0008634166,0.0093861995],"category_scores_gemma":[0.0074763764,0.0008354413,0.0011143134,0.0014023707,0.001829143,0.0049661617,0.002923172,0.0019806216,0.0032304723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017024698,0.00023766929,0.0026406264,0.0012878102,0.0002189765,0.00060260703,0.00086089736,0.19488743,0.03631938,0.33353442,0.021120453,0.40658724],"study_design_scores_gemma":[0.00025267896,0.000381212,0.0007967486,0.0003171336,0.00013059973,0.00046480363,0.00025852286,0.6228335,0.051263988,0.25755665,0.065593734,0.00015049294],"about_ca_topic_score_codex":0.0015869302,"about_ca_topic_score_gemma":0.002284484,"teacher_disagreement_score":0.0093861995,"about_ca_system_score_codex":0.000835113,"about_ca_system_score_gemma":0.0011896964,"threshold_uncertainty_score":0.031400025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025143318,0.0019438682,0.94606894,0.007195301,0.00036839533,0.00010398046,0.00010360195,0.0034930082,0.015579558],"genre_scores_gemma":[0.31253842,0.0020671762,0.6677625,0.004136314,0.00034997409,0.000442911,0.00033119414,0.0025780036,0.009793461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939254,0.001937588,0.0005254871,0.0007663459,0.0018337158,0.0010115033],"domain_scores_gemma":[0.9909429,0.0029641006,0.00047191986,0.0043474715,0.0008406,0.00043302955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010019869,0.0016071688,0.0012209883,0.0012796401,0.0015593872,0.007223008,0.0043915627,0.0031764293,0.0031784668],"category_scores_gemma":[0.013136946,0.0016579011,0.0021436154,0.0010250586,0.008547712,0.031100595,0.01216158,0.011851189,0.0009866467],"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.00016726254,0.00007361583,0.0009815135,0.00030744664,0.000062022795,0.00047917978,0.0029432478,0.0081390515,0.007978063,0.94236237,0.002943749,0.033562507],"study_design_scores_gemma":[0.000071384224,0.00015029026,0.00043382173,0.00044593553,0.00016277985,0.0007260652,0.001199158,0.06538963,0.017032376,0.7415357,0.17273828,0.00011447882],"about_ca_topic_score_codex":0.0026193946,"about_ca_topic_score_gemma":0.0027458365,"teacher_disagreement_score":0.010019869,"about_ca_system_score_codex":0.0023429473,"about_ca_system_score_gemma":0.0024420458,"threshold_uncertainty_score":0.052990735},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91382736,0.0005563553,0.07678294,0.00021196723,0.00009355006,0.000100890175,0.00014373311,0.003815396,0.0044678575],"genre_scores_gemma":[0.94225776,0.00015972616,0.05488565,0.00005575796,0.000019472716,0.000052078154,0.00031653023,0.00027086146,0.001982179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997317,0.000050133975,0.000023760203,0.000049451988,0.00007231289,0.00007266719],"domain_scores_gemma":[0.99898463,0.00040991438,0.00011550808,0.00020454946,0.00016820934,0.00011724408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034341376,0.00047766167,0.00040003558,0.00039188896,0.0006062927,0.00063717697,0.0009007032,0.00033113844,0.002499135],"category_scores_gemma":[0.0017899035,0.0002925804,0.00024104909,0.0007825792,0.00048165547,0.0007965325,0.0006346137,0.0004837423,0.00052180834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003131683,0.00074929715,0.029829284,0.00057820446,0.00013845596,0.0012971967,0.001057149,0.39174387,0.22462678,0.012887675,0.018440815,0.31551954],"study_design_scores_gemma":[0.000077995224,0.000323047,0.0032700915,0.000008786864,0.000022770382,0.00012415022,0.0001864151,0.94546306,0.041427813,0.003556024,0.0055177296,0.000022036582],"about_ca_topic_score_codex":0.0030328613,"about_ca_topic_score_gemma":0.008656568,"teacher_disagreement_score":0.0030328613,"about_ca_system_score_codex":0.0006130566,"about_ca_system_score_gemma":0.0012401893,"threshold_uncertainty_score":0.0083604455},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98353994,0.00057067524,0.013569355,0.0000845771,0.00002271881,0.000029381768,0.000039702307,0.0010332383,0.0011103034],"genre_scores_gemma":[0.9870194,0.00018922135,0.011869651,0.000044105538,0.000010746128,0.000021663021,0.000086088854,0.00002750867,0.00073161774],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978346,0.000019753514,0.000013918387,0.000021592403,0.000106175765,0.00005508316],"domain_scores_gemma":[0.99923337,0.0003472582,0.0001288421,0.000055909462,0.00018894926,0.00004564538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018031265,0.00036904955,0.0003613907,0.00049957907,0.00025378398,0.00034329065,0.00058080093,0.00026512358,0.0009063264],"category_scores_gemma":[0.0011030129,0.00015268111,0.00014995046,0.00064680865,0.0002194458,0.0006820143,0.00025539426,0.00023724452,0.00016235374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018660085,0.0005234947,0.018111475,0.00035156214,0.00006387529,0.0007165643,0.00021831885,0.034819696,0.7897227,0.00054905895,0.0014209956,0.15163638],"study_design_scores_gemma":[0.00010933344,0.0032035338,0.012303059,0.00003650134,0.00006941232,0.0005703136,0.00014547094,0.2651479,0.715783,0.00027179936,0.002317086,0.00004269311],"about_ca_topic_score_codex":0.0024226073,"about_ca_topic_score_gemma":0.0067847404,"teacher_disagreement_score":0.0024226073,"about_ca_system_score_codex":0.00034863767,"about_ca_system_score_gemma":0.00065107987,"threshold_uncertainty_score":0.0048170686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021170009,0.00031702573,0.9648448,0.00013459055,0.00007309136,0.0001499178,0.00014163941,0.0011197369,0.01204928],"genre_scores_gemma":[0.22605863,0.00025668924,0.7631052,0.00013572897,0.000029491335,0.00031150083,0.00051413185,0.00063712586,0.008951499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995283,0.00011731974,0.000019943223,0.00006721569,0.00022673985,0.000040570725],"domain_scores_gemma":[0.99929726,0.00033923791,0.000038488433,0.00012915484,0.00016726716,0.000028539942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007237342,0.0007765079,0.00062061276,0.0010244142,0.0006156637,0.0008594307,0.0010533228,0.0007119723,0.0062357252],"category_scores_gemma":[0.0018198574,0.00039631594,0.00076460815,0.0009154746,0.00057023554,0.0007433128,0.0013351395,0.0007503619,0.0011218159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015128053,0.00007891186,0.0008615502,0.0003028193,0.000068647474,0.00022140285,0.00023497854,0.7010914,0.014912337,0.07014956,0.0072341394,0.20469289],"study_design_scores_gemma":[0.00002446658,0.000054147516,0.0002757301,0.000027834794,0.000013071336,0.00008604519,0.000044897788,0.95821893,0.0043540653,0.02783177,0.009055402,0.000013639747],"about_ca_topic_score_codex":0.0033537433,"about_ca_topic_score_gemma":0.0051120287,"teacher_disagreement_score":0.0062357252,"about_ca_system_score_codex":0.0007314392,"about_ca_system_score_gemma":0.000898285,"threshold_uncertainty_score":0.020860553},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037052013,0.000509165,0.95739657,0.0001551949,0.000020594021,0.000085658714,0.00011047701,0.0015616477,0.0031086677],"genre_scores_gemma":[0.79042596,0.0009276505,0.20529518,0.0000911527,0.00004152852,0.00029081956,0.00030172375,0.00024724196,0.0023787234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919635,0.00019554562,0.000037801896,0.00008784955,0.0004033094,0.00007923175],"domain_scores_gemma":[0.99887794,0.00031813156,0.0002185277,0.000110492525,0.00044170654,0.00003324292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009117003,0.0012626835,0.0006302933,0.0015599465,0.00040018206,0.0011043624,0.0013576515,0.00064663915,0.0006807042],"category_scores_gemma":[0.0035293584,0.0003889648,0.0007207285,0.000785633,0.00046971356,0.0013176824,0.0005390581,0.0007155508,0.0003312777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021828297,0.00004932471,0.0016260997,0.00005789367,0.00002055442,0.000078232406,0.00008491035,0.9529629,0.0062822495,0.01192124,0.0006353354,0.026259521],"study_design_scores_gemma":[0.0000011034282,0.00001588898,0.00010605141,0.0000054671373,0.0000041629282,0.000011764917,0.00000810317,0.9980013,0.00061852665,0.0008232893,0.00040017776,0.000004138505],"about_ca_topic_score_codex":0.012177005,"about_ca_topic_score_gemma":0.007619667,"teacher_disagreement_score":0.012177005,"about_ca_system_score_codex":0.0013748674,"about_ca_system_score_gemma":0.0029494672,"threshold_uncertainty_score":0.024212241},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10354105,0.0008343216,0.88155097,0.0003132402,0.00017184112,0.00021332604,0.00012996385,0.003707394,0.009537944],"genre_scores_gemma":[0.813366,0.000377925,0.18114816,0.00007080926,0.000063558,0.00013447736,0.00018370799,0.00025090107,0.0044043586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899346,0.00022823413,0.000074268755,0.0002167608,0.000314716,0.00017247003],"domain_scores_gemma":[0.9981535,0.0005329885,0.00024752144,0.00049124926,0.00030538364,0.00026946925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010953759,0.00055951625,0.00069449545,0.0005440779,0.0011469502,0.0010916444,0.0021611955,0.00041337777,0.001744648],"category_scores_gemma":[0.0033474695,0.00033646167,0.00037801595,0.0008741299,0.0008342719,0.0012487313,0.0011221387,0.0008392948,0.00051430665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013380281,0.00056506554,0.004330587,0.0003670698,0.00010866504,0.00038038543,0.00050351257,0.71201247,0.04459554,0.054949783,0.00809382,0.172755],"study_design_scores_gemma":[0.000048770515,0.00014160913,0.000483251,0.000010344138,0.000024992514,0.000116555486,0.000058147252,0.9707366,0.01016509,0.013259729,0.0049313037,0.000023577019],"about_ca_topic_score_codex":0.002022164,"about_ca_topic_score_gemma":0.0036819202,"teacher_disagreement_score":0.0021611955,"about_ca_system_score_codex":0.0008702588,"about_ca_system_score_gemma":0.0016771348,"threshold_uncertainty_score":0.006314218},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06725692,0.00021658198,0.91737217,0.00025638344,0.00007816942,0.000035301655,0.00056504906,0.0061508943,0.008068437],"genre_scores_gemma":[0.40704852,0.0001527882,0.5858192,0.00012103047,0.000031642496,0.00009184587,0.0009922874,0.000711378,0.0050313044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937624,0.00007855144,0.000036338606,0.00010261927,0.0003029862,0.00010336595],"domain_scores_gemma":[0.9990637,0.0003025759,0.00004361893,0.00027472948,0.0002612455,0.00005410957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007987634,0.0007239811,0.00092717994,0.00056437287,0.0005663271,0.0013471487,0.0011156613,0.00064495584,0.00522662],"category_scores_gemma":[0.0036947217,0.00046798892,0.0005173126,0.0013139966,0.00059548847,0.0016713016,0.0011672426,0.00087938504,0.0012131637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012048315,0.00017454641,0.0038414367,0.00025654482,0.0001302059,0.00036268297,0.0003685318,0.39784288,0.06806295,0.12371191,0.022658693,0.38138473],"study_design_scores_gemma":[0.000016764061,0.000018649936,0.00041131533,0.0000055060386,0.00000385662,0.000054039392,0.000019679746,0.96495,0.017103925,0.013737402,0.003666372,0.000012405423],"about_ca_topic_score_codex":0.0069343355,"about_ca_topic_score_gemma":0.0072189546,"teacher_disagreement_score":0.0069343355,"about_ca_system_score_codex":0.00095703214,"about_ca_system_score_gemma":0.0015158844,"threshold_uncertainty_score":0.017484784},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009605027,0.009339154,0.8101121,0.0018690566,0.0015198388,0.000442926,0.0011088791,0.015644249,0.15035883],"genre_scores_gemma":[0.07060836,0.014199881,0.8158196,0.00058309356,0.0004601211,0.0003333448,0.0038539304,0.0037050643,0.09043658],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996679,0.00002792892,0.0000159743,0.00005372372,0.0001724629,0.00006206569],"domain_scores_gemma":[0.9997403,0.000047756897,0.000013737285,0.00009384321,0.000067233086,0.000037203685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033206755,0.0009737984,0.0005331582,0.0009938495,0.0005411856,0.0019558931,0.0016152229,0.00079202757,0.026147507],"category_scores_gemma":[0.00087256957,0.00086182356,0.00063381606,0.00160366,0.00041070505,0.0028281584,0.0016327563,0.002449571,0.017141389],"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.00007494217,0.00013062744,0.0006484659,0.000828802,0.00005046627,0.00034754348,0.00017669257,0.021335537,0.024166536,0.13754214,0.13413101,0.6805672],"study_design_scores_gemma":[0.000047230453,0.00012677963,0.0012520113,0.00035849644,0.00003809469,0.00096451625,0.00012886175,0.056781057,0.02967594,0.07587255,0.83469623,0.000058113234],"about_ca_topic_score_codex":0.0017979874,"about_ca_topic_score_gemma":0.0025753863,"teacher_disagreement_score":0.026147507,"about_ca_system_score_codex":0.0008229935,"about_ca_system_score_gemma":0.0012567107,"threshold_uncertainty_score":0.08747214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9535489,0.0013228288,0.017611474,0.00022096834,0.0001849481,0.00008426088,0.0009183806,0.011733929,0.0143742915],"genre_scores_gemma":[0.944616,0.00040526284,0.04740517,0.00009082462,0.000031480635,0.00010372082,0.003009618,0.0021925692,0.0021451227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983108,0.0004327998,0.000117432806,0.00026844922,0.0006018907,0.00026854934],"domain_scores_gemma":[0.99606067,0.0014103882,0.00016579752,0.0007005792,0.0014428076,0.00021977698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014347716,0.0010675326,0.00087859645,0.0009290746,0.00078780745,0.0012843559,0.0024376241,0.0009937698,0.0022465568],"category_scores_gemma":[0.0055752755,0.0004703841,0.00055497134,0.002027643,0.00073769846,0.0012684072,0.000926602,0.00095681107,0.00065721944],"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.007129985,0.0013186008,0.02563903,0.0019589956,0.0005014375,0.0011398394,0.0014089299,0.5663803,0.1252487,0.013216246,0.038184166,0.21787378],"study_design_scores_gemma":[0.00029481467,0.0009309601,0.0074382504,0.00008224419,0.00007850932,0.00015702081,0.00021664014,0.8773196,0.10238379,0.0016513264,0.009387992,0.000058799407],"about_ca_topic_score_codex":0.008981158,"about_ca_topic_score_gemma":0.005539387,"teacher_disagreement_score":0.008981158,"about_ca_system_score_codex":0.0013247258,"about_ca_system_score_gemma":0.0012476299,"threshold_uncertainty_score":0.01785779},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03652605,0.0047966526,0.72542614,0.0054444894,0.0016596736,0.00030968455,0.012233786,0.081260994,0.13234258],"genre_scores_gemma":[0.36791277,0.008116765,0.47118402,0.0024839097,0.0018310086,0.00078127277,0.030750718,0.007685836,0.10925373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989999,0.00014552462,0.000042368174,0.00011374387,0.00059659453,0.00010183127],"domain_scores_gemma":[0.9984692,0.0003206612,0.000090778034,0.00040921377,0.0005378362,0.00017227828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046149959,0.00071778346,0.0006237574,0.0013966397,0.00058547576,0.0019553665,0.0008968026,0.0008748798,0.039436143],"category_scores_gemma":[0.0049549234,0.0004889936,0.0004923928,0.0021489707,0.00045886525,0.0026180074,0.0026358464,0.0011814322,0.024151416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030613347,0.0001480671,0.0017338186,0.00050021865,0.0000629107,0.00059727015,0.00020990362,0.031026788,0.014546895,0.10161577,0.37768883,0.47156337],"study_design_scores_gemma":[0.00011746076,0.00007764334,0.0021737984,0.00020450549,0.0000246756,0.0006693507,0.0001751526,0.2788,0.012758415,0.227114,0.4777988,0.00008616993],"about_ca_topic_score_codex":0.0036155204,"about_ca_topic_score_gemma":0.0051227566,"teacher_disagreement_score":0.039436143,"about_ca_system_score_codex":0.00041073008,"about_ca_system_score_gemma":0.001002183,"threshold_uncertainty_score":0.13192701},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016780283,0.00005800673,0.9801656,0.00003443534,0.000011377335,0.000043387856,0.000028504452,0.0015646017,0.0013138315],"genre_scores_gemma":[0.36258608,0.00009306844,0.6351198,0.000028624028,0.000011439531,0.0001460702,0.00014866055,0.0005518629,0.0013142853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994671,0.00014461017,0.00002327191,0.00013944435,0.0001855403,0.000040118364],"domain_scores_gemma":[0.9995092,0.00018604957,0.00006937216,0.00010460798,0.000109117536,0.000021642714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051500864,0.0008769609,0.00042459695,0.0005496332,0.00035880913,0.0007253983,0.0005910534,0.00029558575,0.0011419501],"category_scores_gemma":[0.0013917338,0.00027859243,0.00039660864,0.00037263255,0.00042092736,0.00063192844,0.0007026828,0.0006856227,0.00021191163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023165978,0.00009585513,0.0025334854,0.00024361929,0.00007085028,0.000112589834,0.0003798514,0.46741202,0.12812223,0.03042745,0.0015787781,0.36879164],"study_design_scores_gemma":[0.000015730177,0.00009407732,0.00075528934,0.000014989456,0.000023851506,0.000049872353,0.00003130417,0.9299789,0.055219293,0.007737453,0.006062367,0.000016882437],"about_ca_topic_score_codex":0.0020210808,"about_ca_topic_score_gemma":0.0024970567,"teacher_disagreement_score":0.0020210808,"about_ca_system_score_codex":0.000595036,"about_ca_system_score_gemma":0.0006782842,"threshold_uncertainty_score":0.0043172836},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37002242,0.0030291108,0.6171183,0.00018712574,0.00010937966,0.0000773394,0.00018066795,0.0031173606,0.006158333],"genre_scores_gemma":[0.8759889,0.00045572533,0.12014212,0.00010623266,0.000030398513,0.00006631368,0.0002835752,0.000068920475,0.0028579594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989223,0.000017292467,0.000010799297,0.000023301445,0.000038253984,0.000018004122],"domain_scores_gemma":[0.9997795,0.000028307715,0.000035814246,0.00005612518,0.000087029664,0.0000132958685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010955026,0.00021104036,0.00027640787,0.000316637,0.00034504128,0.00029415762,0.00085762487,0.00017880584,0.0007149057],"category_scores_gemma":[0.00030539173,0.00010818709,0.00019219598,0.0005712147,0.00016253929,0.00072814967,0.00029079727,0.00018786834,0.00015185554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005617131,0.00017893288,0.009060625,0.00031854326,0.00014076343,0.00041419853,0.00022896007,0.104459904,0.28801253,0.018842582,0.009569075,0.5682121],"study_design_scores_gemma":[0.000062802756,0.00083344,0.0038478693,0.00003253215,0.00013767446,0.00072801113,0.000083482926,0.87042964,0.096593484,0.0041585495,0.02304165,0.000050890758],"about_ca_topic_score_codex":0.0018686702,"about_ca_topic_score_gemma":0.0054665627,"teacher_disagreement_score":0.0018686702,"about_ca_system_score_codex":0.0003211774,"about_ca_system_score_gemma":0.00052624906,"threshold_uncertainty_score":0.0037155747},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9914546,0.00023385095,0.0054643094,0.000039069047,0.000013855401,0.000022969,0.00011239901,0.0001909863,0.0024680581],"genre_scores_gemma":[0.9905282,0.00008994878,0.008595079,0.000011142941,0.00000411309,0.000009187602,0.00010640474,0.000020590765,0.0006354269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997577,0.00005066215,0.000019006207,0.000041567888,0.000076842756,0.00005421433],"domain_scores_gemma":[0.9992424,0.0003737631,0.00010474466,0.0000988692,0.00014434085,0.000035841327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034758498,0.00047815757,0.0001644653,0.0004769824,0.00018838422,0.00038774533,0.00055573176,0.00025861274,0.0017603801],"category_scores_gemma":[0.0012488824,0.00011000332,0.00015415862,0.0006355948,0.00018157107,0.0006488356,0.00012792253,0.00024181795,0.0002492482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034662865,0.0007406753,0.028558314,0.0006600619,0.00020215266,0.00046694386,0.00010006452,0.5161931,0.2520129,0.003815767,0.0020601193,0.19172363],"study_design_scores_gemma":[0.00017105037,0.005964502,0.028183788,0.000029703666,0.00015539462,0.00028507918,0.000106708,0.72895664,0.23236792,0.0009399565,0.0027920785,0.00004709936],"about_ca_topic_score_codex":0.002014024,"about_ca_topic_score_gemma":0.00403788,"teacher_disagreement_score":0.002014024,"about_ca_system_score_codex":0.000553521,"about_ca_system_score_gemma":0.00034664848,"threshold_uncertainty_score":0.0058891177},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049193036,0.0005483663,0.9154059,0.00069686834,0.00021891213,0.00023368192,0.00022171132,0.02298957,0.010491856],"genre_scores_gemma":[0.61255264,0.00030946574,0.37369543,0.00041414722,0.00016219397,0.00040768873,0.00084440917,0.002119917,0.009494143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969554,0.00070282567,0.00028932607,0.0003368964,0.0013110767,0.00040449743],"domain_scores_gemma":[0.9966462,0.000794158,0.0002662322,0.0012841744,0.00084281166,0.00016637219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002054591,0.0006971389,0.0005901654,0.001053758,0.0013372819,0.0016363147,0.0028335992,0.0007948959,0.0032108312],"category_scores_gemma":[0.005739491,0.00047032244,0.00057538965,0.0013152751,0.0007526998,0.0025298405,0.0023644306,0.0013080873,0.000987266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015986813,0.00048895134,0.008973264,0.0007458672,0.00022963199,0.0005034702,0.0010220588,0.16671462,0.102851324,0.1272977,0.03622032,0.5533541],"study_design_scores_gemma":[0.00015471248,0.00027083076,0.0015024459,0.00004588062,0.00011286789,0.00019795354,0.00013224568,0.7501735,0.12159116,0.05367168,0.072022915,0.00012372823],"about_ca_topic_score_codex":0.0022247965,"about_ca_topic_score_gemma":0.0019032148,"teacher_disagreement_score":0.0032108312,"about_ca_system_score_codex":0.0010956883,"about_ca_system_score_gemma":0.0015993332,"threshold_uncertainty_score":0.0108658075},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67192256,0.00039469273,0.31520686,0.00016822164,0.00010752599,0.00008177712,0.00060273777,0.008537893,0.0029776692],"genre_scores_gemma":[0.96018267,0.000036229703,0.038787063,0.000034369372,0.00001067595,0.000021852942,0.00039882807,0.00025723202,0.0002711732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99793017,0.00054709095,0.00012846882,0.0002712329,0.0009792832,0.00014366738],"domain_scores_gemma":[0.98908526,0.005785139,0.0015493466,0.0016054068,0.0017300908,0.00024481816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021993208,0.0007710967,0.00040114435,0.0014313515,0.00025394736,0.0012223485,0.00087660836,0.0003691604,0.0013963251],"category_scores_gemma":[0.015983725,0.00046217078,0.00027881298,0.0009317984,0.00043167535,0.0010220975,0.0006820029,0.000747062,0.00049148826],"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.0013594957,0.00024945752,0.11280154,0.00027016838,0.0002290887,0.0003607035,0.0005104334,0.6133148,0.05946795,0.0038103482,0.0030219473,0.20460409],"study_design_scores_gemma":[0.000022643022,0.000112701804,0.0085163,0.00001946411,0.000019324412,0.00007288493,0.000034039505,0.9493949,0.03977143,0.0009721218,0.0010333759,0.00003092447],"about_ca_topic_score_codex":0.0022222996,"about_ca_topic_score_gemma":0.0019005935,"teacher_disagreement_score":0.0022222996,"about_ca_system_score_codex":0.00068005576,"about_ca_system_score_gemma":0.000645278,"threshold_uncertainty_score":0.01163125},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84292656,0.001461936,0.13312173,0.00022619212,0.00017130846,0.00015829969,0.00035681418,0.004288436,0.01728866],"genre_scores_gemma":[0.9482115,0.00014786527,0.046597824,0.0000703125,0.000020177342,0.0000483925,0.00018444614,0.000042968913,0.0046765027],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983966,0.000018332803,0.000009932273,0.00003567479,0.000055538636,0.000040814422],"domain_scores_gemma":[0.9998017,0.00002593984,0.000032365697,0.000050170773,0.00006170935,0.000028016535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013579709,0.00020773844,0.00021779556,0.00041244252,0.00021804281,0.00064619863,0.0009794725,0.00034276367,0.0022547247],"category_scores_gemma":[0.00017338883,0.00012828801,0.00014953324,0.00045895425,0.0001853837,0.0007070077,0.00030195664,0.00027362356,0.00052884547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013964853,0.00045656692,0.0051363707,0.0005197345,0.00014411766,0.00078106194,0.0002429893,0.04104383,0.7810691,0.018340988,0.0070554316,0.14381337],"study_design_scores_gemma":[0.00040139086,0.006190961,0.011393987,0.00008554565,0.00027277597,0.0019076788,0.0002352537,0.5114834,0.41452146,0.0054930174,0.047859285,0.00015516071],"about_ca_topic_score_codex":0.000960056,"about_ca_topic_score_gemma":0.0016954723,"teacher_disagreement_score":0.0022547247,"about_ca_system_score_codex":0.0003680773,"about_ca_system_score_gemma":0.00036670157,"threshold_uncertainty_score":0.007542789},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022482505,0.0011941378,0.37075368,0.0014903465,0.001827442,0.00089373527,0.010146352,0.2608271,0.3303847],"genre_scores_gemma":[0.24120168,0.0014852573,0.37091976,0.0032699213,0.0005419489,0.0016791596,0.059134934,0.045484994,0.27628228],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992545,0.00008564258,0.000043673135,0.00019276897,0.0002866571,0.00013677661],"domain_scores_gemma":[0.9989135,0.0001910419,0.000059220805,0.0003507877,0.00032549584,0.00016001426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081549806,0.0012351224,0.00058003585,0.0006966305,0.0008934857,0.0021451449,0.0037450325,0.0009966329,0.087963864],"category_scores_gemma":[0.0019734567,0.00069305766,0.00084150897,0.00069734093,0.00066718063,0.0025361436,0.0029582263,0.0015029022,0.0422869],"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.0017325827,0.00060241163,0.003908599,0.0010181293,0.0001510623,0.0005232478,0.00026977228,0.02421507,0.016653718,0.079081886,0.6039632,0.26788032],"study_design_scores_gemma":[0.00029709673,0.00024328164,0.0011102235,0.000088206274,0.000047589885,0.00051209447,0.00009936128,0.1371705,0.021935899,0.033075385,0.8053317,0.00008875035],"about_ca_topic_score_codex":0.002550676,"about_ca_topic_score_gemma":0.0043596597,"teacher_disagreement_score":0.087963864,"about_ca_system_score_codex":0.0008803973,"about_ca_system_score_gemma":0.0018061469,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52427375,0.00302438,0.44785726,0.0006824039,0.00017048526,0.00018748488,0.0002158718,0.001838188,0.021750096],"genre_scores_gemma":[0.9404136,0.00030283874,0.055680472,0.00009078416,0.00002651096,0.0000710544,0.00010076258,0.00011571761,0.0031982244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995345,0.000109410306,0.000017835957,0.00005088061,0.00017742827,0.00010995485],"domain_scores_gemma":[0.9993925,0.0001622214,0.0001013515,0.00008094267,0.00022106085,0.000041845073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039702834,0.00050517765,0.00041415877,0.00052922446,0.0004806375,0.00085750764,0.0014188633,0.00037667935,0.0018268679],"category_scores_gemma":[0.0010756954,0.00031149006,0.00032492526,0.0006000727,0.00031051162,0.00050319644,0.00037045244,0.00043425077,0.0003467086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054818636,0.00022356916,0.0057680258,0.0003573852,0.00013875557,0.00021231534,0.00015809025,0.7585334,0.1058022,0.0200051,0.004341137,0.10391176],"study_design_scores_gemma":[0.00002476077,0.00022991383,0.00089599175,0.000009310719,0.000032873308,0.000037622747,0.000025293115,0.9834922,0.011531439,0.0013272534,0.0023852326,0.0000080712225],"about_ca_topic_score_codex":0.0041095642,"about_ca_topic_score_gemma":0.008508596,"teacher_disagreement_score":0.0041095642,"about_ca_system_score_codex":0.0011715865,"about_ca_system_score_gemma":0.0020737466,"threshold_uncertainty_score":0.008500516},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108715214,0.00026665523,0.87225735,0.00018696042,0.000077828554,0.00011083104,0.00016687273,0.005781566,0.012436749],"genre_scores_gemma":[0.6133167,0.00009942359,0.38066983,0.000057456524,0.000034365643,0.00015589107,0.00044970697,0.00033659357,0.004879987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958867,0.00007365915,0.000020254294,0.00006275143,0.000176116,0.000078588746],"domain_scores_gemma":[0.99944335,0.00014767559,0.000033917444,0.00015968604,0.00018566281,0.000029729115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040957722,0.00048159578,0.00052712933,0.00029588514,0.00033904408,0.00058784743,0.0012964334,0.0003409578,0.0032128338],"category_scores_gemma":[0.0014766677,0.00023219283,0.0004445081,0.0004180133,0.0003412241,0.0008666141,0.000924043,0.0005972662,0.0006981954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007681585,0.00026005658,0.002757744,0.0002416589,0.00016565125,0.0006246184,0.0004237478,0.4719688,0.10401247,0.030766852,0.010052329,0.37795797],"study_design_scores_gemma":[0.00005549059,0.000057443143,0.00033948763,0.0000049926725,0.000013239545,0.000059521248,0.000023838204,0.9765513,0.016491508,0.0035575132,0.002835349,0.000010291938],"about_ca_topic_score_codex":0.005307667,"about_ca_topic_score_gemma":0.0069098463,"teacher_disagreement_score":0.005307667,"about_ca_system_score_codex":0.00036889213,"about_ca_system_score_gemma":0.0012754203,"threshold_uncertainty_score":0.010748029},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043085363,0.00063720596,0.9391129,0.0004559496,0.00011202873,0.00011862975,0.00038901053,0.005235251,0.010853642],"genre_scores_gemma":[0.5987864,0.0009949922,0.390032,0.00048694335,0.00008515397,0.00023153287,0.0006580054,0.0021399206,0.0065850546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978703,0.00038982334,0.00014705067,0.00021870884,0.0010497707,0.00032432843],"domain_scores_gemma":[0.9952076,0.0021418044,0.0005343205,0.0013870987,0.000677317,0.000051845065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001486805,0.0011690776,0.000450439,0.0010908108,0.0006669635,0.0020808468,0.0020170663,0.0008725421,0.0070282826],"category_scores_gemma":[0.008346581,0.0010337121,0.00088982517,0.00084779557,0.0010271843,0.004540446,0.0012341682,0.0027113599,0.0011048359],"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.0003304083,0.00018912736,0.006164771,0.0006645747,0.00009903867,0.0005001419,0.00040007482,0.5267425,0.069008164,0.2540875,0.005425816,0.1363879],"study_design_scores_gemma":[0.000019207115,0.00007787923,0.00046184222,0.000077070996,0.0000531267,0.00011498679,0.00005931665,0.8701848,0.069232725,0.04705254,0.012629468,0.000037103273],"about_ca_topic_score_codex":0.003193966,"about_ca_topic_score_gemma":0.0050561135,"teacher_disagreement_score":0.0070282826,"about_ca_system_score_codex":0.0015997696,"about_ca_system_score_gemma":0.0028985264,"threshold_uncertainty_score":0.023511946},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1208599,0.014624098,0.75382084,0.0091456985,0.00041665183,0.00017486552,0.00043727932,0.0019180063,0.09860262],"genre_scores_gemma":[0.9235371,0.006193874,0.056195438,0.00087758136,0.0004058522,0.0002006218,0.00015360747,0.00023927007,0.012196647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992673,0.00018743245,0.0000413706,0.00009128328,0.00022661232,0.00018604551],"domain_scores_gemma":[0.99803835,0.00086717505,0.00024312826,0.0003344216,0.00038663522,0.00013024446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082988135,0.00066995097,0.00041184318,0.00081513874,0.0007755388,0.0026392306,0.001105256,0.0012830275,0.005771325],"category_scores_gemma":[0.0029147894,0.00052609935,0.00046701657,0.0009026057,0.0020711669,0.0043521775,0.001110505,0.0014569924,0.0007508658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010550502,0.00006592017,0.002220184,0.0003091433,0.00005406562,0.0002321922,0.00034875344,0.17168424,0.0070946123,0.7800433,0.004258542,0.03358354],"study_design_scores_gemma":[0.000052874384,0.00034673174,0.0018789636,0.00016289984,0.000095541385,0.00037430783,0.00035441134,0.5292111,0.0056494814,0.40413707,0.057673533,0.0000630666],"about_ca_topic_score_codex":0.003867173,"about_ca_topic_score_gemma":0.0036571992,"teacher_disagreement_score":0.005771325,"about_ca_system_score_codex":0.0013962334,"about_ca_system_score_gemma":0.0014752215,"threshold_uncertainty_score":0.019307077},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02198978,0.000626909,0.97292197,0.00049695227,0.000048698887,0.00007708359,0.00032293476,0.0010833328,0.0024323694],"genre_scores_gemma":[0.83010256,0.0010575623,0.16036731,0.0002327203,0.00015456058,0.0005002039,0.000919451,0.0003023769,0.006363302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993705,0.00022718495,0.000028155757,0.0001373356,0.00015810561,0.00007874758],"domain_scores_gemma":[0.9982994,0.0011798196,0.00014879297,0.00016735817,0.00016621707,0.000038398954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012811823,0.0010968681,0.0008467219,0.0008826295,0.0004848447,0.0012230427,0.0014061274,0.0011547721,0.0022804628],"category_scores_gemma":[0.0057739224,0.0005817755,0.0010232623,0.00112779,0.0008524554,0.0014540732,0.0007167408,0.0020519989,0.0006820607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009183209,0.000015286554,0.00038892723,0.000013290044,0.000012231202,0.000009066999,0.000008802766,0.98981863,0.00018461494,0.0033202607,0.00027820253,0.0059414175],"study_design_scores_gemma":[7.720659e-7,0.0000018532825,0.000048345857,0.0000012443537,7.8937535e-7,0.0000014574783,0.0000010517504,0.9974903,0.00006012277,0.0022566991,0.00013622947,0.0000011030904],"about_ca_topic_score_codex":0.011263742,"about_ca_topic_score_gemma":0.006215225,"teacher_disagreement_score":0.011263742,"about_ca_system_score_codex":0.0015723768,"about_ca_system_score_gemma":0.00095460075,"threshold_uncertainty_score":0.022396326},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47087246,0.0009620192,0.48351142,0.0008468579,0.00025076666,0.00012712127,0.00097351935,0.0022280551,0.040227823],"genre_scores_gemma":[0.9219593,0.00042647912,0.06707004,0.000117392214,0.000032989887,0.00010890759,0.00032198048,0.00030010162,0.009662823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984205,0.00003403705,0.000006440518,0.000027498143,0.00005017227,0.00003978477],"domain_scores_gemma":[0.9997534,0.00007270723,0.000028656113,0.000037171754,0.00007839934,0.000029736353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024771516,0.00046621502,0.00035378328,0.00037100114,0.00029604768,0.0007833481,0.0011112305,0.0007450479,0.0029554162],"category_scores_gemma":[0.0010186839,0.00037404674,0.00037814624,0.0005101662,0.00041738,0.00076893857,0.00050902815,0.0007345214,0.000503589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004111409,0.000026719434,0.0013227174,0.000028401651,0.000010831226,0.00008598168,0.00003427998,0.9720172,0.0031362062,0.017103838,0.0013034226,0.0048891497],"study_design_scores_gemma":[0.0000029872615,0.00000471266,0.0000843708,0.0000014499391,0.0000013114295,0.000004712161,0.0000030973329,0.9976604,0.0003368738,0.0013707144,0.0005279419,0.0000014336468],"about_ca_topic_score_codex":0.010739701,"about_ca_topic_score_gemma":0.009825035,"teacher_disagreement_score":0.010739701,"about_ca_system_score_codex":0.0011481378,"about_ca_system_score_gemma":0.0010146792,"threshold_uncertainty_score":0.021354377},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88066816,0.0004998468,0.082701646,0.0006639708,0.00025378447,0.00024518845,0.0047540115,0.012620812,0.017592642],"genre_scores_gemma":[0.94618815,0.00023173395,0.045860384,0.00019092353,0.000020055102,0.00015009129,0.004528576,0.00074984157,0.0020802047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994112,0.00013823858,0.000040241688,0.00008903292,0.00022332746,0.00009791576],"domain_scores_gemma":[0.99827254,0.0007795821,0.00008441547,0.00033402606,0.00042718265,0.0001023028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007249145,0.00088053365,0.00045306864,0.000529969,0.00041340457,0.0007002098,0.0013782175,0.0007090289,0.0029537966],"category_scores_gemma":[0.0036544949,0.00041932438,0.00044094553,0.0010305326,0.0004203173,0.0011147711,0.0004447037,0.001069809,0.00058839755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003370952,0.0002847862,0.013295477,0.00018319582,0.000098867924,0.00018006586,0.00016619799,0.92896706,0.011781347,0.005013762,0.011960533,0.027731674],"study_design_scores_gemma":[0.000021437223,0.000052389707,0.0008829195,0.000004187762,0.00000753476,0.000010934421,0.00002172364,0.99319756,0.0034590121,0.000707315,0.00162814,0.000006793106],"about_ca_topic_score_codex":0.014240005,"about_ca_topic_score_gemma":0.013564096,"teacher_disagreement_score":0.014240005,"about_ca_system_score_codex":0.0013013051,"about_ca_system_score_gemma":0.0015566199,"threshold_uncertainty_score":0.028314233},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050632715,0.0028012067,0.90395874,0.001861721,0.00052906096,0.000077442615,0.00061346544,0.00946169,0.030063925],"genre_scores_gemma":[0.62229156,0.0016733996,0.35648754,0.0006489839,0.00012490114,0.00011367564,0.0010335101,0.000500897,0.017125456],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995964,0.000056806966,0.00001921776,0.000056933495,0.00020224082,0.00006842589],"domain_scores_gemma":[0.99937457,0.00021626976,0.00004311627,0.00014388589,0.00018568277,0.000036488284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005771382,0.0006824928,0.00040459816,0.00038543917,0.00022625588,0.0011102918,0.0016435565,0.00044630474,0.014972311],"category_scores_gemma":[0.0025803815,0.00035059114,0.00053845474,0.0007041654,0.00040174022,0.0018596028,0.0008833749,0.0016888693,0.0027400167],"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.00063637935,0.00018895087,0.0024190396,0.0005121387,0.00011879367,0.00015823885,0.000098280754,0.2701838,0.021597544,0.15288627,0.040172,0.51102865],"study_design_scores_gemma":[0.000044027947,0.00014434461,0.0003334037,0.000045311626,0.000025268784,0.00006536284,0.000020411537,0.9343583,0.015230354,0.031603586,0.018110743,0.00001888585],"about_ca_topic_score_codex":0.0030585742,"about_ca_topic_score_gemma":0.005793409,"teacher_disagreement_score":0.014972311,"about_ca_system_score_codex":0.0013020817,"about_ca_system_score_gemma":0.0009708211,"threshold_uncertainty_score":0.050087333},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9708384,0.00032076932,0.011279355,0.00023159143,0.0000880214,0.00013393926,0.0014741584,0.002447261,0.01318633],"genre_scores_gemma":[0.9877378,0.00010771517,0.0034013733,0.000048862712,0.000008335558,0.000069219,0.0008706443,0.00017495874,0.0075810044],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9996376,0.000028616392,0.000016659353,0.00007928987,0.0001594039,0.00007838959],"domain_scores_gemma":[0.9996722,0.00006647297,0.000015373773,0.00009351823,0.00012446838,0.000028074259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037550283,0.00035771378,0.00047182222,0.00018741317,0.0005468826,0.0006093758,0.00057445565,0.0003742481,0.016507069],"category_scores_gemma":[0.00078806345,0.0002359677,0.00035461548,0.0003500898,0.0002728543,0.00089923694,0.00043493081,0.00055945147,0.002940568],"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.0028805905,0.00039189402,0.0023617675,0.00035733113,0.00009248135,0.00020139673,0.00020027396,0.05570178,0.86073714,0.0008213331,0.0066579366,0.06959613],"study_design_scores_gemma":[0.00013265052,0.001628965,0.012423641,0.000011243884,0.00006328688,0.00010617558,0.00016051983,0.09602453,0.8766838,0.00043262637,0.012275459,0.000057178804],"about_ca_topic_score_codex":0.0027554964,"about_ca_topic_score_gemma":0.0032107471,"teacher_disagreement_score":0.016507069,"about_ca_system_score_codex":0.0006657337,"about_ca_system_score_gemma":0.0006056787,"threshold_uncertainty_score":0.055221617},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09799527,0.0015749612,0.6793881,0.00037989282,0.00029605138,0.00048249736,0.0020657992,0.18071884,0.037098616],"genre_scores_gemma":[0.6860535,0.0005498095,0.27254722,0.00049273466,0.00012396477,0.0011547522,0.0060635824,0.0042731706,0.028741283],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992918,0.00012335039,0.00006169563,0.00013335895,0.00027782278,0.000112004825],"domain_scores_gemma":[0.9989705,0.00018586012,0.000077750934,0.000394428,0.00029202254,0.000079504156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056209264,0.0008263037,0.00066827005,0.0006896694,0.0007567436,0.00094702246,0.003997082,0.00063149014,0.011340733],"category_scores_gemma":[0.0013798429,0.00046604706,0.000635193,0.0011155779,0.0004972045,0.0023413505,0.0018026695,0.0012241761,0.0035708125],"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.002156899,0.0013051364,0.007072184,0.0017640719,0.00044734505,0.00076997466,0.0006898317,0.14394648,0.19417337,0.061492033,0.14750709,0.43867552],"study_design_scores_gemma":[0.0003291696,0.00049752404,0.001528955,0.00006121345,0.00012137684,0.00029985473,0.000093663235,0.7584915,0.12742127,0.0074885725,0.1035391,0.00012785554],"about_ca_topic_score_codex":0.0032588276,"about_ca_topic_score_gemma":0.0042371927,"teacher_disagreement_score":0.011340733,"about_ca_system_score_codex":0.0011452433,"about_ca_system_score_gemma":0.0016553932,"threshold_uncertainty_score":0.037938535},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011425503,0.025025625,0.7016312,0.0023522396,0.001783778,0.000087011074,0.00062472984,0.003673927,0.25339603],"genre_scores_gemma":[0.24003717,0.029421622,0.38649625,0.0011944912,0.0017164064,0.00035933324,0.00273833,0.0019622683,0.3360742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996414,0.000052107593,0.000013377232,0.00005159584,0.00020528684,0.00003620944],"domain_scores_gemma":[0.9995672,0.000096190146,0.00001632237,0.0001836519,0.00011603975,0.000020502577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032079732,0.0008779082,0.00083693804,0.00061410485,0.00049915974,0.0016763821,0.0014098986,0.0007430565,0.021539293],"category_scores_gemma":[0.0017148325,0.00050693104,0.00038250006,0.001497585,0.0006630414,0.0029252267,0.0011825433,0.001958052,0.0075504924],"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.00017935531,0.000047393987,0.00021214476,0.00034549707,0.00005180163,0.000051876385,0.00008779938,0.047416404,0.004837578,0.4464431,0.090259135,0.4100679],"study_design_scores_gemma":[0.000033694716,0.00006924053,0.00035690184,0.0001705546,0.000048013866,0.00030263967,0.000044986842,0.16558187,0.008568849,0.43097767,0.39381403,0.000031495292],"about_ca_topic_score_codex":0.00094994996,"about_ca_topic_score_gemma":0.0015271795,"teacher_disagreement_score":0.021539293,"about_ca_system_score_codex":0.0010486935,"about_ca_system_score_gemma":0.00080980296,"threshold_uncertainty_score":0.072056115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021374738,0.00044561792,0.9703159,0.00041489082,0.00015029762,0.000086104934,0.00013457309,0.00245077,0.0046271468],"genre_scores_gemma":[0.21977481,0.00018526401,0.76994956,0.00053858914,0.000099819554,0.00028040068,0.00065253896,0.0019717172,0.0065473826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990085,0.00034207225,0.0000777255,0.00025267858,0.00021509727,0.00010394404],"domain_scores_gemma":[0.99754983,0.0015613113,0.0001345495,0.00036489946,0.00026654094,0.00012300484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023364327,0.0022980792,0.0029567415,0.0023897681,0.0010382101,0.0020679997,0.0018097527,0.0029958112,0.014636203],"category_scores_gemma":[0.010290098,0.0016672679,0.0016067147,0.0015426787,0.0014417514,0.002770636,0.002986094,0.0033081782,0.0030712308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006436342,0.0002504713,0.0013736873,0.00035148874,0.00019539792,0.00023757607,0.00022721072,0.5764237,0.005313766,0.04689321,0.018826375,0.34926355],"study_design_scores_gemma":[0.00007117677,0.00006738495,0.00012063123,0.000025301768,0.000016505017,0.0000326065,0.000030647217,0.9612436,0.0009239032,0.0363182,0.001138879,0.000011181196],"about_ca_topic_score_codex":0.0027831818,"about_ca_topic_score_gemma":0.0045451084,"teacher_disagreement_score":0.014636203,"about_ca_system_score_codex":0.0010257263,"about_ca_system_score_gemma":0.001604368,"threshold_uncertainty_score":0.04896295},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27520543,0.0008826526,0.576892,0.0007778458,0.00035038666,0.00025187078,0.0012147654,0.09362575,0.050799362],"genre_scores_gemma":[0.596224,0.0002673724,0.38119224,0.00034109084,0.000041661977,0.0003797699,0.0026010172,0.005751741,0.013201202],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99904317,0.00015886307,0.00006973546,0.000117012896,0.00045434912,0.00015679828],"domain_scores_gemma":[0.9978638,0.0004221646,0.0001133564,0.0005721411,0.00089637196,0.00013221789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081445556,0.00074258714,0.0005785884,0.00051879947,0.00071485154,0.0013843225,0.0027000823,0.00075687986,0.004731177],"category_scores_gemma":[0.0037626314,0.0005003442,0.0005132728,0.0009728933,0.0005793397,0.0010565604,0.0009401758,0.00120749,0.001974758],"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.0024711639,0.000675662,0.01667373,0.0007426224,0.00026528077,0.002029283,0.001818426,0.276409,0.1253023,0.055971555,0.12733805,0.39030293],"study_design_scores_gemma":[0.00019012112,0.0001827331,0.00320135,0.000061965286,0.000041710573,0.00024389042,0.0001288735,0.87837344,0.052810848,0.007663011,0.057019822,0.000082250604],"about_ca_topic_score_codex":0.01284562,"about_ca_topic_score_gemma":0.018474482,"teacher_disagreement_score":0.01284562,"about_ca_system_score_codex":0.0015545749,"about_ca_system_score_gemma":0.0025837547,"threshold_uncertainty_score":0.025541663},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041761428,0.0002062268,0.9005793,0.0001587136,0.00014832357,0.00040226005,0.0010554176,0.041576423,0.014111966],"genre_scores_gemma":[0.30452132,0.00028384282,0.6712412,0.00022454456,0.00004963981,0.0007932218,0.0033848116,0.0058425264,0.013658844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948287,0.00006669397,0.000038129696,0.0000815631,0.00025309724,0.0000776802],"domain_scores_gemma":[0.99927765,0.00026947088,0.00005287496,0.00017629357,0.00017432978,0.000049445083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066878076,0.00079115864,0.0003432223,0.00060159765,0.0003088217,0.00068878033,0.0012161001,0.00043416134,0.010856254],"category_scores_gemma":[0.0019195727,0.00052630523,0.000800373,0.00041021002,0.000461221,0.0009070396,0.0012677007,0.0011133384,0.00269395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008761585,0.00049677613,0.00500458,0.0012522988,0.00013788254,0.00084079936,0.00051633146,0.2455715,0.21015838,0.078525305,0.042668503,0.41395155],"study_design_scores_gemma":[0.0002873771,0.00047905985,0.00083498383,0.000074876705,0.000050312,0.00023803164,0.000060143437,0.714878,0.18430573,0.025809329,0.07292965,0.000052404135],"about_ca_topic_score_codex":0.0007995025,"about_ca_topic_score_gemma":0.001080988,"teacher_disagreement_score":0.010856254,"about_ca_system_score_codex":0.00043788174,"about_ca_system_score_gemma":0.0012900513,"threshold_uncertainty_score":0.036317766},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12991507,0.38939756,0.14423561,0.18556201,0.0062593664,0.0002755846,0.001624342,0.0037559513,0.13897458],"genre_scores_gemma":[0.6677483,0.16080661,0.13028093,0.008301634,0.0028963683,0.0005021471,0.001245241,0.00048453166,0.027734254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890375,0.00019350256,0.00004867849,0.00016997854,0.0004542402,0.00022982375],"domain_scores_gemma":[0.9964743,0.0012835832,0.00026855455,0.00036718117,0.0011631895,0.00044308353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025632484,0.000942102,0.0008806751,0.0008215714,0.0014686183,0.003389028,0.0038306983,0.004191809,0.015196955],"category_scores_gemma":[0.0042952076,0.00068109157,0.00057254604,0.0011643809,0.0016543831,0.010999728,0.002655357,0.0027063014,0.0033473596],"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.00043158646,0.0005580304,0.0037139405,0.003970631,0.0001559424,0.0014412993,0.0008425815,0.08842405,0.034796312,0.37535438,0.13695699,0.3533543],"study_design_scores_gemma":[0.000081961014,0.00056927255,0.0022303993,0.0016390656,0.00013785115,0.002219454,0.0050720493,0.16679834,0.03376228,0.27345988,0.5137454,0.0002840275],"about_ca_topic_score_codex":0.001959343,"about_ca_topic_score_gemma":0.0034439808,"teacher_disagreement_score":0.015196955,"about_ca_system_score_codex":0.0011364883,"about_ca_system_score_gemma":0.0023657829,"threshold_uncertainty_score":0.050838888},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7875953,0.00037401528,0.20665975,0.00016565518,0.00004749985,0.000052226125,0.00007261176,0.00067649793,0.0043564755],"genre_scores_gemma":[0.9904941,0.000043737557,0.008885977,0.000018260333,0.000005631414,0.000013866157,0.000030495086,0.000034417328,0.00047353675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997851,0.000049010843,0.000008655533,0.000054015887,0.000046797122,0.000056317927],"domain_scores_gemma":[0.99967396,0.00013268505,0.0000535489,0.00005889717,0.00004631886,0.000034595934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033672273,0.0005668611,0.00038399728,0.00019663043,0.00041969953,0.00050400215,0.0004726435,0.0002535351,0.0006366461],"category_scores_gemma":[0.00095317746,0.00027320153,0.00020172916,0.0002637762,0.00038711505,0.00050029677,0.00046088523,0.00030108102,0.000158374],"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.00009082143,0.000036690242,0.0017964639,0.000024625593,0.000012396184,0.00007276386,0.000028750615,0.9704029,0.016349247,0.00034913264,0.00021948467,0.010616765],"study_design_scores_gemma":[0.0000056985054,0.00008461829,0.0011041269,0.0000022849922,0.000009149283,0.000024680436,0.00003027852,0.9928988,0.005055985,0.0005234442,0.0002557355,0.000005224656],"about_ca_topic_score_codex":0.0039528306,"about_ca_topic_score_gemma":0.005346759,"teacher_disagreement_score":0.0039528306,"about_ca_system_score_codex":0.0006497035,"about_ca_system_score_gemma":0.0005671659,"threshold_uncertainty_score":0.007859647},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11978964,0.0012476415,0.40694097,0.0027117545,0.0018350539,0.0015948021,0.016066791,0.2559773,0.19383602],"genre_scores_gemma":[0.6182014,0.0008760507,0.25708252,0.001636167,0.0004733625,0.0007398261,0.040335968,0.010459389,0.07019537],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993069,0.000062357845,0.000030835476,0.00016624937,0.0003063696,0.00012727588],"domain_scores_gemma":[0.99888283,0.000118836964,0.000043243268,0.00043047225,0.00029522873,0.00022939325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013373763,0.0005217845,0.00047737538,0.0006741407,0.0006424874,0.0018151937,0.0019309829,0.00042950746,0.024713919],"category_scores_gemma":[0.0031505208,0.00040908303,0.00041247773,0.0005999631,0.0005971478,0.0018719995,0.0017546128,0.0011364137,0.004674072],"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.0042813616,0.0007578721,0.0065550627,0.0004147764,0.00021423347,0.00031674685,0.00044651027,0.047561612,0.07332866,0.110323295,0.44242865,0.3133714],"study_design_scores_gemma":[0.000768875,0.0005259232,0.0028448512,0.0000987441,0.00007877094,0.00021473717,0.00013310299,0.49901357,0.056428242,0.05422152,0.38553092,0.00014066901],"about_ca_topic_score_codex":0.011500036,"about_ca_topic_score_gemma":0.008755095,"teacher_disagreement_score":0.024713919,"about_ca_system_score_codex":0.001520638,"about_ca_system_score_gemma":0.0027976513,"threshold_uncertainty_score":0.08267623},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003657664,0.0007061721,0.8570363,0.00034025582,0.0004319791,0.000097739474,0.001256314,0.10213354,0.034339983],"genre_scores_gemma":[0.0807899,0.0015747332,0.6783992,0.0009914901,0.00024092464,0.00031620913,0.008857609,0.09071804,0.13811181],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99821657,0.00028493002,0.00016558943,0.00038884697,0.0008258731,0.00011809226],"domain_scores_gemma":[0.99655885,0.0009207239,0.00012456924,0.0015911185,0.0007614224,0.000043289834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012111957,0.0017390911,0.00080872374,0.0014696878,0.0006372839,0.0018793116,0.0028879014,0.0009253439,0.060570378],"category_scores_gemma":[0.007501434,0.0009570449,0.0016662723,0.0011359736,0.0007255988,0.0029586763,0.0023833436,0.0023599884,0.046807606],"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.00019795449,0.00006779527,0.00058851554,0.0008562426,0.00009309208,0.0005766427,0.00040411294,0.008518687,0.020443399,0.072122045,0.10701183,0.78911966],"study_design_scores_gemma":[0.00008134403,0.000067962435,0.00046812758,0.0004153571,0.00015009432,0.0015313505,0.00012751757,0.046522405,0.11384305,0.09238273,0.7442975,0.00011258089],"about_ca_topic_score_codex":0.0014156597,"about_ca_topic_score_gemma":0.0018634486,"teacher_disagreement_score":0.060570378,"about_ca_system_score_codex":0.0006539673,"about_ca_system_score_gemma":0.000834918,"threshold_uncertainty_score":0.20262808},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052027542,0.00063850696,0.8675795,0.00056578516,0.000319222,0.00018478323,0.0020248408,0.028068023,0.048591826],"genre_scores_gemma":[0.36483026,0.00055577117,0.61069554,0.0004270558,0.00013063464,0.00036694057,0.003972251,0.0020174228,0.017004207],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991768,0.00010873788,0.00005795544,0.00011794124,0.00042429767,0.00011421145],"domain_scores_gemma":[0.9990056,0.00021145152,0.00005017866,0.00035652937,0.00030959124,0.00006661421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037805559,0.00087214395,0.00068311393,0.0009678441,0.00077430636,0.0017819903,0.0017005525,0.0006849216,0.01791273],"category_scores_gemma":[0.0023497618,0.00042847224,0.00074838125,0.0019025448,0.0007081095,0.0020567088,0.0020184894,0.001275885,0.004682669],"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.0005097764,0.00016947207,0.0027442228,0.00045341792,0.00012247241,0.0005319804,0.00092034985,0.14891623,0.05750535,0.22247611,0.106541894,0.45910874],"study_design_scores_gemma":[0.00013616042,0.00011815682,0.0010142451,0.000052406533,0.000023561042,0.00018169313,0.00017442275,0.79158914,0.028912824,0.08688321,0.090856,0.00005818926],"about_ca_topic_score_codex":0.008859682,"about_ca_topic_score_gemma":0.009003939,"teacher_disagreement_score":0.01791273,"about_ca_system_score_codex":0.0011823125,"about_ca_system_score_gemma":0.00126434,"threshold_uncertainty_score":0.059924006},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17940089,0.0015814736,0.80543405,0.0004474876,0.00009763016,0.00006768031,0.0002241947,0.0015335398,0.0112130875],"genre_scores_gemma":[0.806976,0.0005060839,0.1887218,0.0001847482,0.00002701273,0.00011346609,0.00027377935,0.00009215971,0.0031048395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991953,0.000013322101,0.000004870195,0.000018607156,0.000028497589,0.000015124668],"domain_scores_gemma":[0.9999237,0.000010968064,0.000014923837,0.000015626703,0.000025078603,0.0000097928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000099663375,0.00037830288,0.00030621592,0.00028390583,0.0002986524,0.00041086893,0.0009091019,0.00039519486,0.0015383748],"category_scores_gemma":[0.00023840324,0.0001967617,0.0004397654,0.00029457267,0.00017622381,0.00048467785,0.0005811634,0.00030277012,0.00030731532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001009333,0.000059143716,0.001243044,0.00012391174,0.0000754836,0.0003135459,0.00006344372,0.8218156,0.08492645,0.00827974,0.0029659173,0.08003276],"study_design_scores_gemma":[0.000011051487,0.00009757187,0.00057814637,0.000007633243,0.000025616593,0.00009681478,0.00002132795,0.9889448,0.005045593,0.0016556906,0.0035017007,0.000014088005],"about_ca_topic_score_codex":0.001885243,"about_ca_topic_score_gemma":0.004455208,"teacher_disagreement_score":0.001885243,"about_ca_system_score_codex":0.00037856624,"about_ca_system_score_gemma":0.00047364095,"threshold_uncertainty_score":0.0051463246},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17008474,0.00055683486,0.8114234,0.0003321281,0.00015683609,0.00029381458,0.00017069625,0.0077598453,0.009221687],"genre_scores_gemma":[0.6292121,0.00035767973,0.36152166,0.0003189281,0.000049790335,0.00019894169,0.00046305955,0.0005461876,0.007331671],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995609,0.00006597066,0.000027975111,0.0000842116,0.0001376601,0.00012323051],"domain_scores_gemma":[0.9996226,0.00005353135,0.00005724833,0.000121755416,0.00006910473,0.00007583325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049701496,0.0008204655,0.00031562222,0.0005828389,0.0005612075,0.0010596067,0.0016402963,0.00040535384,0.002842519],"category_scores_gemma":[0.00075003656,0.0004504272,0.00045744126,0.00030882025,0.0005008462,0.0018490648,0.0015319312,0.0008757601,0.00076142995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009853035,0.00053152605,0.011712771,0.0007183301,0.00043409452,0.0012071955,0.0007418253,0.19981252,0.29845187,0.05779892,0.013995726,0.41360986],"study_design_scores_gemma":[0.00027564837,0.0018236736,0.009411482,0.00016398565,0.00037273928,0.0010948648,0.00043791102,0.52479696,0.32470843,0.017752884,0.11888143,0.0002799489],"about_ca_topic_score_codex":0.0017626482,"about_ca_topic_score_gemma":0.002776912,"teacher_disagreement_score":0.002842519,"about_ca_system_score_codex":0.00072270207,"about_ca_system_score_gemma":0.0009604938,"threshold_uncertainty_score":0.009509146},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028106468,0.0046839733,0.08962101,0.03405091,0.044019237,0.0051447777,0.17169279,0.05861765,0.5640632],"genre_scores_gemma":[0.06739348,0.0022786749,0.03587636,0.005395542,0.0075826063,0.002593241,0.18619135,0.014928753,0.67775995],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973137,0.00039999434,0.00012109827,0.00052798097,0.0012056354,0.00043148643],"domain_scores_gemma":[0.994288,0.0006871023,0.00018917346,0.0011062414,0.0021434394,0.0015859647],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004748919,0.0015959288,0.0013001442,0.0014933201,0.0030329693,0.006113378,0.0018229194,0.0030211073,0.38156947],"category_scores_gemma":[0.0064041126,0.0006394327,0.0012733435,0.0019832323,0.0006570435,0.0036413008,0.0068445397,0.0030267038,0.2417818],"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.00035731253,0.00009669881,0.0013038011,0.0002325496,0.000019735051,0.00008103147,0.00026815402,0.00039533168,0.003487454,0.001463836,0.929346,0.06294811],"study_design_scores_gemma":[0.0000609383,0.000059428483,0.001913033,0.0000637132,0.00000866119,0.00006457967,0.00019292234,0.00062236073,0.0017011937,0.0019165865,0.993371,0.000025479436],"about_ca_topic_score_codex":0.0071760225,"about_ca_topic_score_gemma":0.011447889,"teacher_disagreement_score":0.38156947,"about_ca_system_score_codex":0.001591323,"about_ca_system_score_gemma":0.0035678216,"threshold_uncertainty_score":0.8821161},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51414376,0.004318798,0.4165171,0.0017819987,0.0007011796,0.0006522288,0.00080874003,0.009117861,0.051958364],"genre_scores_gemma":[0.8648926,0.00046927587,0.12307506,0.00023112679,0.00009787158,0.00035478768,0.0005765125,0.0003692047,0.009933594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990626,0.00031521358,0.0000643914,0.00014580895,0.00017309363,0.00023896628],"domain_scores_gemma":[0.99519736,0.0014316236,0.00027772182,0.0019971787,0.0007371803,0.0003588566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018091695,0.0008143728,0.0006406838,0.0009616641,0.0012065369,0.0023300503,0.0031991897,0.00073712855,0.011461886],"category_scores_gemma":[0.006446624,0.00046639238,0.0005586232,0.00095302315,0.000770513,0.0037654957,0.0022387477,0.0008102244,0.0023407892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0056379572,0.0019236245,0.011834758,0.0010654645,0.00029066936,0.0005363954,0.0010444586,0.088046335,0.12361943,0.08664381,0.03772001,0.6416371],"study_design_scores_gemma":[0.0010085601,0.0021628563,0.005601064,0.00031355387,0.00069396565,0.00061035145,0.0010047115,0.57396996,0.29663077,0.062262055,0.05562452,0.00011763357],"about_ca_topic_score_codex":0.0015895466,"about_ca_topic_score_gemma":0.0019602168,"teacher_disagreement_score":0.011461886,"about_ca_system_score_codex":0.00064704014,"about_ca_system_score_gemma":0.0021121406,"threshold_uncertainty_score":0.038343847},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014216194,0.05545057,0.28196228,0.05196808,0.0694032,0.00086871145,0.0053075245,0.011166887,0.50965655],"genre_scores_gemma":[0.024946181,0.032826673,0.049386892,0.0023350085,0.008027798,0.00039051299,0.009948977,0.0045470507,0.8675908],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976943,0.00056699716,0.00020725586,0.0002618426,0.0010263408,0.000243239],"domain_scores_gemma":[0.9949503,0.0012441414,0.00013798398,0.00090632157,0.0018335526,0.0009276994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004552925,0.0010694346,0.0011154558,0.0014402035,0.0013139672,0.006301856,0.0014287668,0.0012070467,0.1332172],"category_scores_gemma":[0.0052229986,0.000599725,0.00073336385,0.0020359976,0.0014794687,0.00429064,0.0029739507,0.00467941,0.06481336],"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.00012733269,0.00015723384,0.00049655663,0.00039657118,0.000035785335,0.00012701045,0.00034811837,0.0007931102,0.0024554264,0.017759545,0.7873741,0.18992922],"study_design_scores_gemma":[0.000011864564,0.000032425014,0.00043120258,0.00014355883,0.00001056396,0.00010469208,0.00008671427,0.0012856573,0.00072570774,0.0037593127,0.99339664,0.000011645251],"about_ca_topic_score_codex":0.004627104,"about_ca_topic_score_gemma":0.008566612,"teacher_disagreement_score":0.1332172,"about_ca_system_score_codex":0.0016530614,"about_ca_system_score_gemma":0.003149338,"threshold_uncertainty_score":0.44565594},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4607482,0.00074639585,0.48396865,0.0006809275,0.00035600876,0.00014062699,0.00082451897,0.007665295,0.04486937],"genre_scores_gemma":[0.8657169,0.000066357934,0.1255936,0.00017574361,0.00003387248,0.000072285475,0.0005921677,0.00044777885,0.007301254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998518,0.00002801933,0.0000034090253,0.00003559061,0.000033873755,0.000047222304],"domain_scores_gemma":[0.9998379,0.00005302128,0.000008018928,0.000027201935,0.000048359783,0.0000254502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026067958,0.0005719071,0.0008474761,0.00024042912,0.00056406227,0.0005797087,0.0010095888,0.0007572716,0.0111212935],"category_scores_gemma":[0.00060618576,0.00025558134,0.0004720265,0.00044868156,0.0002997935,0.0006333158,0.00065931765,0.00066802173,0.0008575158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033303152,0.000103740895,0.00083515106,0.000072104216,0.00004570085,0.00011041054,0.000059452377,0.9103058,0.005986307,0.0025548115,0.0072426787,0.07235087],"study_design_scores_gemma":[0.000023168177,0.000035759258,0.00018520221,0.0000021089968,0.0000062849263,0.0000071375703,0.000027844984,0.99770963,0.000579128,0.00072826166,0.0006927121,0.0000027703156],"about_ca_topic_score_codex":0.01548475,"about_ca_topic_score_gemma":0.029590394,"teacher_disagreement_score":0.01548475,"about_ca_system_score_codex":0.0006367566,"about_ca_system_score_gemma":0.0014692995,"threshold_uncertainty_score":0.037204444},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022532087,0.00007093172,0.9725408,0.00006849468,0.00002321942,0.00006045994,0.000040256076,0.0015584523,0.0031053985],"genre_scores_gemma":[0.27166557,0.00007898249,0.7250179,0.00007476144,0.000027046162,0.00016684976,0.00015185963,0.00040603214,0.0024109997],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962366,0.000059104077,0.000021200984,0.00008789131,0.00014101763,0.00006711096],"domain_scores_gemma":[0.999534,0.00011210379,0.00005656017,0.0001844254,0.00009106111,0.000021880065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005157207,0.0005089685,0.0003941882,0.000358493,0.00031820303,0.00060079945,0.0008113609,0.00028321295,0.0027260738],"category_scores_gemma":[0.0013617935,0.00033231647,0.0006398661,0.00040080515,0.00077080826,0.00062551803,0.00079319073,0.00062952994,0.00069851923],"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.00029317627,0.00020843821,0.001678154,0.00057293876,0.00011135327,0.00046642512,0.00055804243,0.25034094,0.23561898,0.15760364,0.0056706388,0.34687737],"study_design_scores_gemma":[0.00008990044,0.00020425674,0.00043180241,0.000031729942,0.000060876275,0.00018808508,0.00004787096,0.7942264,0.122420505,0.06548185,0.016791882,0.000024926263],"about_ca_topic_score_codex":0.0006055356,"about_ca_topic_score_gemma":0.0009196553,"teacher_disagreement_score":0.0027260738,"about_ca_system_score_codex":0.00037405815,"about_ca_system_score_gemma":0.00068372424,"threshold_uncertainty_score":0.00911963},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09628931,0.0016523505,0.8276628,0.00084569614,0.0006279962,0.00030903658,0.0010849994,0.024953404,0.046574283],"genre_scores_gemma":[0.31269684,0.000858388,0.66621673,0.00029130935,0.000059451737,0.0003719272,0.0019172974,0.0011219293,0.016466135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995202,0.00006447837,0.000028692055,0.00011320235,0.0001992182,0.00007417848],"domain_scores_gemma":[0.99947757,0.00011114219,0.000027047197,0.00010815649,0.00024171316,0.000034384964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039356542,0.00073154416,0.0005271178,0.00064870797,0.0005692139,0.001175289,0.0015706426,0.00059039716,0.012115694],"category_scores_gemma":[0.0015138052,0.00039840385,0.00061083504,0.0011166603,0.00037953575,0.0012352649,0.00071734004,0.001088875,0.0035510443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011651497,0.0002988583,0.005400842,0.00086394965,0.0002313474,0.00067099475,0.00071667676,0.24195209,0.06972647,0.057579212,0.072522655,0.5488717],"study_design_scores_gemma":[0.0001807663,0.00022724718,0.001166507,0.000065232394,0.000054215514,0.00020544251,0.00013948743,0.8835772,0.032952596,0.016449342,0.06493836,0.000043618104],"about_ca_topic_score_codex":0.010349586,"about_ca_topic_score_gemma":0.010377839,"teacher_disagreement_score":0.012115694,"about_ca_system_score_codex":0.0012070506,"about_ca_system_score_gemma":0.0014733193,"threshold_uncertainty_score":0.04053104},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032161988,0.00078544527,0.0049638166,0.0833851,0.90415204,0.000027105445,0.0016999823,0.0015118449,0.003152998],"genre_scores_gemma":[0.06747274,0.0060182977,0.025321795,0.11374724,0.5458857,0.00030074146,0.003935505,0.004462318,0.23285577],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99540555,0.0006301033,0.00066103693,0.0009449738,0.0016972333,0.0006611406],"domain_scores_gemma":[0.97085255,0.008206217,0.0010293898,0.0030386306,0.015550535,0.0013226724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031444752,0.0020800151,0.0024457704,0.0031000373,0.0036247014,0.0038499704,0.0035482566,0.007653548,0.08594985],"category_scores_gemma":[0.06675006,0.0011785008,0.0020558243,0.0030184344,0.0034167334,0.0032804173,0.0020389967,0.012241649,0.038939804],"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.00005610765,0.000008479086,0.00007711242,0.00010865627,0.000020212434,0.00024384513,0.00003199357,0.0001446411,0.00009515922,0.0038323882,0.9881274,0.007253862],"study_design_scores_gemma":[0.00009223451,0.000035239904,0.0008289975,0.00015655317,0.000054085584,0.00094791764,0.000087259374,0.002066365,0.0009904553,0.015285992,0.9793767,0.000078183446],"about_ca_topic_score_codex":0.013365142,"about_ca_topic_score_gemma":0.011900154,"teacher_disagreement_score":0.08594985,"about_ca_system_score_codex":0.005033684,"about_ca_system_score_gemma":0.0053089084,"threshold_uncertainty_score":0.2875309},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028346304,0.000046601745,0.96736664,0.0002807426,0.000114739,0.000106694424,0.00037145911,0.015377213,0.01350123],"genre_scores_gemma":[0.12893735,0.00017065222,0.8327046,0.0007713897,0.000107347514,0.00053227076,0.0024801684,0.009783625,0.024512533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997843,0.0007069195,0.00021472221,0.0002988672,0.00070690777,0.00022956371],"domain_scores_gemma":[0.9977697,0.0007989494,0.00008622336,0.0009160114,0.00036243862,0.00006666524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025119795,0.0008058578,0.00054765726,0.001038447,0.00073240424,0.002529056,0.0025054144,0.0010104269,0.023868302],"category_scores_gemma":[0.005906288,0.00058220734,0.0012589217,0.0007017904,0.0014780578,0.0045448085,0.003547122,0.0026641404,0.0060102954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041144327,0.00015566753,0.0006799191,0.00051568664,0.000054059554,0.0004449887,0.0008142383,0.014141522,0.008969507,0.69080555,0.038994253,0.24401319],"study_design_scores_gemma":[0.00016731561,0.00015872139,0.00022454724,0.00017545666,0.00008163345,0.0004883022,0.00025669805,0.17487702,0.038665514,0.46169516,0.32313368,0.00007596249],"about_ca_topic_score_codex":0.0011189193,"about_ca_topic_score_gemma":0.001873859,"teacher_disagreement_score":0.023868302,"about_ca_system_score_codex":0.0008018516,"about_ca_system_score_gemma":0.001528793,"threshold_uncertainty_score":0.079847395},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040326122,0.00027043192,0.9072047,0.000418961,0.00015108997,0.00039627898,0.00019477474,0.045137085,0.005900535],"genre_scores_gemma":[0.2930716,0.0004360968,0.6843499,0.00063836825,0.0001629786,0.0010325547,0.0008664743,0.007659805,0.011782174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973236,0.00074329006,0.00035651884,0.00028131992,0.0009929398,0.00030230772],"domain_scores_gemma":[0.993457,0.0014894841,0.00048381192,0.0034767718,0.0008657299,0.0002271882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004096648,0.0009292969,0.0005729489,0.00088693073,0.00072722323,0.0027191471,0.003019802,0.0012377559,0.0025235226],"category_scores_gemma":[0.010198056,0.0010300698,0.0007267586,0.00074970606,0.0014666127,0.0048640557,0.0045556617,0.0034649463,0.0021320009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013984084,0.0011031074,0.013365159,0.0015935501,0.00029132952,0.0013758985,0.0031236785,0.09105759,0.16211662,0.22716649,0.03992325,0.4574849],"study_design_scores_gemma":[0.00021707981,0.00037155746,0.0024309715,0.0002615061,0.00018530045,0.00063649553,0.000460876,0.48673132,0.2472044,0.078453906,0.18275645,0.00029008862],"about_ca_topic_score_codex":0.00059549813,"about_ca_topic_score_gemma":0.0008422518,"teacher_disagreement_score":0.004096648,"about_ca_system_score_codex":0.00065992307,"about_ca_system_score_gemma":0.0014453923,"threshold_uncertainty_score":0.021665394},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021826776,0.00055082963,0.96611005,0.00012262103,0.00023617077,0.0002170226,0.00009217024,0.0029914605,0.0078529725],"genre_scores_gemma":[0.45814365,0.00076287665,0.52271664,0.00042572914,0.00014350729,0.00058369804,0.00039029118,0.0014084956,0.015425151],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980007,0.00030099577,0.00019875795,0.000551354,0.0006091025,0.0003390282],"domain_scores_gemma":[0.99754673,0.0006465902,0.00021295527,0.0011085469,0.00035447947,0.00013060933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011450857,0.00087379926,0.0007796621,0.00078080525,0.0011074888,0.0014908364,0.0014050737,0.00056468655,0.0065061557],"category_scores_gemma":[0.003693711,0.0006118168,0.000998764,0.0010676176,0.0009750289,0.0025700417,0.0020996642,0.0015210934,0.0012819695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080285675,0.00038386605,0.0036680826,0.00061611284,0.0001857546,0.00050433754,0.0010419587,0.074197054,0.104470715,0.21434063,0.008856391,0.59093225],"study_design_scores_gemma":[0.00022363084,0.00067909417,0.0011771229,0.0001569745,0.00036966137,0.0007728431,0.0002855823,0.3941354,0.2477658,0.17103943,0.18319927,0.00019528826],"about_ca_topic_score_codex":0.0022634906,"about_ca_topic_score_gemma":0.003677754,"teacher_disagreement_score":0.0065061557,"about_ca_system_score_codex":0.0007516136,"about_ca_system_score_gemma":0.0020885495,"threshold_uncertainty_score":0.021765232},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6455802,0.025826922,0.27566543,0.0006510794,0.0006271586,0.000045557885,0.00026934105,0.0027021891,0.04863215],"genre_scores_gemma":[0.9663833,0.0020189981,0.021493498,0.00006782619,0.00006355344,0.00001608327,0.00011466096,0.00011038451,0.009731716],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99995553,0.0000049630116,0.0000024370681,0.000008233888,0.000016337932,0.000012597938],"domain_scores_gemma":[0.99984896,0.000050996612,0.000020164192,0.000032315227,0.000037796148,0.000009744159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009784062,0.0002187212,0.00018275288,0.00022156822,0.00021002101,0.00046471623,0.00054727733,0.00019355355,0.0021408661],"category_scores_gemma":[0.00026066962,0.0000973253,0.0001325064,0.00036340588,0.000118807904,0.0007718281,0.00029235455,0.00032765677,0.00028653155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003681556,0.00013853436,0.00086639693,0.00038182863,0.000049556227,0.00018420082,0.00017287751,0.027351622,0.6674845,0.025248984,0.005380689,0.27237254],"study_design_scores_gemma":[0.000039775343,0.0006214883,0.0017852128,0.00007252867,0.00014588077,0.00084102043,0.00011497003,0.33325678,0.610241,0.017383454,0.035457205,0.00004074543],"about_ca_topic_score_codex":0.00023674266,"about_ca_topic_score_gemma":0.00080642436,"teacher_disagreement_score":0.0021408661,"about_ca_system_score_codex":0.0002856816,"about_ca_system_score_gemma":0.00023043575,"threshold_uncertainty_score":0.007161975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010875358,0.0021397343,0.015390866,0.0010421741,0.0014028987,0.00014719571,0.0020678446,0.0034943284,0.9732274],"genre_scores_gemma":[0.0048712827,0.0011677606,0.0065854355,0.0005025904,0.00020386802,0.000104932056,0.0018138225,0.0014636262,0.9832866],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99983525,0.000016806054,0.000006233416,0.00003595608,0.00008179311,0.000024054054],"domain_scores_gemma":[0.9997825,0.000032239757,0.0000058764945,0.000027718717,0.00007759486,0.00007408115],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019129993,0.0011225588,0.0004085945,0.00095450564,0.00085351686,0.0033324347,0.0010858683,0.0010574416,0.30116028],"category_scores_gemma":[0.00075506704,0.00040453626,0.00037509212,0.0008182107,0.00038898297,0.0025667434,0.0017356954,0.0014699048,0.16154802],"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.000055432633,0.000045607598,0.000047637488,0.00017042062,0.0000032367116,0.00006130768,0.0001483208,0.00016243641,0.0013200319,0.034759082,0.80349696,0.1597296],"study_design_scores_gemma":[0.0000056495846,0.00001376657,0.00010806892,0.000034823795,0.0000012506181,0.00011101461,0.00001904454,0.00010668343,0.00034030082,0.002955766,0.99629956,0.0000041625094],"about_ca_topic_score_codex":0.0017783594,"about_ca_topic_score_gemma":0.0037821252,"teacher_disagreement_score":0.30116028,"about_ca_system_score_codex":0.0007491051,"about_ca_system_score_gemma":0.0005421408,"threshold_uncertainty_score":0.9968101},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087392725,0.00033654325,0.90022653,0.00019576888,0.00012435416,0.00012974934,0.000112138245,0.0013371257,0.010145092],"genre_scores_gemma":[0.4834832,0.0002538651,0.50498694,0.000086636996,0.000047378315,0.00021429216,0.00031797934,0.0003366645,0.010273049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946696,0.0001434555,0.000035773766,0.000072666655,0.00013100609,0.00015017272],"domain_scores_gemma":[0.99953485,0.000101507365,0.00003946924,0.00014222207,0.0001267189,0.000055382254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047510306,0.00075231225,0.00081844383,0.0005512147,0.0007468741,0.0008140416,0.0018473318,0.0004557267,0.005432593],"category_scores_gemma":[0.0010994398,0.00036173436,0.0004052899,0.0008451737,0.0006059209,0.0009525143,0.00077752635,0.0006531722,0.0011807143],"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.001189325,0.00028130057,0.0008562214,0.0003280024,0.000088030116,0.00035326427,0.0005298087,0.4451393,0.04073269,0.17864849,0.013552266,0.31830135],"study_design_scores_gemma":[0.00016822861,0.00020823623,0.0002554222,0.000014764014,0.000028380864,0.00009532077,0.0000605965,0.9221115,0.024029125,0.041427013,0.01155892,0.000042505497],"about_ca_topic_score_codex":0.0042129843,"about_ca_topic_score_gemma":0.0068068,"teacher_disagreement_score":0.005432593,"about_ca_system_score_codex":0.0010766551,"about_ca_system_score_gemma":0.0018015561,"threshold_uncertainty_score":0.018173873},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06717582,0.002229298,0.91652435,0.00077921123,0.00014739727,0.00006131953,0.00011527692,0.002138561,0.010828893],"genre_scores_gemma":[0.60290635,0.0010770427,0.38719472,0.00017323102,0.0001373911,0.00013666558,0.00025856777,0.00031105487,0.0078050145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938416,0.00018937052,0.000027366124,0.00011280568,0.00017645097,0.00010984557],"domain_scores_gemma":[0.99938285,0.00024357378,0.00006061886,0.00018820021,0.000079053985,0.000045600947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044527208,0.00063047867,0.0006100906,0.000736651,0.001034524,0.0009259701,0.0011386105,0.00065295154,0.0024693487],"category_scores_gemma":[0.0022291488,0.00034520746,0.00028778487,0.0020707469,0.0005069393,0.0012903147,0.0012426013,0.00085993984,0.00067266624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035342664,0.00008732944,0.0011320735,0.0001562578,0.000042320145,0.00006435622,0.00016874369,0.6761813,0.01095866,0.06360561,0.0144653665,0.23278454],"study_design_scores_gemma":[0.000018494839,0.000026651569,0.000158398,0.00000576374,0.0000068403824,0.00003106994,0.000028088902,0.95731753,0.0036958647,0.032479495,0.006224994,0.000006789623],"about_ca_topic_score_codex":0.002717587,"about_ca_topic_score_gemma":0.0037497715,"teacher_disagreement_score":0.002717587,"about_ca_system_score_codex":0.0010583955,"about_ca_system_score_gemma":0.00084952894,"threshold_uncertainty_score":0.008260846},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024396905,0.0022991232,0.20689452,0.003421555,0.002374683,0.00047299793,0.03842838,0.31060717,0.4330619],"genre_scores_gemma":[0.03390647,0.0047715683,0.17808463,0.0052055307,0.0008731427,0.0015143636,0.14034046,0.097351596,0.5379523],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984125,0.00031635026,0.00013243727,0.00025314032,0.00069683697,0.00018864754],"domain_scores_gemma":[0.9973611,0.0006722976,0.00013961579,0.0008334876,0.00072058087,0.00027290432],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002095818,0.0015652895,0.0012117709,0.001995719,0.0011550462,0.0041935532,0.005412,0.0031154645,0.34158742],"category_scores_gemma":[0.008890704,0.0013300158,0.0016188656,0.0019958948,0.000840814,0.004584669,0.004503439,0.0026720262,0.31772017],"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.0002439344,0.000086150794,0.00047246876,0.0005799343,0.000054249085,0.00012640421,0.00016778288,0.004206123,0.0010880869,0.037476398,0.83339053,0.12210788],"study_design_scores_gemma":[0.000067094166,0.000019565721,0.00011413439,0.00006584842,0.000012082461,0.00012385569,0.000020125657,0.0032523896,0.0011225834,0.0119851045,0.9831939,0.000023339004],"about_ca_topic_score_codex":0.002189171,"about_ca_topic_score_gemma":0.002310706,"teacher_disagreement_score":0.6584126,"about_ca_system_score_codex":0.0010011747,"about_ca_system_score_gemma":0.0019222038,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01969988,0.00019059239,0.8301502,0.00021687885,0.00018964738,0.0002419809,0.00096666644,0.13970147,0.008642634],"genre_scores_gemma":[0.32472473,0.00041289546,0.64187,0.00037745677,0.000100552475,0.00063787226,0.0044401283,0.017900331,0.009536047],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993394,0.00013814823,0.00007330381,0.00013972486,0.00021225975,0.00009716255],"domain_scores_gemma":[0.99792624,0.00090193935,0.00015595196,0.0005408352,0.0003995229,0.00007556009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012206812,0.0015001555,0.0005032521,0.00084210455,0.00045420244,0.0011223663,0.001505649,0.0005422447,0.016230052],"category_scores_gemma":[0.0046578613,0.00079973944,0.0009734974,0.0005212402,0.0007516218,0.0017304684,0.0011871974,0.0012717473,0.0032526737],"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.0010609147,0.00039586064,0.005072219,0.0015330473,0.00021690236,0.001129519,0.0007618391,0.35761005,0.0715138,0.07102063,0.07999006,0.40969515],"study_design_scores_gemma":[0.00013783421,0.0001434399,0.0004311123,0.0000831404,0.000028919103,0.00022751758,0.000041005627,0.8852548,0.060000125,0.020238759,0.033360243,0.000053101372],"about_ca_topic_score_codex":0.002429431,"about_ca_topic_score_gemma":0.0030014322,"teacher_disagreement_score":0.016230052,"about_ca_system_score_codex":0.0010770562,"about_ca_system_score_gemma":0.001795115,"threshold_uncertainty_score":0.054294944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3206261,0.0067201904,0.5253999,0.0035664737,0.00080230815,0.0002783577,0.00049638015,0.0038966062,0.13821374],"genre_scores_gemma":[0.9340499,0.00097595114,0.054981954,0.00041516387,0.00008685319,0.00014642751,0.00020002684,0.00017279378,0.008970918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993957,0.00017543083,0.000019914654,0.00008653833,0.00017380484,0.00014857246],"domain_scores_gemma":[0.9993236,0.00021477746,0.000056175926,0.00019880668,0.00012346401,0.00008319217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005207418,0.0004019703,0.00056884746,0.00041114434,0.0011423287,0.0016813563,0.0009915654,0.0005650303,0.0037372557],"category_scores_gemma":[0.0021601666,0.000290759,0.00030142567,0.00070054986,0.00088588125,0.0012627898,0.0016908088,0.00086565595,0.00054528884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039113645,0.00016917192,0.006170988,0.00036792734,0.00013092175,0.0008784844,0.00051017845,0.49707183,0.014680086,0.3134756,0.03189798,0.13425563],"study_design_scores_gemma":[0.00003601883,0.000051568124,0.00078751176,0.000028235778,0.000018369128,0.00019255008,0.00013512312,0.90160656,0.002059815,0.06820583,0.026856348,0.00002210533],"about_ca_topic_score_codex":0.006771563,"about_ca_topic_score_gemma":0.01234319,"teacher_disagreement_score":0.006771563,"about_ca_system_score_codex":0.0013493944,"about_ca_system_score_gemma":0.0014260868,"threshold_uncertainty_score":0.013464272},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015070176,0.0047532585,0.871207,0.014592892,0.00196287,0.00014677778,0.0009265272,0.0007456181,0.09059501],"genre_scores_gemma":[0.49274683,0.010453179,0.4242509,0.017382797,0.0044521396,0.00076593977,0.0015518398,0.0014853852,0.04691093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979499,0.0005959715,0.00011524745,0.00049836753,0.0005964189,0.00024409918],"domain_scores_gemma":[0.9953074,0.0026845874,0.00027833693,0.00053662236,0.0009456901,0.0002474159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034565115,0.00108996,0.0011799437,0.0020990197,0.0017609475,0.0018081367,0.0014770862,0.0014665339,0.013781399],"category_scores_gemma":[0.008994103,0.00050769607,0.0020302122,0.0022841112,0.004401667,0.008140934,0.0036161144,0.0059168744,0.0035432728],"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.000035624686,0.00002759789,0.00016104915,0.0001466221,0.0000136411145,0.00008907161,0.00013958738,0.0011220352,0.000837796,0.97004056,0.01174805,0.0156384],"study_design_scores_gemma":[0.000018872692,0.00003964673,0.00020026666,0.000053067302,0.000013327453,0.00023983185,0.000040787687,0.006710166,0.0011765213,0.9689678,0.022513859,0.000025926947],"about_ca_topic_score_codex":0.0016663951,"about_ca_topic_score_gemma":0.0009941951,"teacher_disagreement_score":0.013781399,"about_ca_system_score_codex":0.0014402953,"about_ca_system_score_gemma":0.0016707329,"threshold_uncertainty_score":0.04610336},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21596439,0.00027986063,0.7525765,0.00031567967,0.00010717914,0.00021212181,0.00033880715,0.024875412,0.005329989],"genre_scores_gemma":[0.5382224,0.00015846122,0.4518774,0.00023568676,0.0000434586,0.0002863059,0.0014899882,0.005095475,0.0025909517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986058,0.00023030867,0.00009067918,0.0003580736,0.0005276767,0.0001874274],"domain_scores_gemma":[0.99763286,0.0006784025,0.0001655829,0.000947812,0.00048057057,0.00009478965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010605125,0.0009103761,0.00050798507,0.00053223385,0.00047500618,0.00094400544,0.0023841723,0.0007241592,0.001910587],"category_scores_gemma":[0.00462742,0.0005916799,0.0008575015,0.00083893054,0.0011839399,0.0015021511,0.0015806134,0.0013913217,0.00093970884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010880277,0.00048764504,0.01279497,0.00040160245,0.00019477705,0.0009446623,0.00069867354,0.44118872,0.15556504,0.035839748,0.021466685,0.32932934],"study_design_scores_gemma":[0.000062180625,0.00009675031,0.0008036191,0.000009372912,0.000024730582,0.00012346673,0.000057958878,0.9385388,0.04665841,0.008323726,0.0052809822,0.000020099667],"about_ca_topic_score_codex":0.0022039865,"about_ca_topic_score_gemma":0.0025653252,"teacher_disagreement_score":0.0023841723,"about_ca_system_score_codex":0.0008068079,"about_ca_system_score_gemma":0.0011465925,"threshold_uncertainty_score":0.006391585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01702901,0.000044348344,0.978959,0.000054049113,0.000012160965,0.0000604493,0.000022395718,0.0020939826,0.0017246123],"genre_scores_gemma":[0.23300594,0.00006568288,0.7643249,0.000066864246,0.000024783056,0.00016289912,0.0001510488,0.00052077253,0.0016770576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928457,0.00014784063,0.000038280028,0.00015121805,0.00027031518,0.00010784416],"domain_scores_gemma":[0.9991153,0.0002526714,0.000106377156,0.00031868546,0.00016831286,0.000038752183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075631787,0.0007136321,0.0006268594,0.00047901314,0.0005583764,0.0007247052,0.0013951535,0.0003652199,0.0021970242],"category_scores_gemma":[0.0023326399,0.00041836555,0.00077346596,0.0005204208,0.001103784,0.0009255762,0.0011485553,0.00089906895,0.0005715834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034348053,0.0003179497,0.0027844512,0.00045166284,0.0001523082,0.000481138,0.0009754615,0.2916723,0.15367694,0.11013129,0.006773625,0.43223932],"study_design_scores_gemma":[0.00007239043,0.00014995126,0.00047466453,0.00002069879,0.000050614995,0.00014475151,0.0000620058,0.8670714,0.079960704,0.043236293,0.008733403,0.0000231173],"about_ca_topic_score_codex":0.0010730609,"about_ca_topic_score_gemma":0.0015830141,"teacher_disagreement_score":0.0021970242,"about_ca_system_score_codex":0.00046844504,"about_ca_system_score_gemma":0.000862199,"threshold_uncertainty_score":0.007349789},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018964423,0.005996475,0.08135514,0.009321841,0.008475747,0.00033577325,0.012298003,0.019997675,0.8432549],"genre_scores_gemma":[0.25084662,0.005966985,0.06102937,0.00476178,0.0020533276,0.0006510074,0.019401453,0.008209547,0.6470798],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988323,0.00021677544,0.00007652113,0.00035994063,0.0003492343,0.00016523835],"domain_scores_gemma":[0.9988433,0.00023479856,0.00010906356,0.00030486056,0.00031405978,0.00019377598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011226642,0.001132555,0.00073139084,0.0015660274,0.0016141059,0.0040551736,0.001957723,0.001760148,0.26860175],"category_scores_gemma":[0.004194095,0.0003666112,0.0007591148,0.0012068886,0.0010873533,0.0030008256,0.0034246189,0.002059362,0.12011229],"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.0010658017,0.00015654479,0.0034527266,0.0010746587,0.00008754884,0.0014965856,0.00072380324,0.0037019008,0.0067066904,0.21404852,0.25345415,0.5140311],"study_design_scores_gemma":[0.000053535012,0.00005138807,0.00062655174,0.0001841791,0.000021188727,0.00049108244,0.00015739346,0.0022297555,0.002763601,0.031861883,0.9615346,0.000024846991],"about_ca_topic_score_codex":0.0024174189,"about_ca_topic_score_gemma":0.001973375,"teacher_disagreement_score":0.26860175,"about_ca_system_score_codex":0.0016741245,"about_ca_system_score_gemma":0.0017512251,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016563438,0.043074068,0.037486136,0.0075353263,0.020617584,0.00034796813,0.005486127,0.006481785,0.87731475],"genre_scores_gemma":[0.006928205,0.023193799,0.011169583,0.0029425123,0.0047787293,0.00022508555,0.0061858194,0.0015334949,0.9430428],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994972,0.000051511557,0.000029337916,0.000115127,0.0002471187,0.00005969982],"domain_scores_gemma":[0.9992175,0.00016350189,0.000036673435,0.0000850143,0.00032824592,0.00016896118],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005363515,0.0012466718,0.00083163916,0.0017218565,0.0009810607,0.0032625238,0.0016640304,0.0016360725,0.48380697],"category_scores_gemma":[0.0024969464,0.0004388855,0.0007227593,0.001687051,0.00039465426,0.003872217,0.0017246496,0.0016622689,0.3725839],"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.000034402918,0.00005294035,0.00013608682,0.00039677523,0.0000085565425,0.00008801663,0.00009603116,0.00038958123,0.0010546999,0.018983077,0.78067726,0.19808261],"study_design_scores_gemma":[0.0000030736073,0.00001259523,0.00010594627,0.000084203515,0.0000030396736,0.00013343792,0.000025528909,0.00014999695,0.00014588828,0.0031161576,0.9962153,0.0000048367133],"about_ca_topic_score_codex":0.0013223819,"about_ca_topic_score_gemma":0.0022196549,"teacher_disagreement_score":0.51619303,"about_ca_system_score_codex":0.0011428762,"about_ca_system_score_gemma":0.001530982,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24294326,0.00027730464,0.7416265,0.00018050702,0.000040348375,0.00009204988,0.00026301335,0.008702597,0.005874418],"genre_scores_gemma":[0.8641123,0.00010160429,0.13189887,0.000080371006,0.000027458796,0.000091095906,0.0004904473,0.00079989864,0.002397835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907506,0.00011294408,0.000040448893,0.00009436435,0.0005644819,0.0001126083],"domain_scores_gemma":[0.99804854,0.00089244626,0.0002664116,0.000303934,0.00044635995,0.00004230402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006798387,0.00055412564,0.00039097003,0.0011644718,0.00051677076,0.0009063533,0.00085721875,0.0004346305,0.0018235398],"category_scores_gemma":[0.0033426036,0.0003123051,0.00065497967,0.00052427244,0.00088773435,0.001043135,0.0008538239,0.0008451746,0.00040895672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006965172,0.0002810505,0.032454886,0.00035892718,0.00009813571,0.0006997512,0.00057226256,0.46026534,0.16964395,0.06305518,0.004594697,0.2672794],"study_design_scores_gemma":[0.000016644208,0.00009869857,0.0016265367,0.000015798987,0.000021231575,0.00009011238,0.000039876384,0.92036873,0.060446735,0.014760984,0.0024947403,0.000019960593],"about_ca_topic_score_codex":0.0025604542,"about_ca_topic_score_gemma":0.002459338,"teacher_disagreement_score":0.0025604542,"about_ca_system_score_codex":0.0008284027,"about_ca_system_score_gemma":0.0017800734,"threshold_uncertainty_score":0.0061003566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023648122,0.00024333657,0.96923053,0.0001867713,0.00017206179,0.00011919054,0.00008127485,0.0043882765,0.0019304983],"genre_scores_gemma":[0.21724103,0.00031325896,0.77154815,0.00049090653,0.00011969381,0.00042853187,0.00035226715,0.002825091,0.0066810455],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99656904,0.00073442794,0.00034396758,0.0005701163,0.0013192708,0.00046320874],"domain_scores_gemma":[0.98864496,0.0033661334,0.0010011588,0.005392513,0.001241064,0.00035418727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038324036,0.0012689383,0.0010767576,0.0013541902,0.0012205412,0.0026865117,0.0042376034,0.001204237,0.0028547174],"category_scores_gemma":[0.015078406,0.0010683769,0.0014331117,0.002307471,0.002817039,0.0063950103,0.0044143237,0.002696752,0.0014673014],"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.0013013901,0.00059349835,0.0068421527,0.00040361445,0.00017326343,0.0003348715,0.0010491039,0.08421323,0.039420627,0.22792575,0.011886998,0.62585545],"study_design_scores_gemma":[0.00048247806,0.00061530154,0.0009306836,0.000090075,0.00018315448,0.00034950263,0.00034668852,0.56939566,0.07478561,0.3092543,0.0434126,0.00015398653],"about_ca_topic_score_codex":0.0030361635,"about_ca_topic_score_gemma":0.0030530032,"teacher_disagreement_score":0.0042376034,"about_ca_system_score_codex":0.001226219,"about_ca_system_score_gemma":0.0029868574,"threshold_uncertainty_score":0.020267904},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006822572,0.000047890233,0.98767984,0.000039732247,0.000039439365,0.000044437278,0.000054804463,0.0027834033,0.002487882],"genre_scores_gemma":[0.16697271,0.00015616411,0.8274467,0.00010110028,0.00004327795,0.00028634226,0.00034306454,0.0013540854,0.0032965099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994973,0.000091976,0.00004042514,0.00006165303,0.0002558107,0.000052876698],"domain_scores_gemma":[0.9993843,0.00023100799,0.00006192347,0.00014603391,0.00014920831,0.000027577056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000375573,0.0005557839,0.00040239218,0.00043126525,0.00038263408,0.000569698,0.0007900056,0.0003174334,0.0035202678],"category_scores_gemma":[0.0016629416,0.00031724403,0.0005953404,0.000446306,0.00055373023,0.0005191831,0.0008741698,0.00083852216,0.0009055139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022767705,0.00023186058,0.001437905,0.00046150005,0.000074126954,0.00045143368,0.0003524958,0.47870013,0.06412086,0.09802072,0.011026462,0.34489483],"study_design_scores_gemma":[0.000041162584,0.000078953395,0.00014220044,0.000022741266,0.000014355258,0.0001198132,0.000026455082,0.9445819,0.028803207,0.01397522,0.012175618,0.000018405957],"about_ca_topic_score_codex":0.0014545794,"about_ca_topic_score_gemma":0.0021415825,"teacher_disagreement_score":0.0035202678,"about_ca_system_score_codex":0.0003949734,"about_ca_system_score_gemma":0.0009978494,"threshold_uncertainty_score":0.011776507},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0078630205,0.093045674,0.4925793,0.281385,0.012432717,0.00006705545,0.00045620365,0.0017892807,0.110381775],"genre_scores_gemma":[0.34522128,0.15641929,0.35444474,0.037428718,0.017997397,0.00042079526,0.0010143783,0.0019751086,0.085078344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976132,0.0007567443,0.00013006674,0.00035775077,0.0008809997,0.00026122024],"domain_scores_gemma":[0.9930407,0.0033545129,0.00025322195,0.0016289358,0.001114573,0.0006081045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005955242,0.00076900015,0.0012394723,0.0012528946,0.0014749455,0.0059867143,0.0019774975,0.0025104424,0.015916403],"category_scores_gemma":[0.013050692,0.000570051,0.00085319125,0.0010520046,0.010551534,0.0279121,0.004284026,0.008436048,0.0065002097],"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.000017304608,0.000031997537,0.00015555118,0.00018203161,0.000013762518,0.000023614393,0.00010303773,0.00084973394,0.00016225995,0.93984854,0.019634318,0.038977828],"study_design_scores_gemma":[0.0000073711317,0.000014826644,0.00006568885,0.000109894136,0.0000036760127,0.000039637573,0.00009259753,0.0016052888,0.00019535897,0.8950092,0.102845885,0.0000105290355],"about_ca_topic_score_codex":0.0014016579,"about_ca_topic_score_gemma":0.0010669342,"teacher_disagreement_score":0.015916403,"about_ca_system_score_codex":0.0022791428,"about_ca_system_score_gemma":0.003453064,"threshold_uncertainty_score":0.053245664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12073049,0.0030869762,0.8379721,0.0024968921,0.000325433,0.00036537217,0.0005190773,0.005255705,0.029248012],"genre_scores_gemma":[0.6266447,0.002402418,0.36195055,0.000665132,0.00012597245,0.00040533653,0.0010964855,0.0011896008,0.005519826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951303,0.0012031222,0.00032620097,0.00045419188,0.0021198336,0.0007663608],"domain_scores_gemma":[0.9927938,0.0022813578,0.00035897415,0.0023435482,0.0012599669,0.0009624656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067021614,0.0008732728,0.0008649687,0.0016106501,0.0013514258,0.0059737433,0.003215521,0.0016578853,0.0026491713],"category_scores_gemma":[0.011919772,0.0007960849,0.0023117804,0.0020543642,0.0025811682,0.0077718906,0.0043558176,0.0029796895,0.00053336174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006830432,0.00030024868,0.004257258,0.00036491454,0.00015358956,0.00032816085,0.0011681798,0.12590952,0.0041105147,0.80292696,0.0058448105,0.053952824],"study_design_scores_gemma":[0.00013714179,0.00027969122,0.0023622815,0.00029291114,0.0001286019,0.00032939276,0.0007126798,0.7004786,0.005409493,0.24414834,0.045547448,0.00017342235],"about_ca_topic_score_codex":0.010560419,"about_ca_topic_score_gemma":0.006109865,"teacher_disagreement_score":0.010560419,"about_ca_system_score_codex":0.0027550298,"about_ca_system_score_gemma":0.004836983,"threshold_uncertainty_score":0.035444796},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021076307,0.0001315617,0.9618774,0.00050146336,0.00012014766,0.00010922388,0.00021373703,0.00090669986,0.015063356],"genre_scores_gemma":[0.5170851,0.00033887968,0.46909508,0.00053928833,0.00016983028,0.00056660734,0.0005239464,0.000442605,0.011238712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908507,0.0001509248,0.00011449584,0.0001569148,0.00033501314,0.00015760935],"domain_scores_gemma":[0.99901044,0.000308948,0.00009221746,0.00022531279,0.00026710256,0.00009591211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009608645,0.00064667093,0.0005178726,0.0008812068,0.0011081488,0.0021718256,0.0013226445,0.00086992054,0.005077847],"category_scores_gemma":[0.0017381286,0.00049924327,0.0012642834,0.000766196,0.0036320847,0.0041758143,0.0027205313,0.0018303947,0.00075969775],"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.000024177034,0.000019953595,0.00013423982,0.0000646948,0.000007748297,0.000115734874,0.000299574,0.006790058,0.0030443554,0.98154014,0.000553155,0.0074060992],"study_design_scores_gemma":[0.00003283838,0.000065943525,0.00012424636,0.00003517115,0.000033512926,0.0001605468,0.0002206887,0.07362053,0.006450801,0.89531183,0.02391556,0.000028349545],"about_ca_topic_score_codex":0.0018406152,"about_ca_topic_score_gemma":0.0018009036,"teacher_disagreement_score":0.005077847,"about_ca_system_score_codex":0.001029849,"about_ca_system_score_gemma":0.0016778039,"threshold_uncertainty_score":0.016987085},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090121426,0.00065724365,0.89959574,0.00024607402,0.00009425954,0.00015987411,0.0001826598,0.0033202008,0.005622521],"genre_scores_gemma":[0.629776,0.00014710611,0.36719677,0.000149922,0.00003403129,0.00013937852,0.00034645144,0.00038264671,0.0018276976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992551,0.00017004512,0.00003690596,0.00018690075,0.00015149693,0.0001994752],"domain_scores_gemma":[0.99903834,0.00043632343,0.000117957185,0.00015953321,0.0001493377,0.00009855635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010098529,0.00085159234,0.00085083354,0.000860336,0.0005782709,0.0008783345,0.0012907904,0.0006121268,0.0021728189],"category_scores_gemma":[0.0023806342,0.00047054602,0.0004646079,0.0007260366,0.00064983167,0.00088711584,0.0007187181,0.00080890756,0.00046586583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092959875,0.00023242207,0.0017110499,0.0002277476,0.000043463653,0.00016380312,0.00021187877,0.7526582,0.025305625,0.017158488,0.004977051,0.19638067],"study_design_scores_gemma":[0.000034963203,0.00008431827,0.00019198594,0.000009297606,0.000012164993,0.000030848885,0.00002763415,0.98705345,0.0040650726,0.0075869914,0.00089589227,0.000007374826],"about_ca_topic_score_codex":0.0036374915,"about_ca_topic_score_gemma":0.0057313577,"teacher_disagreement_score":0.0036374915,"about_ca_system_score_codex":0.0011729242,"about_ca_system_score_gemma":0.0028508257,"threshold_uncertainty_score":0.008510232},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13728878,0.0008778723,0.54290575,0.0008964092,0.0007314552,0.00044066858,0.02865942,0.25754672,0.030652957],"genre_scores_gemma":[0.4242058,0.0008217373,0.5151409,0.00039448825,0.00012908,0.00079440384,0.031684473,0.021201622,0.0056275106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930966,0.00013250219,0.00005320773,0.000105190986,0.00031780227,0.00008160794],"domain_scores_gemma":[0.9981128,0.0007850505,0.00018794775,0.0002708552,0.00051398255,0.00012928923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014584403,0.0018280273,0.0006525882,0.0016001993,0.00057273544,0.0016855795,0.0017030321,0.00083677855,0.0119338315],"category_scores_gemma":[0.0072148717,0.00094799156,0.001213125,0.0014873141,0.00029834817,0.002585719,0.0014554205,0.001462539,0.0031248915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008860843,0.00032674376,0.025965732,0.0008849814,0.00035324725,0.0004496353,0.00058425294,0.65421224,0.012904156,0.018166829,0.15319875,0.13206743],"study_design_scores_gemma":[0.000069407695,0.00010989776,0.0019096021,0.00004721674,0.00003771026,0.000053568267,0.00008761538,0.96705896,0.006125707,0.0057137716,0.0187327,0.000053899097],"about_ca_topic_score_codex":0.007062013,"about_ca_topic_score_gemma":0.0080358405,"teacher_disagreement_score":0.0119338315,"about_ca_system_score_codex":0.00067927816,"about_ca_system_score_gemma":0.0017008398,"threshold_uncertainty_score":0.039922655},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88050103,0.0012760176,0.105986185,0.00031543407,0.000112008005,0.00005940757,0.00014660487,0.0011940026,0.01040933],"genre_scores_gemma":[0.9943921,0.00007017309,0.004931548,0.000020960077,0.000005790462,0.000008354025,0.000027523665,0.000019520196,0.00052405597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972993,0.00004911177,0.0000122854735,0.000049014165,0.000062042905,0.000097619115],"domain_scores_gemma":[0.999655,0.00013596083,0.000048150676,0.000055844575,0.00005418313,0.000050779418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034752087,0.0005054416,0.00032609954,0.0003600504,0.00032963787,0.0005828381,0.0007083467,0.00023773295,0.001374235],"category_scores_gemma":[0.00085004314,0.00019554245,0.00014002353,0.00027162736,0.00020370337,0.00065424,0.00039486404,0.00027007202,0.0002220951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010307141,0.00026544605,0.012521201,0.00017431793,0.00006640618,0.0009025888,0.00013342904,0.7682747,0.07603314,0.006238022,0.0035077066,0.13085239],"study_design_scores_gemma":[0.000012438605,0.00009675651,0.001708855,0.0000072256066,0.000009101042,0.00008214367,0.000039749215,0.9890181,0.006860413,0.0012249163,0.00093177427,0.000008526384],"about_ca_topic_score_codex":0.0018809895,"about_ca_topic_score_gemma":0.0044715223,"teacher_disagreement_score":0.0018809895,"about_ca_system_score_codex":0.00049485674,"about_ca_system_score_gemma":0.00053654023,"threshold_uncertainty_score":0.0045973063},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4188433,0.00058910437,0.5728816,0.00020302954,0.000051427698,0.00007397957,0.00008189355,0.00092970906,0.0063459934],"genre_scores_gemma":[0.8596719,0.000120711215,0.13757007,0.00004957225,0.000015361058,0.00005491278,0.00013735943,0.000107721025,0.0022722613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998252,0.000038604667,0.0000087861545,0.000039714192,0.000046603123,0.000041156185],"domain_scores_gemma":[0.99966085,0.000115328396,0.000048608465,0.000079878715,0.00006641215,0.000028922484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002537046,0.00046936402,0.00034423586,0.00040733328,0.0005750544,0.00040085864,0.00069376075,0.00028862018,0.0008857758],"category_scores_gemma":[0.0007708622,0.00018055076,0.00026428927,0.0004970351,0.00022113958,0.0005464978,0.0005084889,0.0002328957,0.00018627247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034779444,0.00011329703,0.0023743515,0.000094094736,0.000039550072,0.00011977877,0.00014904549,0.78723395,0.041210398,0.004958163,0.0026327507,0.16072685],"study_design_scores_gemma":[0.000017008371,0.00004643092,0.0008615905,0.000002995449,0.000009580739,0.00003425509,0.00005019489,0.98897374,0.007025732,0.0021683592,0.0008046093,0.0000055011365],"about_ca_topic_score_codex":0.0036553873,"about_ca_topic_score_gemma":0.006377681,"teacher_disagreement_score":0.0036553873,"about_ca_system_score_codex":0.000542649,"about_ca_system_score_gemma":0.0005945697,"threshold_uncertainty_score":0.0072681904},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39868078,0.0014079189,0.5579057,0.00033558847,0.00014658243,0.00013169924,0.0003068396,0.026697155,0.014387755],"genre_scores_gemma":[0.8570782,0.00045086278,0.1307123,0.00007752054,0.000033660977,0.00009684756,0.00038326898,0.0016858956,0.009481517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989297,0.00015422195,0.000066585075,0.00013439552,0.00053727283,0.00017783846],"domain_scores_gemma":[0.99845874,0.00039808027,0.00012442975,0.0007022709,0.00024771522,0.00006883351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006465646,0.0006842196,0.0002805363,0.0010060271,0.0005976691,0.00082461216,0.0013322745,0.00046321028,0.0035765858],"category_scores_gemma":[0.0022512828,0.00045165754,0.00030324128,0.0011774786,0.00067215867,0.001674425,0.0012806961,0.0010727814,0.0010459248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002004198,0.00028491294,0.01089727,0.00029347272,0.000064379914,0.00085928425,0.0012916668,0.106047116,0.10575502,0.060728114,0.010195216,0.70157933],"study_design_scores_gemma":[0.00034060483,0.0011356473,0.006658793,0.00016152005,0.00007205061,0.0007297974,0.000355883,0.5936769,0.26763237,0.054947007,0.07413546,0.00015396131],"about_ca_topic_score_codex":0.0025108473,"about_ca_topic_score_gemma":0.0025355455,"teacher_disagreement_score":0.0035765858,"about_ca_system_score_codex":0.00048705464,"about_ca_system_score_gemma":0.0008234968,"threshold_uncertainty_score":0.011964858},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018127391,0.00052924186,0.96927625,0.00015716393,0.00017282624,0.0002606226,0.00011151161,0.0063617225,0.0050032404],"genre_scores_gemma":[0.45471618,0.00045960984,0.53140074,0.0003781116,0.00014302543,0.0005497173,0.0005646318,0.0008245252,0.010963448],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985672,0.00016341699,0.00012593178,0.00035350252,0.000521689,0.0002681791],"domain_scores_gemma":[0.9984869,0.00020977226,0.00015405013,0.00048328648,0.0005559973,0.00011000702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012323675,0.0009472553,0.0011882591,0.0012733485,0.0011820485,0.0028970717,0.0049740453,0.0010739957,0.005412206],"category_scores_gemma":[0.0021406626,0.0007457244,0.00078010134,0.00096825033,0.0006862833,0.0026288147,0.0019101569,0.001475355,0.0029309066],"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.0014741734,0.0009351254,0.0031554361,0.0008773467,0.0003951017,0.00034769115,0.0005193985,0.16715312,0.20570546,0.12149653,0.027953148,0.46998742],"study_design_scores_gemma":[0.00013036958,0.00064459315,0.00054786494,0.00006571405,0.00025840144,0.00027580056,0.000114391456,0.78855973,0.14985572,0.01893619,0.040502906,0.000108240456],"about_ca_topic_score_codex":0.0020904567,"about_ca_topic_score_gemma":0.0033420634,"teacher_disagreement_score":0.005412206,"about_ca_system_score_codex":0.0015265893,"about_ca_system_score_gemma":0.0027923617,"threshold_uncertainty_score":0.018105567},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88891864,0.012000749,0.03760905,0.0024118288,0.00040563408,0.0000736784,0.000979602,0.0040938356,0.053506978],"genre_scores_gemma":[0.9780247,0.002197526,0.014979632,0.0002955827,0.00012901923,0.000056552777,0.0008731973,0.0002724685,0.0031711955],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999027,0.00013735978,0.000046122488,0.00017458116,0.00038799254,0.00022698301],"domain_scores_gemma":[0.9987147,0.000501162,0.00014009328,0.0002844454,0.00025636383,0.000103214115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008127913,0.00083230314,0.00035364385,0.0007216078,0.00040307944,0.0012315125,0.0012777518,0.00068342907,0.00546936],"category_scores_gemma":[0.0032940062,0.00039810737,0.00033905345,0.0009012547,0.0004858581,0.0035985694,0.0010670375,0.0014086611,0.0014873679],"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.0023892587,0.0008521752,0.025927603,0.0018443499,0.0003575974,0.00063727354,0.0005618693,0.2654375,0.2796237,0.073082276,0.035983663,0.3133028],"study_design_scores_gemma":[0.00023879381,0.0027285574,0.031130629,0.00026317846,0.00031127184,0.00062487926,0.0006521698,0.67199826,0.1776962,0.04729796,0.066902086,0.00015602402],"about_ca_topic_score_codex":0.00096620043,"about_ca_topic_score_gemma":0.0015788225,"teacher_disagreement_score":0.00546936,"about_ca_system_score_codex":0.00068853,"about_ca_system_score_gemma":0.00052930386,"threshold_uncertainty_score":0.018296778},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02809534,0.0038996355,0.14820887,0.0014156548,0.0020757522,0.0010810803,0.015534922,0.22684911,0.5728397],"genre_scores_gemma":[0.20698418,0.0035872487,0.14856477,0.0025877825,0.00046568934,0.0009755669,0.058225658,0.022963155,0.55564594],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908555,0.00010508658,0.00004720119,0.00019252732,0.00040293063,0.00016681422],"domain_scores_gemma":[0.99906117,0.00012272896,0.00007516529,0.00034026545,0.00026979097,0.00013095888],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000775721,0.0012418478,0.0006039013,0.0010928947,0.0010033671,0.0025405297,0.0019855052,0.0010987447,0.16135223],"category_scores_gemma":[0.0021978521,0.0004684205,0.00048765185,0.00082411297,0.00045462066,0.00226141,0.002110535,0.0010532606,0.090530105],"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.0016356552,0.0003967863,0.0018323308,0.00083161244,0.000046338628,0.00047962312,0.0001901992,0.0070544695,0.014628178,0.03671393,0.34584165,0.5903493],"study_design_scores_gemma":[0.00015031065,0.00023392715,0.0010339409,0.00011601789,0.000030220917,0.00035569762,0.00006393609,0.020058641,0.015535716,0.007633649,0.9547315,0.000056297198],"about_ca_topic_score_codex":0.0030928985,"about_ca_topic_score_gemma":0.0038240168,"teacher_disagreement_score":0.8386478,"about_ca_system_score_codex":0.0007559842,"about_ca_system_score_gemma":0.0011955405,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041802563,0.00043043715,0.932262,0.00020171914,0.00020533334,0.00041650087,0.00029293585,0.014767943,0.009620537],"genre_scores_gemma":[0.21715671,0.00031946265,0.7695527,0.00024954174,0.00010290289,0.0002752606,0.0008505982,0.0007594907,0.010733282],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995504,0.000040057977,0.000051809515,0.00008047866,0.00021115725,0.000066096734],"domain_scores_gemma":[0.999491,0.00007231099,0.000046371188,0.00006703337,0.00028708886,0.000036109304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041170872,0.0003267574,0.0003618585,0.0006467224,0.00026075463,0.00059774827,0.0012612412,0.00032110972,0.0027794614],"category_scores_gemma":[0.00065254717,0.0003794258,0.0003182179,0.0003111882,0.00019092073,0.00048027778,0.0003530037,0.00060534285,0.0014936228],"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.0006746356,0.00025157703,0.002393282,0.0006741581,0.00014004252,0.00079773477,0.00029839945,0.05732344,0.41651514,0.016433699,0.011906442,0.49259147],"study_design_scores_gemma":[0.0003109545,0.0007190103,0.0023005796,0.00007075411,0.0001609887,0.0010708539,0.00006442328,0.39133358,0.47775757,0.0030523962,0.12308105,0.000077834135],"about_ca_topic_score_codex":0.00077636173,"about_ca_topic_score_gemma":0.0006105394,"teacher_disagreement_score":0.0027794614,"about_ca_system_score_codex":0.0003167088,"about_ca_system_score_gemma":0.0010573067,"threshold_uncertainty_score":0.009298205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14939538,0.0020231628,0.81373686,0.00059203967,0.00058086216,0.00026612962,0.00022773912,0.004668743,0.02850911],"genre_scores_gemma":[0.6164099,0.000656908,0.34958908,0.00043092153,0.00019933924,0.00016414127,0.00050975103,0.00023578886,0.031804133],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983764,0.000015611997,0.000012467879,0.000037963953,0.000077103636,0.000019070514],"domain_scores_gemma":[0.9998171,0.000022812957,0.00002465552,0.000036180485,0.00007520516,0.00002412396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011405613,0.00028667637,0.0002549904,0.00025845572,0.00024492724,0.00051687006,0.00078936294,0.00033551676,0.0047364836],"category_scores_gemma":[0.00042803257,0.0001857932,0.00018650066,0.00026849873,0.00012289574,0.0005012942,0.00041454128,0.0006559707,0.0015262571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060151366,0.00029565793,0.0013888001,0.00043557302,0.00005563991,0.0006141279,0.00009067279,0.008345375,0.612139,0.014699016,0.011765725,0.3495689],"study_design_scores_gemma":[0.00042437523,0.0027501574,0.0047310283,0.000093319286,0.00020063022,0.004371869,0.00006469941,0.31991878,0.47559088,0.0061658146,0.18560047,0.000088034576],"about_ca_topic_score_codex":0.00012085874,"about_ca_topic_score_gemma":0.00022523417,"teacher_disagreement_score":0.0047364836,"about_ca_system_score_codex":0.00015278217,"about_ca_system_score_gemma":0.00033393013,"threshold_uncertainty_score":0.01584512},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1693344,0.00045836673,0.8222478,0.00018085731,0.00006318952,0.00022428925,0.00008342504,0.0036898812,0.0037178427],"genre_scores_gemma":[0.62716365,0.000116256415,0.36839542,0.00015695507,0.000040102343,0.00022743794,0.0003040262,0.00028539705,0.0033107335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999244,0.00015318238,0.00008895887,0.00010647937,0.0002280459,0.0001794489],"domain_scores_gemma":[0.99791735,0.00090168195,0.00028239164,0.0003059007,0.00048137098,0.00011131509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010583613,0.0005158099,0.00074357784,0.0010682305,0.0008618372,0.001374847,0.001711617,0.0006027415,0.0036109246],"category_scores_gemma":[0.0034366045,0.00029041574,0.00034450012,0.0008431527,0.0004976725,0.0010805884,0.0009941184,0.0005588567,0.0008119607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002589831,0.0004736272,0.006824081,0.00017773772,0.00007836141,0.00027146708,0.0005006777,0.23649934,0.07503819,0.017138373,0.0051979963,0.6552102],"study_design_scores_gemma":[0.000164806,0.00016520412,0.00042430926,0.000010265924,0.000019031722,0.000063323445,0.00008425226,0.9701549,0.022594567,0.004814627,0.0014847905,0.000019980313],"about_ca_topic_score_codex":0.00326895,"about_ca_topic_score_gemma":0.006784689,"teacher_disagreement_score":0.0036109246,"about_ca_system_score_codex":0.0010137251,"about_ca_system_score_gemma":0.002081551,"threshold_uncertainty_score":0.012079775},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03323876,0.00035842022,0.9602565,0.0001924149,0.000035445995,0.000038408878,0.000063054715,0.000341636,0.005475298],"genre_scores_gemma":[0.6203833,0.00031435295,0.37309352,0.00024799854,0.000037595142,0.0002797133,0.00015770813,0.0002176086,0.005268143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998604,0.000054611653,0.000004946984,0.000018131106,0.000040571667,0.000021278833],"domain_scores_gemma":[0.9998012,0.00010524112,0.00002501267,0.000013734377,0.0000402789,0.000014529458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034683885,0.000521828,0.00066127884,0.00029774095,0.0002214029,0.0004920895,0.000664611,0.0005940237,0.0019825576],"category_scores_gemma":[0.0005021309,0.00034383207,0.00058685604,0.00036465525,0.0003208319,0.00035683878,0.00048633027,0.00058696116,0.00028443986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021760121,0.000016183907,0.00014737296,0.00002266783,0.000020088715,0.000026744712,0.000009504308,0.9860968,0.001525692,0.0037879907,0.00047249135,0.007852714],"study_design_scores_gemma":[0.0000018583818,0.0000047483372,0.000014615089,7.1747314e-7,0.0000010267883,0.0000023078385,9.594874e-7,0.999534,0.0000696557,0.00027479068,0.00009460553,8.054252e-7],"about_ca_topic_score_codex":0.004061538,"about_ca_topic_score_gemma":0.0045799143,"teacher_disagreement_score":0.004061538,"about_ca_system_score_codex":0.0006034551,"about_ca_system_score_gemma":0.00070601725,"threshold_uncertainty_score":0.008075833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10344996,0.0014842844,0.48038247,0.0004986557,0.000584787,0.00030163035,0.0025508816,0.3788601,0.031887185],"genre_scores_gemma":[0.6934266,0.0008886742,0.21305877,0.0009151218,0.00016321412,0.0004954481,0.0064992746,0.032636046,0.05191681],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910504,0.00011461393,0.000058502348,0.00029421836,0.0003110367,0.00011647425],"domain_scores_gemma":[0.9982768,0.0004596011,0.0001702741,0.0006481946,0.00031426837,0.00013078346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010071219,0.0014716828,0.0005438033,0.0004655764,0.00048117887,0.0012783068,0.0027019728,0.0007239863,0.011822364],"category_scores_gemma":[0.0031364085,0.00086366094,0.00069442065,0.0002996332,0.0006491542,0.0022266144,0.001699757,0.0016460598,0.0038198323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032457,0.00064515555,0.021100504,0.0013738204,0.0004589306,0.0008075388,0.00089218275,0.11370009,0.087865226,0.046599694,0.2133458,0.5099653],"study_design_scores_gemma":[0.0002113328,0.00044514146,0.0039320327,0.000095309224,0.00012172032,0.00051901647,0.000068335976,0.67308885,0.10026641,0.01756635,0.20349574,0.00018975756],"about_ca_topic_score_codex":0.0020608804,"about_ca_topic_score_gemma":0.0033380205,"teacher_disagreement_score":0.011822364,"about_ca_system_score_codex":0.0008013933,"about_ca_system_score_gemma":0.0011770866,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7906288,0.0028292015,0.19365104,0.00019902823,0.00010648815,0.000043450975,0.00011340081,0.0013123807,0.011116171],"genre_scores_gemma":[0.9851317,0.00016842244,0.013364481,0.000033034423,0.000012092002,0.000009539443,0.00003705626,0.000018469551,0.0012252685],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999535,0.0000056167637,0.0000033173658,0.000011241227,0.00001767153,0.000008707008],"domain_scores_gemma":[0.99994636,0.000007817975,0.00001465465,0.000011622249,0.000015777268,0.000003805717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000038911327,0.00012818567,0.00013412823,0.00016407028,0.00013310334,0.00021012398,0.0005756922,0.00014882386,0.000688845],"category_scores_gemma":[0.000089222485,0.000073133604,0.00013096796,0.00019938168,0.00008107542,0.00031815484,0.0001488744,0.000084860716,0.00011751353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003835071,0.000109240646,0.0041439175,0.00028586993,0.00011173686,0.00063555123,0.00013393266,0.06445067,0.72667265,0.004930262,0.002425604,0.19571705],"study_design_scores_gemma":[0.000040999577,0.00079465477,0.005489763,0.000031046784,0.00012081077,0.00097070995,0.00010251376,0.5362982,0.4429386,0.002051756,0.011125738,0.000035159348],"about_ca_topic_score_codex":0.0003157062,"about_ca_topic_score_gemma":0.0013703306,"teacher_disagreement_score":0.000688845,"about_ca_system_score_codex":0.00013936007,"about_ca_system_score_gemma":0.00012760857,"threshold_uncertainty_score":0.0023044348},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98877865,0.0007306154,0.0046336465,0.00006119141,0.000056406527,0.00003716359,0.00020292266,0.0018017662,0.0036975096],"genre_scores_gemma":[0.9860261,0.00027743223,0.012163678,0.000027166316,0.000012688667,0.000028470651,0.00036617162,0.00022827003,0.00086991047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992111,0.00020019324,0.00006663814,0.00009829488,0.00025479612,0.0001690112],"domain_scores_gemma":[0.9981312,0.0010117466,0.00023065411,0.00019193224,0.00036865028,0.00006587442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007995844,0.0007378988,0.0004480251,0.0006136029,0.0003665948,0.00050272205,0.0005197416,0.00029142256,0.0013608296],"category_scores_gemma":[0.0025605906,0.00022162379,0.00034450027,0.00093735434,0.00034584204,0.00039572603,0.00026078944,0.0003596943,0.00028737748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0075435727,0.0010705125,0.020121537,0.0011290067,0.00030298662,0.00051617966,0.00037857328,0.49672464,0.21492939,0.0031973561,0.0056733354,0.24841298],"study_design_scores_gemma":[0.0004240497,0.0041484074,0.018235039,0.0000660754,0.00022299834,0.00022810703,0.0001939029,0.7037261,0.26523203,0.00060325937,0.0068476247,0.00007242058],"about_ca_topic_score_codex":0.0025656389,"about_ca_topic_score_gemma":0.0024969762,"teacher_disagreement_score":0.0025656389,"about_ca_system_score_codex":0.0005784999,"about_ca_system_score_gemma":0.0009214801,"threshold_uncertainty_score":0.0051013827},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8349331,0.0026369325,0.15282021,0.00044402387,0.000079804755,0.000057343506,0.00010888456,0.0018507497,0.0070689446],"genre_scores_gemma":[0.9797233,0.00027536298,0.019175809,0.00004050549,0.000021579659,0.000018317247,0.00009548034,0.00014643538,0.0005032533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993136,0.00014402978,0.000026605781,0.00012341121,0.00020423996,0.0001881807],"domain_scores_gemma":[0.9985347,0.0005847829,0.00017013965,0.000349622,0.00026906334,0.00009180237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008103047,0.000717699,0.00054718764,0.00075693906,0.0005069214,0.0010442492,0.0010580699,0.00048464505,0.0010870524],"category_scores_gemma":[0.0037615967,0.00029550036,0.0003273898,0.0009661088,0.0005906192,0.0017601278,0.0008770082,0.0007549454,0.00036544664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094623206,0.0005316833,0.033967912,0.00045151528,0.00014363686,0.00051033706,0.0005024327,0.5144225,0.18421966,0.015586677,0.0037002594,0.2450172],"study_design_scores_gemma":[0.00002761766,0.00025520258,0.007533493,0.000023135244,0.000057573867,0.0001193196,0.00012416154,0.93930376,0.042842302,0.006520277,0.0031622462,0.000030959705],"about_ca_topic_score_codex":0.0026924796,"about_ca_topic_score_gemma":0.0048825527,"teacher_disagreement_score":0.0026924796,"about_ca_system_score_codex":0.00058688427,"about_ca_system_score_gemma":0.0007629422,"threshold_uncertainty_score":0.00535357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23221618,0.00073196716,0.75302655,0.0005534866,0.00019948314,0.00013298825,0.00030020656,0.004095321,0.008743773],"genre_scores_gemma":[0.7195261,0.00034522163,0.27606568,0.00016037877,0.00008727596,0.00020008784,0.0007256571,0.00034007974,0.0025494602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99961025,0.000088127315,0.000023482773,0.00005781019,0.00014422016,0.00007615998],"domain_scores_gemma":[0.99929357,0.00020103902,0.00008836353,0.00017379869,0.00015585113,0.00008733265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035438733,0.00055031176,0.00038516277,0.00041081448,0.00062426494,0.00047804293,0.0008331152,0.00028533072,0.0016282217],"category_scores_gemma":[0.001704522,0.0002176768,0.00038011582,0.0009429573,0.00035318546,0.0006826684,0.0012324919,0.0008941219,0.00052335125],"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.0005296882,0.00039122553,0.006944771,0.0002965618,0.00012803951,0.00032195347,0.0004046088,0.6443429,0.067547515,0.01871367,0.019907532,0.24047162],"study_design_scores_gemma":[0.00003480219,0.000074598756,0.00087184925,0.0000065118056,0.000010920104,0.00003658874,0.000040416086,0.98205537,0.008097673,0.0051786886,0.0035831432,0.000009454115],"about_ca_topic_score_codex":0.004299094,"about_ca_topic_score_gemma":0.008048173,"teacher_disagreement_score":0.004299094,"about_ca_system_score_codex":0.000483134,"about_ca_system_score_gemma":0.0011494653,"threshold_uncertainty_score":0.0085481405},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11095086,0.0152353225,0.53549075,0.047821622,0.00432851,0.00029637298,0.0003788906,0.009246561,0.2762511],"genre_scores_gemma":[0.6350915,0.002767672,0.30738822,0.009299851,0.0016469113,0.00029889034,0.0006327719,0.0022440902,0.040630095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655414,0.000717679,0.00013249821,0.00047538892,0.0013420903,0.00077822973],"domain_scores_gemma":[0.9900947,0.002504304,0.0005796776,0.004172584,0.0017653954,0.0008833748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030816786,0.0010369117,0.00082738424,0.0009483936,0.0014712792,0.0048314338,0.0037453778,0.0021607503,0.017632557],"category_scores_gemma":[0.010844115,0.0005879729,0.00055463397,0.001618969,0.0022990229,0.009559571,0.006667823,0.0038905295,0.008789904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016890254,0.00070111954,0.008842929,0.00079496816,0.00008943605,0.0015694046,0.00073454273,0.010057491,0.024512025,0.37261748,0.0832161,0.49517545],"study_design_scores_gemma":[0.0002472594,0.0010272434,0.004266201,0.0007404689,0.00010494873,0.004099885,0.0010166249,0.1644527,0.053062342,0.22663422,0.5441659,0.00018217739],"about_ca_topic_score_codex":0.0011659464,"about_ca_topic_score_gemma":0.002819482,"teacher_disagreement_score":0.017632557,"about_ca_system_score_codex":0.0010071482,"about_ca_system_score_gemma":0.001903646,"threshold_uncertainty_score":0.058986723},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004238029,0.00040016166,0.93350536,0.00008306172,0.00004679522,0.00012614265,0.0008563626,0.05116921,0.009574936],"genre_scores_gemma":[0.07891004,0.0006365358,0.8989878,0.00028913873,0.000049574803,0.0007864093,0.002683284,0.0069298595,0.0107274],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923885,0.00015050128,0.00008006108,0.00009645465,0.00034579184,0.0000883276],"domain_scores_gemma":[0.9990551,0.00035235417,0.00009755973,0.00022080925,0.00023893078,0.000035271303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010465797,0.0012077511,0.0005121864,0.0013493849,0.000597392,0.0012599444,0.0019276206,0.0007147133,0.014880227],"category_scores_gemma":[0.0022718539,0.0007911349,0.0009987125,0.001095453,0.0004668125,0.001232797,0.0009327244,0.0013405541,0.0050261337],"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.00041553658,0.00028360085,0.0017041663,0.0014917398,0.00011454829,0.00039558095,0.00029204658,0.17353511,0.088159546,0.056780264,0.059370328,0.61745757],"study_design_scores_gemma":[0.000231303,0.00032494028,0.00105163,0.00028279764,0.00012762392,0.00055719813,0.00005373841,0.5902304,0.15055755,0.033331387,0.22310677,0.0001446345],"about_ca_topic_score_codex":0.0022548318,"about_ca_topic_score_gemma":0.0038782177,"teacher_disagreement_score":0.014880227,"about_ca_system_score_codex":0.00092014525,"about_ca_system_score_gemma":0.0020164924,"threshold_uncertainty_score":0.049779356},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18533312,0.0006298102,0.77510595,0.0004956669,0.0002648816,0.00031423115,0.00082219695,0.021486003,0.015548192],"genre_scores_gemma":[0.83330476,0.00027372662,0.15666592,0.00033833188,0.000049621274,0.00018970329,0.0009872365,0.00092921336,0.007261464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994721,0.000094804236,0.000027898375,0.00012097613,0.00019122074,0.00009302155],"domain_scores_gemma":[0.9993449,0.00016875421,0.000058348713,0.00021313377,0.00013863311,0.00007619831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004961265,0.0007697047,0.00036048298,0.0002477657,0.00027187608,0.0008220698,0.0021513514,0.0005965107,0.003211533],"category_scores_gemma":[0.0016427571,0.00031436302,0.00040925152,0.00028242153,0.00044990348,0.0010699271,0.0008134429,0.0012455145,0.00069308013],"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.0017095472,0.0005840076,0.009511125,0.00025356218,0.00014568066,0.00038698452,0.00021301584,0.7525852,0.04476053,0.029342553,0.02113893,0.13936888],"study_design_scores_gemma":[0.00005383514,0.00011200418,0.00051493855,0.0000052660494,0.000011778311,0.00004563068,0.000010524232,0.9815341,0.0101047475,0.0027828857,0.0048101065,0.000014210635],"about_ca_topic_score_codex":0.003972717,"about_ca_topic_score_gemma":0.0049086097,"teacher_disagreement_score":0.003972717,"about_ca_system_score_codex":0.00056169205,"about_ca_system_score_gemma":0.0010844391,"threshold_uncertainty_score":0.010743618},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042291142,0.00051212666,0.8681108,0.0003984831,0.00015633577,0.00018374852,0.0015228407,0.08272701,0.00409756],"genre_scores_gemma":[0.27581677,0.00028966623,0.706161,0.00044686534,0.00005923706,0.00033167066,0.0037109165,0.007977907,0.005205978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956554,0.000068564616,0.000034173852,0.00011282379,0.00016587393,0.00005298874],"domain_scores_gemma":[0.99908376,0.00039085516,0.000099735946,0.00017599044,0.00019882266,0.000050897066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060695346,0.0011552782,0.00036982418,0.0006718315,0.0002849792,0.00065128686,0.0019065411,0.0005852648,0.005267259],"category_scores_gemma":[0.0026238705,0.0007395455,0.0006697231,0.0004561522,0.00061288424,0.0023810533,0.001068581,0.0016922976,0.0020205623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007887749,0.00038661313,0.0099084545,0.0005606833,0.00012555908,0.0003997031,0.0004794091,0.23342332,0.04094003,0.023087945,0.058446366,0.6314532],"study_design_scores_gemma":[0.00004243515,0.000115169874,0.00044201154,0.00002520989,0.000016586366,0.00006212196,0.00003950701,0.95803267,0.01721033,0.012806053,0.011190194,0.000017707831],"about_ca_topic_score_codex":0.002184437,"about_ca_topic_score_gemma":0.0056680106,"teacher_disagreement_score":0.005267259,"about_ca_system_score_codex":0.0008409988,"about_ca_system_score_gemma":0.0016903598,"threshold_uncertainty_score":0.017620742},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010232386,0.0007577539,0.9160229,0.00053394533,0.0006907078,0.00060492737,0.0013771923,0.044747528,0.025032664],"genre_scores_gemma":[0.18214463,0.0013480402,0.72223186,0.0021059394,0.00059621007,0.0022948526,0.005806941,0.024602342,0.058869217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960544,0.00080888136,0.00044587336,0.0006351508,0.0015251668,0.0005305148],"domain_scores_gemma":[0.99272233,0.0019747184,0.0005236165,0.0025967173,0.001652297,0.00053025474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039919387,0.0011108884,0.0010348443,0.0011331328,0.0018690731,0.00550975,0.00514635,0.001751286,0.025458658],"category_scores_gemma":[0.012989165,0.0013103904,0.0017253704,0.0013307724,0.0020224575,0.008047282,0.0064198244,0.0040099313,0.007704278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014488125,0.0005065439,0.00454558,0.0013403913,0.0001942784,0.00045956435,0.0013613767,0.018198034,0.01657829,0.5924062,0.115594745,0.24736612],"study_design_scores_gemma":[0.0003760015,0.00028458692,0.0006743386,0.00023562029,0.00010624281,0.0004679229,0.00018234242,0.0809977,0.029664982,0.22176406,0.6650587,0.00018746185],"about_ca_topic_score_codex":0.002692101,"about_ca_topic_score_gemma":0.0030261197,"teacher_disagreement_score":0.025458658,"about_ca_system_score_codex":0.0013199011,"about_ca_system_score_gemma":0.0040333816,"threshold_uncertainty_score":0.085167706},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10310868,0.00068568514,0.7343373,0.0006934162,0.00088834466,0.0003146879,0.0015369258,0.086223714,0.072211325],"genre_scores_gemma":[0.42691928,0.00065796543,0.48823974,0.0006553959,0.00024062945,0.00039806459,0.0041027963,0.008973629,0.06981248],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99941874,0.00004914656,0.000047574278,0.00008538336,0.000302939,0.000096196956],"domain_scores_gemma":[0.9988257,0.00021256704,0.00007972389,0.00038825558,0.00044389747,0.00004978276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032535364,0.0010761761,0.000410819,0.0009000006,0.00048125547,0.0014591389,0.0014132089,0.00067129644,0.017353632],"category_scores_gemma":[0.0026408515,0.000372729,0.0003821465,0.0010420752,0.00047596046,0.0015178893,0.0009587392,0.0010020941,0.0106188785],"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.00094419386,0.00023115255,0.0030020517,0.00031116276,0.00006451523,0.0006428618,0.00040347336,0.022084577,0.111091316,0.053039744,0.09540941,0.7127756],"study_design_scores_gemma":[0.00021610028,0.00028715067,0.0016131738,0.00016922457,0.00008383977,0.00080807396,0.00021285254,0.19745374,0.50407964,0.038448405,0.25650084,0.00012703086],"about_ca_topic_score_codex":0.0021614127,"about_ca_topic_score_gemma":0.0020270352,"teacher_disagreement_score":0.017353632,"about_ca_system_score_codex":0.00069715054,"about_ca_system_score_gemma":0.0011958726,"threshold_uncertainty_score":0.058053672},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009419875,0.00110831,0.979579,0.00035934438,0.00015074371,0.00007889564,0.00013938232,0.0013127835,0.007851622],"genre_scores_gemma":[0.113202184,0.002752805,0.8758532,0.0003167717,0.00030281246,0.00034922303,0.00061623985,0.00039910106,0.006207737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989256,0.00027938662,0.00008108422,0.00013690253,0.00046378188,0.00011314451],"domain_scores_gemma":[0.9972716,0.0013083138,0.00015786597,0.00067738444,0.0005116385,0.00007307662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011683884,0.001055984,0.0008513571,0.0011245924,0.00085682597,0.0014882506,0.0016374501,0.00072664506,0.0061266795],"category_scores_gemma":[0.0058392603,0.0005171492,0.0006359563,0.00306728,0.0018170696,0.0035536098,0.0027406684,0.0013609624,0.00243914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032197038,0.00015714271,0.0013661627,0.00100951,0.00010199258,0.0004162903,0.0005895376,0.20152046,0.014803458,0.40378365,0.018523907,0.35740584],"study_design_scores_gemma":[0.00006352265,0.000105712235,0.00026032366,0.00011855988,0.000022284434,0.00022223355,0.00007775673,0.51451546,0.007431206,0.45939678,0.017749324,0.000036852343],"about_ca_topic_score_codex":0.0022282414,"about_ca_topic_score_gemma":0.0029074633,"teacher_disagreement_score":0.0061266795,"about_ca_system_score_codex":0.0006510783,"about_ca_system_score_gemma":0.0010740628,"threshold_uncertainty_score":0.020495772},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019280977,0.00060795626,0.9712971,0.0003378622,0.000107778455,0.000062773506,0.0006241802,0.019630628,0.0054036514],"genre_scores_gemma":[0.12643754,0.0011814542,0.8427385,0.0006940892,0.00015834213,0.0005797339,0.004020363,0.0034185357,0.020771386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920624,0.000106957035,0.00006417205,0.00018701464,0.00032318378,0.000112420596],"domain_scores_gemma":[0.9991246,0.00023354644,0.000055530843,0.00022808913,0.00031278862,0.00004549296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010269813,0.0013056371,0.0007252708,0.0007661482,0.00044980244,0.0016659851,0.0034899123,0.0012987215,0.01989189],"category_scores_gemma":[0.0043990603,0.0008118469,0.0012256771,0.00085620733,0.00054998323,0.0018279717,0.0018408798,0.003090356,0.00831042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048829446,0.00016687157,0.0014024642,0.0004445314,0.00017088308,0.00020205868,0.00014666126,0.3089022,0.008558768,0.14461917,0.089758456,0.44513968],"study_design_scores_gemma":[0.00003164625,0.000024460789,0.00020661451,0.000047509104,0.000021806374,0.000061806975,0.000013783965,0.9329907,0.005285063,0.03620307,0.025090076,0.000023450624],"about_ca_topic_score_codex":0.012598454,"about_ca_topic_score_gemma":0.015231309,"teacher_disagreement_score":0.01989189,"about_ca_system_score_codex":0.001583051,"about_ca_system_score_gemma":0.0018479431,"threshold_uncertainty_score":0.06654501},"labels":[],"label_agreement":null},{"id":"W2998780350","doi":"10.1145/3093334.2989235","title":"Efficiently implementing the copy semantics of MATLAB's arrays in JavaScript","year":2016,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; JavaScript; Programming language; Unobtrusive JavaScript; Compiler; MATLAB; Semantics (computer science); Source code; Program transformation; Leverage (statistics); Operating system; Rich Internet application; Artificial intelligence","score_opus":0.020773338509530243,"score_gpt":0.26858708977815793,"score_spread":0.24781375126862767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998780350","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01413928,0.00009906596,0.9023485,0.00022435932,0.000106682164,0.00007376414,0.00031148345,0.07571826,0.0069785523],"genre_scores_gemma":[0.24031892,0.0003156019,0.69970095,0.0007553595,0.00009143913,0.00023051613,0.001128939,0.044308998,0.013149166],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847156,0.00024086316,0.00015368182,0.00032926232,0.0006519077,0.00015275409],"domain_scores_gemma":[0.9943197,0.002675311,0.0003738579,0.0016760918,0.0008132603,0.00014181867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013630586,0.00089306437,0.00057630264,0.000517629,0.000518601,0.002531859,0.0020699638,0.0008153512,0.0059165466],"category_scores_gemma":[0.009455782,0.0008095668,0.00091324875,0.00052237866,0.0016001208,0.0036740657,0.0023744917,0.00219374,0.004405514],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016072295,0.0003436903,0.0107770255,0.0010110264,0.00014216,0.002875478,0.0058312425,0.05873979,0.14377117,0.1973032,0.050727826,0.52687025],"study_design_scores_gemma":[0.00021396733,0.00020390889,0.0018091586,0.0003752165,0.0001054471,0.0013591269,0.0004897677,0.28197414,0.4089356,0.09263888,0.21167436,0.00022048838],"about_ca_topic_score_codex":0.0018117774,"about_ca_topic_score_gemma":0.0028264094,"teacher_disagreement_score":0.0059165466,"about_ca_system_score_codex":0.0009182167,"about_ca_system_score_gemma":0.0016870574,"threshold_uncertainty_score":0.019792795},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046085272,0.0009711047,0.7429225,0.00093794375,0.00071156473,0.0002122325,0.00078206125,0.033622086,0.17375529],"genre_scores_gemma":[0.4497185,0.0009059381,0.40612206,0.0005244213,0.00018226872,0.0002946496,0.0019325572,0.008450955,0.13186863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997485,0.000034780736,0.000011309563,0.00007227639,0.00008514356,0.00004801623],"domain_scores_gemma":[0.9994455,0.0000765584,0.000046719386,0.0002464637,0.00012105139,0.00006370868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032007147,0.00059046136,0.0005083823,0.00041588093,0.0006986144,0.001214948,0.0015287655,0.0005229401,0.044027943],"category_scores_gemma":[0.0010139134,0.00031100577,0.00023289213,0.0005130549,0.0006961169,0.0017211877,0.0018499186,0.00083643454,0.016857553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054488215,0.00020962398,0.0029105227,0.0004614132,0.000038434915,0.00029287842,0.0003561294,0.01871745,0.07375803,0.08692851,0.08602172,0.72976047],"study_design_scores_gemma":[0.00007886694,0.00021041055,0.0019165509,0.00008878562,0.00002175113,0.00037975982,0.00017567436,0.4653346,0.14615333,0.028177802,0.35740224,0.000060283797],"about_ca_topic_score_codex":0.003997458,"about_ca_topic_score_gemma":0.006750263,"teacher_disagreement_score":0.044027943,"about_ca_system_score_codex":0.0006733394,"about_ca_system_score_gemma":0.0009952788,"threshold_uncertainty_score":0.1472882},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02193772,0.025919532,0.19346508,0.040773418,0.066468835,0.00110824,0.0027826778,0.004783754,0.6427608],"genre_scores_gemma":[0.07804367,0.00865302,0.012932713,0.0023509774,0.015814595,0.00029472174,0.001109244,0.0013257173,0.8794753],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995277,0.00014115854,0.000019234076,0.00007299788,0.00014921691,0.00008979706],"domain_scores_gemma":[0.9988042,0.00038766043,0.00003483365,0.0001718634,0.00030100092,0.0003004182],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013412623,0.0010985878,0.00091769284,0.0004814289,0.0016539696,0.0026300224,0.00083921355,0.0017189264,0.3471826],"category_scores_gemma":[0.0018436778,0.00037900283,0.00077735784,0.0010485298,0.000346948,0.0017002223,0.0015656294,0.0021362996,0.076094046],"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.0007045902,0.00023803697,0.0007123594,0.0005563321,0.00004727364,0.00015236269,0.00023081746,0.0030485417,0.010595431,0.012745113,0.67697716,0.29399213],"study_design_scores_gemma":[0.00013551641,0.00044669159,0.0021457265,0.00017517603,0.00009278311,0.00027186988,0.0001654874,0.009334003,0.009685439,0.011660296,0.9658414,0.000045595054],"about_ca_topic_score_codex":0.00075014133,"about_ca_topic_score_gemma":0.002730489,"teacher_disagreement_score":0.3471826,"about_ca_system_score_codex":0.0006898291,"about_ca_system_score_gemma":0.00097201404,"threshold_uncertainty_score":0.9311648},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8573511,0.0044788024,0.10966148,0.00047145243,0.00022556975,0.00030454007,0.0031839933,0.005790073,0.018532883],"genre_scores_gemma":[0.9017313,0.0011340826,0.08987116,0.00010005652,0.000064673775,0.00016831797,0.004607538,0.00038434053,0.0019385939],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956512,0.00080738927,0.00041052574,0.00036845784,0.0023933197,0.00036919402],"domain_scores_gemma":[0.9886262,0.0053705294,0.0006638476,0.0019624878,0.0030419389,0.00033499594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028105553,0.0007211218,0.0005120956,0.0018247718,0.0006485537,0.0016563579,0.0021807493,0.0007501585,0.0015653259],"category_scores_gemma":[0.015155916,0.0002737911,0.0003610157,0.004264726,0.00071022555,0.0045504593,0.0012293104,0.0006675829,0.0005267627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021926907,0.0010941185,0.047044825,0.0021937229,0.00031659717,0.00049771636,0.00085294596,0.33276114,0.0577754,0.036621228,0.03138889,0.48726076],"study_design_scores_gemma":[0.00015328226,0.0022138748,0.009857176,0.00011808542,0.00010888141,0.00048692853,0.0006992775,0.888905,0.069326304,0.011256164,0.016800173,0.00007492142],"about_ca_topic_score_codex":0.0030138385,"about_ca_topic_score_gemma":0.0029819116,"teacher_disagreement_score":0.0030138385,"about_ca_system_score_codex":0.0010441064,"about_ca_system_score_gemma":0.0012495534,"threshold_uncertainty_score":0.014863789},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03701225,0.0013724989,0.9425828,0.0003654345,0.000111916306,0.0002515731,0.0005910846,0.0051755104,0.012536943],"genre_scores_gemma":[0.2904559,0.00076527323,0.69683415,0.00021053063,0.00009648672,0.0005456964,0.0020095527,0.0008059857,0.008276411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987105,0.00022952654,0.00013621284,0.00020525337,0.00046211793,0.0002562987],"domain_scores_gemma":[0.9957931,0.0019988439,0.00040886085,0.0009745559,0.00062987924,0.00019479878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015754978,0.00090949604,0.00082291,0.0009566484,0.00086185936,0.0014653453,0.0019144918,0.0006800357,0.009140317],"category_scores_gemma":[0.00737778,0.0004912351,0.00070857664,0.0030235385,0.0007570137,0.0042271013,0.0017847967,0.0013098763,0.003678792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021580888,0.0006871931,0.0036795095,0.001392516,0.00012968906,0.00018101164,0.000438945,0.118659995,0.0337899,0.17197533,0.02259169,0.6443162],"study_design_scores_gemma":[0.0005219758,0.0006893636,0.00076937885,0.00012874384,0.000109040295,0.00036976015,0.00016423396,0.72396535,0.024935167,0.22572866,0.022544537,0.00007378485],"about_ca_topic_score_codex":0.0020525947,"about_ca_topic_score_gemma":0.004871905,"teacher_disagreement_score":0.009140317,"about_ca_system_score_codex":0.00090124493,"about_ca_system_score_gemma":0.0034096632,"threshold_uncertainty_score":0.030577421},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015862275,0.00012585412,0.9517081,0.00025976362,0.00010978133,0.00016612823,0.00020382252,0.01728418,0.014280072],"genre_scores_gemma":[0.12931432,0.00016788757,0.85652894,0.00034823662,0.00003403068,0.00029693017,0.0006853279,0.004010913,0.0086133545],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999398,0.00012379073,0.00006334567,0.00010169131,0.00025070526,0.000062481275],"domain_scores_gemma":[0.9993243,0.00023251053,0.000097406,0.00012610204,0.00017634989,0.000043361553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008722396,0.0011937363,0.0004665367,0.00047938514,0.00043072377,0.0012388717,0.0014010412,0.00083769957,0.0062401704],"category_scores_gemma":[0.0032484112,0.00043930006,0.0007997524,0.0004521654,0.0005973191,0.0014765644,0.0008500394,0.0011582931,0.0020610539],"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.0006498614,0.00040915795,0.0050584166,0.0009437482,0.00016447455,0.0005709696,0.00057314534,0.18198536,0.18510605,0.053813186,0.035495605,0.53523004],"study_design_scores_gemma":[0.0000958731,0.00017664378,0.0006323004,0.00008248785,0.00006392399,0.00022473537,0.00007779397,0.7919243,0.14397267,0.0055714604,0.057111926,0.00006595366],"about_ca_topic_score_codex":0.0018506513,"about_ca_topic_score_gemma":0.0022027118,"teacher_disagreement_score":0.0062401704,"about_ca_system_score_codex":0.00063391734,"about_ca_system_score_gemma":0.00086591707,"threshold_uncertainty_score":0.020875394},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9958061,0.00017422554,0.001207552,0.000027777947,0.000012152728,0.000012065701,0.00011288232,0.00032605042,0.00232126],"genre_scores_gemma":[0.99697757,0.0000713953,0.0018281928,0.000010957943,0.0000059625618,0.000010017345,0.00036340626,0.000024044666,0.0007084118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995333,0.00010026264,0.000027288941,0.00007401657,0.0001614355,0.000103674734],"domain_scores_gemma":[0.999156,0.00024165314,0.00007192772,0.0001458216,0.00029019374,0.000094391886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005151414,0.0004844571,0.00027874226,0.0005915138,0.00025547415,0.00032298075,0.0005335535,0.00022416103,0.0029313609],"category_scores_gemma":[0.0015448505,0.0001820577,0.00016873029,0.0010980191,0.00030777915,0.00055156765,0.00037688465,0.00026899937,0.00045484846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008924786,0.0006362065,0.07193938,0.00069071684,0.00028258766,0.0009812792,0.0005129646,0.45236892,0.23461302,0.004121386,0.014035361,0.2108934],"study_design_scores_gemma":[0.00034831374,0.0059555997,0.07914619,0.00003923013,0.00017906603,0.0006497829,0.00038068954,0.77234983,0.13028729,0.0013262582,0.009262298,0.00007546309],"about_ca_topic_score_codex":0.0028318535,"about_ca_topic_score_gemma":0.0022672724,"teacher_disagreement_score":0.0029313609,"about_ca_system_score_codex":0.0006801455,"about_ca_system_score_gemma":0.00048092284,"threshold_uncertainty_score":0.009806335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06640582,0.0012673417,0.907548,0.0004616833,0.00023369688,0.00030809388,0.00007794774,0.002756553,0.020940894],"genre_scores_gemma":[0.7211755,0.00060525537,0.26986933,0.00024744569,0.00005654635,0.0003374681,0.00015658667,0.00041854903,0.0071333856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929917,0.00009174859,0.000030568935,0.00007845397,0.00037904034,0.000120938246],"domain_scores_gemma":[0.99943787,0.00008289644,0.00006682325,0.0000817259,0.0002823864,0.00004827437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004907533,0.0005944411,0.0003513815,0.0004089136,0.00032849188,0.0010525144,0.0017405753,0.00041893864,0.0027585628],"category_scores_gemma":[0.0010758498,0.00033258303,0.00043360173,0.00036270366,0.0002995341,0.0007109657,0.00069088745,0.000893575,0.00090382044],"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.0004185437,0.0005351678,0.0048681065,0.00077100296,0.00023601072,0.00042337077,0.00028958198,0.44342107,0.1665384,0.07134264,0.013740024,0.29741597],"study_design_scores_gemma":[0.000059770722,0.0005435824,0.0010525497,0.00004728145,0.00007550267,0.00018129189,0.000056454966,0.9227891,0.041343737,0.0069407104,0.026883768,0.000026160375],"about_ca_topic_score_codex":0.0013029334,"about_ca_topic_score_gemma":0.0026520768,"teacher_disagreement_score":0.0027585628,"about_ca_system_score_codex":0.00075495796,"about_ca_system_score_gemma":0.0014500045,"threshold_uncertainty_score":0.009228289},"labels":[],"label_agreement":null},{"id":"W3003730485","doi":"10.1145/2168696.2047858","title":"Bootstrapping a self-hosted research virtual machine for JavaScript","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"JavaScript; Unobtrusive JavaScript; Computer science; Programming language; Rich Internet application; Virtual machine; Bytecode; Bootstrapping (finance); Operating system; Interpreter; Web application","score_opus":0.14326264038785352,"score_gpt":0.34024353194325196,"score_spread":0.19698089155539844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003730485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23339145,0.00033993612,0.63864446,0.000467723,0.0004069178,0.000644698,0.00021135295,0.114637196,0.011256231],"genre_scores_gemma":[0.6510752,0.00018870302,0.33090773,0.00039258038,0.00016210567,0.00041967808,0.00082154566,0.006082657,0.009949742],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99847883,0.000404855,0.00010907046,0.00035471257,0.00046056844,0.00019208332],"domain_scores_gemma":[0.99547833,0.00079935987,0.0003007096,0.002125932,0.00059403415,0.0007016382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020364202,0.0004742115,0.0006225301,0.0005197949,0.00048587413,0.0013614433,0.00265541,0.0007816565,0.0023532396],"category_scores_gemma":[0.0059874435,0.00057092187,0.00051177765,0.0002931433,0.0008206188,0.002525905,0.0025914758,0.0015217041,0.001516272],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032052642,0.001214999,0.020657318,0.0005358617,0.00032494953,0.0023026855,0.0026505035,0.029391576,0.38106102,0.056219522,0.052621353,0.449815],"study_design_scores_gemma":[0.00038971123,0.0008920336,0.00796833,0.00012408754,0.00013037729,0.0011851894,0.00024484334,0.6239824,0.24437413,0.018988445,0.10150645,0.00021392142],"about_ca_topic_score_codex":0.00036775446,"about_ca_topic_score_gemma":0.00029739027,"teacher_disagreement_score":0.00265541,"about_ca_system_score_codex":0.0005654206,"about_ca_system_score_gemma":0.0007466496,"threshold_uncertainty_score":0.010769784},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040247496,0.0003206366,0.94410235,0.00010217567,0.00006181803,0.00010708348,0.00022300157,0.00988402,0.004951525],"genre_scores_gemma":[0.32977656,0.00023942719,0.6657061,0.00012682492,0.000030957668,0.00026450437,0.00037303404,0.0011431489,0.0023394055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996081,0.00008666774,0.000026128904,0.000050086488,0.0001690453,0.00006001913],"domain_scores_gemma":[0.9995202,0.00021050546,0.0000682107,0.000102241036,0.000080892045,0.000017983168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005134925,0.0007610215,0.00034972338,0.0006762275,0.00032002723,0.00075851067,0.0009463699,0.0003923437,0.0032120706],"category_scores_gemma":[0.0011238786,0.0004094853,0.00049270643,0.00040435794,0.00048621112,0.0007090883,0.0006624123,0.0006291826,0.0007934414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003146378,0.00019412873,0.0031942138,0.00067008176,0.00010834453,0.00029519908,0.0002785291,0.34478593,0.21723887,0.033648826,0.011545013,0.3877262],"study_design_scores_gemma":[0.00008292447,0.00023946344,0.000764491,0.000047661404,0.000056021927,0.00015401351,0.00004981971,0.79953,0.16293126,0.017755821,0.018350717,0.000037876332],"about_ca_topic_score_codex":0.0011375151,"about_ca_topic_score_gemma":0.0024600213,"teacher_disagreement_score":0.0032120706,"about_ca_system_score_codex":0.00047811057,"about_ca_system_score_gemma":0.0013348737,"threshold_uncertainty_score":0.010745406},"labels":[],"label_agreement":null},{"id":"W3006309927","doi":"10.1145/3140587.3062355","title":"Synthesis of divide and conquer parallelism for loops","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Computer science; Divide and conquer algorithms; Joins; Parallel computing; Programmer; Traverse; Code (set theory); Parallelism (grammar); Programming language; Theoretical computer science; Set (abstract data type)","score_opus":0.033256249219077605,"score_gpt":0.29474834922124826,"score_spread":0.26149210000217066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006309927","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04468591,0.00017005429,0.94519866,0.00012158681,0.000040745166,0.00008681639,0.00009696621,0.0032067066,0.0063925544],"genre_scores_gemma":[0.30262458,0.0001339886,0.6921787,0.00008603431,0.00003404708,0.00018860295,0.0003021934,0.00076482206,0.0036870257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989507,0.0001606099,0.00005941252,0.00021140603,0.0004975408,0.00012029596],"domain_scores_gemma":[0.998444,0.00065078563,0.00017431098,0.00030812714,0.00037800873,0.00004473646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085744297,0.00064135465,0.0005953994,0.0006728781,0.00073196884,0.0009042123,0.00085465866,0.00044133642,0.0021871733],"category_scores_gemma":[0.0036251044,0.00043700042,0.00073142425,0.0007852393,0.0010367947,0.0008328235,0.0007491326,0.0007187099,0.0006174602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005122401,0.00023035551,0.0026001954,0.0006933629,0.00008042249,0.0004875264,0.0007529751,0.36935464,0.13299964,0.15014364,0.0064548333,0.33569014],"study_design_scores_gemma":[0.00008112924,0.00018485765,0.00025779405,0.00003777573,0.000044615743,0.00012755037,0.00007890261,0.8131881,0.11092631,0.061582476,0.01347137,0.000019240228],"about_ca_topic_score_codex":0.0016230056,"about_ca_topic_score_gemma":0.0024350549,"teacher_disagreement_score":0.0021871733,"about_ca_system_score_codex":0.00080161483,"about_ca_system_score_gemma":0.001439254,"threshold_uncertainty_score":0.007316768},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076431725,0.0008869538,0.49052906,0.0004239678,0.00034997647,0.000344805,0.0039487914,0.45495316,0.040920127],"genre_scores_gemma":[0.29586083,0.0014570697,0.47187507,0.0017150966,0.00019813105,0.0010655047,0.018497277,0.09902694,0.110304154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985556,0.00031842524,0.00010275917,0.00039246128,0.00045522006,0.00017562353],"domain_scores_gemma":[0.99743646,0.0008349297,0.00019272423,0.001039751,0.0003932952,0.00010284704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015577199,0.0018689823,0.000734182,0.0010865715,0.0006212676,0.0019498123,0.0031774307,0.0013141318,0.0697197],"category_scores_gemma":[0.005621833,0.001300551,0.001115595,0.0005131554,0.0009597492,0.003586522,0.0029307937,0.0021204886,0.021406382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00208098,0.00026541806,0.0042455937,0.0013954227,0.00016348189,0.00058571534,0.001100312,0.023317367,0.020099474,0.0690223,0.33507144,0.5426525],"study_design_scores_gemma":[0.00053226866,0.00045397851,0.0015564385,0.00033818447,0.00014172157,0.00088926894,0.00015752825,0.1778642,0.078673825,0.053054564,0.686084,0.0002541113],"about_ca_topic_score_codex":0.0026916156,"about_ca_topic_score_gemma":0.004673868,"teacher_disagreement_score":0.0697197,"about_ca_system_score_codex":0.0009268324,"about_ca_system_score_gemma":0.0013934771,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W3007153607","doi":"10.1145/3156685.3092256","title":"Analyzing memory management methods on integrated CPU-GPU systems","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; CUDA; Central processing unit; Shared memory; Memory management; Multi-core processor; Parallel computing; Software; CPU shielding; Embedded system; Computer architecture; Operating system; Overlay","score_opus":0.04683664990969114,"score_gpt":0.3514376544596579,"score_spread":0.30460100454996675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007153607","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8343518,0.0022494164,0.14834619,0.00031901075,0.00006454555,0.00012295348,0.00022054113,0.0017309631,0.012594664],"genre_scores_gemma":[0.9413906,0.00033272154,0.05542605,0.00006409002,0.000021292422,0.00011387805,0.00023890962,0.00031105327,0.0021014686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99875927,0.0002485647,0.00006390784,0.00019139897,0.0004663171,0.00027043268],"domain_scores_gemma":[0.99633586,0.0018220294,0.00041717786,0.0005710749,0.00070268876,0.0001512615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012072088,0.00061861554,0.00041007338,0.0011300768,0.00070729683,0.0013710519,0.0018961212,0.0007402689,0.0021564818],"category_scores_gemma":[0.008062777,0.00033086358,0.00039540947,0.0016539658,0.0010252172,0.001617482,0.0009261359,0.000747042,0.0002587536],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000596693,0.0005222717,0.030800251,0.0005081048,0.00017924381,0.00054651295,0.0009121349,0.73627436,0.027542645,0.059828687,0.0050228317,0.13726626],"study_design_scores_gemma":[0.00003529347,0.000067419016,0.0036204539,0.000021988593,0.000030361542,0.000068504814,0.00016217062,0.979965,0.007584373,0.0061489427,0.0022809932,0.0000146189805],"about_ca_topic_score_codex":0.008550125,"about_ca_topic_score_gemma":0.0065208185,"teacher_disagreement_score":0.008550125,"about_ca_system_score_codex":0.001843899,"about_ca_system_score_gemma":0.0014904332,"threshold_uncertainty_score":0.017000735},"labels":[],"label_agreement":null},{"id":"W3007439791","doi":"10.1145/3155284.3018762","title":"Contention in Structured Concurrency","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Concurrency; Data structure; Concurrent data structure; Theoretical computer science; Isolation (microbiology); Key (lock); Parallel computing; Directed acyclic graph; Distributed computing; Programming language; Algorithm","score_opus":0.039003094431741485,"score_gpt":0.3089167678228088,"score_spread":0.2699136733910673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007439791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04932217,0.0017396822,0.93297386,0.0014061424,0.00030686284,0.0004184968,0.00043902762,0.001377762,0.012015987],"genre_scores_gemma":[0.63263917,0.0015132093,0.35214317,0.00078396604,0.0005554093,0.001521813,0.00089573493,0.0006213682,0.009326089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98730844,0.0037159896,0.0013831602,0.0024075687,0.0041892924,0.0009955468],"domain_scores_gemma":[0.96811664,0.015931582,0.0025111856,0.00978311,0.0027123818,0.0009451099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064517604,0.000985788,0.0015033095,0.001985354,0.0028257188,0.0064598895,0.0036299748,0.0014840213,0.0072910786],"category_scores_gemma":[0.036134254,0.001458057,0.00164275,0.0032970386,0.006643715,0.01444898,0.008379186,0.004054184,0.0010681028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025895992,0.00011224834,0.0028414654,0.0003369238,0.00007448129,0.00022960527,0.0010902396,0.03606488,0.0039818403,0.9079892,0.002787958,0.04423228],"study_design_scores_gemma":[0.00013813325,0.00018097354,0.00042029365,0.0001267159,0.000082861254,0.0003504121,0.00026222286,0.17480896,0.007157841,0.78940356,0.026992543,0.00007540374],"about_ca_topic_score_codex":0.003285418,"about_ca_topic_score_gemma":0.0025843054,"teacher_disagreement_score":0.0072910786,"about_ca_system_score_codex":0.003325396,"about_ca_system_score_gemma":0.0042087496,"threshold_uncertainty_score":0.03412056},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68395084,0.0002662277,0.30302337,0.0001552113,0.00007940181,0.00007868351,0.00010596348,0.0019090031,0.010431301],"genre_scores_gemma":[0.8888498,0.00008574976,0.10840988,0.00003776404,0.00001779565,0.00004623233,0.00016879631,0.00018320745,0.0022007371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998265,0.000024731156,0.000011013124,0.000034825007,0.000046388832,0.0000565976],"domain_scores_gemma":[0.9996978,0.00009697869,0.000049521997,0.00006843989,0.000053554984,0.000033709577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022641689,0.0004956822,0.0003492539,0.00023907563,0.00034311335,0.00051430543,0.00060034863,0.00022930458,0.001684759],"category_scores_gemma":[0.00066555256,0.0001435317,0.00020791224,0.0004002149,0.00027707094,0.00062242086,0.00043802432,0.00040832424,0.00036753278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007805655,0.00046288455,0.0046268706,0.00013581605,0.00005175463,0.00019982028,0.00015935028,0.67854536,0.11035507,0.00993042,0.00381135,0.19094068],"study_design_scores_gemma":[0.00006429531,0.00015947166,0.0009615941,0.0000032040223,0.000011384959,0.00002379673,0.000059041897,0.97506803,0.02039009,0.0016562412,0.001594398,0.000008520064],"about_ca_topic_score_codex":0.0022956063,"about_ca_topic_score_gemma":0.005187707,"teacher_disagreement_score":0.0022956063,"about_ca_system_score_codex":0.00037873248,"about_ca_system_score_gemma":0.00087340304,"threshold_uncertainty_score":0.005636096},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45004508,0.0009780569,0.5379155,0.0002165429,0.000097767406,0.00007888212,0.00002860222,0.00695214,0.0036874507],"genre_scores_gemma":[0.88685995,0.00020321128,0.11056151,0.000071626724,0.00003641529,0.00008411703,0.00006532973,0.0002459635,0.0018719103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953234,0.00007735004,0.00003306585,0.00006907781,0.00017710771,0.00011103768],"domain_scores_gemma":[0.99896574,0.00035681654,0.00012140558,0.00033659252,0.00016524734,0.00005426865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004442552,0.00044195887,0.00039498752,0.00042211535,0.00038855473,0.0005680061,0.0009583827,0.00032241346,0.00070386915],"category_scores_gemma":[0.0016070481,0.00042787712,0.0003194989,0.0005910351,0.00054030714,0.0010390482,0.00081434875,0.00070791546,0.00026528467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011649928,0.00035411876,0.007991065,0.00028465613,0.00007227285,0.00042269565,0.0005770087,0.16033043,0.3499368,0.012344554,0.00391686,0.46260455],"study_design_scores_gemma":[0.00012521734,0.0007250664,0.0019752402,0.000016124775,0.0000605074,0.000252523,0.00006587173,0.8654517,0.119737186,0.0059594805,0.0055990256,0.000032010044],"about_ca_topic_score_codex":0.0013212035,"about_ca_topic_score_gemma":0.0021810336,"teacher_disagreement_score":0.0013212035,"about_ca_system_score_codex":0.00027688342,"about_ca_system_score_gemma":0.0009912263,"threshold_uncertainty_score":0.002627015},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042515197,0.008672649,0.12274463,0.04059985,0.05574644,0.0022543804,0.029058075,0.027301103,0.7093714],"genre_scores_gemma":[0.019591877,0.00498336,0.021655101,0.0046348334,0.011144088,0.0010857956,0.016952518,0.008157606,0.9117948],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993568,0.00012478896,0.000027031809,0.00012241103,0.00023778205,0.00013112427],"domain_scores_gemma":[0.9971528,0.0005901292,0.00008240623,0.00044281324,0.00070755155,0.0010243575],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002621335,0.0011854143,0.0008972252,0.00061828597,0.0016766575,0.0037118332,0.0014217441,0.0019078436,0.64283705],"category_scores_gemma":[0.0039929324,0.00036250797,0.0012726301,0.0009838608,0.00035164706,0.0033902521,0.0027288299,0.0029803624,0.3622931],"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.0001800908,0.00005916993,0.000082725506,0.00017545522,0.000008491872,0.000021520433,0.000051641575,0.00012884707,0.0015610364,0.0039829747,0.94358283,0.05016529],"study_design_scores_gemma":[0.00006224666,0.000081393024,0.00034942446,0.00010853577,0.000008088182,0.00005864454,0.000035265082,0.0005172165,0.0013803969,0.0050069788,0.9923719,0.000019851637],"about_ca_topic_score_codex":0.0010360369,"about_ca_topic_score_gemma":0.0021133078,"teacher_disagreement_score":0.64283705,"about_ca_system_score_codex":0.0009481077,"about_ca_system_score_gemma":0.0019587304,"threshold_uncertainty_score":0.5094496},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4900979,0.0010494054,0.46792892,0.0002493531,0.00017603066,0.00031052908,0.00037484508,0.010326408,0.029486557],"genre_scores_gemma":[0.8266021,0.00016790627,0.16544941,0.00013210574,0.00003890964,0.00010904342,0.00058950484,0.00014627542,0.0067646843],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982375,0.000027991462,0.000011565378,0.000030430552,0.0000688413,0.00003738919],"domain_scores_gemma":[0.9998598,0.0000152234525,0.000018635132,0.000037868394,0.00005606319,0.000012427105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117242096,0.00034786426,0.00023509098,0.00024238855,0.00018629148,0.00036116407,0.0009705533,0.00027146167,0.0018214345],"category_scores_gemma":[0.00018048484,0.00016468059,0.00023170453,0.00036314997,0.000110085275,0.00031510717,0.00020708641,0.00035804338,0.0008086024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010038452,0.00032808344,0.0038624934,0.0004736555,0.00012770593,0.00089240214,0.00014729636,0.090921804,0.64855766,0.013397016,0.012816659,0.22747138],"study_design_scores_gemma":[0.0004066567,0.0049806884,0.009377828,0.00005099037,0.00022878029,0.0025425442,0.000071069786,0.5432181,0.38353088,0.00277126,0.05269882,0.00012249149],"about_ca_topic_score_codex":0.0008058563,"about_ca_topic_score_gemma":0.001494456,"teacher_disagreement_score":0.0018214345,"about_ca_system_score_codex":0.00023450243,"about_ca_system_score_gemma":0.0006136096,"threshold_uncertainty_score":0.0060932636},"labels":[],"label_agreement":null},{"id":"W3015598440","doi":"10.1145/3140587.3062371","title":"Low overhead dynamic binary translation on ARM","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Royal Society of Canada","keywords":"Computer science; Binary translation; Spec#; ARM architecture; Instruction set; Overhead (engineering); Parallel computing; Benchmark (surveying); Embedded system; Out-of-order execution; Operating system; Software; Programming language","score_opus":0.03242167568277721,"score_gpt":0.30312088790763136,"score_spread":0.27069921222485416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015598440","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5511543,0.0022438266,0.29802263,0.00057368854,0.00041629377,0.00025482973,0.0009842787,0.09187828,0.05447187],"genre_scores_gemma":[0.8847554,0.00030492034,0.094256245,0.0002288789,0.000050870534,0.0001695387,0.0010377446,0.0012663656,0.017930148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994567,0.00007783783,0.00003641716,0.00009036194,0.0002172973,0.0001212982],"domain_scores_gemma":[0.999335,0.00015857929,0.00009232003,0.00020308072,0.00018047291,0.000030457242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002864925,0.0007198574,0.0003747615,0.00047484503,0.00035304626,0.0006634902,0.00094966165,0.0002958316,0.006098103],"category_scores_gemma":[0.0013223169,0.0003623622,0.00024042568,0.0006268441,0.00028797155,0.0008757018,0.0007183778,0.0006092367,0.001807696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003046432,0.00028691068,0.003941839,0.00061705435,0.000069499096,0.0004782116,0.00029492826,0.044732876,0.41074896,0.015519318,0.03196532,0.48829857],"study_design_scores_gemma":[0.00051067345,0.0014956458,0.009305367,0.00014143047,0.00013472307,0.00061741064,0.0001242682,0.40174526,0.48987994,0.00851163,0.08737882,0.00015480848],"about_ca_topic_score_codex":0.0020427743,"about_ca_topic_score_gemma":0.002624813,"teacher_disagreement_score":0.006098103,"about_ca_system_score_codex":0.00062305003,"about_ca_system_score_gemma":0.0009888983,"threshold_uncertainty_score":0.020400167},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6235307,0.0003288062,0.36778927,0.00052890147,0.00006954036,0.000042917774,0.000636292,0.0017742205,0.005299292],"genre_scores_gemma":[0.9870143,0.000047825157,0.01178078,0.000020083795,0.000017210983,0.000015000781,0.00021878263,0.00012849565,0.0007574588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9993305,0.00014376282,0.000022836743,0.00009880156,0.00022924515,0.00017489136],"domain_scores_gemma":[0.99610114,0.0017710386,0.00031561308,0.0007572052,0.00079881,0.00025618574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090718304,0.000352405,0.0006437884,0.001384281,0.000543357,0.0012290371,0.0014741971,0.0006164549,0.0036432473],"category_scores_gemma":[0.007885118,0.0002960683,0.0007182067,0.0011410204,0.00064339093,0.0016343473,0.0010944527,0.0012129009,0.00034898033],"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.0009975024,0.00029545295,0.032710835,0.00018309723,0.00024093673,0.00050574826,0.0004441678,0.73020786,0.019352658,0.13929352,0.0052240766,0.07054421],"study_design_scores_gemma":[0.0000027213716,0.00001299468,0.0015914874,0.0000034961572,0.000007659744,0.00001116994,0.000020816438,0.99299276,0.0007508039,0.0044052815,0.00019523752,0.0000056124763],"about_ca_topic_score_codex":0.010457291,"about_ca_topic_score_gemma":0.008547309,"teacher_disagreement_score":0.010457291,"about_ca_system_score_codex":0.0009078952,"about_ca_system_score_gemma":0.001188266,"threshold_uncertainty_score":0.020792842},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6483912,0.0034313416,0.32480764,0.0005928145,0.00014917823,0.000046396523,0.0004667919,0.0021220353,0.019992633],"genre_scores_gemma":[0.9666248,0.00026478228,0.031283222,0.00007777721,0.000009981472,0.00003232264,0.00010360977,0.00003607451,0.0015673722],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991846,0.000010392522,0.0000031481966,0.000017499868,0.00003453655,0.00001591938],"domain_scores_gemma":[0.99992,0.00002060981,0.000015023542,0.0000142019635,0.000025149142,0.0000049785635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000072332245,0.00028799844,0.00022947825,0.00023035555,0.00016923381,0.0004988356,0.0008221732,0.0003301587,0.0015566057],"category_scores_gemma":[0.00018313839,0.00010887333,0.00018970674,0.00043077057,0.00015355053,0.00069502776,0.00031372052,0.0002321955,0.0002521283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004402101,0.0001621153,0.0042504948,0.00042556418,0.00013055396,0.001051845,0.00023022453,0.30247334,0.46452716,0.01396347,0.0074589937,0.20488608],"study_design_scores_gemma":[0.000026387579,0.00035645626,0.0014483151,0.000027808335,0.00004439558,0.00039739904,0.000111922454,0.839652,0.14499192,0.0034645947,0.009446224,0.000032556076],"about_ca_topic_score_codex":0.0007916108,"about_ca_topic_score_gemma":0.0022774693,"teacher_disagreement_score":0.0015566057,"about_ca_system_score_codex":0.00031270107,"about_ca_system_score_gemma":0.00025375033,"threshold_uncertainty_score":0.00520736},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03286703,0.0020206678,0.5773672,0.0008364647,0.0013197724,0.00076182414,0.0066845263,0.1828772,0.1952654],"genre_scores_gemma":[0.28499034,0.0020398397,0.4939185,0.002264254,0.0004959392,0.0014399715,0.031400725,0.03845082,0.14499967],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932516,0.00009757986,0.00004697878,0.00011920634,0.00029070218,0.000120508834],"domain_scores_gemma":[0.9993782,0.00008807737,0.000053510044,0.00021754252,0.00018962854,0.00007300541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007598722,0.0010249321,0.0005369308,0.00051149185,0.0004923846,0.0015572372,0.0025951453,0.0006501454,0.044628724],"category_scores_gemma":[0.0014698949,0.0006726961,0.00074322004,0.00063392636,0.000541576,0.0017818316,0.0018862905,0.001703826,0.019597473],"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.0023575618,0.0004028586,0.006598553,0.0011250994,0.00022972489,0.00070333574,0.00048942445,0.034924842,0.058255084,0.1335089,0.37928697,0.38211763],"study_design_scores_gemma":[0.0003812928,0.00058453804,0.0011793362,0.00010263625,0.00007744908,0.00064596906,0.000059906142,0.15898024,0.06681492,0.028891332,0.7421915,0.0000909194],"about_ca_topic_score_codex":0.0010874579,"about_ca_topic_score_gemma":0.0013386651,"teacher_disagreement_score":0.044628724,"about_ca_system_score_codex":0.0005657136,"about_ca_system_score_gemma":0.0013957681,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91369927,0.00054573384,0.07646914,0.00043239293,0.00003793277,0.000059707138,0.00067620835,0.0022449167,0.0058347196],"genre_scores_gemma":[0.98029476,0.00011274462,0.0176265,0.000046151665,0.000019101011,0.000034001427,0.0008310913,0.00019537083,0.0008402342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999089,0.00013557241,0.000027859505,0.00012554743,0.00047707607,0.00014487014],"domain_scores_gemma":[0.9961118,0.0018053807,0.0003147391,0.00071118755,0.0009348019,0.00012204359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080010074,0.0006011165,0.00039783193,0.00067278324,0.00041651516,0.00060584873,0.000793905,0.0004700607,0.0014326649],"category_scores_gemma":[0.0075912136,0.00030391014,0.00039722616,0.0011200268,0.0006480437,0.0014663251,0.00054027105,0.0007013776,0.00037724985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050145073,0.0002109167,0.013777914,0.00017687574,0.000060592192,0.00016225752,0.00015387981,0.8803393,0.031459104,0.012181879,0.0039670384,0.057008833],"study_design_scores_gemma":[0.0000061298533,0.00007270379,0.0017070288,0.0000028780642,0.000004006954,0.000023862209,0.00001135171,0.9918222,0.0046969783,0.0013801159,0.00026689982,0.0000058879937],"about_ca_topic_score_codex":0.0043969615,"about_ca_topic_score_gemma":0.0033298275,"teacher_disagreement_score":0.0043969615,"about_ca_system_score_codex":0.0008260655,"about_ca_system_score_gemma":0.0015812658,"threshold_uncertainty_score":0.00874275},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1828395,0.014167954,0.6318971,0.011223261,0.0021926968,0.00040880262,0.0002016032,0.003151841,0.1539173],"genre_scores_gemma":[0.58350706,0.004879016,0.3713814,0.0021839107,0.00047347008,0.00030002452,0.00012740235,0.00070437085,0.03644341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937254,0.00017841173,0.000069536276,0.000064131214,0.00022262114,0.00009270279],"domain_scores_gemma":[0.999116,0.00026716772,0.000089753055,0.000111339694,0.0003695532,0.000046111116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016221397,0.0003707296,0.0002621351,0.00054527353,0.00057058537,0.0021971266,0.0005676678,0.0005840492,0.0017125534],"category_scores_gemma":[0.00298763,0.0005713764,0.00038504784,0.00069330935,0.0007723192,0.002097129,0.00058779895,0.0019343881,0.00074342266],"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.0006031799,0.00009443104,0.003918855,0.000698346,0.000056553537,0.00085984817,0.0012744361,0.071036406,0.06814293,0.53537494,0.009803657,0.30813634],"study_design_scores_gemma":[0.00017529455,0.0011308757,0.0053322352,0.0006373885,0.00029770588,0.0013692968,0.0009680477,0.13863418,0.066616185,0.23247631,0.5521968,0.00016579595],"about_ca_topic_score_codex":0.0013198799,"about_ca_topic_score_gemma":0.0034244577,"teacher_disagreement_score":0.0021971266,"about_ca_system_score_codex":0.0007446099,"about_ca_system_score_gemma":0.0018032754,"threshold_uncertainty_score":0.008578777},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030219197,0.002886495,0.9284108,0.0010861959,0.0003636176,0.00024786248,0.00029317074,0.013686983,0.022805573],"genre_scores_gemma":[0.48653403,0.0017336769,0.48802984,0.001342699,0.00041119766,0.0009870952,0.00089677057,0.0023770158,0.017687606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984713,0.00035217882,0.000109898254,0.00021983728,0.0005206981,0.00032603604],"domain_scores_gemma":[0.9978684,0.0003440189,0.00013280386,0.0011212226,0.00028565296,0.00024800308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001666177,0.0008158466,0.0008027454,0.00086120836,0.0007701559,0.003402231,0.006193829,0.0013686704,0.0065090135],"category_scores_gemma":[0.0031863889,0.00073134026,0.00069355255,0.0007502286,0.0016976335,0.0065415082,0.0053212256,0.002590743,0.0020899335],"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.0020974942,0.0003915307,0.0039825127,0.00069769804,0.0001937699,0.0007888072,0.0015831925,0.041956905,0.06126358,0.5667531,0.04127616,0.27901524],"study_design_scores_gemma":[0.0005142028,0.0010437751,0.0012509985,0.00030446064,0.00022935234,0.0010048912,0.00028470068,0.3921258,0.050480843,0.151344,0.40114966,0.00026735847],"about_ca_topic_score_codex":0.0021306793,"about_ca_topic_score_gemma":0.0021560478,"teacher_disagreement_score":0.0065090135,"about_ca_system_score_codex":0.00093167496,"about_ca_system_score_gemma":0.001729114,"threshold_uncertainty_score":0.021774769},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051618073,0.00039793705,0.89869875,0.00017032618,0.00017022454,0.00042892544,0.00016128036,0.034134734,0.01421983],"genre_scores_gemma":[0.5552856,0.00032341536,0.41143325,0.0004759636,0.00015617895,0.00070523884,0.00073465327,0.0073801484,0.023505589],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997615,0.00058596773,0.00023537918,0.0005329339,0.00071535335,0.00031544527],"domain_scores_gemma":[0.9937959,0.0013013604,0.0002798323,0.0034470994,0.00085804274,0.00031772297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003331078,0.0007729053,0.0007889445,0.00032923114,0.0006853378,0.002024865,0.0029268877,0.0006984383,0.006629986],"category_scores_gemma":[0.008430805,0.00072482263,0.0007996202,0.00036524129,0.00094940304,0.002633905,0.0023264948,0.0021647636,0.002032415],"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.0028746272,0.0009092205,0.021048352,0.0010844959,0.00036427917,0.0006250876,0.0035126645,0.047256857,0.17873383,0.10280777,0.0370543,0.6037284],"study_design_scores_gemma":[0.00028300544,0.0008008109,0.004110433,0.00015621983,0.00023649329,0.00076743105,0.00021301789,0.5332711,0.18228339,0.04544426,0.23221993,0.00021393156],"about_ca_topic_score_codex":0.0010688279,"about_ca_topic_score_gemma":0.001352693,"teacher_disagreement_score":0.006629986,"about_ca_system_score_codex":0.0007715336,"about_ca_system_score_gemma":0.0017969009,"threshold_uncertainty_score":0.022179484},"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":"other","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005388192,0.019811595,0.13759266,0.018718142,0.0123700285,0.00030095337,0.0020064525,0.0053487592,0.79846317],"genre_scores_gemma":[0.043625332,0.011358282,0.05412431,0.0048793955,0.0013821354,0.00027227178,0.0012547192,0.00183964,0.881264],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989441,0.00008451078,0.00005944857,0.0003509552,0.0004473934,0.00011365468],"domain_scores_gemma":[0.99902964,0.00026606504,0.00006105523,0.0001627528,0.0003077767,0.00017268499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070722064,0.0012325945,0.0006902082,0.0025895897,0.002020972,0.0029886842,0.0012859899,0.0025356503,0.23882952],"category_scores_gemma":[0.0032711397,0.0005171936,0.0007236311,0.0013584541,0.0018006878,0.003168725,0.0029851554,0.0028274015,0.09120049],"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.00015372362,0.000044507393,0.00062319794,0.00033613874,0.000026564998,0.0010269594,0.00025615093,0.0012076169,0.0017915026,0.33220097,0.2987616,0.3635711],"study_design_scores_gemma":[0.000019779973,0.000027967802,0.00018772551,0.00013007657,0.000007429135,0.0009917978,0.000053312597,0.00085109484,0.0012086165,0.048135605,0.9483647,0.000021919544],"about_ca_topic_score_codex":0.0023326555,"about_ca_topic_score_gemma":0.005267407,"teacher_disagreement_score":0.23882952,"about_ca_system_score_codex":0.0015412595,"about_ca_system_score_gemma":0.0019004795,"threshold_uncertainty_score":0.7989644},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47049198,0.0015676437,0.5178914,0.0003023045,0.00010748665,0.00007169502,0.00013257485,0.004866656,0.004568283],"genre_scores_gemma":[0.9771243,0.000098249504,0.022031646,0.00004003903,0.0000104974915,0.00002469805,0.000047155827,0.00007709133,0.0005463845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928063,0.00014585331,0.000043225147,0.00016549867,0.00018913217,0.00017565051],"domain_scores_gemma":[0.9988136,0.00025138943,0.0002862777,0.00035561202,0.00021565997,0.00007749578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005686187,0.0008278145,0.0003758818,0.0010696857,0.00043811827,0.00075499073,0.0012153307,0.00035481263,0.000819134],"category_scores_gemma":[0.002662723,0.00028969286,0.00022627272,0.00055066595,0.00038166903,0.0011251009,0.00068953104,0.00056119385,0.00019403399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013134986,0.00027223243,0.014096194,0.00018774875,0.000109777015,0.00034410876,0.00040565451,0.530379,0.19015045,0.007849324,0.0029447488,0.25194734],"study_design_scores_gemma":[0.000013837594,0.00009039869,0.0015368941,0.000013538217,0.000023073293,0.0000759982,0.000042755186,0.95855314,0.036197457,0.0017111987,0.001722574,0.000019234016],"about_ca_topic_score_codex":0.003968998,"about_ca_topic_score_gemma":0.006301431,"teacher_disagreement_score":0.003968998,"about_ca_system_score_codex":0.001001606,"about_ca_system_score_gemma":0.0010038749,"threshold_uncertainty_score":0.007891774},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95655125,0.0008299235,0.035321686,0.0003699205,0.00006915636,0.00014276961,0.00089656917,0.0011384219,0.004680325],"genre_scores_gemma":[0.98803574,0.00021472287,0.010033289,0.00011254423,0.000030199031,0.00008723501,0.0006580889,0.00014509351,0.0006830927],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860865,0.0003037064,0.00007580295,0.00029462602,0.000467633,0.0002496389],"domain_scores_gemma":[0.9964036,0.0019937507,0.00040437514,0.00060222077,0.00045347505,0.00014263784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009335179,0.00092167204,0.00052192697,0.0011122661,0.00054160104,0.0012932842,0.00081748515,0.0005762109,0.0023959796],"category_scores_gemma":[0.004441581,0.00039887836,0.00049684395,0.0008101047,0.0006994175,0.0020809616,0.001044281,0.0015368939,0.00039633387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017208816,0.0018976583,0.12956645,0.001033479,0.00040330854,0.0017302177,0.0018790294,0.3295885,0.3628445,0.023190843,0.009123554,0.13702159],"study_design_scores_gemma":[0.000044875604,0.0007422125,0.05366025,0.000048618116,0.000112364774,0.0005057006,0.0007996615,0.8719315,0.056431636,0.010147513,0.005482341,0.00009335368],"about_ca_topic_score_codex":0.0024637324,"about_ca_topic_score_gemma":0.0028979862,"teacher_disagreement_score":0.0024637324,"about_ca_system_score_codex":0.00059873756,"about_ca_system_score_gemma":0.0007010217,"threshold_uncertainty_score":0.008015394},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028061474,0.0001225275,0.9663485,0.00012585493,0.00003247368,0.00009144004,0.000049594706,0.001503211,0.0036647958],"genre_scores_gemma":[0.6038435,0.00017738705,0.3914634,0.00019305822,0.00002766126,0.00015672787,0.00020370116,0.000397759,0.0035368546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803215,0.0007231478,0.000121947196,0.00023051028,0.0006528313,0.00023940492],"domain_scores_gemma":[0.99786276,0.0006840204,0.00017564047,0.0008557495,0.00038292425,0.000038821305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013925537,0.0008694457,0.00044671504,0.00040826356,0.0005119548,0.00092190166,0.0013129101,0.0005444016,0.0019986958],"category_scores_gemma":[0.0029179412,0.0005940815,0.0010010416,0.00032504887,0.0006529506,0.0009791538,0.0013028615,0.0013374927,0.0005935557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051445997,0.00040110838,0.002011869,0.00058144145,0.00017919987,0.0007268023,0.00058195856,0.41031453,0.11545119,0.061681863,0.005211121,0.40234444],"study_design_scores_gemma":[0.00005838791,0.0002798672,0.0006266594,0.000037323527,0.00007859748,0.00025866902,0.00008637143,0.88463974,0.052588955,0.052230585,0.009091852,0.00002299414],"about_ca_topic_score_codex":0.0008791425,"about_ca_topic_score_gemma":0.0020338285,"teacher_disagreement_score":0.0019986958,"about_ca_system_score_codex":0.00028003444,"about_ca_system_score_gemma":0.0010321755,"threshold_uncertainty_score":0.0073646307},"labels":[],"label_agreement":null},{"id":"W3033938031","doi":"10.1145/2076021.2048077","title":"Kind analysis for MATLAB","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Programming language; Compiler; Scripting language; MATLAB; Identifier; Syntax; Variety (cybernetics); Artificial intelligence","score_opus":0.06272742362140878,"score_gpt":0.28008440688772573,"score_spread":0.21735698326631697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033938031","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016970696,0.0002693095,0.93548226,0.00045930673,0.00024960467,0.0000710435,0.0009219085,0.04689857,0.01395091],"genre_scores_gemma":[0.067292675,0.0007850705,0.89139944,0.00081532216,0.00029184573,0.00053066603,0.0028593028,0.021926932,0.014098781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99752265,0.0006230171,0.00028020373,0.00026224682,0.0011293234,0.00018257146],"domain_scores_gemma":[0.9941468,0.0024903503,0.00049794966,0.0010014924,0.0017246179,0.000138705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002094528,0.0010250068,0.0007016851,0.002629072,0.0010691091,0.0028458245,0.0019723508,0.0008282137,0.050564088],"category_scores_gemma":[0.016246017,0.00064182153,0.0021316723,0.0015146068,0.0010317817,0.0040788874,0.002733902,0.0020667452,0.014770655],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038972363,0.000053665124,0.0026103535,0.0012242966,0.00011901496,0.00060574664,0.00056784414,0.018168652,0.008257387,0.43668824,0.16625094,0.36506426],"study_design_scores_gemma":[0.00008880839,0.000071071445,0.0009555434,0.00038182922,0.00008032678,0.0011361057,0.00021032103,0.13149653,0.020035556,0.3345361,0.51089895,0.00010895007],"about_ca_topic_score_codex":0.0015892106,"about_ca_topic_score_gemma":0.0020702938,"teacher_disagreement_score":0.050564088,"about_ca_system_score_codex":0.0011188276,"about_ca_system_score_gemma":0.0019165027,"threshold_uncertainty_score":0.16915369},"labels":[],"label_agreement":null},{"id":"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0080328295,0.68326575,0.16474771,0.01941353,0.0020250517,0.00009360793,0.00015993649,0.00048780596,0.12177385],"genre_scores_gemma":[0.20596646,0.67405784,0.06736677,0.008466386,0.004285207,0.00032656363,0.00029601488,0.00051708444,0.03871771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99640983,0.0009619621,0.0002352711,0.00052089593,0.0015521778,0.0003197942],"domain_scores_gemma":[0.99345773,0.004047456,0.00030498646,0.0013090892,0.00076702115,0.000113663475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002908535,0.0009969538,0.0009996578,0.0018120127,0.0007970371,0.0042554033,0.0019557702,0.0028023245,0.0073953024],"category_scores_gemma":[0.008953225,0.0005635835,0.0008255545,0.0021021874,0.0055475645,0.01137913,0.0026493764,0.0035558967,0.003274616],"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.000040189658,0.000029279952,0.00021365473,0.0015447893,0.000034447483,0.000093439565,0.00018934211,0.0033612049,0.0015631472,0.7683734,0.011112945,0.2134441],"study_design_scores_gemma":[0.000025244875,0.00008117081,0.00040978807,0.0015570512,0.000050787985,0.0007933183,0.0001505766,0.0035582993,0.004308491,0.50104517,0.48798057,0.000039565115],"about_ca_topic_score_codex":0.0007887329,"about_ca_topic_score_gemma":0.00083482894,"teacher_disagreement_score":0.0073953024,"about_ca_system_score_codex":0.0022522428,"about_ca_system_score_gemma":0.0024730372,"threshold_uncertainty_score":0.024739742},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88345647,0.0011616054,0.105978474,0.0001816088,0.000064633314,0.00010720664,0.0001485684,0.0018202685,0.0070811473],"genre_scores_gemma":[0.9461298,0.00025368517,0.051254027,0.00006517957,0.000011151752,0.00006152638,0.00011183495,0.00009126937,0.0020214918],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973184,0.000049882365,0.000026240474,0.00004262268,0.0000832877,0.00006610823],"domain_scores_gemma":[0.9992993,0.00024123299,0.00019023464,0.000118808304,0.00012024134,0.00003019244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003299658,0.00055079773,0.0001856979,0.00047233092,0.00021032743,0.00063235895,0.0007767344,0.00022947146,0.0022319336],"category_scores_gemma":[0.0009811064,0.00019196485,0.00018599525,0.00033975093,0.00020648133,0.00087517954,0.0002752324,0.00031748883,0.00040444467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011549593,0.0004236808,0.012779444,0.0011164966,0.0001285965,0.0008248523,0.00034900257,0.2749013,0.3746093,0.00769265,0.002965229,0.32305446],"study_design_scores_gemma":[0.00021481219,0.0039605587,0.0090257125,0.00013703278,0.0002502125,0.0007923731,0.00045023905,0.45259923,0.5113973,0.0045679486,0.016523028,0.0000815752],"about_ca_topic_score_codex":0.0009659426,"about_ca_topic_score_gemma":0.0025143214,"teacher_disagreement_score":0.0022319336,"about_ca_system_score_codex":0.00040851306,"about_ca_system_score_gemma":0.00064470293,"threshold_uncertainty_score":0.0074665546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029430655,0.00037958004,0.9136285,0.0004752368,0.0002694191,0.0002986521,0.00059164,0.074685656,0.006728224],"genre_scores_gemma":[0.107709765,0.0010251238,0.85185456,0.0009323387,0.00024643677,0.0017536152,0.0046567637,0.018855685,0.012965745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982139,0.00039368978,0.000112200716,0.00029220735,0.00074715813,0.00024086253],"domain_scores_gemma":[0.9979892,0.0006294631,0.00009395494,0.00067988434,0.0002989121,0.00030851006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002983673,0.0014010966,0.0010083839,0.0011838367,0.0015304565,0.0030853506,0.0066460096,0.0018374816,0.012380471],"category_scores_gemma":[0.006193045,0.0011935817,0.0017752665,0.0012610212,0.0017489217,0.0049527986,0.00716824,0.0045501743,0.0059855785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011558448,0.0004172583,0.0036924582,0.0010196546,0.0004230034,0.00081329775,0.0009099439,0.2119769,0.014366067,0.3075692,0.2028129,0.25484356],"study_design_scores_gemma":[0.0002781527,0.00010666862,0.000736512,0.00012683918,0.000049993145,0.00025084766,0.000120714256,0.6171,0.0083849775,0.15584521,0.21684459,0.00015546783],"about_ca_topic_score_codex":0.005134021,"about_ca_topic_score_gemma":0.0066191107,"teacher_disagreement_score":0.012380471,"about_ca_system_score_codex":0.0015869961,"about_ca_system_score_gemma":0.0022243783,"threshold_uncertainty_score":0.041416824},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003059575,0.00019673568,0.6924956,0.00017555853,0.0003164707,0.00031816124,0.0045864577,0.29006112,0.008790488],"genre_scores_gemma":[0.047235724,0.00043419536,0.744931,0.000716638,0.00018114712,0.0019777822,0.015146845,0.17042136,0.018955417],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99881625,0.0001570094,0.00013196775,0.00020153908,0.0005762713,0.000117065116],"domain_scores_gemma":[0.9974381,0.0010589039,0.00021897527,0.0003657928,0.00073452777,0.00018376895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014869091,0.0020076195,0.00094610977,0.0015049952,0.0007516676,0.0015355343,0.005139333,0.0014684519,0.047077116],"category_scores_gemma":[0.008922386,0.0013792615,0.0013202514,0.00122256,0.0009436062,0.002136391,0.0026055896,0.0033376415,0.028801963],"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.00091880007,0.00041796372,0.003964724,0.001537382,0.00021963882,0.0009114796,0.00043886184,0.07712803,0.022705596,0.045260858,0.48664922,0.35984752],"study_design_scores_gemma":[0.0005798978,0.00012405087,0.0013042374,0.00025125,0.00004308532,0.0008459039,0.00004374141,0.62216896,0.05106893,0.040639512,0.28269026,0.00024015988],"about_ca_topic_score_codex":0.0022373984,"about_ca_topic_score_gemma":0.003278656,"teacher_disagreement_score":0.047077116,"about_ca_system_score_codex":0.0006602294,"about_ca_system_score_gemma":0.0024863665,"threshold_uncertainty_score":0.15748864},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08900074,0.0010571218,0.8448024,0.00039300087,0.00034224542,0.0005442878,0.005230306,0.027267858,0.03136207],"genre_scores_gemma":[0.56860846,0.0011383116,0.40503585,0.00028728344,0.00007705672,0.0009003506,0.0059301592,0.00189181,0.016130714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998572,0.00002383736,0.000011113761,0.000017814325,0.00006600935,0.000024034334],"domain_scores_gemma":[0.9997626,0.00007355872,0.00002488572,0.000053328946,0.00006562307,0.000019954025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025513288,0.00051269657,0.00041046608,0.00045879287,0.00022052728,0.00040659093,0.0022958312,0.0006208728,0.005534519],"category_scores_gemma":[0.00097377383,0.00031613687,0.0004977598,0.00039208814,0.000213891,0.00053689675,0.00071135676,0.0007968514,0.0007453884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015033547,0.00007337968,0.002192047,0.00023213132,0.000087113855,0.00020482742,0.000101125086,0.90928745,0.018309671,0.017356858,0.009616003,0.04238903],"study_design_scores_gemma":[0.000029620924,0.00003808015,0.00016743143,0.000008177323,0.000016942888,0.000043527358,0.000008812921,0.97695816,0.005772403,0.0014239281,0.015522371,0.000010523952],"about_ca_topic_score_codex":0.004102288,"about_ca_topic_score_gemma":0.004379988,"teacher_disagreement_score":0.005534519,"about_ca_system_score_codex":0.00035976252,"about_ca_system_score_gemma":0.0009421966,"threshold_uncertainty_score":0.018514872},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50704795,0.00077275356,0.47638625,0.0010979262,0.000119048746,0.00024197098,0.0005014124,0.0018809735,0.011951681],"genre_scores_gemma":[0.9821613,0.00009326037,0.01438839,0.0000504528,0.00002407835,0.00010811461,0.00015185338,0.00009558294,0.0029269755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949706,0.00010101827,0.000021963195,0.00013099154,0.0001002242,0.00014881755],"domain_scores_gemma":[0.9990608,0.0003418034,0.00015142631,0.000051743064,0.00028187849,0.00011236318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012079547,0.0007770313,0.0007925534,0.0009577396,0.00071413623,0.0011785968,0.0018724683,0.0008553842,0.0037107873],"category_scores_gemma":[0.0023256969,0.00052009075,0.0005580484,0.00066901755,0.0006429949,0.0008308977,0.0006302005,0.0007730728,0.000422877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059913757,0.000032029362,0.00061876286,0.0000139215,0.0000070955243,0.00004365758,0.000021793667,0.99401504,0.0004173341,0.0015511425,0.00041007219,0.0028092063],"study_design_scores_gemma":[0.000001633948,0.0000029017754,0.000053838845,5.9260464e-7,9.958353e-7,0.0000011752433,0.0000018803665,0.99968934,0.000021474738,0.0001977443,0.000027690798,6.8280883e-7],"about_ca_topic_score_codex":0.030155765,"about_ca_topic_score_gemma":0.019005857,"teacher_disagreement_score":0.030155765,"about_ca_system_score_codex":0.0027282643,"about_ca_system_score_gemma":0.0020419473,"threshold_uncertainty_score":0.059960485},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06889111,0.00028322203,0.8452334,0.00034321874,0.00038184252,0.0003209314,0.00050536805,0.06921522,0.014825762],"genre_scores_gemma":[0.2644351,0.00026943526,0.7178637,0.0003277631,0.000104108614,0.00040584535,0.0016534537,0.0071885968,0.0077519985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994771,0.00008142554,0.000053011292,0.00011636583,0.00019443076,0.00007767205],"domain_scores_gemma":[0.9989405,0.00028055598,0.00009642953,0.00035152875,0.00026636553,0.00006454468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005914216,0.0008934955,0.00032529503,0.00049601536,0.0005133675,0.00078187033,0.0010480139,0.00046244726,0.0061818273],"category_scores_gemma":[0.002541984,0.0005343767,0.00069012673,0.0005391573,0.00081902434,0.0011590001,0.0010166067,0.001094834,0.0023783534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011713865,0.00041040572,0.0075781406,0.00088689366,0.00017578196,0.0008420959,0.00078863074,0.1259907,0.187264,0.047203265,0.095020294,0.5326684],"study_design_scores_gemma":[0.0002860649,0.00044532595,0.0011614398,0.000079907484,0.00006298618,0.00031987374,0.00012215256,0.74653864,0.168298,0.021571942,0.061039623,0.00007411161],"about_ca_topic_score_codex":0.0026516076,"about_ca_topic_score_gemma":0.0029256106,"teacher_disagreement_score":0.0061818273,"about_ca_system_score_codex":0.0004804273,"about_ca_system_score_gemma":0.0020925545,"threshold_uncertainty_score":0.020680308},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027987959,0.00058733544,0.93331695,0.0018412087,0.00015177425,0.00008450152,0.00015332933,0.0049360567,0.030940885],"genre_scores_gemma":[0.14146371,0.0010194889,0.84542674,0.0005088859,0.0001371678,0.00012230198,0.00037370014,0.0016739886,0.009274026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720347,0.0008370593,0.00023840471,0.0003512846,0.0011094306,0.00026038484],"domain_scores_gemma":[0.99359375,0.003473707,0.00020371316,0.00130901,0.0010711139,0.00034867023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004903984,0.0006378574,0.00061615766,0.00053611514,0.0009889959,0.003219138,0.0023923113,0.00063796935,0.011611106],"category_scores_gemma":[0.01039563,0.0006736459,0.0009908245,0.0009596477,0.0018633166,0.0056811133,0.002436566,0.0029876414,0.0037820982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008035324,0.0010924961,0.004921099,0.0010360322,0.00010092294,0.0007150187,0.006486009,0.02871208,0.042062238,0.49806067,0.044536278,0.37147355],"study_design_scores_gemma":[0.0004159067,0.0005422728,0.0020532724,0.00046847347,0.000110967645,0.0017392758,0.0014759564,0.26416624,0.04366768,0.34637302,0.33878115,0.00020579528],"about_ca_topic_score_codex":0.002881692,"about_ca_topic_score_gemma":0.0029320132,"teacher_disagreement_score":0.011611106,"about_ca_system_score_codex":0.0007421956,"about_ca_system_score_gemma":0.0017141422,"threshold_uncertainty_score":0.038843036},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017967438,0.002323343,0.80638105,0.0018753558,0.0015592653,0.00079238944,0.0062017166,0.028979633,0.13391979],"genre_scores_gemma":[0.17117725,0.0018760957,0.73641396,0.001891783,0.0003915496,0.0013985845,0.016633917,0.009947055,0.0602697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983442,0.00030974144,0.00010903735,0.0002490205,0.000756354,0.00023173774],"domain_scores_gemma":[0.99773693,0.0008396491,0.00013448825,0.00031879713,0.000836763,0.00013340196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016873579,0.0015768574,0.0012370629,0.00077453506,0.0011129291,0.0022327185,0.0034012466,0.0014872801,0.04690335],"category_scores_gemma":[0.006576101,0.0006278573,0.0013380426,0.00090788445,0.0010111193,0.0020812855,0.0028220424,0.0025689956,0.01282478],"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.0005280273,0.00033566542,0.0021521735,0.0012662295,0.00012855475,0.00026389823,0.00017389358,0.319318,0.004379795,0.14774792,0.23722593,0.28647995],"study_design_scores_gemma":[0.00021858362,0.00013848976,0.00031487722,0.00010090749,0.00002490747,0.00010169813,0.0000852969,0.81478804,0.0033576747,0.056347135,0.124484554,0.000037787442],"about_ca_topic_score_codex":0.00787803,"about_ca_topic_score_gemma":0.0151843205,"teacher_disagreement_score":0.04690335,"about_ca_system_score_codex":0.0013306248,"about_ca_system_score_gemma":0.0039755064,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17438233,0.0027431361,0.78884697,0.0008617161,0.00027967367,0.00014487225,0.00011961682,0.0010597267,0.031561926],"genre_scores_gemma":[0.9139779,0.000887904,0.07873849,0.00019680675,0.000123848,0.00007239687,0.000071115515,0.0001145124,0.005816981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994747,0.000090185014,0.000032675933,0.000068201225,0.00023625826,0.00009804934],"domain_scores_gemma":[0.99926883,0.0002058183,0.00008326833,0.00014766627,0.00022559405,0.000068803485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060856435,0.0005139812,0.00047856043,0.0004216991,0.0005474516,0.0008165412,0.0012271397,0.00042808536,0.0030874338],"category_scores_gemma":[0.0017141568,0.00019677595,0.00019243582,0.0007125842,0.00039467492,0.0016058908,0.0010380434,0.00064521434,0.000650433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008394613,0.0003547657,0.0021185311,0.0005147395,0.00009670686,0.00033482554,0.00029290354,0.3594397,0.12263425,0.13354698,0.009414423,0.37041268],"study_design_scores_gemma":[0.00008059823,0.00022709389,0.00047697374,0.00003350721,0.00003963049,0.00014873038,0.000064511,0.89404064,0.028160615,0.06302543,0.013676523,0.000025780255],"about_ca_topic_score_codex":0.0006105632,"about_ca_topic_score_gemma":0.0015662309,"teacher_disagreement_score":0.0030874338,"about_ca_system_score_codex":0.00054279016,"about_ca_system_score_gemma":0.0007016801,"threshold_uncertainty_score":0.010328472},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35684878,0.0058489987,0.61853004,0.0018022913,0.0007073632,0.00029784994,0.0001253457,0.0025232406,0.013316097],"genre_scores_gemma":[0.9300771,0.0006179524,0.064113766,0.00021872229,0.00022581554,0.0001311451,0.00010897536,0.00022967914,0.004276785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754214,0.00063092663,0.00017604715,0.00028619563,0.0007542293,0.00061046507],"domain_scores_gemma":[0.99305236,0.0029966068,0.00053036166,0.0014854623,0.0012207752,0.00071447337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027028853,0.0006788656,0.0010140245,0.0008474337,0.0020867605,0.0022983348,0.0035676109,0.0008649189,0.0028073457],"category_scores_gemma":[0.010358684,0.00059562473,0.00038057036,0.0013330735,0.0011967021,0.00391284,0.0035440777,0.0013048695,0.00038606196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002829206,0.00059864164,0.011416906,0.00080602954,0.00045055733,0.002031191,0.0021446708,0.41747254,0.05995664,0.14693817,0.031307884,0.32404765],"study_design_scores_gemma":[0.00019537541,0.0002410412,0.0009163867,0.00003466856,0.00011367079,0.00020593705,0.00026187437,0.92852956,0.011743522,0.0466453,0.011065579,0.00004713256],"about_ca_topic_score_codex":0.003636111,"about_ca_topic_score_gemma":0.0071275844,"teacher_disagreement_score":0.003636111,"about_ca_system_score_codex":0.0016581195,"about_ca_system_score_gemma":0.0022760222,"threshold_uncertainty_score":0.0142944455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36335933,0.0010544828,0.61468244,0.00044210974,0.00004910354,0.00015009784,0.00013882948,0.0010550973,0.01906853],"genre_scores_gemma":[0.7626089,0.0003075735,0.23356779,0.00012035877,0.000010339919,0.00013777385,0.00014765296,0.00018523645,0.002914359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997274,0.00010448564,0.000008237673,0.000027820684,0.00008215512,0.00004989375],"domain_scores_gemma":[0.9997632,0.00012714094,0.000025023408,0.000023948953,0.000040763298,0.000019959327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044521227,0.0006169148,0.00035593947,0.00054331607,0.0004091468,0.0006576618,0.0006178216,0.0003443341,0.0015309091],"category_scores_gemma":[0.0009535209,0.00030970832,0.00042098598,0.0003735801,0.00043497348,0.00045263284,0.0006238103,0.00046848055,0.00018779546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009093504,0.00007033929,0.0015786259,0.00014441139,0.000033976637,0.00018513529,0.00012611892,0.9106837,0.016462669,0.012367815,0.0012787895,0.05697754],"study_design_scores_gemma":[0.000014938266,0.000062938714,0.00028122484,0.000007882716,0.000010880068,0.000036573478,0.00006627706,0.9862475,0.0048235003,0.0059707556,0.0024717841,0.000005729801],"about_ca_topic_score_codex":0.0024502676,"about_ca_topic_score_gemma":0.005286692,"teacher_disagreement_score":0.0024502676,"about_ca_system_score_codex":0.00071943185,"about_ca_system_score_gemma":0.0013107343,"threshold_uncertainty_score":0.005219817},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23113571,0.025490338,0.6037973,0.0038756325,0.0014711926,0.000469934,0.0022160313,0.023435049,0.10810872],"genre_scores_gemma":[0.78468794,0.0037253923,0.18675664,0.0017766996,0.00015969585,0.00053125375,0.0022103142,0.0008639534,0.019288175],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99958545,0.00006468435,0.000019199048,0.000055004017,0.00021112578,0.00006458333],"domain_scores_gemma":[0.9996227,0.00008548789,0.000029913837,0.000097760116,0.00013122406,0.00003295229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023523426,0.00048413465,0.0005951126,0.00047388955,0.00058140105,0.0012925109,0.0019388406,0.0007241764,0.0075765597],"category_scores_gemma":[0.0012874374,0.00029194064,0.0002903576,0.0013531627,0.00041452152,0.0016644947,0.00094140164,0.0009916476,0.0017097691],"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.0015425421,0.000279652,0.0067066746,0.0012263084,0.00022354031,0.0010965978,0.00061430375,0.3247052,0.035990227,0.11040089,0.168428,0.34878603],"study_design_scores_gemma":[0.00020256142,0.00042907614,0.0012114387,0.00013935045,0.00008669796,0.00041208358,0.00015356278,0.80665874,0.020473056,0.03536737,0.13478146,0.0000845829],"about_ca_topic_score_codex":0.0046437676,"about_ca_topic_score_gemma":0.0065287254,"teacher_disagreement_score":0.0075765597,"about_ca_system_score_codex":0.0009849272,"about_ca_system_score_gemma":0.0011263286,"threshold_uncertainty_score":0.0253461},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5769607,0.0024442002,0.40786657,0.0005123471,0.00025952136,0.00003625277,0.00015188975,0.001979085,0.009789468],"genre_scores_gemma":[0.97008485,0.00018806854,0.027489705,0.000067276334,0.000020678734,0.000014087274,0.00007534018,0.000028698352,0.0020312758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999231,0.000010436988,0.0000043741775,0.00001940133,0.000027909848,0.000014747035],"domain_scores_gemma":[0.99980885,0.000057938032,0.000017502154,0.000019014578,0.00008700408,0.000009664169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013687024,0.0003050024,0.00034568828,0.00025143815,0.00027095046,0.00030927634,0.0006786851,0.00026248195,0.0014687841],"category_scores_gemma":[0.00043205594,0.00011737152,0.00017268052,0.00037620048,0.00010892121,0.0008305926,0.00017496741,0.00031386202,0.00015312404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055942056,0.00038846093,0.0064243823,0.00016772248,0.00015264403,0.00021191142,0.000057315694,0.6113655,0.07498146,0.004789198,0.0049145073,0.29598746],"study_design_scores_gemma":[0.0000046916703,0.00004169952,0.00026697252,0.000002201993,0.000011121955,0.0000097630555,0.0000039259335,0.994653,0.004454858,0.0003679249,0.0001813073,0.0000025786785],"about_ca_topic_score_codex":0.0040086764,"about_ca_topic_score_gemma":0.012732631,"teacher_disagreement_score":0.0040086764,"about_ca_system_score_codex":0.00033321968,"about_ca_system_score_gemma":0.0004737116,"threshold_uncertainty_score":0.007970691},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0201443,0.0009622533,0.8892505,0.0021094796,0.00051187514,0.000410959,0.00061916077,0.07609446,0.009896913],"genre_scores_gemma":[0.23371021,0.0013351213,0.73220086,0.0013471992,0.00030738467,0.00093601726,0.0061296825,0.0077091004,0.016324397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976713,0.00037609867,0.00014267556,0.00046065394,0.0009022508,0.00044701988],"domain_scores_gemma":[0.99614584,0.0005431019,0.00016858257,0.0013266397,0.0010882864,0.00072740664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033007322,0.0014901798,0.0010023974,0.0011951727,0.0010365947,0.0028193735,0.0065254257,0.0014147217,0.012129993],"category_scores_gemma":[0.007759251,0.0015113682,0.0009784213,0.0014907661,0.0013584263,0.006231764,0.0086550005,0.005702181,0.0073641837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022883858,0.0014837526,0.007829456,0.0014095204,0.00031379962,0.00086935767,0.0010525702,0.10463789,0.060632795,0.17818585,0.2198812,0.42141536],"study_design_scores_gemma":[0.0003305692,0.00035816617,0.0017274974,0.00023183883,0.00012042182,0.0002328379,0.00031631274,0.73458815,0.03469302,0.08985074,0.13741781,0.000132643],"about_ca_topic_score_codex":0.0043627694,"about_ca_topic_score_gemma":0.0042881775,"teacher_disagreement_score":0.012129993,"about_ca_system_score_codex":0.001919897,"about_ca_system_score_gemma":0.004387141,"threshold_uncertainty_score":0.040578842},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058485243,0.0001972951,0.9193943,0.000238987,0.000041018448,0.00005786873,0.00036481483,0.016203297,0.005017003],"genre_scores_gemma":[0.58221155,0.00016498202,0.40840814,0.00012407488,0.000026065063,0.00007781012,0.0014634625,0.0022201932,0.0053036823],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988248,0.00022447722,0.000048658494,0.00024334351,0.00052430783,0.00013444756],"domain_scores_gemma":[0.9971654,0.0012203078,0.000221977,0.0008859089,0.00045371358,0.000052753985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007173824,0.0007831051,0.0004220033,0.0015112378,0.0005155103,0.0009434543,0.00093772734,0.0006081353,0.005474156],"category_scores_gemma":[0.0048743677,0.00062277814,0.0005451893,0.0009855992,0.0009828124,0.0017301299,0.0013560454,0.0011730432,0.0011384571],"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.00056485966,0.000115753646,0.003971618,0.00033018243,0.00004611833,0.00036937048,0.00047422413,0.2134232,0.050223753,0.052788597,0.008984525,0.66870785],"study_design_scores_gemma":[0.00003650347,0.00006307384,0.00084371027,0.0000439365,0.00001742612,0.00021704567,0.00014868232,0.88727355,0.066109635,0.033409398,0.011804155,0.000032813685],"about_ca_topic_score_codex":0.0032664943,"about_ca_topic_score_gemma":0.0031399003,"teacher_disagreement_score":0.005474156,"about_ca_system_score_codex":0.0007970918,"about_ca_system_score_gemma":0.000924919,"threshold_uncertainty_score":0.018312871},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11456421,0.0034156018,0.8293881,0.0018539923,0.0007728162,0.00015583492,0.0008766054,0.014096617,0.03487627],"genre_scores_gemma":[0.6009518,0.00095440855,0.36457285,0.0016216591,0.00012922405,0.00017587077,0.00198215,0.0007804431,0.02883156],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99964833,0.000046101206,0.000017938264,0.000072915194,0.00013783952,0.000076829],"domain_scores_gemma":[0.9995722,0.00009668303,0.000023756049,0.00012916894,0.00013529975,0.000042996344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048668086,0.0008126407,0.00049476593,0.00031299875,0.00039436462,0.0011356403,0.0024720987,0.000648027,0.009935302],"category_scores_gemma":[0.0016081401,0.00040495448,0.0005414671,0.00032828085,0.00050672406,0.002336616,0.0010645924,0.0019604547,0.0027893784],"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.00073529547,0.00058477017,0.0018963881,0.0005402381,0.00028065112,0.00029262106,0.00017537993,0.14951935,0.06653896,0.04459515,0.051883824,0.68295735],"study_design_scores_gemma":[0.00011418021,0.00063992915,0.0005861091,0.00007133185,0.00015144782,0.00012315356,0.00007345046,0.85230374,0.07674208,0.0321864,0.03696334,0.000044798726],"about_ca_topic_score_codex":0.0055334093,"about_ca_topic_score_gemma":0.011076688,"teacher_disagreement_score":0.009935302,"about_ca_system_score_codex":0.0009272441,"about_ca_system_score_gemma":0.001605459,"threshold_uncertainty_score":0.03323686},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08106093,0.0013433733,0.8480845,0.0010074704,0.00039745218,0.00031249947,0.0012897146,0.010889463,0.05561461],"genre_scores_gemma":[0.45782807,0.00030066958,0.52402896,0.0005166569,0.000106885156,0.00036876032,0.001975682,0.00089482835,0.013979492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988745,0.0002102676,0.00006242294,0.00027473798,0.00037356777,0.0002045396],"domain_scores_gemma":[0.9987503,0.00044157685,0.000074788586,0.00043433736,0.00023442299,0.00006449528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008375787,0.0009873031,0.001162127,0.00090803107,0.0007413162,0.0010244796,0.0020539684,0.0008653178,0.012637598],"category_scores_gemma":[0.003491657,0.00048300115,0.0009577003,0.001216793,0.0007231978,0.002303381,0.00229169,0.0008686065,0.0024240897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007963285,0.00030107913,0.0023169164,0.0006511324,0.0001679725,0.00037747345,0.00014991107,0.40229085,0.012290257,0.0448171,0.040262185,0.49557877],"study_design_scores_gemma":[0.0003123033,0.00012483765,0.00035433663,0.000025704303,0.00003650744,0.00017109039,0.000036837944,0.9115446,0.005079365,0.06824873,0.014043119,0.000022489354],"about_ca_topic_score_codex":0.004124654,"about_ca_topic_score_gemma":0.006757316,"teacher_disagreement_score":0.012637598,"about_ca_system_score_codex":0.0010783374,"about_ca_system_score_gemma":0.0019276307,"threshold_uncertainty_score":0.04227692},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01899641,0.00027311716,0.92616355,0.0002753871,0.0004628212,0.00014962515,0.00037553033,0.049816754,0.0034868775],"genre_scores_gemma":[0.4310671,0.00023054575,0.55012923,0.00060647697,0.00017446425,0.00070893386,0.0016550118,0.0059023085,0.0095259985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991227,0.0001659083,0.00006486871,0.0002920074,0.0002462262,0.00010835447],"domain_scores_gemma":[0.99864656,0.0004662796,0.00006655858,0.00045705907,0.00023685175,0.00012666994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013495114,0.0014076057,0.0008971834,0.0007834892,0.00068018184,0.0013293106,0.0033403407,0.0011430096,0.012892905],"category_scores_gemma":[0.004788088,0.00087744027,0.0006243527,0.00079399085,0.0011406493,0.0025038181,0.0030515578,0.0025189046,0.0031439685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020310872,0.00064251205,0.003168605,0.00042536197,0.00036048878,0.00033367387,0.00037022936,0.20112453,0.020622881,0.038553197,0.07539756,0.65696996],"study_design_scores_gemma":[0.00015885633,0.00009422461,0.00022521049,0.000019814224,0.000027648117,0.000048356218,0.00004113974,0.955875,0.015251823,0.021468598,0.0067620133,0.000027342063],"about_ca_topic_score_codex":0.004105242,"about_ca_topic_score_gemma":0.008310291,"teacher_disagreement_score":0.012892905,"about_ca_system_score_codex":0.0010139076,"about_ca_system_score_gemma":0.0018958434,"threshold_uncertainty_score":0.043131053},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97377455,0.00029686137,0.022562496,0.00011951182,0.000042272677,0.000016639007,0.00012043858,0.0011093847,0.0019578135],"genre_scores_gemma":[0.9937265,0.000032922417,0.0057776566,0.000013445314,0.0000073154324,0.000010132962,0.00011753675,0.00008255772,0.00023180398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999154,0.00013680315,0.000050705006,0.00014572554,0.00035622035,0.00015646119],"domain_scores_gemma":[0.9955148,0.0022777952,0.00039419055,0.00078293355,0.0008189266,0.0002112527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008099627,0.00042270002,0.0002633543,0.0006024506,0.00036893046,0.00078127935,0.0006586855,0.00041565008,0.0013982141],"category_scores_gemma":[0.006166978,0.00024429616,0.00023227476,0.000775877,0.00047674918,0.0012240227,0.0005673489,0.00058899407,0.00027004755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025835042,0.0006744272,0.055335373,0.00030210314,0.00022852261,0.00036096235,0.00034829488,0.49429196,0.30613956,0.006435884,0.0048496863,0.12844975],"study_design_scores_gemma":[0.000023131755,0.0005421508,0.007182465,0.000010472878,0.000024149389,0.00007244848,0.0000482402,0.88709134,0.1033145,0.0009918718,0.00067817414,0.000021052987],"about_ca_topic_score_codex":0.0017292728,"about_ca_topic_score_gemma":0.0018770571,"teacher_disagreement_score":0.0017292728,"about_ca_system_score_codex":0.0005850281,"about_ca_system_score_gemma":0.00062788423,"threshold_uncertainty_score":0.0046774745},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0539321,0.00030573184,0.9231024,0.00033991155,0.000083494175,0.0000677676,0.000072381496,0.0035118584,0.018584307],"genre_scores_gemma":[0.5979586,0.00052510586,0.3860929,0.000374182,0.00015886378,0.00012658129,0.0001852374,0.0012292742,0.0133491475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99850464,0.00027136676,0.00010809594,0.00023964277,0.00067867676,0.00019757176],"domain_scores_gemma":[0.99714124,0.0011912457,0.0003021573,0.00070633314,0.0005383969,0.00012070955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017742333,0.00046128433,0.00027373235,0.00062990264,0.00064300623,0.0019615663,0.0010302966,0.0003968089,0.0024784235],"category_scores_gemma":[0.0028278036,0.00043227308,0.00045594436,0.0006298732,0.0017741674,0.00143378,0.0010280326,0.0013651638,0.0005180518],"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.00056712906,0.00014172157,0.004023868,0.00036778816,0.000038158254,0.00071969064,0.0010126699,0.07046196,0.05237624,0.62828153,0.008012663,0.23399651],"study_design_scores_gemma":[0.00019941224,0.00039626026,0.0031987214,0.00022523606,0.00012486524,0.0013257989,0.00016230658,0.33823454,0.14638355,0.30940598,0.20012546,0.00021798722],"about_ca_topic_score_codex":0.0049285847,"about_ca_topic_score_gemma":0.0033567792,"teacher_disagreement_score":0.0049285847,"about_ca_system_score_codex":0.00085920474,"about_ca_system_score_gemma":0.001663602,"threshold_uncertainty_score":0.009799778},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27345666,0.001721926,0.71795803,0.00023008922,0.000089794215,0.000060274524,0.0001458615,0.0020859293,0.0042513856],"genre_scores_gemma":[0.9207868,0.0001863705,0.07687326,0.000078568955,0.000019683643,0.0000480456,0.00015121845,0.000047914597,0.0018081331],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998733,0.000020060073,0.00000831852,0.00003622948,0.000035428555,0.000026643289],"domain_scores_gemma":[0.99979514,0.00005352384,0.000039946528,0.00004549212,0.00005324165,0.000012686104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014304338,0.00032208627,0.00034388257,0.00029560347,0.00025792376,0.00033517944,0.0011379209,0.00032163548,0.00084094825],"category_scores_gemma":[0.00038605198,0.00014627553,0.0003007012,0.00045379676,0.00019516973,0.0006404,0.00025392484,0.00035252934,0.00017929908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024373786,0.00013040913,0.0020932697,0.000091193004,0.000099867684,0.00025068215,0.000037403483,0.75006896,0.050164122,0.004120672,0.001804291,0.1908954],"study_design_scores_gemma":[0.000008501924,0.000066199944,0.00034853874,0.0000031532416,0.000015029508,0.000047166446,0.0000073489505,0.99081516,0.006839092,0.0010375163,0.0008051494,0.0000071380045],"about_ca_topic_score_codex":0.0028957522,"about_ca_topic_score_gemma":0.0068544815,"teacher_disagreement_score":0.0028957522,"about_ca_system_score_codex":0.00052895234,"about_ca_system_score_gemma":0.0005126963,"threshold_uncertainty_score":0.0057578087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08732589,0.0003288215,0.9005609,0.00022602278,0.00010495309,0.000074756,0.00013171714,0.00206055,0.009186398],"genre_scores_gemma":[0.5068273,0.00020805949,0.48636752,0.00014169089,0.000054437245,0.00023719594,0.00056388596,0.00028016162,0.005319693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938893,0.00012385796,0.00005085118,0.00009087396,0.00024612958,0.00009925225],"domain_scores_gemma":[0.9990951,0.00025838247,0.000058003334,0.00027352563,0.0002634404,0.00005155353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059632084,0.00063938514,0.00066666515,0.0004072102,0.0005784668,0.00062188046,0.0011126905,0.0002856339,0.005114739],"category_scores_gemma":[0.0023115121,0.0002845014,0.00036977747,0.0009793615,0.00048283176,0.0020913063,0.0014525426,0.0007116165,0.0011628546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012634937,0.00027347886,0.0025211792,0.0005767928,0.00006622381,0.0006336231,0.00043855232,0.17825608,0.09320983,0.14119795,0.018346494,0.5632163],"study_design_scores_gemma":[0.00012517918,0.00024406942,0.00049723726,0.000038173486,0.000022478776,0.00018920627,0.000087770684,0.8715729,0.047917593,0.066186495,0.0130934995,0.000025359906],"about_ca_topic_score_codex":0.0010612538,"about_ca_topic_score_gemma":0.0026519406,"teacher_disagreement_score":0.005114739,"about_ca_system_score_codex":0.0003838591,"about_ca_system_score_gemma":0.00081278395,"threshold_uncertainty_score":0.017110467},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57566786,0.0018338957,0.41617855,0.00023790974,0.00013283454,0.00010700023,0.000075323784,0.0016697109,0.004096965],"genre_scores_gemma":[0.9753169,0.00018938044,0.02372022,0.00003767058,0.000015139523,0.000016797047,0.000018914445,0.00001540023,0.0006695519],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999051,0.000019849644,0.0000070516226,0.000015274503,0.00003396902,0.00001879178],"domain_scores_gemma":[0.9997491,0.000055196273,0.00005253676,0.00006387077,0.00006107282,0.000018197961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015492504,0.00030434187,0.00019534903,0.00028138384,0.0002552285,0.00018455565,0.00042678462,0.00013986221,0.00066087564],"category_scores_gemma":[0.00044192772,0.000092477116,0.00013690496,0.00020793088,0.00017118556,0.00044313437,0.00042996893,0.00020978987,0.00010202805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005623264,0.00011433576,0.001593152,0.00024610403,0.000031562926,0.0003943792,0.00036621265,0.122150436,0.6643818,0.005014036,0.0015470535,0.20359854],"study_design_scores_gemma":[0.000027249835,0.0004984144,0.0016989708,0.000019097943,0.00003056529,0.00036647386,0.00010621657,0.7728298,0.21851447,0.001944343,0.003926982,0.000037507383],"about_ca_topic_score_codex":0.0005383111,"about_ca_topic_score_gemma":0.00089854264,"teacher_disagreement_score":0.00066087564,"about_ca_system_score_codex":0.0001784737,"about_ca_system_score_gemma":0.00024952236,"threshold_uncertainty_score":0.0022107959},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011974714,0.00040296663,0.54118645,0.00029110507,0.00042277446,0.00025109772,0.0012292888,0.43793982,0.0063018203],"genre_scores_gemma":[0.3423161,0.00069857965,0.5093604,0.0011296347,0.0002896789,0.0012300473,0.007862688,0.114830144,0.022282735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965982,0.0005157599,0.0003457632,0.0006605527,0.0011838941,0.0006958772],"domain_scores_gemma":[0.9962696,0.0010332804,0.00027046772,0.0012454004,0.0007434178,0.00043777574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035536217,0.0019792137,0.0011675718,0.001052526,0.0010611821,0.0030698995,0.0051946067,0.001399493,0.026488045],"category_scores_gemma":[0.013101626,0.0013132072,0.0017997632,0.0009166005,0.0019255264,0.0047356994,0.006574537,0.0042845327,0.015041526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007556242,0.0010138246,0.012645767,0.0023561588,0.00081118685,0.0016607966,0.00282098,0.04697627,0.06615025,0.07829473,0.2826326,0.49708125],"study_design_scores_gemma":[0.00091868464,0.00055683166,0.0031384858,0.0002743319,0.00018656149,0.00082547526,0.00032129724,0.60575634,0.13311365,0.069057524,0.18529543,0.00055529433],"about_ca_topic_score_codex":0.0032635971,"about_ca_topic_score_gemma":0.0029753875,"teacher_disagreement_score":0.026488045,"about_ca_system_score_codex":0.0012993433,"about_ca_system_score_gemma":0.0034969554,"threshold_uncertainty_score":0.088611305},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8377703,0.0012121922,0.14292538,0.000186862,0.00038343933,0.00015336234,0.00047892425,0.0016079312,0.015281611],"genre_scores_gemma":[0.90666324,0.0003018549,0.0852007,0.00008408228,0.000027378945,0.00009589339,0.00031326147,0.00011701825,0.007196543],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998504,0.00001224176,0.000006363813,0.000037421472,0.00006556158,0.000028092067],"domain_scores_gemma":[0.9999056,0.000011429993,0.000019491788,0.000029942485,0.000018688203,0.000014725976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001410795,0.0003573934,0.0002430511,0.00016125709,0.00014896583,0.00042057742,0.0006941235,0.00046009445,0.0014941756],"category_scores_gemma":[0.00017801007,0.00019393944,0.00021116434,0.00014962968,0.00018647665,0.00034632455,0.0005695373,0.00038063727,0.0005022855],"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.00010629907,0.0000857633,0.000944713,0.00017192775,0.0000404511,0.00045538665,0.00006403649,0.005698395,0.969517,0.0031024523,0.00082764606,0.018985994],"study_design_scores_gemma":[0.000033547476,0.00087966747,0.0030154686,0.00001915357,0.00003806491,0.0006522985,0.000037395224,0.026268015,0.9437416,0.0005421214,0.024744254,0.000028470067],"about_ca_topic_score_codex":0.00017394936,"about_ca_topic_score_gemma":0.00032602804,"teacher_disagreement_score":0.0014941756,"about_ca_system_score_codex":0.00017198757,"about_ca_system_score_gemma":0.00017682606,"threshold_uncertainty_score":0.004998505},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011861864,0.0031051626,0.9375341,0.015148429,0.0007010573,0.00013414219,0.000049501203,0.0011379196,0.030327803],"genre_scores_gemma":[0.2527511,0.0036926742,0.7204209,0.006019134,0.0005935898,0.00056591706,0.0001714896,0.0010659042,0.014719298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941221,0.002022498,0.00027159447,0.0008625281,0.0020317747,0.00068938115],"domain_scores_gemma":[0.9951402,0.0015969382,0.00029833126,0.0015525023,0.00097273994,0.00043925227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008575372,0.0018412988,0.0012899529,0.001887951,0.0029817186,0.011253497,0.0038236263,0.0031975326,0.0061673312],"category_scores_gemma":[0.01095921,0.0012152432,0.0012310259,0.0011283488,0.014092682,0.02660919,0.012071423,0.010369585,0.0021559955],"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.00007781837,0.00006937956,0.00051181077,0.00019035551,0.00004008257,0.00011707796,0.0016085414,0.0059054764,0.0024520077,0.9380389,0.0041216076,0.046867043],"study_design_scores_gemma":[0.000028756522,0.000047090874,0.00012213198,0.00018581831,0.0000351785,0.000117373784,0.00064761227,0.025395926,0.0022005758,0.9113349,0.05985065,0.00003401767],"about_ca_topic_score_codex":0.0024205372,"about_ca_topic_score_gemma":0.0023157387,"teacher_disagreement_score":0.011253497,"about_ca_system_score_codex":0.0024861074,"about_ca_system_score_gemma":0.0043882574,"threshold_uncertainty_score":0.045351386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2691768,0.0061110607,0.675225,0.0028804678,0.0009302622,0.0001567146,0.00045195594,0.025776627,0.01929111],"genre_scores_gemma":[0.6968444,0.0019197215,0.28342983,0.0009504651,0.00014575764,0.000112276626,0.0008342039,0.005632072,0.010131186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998723,0.0002418303,0.00005575921,0.00021595898,0.00052580255,0.00023779675],"domain_scores_gemma":[0.99767596,0.00059346756,0.00017550094,0.0008833865,0.0005401373,0.00013150193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009382309,0.0010994038,0.00090258557,0.0006788924,0.0010161124,0.0020551838,0.0016407861,0.00078018266,0.0056352406],"category_scores_gemma":[0.004159707,0.00060254964,0.00093259156,0.0015918177,0.0015057485,0.0041564275,0.0013275027,0.0021602777,0.0014685149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020859728,0.00039053583,0.018550338,0.0016070759,0.0006733121,0.00049093796,0.0014533877,0.18434729,0.19372264,0.08607402,0.047288034,0.46331644],"study_design_scores_gemma":[0.00013348274,0.0005934281,0.007302538,0.00038705597,0.00038605693,0.00052213855,0.00060826464,0.5880772,0.22312011,0.07449626,0.10422082,0.0001527803],"about_ca_topic_score_codex":0.003909188,"about_ca_topic_score_gemma":0.0057685548,"teacher_disagreement_score":0.0056352406,"about_ca_system_score_codex":0.0013691051,"about_ca_system_score_gemma":0.0019683815,"threshold_uncertainty_score":0.018851757},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029001402,0.00013746462,0.96572846,0.00005587943,0.00002896204,0.000027086624,0.00003825258,0.0010509918,0.003931536],"genre_scores_gemma":[0.8600898,0.00023443515,0.13491732,0.000035331075,0.000011884443,0.00009552382,0.00012759712,0.00012603242,0.004362038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998435,0.00004327235,0.000007197649,0.000022147624,0.00007009963,0.000013893216],"domain_scores_gemma":[0.999877,0.000028333028,0.000021003134,0.000035975692,0.000032122065,0.0000056122485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002098945,0.00042141622,0.0002604016,0.00019525572,0.00015124731,0.0002833696,0.0005442491,0.00024333027,0.0021347185],"category_scores_gemma":[0.00041476838,0.00013380873,0.0002851485,0.00024104795,0.00022855331,0.00058252766,0.00024770145,0.0004579989,0.00030112147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044793956,0.00002341081,0.00044268754,0.00004620348,0.0000135889295,0.000046524132,0.000040995,0.9446164,0.009947631,0.010985657,0.000814684,0.032977384],"study_design_scores_gemma":[0.0000028233924,0.000012757603,0.00005270782,0.0000015546492,0.0000018033662,0.000007717036,0.0000021672674,0.9966557,0.0018595549,0.00049687043,0.00090461463,0.0000017262937],"about_ca_topic_score_codex":0.003093507,"about_ca_topic_score_gemma":0.0026784204,"teacher_disagreement_score":0.003093507,"about_ca_system_score_codex":0.00033572697,"about_ca_system_score_gemma":0.00049225346,"threshold_uncertainty_score":0.007141292},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36661008,0.0100756595,0.5861034,0.0030250798,0.0006774881,0.00026879366,0.00025264992,0.011983979,0.021002926],"genre_scores_gemma":[0.93246967,0.0010164981,0.062099632,0.00053548213,0.00020947336,0.00014094956,0.00029856246,0.00049220375,0.0027375065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707556,0.00056791457,0.00018186106,0.00049156,0.0012316047,0.00045151674],"domain_scores_gemma":[0.9929259,0.0019831166,0.00083470554,0.0026397046,0.001282222,0.0003342889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021453581,0.00089175825,0.00048865064,0.0007737936,0.0009685073,0.0016848255,0.0020357564,0.00074315065,0.004066548],"category_scores_gemma":[0.008687608,0.00050189474,0.00036535328,0.0006287681,0.0012924032,0.0050377576,0.0022430536,0.0022175068,0.0011571617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016855577,0.00079053105,0.009809839,0.0011221019,0.00022995411,0.000551818,0.00093933236,0.14598566,0.21331297,0.106093735,0.020537755,0.49894068],"study_design_scores_gemma":[0.00038069932,0.0035406775,0.0040160404,0.00030466024,0.00042748774,0.00092264643,0.0005518063,0.6558399,0.20622632,0.066655576,0.060918093,0.00021601874],"about_ca_topic_score_codex":0.0018218716,"about_ca_topic_score_gemma":0.002894091,"teacher_disagreement_score":0.004066548,"about_ca_system_score_codex":0.00085689133,"about_ca_system_score_gemma":0.0030628124,"threshold_uncertainty_score":0.013603985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00434098,0.00061249017,0.96850026,0.00013526523,0.000094122945,0.00014417678,0.00040457325,0.017739676,0.008028421],"genre_scores_gemma":[0.1442037,0.0011787117,0.83932203,0.00040865724,0.00013188779,0.0005685362,0.0017377583,0.0032932954,0.009155466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992499,0.00013232202,0.00006279684,0.0001301789,0.0003016785,0.000123144],"domain_scores_gemma":[0.9995351,0.000091632945,0.000040401614,0.00021114293,0.0000911574,0.000030634117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011031716,0.0011010672,0.00077825505,0.0007794088,0.0007115649,0.0017794558,0.0040330063,0.00071892125,0.009531791],"category_scores_gemma":[0.0010960037,0.00070138054,0.0014094033,0.0009954931,0.0011479236,0.002452762,0.001990111,0.0020393168,0.0025637187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069651904,0.0001883317,0.0016254201,0.0012065063,0.00019771639,0.00052529585,0.00044722867,0.10427018,0.040014688,0.54354495,0.05168031,0.25560284],"study_design_scores_gemma":[0.00016114007,0.0002894989,0.00043483736,0.00014813042,0.00009451521,0.0005522993,0.000092769464,0.53163403,0.06730431,0.10543533,0.2937185,0.00013455964],"about_ca_topic_score_codex":0.0023332194,"about_ca_topic_score_gemma":0.0040471028,"teacher_disagreement_score":0.009531791,"about_ca_system_score_codex":0.0012202361,"about_ca_system_score_gemma":0.0015285143,"threshold_uncertainty_score":0.031887054},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18646263,0.0004094949,0.8078275,0.0001541875,0.000102807644,0.00018450995,0.00012430524,0.00083851756,0.0038960772],"genre_scores_gemma":[0.680581,0.00012246262,0.3172717,0.00006699923,0.000030699302,0.00016773939,0.0003055704,0.00013996357,0.0013138879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993399,0.0001657315,0.000057767444,0.00012884306,0.00016328754,0.00014441647],"domain_scores_gemma":[0.9985794,0.00061478745,0.00017945598,0.00023815129,0.00024043494,0.0001477018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074009964,0.0007073282,0.0006336404,0.00044555083,0.00081751985,0.0006417597,0.0015095975,0.000568616,0.0012652376],"category_scores_gemma":[0.0028990833,0.00041130884,0.0003437367,0.00048105646,0.0004907954,0.00084256846,0.0011879321,0.0007343094,0.00023541196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048575283,0.00018792364,0.0018957936,0.00020603897,0.000048192003,0.0003416179,0.00029732124,0.8658982,0.02204852,0.011315444,0.0026593094,0.09461596],"study_design_scores_gemma":[0.00003231441,0.00007958086,0.00025379952,0.000006373506,0.000007189123,0.00004495941,0.00004441567,0.9905342,0.0040472215,0.004010881,0.00093067635,0.000008331119],"about_ca_topic_score_codex":0.0020467981,"about_ca_topic_score_gemma":0.002806685,"teacher_disagreement_score":0.0020467981,"about_ca_system_score_codex":0.0005288634,"about_ca_system_score_gemma":0.0010139231,"threshold_uncertainty_score":0.0042325854},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005506251,0.00006465182,0.99285936,0.000021338457,0.000014993563,0.000026774533,0.000034638313,0.0008401812,0.0006317913],"genre_scores_gemma":[0.50298035,0.00027806615,0.4927055,0.000066254805,0.000036828733,0.0003314292,0.00025631487,0.00032918795,0.003016099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996803,0.00005257404,0.000012413764,0.00009504579,0.00013178235,0.00002786249],"domain_scores_gemma":[0.99949086,0.00021049847,0.00008630976,0.00008076326,0.000112778034,0.000018704945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035495678,0.0009089252,0.0005452026,0.00071568653,0.00035743203,0.00054624316,0.00088215026,0.00073613523,0.0014339056],"category_scores_gemma":[0.0019644296,0.00038637983,0.00064312975,0.00047813065,0.00035342545,0.000570636,0.00041478997,0.0009363252,0.00046550893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071875846,0.000048866463,0.0014911342,0.00007485347,0.000035452547,0.00008630631,0.00007944573,0.89312357,0.024088182,0.0040968745,0.0008131388,0.07599026],"study_design_scores_gemma":[0.0000014490564,0.00000840712,0.00015880675,0.000002642311,0.0000032530195,0.000016962696,0.000004200761,0.9973431,0.0015746079,0.0004979672,0.00038428596,0.00000421721],"about_ca_topic_score_codex":0.0049418244,"about_ca_topic_score_gemma":0.0048204553,"teacher_disagreement_score":0.0049418244,"about_ca_system_score_codex":0.0006780654,"about_ca_system_score_gemma":0.0008191039,"threshold_uncertainty_score":0.009826124},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43575543,0.0024489053,0.54611474,0.00049237953,0.00015738417,0.000121244506,0.000112554866,0.0036941045,0.011103242],"genre_scores_gemma":[0.91724175,0.00041134818,0.079561636,0.0001666684,0.000021167958,0.00006931485,0.00011272284,0.00014877768,0.0022664748],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987805,0.00001532868,0.0000056600766,0.000023330556,0.000039744868,0.000037982874],"domain_scores_gemma":[0.99985397,0.000044522956,0.000026291926,0.000032972053,0.000025307569,0.000016940703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011808246,0.00048200955,0.00033138698,0.00029220854,0.00046128343,0.0003873328,0.00075824687,0.00020603591,0.0018006141],"category_scores_gemma":[0.00048052688,0.00017383033,0.00020821912,0.00038198373,0.00038931743,0.00075387856,0.000531342,0.00036913346,0.0003070485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009921705,0.00023944785,0.0056872573,0.00037198092,0.00009074298,0.0007279991,0.00039526646,0.33408293,0.194639,0.028673582,0.010499889,0.42359972],"study_design_scores_gemma":[0.00005751028,0.00040010872,0.0015251123,0.000016706465,0.000046017125,0.0001875649,0.00007199179,0.9377331,0.041302186,0.008070583,0.010560458,0.00002854866],"about_ca_topic_score_codex":0.002398583,"about_ca_topic_score_gemma":0.004147636,"teacher_disagreement_score":0.002398583,"about_ca_system_score_codex":0.00037426365,"about_ca_system_score_gemma":0.0008120265,"threshold_uncertainty_score":0.006023705},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33000422,0.0040069176,0.5748306,0.0008015655,0.0008179745,0.0007952297,0.0012105054,0.065184586,0.02234841],"genre_scores_gemma":[0.80262464,0.00059191807,0.18285231,0.0005457021,0.00015379755,0.0004849566,0.0027612671,0.0013948481,0.008590591],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988223,0.00016192056,0.00010074262,0.0002049008,0.0005226279,0.00018754974],"domain_scores_gemma":[0.9987068,0.00022406787,0.0001781644,0.0003419013,0.0004144489,0.00013468372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00107381,0.0010910829,0.00057373196,0.00073068886,0.00078373967,0.00093757856,0.0032085716,0.0005403148,0.004424081],"category_scores_gemma":[0.002515812,0.000515702,0.00036693588,0.00068795244,0.0005046194,0.0021548038,0.0020451078,0.001138097,0.0009990837],"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.0040561203,0.0008930054,0.014596206,0.0014195233,0.00032854843,0.0010603922,0.00092216907,0.11723159,0.27216998,0.023513416,0.11596373,0.44784528],"study_design_scores_gemma":[0.000734885,0.0014125833,0.0037249245,0.000094859555,0.0001372152,0.0004126406,0.00025029312,0.7431121,0.1719212,0.0068380507,0.071201965,0.00015939753],"about_ca_topic_score_codex":0.0028852606,"about_ca_topic_score_gemma":0.0056583816,"teacher_disagreement_score":0.004424081,"about_ca_system_score_codex":0.0009769268,"about_ca_system_score_gemma":0.0017817952,"threshold_uncertainty_score":0.014800072},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09986707,0.0013906328,0.8294087,0.0008744862,0.00024192991,0.00012375558,0.0005437244,0.0024579004,0.06509187],"genre_scores_gemma":[0.8308636,0.0011272861,0.15291661,0.00017292141,0.00012934502,0.00026999784,0.0006040704,0.00045686815,0.013459334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997781,0.000047704623,0.0000070433275,0.000032534455,0.00010454167,0.000030124571],"domain_scores_gemma":[0.99967825,0.000164647,0.000018710592,0.000061526676,0.000058505047,0.000018329705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024803894,0.0005437495,0.00062425935,0.00028179405,0.0003344287,0.00047651978,0.0008934525,0.0005428024,0.0043774005],"category_scores_gemma":[0.0012217055,0.00028928634,0.00054880057,0.00045607454,0.00050157716,0.00069255754,0.0006728407,0.00075255317,0.00061865145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035802892,0.000017928294,0.00019907735,0.000055375545,0.000017501732,0.000048713522,0.000021384876,0.96787006,0.0029140513,0.016628604,0.0013197974,0.01087166],"study_design_scores_gemma":[0.000009585491,0.0000070759506,0.000057214635,0.0000026842913,0.000002561977,0.000009609279,0.0000033474314,0.9879838,0.00077398,0.00985069,0.0012977892,0.0000016982345],"about_ca_topic_score_codex":0.0034107622,"about_ca_topic_score_gemma":0.0039225123,"teacher_disagreement_score":0.0043774005,"about_ca_system_score_codex":0.0005967049,"about_ca_system_score_gemma":0.00070231897,"threshold_uncertainty_score":0.014643848},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2152285,0.0046311175,0.76150614,0.0005063499,0.00055871025,0.00007937272,0.00038464388,0.004420219,0.012684936],"genre_scores_gemma":[0.8758133,0.0006862405,0.11379093,0.00025082883,0.00008267632,0.00006302046,0.0003517638,0.00009872721,0.008862443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999912,0.000009763571,0.0000052625937,0.000022685706,0.000034886958,0.000015408761],"domain_scores_gemma":[0.99981004,0.000038151815,0.0000149251155,0.000026628599,0.00009745447,0.000012789756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011991364,0.00034792745,0.0005315659,0.00035405473,0.00043375944,0.00046161198,0.0014928558,0.00035590466,0.0027452244],"category_scores_gemma":[0.00030839833,0.00017604815,0.0002719116,0.0006161245,0.00013694348,0.0010706073,0.00032229602,0.00043043666,0.0003419104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078570226,0.00050659233,0.0040674387,0.00035709192,0.00034119116,0.0003662126,0.00008146767,0.36803547,0.087433465,0.008466875,0.01593937,0.5136192],"study_design_scores_gemma":[0.000016167454,0.00008985248,0.00028867673,0.0000068281206,0.000037590173,0.00004395554,0.000009567443,0.9892452,0.008154329,0.000875995,0.0012235955,0.000008210327],"about_ca_topic_score_codex":0.006082755,"about_ca_topic_score_gemma":0.018969547,"teacher_disagreement_score":0.006082755,"about_ca_system_score_codex":0.0003806714,"about_ca_system_score_gemma":0.000758666,"threshold_uncertainty_score":0.0120946765},"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":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14383939,0.0026102606,0.36683652,0.001345582,0.0015591112,0.0010240027,0.008412481,0.40929967,0.06507295],"genre_scores_gemma":[0.56385976,0.0008409128,0.33343413,0.0021858034,0.00027029408,0.00067855883,0.01707629,0.013738853,0.06791541],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990822,0.00007416606,0.000056641024,0.00026301475,0.000355322,0.00016859743],"domain_scores_gemma":[0.99782145,0.00036344738,0.00016499842,0.0010323738,0.00052396505,0.00009372993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042654973,0.0012144459,0.000479731,0.0010416871,0.0005594936,0.0010373124,0.0023450002,0.00078181666,0.021598097],"category_scores_gemma":[0.002660061,0.0005387967,0.00062063464,0.00096441485,0.0005082403,0.0017682222,0.0013688568,0.0010941102,0.009393233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021125083,0.00042538208,0.008986971,0.00090681564,0.00018880781,0.00045953077,0.00033429934,0.017748207,0.06550852,0.017594427,0.22368196,0.66205263],"study_design_scores_gemma":[0.0006195152,0.0015040794,0.008796156,0.00015019767,0.00016946193,0.0012253693,0.0003198216,0.37563017,0.2458375,0.02783696,0.33762726,0.00028355804],"about_ca_topic_score_codex":0.004725823,"about_ca_topic_score_gemma":0.008908382,"teacher_disagreement_score":0.021598097,"about_ca_system_score_codex":0.0008214133,"about_ca_system_score_gemma":0.0015382796,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05651143,0.00045411667,0.8887262,0.00019091704,0.00019253042,0.0004750087,0.00017567181,0.03780475,0.015469384],"genre_scores_gemma":[0.5756847,0.00033582238,0.3905256,0.0005264216,0.00016927444,0.0007324539,0.00076085364,0.0074663395,0.023798436],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973678,0.00064080587,0.00025464105,0.00058502436,0.00080051785,0.00035120166],"domain_scores_gemma":[0.9930153,0.0013964736,0.00030700638,0.003987255,0.00094295,0.0003509776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034787578,0.0008073101,0.0008118717,0.00034041086,0.0007158745,0.0021535063,0.0030477685,0.00071641087,0.0067254673],"category_scores_gemma":[0.009047232,0.0007616375,0.0008289764,0.00037493624,0.0009845218,0.0028622388,0.0025103765,0.0022724224,0.0021328614],"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.0029233221,0.00091980933,0.021500584,0.001105899,0.0003536977,0.0006221495,0.003554639,0.0437668,0.17815432,0.102944516,0.037431024,0.60672325],"study_design_scores_gemma":[0.0002998439,0.00089320965,0.0044785943,0.00016710849,0.0002556861,0.0008296165,0.0002234835,0.516051,0.18788056,0.047237,0.24145278,0.00023112494],"about_ca_topic_score_codex":0.0010640135,"about_ca_topic_score_gemma":0.0013062932,"teacher_disagreement_score":0.0067254673,"about_ca_system_score_codex":0.0007976328,"about_ca_system_score_gemma":0.0018506206,"threshold_uncertainty_score":0.022498906},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005677422,0.00940782,0.0053381105,0.009552601,0.002870378,0.00010377064,0.012537463,0.0018777208,0.95263463],"genre_scores_gemma":[0.012349322,0.003918522,0.0024097562,0.0003917399,0.0001193993,0.000026755908,0.001501285,0.00045061385,0.9788326],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992112,0.000050200284,0.0000138589385,0.00016508615,0.00036405353,0.00019562185],"domain_scores_gemma":[0.99902165,0.00016329034,0.000045530767,0.000089676905,0.00048473742,0.00019512809],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005567303,0.0010623756,0.0009708294,0.0010861658,0.0022443305,0.003397405,0.0012136544,0.0020077405,0.49203014],"category_scores_gemma":[0.0013229569,0.0004847241,0.00040849828,0.0014746133,0.0008224428,0.00087402953,0.0013921075,0.0024426465,0.19057916],"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.00046773837,0.00009474851,0.0022545657,0.0004433522,0.000056667253,0.0004408186,0.00020538236,0.0021648833,0.005840305,0.047350902,0.7228464,0.21783426],"study_design_scores_gemma":[0.000022937393,0.000011741145,0.0014801814,0.00008482349,0.000004445052,0.00007540365,0.0000756404,0.00050641806,0.00086893846,0.0006918027,0.9961623,0.000015456688],"about_ca_topic_score_codex":0.5942217,"about_ca_topic_score_gemma":0.5976766,"teacher_disagreement_score":0.5942217,"about_ca_system_score_codex":0.0067688213,"about_ca_system_score_gemma":0.010309468,"threshold_uncertainty_score":0.816336},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11395891,0.00066966825,0.85434765,0.00020209304,0.000085886175,0.000070823975,0.00015270954,0.019754255,0.0107579725],"genre_scores_gemma":[0.85027486,0.0003170454,0.14109369,0.0001015656,0.000031513166,0.00004553302,0.00014649624,0.0009124365,0.007076756],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999313,0.0002636062,0.000034663553,0.0000947829,0.00020594343,0.00008795663],"domain_scores_gemma":[0.99755645,0.0017126534,0.00012969234,0.00037197594,0.00015385463,0.0000752339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010481552,0.0005090699,0.00029300636,0.00052483694,0.000298264,0.00085064716,0.0009038359,0.000567493,0.008068549],"category_scores_gemma":[0.0039618635,0.0003230522,0.00020467331,0.0002754277,0.00061227,0.0016754064,0.00086834206,0.00071574934,0.0006903194],"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.0039249216,0.0002468825,0.01276579,0.0005743196,0.00008263059,0.00236635,0.0027049084,0.08006122,0.13159057,0.062230933,0.014043002,0.6894085],"study_design_scores_gemma":[0.0003921637,0.0012150217,0.0056463494,0.000261523,0.000105900355,0.0019389985,0.00040243723,0.48847058,0.34885213,0.04810335,0.104493946,0.00011760205],"about_ca_topic_score_codex":0.0008167381,"about_ca_topic_score_gemma":0.001204996,"teacher_disagreement_score":0.008068549,"about_ca_system_score_codex":0.00037839328,"about_ca_system_score_gemma":0.00031786133,"threshold_uncertainty_score":0.026992023},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2438676,0.0023044045,0.669778,0.0020949852,0.00072850764,0.00023110367,0.0006597546,0.034574896,0.04576076],"genre_scores_gemma":[0.6289675,0.00089741347,0.34978804,0.0006994061,0.00008883432,0.000115228846,0.0007104506,0.0025754152,0.016157625],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998037,0.000029359233,0.0000133380245,0.00002863944,0.00007415334,0.000050852253],"domain_scores_gemma":[0.9993197,0.00016447608,0.000044960238,0.00025618536,0.00016437071,0.000050340408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043451905,0.0005426642,0.0001715884,0.00051052065,0.00031651597,0.0008212094,0.00081503665,0.00023343522,0.0064763296],"category_scores_gemma":[0.0013122477,0.00023196227,0.00017855642,0.00033162304,0.0004688422,0.0015943774,0.00064819964,0.0011487593,0.0016174321],"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.0006811508,0.000172319,0.0065416154,0.00057272514,0.000049615617,0.00071187055,0.0011353084,0.023662034,0.24069805,0.061877064,0.035408918,0.62848943],"study_design_scores_gemma":[0.00022152082,0.0010092249,0.006102604,0.00026556198,0.000103403276,0.0009735156,0.0006662559,0.1454812,0.42665377,0.05095735,0.3674382,0.00012736469],"about_ca_topic_score_codex":0.0020251907,"about_ca_topic_score_gemma":0.004332487,"teacher_disagreement_score":0.0064763296,"about_ca_system_score_codex":0.0003999776,"about_ca_system_score_gemma":0.00095483044,"threshold_uncertainty_score":0.021665514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07801588,0.00015721074,0.9114859,0.00012781717,0.00009172173,0.00004653327,0.00004419535,0.0050615016,0.0049691545],"genre_scores_gemma":[0.730276,0.00012736685,0.2658348,0.00010182267,0.000040913696,0.00008274683,0.00009334885,0.0012190816,0.002223963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932516,0.00012468353,0.000044662156,0.00010567696,0.00031415257,0.000085670865],"domain_scores_gemma":[0.9984718,0.0004161471,0.00018680074,0.00063716306,0.00023703625,0.00005115944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007591441,0.00026670535,0.000264225,0.00031215747,0.00039748166,0.0007775905,0.0005199017,0.0002579796,0.0010402412],"category_scores_gemma":[0.002775799,0.00025472723,0.0002671543,0.0002987535,0.00067763356,0.0009018463,0.0006079383,0.0010898245,0.00032524634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061170897,0.000259423,0.006092646,0.00024422654,0.000052859665,0.00030959546,0.00085763837,0.25999135,0.2552744,0.24659064,0.006092781,0.22362277],"study_design_scores_gemma":[0.00006630693,0.00028661423,0.0017431914,0.000048392805,0.000053616444,0.00021447743,0.0000651661,0.75030494,0.15867788,0.057055093,0.0314286,0.000055833687],"about_ca_topic_score_codex":0.00097410235,"about_ca_topic_score_gemma":0.0016486705,"teacher_disagreement_score":0.0010402412,"about_ca_system_score_codex":0.0005892933,"about_ca_system_score_gemma":0.0016721507,"threshold_uncertainty_score":0.0042756796},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13973527,0.00047190435,0.7436688,0.00040814807,0.00028990733,0.00019781994,0.000540314,0.07160497,0.04308282],"genre_scores_gemma":[0.40457797,0.00036813528,0.54262596,0.00022391122,0.000113704715,0.00026927242,0.0020676453,0.013659419,0.036094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954563,0.00011650351,0.0000313992,0.00006400532,0.00016525107,0.000077085526],"domain_scores_gemma":[0.9991548,0.0002966731,0.000092990515,0.00017887591,0.00023826965,0.000038455284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007272388,0.0008068548,0.0003778837,0.0007681608,0.0006064753,0.0010359994,0.0009257292,0.0003197796,0.018905187],"category_scores_gemma":[0.00230484,0.00046116253,0.0003951747,0.0005762351,0.00035623377,0.0012082896,0.0005659601,0.00081392255,0.0033895818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015417701,0.00027021838,0.0064144214,0.00067721854,0.000070964925,0.0009590902,0.0017074639,0.05122622,0.09986043,0.07534712,0.09581581,0.66610926],"study_design_scores_gemma":[0.00040202023,0.00063273625,0.004098387,0.00016371628,0.0000875767,0.0008273985,0.00017448394,0.35985726,0.31353456,0.013929473,0.30620897,0.000083406325],"about_ca_topic_score_codex":0.0014592974,"about_ca_topic_score_gemma":0.0023819595,"teacher_disagreement_score":0.018905187,"about_ca_system_score_codex":0.0009800751,"about_ca_system_score_gemma":0.0011026952,"threshold_uncertainty_score":0.063244164},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0119867865,0.07967514,0.06918578,0.11551799,0.22088185,0.0016278964,0.003893895,0.0059659914,0.4912647],"genre_scores_gemma":[0.034391005,0.018918611,0.013161413,0.011531291,0.03593344,0.0004347477,0.0017993879,0.0013858381,0.88244426],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992514,0.00011207819,0.000024847392,0.00014813,0.0003066709,0.00015684414],"domain_scores_gemma":[0.998262,0.000211868,0.00007020917,0.000119166885,0.00054489553,0.00079190463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023624047,0.0013182303,0.0009896425,0.0004523178,0.0017128461,0.0035909656,0.0012330842,0.0028446864,0.2694273],"category_scores_gemma":[0.0016236107,0.00038854344,0.0008808757,0.00079206575,0.00045309804,0.0026651274,0.0018348807,0.0029892086,0.08381054],"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.00027954055,0.000092477225,0.00023723436,0.0002747983,0.000018898729,0.000055849432,0.00004451482,0.00033672334,0.003086098,0.0021444915,0.8991454,0.09428405],"study_design_scores_gemma":[0.000059204263,0.00022441325,0.00088610686,0.000107430846,0.000024186687,0.00016650565,0.0001031829,0.0009388573,0.0020048248,0.0028628495,0.992592,0.000030444487],"about_ca_topic_score_codex":0.00071903464,"about_ca_topic_score_gemma":0.003130577,"teacher_disagreement_score":0.2694273,"about_ca_system_score_codex":0.00085787405,"about_ca_system_score_gemma":0.0019583055,"threshold_uncertainty_score":0.9013241},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015593496,0.0081463875,0.06549372,0.019190066,0.04289719,0.0015065408,0.006934332,0.0060262578,0.834212],"genre_scores_gemma":[0.04045789,0.0022151852,0.005323039,0.0008732906,0.007100422,0.000320811,0.0017608128,0.0007430431,0.9412055],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997048,0.000040798914,0.000011548408,0.000066613735,0.0001006487,0.00007549701],"domain_scores_gemma":[0.99925786,0.00010575342,0.000031814587,0.000112154295,0.0001910447,0.00030131862],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008972415,0.0014389867,0.00084054685,0.0005361928,0.0014163427,0.0024854676,0.00072824326,0.0018354224,0.507953],"category_scores_gemma":[0.00093201554,0.00028631472,0.0006059134,0.0006101115,0.00026995488,0.0015003134,0.0019159896,0.0013513209,0.20535502],"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.0007731263,0.00016745305,0.0005414888,0.00029906046,0.00002924392,0.000116622134,0.00006353971,0.0011204958,0.008009309,0.0056147175,0.83561385,0.14765112],"study_design_scores_gemma":[0.00014173114,0.00036769276,0.0017245975,0.00008143376,0.00003140222,0.00022410128,0.00007360099,0.004774487,0.008029524,0.005209177,0.97931194,0.000030360177],"about_ca_topic_score_codex":0.0002886257,"about_ca_topic_score_gemma":0.0010516364,"teacher_disagreement_score":0.492047,"about_ca_system_score_codex":0.00048365424,"about_ca_system_score_gemma":0.0009612573,"threshold_uncertainty_score":0.7018453},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0206228,0.016291613,0.34660605,0.01791532,0.02373197,0.0021675301,0.0064660525,0.011283551,0.55491525],"genre_scores_gemma":[0.13283627,0.008608186,0.028030109,0.00087829196,0.006394142,0.0004963027,0.00282179,0.0012145248,0.81872034],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995221,0.00014949738,0.00001872143,0.00009588942,0.00012912355,0.00008470786],"domain_scores_gemma":[0.9981341,0.0008485558,0.000050518363,0.00025540264,0.0004242079,0.00028718295],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013489178,0.0013921758,0.0016402581,0.00049066887,0.0009771093,0.002712945,0.0010469735,0.002123344,0.49434724],"category_scores_gemma":[0.0028422596,0.00030108416,0.00073177286,0.0007429021,0.0003381491,0.0012814221,0.0008820053,0.0017110289,0.16102733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015947312,0.0004477809,0.00082808,0.0007756959,0.000093929826,0.0001450678,0.00013153203,0.0050301957,0.014798906,0.010700573,0.68603265,0.27942076],"study_design_scores_gemma":[0.00048406742,0.0015062076,0.0041530356,0.00031834503,0.0001962423,0.00040341722,0.00018999445,0.050652385,0.025389856,0.019704774,0.89687663,0.00012502707],"about_ca_topic_score_codex":0.0009063264,"about_ca_topic_score_gemma":0.0016501459,"teacher_disagreement_score":0.49434724,"about_ca_system_score_codex":0.0006783673,"about_ca_system_score_gemma":0.0007734593,"threshold_uncertainty_score":0.72125226},"labels":[],"label_agreement":null},{"id":"W3137917418","doi":"10.1145/1735971.1736036","title":"Addressing shared resource contention in multicore processors via scheduling","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; Workload; Thread (computing); Shared memory; Multi-core processor; Gang scheduling; Cache; Parallel computing; Fair-share scheduling; Quality of service; Two-level scheduling; Operating system; Computer network","score_opus":0.057632346588271835,"score_gpt":0.3106199538624083,"score_spread":0.2529876072741365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137917418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18189631,0.0015577878,0.81125635,0.00041103273,0.00013908192,0.00013193593,0.000026095462,0.0012403593,0.0033410047],"genre_scores_gemma":[0.76696396,0.0004605253,0.23115014,0.00010392548,0.0000923897,0.000084330706,0.000043564418,0.00011329338,0.0009878285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998459,0.00057833083,0.00010485055,0.00015378161,0.0004738723,0.00023022322],"domain_scores_gemma":[0.9967265,0.0014477677,0.00042472332,0.0007188417,0.000533575,0.00014849874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001925885,0.00052285637,0.0007526352,0.000721991,0.0010055394,0.0011996494,0.0013355407,0.00052283646,0.0006993225],"category_scores_gemma":[0.0056634783,0.00032901278,0.00040243383,0.0012974927,0.0009974022,0.001721945,0.0009472453,0.0007538609,0.00014560243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005129668,0.0002877236,0.0072519346,0.00032038378,0.0001329134,0.00021481772,0.00039967697,0.5827483,0.059867103,0.04733198,0.0031057089,0.2978265],"study_design_scores_gemma":[0.00003563484,0.00015485976,0.0005182026,0.000014027402,0.000034956767,0.000060040245,0.00006427387,0.9597975,0.017493576,0.018603522,0.0032060882,0.000017266178],"about_ca_topic_score_codex":0.002144804,"about_ca_topic_score_gemma":0.0033307213,"teacher_disagreement_score":0.002144804,"about_ca_system_score_codex":0.0010861001,"about_ca_system_score_gemma":0.0022073593,"threshold_uncertainty_score":0.010185182},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033805743,0.0008912366,0.55172235,0.0003860212,0.0003982923,0.00022055823,0.0066079064,0.37805864,0.027909286],"genre_scores_gemma":[0.27091056,0.0005592037,0.61546016,0.0004905544,0.00012040208,0.00045544567,0.019403005,0.076037094,0.016563611],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985682,0.00026159827,0.000087904664,0.00030097744,0.0005829789,0.00019839246],"domain_scores_gemma":[0.998895,0.00037082168,0.000040970874,0.0003864314,0.00024810722,0.000058642807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010853668,0.0017448282,0.0011351829,0.00084809575,0.0006621712,0.0019468497,0.003033918,0.0009826514,0.023394655],"category_scores_gemma":[0.0033576826,0.00086348975,0.0012650911,0.001571594,0.00088895997,0.0017414172,0.0016370533,0.001637185,0.0063229124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002652234,0.00029103045,0.0033501855,0.0012307084,0.0004131628,0.00061955745,0.0006762383,0.11711781,0.053855956,0.03976356,0.4114575,0.36857203],"study_design_scores_gemma":[0.00086600706,0.00018347564,0.0013152848,0.00006387859,0.000077212506,0.00028785213,0.0001335612,0.77698123,0.08599042,0.01911071,0.11488291,0.00010750753],"about_ca_topic_score_codex":0.011153403,"about_ca_topic_score_gemma":0.012576412,"teacher_disagreement_score":0.023394655,"about_ca_system_score_codex":0.0011818846,"about_ca_system_score_gemma":0.0016451464,"threshold_uncertainty_score":0.078262866},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17412592,0.12502939,0.4853217,0.10288771,0.0053932928,0.00030645315,0.0012670577,0.0043315296,0.10133687],"genre_scores_gemma":[0.82430476,0.02162843,0.12215623,0.004968328,0.0030903334,0.00041826544,0.00043795066,0.0005903173,0.022405464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979832,0.00057084527,0.00012859431,0.00033574316,0.00071729004,0.0002643228],"domain_scores_gemma":[0.9966144,0.0014957492,0.00027500716,0.0006067171,0.0007211715,0.00028700175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027408167,0.00049805234,0.0012156577,0.0005784428,0.0024174615,0.0045915158,0.003401964,0.0016495938,0.0061449576],"category_scores_gemma":[0.008373055,0.0004987433,0.00037243174,0.0011536321,0.0016528827,0.007908272,0.0031761397,0.0027078744,0.002201778],"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.0005404443,0.00021973744,0.003337425,0.001224468,0.00014358843,0.000544332,0.00089975056,0.12752695,0.007008007,0.4972209,0.09527346,0.26606107],"study_design_scores_gemma":[0.000081897895,0.00012200761,0.0011847608,0.0002121845,0.000053623346,0.00048481798,0.00067659095,0.46873024,0.0033066918,0.42833868,0.09672645,0.00008211625],"about_ca_topic_score_codex":0.002146993,"about_ca_topic_score_gemma":0.0021824704,"teacher_disagreement_score":0.0061449576,"about_ca_system_score_codex":0.0021359418,"about_ca_system_score_gemma":0.0016165513,"threshold_uncertainty_score":0.020556986},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08695646,0.00065736496,0.87018853,0.00060588005,0.00021936616,0.00021316414,0.0012686445,0.023379775,0.016510762],"genre_scores_gemma":[0.39010537,0.0005754102,0.60082364,0.00026527303,0.000049638165,0.00021784203,0.0017091418,0.0009556681,0.005298019],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996927,0.000043182554,0.000018040315,0.00007594098,0.0001341853,0.00003598282],"domain_scores_gemma":[0.9996768,0.000081202554,0.000025645946,0.00010619726,0.00009071889,0.000019428266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020576752,0.00080257095,0.0005450257,0.0006687581,0.00031314231,0.0013325302,0.0013357545,0.0005332029,0.0056424923],"category_scores_gemma":[0.001470378,0.00033865724,0.00049609196,0.001958667,0.0003614534,0.0011930923,0.00069027336,0.0009587041,0.001965779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010804686,0.00033131227,0.010902755,0.0005628825,0.0003326012,0.00068880164,0.00044610215,0.119903654,0.23336822,0.023595192,0.06378458,0.5450035],"study_design_scores_gemma":[0.0000930207,0.00027100646,0.0039672446,0.000048715734,0.00006294347,0.00036314788,0.000077073055,0.8700337,0.06598665,0.007710581,0.05132464,0.00006127804],"about_ca_topic_score_codex":0.0043532667,"about_ca_topic_score_gemma":0.0048318007,"teacher_disagreement_score":0.0056424923,"about_ca_system_score_codex":0.0004955974,"about_ca_system_score_gemma":0.00077586184,"threshold_uncertainty_score":0.018876076},"labels":[],"label_agreement":null},{"id":"W3140162682","doi":"10.1145/543552.512542","title":"Profile-guided code compression","year":2002,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Executable; Memory footprint; Code (set theory); Overhead (engineering); Compression (physics); Software; Dead code; Embedded system; Set (abstract data type); Operating system; Programming language; Code generation; Redundant code; Key (lock)","score_opus":0.06253402740222241,"score_gpt":0.29262444176266994,"score_spread":0.23009041436044753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140162682","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19812271,0.0011665248,0.7685531,0.0005738817,0.0001868224,0.00048657123,0.00065119367,0.014290375,0.015968792],"genre_scores_gemma":[0.58327186,0.0006875676,0.401994,0.0003916523,0.00008238293,0.0004033147,0.0016831371,0.0010581937,0.010427909],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939215,0.00006117696,0.00003739733,0.00007999292,0.00036102996,0.00006832845],"domain_scores_gemma":[0.9985525,0.00036946987,0.00017115774,0.0003593263,0.00050338934,0.000044078508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030576347,0.00059615576,0.0003773734,0.0012124665,0.0003905117,0.00059404917,0.0008880626,0.00050518464,0.0020597],"category_scores_gemma":[0.0034998697,0.0002009528,0.00023155479,0.0012027966,0.00042865952,0.0007153507,0.0007618923,0.0005580561,0.0013024731],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062348106,0.00020321134,0.0034351586,0.00027047974,0.00002952302,0.00036089236,0.00033367093,0.042164437,0.18712732,0.012262198,0.010947574,0.7422421],"study_design_scores_gemma":[0.00010542221,0.00035656666,0.0036735504,0.000086753345,0.000037726568,0.0011831521,0.00017878671,0.57860017,0.37440202,0.012130812,0.029189184,0.00005585694],"about_ca_topic_score_codex":0.0015300121,"about_ca_topic_score_gemma":0.0023151273,"teacher_disagreement_score":0.0020597,"about_ca_system_score_codex":0.00038163338,"about_ca_system_score_gemma":0.0010231546,"threshold_uncertainty_score":0.0068903565},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19414042,0.00080605346,0.79158753,0.00044935438,0.000065690016,0.000079958736,0.00004059809,0.005445027,0.0073854104],"genre_scores_gemma":[0.7317696,0.00017738325,0.26371798,0.00014015948,0.000046335896,0.0001133925,0.00006681723,0.00022256908,0.0037458076],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99964035,0.000112780486,0.000023720268,0.000055036737,0.0001138777,0.000054157485],"domain_scores_gemma":[0.9990055,0.0002586191,0.00010206168,0.00042652586,0.00015492638,0.000052372667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041119254,0.00028892525,0.00036057233,0.00034083592,0.0005711894,0.0006024104,0.0013548415,0.0003018323,0.0014296909],"category_scores_gemma":[0.0011311086,0.00022645273,0.00034519643,0.00050392916,0.0005047902,0.0012969922,0.0010791842,0.0007467574,0.00040645702],"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.0009669004,0.00037889212,0.005018337,0.0003701331,0.000121262645,0.00041361642,0.00070323574,0.2504878,0.21711557,0.0693715,0.011049496,0.4440033],"study_design_scores_gemma":[0.00012197001,0.00037113586,0.00093569397,0.000023471053,0.00007394074,0.00018672743,0.000064786305,0.89129466,0.07232205,0.019564789,0.014996074,0.000044621433],"about_ca_topic_score_codex":0.0014823116,"about_ca_topic_score_gemma":0.003102592,"teacher_disagreement_score":0.0014823116,"about_ca_system_score_codex":0.0006689376,"about_ca_system_score_gemma":0.0009249005,"threshold_uncertainty_score":0.0048535466},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0115207825,0.00007414303,0.9825581,0.000074496995,0.000013360524,0.000035338362,0.00027252935,0.0036502937,0.0018009595],"genre_scores_gemma":[0.42748135,0.0002880765,0.5617003,0.00019861842,0.00006035342,0.00023170045,0.0018934427,0.0024266466,0.0057196436],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998374,0.00035803005,0.00015267552,0.00025282003,0.00067255116,0.00018990197],"domain_scores_gemma":[0.9966689,0.001360829,0.00036991696,0.00079519156,0.0007469514,0.00005823616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011900669,0.0010606752,0.0006480387,0.0017645867,0.00064332987,0.0012173193,0.0012342599,0.00046856876,0.004829497],"category_scores_gemma":[0.0040381984,0.00048633743,0.00083441695,0.0019325403,0.0011049138,0.003215266,0.0016583052,0.0014884823,0.0008729504],"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.00046031098,0.0002074714,0.009342163,0.00039005908,0.00011381523,0.0006253328,0.0008451761,0.3168214,0.035198733,0.18415166,0.013206731,0.43863708],"study_design_scores_gemma":[0.000021035215,0.000060038386,0.0008061859,0.000030245681,0.00003085785,0.00012485955,0.0000606115,0.85730076,0.03311644,0.098183595,0.010230636,0.00003472208],"about_ca_topic_score_codex":0.0043676,"about_ca_topic_score_gemma":0.006046278,"teacher_disagreement_score":0.004829497,"about_ca_system_score_codex":0.0009144686,"about_ca_system_score_gemma":0.0012382417,"threshold_uncertainty_score":0.016156256},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028317811,0.0015647734,0.9337797,0.00021003629,0.00025525838,0.0003724291,0.0001959956,0.018992325,0.016311703],"genre_scores_gemma":[0.43459252,0.0007579175,0.54580534,0.00036379122,0.00008235874,0.00050002505,0.0006852934,0.0022211203,0.014991591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788505,0.00043318328,0.00015080103,0.00034455062,0.00080242695,0.00038388307],"domain_scores_gemma":[0.99694127,0.00058725366,0.00017197938,0.0013607863,0.0008150235,0.00012370493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012971319,0.00072071684,0.0006649573,0.0012630642,0.0008156788,0.0018208347,0.002493348,0.00063511316,0.008986898],"category_scores_gemma":[0.0050263363,0.0005358556,0.0005089263,0.0014507496,0.0006544867,0.001980873,0.0019763468,0.0009533205,0.0032473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013273932,0.00042577347,0.00584462,0.00074204605,0.00023973659,0.00017083311,0.0004305172,0.08293982,0.10217965,0.08684233,0.028253052,0.6906042],"study_design_scores_gemma":[0.0005772301,0.00072021666,0.004228363,0.00014988138,0.00036553285,0.0007423634,0.00021561688,0.5518648,0.17036895,0.045911316,0.22464164,0.0002140324],"about_ca_topic_score_codex":0.0028414652,"about_ca_topic_score_gemma":0.0040773246,"teacher_disagreement_score":0.008986898,"about_ca_system_score_codex":0.00083663623,"about_ca_system_score_gemma":0.0016759656,"threshold_uncertainty_score":0.030064166},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13772498,0.00095471466,0.8423313,0.00041274386,0.000100196565,0.0001585867,0.00045040302,0.014308886,0.0035582443],"genre_scores_gemma":[0.53727466,0.0005930628,0.45615578,0.00020011043,0.000078510086,0.0003669232,0.0017758305,0.0017860618,0.0017691104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820256,0.00062615104,0.00012565646,0.0005512321,0.0003551153,0.00013930473],"domain_scores_gemma":[0.99387395,0.0033802502,0.0006841659,0.0011347634,0.00081812363,0.00010873509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022548253,0.0017454255,0.0009926973,0.0016703375,0.0005272075,0.0019526883,0.00166847,0.0010125606,0.0014985459],"category_scores_gemma":[0.013936453,0.0011431724,0.0010256105,0.0010292865,0.0008484247,0.0029224646,0.0010038448,0.002080728,0.0011186289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030824766,0.0002083527,0.0093164975,0.00028391526,0.00017207477,0.00010845067,0.00023578953,0.60778785,0.008622418,0.00773511,0.0044113863,0.36080992],"study_design_scores_gemma":[0.000022483668,0.00005225531,0.00045517014,0.00001971851,0.000022673023,0.000019475667,0.00002214058,0.9850236,0.0042657373,0.008886835,0.0011957447,0.000014274586],"about_ca_topic_score_codex":0.0019125865,"about_ca_topic_score_gemma":0.0028704733,"teacher_disagreement_score":0.0022548253,"about_ca_system_score_codex":0.00095469446,"about_ca_system_score_gemma":0.0016777065,"threshold_uncertainty_score":0.011924803},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4849649,0.0030061188,0.5002109,0.00091606803,0.0001189493,0.000047508736,0.00007958333,0.0037277415,0.0069282046],"genre_scores_gemma":[0.9403358,0.00029531703,0.058055226,0.00007968668,0.00005244608,0.000029022149,0.00005569349,0.000055069635,0.001041596],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994073,0.00018734523,0.000033725533,0.000059887127,0.00021492064,0.000096882206],"domain_scores_gemma":[0.9976113,0.0009787532,0.00031092728,0.00066898845,0.00036392658,0.0000661796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000801771,0.0002574825,0.00037358404,0.00049010443,0.0004503568,0.00052771653,0.00078703044,0.00033940386,0.0013892085],"category_scores_gemma":[0.003292651,0.00024860975,0.00032236028,0.00075577386,0.00049243314,0.0011905789,0.0008285374,0.0005292398,0.0003098891],"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.0010308408,0.00037191328,0.0186586,0.00036341333,0.00015716217,0.00031697532,0.0005866553,0.22841914,0.20668077,0.036736548,0.0066834926,0.49999446],"study_design_scores_gemma":[0.0000940738,0.0003446729,0.0023883416,0.00004286831,0.00011840169,0.00029888097,0.00013470606,0.8622431,0.10374357,0.023141274,0.00741024,0.000039835406],"about_ca_topic_score_codex":0.0014713794,"about_ca_topic_score_gemma":0.0025515591,"teacher_disagreement_score":0.0014713794,"about_ca_system_score_codex":0.00047188814,"about_ca_system_score_gemma":0.0011988676,"threshold_uncertainty_score":0.004647374},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06687252,0.0019950722,0.67750454,0.00066813646,0.0006195057,0.00069173134,0.0011205047,0.17131594,0.079212],"genre_scores_gemma":[0.45340335,0.0009721536,0.4733403,0.00055678777,0.0001400914,0.0004629685,0.003629326,0.0075302566,0.059964746],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896383,0.00007938166,0.00010205742,0.00015593259,0.00050888263,0.0001899763],"domain_scores_gemma":[0.99909985,0.0001290204,0.00008871113,0.00020288119,0.00034080018,0.00013873374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007767936,0.00076349056,0.00053590233,0.0007665035,0.00034519084,0.0017063348,0.0024446563,0.0007795009,0.015075374],"category_scores_gemma":[0.0023600603,0.0005796603,0.00050694414,0.000700026,0.00056325964,0.0019498718,0.0012867147,0.0010272323,0.004888506],"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.0026193,0.0010208137,0.005495189,0.0009651648,0.00022712826,0.00196811,0.001180646,0.015749589,0.19039613,0.14521474,0.0947146,0.5404487],"study_design_scores_gemma":[0.0010269318,0.0014582454,0.003708774,0.00033236263,0.0003496191,0.002496005,0.00025106024,0.2932143,0.22876555,0.025172306,0.4429145,0.00031029145],"about_ca_topic_score_codex":0.004200574,"about_ca_topic_score_gemma":0.004865087,"teacher_disagreement_score":0.015075374,"about_ca_system_score_codex":0.000868556,"about_ca_system_score_gemma":0.0018480275,"threshold_uncertainty_score":0.050432205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017650045,0.0005669582,0.9697788,0.0012029812,0.00023436625,0.0000954342,0.00004459626,0.0031702253,0.0072565316],"genre_scores_gemma":[0.2002252,0.0010504621,0.78375053,0.0006529575,0.00037106423,0.00035899325,0.0003072259,0.0015265691,0.011757036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969388,0.0005178483,0.00014313756,0.00023102187,0.001839228,0.00033002472],"domain_scores_gemma":[0.9959246,0.0005773067,0.00026206876,0.0013254661,0.0016685635,0.00024204091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003017334,0.0010746348,0.00088452426,0.0012038655,0.0014147884,0.0025005082,0.0028065396,0.0013777877,0.002510626],"category_scores_gemma":[0.0066575096,0.0011329262,0.001131066,0.0014310171,0.0018658637,0.0040616686,0.0032636686,0.006440116,0.0016942242],"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.00092470687,0.0004269559,0.0045510153,0.0009583498,0.00024594885,0.0011387677,0.0015316248,0.08576392,0.121133864,0.42193466,0.034372855,0.32701734],"study_design_scores_gemma":[0.00024253997,0.00028600032,0.0008999661,0.00019928394,0.00017278739,0.0007207568,0.0002780817,0.594485,0.11726533,0.13226539,0.15303855,0.00014634714],"about_ca_topic_score_codex":0.0031785273,"about_ca_topic_score_gemma":0.002437761,"teacher_disagreement_score":0.0031785273,"about_ca_system_score_codex":0.0010856449,"about_ca_system_score_gemma":0.0030212826,"threshold_uncertainty_score":0.015957415},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19908354,0.00074678264,0.7777189,0.00023242053,0.00017773472,0.00018630366,0.0001818344,0.008484662,0.013187923],"genre_scores_gemma":[0.72108275,0.00018072914,0.27247146,0.00013625859,0.00003617224,0.00016100709,0.00021997724,0.00042278686,0.005288817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952495,0.00008089089,0.000041534793,0.000096402626,0.00017456742,0.00008163735],"domain_scores_gemma":[0.99948573,0.000108738204,0.00007405245,0.00020489852,0.00009587917,0.000030526226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038386715,0.0003570486,0.00028853217,0.0005603977,0.00046888218,0.0007497536,0.0012998199,0.000280231,0.002641502],"category_scores_gemma":[0.0011160556,0.0002334831,0.0003391338,0.0005694895,0.00046522415,0.0010998463,0.00081078743,0.00069021713,0.0003526236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012420168,0.0003001633,0.004275975,0.00043598723,0.00008673987,0.00040084036,0.00031473485,0.11908892,0.18442938,0.14195192,0.010267929,0.5372054],"study_design_scores_gemma":[0.00022383686,0.001012878,0.0021154284,0.00008100937,0.00013952798,0.00038079638,0.00010961781,0.69989944,0.21120043,0.03989837,0.044840515,0.00009816579],"about_ca_topic_score_codex":0.0013540984,"about_ca_topic_score_gemma":0.0027161941,"teacher_disagreement_score":0.002641502,"about_ca_system_score_codex":0.0007994088,"about_ca_system_score_gemma":0.0010547613,"threshold_uncertainty_score":0.008836687},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97301394,0.00014732618,0.024330286,0.00002722551,0.000021842916,0.0001202361,0.00008588289,0.0006468667,0.0016065334],"genre_scores_gemma":[0.9780832,0.00006126866,0.02103866,0.000017585247,0.0000075636235,0.00009084693,0.00018543769,0.000080781894,0.0004346175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99879175,0.00025215684,0.00012149793,0.00025411733,0.00038531364,0.00019522369],"domain_scores_gemma":[0.99655557,0.0014746925,0.0003904847,0.00068334845,0.0007374088,0.0001585741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009989743,0.0008729804,0.0003729492,0.00076232664,0.00040462957,0.0006713847,0.0009032738,0.00039322008,0.0006723756],"category_scores_gemma":[0.0052351677,0.0003291822,0.0002734697,0.0010314663,0.00044924734,0.0014014229,0.00050703617,0.00049718766,0.0002384171],"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.006935548,0.0034222633,0.052825395,0.0005276004,0.00025633912,0.0002798329,0.00048832543,0.35883987,0.347495,0.002054165,0.0016232218,0.22525246],"study_design_scores_gemma":[0.00021323765,0.0036296528,0.033076335,0.000012321743,0.00014344661,0.00019123706,0.00022405457,0.76195854,0.19841647,0.00086139404,0.0012112148,0.00006208109],"about_ca_topic_score_codex":0.0035379014,"about_ca_topic_score_gemma":0.0023461964,"teacher_disagreement_score":0.0035379014,"about_ca_system_score_codex":0.0005504925,"about_ca_system_score_gemma":0.0006294373,"threshold_uncertainty_score":0.0070346},"labels":[],"label_agreement":null},{"id":"W3148573243","doi":"10.1145/2858788.2688521","title":"On optimizing machine learning workloads via kernel fusion","year":2015,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"Nvidia","keywords":"Computer science; Kernel (algebra); Scalability; Locality; Parallel computing; Matrix multiplication; Computation; Range (aeronautics); Algorithm","score_opus":0.03233663507408029,"score_gpt":0.2699771110886107,"score_spread":0.23764047601453042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3148573243","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13788415,0.0004402265,0.8526396,0.00029853234,0.00004928556,0.000072464914,0.00008540082,0.0037526407,0.004777718],"genre_scores_gemma":[0.7601757,0.00025918547,0.23668371,0.00009953039,0.000045570425,0.000079649,0.00028304564,0.00034552772,0.002028031],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910337,0.00023777458,0.000052682535,0.000116282165,0.0003334364,0.00015638063],"domain_scores_gemma":[0.9983418,0.0007947963,0.00010186178,0.0003576273,0.00032829368,0.00007554132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009215807,0.00081917184,0.00066793134,0.0004521458,0.00046337504,0.0009408824,0.0010399171,0.0005481069,0.0014846277],"category_scores_gemma":[0.0047070384,0.0002693538,0.00038501868,0.0011271064,0.0005478196,0.002043889,0.0010847822,0.00084220007,0.00074311625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028073083,0.00020483037,0.0019376248,0.00007749915,0.000033213324,0.00007037641,0.00011361129,0.79210144,0.020561568,0.012817946,0.0026021015,0.16919899],"study_design_scores_gemma":[0.0000044275434,0.000019269404,0.00009605317,0.0000015916206,0.0000024092762,0.000008693157,0.000008769422,0.99377656,0.0030802025,0.0026666645,0.0003326381,0.0000027169667],"about_ca_topic_score_codex":0.0027767695,"about_ca_topic_score_gemma":0.0034493331,"teacher_disagreement_score":0.0027767695,"about_ca_system_score_codex":0.00081021746,"about_ca_system_score_gemma":0.0014091241,"threshold_uncertainty_score":0.0058785677},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013653666,0.00029468568,0.9796322,0.00019307961,0.00003196686,0.00008433696,0.00007804619,0.0014633444,0.004568732],"genre_scores_gemma":[0.39663616,0.0004890474,0.59785235,0.00013378484,0.00005025297,0.00042120798,0.0002143551,0.00085767393,0.0033452192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988426,0.00031013848,0.00004475722,0.00012606193,0.0005344142,0.0001420573],"domain_scores_gemma":[0.9991678,0.00029662348,0.00009765721,0.00017309735,0.00021019999,0.000054567216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013505323,0.0014842934,0.0008916006,0.0009289294,0.0005426159,0.001366118,0.0027224245,0.0008754465,0.0018473988],"category_scores_gemma":[0.0030446071,0.0006109772,0.00072008045,0.0009321372,0.00096148724,0.0017213795,0.0011683094,0.0015753575,0.0004712487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003176239,0.00007898781,0.0005157362,0.00005289208,0.000017757171,0.000045329438,0.000037446593,0.93883604,0.0044508786,0.034091543,0.0013034091,0.020538276],"study_design_scores_gemma":[0.0000034951331,0.000018429488,0.00004201376,0.000003950237,0.0000033077563,0.0000073046645,0.0000057259285,0.9944929,0.0007359478,0.004039642,0.0006435613,0.0000037333168],"about_ca_topic_score_codex":0.007151844,"about_ca_topic_score_gemma":0.0079542585,"teacher_disagreement_score":0.007151844,"about_ca_system_score_codex":0.0016039097,"about_ca_system_score_gemma":0.0025906775,"threshold_uncertainty_score":0.014220417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1821338,0.00062398636,0.8075675,0.00008805062,0.000049995877,0.000043044874,0.000052736068,0.0017961839,0.0076446836],"genre_scores_gemma":[0.6175706,0.00043662175,0.37763408,0.000055194603,0.000039264487,0.00005679968,0.000108119704,0.00013250274,0.0039668325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988675,0.000022092045,0.000005909638,0.000020001296,0.00004945758,0.000015758102],"domain_scores_gemma":[0.9998592,0.000045843943,0.000021230384,0.00004601705,0.00002208154,0.000005614446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010690959,0.00036987092,0.00019358344,0.00031112233,0.00019651964,0.00024789423,0.00049646804,0.00011187636,0.0018850232],"category_scores_gemma":[0.0003881203,0.00010795502,0.00019231734,0.00027775092,0.00012143322,0.0005247581,0.00022331011,0.00023163781,0.00039288827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023036564,0.000106137646,0.0010572058,0.00016129974,0.000028596816,0.00021264091,0.00009970243,0.06700357,0.22272648,0.016784798,0.0018333371,0.6897558],"study_design_scores_gemma":[0.00008052354,0.0007051431,0.0029694685,0.00003713744,0.00005489369,0.00064231205,0.0001183967,0.57580745,0.37361696,0.01802044,0.027917758,0.000029547084],"about_ca_topic_score_codex":0.00032990696,"about_ca_topic_score_gemma":0.00075415656,"teacher_disagreement_score":0.0018850232,"about_ca_system_score_codex":0.00018548909,"about_ca_system_score_gemma":0.00020969327,"threshold_uncertainty_score":0.006306052},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00351411,0.00013281527,0.9834658,0.0002726586,0.0001022816,0.00017337583,0.00009008175,0.0053138197,0.0069351792],"genre_scores_gemma":[0.07747023,0.00031905834,0.90940094,0.00019484412,0.00004276828,0.00056992244,0.0004866258,0.0013066821,0.010208908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981958,0.00065687054,0.00012258209,0.00023393762,0.0005647593,0.0002260643],"domain_scores_gemma":[0.99794585,0.0008622505,0.00009929616,0.0005813664,0.00038831888,0.00012295609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025387374,0.0013471877,0.0005567277,0.0008117688,0.0008078323,0.0020493553,0.0026100222,0.0012188229,0.019186292],"category_scores_gemma":[0.0052717733,0.0008966556,0.0016366233,0.0008127913,0.0008578418,0.0020189572,0.0023290287,0.0018267261,0.0043571885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047602737,0.0003729502,0.002189606,0.0007806934,0.00016563294,0.0005295681,0.0005485478,0.3230464,0.021523463,0.12859419,0.023452692,0.49832022],"study_design_scores_gemma":[0.000139186,0.00021506561,0.00023636087,0.00012296787,0.00007802237,0.00014883754,0.00012185893,0.837003,0.011669092,0.06932398,0.08090631,0.000035246783],"about_ca_topic_score_codex":0.0030607062,"about_ca_topic_score_gemma":0.004440381,"teacher_disagreement_score":0.019186292,"about_ca_system_score_codex":0.0008957628,"about_ca_system_score_gemma":0.0024855176,"threshold_uncertainty_score":0.06418455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021023843,0.00008171412,0.96968836,0.0002151417,0.00005737552,0.00003371084,0.000046621553,0.0039338684,0.0049194675],"genre_scores_gemma":[0.4097139,0.0002003593,0.57498723,0.00046783697,0.00007935616,0.00022550729,0.00014880857,0.0036325285,0.010544553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888664,0.00028858127,0.000091024616,0.00014963376,0.0004683578,0.00011584346],"domain_scores_gemma":[0.99744093,0.00086024916,0.00016435202,0.0011740798,0.00026824937,0.00009218821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015759524,0.0004455432,0.00038589985,0.00038620734,0.0006561827,0.0018962476,0.0019272685,0.00064091716,0.0037621846],"category_scores_gemma":[0.0040304367,0.00046042592,0.0006228161,0.0004785974,0.0027231716,0.003966405,0.0028790066,0.0022177505,0.0009025219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002377696,0.00008931695,0.0017355749,0.00022115353,0.00002318311,0.00026988806,0.0012919734,0.025758302,0.031120855,0.7945228,0.004684761,0.14004453],"study_design_scores_gemma":[0.00007150663,0.00013536446,0.00036811142,0.00007184122,0.000043780088,0.0003626504,0.00017299483,0.22787002,0.083838426,0.6356531,0.051338386,0.00007389415],"about_ca_topic_score_codex":0.00063576386,"about_ca_topic_score_gemma":0.0009404778,"teacher_disagreement_score":0.0037621846,"about_ca_system_score_codex":0.0006348054,"about_ca_system_score_gemma":0.00087658456,"threshold_uncertainty_score":0.012585759},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035096204,0.00029317627,0.88373715,0.00020995307,0.00012321101,0.00017436208,0.0015686266,0.09107499,0.019308813],"genre_scores_gemma":[0.13112412,0.001529883,0.7359856,0.00073166366,0.00022344508,0.0016829901,0.011833277,0.044057794,0.07283134],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99900013,0.00016760793,0.000084820895,0.000121709774,0.00049906905,0.00012672202],"domain_scores_gemma":[0.99887437,0.0002848922,0.00008866675,0.0003687654,0.00029042116,0.00009284551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010019375,0.0012702183,0.00073752913,0.0011309701,0.0011698005,0.0017648729,0.0035761101,0.0009891278,0.031654287],"category_scores_gemma":[0.0025253706,0.0009414519,0.0012268131,0.0016513962,0.0005298326,0.0024226843,0.0026550475,0.0021952644,0.014949802],"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.00081704295,0.000280062,0.0020426593,0.001253144,0.0002208541,0.0007684857,0.0006911627,0.13607791,0.02833394,0.13334212,0.25051442,0.44565818],"study_design_scores_gemma":[0.00024692665,0.00013794459,0.00056402857,0.00012925507,0.000069296584,0.00048459353,0.000103835795,0.33858997,0.034293696,0.037031673,0.5882012,0.00014762378],"about_ca_topic_score_codex":0.0026968112,"about_ca_topic_score_gemma":0.0036365949,"teacher_disagreement_score":0.031654287,"about_ca_system_score_codex":0.000993113,"about_ca_system_score_gemma":0.0020428824,"threshold_uncertainty_score":0.10589415},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011989236,0.0011564314,0.73376083,0.0007195575,0.0013991453,0.0016019114,0.005065342,0.21920736,0.025100144],"genre_scores_gemma":[0.10161592,0.000748642,0.79233116,0.0013694098,0.0005259516,0.0057544387,0.01464851,0.049849797,0.03315622],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99630165,0.001036761,0.0004465143,0.00053566723,0.0010694113,0.00060993707],"domain_scores_gemma":[0.9942198,0.0015070147,0.00022699301,0.00156398,0.0016352384,0.0008470707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005084886,0.0017828938,0.0016620464,0.001117855,0.0014541972,0.003408458,0.0065514073,0.0019463346,0.050035235],"category_scores_gemma":[0.013148858,0.0020589936,0.0017755996,0.0020800072,0.0011829794,0.0031398898,0.0035000525,0.004578795,0.034668267],"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.0059754294,0.0007109738,0.0024605151,0.0015029871,0.0005416012,0.0008313684,0.0006268954,0.032786302,0.03546568,0.05787881,0.6654736,0.19574586],"study_design_scores_gemma":[0.004164615,0.0007263709,0.0015138004,0.00032385264,0.00035401536,0.00042885198,0.000121568795,0.3333124,0.06472614,0.06805612,0.5258965,0.00037572312],"about_ca_topic_score_codex":0.0023761403,"about_ca_topic_score_gemma":0.0021000956,"teacher_disagreement_score":0.050035235,"about_ca_system_score_codex":0.0012049599,"about_ca_system_score_gemma":0.003787229,"threshold_uncertainty_score":0.16738456},"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":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06261152,0.00086598867,0.30551526,0.00036696886,0.0004960876,0.00080053136,0.005479474,0.61174846,0.012115792],"genre_scores_gemma":[0.40148935,0.00084901997,0.49570674,0.00066114805,0.00018635692,0.0016971348,0.026722498,0.062057927,0.010629884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977689,0.0003082937,0.00022653291,0.00031260858,0.0011487638,0.00023490057],"domain_scores_gemma":[0.9951178,0.0013628126,0.0005731762,0.0014896097,0.0011864351,0.0002702457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031525043,0.0021222804,0.00082008954,0.002022702,0.0006702231,0.0015269325,0.004054509,0.0010671543,0.011890314],"category_scores_gemma":[0.008693556,0.0014903381,0.0010369567,0.0012079312,0.00083651784,0.0040434315,0.0024485888,0.0019494337,0.004524992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005541024,0.0014648257,0.02707913,0.0026097114,0.0007410933,0.0008777433,0.00087355665,0.09692024,0.13623498,0.025382787,0.18380706,0.51846784],"study_design_scores_gemma":[0.0013398358,0.0025124138,0.008371283,0.00033646417,0.00028082196,0.00045725817,0.00022523463,0.5531111,0.2517429,0.013784123,0.16733548,0.00050307397],"about_ca_topic_score_codex":0.0034520288,"about_ca_topic_score_gemma":0.003410733,"teacher_disagreement_score":0.011890314,"about_ca_system_score_codex":0.0014167704,"about_ca_system_score_gemma":0.002790871,"threshold_uncertainty_score":0.0397771},"labels":[],"label_agreement":null},{"id":"W3161455369","doi":"10.1145/949343.949320","title":"Dynamic metrics for java","year":2003,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Concurrency; Just-in-time compilation; Java; Suite; Programming language; Benchmark (surveying); Set (abstract data type); Metric (unit)","score_opus":0.026085039855794065,"score_gpt":0.28849246355163466,"score_spread":0.2624074236958406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161455369","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016633641,0.0025969935,0.9520091,0.00082230347,0.00028586824,0.00048207358,0.0019745121,0.004509241,0.020686336],"genre_scores_gemma":[0.20694257,0.0018094925,0.7770247,0.00030729777,0.00023717502,0.0023394385,0.0039727674,0.0017583069,0.0056082574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9907206,0.0020227619,0.0013547904,0.0009470101,0.004610781,0.00034408056],"domain_scores_gemma":[0.9880723,0.004051528,0.0024009214,0.0019419497,0.003145456,0.00038781326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047700154,0.0014261466,0.00075872533,0.0059416946,0.0010678316,0.0037414478,0.0012603867,0.0010063171,0.0031522184],"category_scores_gemma":[0.03774475,0.0005297925,0.0008780726,0.0065844236,0.0014050336,0.0050420715,0.0030432683,0.0018147695,0.001165888],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106962456,0.00012380676,0.0057759043,0.00070183456,0.00007753446,0.00012802683,0.000732841,0.054198254,0.01064251,0.57158184,0.017606653,0.33832386],"study_design_scores_gemma":[0.00003801933,0.00048333185,0.0085235275,0.00039322022,0.00006562357,0.0005497205,0.00038358523,0.2125506,0.009190485,0.5482554,0.21939133,0.00017524787],"about_ca_topic_score_codex":0.003746773,"about_ca_topic_score_gemma":0.00324642,"teacher_disagreement_score":0.0059416946,"about_ca_system_score_codex":0.0023339863,"about_ca_system_score_gemma":0.0017864625,"threshold_uncertainty_score":0.025226533},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012897029,0.00048430482,0.90507597,0.00037953985,0.00007938179,0.00012968396,0.0009143208,0.07672689,0.0033129384],"genre_scores_gemma":[0.17628549,0.0004628529,0.81040907,0.00046976932,0.00010098367,0.00020751987,0.0027657433,0.006394407,0.0029042058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936098,0.0008566426,0.00043180995,0.00089245016,0.0036807128,0.00052857393],"domain_scores_gemma":[0.99304116,0.0022999493,0.000579473,0.0025807694,0.0012614497,0.00023721429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004372999,0.0012508912,0.0010074999,0.0023693272,0.0009749109,0.003115725,0.003919661,0.0010559547,0.0033852628],"category_scores_gemma":[0.013003613,0.0011676947,0.0020288175,0.0015517524,0.002322357,0.007456623,0.003925375,0.0028248888,0.0016518986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016846982,0.00047145208,0.019004168,0.001421799,0.0002919364,0.00028190052,0.0012220375,0.08573496,0.048003536,0.11346511,0.06786419,0.66055423],"study_design_scores_gemma":[0.00021393468,0.00023903268,0.0024343044,0.00018567267,0.00018283348,0.0003130716,0.00023655944,0.76383567,0.07716659,0.07570786,0.079311185,0.00017336346],"about_ca_topic_score_codex":0.005928815,"about_ca_topic_score_gemma":0.007866551,"teacher_disagreement_score":0.005928815,"about_ca_system_score_codex":0.0020656716,"about_ca_system_score_gemma":0.00557475,"threshold_uncertainty_score":0.0231269},"labels":[],"label_agreement":null},{"id":"W3167435556","doi":"10.1145/966049.781532","title":"Using generative design patterns to generate parallel code for a distributed memory environment","year":2003,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Computer science; Software design pattern; Programmer; Programming language; Design pattern; Code generation; Distributed memory; Code (set theory); Synchronization (alternating current); Set (abstract data type); Object-oriented programming; Java; Parallel computing; Distributed computing; Shared memory; Software; Operating system; Key (lock)","score_opus":0.0906055666464555,"score_gpt":0.3005933843122476,"score_spread":0.20998781766579208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167435556","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065055992,0.000021190222,0.9873707,0.00010144898,0.000020998006,0.00014325495,0.000048439168,0.0031119613,0.002676345],"genre_scores_gemma":[0.068296306,0.00009918539,0.92355883,0.00014849969,0.000010291468,0.00061444374,0.00034984466,0.0021814837,0.004741031],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986326,0.0004069556,0.00012215831,0.00019001965,0.00053654576,0.00011165971],"domain_scores_gemma":[0.9958293,0.0016997922,0.0002733868,0.0013252086,0.00074786897,0.00012444908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002020095,0.0010035349,0.0002973832,0.0007289109,0.00050795963,0.0014042129,0.0015863003,0.00088671566,0.00315433],"category_scores_gemma":[0.008312499,0.0007121945,0.0008636428,0.00059768703,0.001268098,0.0016392362,0.0016590655,0.0013509897,0.0013255223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032773335,0.00049787137,0.007273499,0.0011944234,0.0001523856,0.0016534345,0.0048906715,0.108580954,0.07537103,0.29132605,0.023755187,0.48497677],"study_design_scores_gemma":[0.00031979193,0.00040911685,0.0012969583,0.00022462546,0.00015149052,0.0017986041,0.00056184997,0.46781987,0.1362889,0.16169834,0.2293048,0.00012573386],"about_ca_topic_score_codex":0.00097615825,"about_ca_topic_score_gemma":0.0015568918,"teacher_disagreement_score":0.00315433,"about_ca_system_score_codex":0.0005730967,"about_ca_system_score_gemma":0.0012716424,"threshold_uncertainty_score":0.010683417},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.652934,0.0005980415,0.3162314,0.0000919014,0.00007983207,0.0001782041,0.0010393191,0.024441076,0.004406182],"genre_scores_gemma":[0.9406159,0.00011799866,0.057165805,0.000020305493,0.000010677806,0.000057311016,0.00042505265,0.00029149768,0.0012956008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992035,0.00009828176,0.00005724807,0.00017410368,0.00036165956,0.0001051772],"domain_scores_gemma":[0.99819934,0.0004823681,0.00038164936,0.00040828585,0.00045238188,0.00007598085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040581025,0.00071168906,0.00031594044,0.0010708026,0.00026026435,0.0005429188,0.0005979192,0.00022834114,0.0011963835],"category_scores_gemma":[0.0024244539,0.0002636842,0.00015788576,0.000851476,0.0002079723,0.00062092487,0.00037411807,0.0005629583,0.00036208867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015458068,0.00036592176,0.0553988,0.00054983405,0.00018027882,0.0003606156,0.0006840179,0.061574914,0.43356258,0.003591936,0.0048743435,0.43731105],"study_design_scores_gemma":[0.000037264504,0.00068923336,0.03957406,0.000034156263,0.000079076504,0.00033289884,0.00007885946,0.5073888,0.4427255,0.0013310608,0.0076302746,0.00009882274],"about_ca_topic_score_codex":0.001927363,"about_ca_topic_score_gemma":0.003162222,"teacher_disagreement_score":0.001927363,"about_ca_system_score_codex":0.00037509837,"about_ca_system_score_gemma":0.0007602358,"threshold_uncertainty_score":0.0040023327},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31339988,0.0007800109,0.65310925,0.00034841642,0.0002529847,0.00020577201,0.000356115,0.014089135,0.017458396],"genre_scores_gemma":[0.77737373,0.00022078108,0.21521536,0.0001436906,0.000038740247,0.00010384764,0.0005408125,0.00031741365,0.006045601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998461,0.000025235453,0.000007428392,0.000027061555,0.000062854335,0.000031407704],"domain_scores_gemma":[0.99971765,0.000084786676,0.00002578037,0.000051552015,0.00007698969,0.00004320703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023392853,0.00045063227,0.00022264443,0.00030914755,0.00024134805,0.00042827398,0.0008423517,0.00021219367,0.0041202554],"category_scores_gemma":[0.00065684627,0.00017565076,0.0002160419,0.00046801454,0.00015338942,0.00042140495,0.00036148267,0.000384384,0.00070509943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023547036,0.0006769243,0.0100398,0.00049099524,0.000186948,0.0009159257,0.00031842446,0.21871233,0.2705145,0.022919701,0.027776474,0.44509327],"study_design_scores_gemma":[0.00014861375,0.0005450127,0.0019071749,0.000016079899,0.00003637726,0.00016467214,0.000044497512,0.92586946,0.055104584,0.0029417796,0.013198054,0.000023628823],"about_ca_topic_score_codex":0.0023645351,"about_ca_topic_score_gemma":0.0042393864,"teacher_disagreement_score":0.0041202554,"about_ca_system_score_codex":0.00044799392,"about_ca_system_score_gemma":0.00062701566,"threshold_uncertainty_score":0.013783634},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18397924,0.0008170598,0.8067123,0.0003221474,0.00017398564,0.00012004533,0.00014123796,0.0046792645,0.0030546573],"genre_scores_gemma":[0.89469707,0.000113335016,0.10318267,0.00014765076,0.00005858094,0.00011332788,0.00018268132,0.00024621992,0.001258539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815196,0.00061979226,0.00013573102,0.00027703837,0.00048280516,0.00033257672],"domain_scores_gemma":[0.9938508,0.0025208301,0.00080054457,0.00174826,0.0008178097,0.0002616221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002546231,0.00051483145,0.0008915331,0.0011819026,0.001066127,0.0014039242,0.0018931231,0.0005600797,0.0022215089],"category_scores_gemma":[0.009099116,0.00048069548,0.00078792043,0.0009333867,0.0011601946,0.0024079608,0.0026967803,0.0012112857,0.00033541376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031658534,0.00062543154,0.045671415,0.00068233185,0.0005127582,0.0019168353,0.0018538296,0.43784758,0.100956805,0.13545346,0.0124251265,0.25888854],"study_design_scores_gemma":[0.00006180266,0.00015719571,0.0015198584,0.000021452825,0.000053896812,0.00016045135,0.00008628076,0.9635198,0.013751652,0.018416312,0.0022251827,0.000026147442],"about_ca_topic_score_codex":0.0026808302,"about_ca_topic_score_gemma":0.0046139825,"teacher_disagreement_score":0.0026808302,"about_ca_system_score_codex":0.0007417635,"about_ca_system_score_gemma":0.0018029081,"threshold_uncertainty_score":0.013465941},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9537938,0.0018508782,0.020860385,0.00041137627,0.00031087216,0.00016175075,0.0032641708,0.01632186,0.0030249357],"genre_scores_gemma":[0.94701344,0.00038279602,0.042078175,0.00013393661,0.0000682257,0.0001726368,0.008282091,0.0011486522,0.000720098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951197,0.0013656905,0.00048633406,0.0014088695,0.0011025862,0.0005167417],"domain_scores_gemma":[0.97395384,0.016153371,0.0016941071,0.0044473126,0.0029453477,0.00080608716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044442825,0.0025189153,0.0011461388,0.0031964537,0.0009253381,0.0018029647,0.0034577635,0.001228837,0.0010369483],"category_scores_gemma":[0.02903516,0.00080815906,0.0010694009,0.0033012095,0.0015213318,0.0031616027,0.0013838203,0.002026551,0.00065673166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006939045,0.003314317,0.06756416,0.0023652394,0.00065981835,0.0003928218,0.0009886469,0.55042034,0.025089918,0.0064883567,0.043459374,0.29231793],"study_design_scores_gemma":[0.00028778982,0.0008571578,0.017306553,0.000081251455,0.00009924111,0.00011400935,0.00033481963,0.9472979,0.02394104,0.004602728,0.004994132,0.000083322695],"about_ca_topic_score_codex":0.014975392,"about_ca_topic_score_gemma":0.0161411,"teacher_disagreement_score":0.014975392,"about_ca_system_score_codex":0.002610504,"about_ca_system_score_gemma":0.0023146935,"threshold_uncertainty_score":0.029776454},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12495889,0.0019592305,0.8248387,0.00046990486,0.00046517086,0.0006456558,0.0028097741,0.034394525,0.009458169],"genre_scores_gemma":[0.67797834,0.0005457799,0.3004054,0.00029710095,0.00019717154,0.00047992961,0.005182237,0.00112711,0.013786881],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989435,0.00013817781,0.00009651906,0.00015996289,0.0005239482,0.00013778596],"domain_scores_gemma":[0.99765825,0.00054903806,0.00016892808,0.001033791,0.00044756875,0.00014245644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009323326,0.00045838824,0.00047641463,0.0007241388,0.00082268653,0.0015590703,0.0029716908,0.00044825897,0.0071422514],"category_scores_gemma":[0.0032984288,0.00044094725,0.0002999264,0.0012063587,0.0006682233,0.0032729357,0.0024561454,0.000766628,0.002139909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041012713,0.0003994856,0.010325799,0.0008371581,0.00015298338,0.00038456716,0.0005675805,0.038049687,0.078222595,0.05258796,0.05947596,0.754895],"study_design_scores_gemma":[0.0012601127,0.0027327377,0.004505673,0.00009808566,0.00018992418,0.001120205,0.00063541904,0.53948283,0.25039336,0.048622232,0.15068056,0.00027891714],"about_ca_topic_score_codex":0.0015730171,"about_ca_topic_score_gemma":0.0018246667,"teacher_disagreement_score":0.0071422514,"about_ca_system_score_codex":0.0007863527,"about_ca_system_score_gemma":0.0015477373,"threshold_uncertainty_score":0.023893178},"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":"software","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009305572,0.0021231922,0.32743853,0.0008257818,0.00080527586,0.00031609883,0.0061459867,0.58495337,0.06808626],"genre_scores_gemma":[0.1509391,0.0025260807,0.41590264,0.0028643878,0.00038293627,0.0008616966,0.045654424,0.17319976,0.20766899],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998447,0.00013207985,0.00012573495,0.00040030913,0.00064158614,0.0002534556],"domain_scores_gemma":[0.99842167,0.00029274408,0.00013883843,0.00059765653,0.0004309733,0.000118018674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009041758,0.001999081,0.0009662915,0.0012685288,0.0007356142,0.002257087,0.003871665,0.0015503464,0.092070855],"category_scores_gemma":[0.0042709084,0.001259726,0.00140713,0.00091217813,0.0006399445,0.004514749,0.0035758042,0.0028594204,0.086137675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010767062,0.0002580242,0.0025043844,0.001189811,0.00015659866,0.00038414038,0.00034371667,0.007540692,0.01908009,0.043712657,0.47460917,0.44914398],"study_design_scores_gemma":[0.00024504756,0.0002201653,0.0015465625,0.00018425891,0.00008344627,0.0009198742,0.00008784438,0.06480827,0.05798774,0.03364249,0.84008735,0.00018698501],"about_ca_topic_score_codex":0.0022210344,"about_ca_topic_score_gemma":0.0027840622,"teacher_disagreement_score":0.092070855,"about_ca_system_score_codex":0.001088287,"about_ca_system_score_gemma":0.0018112133,"threshold_uncertainty_score":0.30800766},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44947046,0.0044547454,0.50748324,0.0014240679,0.0010176913,0.00021812397,0.0009795787,0.013176721,0.021775445],"genre_scores_gemma":[0.88069165,0.0007888601,0.111065835,0.00021043401,0.00019474108,0.00014936927,0.0005639264,0.0003463718,0.005988839],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988794,0.00018684063,0.00010008167,0.000204469,0.0004346222,0.00019466113],"domain_scores_gemma":[0.9945148,0.001784693,0.00023613156,0.0021579778,0.0010809287,0.00022546233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013588216,0.00066887157,0.0005850234,0.0010426303,0.00056963065,0.0019029566,0.0021495197,0.00057035865,0.0070410687],"category_scores_gemma":[0.009530989,0.00048416466,0.00027083527,0.0014395666,0.00086027867,0.0055168006,0.0021871035,0.00074735604,0.0017509176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027266198,0.00041517726,0.0055603636,0.00070796255,0.00012977692,0.0004241693,0.0006663574,0.30512252,0.07804462,0.098739356,0.031526837,0.4759362],"study_design_scores_gemma":[0.0002538356,0.00062405184,0.00092661317,0.00006844081,0.00006693028,0.0002878549,0.00032005296,0.87583077,0.04069316,0.05797785,0.022881249,0.00006911812],"about_ca_topic_score_codex":0.0013428547,"about_ca_topic_score_gemma":0.0013067115,"teacher_disagreement_score":0.0070410687,"about_ca_system_score_codex":0.0010535929,"about_ca_system_score_gemma":0.0009850481,"threshold_uncertainty_score":0.023554742},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012640085,0.00037393716,0.9835181,0.0003015575,0.000040942436,0.00020577147,0.000033614215,0.00094975426,0.0019362185],"genre_scores_gemma":[0.34052876,0.00071779906,0.6555102,0.00036587016,0.00007495976,0.00065009226,0.000105211446,0.00036882816,0.001678293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993533,0.0015690504,0.00057354633,0.00061729137,0.0030685365,0.0006385874],"domain_scores_gemma":[0.9898838,0.0021855452,0.0018102743,0.0035905922,0.0023112316,0.00021854929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051170127,0.00096073217,0.0006430452,0.0013784491,0.0011862094,0.0027844673,0.0027266406,0.0009642738,0.0010035273],"category_scores_gemma":[0.009697988,0.0010140506,0.0008891349,0.0012312814,0.0026353423,0.0042729895,0.002071847,0.0037843678,0.0005093747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021771748,0.00051093515,0.0036551645,0.0013532658,0.00017863697,0.0005377078,0.0011257037,0.19414833,0.20947252,0.4466594,0.0051004356,0.13704017],"study_design_scores_gemma":[0.00017745473,0.0012802157,0.0013950176,0.00037759508,0.0002824757,0.0011769591,0.0005686859,0.5852428,0.24717093,0.10520572,0.056845665,0.00027644628],"about_ca_topic_score_codex":0.0016504115,"about_ca_topic_score_gemma":0.003733412,"teacher_disagreement_score":0.0051170127,"about_ca_system_score_codex":0.0015950461,"about_ca_system_score_gemma":0.0070893997,"threshold_uncertainty_score":0.0270617},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22093996,0.002075976,0.74135846,0.0005309759,0.00023872165,0.00035153498,0.00071664085,0.017541468,0.016246228],"genre_scores_gemma":[0.6355221,0.00056653074,0.35758355,0.00019405455,0.000042598054,0.00029297324,0.00096006313,0.0007323699,0.004105857],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99965215,0.00007232485,0.000022858867,0.00005517707,0.00014930125,0.000048100697],"domain_scores_gemma":[0.99934155,0.00023506337,0.00010589782,0.00014778339,0.00012286694,0.0000468088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053619867,0.00056152715,0.00021860401,0.00040284643,0.00031319188,0.00049016,0.0015023636,0.00034264295,0.0033544034],"category_scores_gemma":[0.0011356971,0.000343604,0.000330284,0.00024004043,0.00039638468,0.000984467,0.00061874965,0.00075029826,0.00042619507],"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.0009080044,0.00056175253,0.0051430645,0.0017377596,0.00022472105,0.00062800123,0.00051808695,0.31928456,0.35711852,0.07682574,0.017823445,0.21922638],"study_design_scores_gemma":[0.0002995147,0.0016164489,0.0018443444,0.00014029555,0.00010771614,0.00028619662,0.0001336324,0.6874559,0.23144008,0.010972591,0.065615885,0.00008748079],"about_ca_topic_score_codex":0.001187815,"about_ca_topic_score_gemma":0.002294269,"teacher_disagreement_score":0.0033544034,"about_ca_system_score_codex":0.0006302137,"about_ca_system_score_gemma":0.00111602,"threshold_uncertainty_score":0.011221588},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02270319,0.00031592618,0.9513531,0.00023435496,0.00017946184,0.00011256716,0.00039044692,0.015612256,0.009098709],"genre_scores_gemma":[0.40519145,0.00024371028,0.5811705,0.0002463076,0.00008580119,0.00023818239,0.0009960249,0.00058038475,0.011247649],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993794,0.000099501034,0.000044026918,0.00012257267,0.0002296198,0.00012482153],"domain_scores_gemma":[0.9990527,0.00012322178,0.00002970044,0.0005110041,0.00021994369,0.00006339285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045682228,0.0005101575,0.0005724936,0.00042170595,0.0005204074,0.0014712785,0.0021119728,0.000500903,0.011114668],"category_scores_gemma":[0.0020297011,0.0004228425,0.00037622234,0.0008833379,0.0004165578,0.0020418707,0.0019103796,0.0008408104,0.0027354236],"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.0013205576,0.00023035092,0.002066528,0.00027515905,0.00009834335,0.00028356802,0.00027285403,0.05899479,0.05891564,0.09750677,0.044470172,0.73556525],"study_design_scores_gemma":[0.00017474586,0.00020104859,0.0006193985,0.000030280562,0.000061448714,0.00023722072,0.000095163465,0.8879387,0.04245214,0.03966772,0.02846661,0.000055486817],"about_ca_topic_score_codex":0.0022408105,"about_ca_topic_score_gemma":0.0048123323,"teacher_disagreement_score":0.011114668,"about_ca_system_score_codex":0.0005190812,"about_ca_system_score_gemma":0.0012566055,"threshold_uncertainty_score":0.037182212},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120155774,0.0001356451,0.8660532,0.00011483628,0.00005269123,0.00014591646,0.00038229296,0.008238672,0.0047209286],"genre_scores_gemma":[0.6091437,0.00012510263,0.38718945,0.00004906168,0.000010789329,0.00025206496,0.00080681255,0.0009959998,0.001426929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992931,0.00017645895,0.000058166403,0.00013393177,0.00025818878,0.000080267564],"domain_scores_gemma":[0.99817777,0.001018563,0.00014891877,0.00032962786,0.00028475677,0.00004031633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071111106,0.000762546,0.00043164138,0.0004047455,0.00036699133,0.0006485794,0.0008995973,0.00044080222,0.0017874304],"category_scores_gemma":[0.0028288432,0.000518236,0.00061152526,0.0002819569,0.00070786057,0.0006653306,0.00065021426,0.00071851985,0.0003931494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020095582,0.00014185239,0.001984426,0.000476394,0.00007807021,0.0002726496,0.00025325644,0.76710474,0.11226673,0.026051192,0.0019762325,0.08919355],"study_design_scores_gemma":[0.00006136728,0.00010968222,0.00023106296,0.000017222448,0.000029249695,0.000047100733,0.000036598158,0.90603614,0.08474077,0.0053435,0.0033317965,0.000015480222],"about_ca_topic_score_codex":0.0016206106,"about_ca_topic_score_gemma":0.0025109306,"teacher_disagreement_score":0.0017874304,"about_ca_system_score_codex":0.0006382707,"about_ca_system_score_gemma":0.0017686322,"threshold_uncertainty_score":0.005979538},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1662615,0.0003867646,0.75180095,0.00036186932,0.00042174518,0.00018239835,0.0006722291,0.07346155,0.006450892],"genre_scores_gemma":[0.77739596,0.000104034596,0.21224217,0.00023178957,0.00009965514,0.000081011254,0.00058460253,0.0033222754,0.005938562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992467,0.00012783775,0.00006470172,0.00015751629,0.00022290624,0.00018045766],"domain_scores_gemma":[0.99841523,0.0003737216,0.00012319037,0.0006074578,0.0002965632,0.00018380063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013184355,0.0010815962,0.00046736523,0.00057802116,0.0006205905,0.0010988222,0.0025014658,0.00044271068,0.006378688],"category_scores_gemma":[0.0032932628,0.00045711195,0.00036166812,0.00058300584,0.0005777128,0.0012243848,0.0011661107,0.0012195342,0.0012804802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006876756,0.0011695575,0.01327839,0.0004980738,0.00023725259,0.00026961372,0.00043468093,0.14921506,0.1317671,0.024043601,0.053125303,0.61908466],"study_design_scores_gemma":[0.00035034076,0.00043016998,0.0016800481,0.000016453609,0.00009009237,0.00006929144,0.00005127579,0.9064914,0.07298411,0.0069273408,0.010858146,0.000051279167],"about_ca_topic_score_codex":0.0055413386,"about_ca_topic_score_gemma":0.010840735,"teacher_disagreement_score":0.006378688,"about_ca_system_score_codex":0.0009926684,"about_ca_system_score_gemma":0.002202545,"threshold_uncertainty_score":0.02133882},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082634926,0.0008180001,0.880229,0.00314207,0.0002088942,0.00024826892,0.0004316033,0.0020270785,0.030260142],"genre_scores_gemma":[0.6828341,0.0015788693,0.2971694,0.0012133014,0.00062185875,0.00044013324,0.0009028365,0.00065434043,0.014585091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980531,0.00027357932,0.000088076085,0.0003239933,0.00086849765,0.00039275864],"domain_scores_gemma":[0.99533325,0.0028023699,0.00018819723,0.001177296,0.0002806937,0.00021811949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017297248,0.0010731274,0.0009143693,0.0013237863,0.0011148608,0.002451984,0.0020386726,0.0011582893,0.009240453],"category_scores_gemma":[0.008488084,0.00074442365,0.00328023,0.0017543848,0.0026428,0.0060423105,0.005830031,0.0070296833,0.0014883397],"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.00022744524,0.00013878425,0.0011331411,0.00038704224,0.0000300828,0.00025354337,0.0005230103,0.052069888,0.014289516,0.8264938,0.0048213038,0.09963244],"study_design_scores_gemma":[0.000041623713,0.000074512966,0.00051679206,0.000065870125,0.000040599018,0.00021044935,0.00007396356,0.17592858,0.010694851,0.8020612,0.010259883,0.000031734155],"about_ca_topic_score_codex":0.0030678704,"about_ca_topic_score_gemma":0.001820898,"teacher_disagreement_score":0.009240453,"about_ca_system_score_codex":0.0039684004,"about_ca_system_score_gemma":0.0016556911,"threshold_uncertainty_score":0.0309124},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027199082,0.00013631226,0.9439348,0.0003615729,0.00023701314,0.00023110647,0.0005934071,0.017245779,0.010060891],"genre_scores_gemma":[0.19475845,0.00025902042,0.7812925,0.00037106642,0.00009309043,0.0005547666,0.0022861883,0.009872741,0.010512129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991592,0.00014061217,0.000075529315,0.00013941337,0.0003882219,0.00009701975],"domain_scores_gemma":[0.99643147,0.001568405,0.00023470655,0.0009987056,0.0006487982,0.000117855336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013434029,0.00087700225,0.00055701693,0.00081511075,0.0008051121,0.0015996111,0.0020256417,0.0011792397,0.00878676],"category_scores_gemma":[0.0057112635,0.00062306103,0.001601954,0.0011547579,0.0015509673,0.0021869089,0.002032803,0.0017607673,0.003918386],"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.0007333723,0.00050428364,0.010064037,0.0014844871,0.00024157645,0.0012857802,0.0012655498,0.22825919,0.05790094,0.31793827,0.071684405,0.30863807],"study_design_scores_gemma":[0.00023756067,0.00012904413,0.00074770424,0.00012473128,0.00006416674,0.00037883062,0.00020607786,0.73128957,0.06864919,0.1375005,0.060591042,0.00008162045],"about_ca_topic_score_codex":0.0011060217,"about_ca_topic_score_gemma":0.001995136,"teacher_disagreement_score":0.00878676,"about_ca_system_score_codex":0.00091680634,"about_ca_system_score_gemma":0.0013053997,"threshold_uncertainty_score":0.029394686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024414292,0.000119826414,0.97298807,0.000077448574,0.00003667886,0.000038928218,0.000053334352,0.0010028036,0.0012685806],"genre_scores_gemma":[0.38169673,0.00016376442,0.61406046,0.00009666681,0.000034207147,0.00021127347,0.00031935572,0.00032037933,0.0030971416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996087,0.00006975804,0.000025737054,0.00005339559,0.0001830702,0.00005944825],"domain_scores_gemma":[0.99898094,0.00038609884,0.000071598006,0.00020967622,0.0003052249,0.000046486697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005639948,0.0005060534,0.0007647539,0.00062496593,0.0005158748,0.0007723362,0.0014680176,0.0006989784,0.0027654043],"category_scores_gemma":[0.0022881853,0.00037012433,0.0005051909,0.00076432363,0.00035418337,0.0012740253,0.00047869273,0.0007274848,0.00055798935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023328926,0.00008802905,0.0021315785,0.000064899206,0.00005655128,0.00007943371,0.00009527883,0.8761341,0.014365287,0.017917052,0.0021585878,0.08667597],"study_design_scores_gemma":[0.000007313265,0.000009601654,0.000051834024,0.0000014962254,0.0000032625142,0.0000053191798,0.0000021087005,0.9968791,0.0016673513,0.000954652,0.0004155455,0.0000024657672],"about_ca_topic_score_codex":0.008697946,"about_ca_topic_score_gemma":0.0057706637,"teacher_disagreement_score":0.008697946,"about_ca_system_score_codex":0.0007712179,"about_ca_system_score_gemma":0.0012577693,"threshold_uncertainty_score":0.017294645},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36036474,0.010182234,0.28530952,0.0018779441,0.0018165164,0.0047666794,0.16953865,0.10906033,0.057083346],"genre_scores_gemma":[0.3494447,0.0039048973,0.43157253,0.000993512,0.00026871273,0.0072353925,0.18978502,0.00683468,0.009960532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.994221,0.0014755256,0.00085389044,0.0006216817,0.0023075633,0.0005203081],"domain_scores_gemma":[0.9926367,0.0029573007,0.00096448755,0.0014599498,0.0016352945,0.00034619696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004601237,0.0036005464,0.0010629841,0.0076795546,0.0008179866,0.0017248876,0.0048297355,0.0013322611,0.0033223268],"category_scores_gemma":[0.011145023,0.0007983578,0.0017313327,0.0072378297,0.0010949585,0.0022058003,0.0024854348,0.0021442366,0.0009254978],"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.0013700871,0.0020566806,0.041622344,0.0072522475,0.0016840616,0.0005945964,0.00044964298,0.31354135,0.022043573,0.030373465,0.3070462,0.27196577],"study_design_scores_gemma":[0.00080916943,0.0018777903,0.01765496,0.00046621024,0.0003913731,0.00057393423,0.00035726564,0.7483228,0.028731577,0.017699298,0.18289463,0.00022094474],"about_ca_topic_score_codex":0.011589926,"about_ca_topic_score_gemma":0.015284249,"teacher_disagreement_score":0.011589926,"about_ca_system_score_codex":0.0017078926,"about_ca_system_score_gemma":0.0038686944,"threshold_uncertainty_score":0.024333954},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8753319,0.002524362,0.03826856,0.0008910766,0.00079960993,0.00006157066,0.004330048,0.020394037,0.057398945],"genre_scores_gemma":[0.967567,0.00027047927,0.015538957,0.0002185863,0.00006392385,0.0000323988,0.0048588007,0.0027605756,0.008689262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978538,0.00037288878,0.00014714587,0.00027184683,0.0008159174,0.00053840206],"domain_scores_gemma":[0.99597436,0.0012787916,0.0002118802,0.00122019,0.001101006,0.00021378855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013894883,0.0007916722,0.0004435143,0.001134805,0.0010228144,0.0016763764,0.0010684788,0.00058417284,0.00925028],"category_scores_gemma":[0.008195631,0.0006192473,0.0005166565,0.0017423151,0.0006408835,0.0019915523,0.0010989995,0.0011944438,0.001313159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0062961187,0.00091003807,0.029958064,0.00086869404,0.00021685852,0.0009523438,0.0014306317,0.12238404,0.04401168,0.15969905,0.20034844,0.4329241],"study_design_scores_gemma":[0.000498007,0.0009849233,0.016782383,0.00031276612,0.0002590637,0.0005926897,0.00062364317,0.5580429,0.12537308,0.12545559,0.17089182,0.00018323782],"about_ca_topic_score_codex":0.008356094,"about_ca_topic_score_gemma":0.012252713,"teacher_disagreement_score":0.00925028,"about_ca_system_score_codex":0.0012432495,"about_ca_system_score_gemma":0.0031504282,"threshold_uncertainty_score":0.030945301},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23322722,0.0013841745,0.70147264,0.0006542207,0.00046678324,0.0007191227,0.0024699287,0.019106535,0.04049938],"genre_scores_gemma":[0.57940155,0.0007101572,0.39217767,0.0003972501,0.00013723766,0.00051779277,0.0053507998,0.001092678,0.02021479],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994578,0.00003798096,0.000037574715,0.00007619267,0.00032873495,0.00006183118],"domain_scores_gemma":[0.9988852,0.000304201,0.000093632836,0.00032208842,0.0003673927,0.000027593185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035836385,0.0006623227,0.00038945087,0.0011536755,0.00048025328,0.00084172713,0.00096423517,0.0005316594,0.005366927],"category_scores_gemma":[0.0024102072,0.00019293003,0.00030763922,0.0012504136,0.00044026304,0.0010314526,0.0005818606,0.00048270248,0.0015703944],"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.00066924357,0.00020984726,0.0042800168,0.00025883928,0.000052134234,0.00031096028,0.000225701,0.03696732,0.07645572,0.029373793,0.026363676,0.82483286],"study_design_scores_gemma":[0.00009621686,0.00055212417,0.004224969,0.00008627958,0.000044285105,0.0011218888,0.0002163382,0.5460628,0.37065467,0.018033335,0.058841903,0.00006512817],"about_ca_topic_score_codex":0.0015742157,"about_ca_topic_score_gemma":0.0026323511,"teacher_disagreement_score":0.005366927,"about_ca_system_score_codex":0.0005394737,"about_ca_system_score_gemma":0.0008368981,"threshold_uncertainty_score":0.017954111},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004334983,0.00018876686,0.9650294,0.00035288496,0.00011402488,0.00019829081,0.0017345488,0.008359971,0.019687008],"genre_scores_gemma":[0.14505973,0.000776106,0.8141163,0.0006492944,0.00017957564,0.0006348841,0.006743676,0.0051380587,0.026702488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979321,0.00048643758,0.00023402751,0.00043371072,0.0007171432,0.0001967001],"domain_scores_gemma":[0.9971609,0.0014991714,0.00014275442,0.00060931355,0.00050048257,0.00008736945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022828325,0.0013571946,0.0006176832,0.000894827,0.0012738828,0.0034560764,0.0027295905,0.0013805979,0.015618264],"category_scores_gemma":[0.0056534368,0.0012356873,0.001990795,0.0008468776,0.0019465717,0.0048135817,0.002785936,0.0024335193,0.004533583],"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.00018158309,0.000119951816,0.0015049311,0.0007191147,0.00006718883,0.0006288563,0.0014947976,0.08286758,0.0071795285,0.75773984,0.026548315,0.1209483],"study_design_scores_gemma":[0.00008597313,0.0000903772,0.0002699676,0.0002040716,0.00006693921,0.00049696513,0.00027179995,0.21077915,0.01502235,0.5026193,0.2700246,0.00006850834],"about_ca_topic_score_codex":0.004966645,"about_ca_topic_score_gemma":0.008042252,"teacher_disagreement_score":0.015618264,"about_ca_system_score_codex":0.0014365229,"about_ca_system_score_gemma":0.0020664681,"threshold_uncertainty_score":0.0522483},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023468696,0.00035880334,0.6542857,0.0018267428,0.0009291344,0.00031873287,0.010392082,0.26817787,0.061364003],"genre_scores_gemma":[0.065430135,0.001071293,0.61544865,0.0049705547,0.0010397013,0.00255371,0.0376011,0.14051768,0.13136707],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99766845,0.00053617934,0.00038830907,0.0006128057,0.000539376,0.000254859],"domain_scores_gemma":[0.9931942,0.0027028276,0.0004177595,0.0017033033,0.0016678338,0.0003140109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029228772,0.0016057893,0.0008898019,0.0011340237,0.0013650819,0.0063393153,0.0044518886,0.001980041,0.1096131],"category_scores_gemma":[0.012326575,0.0015806902,0.0024153672,0.0008353525,0.0019463606,0.0073284823,0.0058795945,0.0052108658,0.114109285],"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.0005852754,0.00013390362,0.0013595374,0.001650757,0.00006786598,0.0005452678,0.0017631815,0.0029976147,0.011890569,0.3555752,0.44435886,0.17907204],"study_design_scores_gemma":[0.000081024446,0.00009070518,0.00028436736,0.0004154186,0.00003222727,0.00052659796,0.00017799008,0.011492101,0.011910033,0.07056312,0.9043209,0.00010546639],"about_ca_topic_score_codex":0.0015959456,"about_ca_topic_score_gemma":0.0016409251,"teacher_disagreement_score":0.1096131,"about_ca_system_score_codex":0.0012276776,"about_ca_system_score_gemma":0.0028161337,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023786195,0.00018188143,0.897285,0.0004561184,0.00016445116,0.00017008792,0.00037871447,0.056685258,0.0208923],"genre_scores_gemma":[0.29968303,0.00021297894,0.6642581,0.0011068233,0.00013647431,0.00037739592,0.0014832976,0.014412047,0.018329905],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99916136,0.000118655815,0.00005119155,0.00015910719,0.0003752907,0.0001343826],"domain_scores_gemma":[0.998665,0.00026190944,0.00009861568,0.00061064126,0.0003045156,0.000059324084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010470703,0.00078013365,0.0003611627,0.00069675804,0.00044001697,0.0015875235,0.0023609328,0.00053120835,0.0112380525],"category_scores_gemma":[0.0032252485,0.0005277095,0.0007033552,0.00054776116,0.0012216647,0.002187832,0.002345174,0.0023775944,0.004160104],"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.001400848,0.00031588762,0.0064806626,0.0007157415,0.000118527125,0.00081494515,0.0011183169,0.05593987,0.101262346,0.19847174,0.09296223,0.54039896],"study_design_scores_gemma":[0.00024566767,0.0004548831,0.0009989379,0.00013965009,0.000057246838,0.0007428812,0.00015848337,0.60369885,0.145176,0.08901377,0.15920968,0.000104037164],"about_ca_topic_score_codex":0.0012151767,"about_ca_topic_score_gemma":0.002412903,"teacher_disagreement_score":0.0112380525,"about_ca_system_score_codex":0.0008797915,"about_ca_system_score_gemma":0.0013824169,"threshold_uncertainty_score":0.037594974},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13453719,0.00058814225,0.8288645,0.00070638786,0.00025562418,0.00018389545,0.00029471898,0.02262893,0.011940583],"genre_scores_gemma":[0.69264984,0.00026571305,0.29204574,0.00040635528,0.00010508318,0.00036744188,0.001387415,0.0011649771,0.011607419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940574,0.00010006024,0.000029486499,0.00012652141,0.0002496386,0.00008861338],"domain_scores_gemma":[0.9992774,0.00014104639,0.000050489,0.0002535631,0.00019659671,0.00008093474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007112449,0.00061675784,0.0005306299,0.00053477543,0.0011834635,0.0010212269,0.002377315,0.0005251279,0.003108203],"category_scores_gemma":[0.0015964714,0.0003761212,0.00047248835,0.0007323037,0.00080062886,0.002299421,0.0021984805,0.0012913168,0.001131482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011012579,0.00088235625,0.0074610338,0.0004565717,0.00022480973,0.00041385723,0.0015254447,0.28442186,0.09722936,0.037965905,0.07219831,0.49611917],"study_design_scores_gemma":[0.00006465831,0.0001858289,0.0008029505,0.000012787135,0.000025526644,0.00006202534,0.0001741956,0.93038034,0.041046306,0.011990924,0.015215912,0.000038489354],"about_ca_topic_score_codex":0.0051412545,"about_ca_topic_score_gemma":0.011244333,"teacher_disagreement_score":0.0051412545,"about_ca_system_score_codex":0.0013147183,"about_ca_system_score_gemma":0.0020489837,"threshold_uncertainty_score":0.010397971},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094236374,0.00053605804,0.70728403,0.00038358525,0.00029696853,0.0006660803,0.0023528503,0.1631445,0.03109954],"genre_scores_gemma":[0.34015334,0.0002004246,0.58539325,0.00050682406,0.00005418547,0.000752053,0.0047719567,0.023099719,0.04506823],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992993,0.00010347575,0.000081882135,0.00017465571,0.00021567884,0.00012501811],"domain_scores_gemma":[0.99916446,0.00017049637,0.00010080606,0.00038575972,0.0001116378,0.00006691695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078967254,0.0006776413,0.00058896374,0.0005136066,0.0004466216,0.0013058368,0.002145197,0.0008138306,0.025395034],"category_scores_gemma":[0.001949353,0.0008741615,0.0005909196,0.0005054262,0.0009667184,0.003077455,0.0020428891,0.0011105817,0.011762208],"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.006727661,0.00061447755,0.006978822,0.0021325266,0.00018466359,0.0009782086,0.0016478959,0.038635373,0.28851685,0.12061457,0.073237024,0.45973188],"study_design_scores_gemma":[0.0009260199,0.0011159109,0.004251084,0.00028267285,0.00014896481,0.00123232,0.00031824745,0.16846901,0.31776872,0.029371502,0.47580203,0.0003134261],"about_ca_topic_score_codex":0.0007870702,"about_ca_topic_score_gemma":0.0011074112,"teacher_disagreement_score":0.025395034,"about_ca_system_score_codex":0.0007509234,"about_ca_system_score_gemma":0.0011355192,"threshold_uncertainty_score":0.08495486},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008049441,0.0031139327,0.83038294,0.034929764,0.0015062195,0.000055053122,0.000048061986,0.00052596047,0.121388584],"genre_scores_gemma":[0.6022151,0.0038602198,0.347478,0.010672308,0.0017319858,0.00032764787,0.00006581244,0.0008278337,0.032821074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99057007,0.006400155,0.00029360616,0.0008365171,0.0014857281,0.00041392632],"domain_scores_gemma":[0.9890321,0.008425463,0.0003935071,0.0012432095,0.0006009507,0.000304738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008327674,0.0010438662,0.0007708311,0.0012782685,0.0026269022,0.0074178115,0.0028853444,0.003779749,0.005517206],"category_scores_gemma":[0.013064291,0.0006777924,0.00092459214,0.0009003528,0.03639371,0.014546197,0.0051307436,0.011698693,0.0012704815],"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.000005230368,0.000005572622,0.00005773927,0.0000254595,0.0000018693434,0.000025110532,0.00082107895,0.0005036505,0.00011245413,0.99313724,0.0007909609,0.00451362],"study_design_scores_gemma":[0.0000069378057,0.000016557695,0.00004054611,0.00006918932,0.000003790949,0.000065431275,0.00042120012,0.0027696232,0.0004550519,0.9547573,0.04138347,0.00001100804],"about_ca_topic_score_codex":0.0023586708,"about_ca_topic_score_gemma":0.0023264992,"teacher_disagreement_score":0.008327674,"about_ca_system_score_codex":0.0034967745,"about_ca_system_score_gemma":0.0027407373,"threshold_uncertainty_score":0.044041514},"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":"software","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07084852,0.004014397,0.3560409,0.0013439924,0.0016764974,0.00039850525,0.005638964,0.46496025,0.09507804],"genre_scores_gemma":[0.6140717,0.0032359562,0.2586956,0.0016140089,0.001425231,0.0005310284,0.008448419,0.023825202,0.08815282],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99869305,0.00009722442,0.000088032684,0.00019329006,0.000765305,0.00016316364],"domain_scores_gemma":[0.9967715,0.00032185283,0.00026411726,0.0015855008,0.00078759826,0.00026934652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080156635,0.00066889677,0.0007716403,0.00084345206,0.0007669064,0.0026947882,0.0021478944,0.00057357916,0.0161589],"category_scores_gemma":[0.004968526,0.00060985546,0.0005627815,0.0008311689,0.000779694,0.0038741098,0.0027207562,0.001804406,0.008046574],"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.002276867,0.00022356301,0.0054320614,0.0007112763,0.00020674091,0.0002734383,0.0004294195,0.00526513,0.030362345,0.039580565,0.40238094,0.51285756],"study_design_scores_gemma":[0.0005382948,0.00064444926,0.0060102087,0.00020989995,0.00029220938,0.0016631578,0.00019815529,0.09172817,0.058585297,0.035575967,0.80423343,0.00032075177],"about_ca_topic_score_codex":0.002824506,"about_ca_topic_score_gemma":0.003012952,"teacher_disagreement_score":0.0161589,"about_ca_system_score_codex":0.00053062785,"about_ca_system_score_gemma":0.0018382565,"threshold_uncertainty_score":0.054056942},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082553096,0.0004774126,0.83646744,0.00026104864,0.0003468737,0.0001326279,0.0003881668,0.06522763,0.014145735],"genre_scores_gemma":[0.8055361,0.00022817867,0.17842086,0.0003099311,0.00019349287,0.0001861866,0.00080909487,0.0040497147,0.01026645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996451,0.000035718705,0.000019734736,0.00007693,0.00016469229,0.000057754456],"domain_scores_gemma":[0.99945146,0.00015186623,0.00006138701,0.00018144073,0.00009974288,0.00005420786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041739515,0.0006423839,0.00033188084,0.0003359319,0.00032306853,0.00075057533,0.0010444536,0.00027328904,0.0066289944],"category_scores_gemma":[0.0012733969,0.0002910863,0.0003218858,0.00026356705,0.00053765264,0.0007235183,0.00088197034,0.0008525403,0.0014619847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021956128,0.00034272834,0.0062931916,0.0004822544,0.00014795714,0.0005641933,0.0004979017,0.16386482,0.21050411,0.037593298,0.057361633,0.52015233],"study_design_scores_gemma":[0.00018070989,0.00025848814,0.0012833194,0.000029551973,0.000028153467,0.00013188717,0.000034228266,0.89798784,0.06996846,0.008286844,0.021762006,0.000048500395],"about_ca_topic_score_codex":0.0012332457,"about_ca_topic_score_gemma":0.0024582807,"teacher_disagreement_score":0.0066289944,"about_ca_system_score_codex":0.00036017763,"about_ca_system_score_gemma":0.00060496875,"threshold_uncertainty_score":0.022176206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026708157,0.0009815188,0.0012144459,0.00025448133,0.00008321772,0.00010496976,0.98431844,0.0076077236,0.0027643812],"genre_scores_gemma":[0.0031327284,0.00024043879,0.0022346533,0.00009488255,0.00001125193,0.00020470996,0.99298954,0.0003916375,0.00070003356],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984267,0.00022412895,0.00019670864,0.00037036638,0.00061030523,0.00017173587],"domain_scores_gemma":[0.9964747,0.0015630742,0.00028457225,0.0007527823,0.0007638177,0.0001609739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010905275,0.004133876,0.0014636312,0.0032160152,0.0008316122,0.0018825575,0.00457692,0.0031669377,0.028590795],"category_scores_gemma":[0.00811071,0.00086604495,0.0019086393,0.003989416,0.00063348276,0.0011710648,0.0018904076,0.0018519997,0.03196551],"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.00056388834,0.00016788911,0.00221767,0.004546963,0.00020947188,0.00017892798,0.000046500612,0.008288876,0.0013881691,0.0011561988,0.95919245,0.022042893],"study_design_scores_gemma":[0.0033254293,0.00037927716,0.008108847,0.0011149277,0.0002757598,0.0003868747,0.00009590278,0.032555502,0.008579954,0.0075030844,0.9375432,0.00013127209],"about_ca_topic_score_codex":0.013395068,"about_ca_topic_score_gemma":0.033029698,"teacher_disagreement_score":0.028590795,"about_ca_system_score_codex":0.0015837952,"about_ca_system_score_gemma":0.0024372032,"threshold_uncertainty_score":0.095645726},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078725584,0.0001554637,0.90715104,0.00012982098,0.000060383936,0.00033073948,0.00041295125,0.010404207,0.002629783],"genre_scores_gemma":[0.3714195,0.00016866188,0.62319446,0.00007856172,0.00001741342,0.00054151757,0.0014841361,0.0014013846,0.001694412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980457,0.00044678943,0.0001974365,0.0003112048,0.00081420626,0.00018482817],"domain_scores_gemma":[0.9959508,0.0021019876,0.0004430643,0.00061646727,0.00080518244,0.00008241852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017413642,0.00096493226,0.00047296015,0.0006489018,0.00049789547,0.0009710083,0.0013534487,0.00071268977,0.0016298278],"category_scores_gemma":[0.0057342607,0.00082782627,0.0010245513,0.0003740769,0.0010501466,0.0011522225,0.0010817642,0.00113816,0.0004520889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037685054,0.00031882897,0.005806805,0.0012170442,0.00017652962,0.00077210856,0.0007139591,0.62369835,0.1733918,0.05580975,0.0047538728,0.13296415],"study_design_scores_gemma":[0.000089080575,0.00017516792,0.00040288334,0.00004516852,0.00005391856,0.000104411374,0.0000827673,0.87247807,0.11073031,0.008500534,0.0073053148,0.000032297543],"about_ca_topic_score_codex":0.0017017939,"about_ca_topic_score_gemma":0.0027669286,"teacher_disagreement_score":0.0017413642,"about_ca_system_score_codex":0.00096030894,"about_ca_system_score_gemma":0.0028301212,"threshold_uncertainty_score":0.009209335},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016940668,0.0004784368,0.0673773,0.002064035,0.0050108843,0.00036016846,0.0778063,0.7239696,0.12123921],"genre_scores_gemma":[0.020353997,0.0006159592,0.028056202,0.0015048363,0.0017138877,0.0005982061,0.13355957,0.65049803,0.16309927],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99775094,0.0002232884,0.00017216321,0.00046113774,0.00093482196,0.0004576685],"domain_scores_gemma":[0.98993623,0.0013486112,0.00029124322,0.004442596,0.0031872499,0.0007941387],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0019540715,0.0035421955,0.0020037708,0.0019226181,0.0014725948,0.007573344,0.004657718,0.0027502705,0.548168],"category_scores_gemma":[0.017764175,0.0031654658,0.0023901341,0.002038558,0.0010553297,0.0069657383,0.006048313,0.0045238296,0.70391214],"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.0002762443,0.000036019614,0.00023849064,0.00020868922,0.00004148561,0.00006243535,0.00004164131,0.0003872817,0.0017899844,0.0017130304,0.97248346,0.022721382],"study_design_scores_gemma":[0.0002791507,0.00006102386,0.00112844,0.00016250946,0.00004376044,0.00023938516,0.000062133164,0.0036651772,0.018477254,0.011314335,0.9643954,0.00017136548],"about_ca_topic_score_codex":0.002666234,"about_ca_topic_score_gemma":0.0022494348,"teacher_disagreement_score":0.451832,"about_ca_system_score_codex":0.0011234189,"about_ca_system_score_gemma":0.0019647859,"threshold_uncertainty_score":0.64448345},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062378766,0.00009530076,0.98779154,0.0003507486,0.000019598141,0.000060100672,0.000011127319,0.00016432734,0.005269517],"genre_scores_gemma":[0.28289345,0.00047248052,0.7110183,0.00028515657,0.000041412222,0.0003121709,0.00006756245,0.00023768828,0.0046717175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995067,0.00019679434,0.000018704508,0.000104336425,0.00012358253,0.00004987541],"domain_scores_gemma":[0.9994337,0.00031037172,0.000045858575,0.000107341024,0.00006551326,0.000037127702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008764225,0.00073212304,0.00046253836,0.0005686328,0.00068057864,0.0010764987,0.0014062653,0.0005754256,0.0029755575],"category_scores_gemma":[0.0018526422,0.0002656798,0.00072354,0.00054760085,0.0013852075,0.0023018136,0.0011221007,0.0010781336,0.00043043192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004020416,0.00007262337,0.00024283884,0.00012086414,0.000026485914,0.00012902192,0.0002199019,0.27671966,0.0064697186,0.6663915,0.0018236658,0.047743537],"study_design_scores_gemma":[0.00001980324,0.000036584745,0.00005190817,0.000017205302,0.000014327392,0.000049846436,0.00007437147,0.62445116,0.0027126893,0.36633906,0.006220397,0.000012660095],"about_ca_topic_score_codex":0.0013597071,"about_ca_topic_score_gemma":0.0019509706,"teacher_disagreement_score":0.0029755575,"about_ca_system_score_codex":0.0009342813,"about_ca_system_score_gemma":0.0010618789,"threshold_uncertainty_score":0.009954214},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13080283,0.0006748975,0.8527272,0.00027202093,0.000069765876,0.00019568768,0.00028158718,0.008192306,0.006783782],"genre_scores_gemma":[0.6920181,0.00029448583,0.30445018,0.0001608617,0.00003171212,0.00020982182,0.0004553977,0.000551562,0.0018279278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887043,0.0003014521,0.000056224457,0.00013560752,0.00047086127,0.00016551578],"domain_scores_gemma":[0.99828666,0.0008567056,0.00019636302,0.00037216253,0.00024972507,0.00003839513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062865636,0.0010364471,0.0005253832,0.0011133394,0.00040397784,0.000711727,0.0009425028,0.0004203041,0.0017715818],"category_scores_gemma":[0.0025787826,0.0003611334,0.00049097906,0.00076725835,0.00060191535,0.0007603253,0.0004837658,0.00072699867,0.0005668433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033094626,0.00026454678,0.003163278,0.0003613373,0.000050075705,0.00015165558,0.00014075614,0.5466578,0.18672876,0.0125027625,0.0033465405,0.24630146],"study_design_scores_gemma":[0.000042255124,0.0002108523,0.0011828302,0.000024363995,0.000041938005,0.00007206061,0.00003274241,0.8727065,0.11387483,0.0072486433,0.00453758,0.000025512363],"about_ca_topic_score_codex":0.0032724366,"about_ca_topic_score_gemma":0.0043076854,"teacher_disagreement_score":0.0032724366,"about_ca_system_score_codex":0.0010455796,"about_ca_system_score_gemma":0.0015270901,"threshold_uncertainty_score":0.0075863004},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0154369995,0.00012338167,0.97692364,0.00008986187,0.00003679387,0.000069491936,0.00015430125,0.004255633,0.0029098133],"genre_scores_gemma":[0.19068663,0.00018927122,0.80074805,0.00012320507,0.000034392608,0.00021481587,0.0009979086,0.0016455691,0.005360067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995828,0.00006840539,0.000031613246,0.000056978348,0.0002042348,0.000056012923],"domain_scores_gemma":[0.99912566,0.0002684609,0.000074577474,0.00019169538,0.000297706,0.00004182847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004240244,0.00082609744,0.00044676618,0.0006649988,0.00035599206,0.00087279244,0.0011659474,0.00048743063,0.005907075],"category_scores_gemma":[0.0023247434,0.00031705233,0.00062875735,0.0006727406,0.0006621785,0.0009971287,0.0010116479,0.001039724,0.0025227868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003011908,0.00015643942,0.0032285505,0.0003842925,0.00005426087,0.00024946698,0.00036164996,0.37657395,0.057684116,0.0757279,0.01930869,0.46596953],"study_design_scores_gemma":[0.000023871924,0.000039739003,0.00014376115,0.000010654835,0.0000054213615,0.000054661825,0.000024945422,0.969414,0.016038693,0.008339827,0.00589439,0.0000099840745],"about_ca_topic_score_codex":0.002423542,"about_ca_topic_score_gemma":0.0035524014,"teacher_disagreement_score":0.005907075,"about_ca_system_score_codex":0.0005960319,"about_ca_system_score_gemma":0.0010197345,"threshold_uncertainty_score":0.019761205},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006501793,0.00022951257,0.045198604,0.0010775515,0.0013871477,0.0002200169,0.020105239,0.8059587,0.12517315],"genre_scores_gemma":[0.0056813215,0.0002467703,0.024544891,0.0015352324,0.0003193244,0.00028885223,0.03759801,0.740537,0.18924864],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979247,0.00017199757,0.00012919448,0.00044104017,0.0010108826,0.00032208054],"domain_scores_gemma":[0.9932862,0.000749757,0.00018958433,0.0020801155,0.0027913495,0.0009030075],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020002383,0.0028135933,0.0013287346,0.0019039551,0.0011831439,0.0061809192,0.0054040286,0.002485398,0.7482574],"category_scores_gemma":[0.013039617,0.0024427255,0.0023955044,0.0016254847,0.0008476332,0.008697334,0.0065412507,0.004200572,0.74729025],"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.0001083727,0.000025232213,0.00017337936,0.00018109886,0.000008999509,0.00004449762,0.0000454124,0.00019461021,0.0013306413,0.0015735094,0.9623145,0.033999693],"study_design_scores_gemma":[0.00006523842,0.00002799746,0.00059293944,0.00011574671,0.000012322836,0.00015201361,0.000027236509,0.000908707,0.003902168,0.0020590315,0.99207014,0.000066413],"about_ca_topic_score_codex":0.0046310984,"about_ca_topic_score_gemma":0.004177016,"teacher_disagreement_score":0.7482574,"about_ca_system_score_codex":0.0016231633,"about_ca_system_score_gemma":0.0017600071,"threshold_uncertainty_score":0.35908026},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04964599,0.00006546016,0.94063663,0.000524781,0.00006984766,0.00030646543,0.00030507677,0.002846294,0.0055993726],"genre_scores_gemma":[0.74157864,0.00012659049,0.2521249,0.00023147966,0.000043261294,0.00090064894,0.0005198916,0.00034438816,0.0041302247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949197,0.0015753161,0.00032036126,0.0004913059,0.0019815918,0.0007116546],"domain_scores_gemma":[0.99215394,0.0038179704,0.0006087746,0.0014132616,0.001856794,0.00014932362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004091764,0.0006222631,0.0008268921,0.0008996286,0.0011664778,0.00294725,0.0021127698,0.0016917846,0.0037303641],"category_scores_gemma":[0.0114406925,0.0006567646,0.0012851995,0.00075129204,0.004465528,0.0030758593,0.0017273427,0.0023327984,0.00047130353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023510479,0.0001625969,0.0017769166,0.0002854987,0.00007130032,0.0005885363,0.0007491721,0.21836187,0.021532955,0.7381313,0.0026606396,0.015444127],"study_design_scores_gemma":[0.0001918412,0.00014324665,0.0004217065,0.00008787094,0.00006230852,0.00011706659,0.0001384631,0.858518,0.038421832,0.09257741,0.009255203,0.0000649483],"about_ca_topic_score_codex":0.045825433,"about_ca_topic_score_gemma":0.033404887,"teacher_disagreement_score":0.045825433,"about_ca_system_score_codex":0.0034449121,"about_ca_system_score_gemma":0.009743163,"threshold_uncertainty_score":0.09111738},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043391227,0.00026161646,0.99138135,0.00007882977,0.000046614095,0.000039272734,0.000037059202,0.00051404745,0.0033019623],"genre_scores_gemma":[0.22921059,0.00039964943,0.76206386,0.00018799356,0.0000951502,0.00015240686,0.00023818275,0.000420671,0.007231507],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99950826,0.00011081582,0.00002759126,0.00010333702,0.0001927067,0.00005725194],"domain_scores_gemma":[0.999488,0.00011615133,0.000078292396,0.00017399687,0.00012533482,0.000018244047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046258216,0.00049096195,0.0003506762,0.0004146237,0.00037702927,0.00078593474,0.00087886065,0.00034911095,0.006761177],"category_scores_gemma":[0.0015306371,0.00023948698,0.00038817397,0.0006439651,0.00038686802,0.0011625224,0.00066552183,0.0009277588,0.0019205523],"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.0002109783,0.00011228036,0.0011119992,0.00062502257,0.00006516242,0.00011085336,0.00019478261,0.105021454,0.12493321,0.23796864,0.0098805865,0.519765],"study_design_scores_gemma":[0.00011543297,0.0004492012,0.00084874936,0.00008612441,0.000109863446,0.00039989455,0.00007163447,0.64550185,0.15035337,0.10015346,0.10186265,0.000047677902],"about_ca_topic_score_codex":0.0004129577,"about_ca_topic_score_gemma":0.0009871564,"teacher_disagreement_score":0.006761177,"about_ca_system_score_codex":0.00055697764,"about_ca_system_score_gemma":0.0005866197,"threshold_uncertainty_score":0.022618353},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11001543,0.0010251397,0.8396504,0.00079218624,0.00021085585,0.00018066754,0.00016084804,0.04005939,0.007905048],"genre_scores_gemma":[0.5434076,0.00043505637,0.44558737,0.0003057599,0.00008974051,0.00020807867,0.00039862638,0.0017090999,0.007858617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989133,0.00028298743,0.0001267764,0.00013759166,0.00036819084,0.00017110203],"domain_scores_gemma":[0.99720407,0.0005294458,0.00026652732,0.0015417939,0.00033271877,0.00012543765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019481435,0.0004152283,0.00042917326,0.000600393,0.00047311207,0.0010151786,0.0025951627,0.0006365408,0.002913336],"category_scores_gemma":[0.004458659,0.0006201406,0.0005054175,0.00036255294,0.0005950233,0.002188594,0.001978371,0.0014856318,0.0008427889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015087177,0.00055846595,0.012792658,0.0011708019,0.00020077413,0.0010449181,0.0013818013,0.0831032,0.20939066,0.12550364,0.028317884,0.53502643],"study_design_scores_gemma":[0.00037342857,0.0004440632,0.0038617454,0.00014582567,0.0001478703,0.0007841707,0.00017991583,0.6867873,0.16820762,0.026828177,0.11210312,0.00013669326],"about_ca_topic_score_codex":0.00068771414,"about_ca_topic_score_gemma":0.0018276706,"teacher_disagreement_score":0.002913336,"about_ca_system_score_codex":0.00056089496,"about_ca_system_score_gemma":0.0008688627,"threshold_uncertainty_score":0.010302901},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01659641,0.1722563,0.046335258,0.033808775,0.0018756985,0.0000621661,0.00034930385,0.00024205586,0.7284741],"genre_scores_gemma":[0.79195976,0.07048023,0.023355069,0.0064084833,0.0017797668,0.00022529394,0.00045087226,0.00016398536,0.10517652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815863,0.00094475085,0.000100584984,0.00032479144,0.00033573122,0.0001355017],"domain_scores_gemma":[0.9986386,0.00076825765,0.00013873662,0.0002091762,0.00015854619,0.00008677826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019617865,0.00072577724,0.0005145516,0.0018116729,0.0017055625,0.007126748,0.0007687195,0.0024420703,0.010522556],"category_scores_gemma":[0.0038697256,0.00023414564,0.00045852878,0.0012868899,0.019699136,0.006929996,0.0033825424,0.0020401264,0.00207966],"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.000010088244,0.000004171951,0.00018801678,0.00009878399,0.000009616984,0.00006303758,0.0030887579,0.00010615778,0.000100182035,0.97190756,0.0034361028,0.02098752],"study_design_scores_gemma":[0.000008064507,0.000018169922,0.00060264865,0.0002549936,0.000012327728,0.00034066412,0.0017611431,0.00020674033,0.00014679041,0.7927825,0.20385186,0.00001413339],"about_ca_topic_score_codex":0.00305261,"about_ca_topic_score_gemma":0.0024089874,"teacher_disagreement_score":0.010522556,"about_ca_system_score_codex":0.0019690008,"about_ca_system_score_gemma":0.001615652,"threshold_uncertainty_score":0.03520143},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004686211,0.00037637993,0.991106,0.0007052327,0.00009918594,0.000060959424,0.0009698768,0.00067615556,0.0013200359],"genre_scores_gemma":[0.37431192,0.0013621919,0.6119651,0.0012521126,0.000518956,0.0009999039,0.006469704,0.0013559329,0.0017642602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98134845,0.011666176,0.00080262194,0.0035620737,0.0023223904,0.00029824424],"domain_scores_gemma":[0.8945721,0.08162075,0.0050103706,0.015682433,0.0023516978,0.00076275744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026007727,0.0017953534,0.0019015617,0.003724358,0.0010311685,0.004873123,0.0036327664,0.0018426075,0.005829754],"category_scores_gemma":[0.15862747,0.0014851389,0.003494434,0.0025885664,0.0059754737,0.008872294,0.0052894265,0.006844789,0.0017715102],"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.00030422915,0.00013548338,0.013260078,0.0010897401,0.0015485539,0.00016893964,0.0005266391,0.26526588,0.0023563162,0.5831605,0.013390278,0.11879334],"study_design_scores_gemma":[0.000025375468,0.00003525747,0.0014086054,0.00008157079,0.00005003185,0.000059778602,0.00004590961,0.2997397,0.0010624444,0.6943434,0.0031211525,0.00002685285],"about_ca_topic_score_codex":0.002786197,"about_ca_topic_score_gemma":0.0024799057,"teacher_disagreement_score":0.026007727,"about_ca_system_score_codex":0.0020104216,"about_ca_system_score_gemma":0.0023230654,"threshold_uncertainty_score":0.13754368},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039427546,0.0008095305,0.98393583,0.00033494367,0.00011707793,0.00012376205,0.00020483797,0.007844043,0.002687251],"genre_scores_gemma":[0.096828245,0.0005489553,0.8936198,0.0003201127,0.00023071833,0.00048925984,0.001049548,0.0012261535,0.005687296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721044,0.000741396,0.0002045877,0.0005912102,0.00097263954,0.00027969212],"domain_scores_gemma":[0.994612,0.0032496746,0.00032174014,0.00087815,0.00078449165,0.00015395596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003072402,0.0020530645,0.0015202805,0.0022603923,0.00070333807,0.002104363,0.0028328921,0.0017421518,0.019119851],"category_scores_gemma":[0.014592455,0.00076996366,0.0012508831,0.001860698,0.0009477148,0.0037820244,0.0029503482,0.0027048227,0.014836583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061536825,0.00016643567,0.001215585,0.00033604167,0.00008967236,0.00016083587,0.00012710976,0.08363076,0.007964418,0.023402762,0.028040092,0.8542509],"study_design_scores_gemma":[0.000100182166,0.00010210811,0.0004026164,0.000054302905,0.00002004855,0.0001918905,0.0000735702,0.94544345,0.0030510728,0.03956768,0.010965991,0.000026977168],"about_ca_topic_score_codex":0.0029046878,"about_ca_topic_score_gemma":0.003712528,"teacher_disagreement_score":0.019119851,"about_ca_system_score_codex":0.0007651056,"about_ca_system_score_gemma":0.0021022733,"threshold_uncertainty_score":0.06396228},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03850257,0.0012582284,0.8012236,0.0006127521,0.00067482877,0.00026902568,0.0023318855,0.08830655,0.06682054],"genre_scores_gemma":[0.18283917,0.0008786523,0.73538995,0.0005688071,0.00011788582,0.00024115814,0.0050632097,0.018622039,0.056279093],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995832,0.000057224293,0.0000384281,0.000074388474,0.00017110759,0.000075736025],"domain_scores_gemma":[0.9996136,0.000115244555,0.000019125173,0.000105684274,0.00012717758,0.000019359548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053817744,0.0005777023,0.00039463714,0.0005506906,0.00045421353,0.0014184248,0.0013464296,0.0005476249,0.018608782],"category_scores_gemma":[0.0014085935,0.00068891695,0.0006945368,0.0007454092,0.00040752185,0.0020124028,0.00088079134,0.0012251665,0.007610554],"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.0009977086,0.00021174079,0.0022208411,0.0006353675,0.00012737293,0.0005498999,0.0006025788,0.05055575,0.06586196,0.13630618,0.14920597,0.5927247],"study_design_scores_gemma":[0.00050967187,0.00039584623,0.0014014327,0.00020844587,0.0001705846,0.00051835837,0.00030376716,0.33404773,0.10156694,0.09181156,0.46892837,0.00013729371],"about_ca_topic_score_codex":0.0022313667,"about_ca_topic_score_gemma":0.007135191,"teacher_disagreement_score":0.018608782,"about_ca_system_score_codex":0.000712859,"about_ca_system_score_gemma":0.0018059837,"threshold_uncertainty_score":0.06225258},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6994724,0.0007358967,0.29457423,0.00015519848,0.000036841677,0.00009993769,0.000043349784,0.0026094755,0.0022726003],"genre_scores_gemma":[0.94446117,0.00006875518,0.054437242,0.000063103646,0.000012884867,0.000053647585,0.000051140578,0.00007845912,0.0007735961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993217,0.00013233657,0.000044501205,0.00014834046,0.00019710629,0.00015598399],"domain_scores_gemma":[0.99752134,0.00093137304,0.0003603074,0.00073915895,0.00029114014,0.00015669761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008158991,0.0003945414,0.00061805215,0.0006301521,0.00085455854,0.0006665346,0.0013578158,0.0004969088,0.0005867875],"category_scores_gemma":[0.003046382,0.0004900904,0.00021479966,0.0006723721,0.0010430173,0.0019084803,0.0014724076,0.00046450074,0.00017313458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019500621,0.0004147314,0.012929379,0.00029436356,0.00017545038,0.0011546488,0.0021264602,0.4199144,0.3446725,0.026253087,0.0031775064,0.18693747],"study_design_scores_gemma":[0.00009828111,0.00052803906,0.0020845388,0.000013091194,0.00005645091,0.00020873525,0.00020146868,0.9048213,0.07507999,0.012935854,0.0039186394,0.000053723008],"about_ca_topic_score_codex":0.0048912484,"about_ca_topic_score_gemma":0.008664928,"teacher_disagreement_score":0.0048912484,"about_ca_system_score_codex":0.0008502561,"about_ca_system_score_gemma":0.0009410155,"threshold_uncertainty_score":0.009725571},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028543836,0.083579205,0.26565218,0.0045656897,0.016115103,0.0003893646,0.0013361861,0.0081307385,0.61737716],"genre_scores_gemma":[0.008771029,0.03045678,0.043180566,0.0012306777,0.002840606,0.00023938705,0.0012738031,0.0012306818,0.91077644],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994035,0.000055946664,0.000029990075,0.00007454183,0.0004001549,0.00003583035],"domain_scores_gemma":[0.99903905,0.00023583345,0.000045991143,0.000178645,0.0004031471,0.0000973458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004855148,0.002157002,0.0018690695,0.0015527641,0.00078054634,0.0029469095,0.0014868227,0.0012152108,0.08810319],"category_scores_gemma":[0.001641676,0.0007967777,0.00039621923,0.0038898177,0.00066841656,0.0029572505,0.0018083947,0.002731072,0.09076776],"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.000046957273,0.00005391056,0.00012167147,0.00047969836,0.000029902536,0.000077832316,0.000070312686,0.001650324,0.0034024515,0.026853561,0.5206057,0.44660774],"study_design_scores_gemma":[0.000012454519,0.000047071404,0.0003218348,0.00013616304,0.000019182762,0.00026208643,0.000025073645,0.005268124,0.0012539249,0.0165462,0.97609144,0.00001645923],"about_ca_topic_score_codex":0.0006406121,"about_ca_topic_score_gemma":0.0011371712,"teacher_disagreement_score":0.08810319,"about_ca_system_score_codex":0.00047691574,"about_ca_system_score_gemma":0.0008644414,"threshold_uncertainty_score":0.29473454},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47598016,0.0065063746,0.47651055,0.0005471687,0.0002469586,0.00011866561,0.00019093475,0.0027899432,0.037109353],"genre_scores_gemma":[0.822722,0.00063186,0.16594444,0.000156064,0.00003069901,0.00007716325,0.00022247073,0.00006055203,0.01015474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999132,0.0000161798,0.000005995068,0.000019572277,0.000025691304,0.000019375642],"domain_scores_gemma":[0.9999274,0.000008769757,0.000009931562,0.000015194688,0.000030066094,0.000008681053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012938447,0.00015639579,0.00016982948,0.00018429926,0.00019573179,0.00028383356,0.0005898156,0.00019760511,0.0018103729],"category_scores_gemma":[0.00013082942,0.0000886108,0.00017397408,0.00020184497,0.00008816787,0.00037874441,0.00027586342,0.00015255276,0.00030227637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005295952,0.00026224414,0.004385704,0.00052149297,0.0001662805,0.0007197522,0.00022842974,0.25838327,0.27302855,0.03327413,0.009428512,0.419072],"study_design_scores_gemma":[0.00003952135,0.0007150106,0.0037201252,0.000033092285,0.00006796705,0.00053737423,0.00006963852,0.91888684,0.03796866,0.006514397,0.031416357,0.000031023683],"about_ca_topic_score_codex":0.0010564533,"about_ca_topic_score_gemma":0.0035017908,"teacher_disagreement_score":0.0018103729,"about_ca_system_score_codex":0.00024828548,"about_ca_system_score_gemma":0.00031054742,"threshold_uncertainty_score":0.0060563087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47598016,0.0065063746,0.47651055,0.0005471687,0.0002469586,0.00011866561,0.00019093475,0.0027899432,0.037109353],"genre_scores_gemma":[0.822722,0.00063186,0.16594444,0.000156064,0.00003069901,0.00007716325,0.00022247073,0.00006055203,0.01015474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999132,0.0000161798,0.000005995068,0.000019572277,0.000025691304,0.000019375642],"domain_scores_gemma":[0.9999274,0.000008769757,0.000009931562,0.000015194688,0.000030066094,0.000008681053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012938447,0.00015639579,0.00016982948,0.00018429926,0.00019573179,0.00028383356,0.0005898156,0.00019760511,0.0018103729],"category_scores_gemma":[0.00013082942,0.0000886108,0.00017397408,0.00020184497,0.00008816787,0.00037874441,0.00027586342,0.00015255276,0.00030227637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005295952,0.00026224414,0.004385704,0.00052149297,0.0001662805,0.0007197522,0.00022842974,0.25838327,0.27302855,0.03327413,0.009428512,0.419072],"study_design_scores_gemma":[0.00003952135,0.0007150106,0.0037201252,0.000033092285,0.00006796705,0.00053737423,0.00006963852,0.91888684,0.03796866,0.006514397,0.031416357,0.000031023683],"about_ca_topic_score_codex":0.0010564533,"about_ca_topic_score_gemma":0.0035017908,"teacher_disagreement_score":0.0018103729,"about_ca_system_score_codex":0.00024828548,"about_ca_system_score_gemma":0.00031054742,"threshold_uncertainty_score":0.0060563087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008748436,0.00015495124,0.9821361,0.00014434631,0.000051675324,0.00020698081,0.00012863109,0.006107265,0.0023215553],"genre_scores_gemma":[0.11513238,0.00015881915,0.87826973,0.00020705824,0.000057993293,0.00034057748,0.00074634975,0.0010471365,0.004039961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885523,0.00018260416,0.0000907444,0.00027549884,0.0004519527,0.0001439073],"domain_scores_gemma":[0.99797755,0.00091925706,0.00012147254,0.0005389193,0.00037558103,0.000067261986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009573318,0.0010299466,0.0008025484,0.0013174904,0.00082318013,0.0011411873,0.0016058543,0.0007915621,0.007155461],"category_scores_gemma":[0.003704107,0.00062890176,0.0012791095,0.0010908595,0.00088217587,0.0020805083,0.0023328431,0.0018330144,0.0019251151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005001576,0.00034357584,0.001264356,0.00093374983,0.00008058367,0.00048438535,0.0006404503,0.015486853,0.06392854,0.07383354,0.014684561,0.82781935],"study_design_scores_gemma":[0.00050426,0.00083395076,0.0016924788,0.00017284056,0.00028999196,0.001666338,0.0004013171,0.57886285,0.21690853,0.12995914,0.06851816,0.0001901957],"about_ca_topic_score_codex":0.0011331587,"about_ca_topic_score_gemma":0.0022178001,"teacher_disagreement_score":0.007155461,"about_ca_system_score_codex":0.0006912641,"about_ca_system_score_gemma":0.0024082563,"threshold_uncertainty_score":0.023937345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29648286,0.02086555,0.6414502,0.0019757347,0.0005530787,0.00008676726,0.00031983166,0.0015709191,0.03669502],"genre_scores_gemma":[0.9220037,0.003577192,0.0692135,0.00022223813,0.00015347693,0.000068340036,0.000115210874,0.000172009,0.004474337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998286,0.000022619568,0.0000075397006,0.000026139254,0.000086015854,0.000029065628],"domain_scores_gemma":[0.99953115,0.00019732535,0.0000655339,0.000107680105,0.00008021092,0.000018149562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022617719,0.00030489426,0.00021062022,0.00049801957,0.00032619777,0.0010255015,0.00056945585,0.00051829655,0.0022032063],"category_scores_gemma":[0.0010664328,0.00018139803,0.0001824835,0.00045383547,0.0005468581,0.0014644113,0.00038722815,0.00090421154,0.00032406245],"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.00034539928,0.00009169905,0.0025767433,0.0007243847,0.000044100016,0.00059049105,0.0005991465,0.071583025,0.3881621,0.4047116,0.0027975847,0.12777375],"study_design_scores_gemma":[0.000052746673,0.00060019566,0.0047091483,0.00020224437,0.00012505543,0.0024482112,0.00040061306,0.47791192,0.25011906,0.16554174,0.0978059,0.00008319088],"about_ca_topic_score_codex":0.0006083098,"about_ca_topic_score_gemma":0.0010163313,"teacher_disagreement_score":0.0022032063,"about_ca_system_score_codex":0.00042186558,"about_ca_system_score_gemma":0.00045158388,"threshold_uncertainty_score":0.0073704123},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10632813,0.00066291285,0.8494192,0.0004858483,0.00011279726,0.00014542918,0.0007796637,0.0014553724,0.0406106],"genre_scores_gemma":[0.8799963,0.0007733158,0.094975956,0.00028285568,0.00005317824,0.00036552653,0.00089511444,0.00084369525,0.021813985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954164,0.00009152699,0.000023128301,0.00008214033,0.00019338992,0.00006817886],"domain_scores_gemma":[0.9994098,0.00020444574,0.000056920206,0.00012912863,0.00017675664,0.000022901499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043260778,0.00078644796,0.0005957394,0.00048568653,0.00043117156,0.0007497086,0.0018691772,0.0006412232,0.004423073],"category_scores_gemma":[0.002021043,0.00036026738,0.0008278855,0.0007736631,0.0003606342,0.0015623285,0.00059346657,0.00083738274,0.0008824239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023432836,0.000020549729,0.00052319694,0.000025509758,0.000013069967,0.00006135771,0.000026109748,0.97862154,0.002210674,0.009571422,0.0011590929,0.0077439398],"study_design_scores_gemma":[0.000003724026,0.000014657584,0.00014512683,0.0000026908886,0.000005366005,0.000015805987,0.0000061968894,0.9945491,0.00092613476,0.0026771906,0.001650857,0.0000030659894],"about_ca_topic_score_codex":0.0060936995,"about_ca_topic_score_gemma":0.0047260295,"teacher_disagreement_score":0.0060936995,"about_ca_system_score_codex":0.0007873834,"about_ca_system_score_gemma":0.00067273935,"threshold_uncertainty_score":0.014796674},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011594381,0.06510099,0.1182103,0.015970645,0.071925,0.0003646266,0.0047678845,0.0026259802,0.70944023],"genre_scores_gemma":[0.08926602,0.08196777,0.042767152,0.0020877316,0.020277603,0.00033331325,0.0077705313,0.002042019,0.7534878],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991579,0.00008437551,0.000052344352,0.00009415022,0.00054239784,0.00006892075],"domain_scores_gemma":[0.9974605,0.0004281473,0.00010622396,0.00033083605,0.0013549885,0.0003193733],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001315755,0.0007091738,0.0008702132,0.0026857033,0.0007997699,0.0030417992,0.0008636877,0.0011152311,0.100888275],"category_scores_gemma":[0.0021904816,0.00034510955,0.00044686603,0.0027302539,0.0006950267,0.0022070284,0.0012983079,0.0015926696,0.02558633],"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.0001035938,0.0001717232,0.0004595446,0.00074948976,0.000041635598,0.0000651377,0.000043552416,0.002178669,0.006364688,0.06753267,0.5349586,0.38733065],"study_design_scores_gemma":[0.000015295882,0.00007645461,0.0010490548,0.00028644313,0.0000436945,0.0002776493,0.0000442196,0.009866361,0.0056856168,0.03205507,0.9505645,0.000035717894],"about_ca_topic_score_codex":0.0005609053,"about_ca_topic_score_gemma":0.0012689686,"teacher_disagreement_score":0.89911175,"about_ca_system_score_codex":0.0008002289,"about_ca_system_score_gemma":0.0019830596,"threshold_uncertainty_score":0.33750492},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106488876,0.001877604,0.808258,0.0015130964,0.000555512,0.0014757955,0.0004994387,0.04309948,0.03623225],"genre_scores_gemma":[0.22264753,0.0015627337,0.7457363,0.000529774,0.000095463176,0.00079018646,0.0023820424,0.007623477,0.018632496],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99804854,0.00040869904,0.00014668332,0.0003270665,0.0008381107,0.00023089733],"domain_scores_gemma":[0.9956097,0.0008723516,0.00016773702,0.0008960452,0.0021938677,0.0002603051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030336399,0.0007827433,0.00049725163,0.0009680368,0.00065808033,0.001213963,0.0023902797,0.00048921804,0.0072539058],"category_scores_gemma":[0.008752783,0.0006291122,0.0007341834,0.0009630724,0.0005527378,0.0023828435,0.00080026046,0.0018908647,0.0027423904],"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.00071303087,0.00072246307,0.0077204704,0.0010039259,0.00011849614,0.0004621288,0.0012966801,0.037942,0.123056166,0.027622014,0.034419727,0.7649228],"study_design_scores_gemma":[0.0005119576,0.0012869054,0.009874539,0.00057388115,0.00016831706,0.00079880666,0.0004361455,0.53157735,0.21491009,0.015551413,0.22407468,0.00023596731],"about_ca_topic_score_codex":0.0073586223,"about_ca_topic_score_gemma":0.004220154,"teacher_disagreement_score":0.0073586223,"about_ca_system_score_codex":0.0011882387,"about_ca_system_score_gemma":0.0027461527,"threshold_uncertainty_score":0.02426678},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009851789,0.0040739346,0.011848723,0.12810916,0.1233011,0.00022113557,0.011414431,0.0062303767,0.7138158],"genre_scores_gemma":[0.0128547065,0.0018565971,0.0031172016,0.032295484,0.013250313,0.0001078612,0.00751861,0.0022713817,0.92672783],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99431276,0.0005395752,0.00031136177,0.0008955784,0.0033574472,0.0005832686],"domain_scores_gemma":[0.9866676,0.0022380794,0.00049195194,0.0022219915,0.007262682,0.0011176541],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0033515843,0.00071633584,0.0008179769,0.001942169,0.0032815011,0.00847742,0.0017635553,0.0034652262,0.44004944],"category_scores_gemma":[0.017343998,0.00067835854,0.0010357463,0.0015376426,0.0014281254,0.0059892316,0.0020134759,0.0054327864,0.27009827],"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.00002822141,0.0000100724465,0.00007492446,0.000054313492,0.000003775842,0.000036324094,0.000016859876,0.000049857164,0.00026590173,0.013029254,0.96716124,0.019269228],"study_design_scores_gemma":[0.000007780347,0.000008025943,0.00011348112,0.00004594563,0.000003136872,0.000055858614,0.000018446215,0.00014214378,0.000472664,0.0042013214,0.99492294,0.000008284529],"about_ca_topic_score_codex":0.005995551,"about_ca_topic_score_gemma":0.00966106,"teacher_disagreement_score":0.5599506,"about_ca_system_score_codex":0.0034456456,"about_ca_system_score_gemma":0.005502517,"threshold_uncertainty_score":0.7987015},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002333239,0.10983439,0.0070533995,0.07602188,0.77209336,0.00004040064,0.0004223403,0.0006457842,0.03365518],"genre_scores_gemma":[0.0038256182,0.092960164,0.005725737,0.03266983,0.7368882,0.000097123695,0.00060258963,0.00076630624,0.12646447],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982175,0.0002347486,0.0001662989,0.0003031095,0.00094710477,0.00013115014],"domain_scores_gemma":[0.99325013,0.0016255995,0.00025177022,0.00044033417,0.0037915455,0.00064064213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022401689,0.0023121324,0.0020656814,0.0031033254,0.0011687769,0.0042295866,0.0020060732,0.0034987472,0.038317274],"category_scores_gemma":[0.0126938475,0.00072259706,0.0013332868,0.0029414769,0.0009536575,0.0046734195,0.0015121151,0.0056183897,0.03463615],"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.000019750985,0.000008522179,0.000024217145,0.000111756606,0.0000070016213,0.000023352251,0.000008217966,0.00013209981,0.00005331917,0.0018278091,0.9534324,0.044351637],"study_design_scores_gemma":[0.000008755313,0.000015396961,0.00012558553,0.00012593502,0.000007937582,0.00011900612,0.000010524969,0.0003757809,0.000079965226,0.0024979,0.9966216,0.0000115521425],"about_ca_topic_score_codex":0.0018488852,"about_ca_topic_score_gemma":0.0037145917,"teacher_disagreement_score":0.038317274,"about_ca_system_score_codex":0.002361599,"about_ca_system_score_gemma":0.0016760973,"threshold_uncertainty_score":0.12818402},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0384542,0.002278842,0.9018868,0.00040821318,0.0010089334,0.0013159437,0.0010404513,0.014575961,0.039030686],"genre_scores_gemma":[0.28732312,0.0013653245,0.6309637,0.00051023095,0.00036734648,0.002029871,0.0057690754,0.0030692478,0.06860208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979091,0.00024994722,0.00019208617,0.0006315868,0.00067572686,0.00034152658],"domain_scores_gemma":[0.99764997,0.0002182472,0.000122776,0.0010055958,0.0007948615,0.00020864951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015067066,0.0008851379,0.0012164802,0.0018913038,0.0019399446,0.0025672112,0.0020739234,0.00093900715,0.015010617],"category_scores_gemma":[0.00411694,0.0006449057,0.0012106455,0.0025482979,0.0004571649,0.0017118304,0.0019721922,0.0011467667,0.009870088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009721212,0.0003032813,0.008336638,0.0006902611,0.00030555067,0.00018773317,0.0008147396,0.034432195,0.030904133,0.073259346,0.06952915,0.78026485],"study_design_scores_gemma":[0.00034883094,0.00038234823,0.005518402,0.00014430874,0.00026162458,0.0007039338,0.00043005458,0.4210549,0.05478902,0.114610285,0.40162453,0.00013176857],"about_ca_topic_score_codex":0.0027577705,"about_ca_topic_score_gemma":0.0036431937,"teacher_disagreement_score":0.015010617,"about_ca_system_score_codex":0.0011291815,"about_ca_system_score_gemma":0.0022352831,"threshold_uncertainty_score":0.050215542},"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":"software","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011259131,0.0006535103,0.16085194,0.002112055,0.0019787406,0.0003979635,0.25028113,0.5583832,0.024215639],"genre_scores_gemma":[0.023620145,0.0014802936,0.14755219,0.0030202365,0.0009366795,0.0026660727,0.43505785,0.36487877,0.02078771],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953242,0.00097066455,0.00047488778,0.0008328009,0.0019122234,0.0004853022],"domain_scores_gemma":[0.98547864,0.0046856767,0.0006057104,0.006767064,0.0015746285,0.00088827056],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0073117088,0.002143083,0.0023336322,0.003397489,0.0013440972,0.007180001,0.005940109,0.0039685643,0.20889479],"category_scores_gemma":[0.0386165,0.0023024105,0.0031296723,0.0038569001,0.0019644005,0.009538037,0.011635242,0.006934368,0.18352091],"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.0009471173,0.000111477966,0.0012979227,0.0015076331,0.00017770588,0.00028577496,0.0003452898,0.0014197949,0.002543453,0.04816163,0.9060383,0.03716387],"study_design_scores_gemma":[0.00038223132,0.000045560773,0.0014285318,0.00039042957,0.000056275287,0.00024092133,0.000104377,0.0038844673,0.004855237,0.099336885,0.88912874,0.00014626895],"about_ca_topic_score_codex":0.0027385016,"about_ca_topic_score_gemma":0.0035904231,"teacher_disagreement_score":0.9940599,"about_ca_system_score_codex":0.0016172227,"about_ca_system_score_gemma":0.0040004416,"threshold_uncertainty_score":0.6988227},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04500778,0.00020471429,0.93883216,0.0001222771,0.000062948675,0.000060975886,0.00015595749,0.006005732,0.009547348],"genre_scores_gemma":[0.21586683,0.0001456667,0.7740892,0.00008048822,0.000020692467,0.000113938026,0.00046246542,0.00054052984,0.008680196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958247,0.000066679946,0.00003571824,0.000065510336,0.00018984448,0.000059799626],"domain_scores_gemma":[0.99947673,0.000100090445,0.000037898168,0.00017153897,0.00018312338,0.0000306137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037985828,0.000617068,0.0005886267,0.0005697884,0.00047710992,0.00084207003,0.0016809794,0.00048787316,0.006738119],"category_scores_gemma":[0.0012047258,0.0003229238,0.0005863961,0.00093119976,0.0003665955,0.001139952,0.0010134242,0.0007267936,0.0017029479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059423014,0.00022970681,0.0025300412,0.00031478493,0.0001554263,0.00058926706,0.0005622456,0.23770246,0.08965974,0.07719952,0.022451818,0.56801075],"study_design_scores_gemma":[0.00005403225,0.000115657625,0.00048261043,0.000019651548,0.000013192041,0.00022991853,0.00005768304,0.9249726,0.040079825,0.009337798,0.02460442,0.000032583113],"about_ca_topic_score_codex":0.003453389,"about_ca_topic_score_gemma":0.006897627,"teacher_disagreement_score":0.006738119,"about_ca_system_score_codex":0.000485678,"about_ca_system_score_gemma":0.0010464893,"threshold_uncertainty_score":0.022541285},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011801994,0.005991384,0.8228775,0.0055155144,0.002652518,0.00038097665,0.0012678027,0.048942287,0.10057003],"genre_scores_gemma":[0.1299311,0.0044054897,0.7892152,0.0020276664,0.001046302,0.0004260536,0.0028551791,0.0074008177,0.06269208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902904,0.0001944272,0.00011608848,0.00016314772,0.00038362303,0.000113629016],"domain_scores_gemma":[0.9985441,0.00021377059,0.00012423359,0.0006515654,0.00027841562,0.00018786121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018294896,0.00069749117,0.00070003234,0.00081664196,0.0013221873,0.0033594128,0.0014785356,0.0013849409,0.015172908],"category_scores_gemma":[0.0028656826,0.00076819333,0.0013725699,0.00096759375,0.0013702668,0.002949466,0.002173003,0.0032890365,0.006486164],"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.00028552927,0.000097273,0.0009372763,0.00062447705,0.000039133392,0.00028063986,0.0007951584,0.005542533,0.008729443,0.55676454,0.13025782,0.29564613],"study_design_scores_gemma":[0.00005072987,0.00006121035,0.00028180936,0.00011308127,0.000017247332,0.00037770256,0.00004462803,0.008171025,0.0023205625,0.06441791,0.9241105,0.000033678647],"about_ca_topic_score_codex":0.0016564565,"about_ca_topic_score_gemma":0.0021740734,"teacher_disagreement_score":0.015172908,"about_ca_system_score_codex":0.001592261,"about_ca_system_score_gemma":0.0019929942,"threshold_uncertainty_score":0.05075842},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02908627,0.00021954086,0.9563312,0.00010075604,0.000050569528,0.00007975599,0.00011661484,0.0044981893,0.009517138],"genre_scores_gemma":[0.38991225,0.00023408029,0.60256857,0.00016285508,0.00003590847,0.00023321729,0.0005775493,0.001103981,0.005171562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967134,0.00007114194,0.00002497098,0.00003903621,0.00013967624,0.000053778964],"domain_scores_gemma":[0.9995938,0.00017898026,0.00004723957,0.00008248217,0.000084530104,0.000013081214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050322886,0.00055880257,0.0002510393,0.00048634206,0.00025504266,0.0007236011,0.00077057147,0.00034631896,0.004067813],"category_scores_gemma":[0.00097410695,0.00025986813,0.0005487522,0.00031048703,0.00037874168,0.00051066594,0.00036202552,0.0007610835,0.0009664195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027815363,0.00021289004,0.0017619423,0.00074302807,0.00006238349,0.00034447017,0.00038202203,0.43590677,0.16698337,0.084475204,0.006454143,0.3023956],"study_design_scores_gemma":[0.000053353975,0.000291438,0.00048516586,0.000053599222,0.000041905816,0.00014953563,0.000053435342,0.8540721,0.09699773,0.023416327,0.024360389,0.000025001926],"about_ca_topic_score_codex":0.0009968964,"about_ca_topic_score_gemma":0.0014257487,"teacher_disagreement_score":0.004067813,"about_ca_system_score_codex":0.0005424721,"about_ca_system_score_gemma":0.0009009423,"threshold_uncertainty_score":0.013608158},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92648417,0.0005654797,0.06510614,0.00012771343,0.000077274766,0.00006472454,0.000103818,0.0028738482,0.004596877],"genre_scores_gemma":[0.9644652,0.0001563643,0.03347742,0.00008549365,0.000009335705,0.000042334414,0.00007777318,0.00015181907,0.0015343314],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997583,0.00002692943,0.000016223366,0.00003513999,0.00009853064,0.000064871616],"domain_scores_gemma":[0.9994789,0.00016891984,0.00010238248,0.00013005993,0.00008872117,0.00003110595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025268566,0.00044731755,0.00014272034,0.0004224404,0.00018201812,0.0003390953,0.0006300768,0.00018395603,0.00149231],"category_scores_gemma":[0.0008624179,0.00016395174,0.00015211235,0.00023765478,0.00034684746,0.00074335566,0.00031724133,0.00047861444,0.00019232431],"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.0005252137,0.00026657918,0.0104370965,0.00056947046,0.00006325727,0.0006247253,0.00050707295,0.1465239,0.59055406,0.010724588,0.0034778165,0.23572628],"study_design_scores_gemma":[0.00006191943,0.0014708943,0.007522423,0.00006430055,0.000059144877,0.00025393575,0.00020936588,0.29993042,0.6751918,0.0024313347,0.012753684,0.000050820294],"about_ca_topic_score_codex":0.0014429601,"about_ca_topic_score_gemma":0.0024627293,"teacher_disagreement_score":0.00149231,"about_ca_system_score_codex":0.0004273562,"about_ca_system_score_gemma":0.00052802195,"threshold_uncertainty_score":0.004992306},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15669824,0.00045521167,0.8027114,0.0010703288,0.0003017619,0.00015472693,0.00034989975,0.025695257,0.012563092],"genre_scores_gemma":[0.6528933,0.0002536186,0.3359193,0.00026203968,0.00011331336,0.0002738962,0.0010935743,0.00082982355,0.008361262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994961,0.00007918351,0.00002664185,0.0001057522,0.00017877138,0.00011358222],"domain_scores_gemma":[0.99900824,0.00020580113,0.00006738913,0.00037716574,0.00024401759,0.00009735718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007071013,0.0009391597,0.00046617814,0.0006444342,0.0012395597,0.00092384673,0.002126278,0.00050710625,0.0035509176],"category_scores_gemma":[0.0020361033,0.00038923687,0.00056182244,0.0010097312,0.00068624824,0.0019027911,0.0018077804,0.0012595712,0.000993078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008822271,0.0005499939,0.010549824,0.00035388113,0.00023757118,0.00034592388,0.0007106777,0.4153784,0.063725814,0.036670774,0.055177845,0.41541705],"study_design_scores_gemma":[0.000061538405,0.000127797,0.00090276054,0.00000792982,0.000021862717,0.000041063537,0.000100910525,0.9594156,0.02248969,0.00898153,0.007825803,0.000023514041],"about_ca_topic_score_codex":0.00983245,"about_ca_topic_score_gemma":0.019692475,"teacher_disagreement_score":0.00983245,"about_ca_system_score_codex":0.0014474433,"about_ca_system_score_gemma":0.0023521709,"threshold_uncertainty_score":0.019550443},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02034532,0.0208749,0.67924285,0.0033892847,0.0045698327,0.00018898449,0.0009318418,0.01192877,0.25852817],"genre_scores_gemma":[0.2581238,0.01883722,0.4171004,0.0012761286,0.0018792271,0.00028810144,0.0032120838,0.0021907664,0.29709235],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998179,0.00002177932,0.000007785864,0.00004482819,0.00007883327,0.000028926972],"domain_scores_gemma":[0.99981755,0.00003155533,0.000006397497,0.000047625137,0.000065775734,0.00003109421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025146548,0.0011056324,0.0004383434,0.0004994672,0.00040876024,0.001251436,0.0009295611,0.00070977863,0.03651397],"category_scores_gemma":[0.00060917257,0.00045285063,0.0004445556,0.0010839769,0.00040131246,0.0008860155,0.0008333232,0.001914242,0.011784993],"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.00030544942,0.00007931146,0.0005565635,0.00049693347,0.000075714684,0.00016555446,0.00016759927,0.026513021,0.064044125,0.21816777,0.21646754,0.47296038],"study_design_scores_gemma":[0.000104351726,0.00022993148,0.0011348049,0.00014166978,0.00006313167,0.00029509485,0.000053860673,0.103105225,0.037344396,0.11250879,0.74496925,0.000049469803],"about_ca_topic_score_codex":0.0007163037,"about_ca_topic_score_gemma":0.0014905845,"teacher_disagreement_score":0.03651397,"about_ca_system_score_codex":0.00080855616,"about_ca_system_score_gemma":0.0006034568,"threshold_uncertainty_score":0.122151375},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010546437,0.0010906993,0.0175043,0.0013593838,0.0007647927,0.00010576316,0.004567317,0.009082203,0.96447086],"genre_scores_gemma":[0.0030666953,0.00074402284,0.0044405437,0.0004093447,0.00013608392,0.00003772155,0.002487151,0.0010192735,0.98765904],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996978,0.000017540278,0.000007881091,0.0000926542,0.00014772627,0.00003643321],"domain_scores_gemma":[0.9996019,0.000043641885,0.000013178551,0.00011336892,0.00014713385,0.000080690465],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031853572,0.0011413976,0.00062275823,0.0014595385,0.0013264978,0.00300109,0.0012725845,0.00083712424,0.4893839],"category_scores_gemma":[0.00064024434,0.00058506377,0.00036466273,0.0023103587,0.0002926853,0.0027439373,0.0015379121,0.0015638034,0.37647045],"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.000049765833,0.000044484477,0.000119590775,0.000068926835,0.000003613196,0.000034984263,0.000035958725,0.00021103321,0.0015065261,0.016165264,0.81891,0.1628499],"study_design_scores_gemma":[0.0000073182737,0.000008824594,0.00013722714,0.000014839977,0.0000027292251,0.000067188514,0.000018545867,0.0005600992,0.0011119448,0.0028093478,0.9952565,0.000005393492],"about_ca_topic_score_codex":0.002751822,"about_ca_topic_score_gemma":0.0052743144,"teacher_disagreement_score":0.4893839,"about_ca_system_score_codex":0.00087473314,"about_ca_system_score_gemma":0.000985727,"threshold_uncertainty_score":0.72833186},"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":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0376526,0.00016500738,0.38458326,0.00042460955,0.00033158343,0.00032731463,0.00307027,0.5649661,0.008479276],"genre_scores_gemma":[0.52184474,0.00022537206,0.40545717,0.0009456368,0.00014027154,0.0009438861,0.010078958,0.04608102,0.014282926],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986669,0.00021248133,0.000109196655,0.00027586566,0.00052270433,0.00021289392],"domain_scores_gemma":[0.9950847,0.0017501899,0.0004181688,0.0017607135,0.0007291551,0.000257023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026410888,0.002096651,0.0006451599,0.0012948157,0.00076637743,0.0015364329,0.0024894706,0.0012176097,0.021792075],"category_scores_gemma":[0.0091764135,0.0009669311,0.0010743348,0.00058679946,0.0015217751,0.003367387,0.0023748078,0.0032684978,0.005123756],"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.0034177024,0.00096219406,0.028718825,0.001797034,0.00030770115,0.0016748363,0.0018317619,0.11146027,0.09695995,0.035551284,0.28303564,0.43428284],"study_design_scores_gemma":[0.00031922394,0.0008585653,0.0040197475,0.000120343866,0.00008877071,0.0008127966,0.00012430249,0.7168649,0.19471224,0.020227497,0.061648164,0.00020341901],"about_ca_topic_score_codex":0.0030936114,"about_ca_topic_score_gemma":0.0030020003,"teacher_disagreement_score":0.021792075,"about_ca_system_score_codex":0.0010511115,"about_ca_system_score_gemma":0.0015398624,"threshold_uncertainty_score":0.072901785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0480533,0.00054037943,0.89723605,0.00021034002,0.00019042839,0.0004891177,0.00019441827,0.03647748,0.016608452],"genre_scores_gemma":[0.5223435,0.0004353979,0.44265383,0.00052604754,0.00018062227,0.0007133326,0.0008549162,0.0073860497,0.024906266],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99716824,0.00073583977,0.0002746917,0.0006051012,0.000858602,0.00035749638],"domain_scores_gemma":[0.9925972,0.0014996533,0.00032974678,0.0042320727,0.0009996378,0.0003415764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003813992,0.0008032156,0.00082162814,0.00035760383,0.0007064416,0.002301796,0.003016581,0.0006991716,0.006504402],"category_scores_gemma":[0.0095024165,0.0007621087,0.00089045364,0.00042515123,0.00095711835,0.002926515,0.0024128475,0.0022180723,0.00225213],"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.0027221236,0.0008398356,0.02045597,0.0011511937,0.00035863754,0.0005331009,0.0030365763,0.039464448,0.1463558,0.10384018,0.04031948,0.64092267],"study_design_scores_gemma":[0.0003115041,0.0008843596,0.004800121,0.00019677612,0.00029088947,0.0008886388,0.00022559977,0.48168296,0.16904089,0.052320402,0.28912663,0.00023120336],"about_ca_topic_score_codex":0.0011786473,"about_ca_topic_score_gemma":0.0014443382,"teacher_disagreement_score":0.006504402,"about_ca_system_score_codex":0.0008395471,"about_ca_system_score_gemma":0.001970436,"threshold_uncertainty_score":0.02175945},"labels":[],"label_agreement":null},{"id":"W4214593058","doi":"10.1145/2544173.2509543","title":"Interacting with dead objects","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Snapshot (computer storage); Debugging; Programming language; Java; Operating system; Architecture; Virtual machine; Memory leak; Machine code; Program code; Code (set theory); Garbage collection; Compiler","score_opus":0.016281719968047823,"score_gpt":0.2496649981974478,"score_spread":0.23338327822939997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214593058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31408837,0.00057707494,0.6585927,0.0006560969,0.0002531494,0.00013413932,0.00015295688,0.014836207,0.0107092885],"genre_scores_gemma":[0.8117009,0.00028556256,0.16763617,0.00045065183,0.000058026064,0.00016735437,0.0003205685,0.0023635968,0.017017221],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99753845,0.00057494926,0.00014451238,0.0004410299,0.00092127215,0.0003798916],"domain_scores_gemma":[0.98785377,0.0043537538,0.0007986706,0.0049318853,0.0013514939,0.0007104058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032309913,0.0008968385,0.0008102317,0.0007023983,0.0015270363,0.002987484,0.0033802763,0.0017508593,0.004147185],"category_scores_gemma":[0.012428993,0.0010111531,0.00048354708,0.00048737467,0.00278019,0.0058591026,0.006151441,0.0020444558,0.0010856087],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027396416,0.000706551,0.07322098,0.0008796785,0.00032205915,0.0066571613,0.020840703,0.084492505,0.21319027,0.19710079,0.019950802,0.37989888],"study_design_scores_gemma":[0.00019755395,0.0008215448,0.007439159,0.00021661558,0.00036848217,0.0026323765,0.002952021,0.45929545,0.23932347,0.1640163,0.12242998,0.0003070297],"about_ca_topic_score_codex":0.0015108681,"about_ca_topic_score_gemma":0.001663644,"teacher_disagreement_score":0.004147185,"about_ca_system_score_codex":0.0005877648,"about_ca_system_score_gemma":0.00091748306,"threshold_uncertainty_score":0.01708728},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28539395,0.002312686,0.69797564,0.00070995797,0.00036176646,0.00007018496,0.00013549603,0.005268475,0.007771939],"genre_scores_gemma":[0.8258163,0.00043824333,0.170785,0.00035679594,0.000100605714,0.000057183082,0.0001228414,0.00015206098,0.0021709716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928015,0.00018514929,0.00004948427,0.00012910608,0.00024364678,0.00011262358],"domain_scores_gemma":[0.99775714,0.0006874668,0.00026448912,0.0006654685,0.0004929061,0.00013255763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007119675,0.0005631845,0.00032018684,0.00044497318,0.0003387969,0.0011680919,0.0015767494,0.00029511153,0.0013048577],"category_scores_gemma":[0.0028361413,0.00036622823,0.00024822867,0.00037993435,0.00046819326,0.0019331024,0.0009601822,0.0009465457,0.00039552068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016240755,0.0003331263,0.01663926,0.00035295414,0.0001677059,0.0003641224,0.00048581857,0.23669493,0.25832072,0.043022644,0.008540141,0.43345457],"study_design_scores_gemma":[0.00006492833,0.00047514975,0.0016740719,0.000057149253,0.00011952209,0.0003059354,0.0000862881,0.84195745,0.115787685,0.01361229,0.025799047,0.000060581016],"about_ca_topic_score_codex":0.0014200987,"about_ca_topic_score_gemma":0.0026510882,"teacher_disagreement_score":0.0015767494,"about_ca_system_score_codex":0.00066166907,"about_ca_system_score_gemma":0.0015674371,"threshold_uncertainty_score":0.0048007965},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13170937,0.0019670702,0.83280325,0.0014454583,0.00058394106,0.00048650758,0.00025460913,0.01807402,0.0126757],"genre_scores_gemma":[0.75375485,0.00054887234,0.23367698,0.0007363245,0.00027103306,0.0007540808,0.00032425468,0.00076119596,0.009172433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99761665,0.00044721665,0.00029930077,0.00034978896,0.00094545295,0.00034161145],"domain_scores_gemma":[0.9895705,0.002367251,0.00093322835,0.005442344,0.0012830128,0.0004037017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040449663,0.0009603921,0.0007941024,0.0011234307,0.0015892967,0.002243582,0.0053645247,0.001283281,0.006728459],"category_scores_gemma":[0.010215932,0.0012759921,0.0006983025,0.00080601336,0.0018788896,0.0066196276,0.0048940904,0.002155737,0.0012338221],"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.0015495238,0.00055256113,0.00605398,0.00094288785,0.00027644963,0.00083597074,0.0014563275,0.09177527,0.079810224,0.6218505,0.01939446,0.17550175],"study_design_scores_gemma":[0.00065777363,0.001047233,0.0012515982,0.00015806504,0.00031312616,0.0005700343,0.00029289848,0.56670505,0.08560486,0.2678497,0.07531175,0.00023794659],"about_ca_topic_score_codex":0.0010436251,"about_ca_topic_score_gemma":0.001704785,"teacher_disagreement_score":0.006728459,"about_ca_system_score_codex":0.0009264788,"about_ca_system_score_gemma":0.0021138568,"threshold_uncertainty_score":0.022508979},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027522724,0.00008349785,0.98308843,0.00042322016,0.00010445636,0.000053222113,0.00011853412,0.008465595,0.004910845],"genre_scores_gemma":[0.06306156,0.0003701157,0.924165,0.0006587255,0.00018543759,0.00022011726,0.00052964315,0.003634768,0.0071746134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985869,0.00028435886,0.0001354637,0.00020100376,0.00061740994,0.00017486991],"domain_scores_gemma":[0.9967693,0.0006034394,0.00028033037,0.0012359157,0.00089359307,0.00021750231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029675104,0.0010783395,0.00065768434,0.0011712328,0.0009902244,0.0024402356,0.0035222217,0.0007280272,0.006253592],"category_scores_gemma":[0.004719738,0.00068684405,0.0014293555,0.001584366,0.0022519415,0.0041875616,0.004214181,0.0030351228,0.0034094607],"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.0005019155,0.0001375945,0.0026905998,0.00065085205,0.00011858549,0.0005667928,0.0010710778,0.03792217,0.027605038,0.6256925,0.046274856,0.256768],"study_design_scores_gemma":[0.00014908955,0.00017201426,0.00028916143,0.00013824673,0.000056998182,0.0005687615,0.00011952239,0.47634268,0.024759402,0.28282437,0.21448445,0.00009531673],"about_ca_topic_score_codex":0.0036944603,"about_ca_topic_score_gemma":0.0061637643,"teacher_disagreement_score":0.006253592,"about_ca_system_score_codex":0.0013600263,"about_ca_system_score_gemma":0.0026201908,"threshold_uncertainty_score":0.020920396},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04508076,0.008407831,0.87300235,0.00077404914,0.00076229795,0.00030363034,0.0017731888,0.022640219,0.04725578],"genre_scores_gemma":[0.39161775,0.0043910197,0.57029563,0.0006538249,0.00020690657,0.00025603233,0.002951758,0.0013512187,0.02827584],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997882,0.00002939761,0.000013517787,0.00003108108,0.000093188086,0.00004465806],"domain_scores_gemma":[0.9997037,0.00006246214,0.000029230025,0.00007923676,0.000087579545,0.000037765905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003736563,0.0008395703,0.00027028917,0.00050326844,0.00020541486,0.0007041929,0.0011227449,0.00033499257,0.016424919],"category_scores_gemma":[0.0007528343,0.00037323055,0.00036757643,0.000509247,0.00028977767,0.0012249885,0.0005389541,0.0009789142,0.0038570582],"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.0012540714,0.0001131511,0.0023141478,0.0006625334,0.00011624186,0.00056149357,0.00018159814,0.04500661,0.08153052,0.10007781,0.06521306,0.7029688],"study_design_scores_gemma":[0.00033597153,0.0013685992,0.0028872485,0.00032881548,0.00017520082,0.0013859461,0.00011337287,0.31486732,0.14871891,0.038254153,0.4914042,0.00016024774],"about_ca_topic_score_codex":0.0023479615,"about_ca_topic_score_gemma":0.0031289328,"teacher_disagreement_score":0.016424919,"about_ca_system_score_codex":0.00060330814,"about_ca_system_score_gemma":0.00056296395,"threshold_uncertainty_score":0.05494684},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011797431,0.00019192706,0.9849296,0.00012235956,0.000034721645,0.000053443462,0.000020303507,0.0008074152,0.0020427352],"genre_scores_gemma":[0.22630301,0.00045448384,0.7709104,0.00008855682,0.000036024587,0.00017712014,0.000106489955,0.00046812347,0.0014558194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928963,0.00031288445,0.000025937683,0.0000894383,0.0002371189,0.000044867527],"domain_scores_gemma":[0.9988675,0.0006330417,0.000107916414,0.0002041484,0.00015482493,0.00003259777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009157346,0.00073765736,0.00047593054,0.0010026017,0.000679565,0.0008250052,0.0008420741,0.0005825651,0.0013969183],"category_scores_gemma":[0.0027673538,0.00044592118,0.00040555888,0.0012246502,0.0007853268,0.0011139887,0.00095441117,0.00077481417,0.00041587278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089547546,0.0001061857,0.0011976782,0.00018781959,0.00005954734,0.00010854222,0.0002841732,0.6679056,0.033110164,0.038362324,0.0019171423,0.25667128],"study_design_scores_gemma":[0.000017291979,0.00003589182,0.00042110577,0.000012910572,0.000011403921,0.00005573318,0.00004732017,0.9640887,0.011774998,0.018531907,0.004988323,0.000014473338],"about_ca_topic_score_codex":0.0029449402,"about_ca_topic_score_gemma":0.0040593855,"teacher_disagreement_score":0.0029449402,"about_ca_system_score_codex":0.0006562002,"about_ca_system_score_gemma":0.0006432609,"threshold_uncertainty_score":0.00585562},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011594381,0.06510099,0.1182103,0.015970645,0.071925,0.0003646266,0.0047678845,0.0026259802,0.70944023],"genre_scores_gemma":[0.08926602,0.08196777,0.042767152,0.0020877316,0.020277603,0.00033331325,0.0077705313,0.002042019,0.7534878],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991579,0.00008437551,0.000052344352,0.00009415022,0.00054239784,0.00006892075],"domain_scores_gemma":[0.9974605,0.0004281473,0.00010622396,0.00033083605,0.0013549885,0.0003193733],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001315755,0.0007091738,0.0008702132,0.0026857033,0.0007997699,0.0030417992,0.0008636877,0.0011152311,0.100888275],"category_scores_gemma":[0.0021904816,0.00034510955,0.00044686603,0.0027302539,0.0006950267,0.0022070284,0.0012983079,0.0015926696,0.02558633],"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.0001035938,0.0001717232,0.0004595446,0.00074948976,0.000041635598,0.0000651377,0.000043552416,0.002178669,0.006364688,0.06753267,0.5349586,0.38733065],"study_design_scores_gemma":[0.000015295882,0.00007645461,0.0010490548,0.00028644313,0.0000436945,0.0002776493,0.0000442196,0.009866361,0.0056856168,0.03205507,0.9505645,0.000035717894],"about_ca_topic_score_codex":0.0005609053,"about_ca_topic_score_gemma":0.0012689686,"teacher_disagreement_score":0.89911175,"about_ca_system_score_codex":0.0008002289,"about_ca_system_score_gemma":0.0019830596,"threshold_uncertainty_score":0.33750492},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22022861,0.00054021296,0.7739704,0.0003496793,0.000019888465,0.00004669657,0.000074425465,0.00033758208,0.004432457],"genre_scores_gemma":[0.8789127,0.00036721796,0.11898214,0.000047057852,0.000026679227,0.00006679123,0.00007477353,0.00008200682,0.0014406873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995602,0.00016531936,0.00001910634,0.00006785165,0.00011016151,0.00007740711],"domain_scores_gemma":[0.99882394,0.0006865578,0.00019777183,0.00012665027,0.00012692984,0.000038176724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083256286,0.00046493154,0.00048810715,0.00029293096,0.00021641524,0.0004358856,0.00065618736,0.00043777507,0.00073194376],"category_scores_gemma":[0.0033012328,0.000317705,0.00023002678,0.00038651508,0.0005345013,0.001233681,0.00038538114,0.00037658383,0.00014844956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014880646,0.000034116838,0.00031941922,0.00008976151,0.000014279092,0.00006175834,0.00005704098,0.9313023,0.020389084,0.022217365,0.00041212243,0.024953851],"study_design_scores_gemma":[0.000024524112,0.000073614974,0.00013062828,0.000004794077,0.000008752392,0.000021683998,0.000012937911,0.9793793,0.005135381,0.014792951,0.000409463,0.000005989334],"about_ca_topic_score_codex":0.0012057705,"about_ca_topic_score_gemma":0.0011431315,"teacher_disagreement_score":0.0012057705,"about_ca_system_score_codex":0.00052198046,"about_ca_system_score_gemma":0.0010748411,"threshold_uncertainty_score":0.0044030547},"labels":[],"label_agreement":null},{"id":"W4229867184","doi":"10.1145/2714064.2660229","title":"Space-efficient multi-versioning for input-adaptive feedback-driven program optimizations","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"U.S. Department of Energy; International Business Machines Corporation; National Science Foundation","keywords":"Executable; Computer science; Software versioning; Compiler; Heuristic; Code (set theory); Space (punctuation); Set (abstract data type); Function (biology); Programming language; Mathematical optimization; Algorithm; Software; Operating system; Mathematics","score_opus":0.03233717448432247,"score_gpt":0.29041758950844254,"score_spread":0.25808041502412005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229867184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13973717,0.0003199511,0.8532474,0.00014234037,0.00003738298,0.00010554208,0.00006458054,0.004470259,0.0018754359],"genre_scores_gemma":[0.6797939,0.00007957135,0.31834242,0.000075020886,0.000014477012,0.000097181975,0.00012660783,0.00039777253,0.0010730275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911016,0.0003393255,0.00006023206,0.00013906871,0.00022668736,0.00012452826],"domain_scores_gemma":[0.9975688,0.0011650502,0.00022443624,0.00072036084,0.00024131988,0.00008003497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014487408,0.0008098789,0.0007066898,0.0006985139,0.00046725853,0.00066150894,0.0014219838,0.00048560413,0.0013334309],"category_scores_gemma":[0.0042681857,0.00039505662,0.0005988491,0.0006841831,0.00089701667,0.0013809536,0.001301344,0.0010146198,0.00022873272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064057915,0.0002526946,0.0047870283,0.00023694005,0.00006740196,0.00019024203,0.00047583057,0.5230118,0.07079578,0.017082475,0.0021542686,0.380305],"study_design_scores_gemma":[0.000025683481,0.00011767477,0.00035240623,0.000011716084,0.00001749381,0.000038453018,0.00003503275,0.9749435,0.015817305,0.007793011,0.00083591894,0.000011736885],"about_ca_topic_score_codex":0.0011647391,"about_ca_topic_score_gemma":0.0021373548,"teacher_disagreement_score":0.0014487408,"about_ca_system_score_codex":0.00057016296,"about_ca_system_score_gemma":0.0008268704,"threshold_uncertainty_score":0.00766176},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023658343,0.00039889963,0.9672753,0.000102053506,0.000038739538,0.0000466507,0.00008187735,0.00027789368,0.008120268],"genre_scores_gemma":[0.53943264,0.00088681607,0.44993734,0.00009452486,0.00004617229,0.0002750172,0.00033541486,0.00023877746,0.008753234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994848,0.00015316889,0.000025110185,0.00007852454,0.00016303344,0.00009531129],"domain_scores_gemma":[0.9997309,0.00011561598,0.00004301761,0.000044900014,0.00004561283,0.000019954685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049653027,0.00068137527,0.00060391397,0.00036650567,0.00028003016,0.0008447651,0.0008159252,0.00043306433,0.00287935],"category_scores_gemma":[0.0012649093,0.0005228875,0.000414309,0.00053429627,0.00054275006,0.0009234674,0.0005007039,0.0006267826,0.00042743926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004346737,0.000021041047,0.00011524063,0.000056618384,0.000009954568,0.000032986653,0.000023618019,0.94435346,0.00409357,0.031405717,0.00072296127,0.01912129],"study_design_scores_gemma":[0.000010468015,0.000025660744,0.000042788328,0.000004730826,0.000005904144,0.000010705073,0.0000069625694,0.9830366,0.0018331197,0.012966755,0.0020530592,0.0000033280278],"about_ca_topic_score_codex":0.0020380905,"about_ca_topic_score_gemma":0.002582266,"teacher_disagreement_score":0.00287935,"about_ca_system_score_codex":0.0011949679,"about_ca_system_score_gemma":0.0012855944,"threshold_uncertainty_score":0.009632409},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013935075,0.00690341,0.9389041,0.0007052062,0.00040198956,0.00013172741,0.00015718375,0.0067534395,0.03210792],"genre_scores_gemma":[0.12825118,0.0076185833,0.81446713,0.0003547272,0.0003264732,0.00029324487,0.0007348233,0.0034549579,0.044498924],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991173,0.00017142906,0.000065355816,0.00008924796,0.00047010084,0.00008647479],"domain_scores_gemma":[0.99933237,0.00023912589,0.000052572388,0.00022606456,0.00012283582,0.000027027487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009828658,0.00071058504,0.00064650393,0.000597777,0.0005340172,0.0028033508,0.0014621259,0.0007314884,0.0036461689],"category_scores_gemma":[0.0024186992,0.00082329666,0.00060834375,0.0012662002,0.0010875044,0.0019497891,0.0009185773,0.0015417689,0.00173794],"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.0001598107,0.00021385506,0.0007406237,0.0007908847,0.000063036336,0.00013110039,0.00033395612,0.033860087,0.015975324,0.30323908,0.02473853,0.6197537],"study_design_scores_gemma":[0.00012098164,0.00021816762,0.002064967,0.00032228083,0.00017693998,0.0008231585,0.00016581449,0.17529929,0.042731397,0.41622368,0.36176997,0.00008328693],"about_ca_topic_score_codex":0.0013795091,"about_ca_topic_score_gemma":0.0017990523,"teacher_disagreement_score":0.0036461689,"about_ca_system_score_codex":0.0006295888,"about_ca_system_score_gemma":0.0012602948,"threshold_uncertainty_score":0.012197614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13035461,0.0035127278,0.7867868,0.0008693588,0.00080936676,0.0002396665,0.0011065844,0.044847917,0.03147295],"genre_scores_gemma":[0.8466722,0.0020015857,0.12936215,0.0005509765,0.00022252018,0.00027850884,0.0019349406,0.0014056052,0.017571447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992441,0.0001472388,0.00004879521,0.00011162094,0.0002888572,0.0001593562],"domain_scores_gemma":[0.9984226,0.00039977382,0.00009965465,0.000756205,0.00022312101,0.000098575016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068428874,0.00056587136,0.00056766946,0.00034973354,0.0004267374,0.0014345229,0.0018134554,0.00034142734,0.006509945],"category_scores_gemma":[0.0031530214,0.0004292365,0.0003902897,0.00051525194,0.00039679187,0.002101452,0.0017063111,0.0013534958,0.001920194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016764685,0.00045685738,0.016105538,0.0006558612,0.0002973874,0.00072096457,0.0005534299,0.13311525,0.082591735,0.13259454,0.07562232,0.5556096],"study_design_scores_gemma":[0.00014965213,0.00055998436,0.0029761202,0.00010014472,0.00017735161,0.00072005694,0.00016626625,0.63054633,0.14479102,0.03818993,0.18149959,0.00012352467],"about_ca_topic_score_codex":0.0013125752,"about_ca_topic_score_gemma":0.0015035636,"teacher_disagreement_score":0.006509945,"about_ca_system_score_codex":0.00048869866,"about_ca_system_score_gemma":0.0018249159,"threshold_uncertainty_score":0.021777868},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032700745,0.004610397,0.2600842,0.0016725794,0.0016712432,0.00024689705,0.00056592847,0.0042550704,0.7236236],"genre_scores_gemma":[0.05916926,0.010204402,0.1401204,0.0011546,0.0014044134,0.00044585788,0.0022149058,0.0028190417,0.78246707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956995,0.00003778052,0.000016015352,0.00012161834,0.00020351085,0.000051163326],"domain_scores_gemma":[0.99970144,0.000038822167,0.000012184534,0.00013932033,0.00009258192,0.000015635109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034521485,0.0013005388,0.0008186716,0.0008307149,0.00084049563,0.0019271501,0.0014017419,0.00060721353,0.07524373],"category_scores_gemma":[0.00090326555,0.0005949864,0.0007634989,0.0013153364,0.0007905437,0.0025689884,0.001889741,0.0019056594,0.038079377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090096866,0.0000818273,0.00013244,0.0005232227,0.00003294637,0.00009059107,0.00015956008,0.0059015364,0.015540669,0.2670451,0.17870615,0.53169584],"study_design_scores_gemma":[0.000022391374,0.000041205294,0.0002809567,0.000108211505,0.000027098968,0.00027256148,0.000042438598,0.009690488,0.017853959,0.113583155,0.85805714,0.00002034809],"about_ca_topic_score_codex":0.00082625216,"about_ca_topic_score_gemma":0.00090314815,"teacher_disagreement_score":0.07524373,"about_ca_system_score_codex":0.00078365376,"about_ca_system_score_gemma":0.0010126068,"threshold_uncertainty_score":0.25171536},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11127703,0.0021560723,0.83148706,0.0006478125,0.00058264413,0.00029279335,0.0004080959,0.008786994,0.04436145],"genre_scores_gemma":[0.6489972,0.0011818698,0.32329175,0.0004831534,0.00013342462,0.00019691855,0.0006715512,0.00043338755,0.024610722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998673,0.000013825648,0.000008058279,0.000020011763,0.000064501626,0.000026227966],"domain_scores_gemma":[0.9998093,0.000034188775,0.000021736556,0.000046723337,0.00005480927,0.000033250348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026537044,0.0004210273,0.00025462086,0.00032430413,0.00031144463,0.00061556604,0.0010484263,0.0003854412,0.0051226234],"category_scores_gemma":[0.00043135096,0.0002659999,0.00030350016,0.00032864817,0.0005110742,0.0010302671,0.0007706996,0.0010289375,0.0012353449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072276214,0.00038689142,0.0027937486,0.0004195055,0.00010792499,0.0006805968,0.0003426119,0.27443886,0.16218834,0.3091782,0.027975215,0.22076538],"study_design_scores_gemma":[0.00008870015,0.0005763559,0.00051762204,0.00008388676,0.00004372093,0.00028001404,0.000039482034,0.7844338,0.06261455,0.06526571,0.08598531,0.00007079546],"about_ca_topic_score_codex":0.0009437801,"about_ca_topic_score_gemma":0.0016514937,"teacher_disagreement_score":0.0051226234,"about_ca_system_score_codex":0.00050432154,"about_ca_system_score_gemma":0.0007910388,"threshold_uncertainty_score":0.017136931},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041000687,0.0033772276,0.5696348,0.002029249,0.0013937257,0.00057714415,0.004684972,0.071466126,0.30583605],"genre_scores_gemma":[0.32699394,0.002652456,0.46652102,0.0015083757,0.0003354213,0.0008274441,0.014847846,0.007680639,0.17863286],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993849,0.000052727744,0.000047708607,0.00011023825,0.0003296858,0.00007487058],"domain_scores_gemma":[0.9990977,0.00013857173,0.000058773076,0.00036466544,0.00027704367,0.000063283594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043231298,0.00068105914,0.00044330108,0.0006175466,0.000733374,0.0016740845,0.0016950348,0.0008891209,0.033156328],"category_scores_gemma":[0.0021991828,0.0004935975,0.0007346478,0.00057598663,0.000565245,0.0022931776,0.0015883067,0.0010658965,0.012006293],"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.0006570676,0.000153176,0.0028785395,0.0007049605,0.00009778987,0.00036367768,0.00047929768,0.029392831,0.035283156,0.24456576,0.25164345,0.43378028],"study_design_scores_gemma":[0.00015267979,0.00020485479,0.0009577984,0.00009526687,0.000051145802,0.0006350304,0.00007527804,0.09272982,0.019237107,0.04634081,0.8394391,0.00008125854],"about_ca_topic_score_codex":0.0020286844,"about_ca_topic_score_gemma":0.0025514972,"teacher_disagreement_score":0.033156328,"about_ca_system_score_codex":0.000704053,"about_ca_system_score_gemma":0.00097145577,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27520543,0.0008826526,0.576892,0.0007778458,0.00035038666,0.00025187078,0.0012147654,0.09362575,0.050799362],"genre_scores_gemma":[0.596224,0.0002673724,0.38119224,0.00034109084,0.000041661977,0.0003797699,0.0026010172,0.005751741,0.013201202],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99904317,0.00015886307,0.00006973546,0.000117012896,0.00045434912,0.00015679828],"domain_scores_gemma":[0.9978638,0.0004221646,0.0001133564,0.0005721411,0.00089637196,0.00013221789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081445556,0.00074258714,0.0005785884,0.00051879947,0.00071485154,0.0013843225,0.0027000823,0.00075687986,0.004731177],"category_scores_gemma":[0.0037626314,0.0005003442,0.0005132728,0.0009728933,0.0005793397,0.0010565604,0.0009401758,0.00120749,0.001974758],"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.0024711639,0.000675662,0.01667373,0.0007426224,0.00026528077,0.002029283,0.001818426,0.276409,0.1253023,0.055971555,0.12733805,0.39030293],"study_design_scores_gemma":[0.00019012112,0.0001827331,0.00320135,0.000061965286,0.000041710573,0.00024389042,0.0001288735,0.87837344,0.052810848,0.007663011,0.057019822,0.000082250604],"about_ca_topic_score_codex":0.01284562,"about_ca_topic_score_gemma":0.018474482,"teacher_disagreement_score":0.01284562,"about_ca_system_score_codex":0.0015545749,"about_ca_system_score_gemma":0.0025837547,"threshold_uncertainty_score":0.025541663},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14307396,0.00035779164,0.843374,0.00013437137,0.000044494416,0.00010654699,0.00027796524,0.00921944,0.0034114309],"genre_scores_gemma":[0.5831729,0.00037782517,0.40642065,0.00014574893,0.000052045405,0.00021401465,0.0008699353,0.0040188245,0.0047280155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998792,0.00025094065,0.00007197252,0.00026435443,0.00047020058,0.00015067318],"domain_scores_gemma":[0.9965044,0.0017951819,0.00031941093,0.0007288207,0.000580974,0.00007109018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084946014,0.0008510456,0.0006967753,0.0010328203,0.000716824,0.0015210059,0.00095520203,0.0004990689,0.0033311774],"category_scores_gemma":[0.0044423887,0.00040355904,0.0012149445,0.0010740955,0.00086594216,0.0018854773,0.0009363796,0.0009581886,0.0005359948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012329777,0.00037544034,0.017987024,0.001217509,0.00037784333,0.00109235,0.0012061469,0.073394425,0.3721283,0.043073222,0.0062503554,0.48166442],"study_design_scores_gemma":[0.000116255986,0.00048882014,0.015395863,0.00014501583,0.00036895918,0.00083503115,0.0004247717,0.58329445,0.32951343,0.05059348,0.018699713,0.00012427176],"about_ca_topic_score_codex":0.0010512633,"about_ca_topic_score_gemma":0.0011580085,"teacher_disagreement_score":0.0033311774,"about_ca_system_score_codex":0.00045933897,"about_ca_system_score_gemma":0.0014958227,"threshold_uncertainty_score":0.011143923},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016918693,0.00062291336,0.9028946,0.00035603883,0.0005403425,0.00034460123,0.00038855476,0.058603372,0.019330775],"genre_scores_gemma":[0.1549419,0.0005934232,0.7872434,0.00062991626,0.00030964325,0.0005610055,0.0011227468,0.028739331,0.025858527],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998497,0.0001769612,0.000084374406,0.00025310693,0.00086060335,0.00012798511],"domain_scores_gemma":[0.9983956,0.0004752318,0.00015507889,0.00060665223,0.00030768,0.000059710284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007184035,0.0007200694,0.0005231894,0.001069762,0.00077066314,0.0009063092,0.0010517857,0.00060902775,0.0069836117],"category_scores_gemma":[0.0033015953,0.00063744484,0.00084628066,0.0007454594,0.0009292645,0.0009717076,0.0015001434,0.001867198,0.0042071193],"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.00037929733,0.00017060991,0.0028524075,0.0008647884,0.000137198,0.00051990134,0.0008165872,0.00858876,0.15963621,0.04834412,0.06387268,0.7138174],"study_design_scores_gemma":[0.0002745033,0.00042481738,0.0045478195,0.00023405778,0.00013825513,0.0019126474,0.00010355235,0.08050183,0.30392778,0.045619715,0.56217664,0.00013837792],"about_ca_topic_score_codex":0.00068089727,"about_ca_topic_score_gemma":0.0009548777,"teacher_disagreement_score":0.0069836117,"about_ca_system_score_codex":0.00033404285,"about_ca_system_score_gemma":0.00094452366,"threshold_uncertainty_score":0.023362517},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18085763,0.00122497,0.81088024,0.00020265885,0.000116100266,0.00006156062,0.000057814195,0.0027410341,0.0038580017],"genre_scores_gemma":[0.78218704,0.00046076576,0.21527791,0.00009828689,0.00003112749,0.00010576228,0.00009268241,0.00018042211,0.0015659591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998179,0.000044373286,0.000010976864,0.000042722764,0.00005149144,0.00003254643],"domain_scores_gemma":[0.9998155,0.00004729712,0.0000419764,0.00004583245,0.00003547607,0.000013897214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020214678,0.00048385368,0.00031020862,0.00036143462,0.00032833315,0.000452777,0.0006387536,0.00034338562,0.0006317601],"category_scores_gemma":[0.00044890164,0.0002423465,0.0004417906,0.0003416696,0.00027092462,0.0004063528,0.00044955965,0.00038434338,0.00018635845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031993174,0.000121994075,0.002003267,0.00017156621,0.00008224845,0.00020890133,0.00021906213,0.6007988,0.18892993,0.0054370738,0.0023060255,0.19940118],"study_design_scores_gemma":[0.000017424085,0.000097334094,0.0010313834,0.000007631345,0.0000223979,0.00009656438,0.000029167719,0.96913135,0.024652367,0.0022335085,0.0026608938,0.00001998222],"about_ca_topic_score_codex":0.0018440937,"about_ca_topic_score_gemma":0.0026762711,"teacher_disagreement_score":0.0018440937,"about_ca_system_score_codex":0.00037485833,"about_ca_system_score_gemma":0.0004984069,"threshold_uncertainty_score":0.0036667585},"labels":[],"label_agreement":null},{"id":"W4232351578","doi":"10.1145/1168918.1168908","title":"A probabilistic pointer analysis for speculative optimizations","year":2006,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Pointer analysis; Computer science; Pointer (user interface); Abstract interpretation; Optimizing compiler; Compiler; Correctness; Probabilistic logic; Test suite; Static analysis; Theoretical computer science; Algorithm; Program analysis; Programming language; Parallel computing; Test case; Artificial intelligence","score_opus":0.021831917528158967,"score_gpt":0.2729642003128487,"score_spread":0.2511322827846897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232351578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008725762,0.00010653297,0.9883739,0.00013478208,0.000017647302,0.00003297881,0.00008205001,0.0017076059,0.0008188027],"genre_scores_gemma":[0.33959338,0.00028720126,0.6565861,0.00017164182,0.00011017758,0.00020762839,0.0002824127,0.0005887909,0.0021726517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981806,0.00039382084,0.0000904137,0.00027375677,0.000946723,0.0001146951],"domain_scores_gemma":[0.99546415,0.0023856927,0.0004378636,0.0009376742,0.00070860854,0.00006608101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016973523,0.00095264177,0.00076004275,0.0024704246,0.0012412646,0.0014943457,0.0017184927,0.0009013175,0.0025699316],"category_scores_gemma":[0.013014352,0.00090858666,0.0010187747,0.001891447,0.0011828103,0.0034189522,0.001601636,0.0017570542,0.0007742381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002654589,0.000099672856,0.005429986,0.00014272127,0.000078662575,0.0001245912,0.0001974962,0.456233,0.017181246,0.22799784,0.004841596,0.28740776],"study_design_scores_gemma":[0.000006769505,0.0000231615,0.0002487269,0.000009895367,0.000016729458,0.000027948654,0.0000066688326,0.95226973,0.0027822414,0.04314847,0.0014426332,0.000017048715],"about_ca_topic_score_codex":0.0037174642,"about_ca_topic_score_gemma":0.0038214307,"teacher_disagreement_score":0.0037174642,"about_ca_system_score_codex":0.0012301052,"about_ca_system_score_gemma":0.0033879345,"threshold_uncertainty_score":0.008976519},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01083649,0.0013791638,0.110711165,0.0022435258,0.002518087,0.0007748672,0.010678885,0.10980439,0.75105333],"genre_scores_gemma":[0.056666695,0.0011947942,0.06054109,0.001809917,0.00060478813,0.00047913817,0.02673568,0.010575478,0.8413924],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992926,0.0000744246,0.00004240521,0.00014772952,0.0003487717,0.00009401585],"domain_scores_gemma":[0.9986547,0.00014695841,0.00006971412,0.00044179763,0.00049404247,0.00019268137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068903837,0.0011589625,0.00059171877,0.0013967368,0.0009929693,0.0025184099,0.0019032973,0.0014098852,0.40940833],"category_scores_gemma":[0.002059546,0.00056011544,0.0004281066,0.0011259072,0.00036284336,0.0022562237,0.0026200314,0.0013018827,0.31214496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005296837,0.00018918279,0.001345198,0.0003557899,0.000028083348,0.00029143997,0.00015876438,0.0013339265,0.017860217,0.01784166,0.53551346,0.42455256],"study_design_scores_gemma":[0.00005442663,0.000111927926,0.00092895114,0.000048915506,0.0000098282035,0.00025654078,0.000043620643,0.0043600225,0.0070673097,0.0034557453,0.98363864,0.000024129384],"about_ca_topic_score_codex":0.0010643257,"about_ca_topic_score_gemma":0.0015905595,"teacher_disagreement_score":0.40940833,"about_ca_system_score_codex":0.00057675026,"about_ca_system_score_gemma":0.0010144114,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006695531,0.00021745074,0.9836315,0.00030668834,0.00004473305,0.000095076866,0.00012543266,0.0013258075,0.007557682],"genre_scores_gemma":[0.27911866,0.0005586099,0.7079763,0.00040127846,0.000102053025,0.0003895243,0.00047890018,0.0009929867,0.009981747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755365,0.0007256038,0.00025665082,0.00042000212,0.0007842086,0.0002598342],"domain_scores_gemma":[0.9972345,0.0009642115,0.00017043731,0.0009551572,0.00056152535,0.00011420097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035712658,0.0007179138,0.00046619505,0.0011125369,0.00083648553,0.0021777838,0.0019268427,0.0010485767,0.004850756],"category_scores_gemma":[0.0045053614,0.00072573434,0.0018476907,0.0008647322,0.0025016956,0.0055649327,0.0036133926,0.00245556,0.0009940213],"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.00005275675,0.00002311428,0.00020400081,0.00012962951,0.000015994907,0.00011622508,0.000592319,0.0070293657,0.0048984787,0.9632386,0.0010744769,0.022625012],"study_design_scores_gemma":[0.00004539893,0.00005889161,0.0001265748,0.000074212185,0.00004840971,0.00016294428,0.00013476412,0.04325923,0.009180761,0.8948116,0.05205639,0.000040782055],"about_ca_topic_score_codex":0.0017684823,"about_ca_topic_score_gemma":0.002403691,"teacher_disagreement_score":0.004850756,"about_ca_system_score_codex":0.0013946227,"about_ca_system_score_gemma":0.0014511807,"threshold_uncertainty_score":0.018886924},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014677214,0.00034883653,0.97287357,0.00022148059,0.000022817176,0.00008618564,0.00012810931,0.006805016,0.0048367856],"genre_scores_gemma":[0.45393664,0.0004978365,0.534606,0.0002804155,0.00017036403,0.00044854943,0.00071086566,0.0026316168,0.006717823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759644,0.0005838892,0.00012723723,0.00031327404,0.0011810617,0.00019813667],"domain_scores_gemma":[0.99494016,0.0027384358,0.0005033676,0.00080512743,0.00093376025,0.000079200014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013598858,0.0006122176,0.00062936766,0.0020980572,0.0015486903,0.0010510534,0.0010842341,0.00050707534,0.004732253],"category_scores_gemma":[0.010887719,0.00039599248,0.0008373561,0.0017418532,0.001151722,0.0017657123,0.0013108541,0.0016632228,0.0012792776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079108664,0.00020187642,0.005714415,0.000578731,0.0001180926,0.00039030032,0.0006916154,0.24823081,0.023222001,0.2453915,0.017665781,0.45700374],"study_design_scores_gemma":[0.00006707559,0.000078496894,0.0011047927,0.00005252341,0.000046245423,0.00018700465,0.000091477785,0.792293,0.01976612,0.17263997,0.013618937,0.00005430957],"about_ca_topic_score_codex":0.0065870034,"about_ca_topic_score_gemma":0.004445251,"teacher_disagreement_score":0.0065870034,"about_ca_system_score_codex":0.0014073718,"about_ca_system_score_gemma":0.0015602792,"threshold_uncertainty_score":0.015830934},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037501063,0.00072040956,0.89474714,0.00024655377,0.00012722111,0.00018143811,0.00030554167,0.060696255,0.0054742745],"genre_scores_gemma":[0.5030623,0.00047377747,0.48487887,0.00040180702,0.000087886176,0.00040227573,0.00074668066,0.00451881,0.0054276264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795204,0.00038106405,0.000129585,0.0003652428,0.0009305789,0.00024158279],"domain_scores_gemma":[0.9964431,0.0013508287,0.00059569906,0.0011375714,0.00034669496,0.00012606687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014474769,0.001118175,0.000718701,0.0014518035,0.00047386106,0.0012807649,0.002687,0.00060551765,0.0032719744],"category_scores_gemma":[0.0067184507,0.00078535225,0.00046646348,0.0009627486,0.0010690422,0.0024291559,0.0022315152,0.001576952,0.0009753894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015525381,0.0007404495,0.010798777,0.0008068815,0.00018920262,0.0003237096,0.00052999816,0.11240332,0.17392348,0.03562441,0.025447909,0.63765925],"study_design_scores_gemma":[0.00018952295,0.0003584321,0.003105304,0.00007685198,0.00008118163,0.0003406274,0.00008184644,0.75545305,0.19688615,0.012737836,0.030544514,0.00014471955],"about_ca_topic_score_codex":0.0015052331,"about_ca_topic_score_gemma":0.0026627812,"teacher_disagreement_score":0.0032719744,"about_ca_system_score_codex":0.00095267635,"about_ca_system_score_gemma":0.0014488236,"threshold_uncertainty_score":0.010945797},"labels":[],"label_agreement":null},{"id":"W4232927598","doi":"10.1145/2578856.2508174","title":"Optimizing MATLAB feval with dynamic techniques","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; MATLAB; Solver; Function (biology); Interpreter; Programming language; Argument (complex analysis); Computational science; Feature (linguistics); Computer engineering; Algorithm; Parallel computing","score_opus":0.011059474827654077,"score_gpt":0.24610750590728117,"score_spread":0.2350480310796271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232927598","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061546456,0.0005105333,0.8759321,0.00042857512,0.00012255136,0.000056734734,0.00017114541,0.029108874,0.03212308],"genre_scores_gemma":[0.51528007,0.00031896622,0.4610952,0.0003669735,0.000075915894,0.00013715505,0.00060538505,0.006143877,0.015976382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999154,0.00015538374,0.000053085405,0.00011631568,0.0003667591,0.00015443927],"domain_scores_gemma":[0.9985869,0.00066712074,0.00012656394,0.0003084991,0.00026417768,0.00004683286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065522006,0.0008481931,0.00043469784,0.0005689069,0.000415637,0.0011717778,0.0012681705,0.00048734702,0.008028083],"category_scores_gemma":[0.004149732,0.00036461075,0.00054320216,0.0005484183,0.0007181389,0.0013609844,0.0012639734,0.0008085238,0.002744937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008311805,0.00019633987,0.005708799,0.000558154,0.00007913172,0.00063639664,0.00048324413,0.31890965,0.06789628,0.08160189,0.0242568,0.49884206],"study_design_scores_gemma":[0.00010315276,0.00013062483,0.0010568952,0.00006781588,0.00004567939,0.00037798917,0.00011282147,0.86989355,0.07007718,0.012873245,0.045217607,0.000043383003],"about_ca_topic_score_codex":0.0020916625,"about_ca_topic_score_gemma":0.0036298232,"teacher_disagreement_score":0.008028083,"about_ca_system_score_codex":0.0007204895,"about_ca_system_score_gemma":0.0011523057,"threshold_uncertainty_score":0.02685666},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01773496,0.0024618346,0.95333475,0.00076615845,0.00026418376,0.00044569728,0.0017789763,0.004026469,0.019186934],"genre_scores_gemma":[0.2099748,0.0017223808,0.77525073,0.00028228725,0.00022078474,0.0021943217,0.0036254495,0.0015832246,0.0051461486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99164295,0.0018133054,0.0012342741,0.0008727118,0.004123167,0.00031361612],"domain_scores_gemma":[0.98866165,0.0038666283,0.0023397733,0.0018031911,0.0029703153,0.00035835488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004409565,0.0013743169,0.00076162623,0.0057609784,0.0010609961,0.0035374674,0.0012103089,0.0009799363,0.0028148768],"category_scores_gemma":[0.035587955,0.0004908111,0.0008484801,0.0065049413,0.0013979531,0.004829451,0.002864552,0.0017335677,0.0010372768],"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.000101005484,0.00011888387,0.0058606444,0.0006781165,0.000075516036,0.00012974122,0.00071138074,0.056492437,0.011142275,0.578131,0.015711693,0.3308472],"study_design_scores_gemma":[0.00003489221,0.00046088366,0.008683797,0.0003558211,0.0000638372,0.0005654369,0.00037168482,0.2203297,0.009700667,0.55826026,0.20099917,0.00017389478],"about_ca_topic_score_codex":0.0037162972,"about_ca_topic_score_gemma":0.0031196848,"teacher_disagreement_score":0.0057609784,"about_ca_system_score_codex":0.0022450641,"about_ca_system_score_gemma":0.0017423839,"threshold_uncertainty_score":0.023320317},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011594381,0.06510099,0.1182103,0.015970645,0.071925,0.0003646266,0.0047678845,0.0026259802,0.70944023],"genre_scores_gemma":[0.08926602,0.08196777,0.042767152,0.0020877316,0.020277603,0.00033331325,0.0077705313,0.002042019,0.7534878],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991579,0.00008437551,0.000052344352,0.00009415022,0.00054239784,0.00006892075],"domain_scores_gemma":[0.9974605,0.0004281473,0.00010622396,0.00033083605,0.0013549885,0.0003193733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001315755,0.0007091738,0.0008702132,0.0026857033,0.0007997699,0.0030417992,0.0008636877,0.0011152311,0.100888275],"category_scores_gemma":[0.0021904816,0.00034510955,0.00044686603,0.0027302539,0.0006950267,0.0022070284,0.0012983079,0.0015926696,0.02558633],"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.0001035938,0.0001717232,0.0004595446,0.00074948976,0.000041635598,0.0000651377,0.000043552416,0.002178669,0.006364688,0.06753267,0.5349586,0.38733065],"study_design_scores_gemma":[0.000015295882,0.00007645461,0.0010490548,0.00028644313,0.0000436945,0.0002776493,0.0000442196,0.009866361,0.0056856168,0.03205507,0.9505645,0.000035717894],"about_ca_topic_score_codex":0.0005609053,"about_ca_topic_score_gemma":0.0012689686,"teacher_disagreement_score":0.100888275,"about_ca_system_score_codex":0.0008002289,"about_ca_system_score_gemma":0.0019830596,"threshold_uncertainty_score":0.33750492},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024414292,0.000119826414,0.97298807,0.000077448574,0.00003667886,0.000038928218,0.000053334352,0.0010028036,0.0012685806],"genre_scores_gemma":[0.38169673,0.00016376442,0.61406046,0.00009666681,0.000034207147,0.00021127347,0.00031935572,0.00032037933,0.0030971416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996087,0.00006975804,0.000025737054,0.00005339559,0.0001830702,0.00005944825],"domain_scores_gemma":[0.99898094,0.00038609884,0.000071598006,0.00020967622,0.0003052249,0.000046486697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005639948,0.0005060534,0.0007647539,0.00062496593,0.0005158748,0.0007723362,0.0014680176,0.0006989784,0.0027654043],"category_scores_gemma":[0.0022881853,0.00037012433,0.0005051909,0.00076432363,0.00035418337,0.0012740253,0.00047869273,0.0007274848,0.00055798935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023328926,0.00008802905,0.0021315785,0.000064899206,0.00005655128,0.00007943371,0.00009527883,0.8761341,0.014365287,0.017917052,0.0021585878,0.08667597],"study_design_scores_gemma":[0.000007313265,0.000009601654,0.000051834024,0.0000014962254,0.0000032625142,0.0000053191798,0.0000021087005,0.9968791,0.0016673513,0.000954652,0.0004155455,0.0000024657672],"about_ca_topic_score_codex":0.008697946,"about_ca_topic_score_gemma":0.0057706637,"teacher_disagreement_score":0.008697946,"about_ca_system_score_codex":0.0007712179,"about_ca_system_score_gemma":0.0012577693,"threshold_uncertainty_score":0.017294645},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13079633,0.0036271324,0.72164637,0.0012023923,0.00125657,0.0005078953,0.0033774097,0.0656231,0.07196281],"genre_scores_gemma":[0.6461853,0.00082665257,0.28047648,0.0018210852,0.00023149379,0.0005511618,0.0062794406,0.002860803,0.060767658],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994137,0.00007409105,0.00003798135,0.00012442315,0.0002416378,0.000108095555],"domain_scores_gemma":[0.9986319,0.0001446134,0.00012304225,0.0005061179,0.00046008697,0.0001340809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003690893,0.0006445632,0.00063381606,0.0007409962,0.00050219713,0.0012816474,0.00257545,0.0007108702,0.019228304],"category_scores_gemma":[0.0015906518,0.0006685217,0.00046721622,0.0009982602,0.0005606368,0.0020914944,0.0014505743,0.00086994836,0.0058143204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004125268,0.0004934515,0.0050752675,0.001103449,0.00019786034,0.0007795436,0.00035347545,0.054429684,0.29778117,0.05214536,0.14950149,0.43401405],"study_design_scores_gemma":[0.00053623406,0.0036237473,0.004675701,0.00014261836,0.00018390852,0.0023679913,0.00009416968,0.34744483,0.21097134,0.0236688,0.40603057,0.0002600499],"about_ca_topic_score_codex":0.0018697513,"about_ca_topic_score_gemma":0.0022688718,"teacher_disagreement_score":0.019228304,"about_ca_system_score_codex":0.0010760106,"about_ca_system_score_gemma":0.0013926625,"threshold_uncertainty_score":0.064325094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2766392,0.006486553,0.62664336,0.011607698,0.0003284442,0.00008711454,0.00024807407,0.00085436396,0.0771052],"genre_scores_gemma":[0.9570816,0.0016898212,0.03159373,0.00043782435,0.00037800113,0.00011459616,0.00008552934,0.0002991389,0.00831971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976235,0.00078469526,0.00009194411,0.0004563897,0.0006492628,0.00039428027],"domain_scores_gemma":[0.97111547,0.022180034,0.0013448474,0.0033370506,0.0010175692,0.0010050237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034546084,0.0007311877,0.0011326942,0.0011781451,0.0018180644,0.0027259158,0.0016826359,0.0015528832,0.004803277],"category_scores_gemma":[0.03564083,0.0007969703,0.0010832507,0.0011910666,0.008518332,0.0091716675,0.004567232,0.0064142914,0.000459591],"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.000102720085,0.000028115794,0.00046220535,0.000057668793,0.000012418023,0.00006366179,0.00020448113,0.01752379,0.0012370473,0.96981794,0.00076746015,0.009722413],"study_design_scores_gemma":[0.00001090617,0.000017225542,0.000173515,0.000008875309,0.0000056897115,0.00002358248,0.000023061779,0.046123542,0.00041202325,0.9522358,0.00095717266,0.000008482709],"about_ca_topic_score_codex":0.0023166796,"about_ca_topic_score_gemma":0.0011145655,"teacher_disagreement_score":0.004803277,"about_ca_system_score_codex":0.0014439017,"about_ca_system_score_gemma":0.0013382625,"threshold_uncertainty_score":0.018269956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010636336,0.00045051237,0.96143097,0.0002219034,0.000100594436,0.00010599861,0.000190924,0.009870496,0.016992263],"genre_scores_gemma":[0.15143399,0.00052182167,0.83637327,0.0003446601,0.000052546944,0.00022378835,0.0005103537,0.0022102855,0.008329249],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99949086,0.00010092837,0.00003474751,0.000061897714,0.00024677828,0.000064770145],"domain_scores_gemma":[0.9995278,0.00017768261,0.000041356256,0.00011057444,0.000119215736,0.000023320246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005079599,0.00076559494,0.000382685,0.00059725024,0.00032572265,0.0012423239,0.0010149465,0.0004979823,0.009749786],"category_scores_gemma":[0.001177681,0.00053428096,0.0005501434,0.0004003341,0.0005419132,0.000978241,0.0007013735,0.0011686878,0.002320387],"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.00044788557,0.00021143486,0.001162828,0.0009450362,0.00011115741,0.00041966155,0.0003726197,0.2751971,0.109219916,0.12636524,0.02293087,0.46261632],"study_design_scores_gemma":[0.00021184603,0.00043697868,0.0004787202,0.000234553,0.00008179481,0.00029561677,0.00007470743,0.6104618,0.15642126,0.07268247,0.15853845,0.00008189659],"about_ca_topic_score_codex":0.0013320715,"about_ca_topic_score_gemma":0.0019732341,"teacher_disagreement_score":0.009749786,"about_ca_system_score_codex":0.0005860279,"about_ca_system_score_gemma":0.0010484338,"threshold_uncertainty_score":0.032616317},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0757118,0.00053858897,0.9024543,0.00036133538,0.00023876253,0.00013347765,0.00020517314,0.0026098685,0.01774671],"genre_scores_gemma":[0.5293271,0.00036758347,0.45248106,0.00036316866,0.00017656149,0.00019655502,0.0006229396,0.00047178424,0.015993223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919206,0.00006966468,0.00003083349,0.00015591142,0.0003877326,0.00016382831],"domain_scores_gemma":[0.9988703,0.00012960742,0.00011715187,0.0004260917,0.00038007915,0.00007676372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030882526,0.0005278131,0.00054769276,0.0009703452,0.0009678403,0.00080602866,0.0019469268,0.00065078953,0.0044993195],"category_scores_gemma":[0.0016669545,0.0002658934,0.00035900332,0.0012465233,0.00049397093,0.0011370936,0.0012652237,0.0006950109,0.0015872575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005192342,0.0003491438,0.0049851094,0.00025232267,0.00010469222,0.0002716438,0.0003475729,0.1944683,0.08929483,0.07446356,0.023191426,0.6117521],"study_design_scores_gemma":[0.00008923846,0.00031991798,0.0030634827,0.000032779382,0.00007175732,0.0010491597,0.00016202313,0.7939556,0.06046059,0.053771846,0.08692906,0.00009457181],"about_ca_topic_score_codex":0.002538555,"about_ca_topic_score_gemma":0.0041067004,"teacher_disagreement_score":0.0044993195,"about_ca_system_score_codex":0.0007426097,"about_ca_system_score_gemma":0.0009992132,"threshold_uncertainty_score":0.0150517225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12711985,0.00029436313,0.8322159,0.0002654315,0.00018226648,0.00033082662,0.0023965186,0.02029848,0.016896272],"genre_scores_gemma":[0.44351432,0.00049319473,0.5333041,0.00017455257,0.000044509863,0.00067906315,0.0043708594,0.0012669823,0.016152471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982244,0.00002634893,0.000012368966,0.000021012207,0.000097334465,0.000020400914],"domain_scores_gemma":[0.9995919,0.00014479262,0.00003911058,0.00010393068,0.000093773,0.00002657449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003062863,0.00040461143,0.00030793383,0.00032827366,0.0001790237,0.00032927573,0.0011032947,0.0005749996,0.0035557281],"category_scores_gemma":[0.0010074505,0.00036121692,0.00045330886,0.00028151314,0.00022615927,0.00049366005,0.00046071873,0.0008517124,0.0007444953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011572395,0.000087090506,0.0014613485,0.00013081542,0.000057976948,0.00020812779,0.00012287003,0.8762872,0.050124872,0.023083292,0.006426302,0.0418944],"study_design_scores_gemma":[0.000033759057,0.00005147455,0.00023622335,0.000003932356,0.000013053077,0.000040983356,0.0000041639214,0.9784388,0.008596759,0.0021384684,0.010433737,0.000008527417],"about_ca_topic_score_codex":0.0018924564,"about_ca_topic_score_gemma":0.0023816116,"teacher_disagreement_score":0.0035557281,"about_ca_system_score_codex":0.0002797748,"about_ca_system_score_gemma":0.00088560744,"threshold_uncertainty_score":0.011895061},"labels":[],"label_agreement":null},{"id":"W4234392300","doi":"10.1145/1353536.1346301","title":"Predictor virtualization","year":2008,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Virtualization; Memory hierarchy; Cache; Table (database); Operating system; Parallel computing; Embedded system; Database","score_opus":0.02957593603139608,"score_gpt":0.2567839502200828,"score_spread":0.22720801418868675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234392300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16197336,0.0025571303,0.7460136,0.000830621,0.00084993185,0.00026478502,0.0013560685,0.05427943,0.031875145],"genre_scores_gemma":[0.8741291,0.0012460924,0.10246206,0.00057568407,0.000188157,0.0002830007,0.0020505586,0.0015365916,0.017528607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999228,0.00014216661,0.000053289456,0.000119862285,0.00028061023,0.00017610837],"domain_scores_gemma":[0.99838626,0.00039801683,0.00009794276,0.0007771676,0.0002300539,0.00011056018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006325235,0.00061183603,0.00054762856,0.0003532656,0.0004278518,0.0013884988,0.0019058915,0.00034551893,0.007674374],"category_scores_gemma":[0.0030938718,0.000457438,0.00039006898,0.0004557267,0.00040828573,0.002150374,0.0018432207,0.0013431995,0.0020420018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022690643,0.00058274844,0.019896407,0.00068645395,0.0003336489,0.0009612608,0.00072035287,0.14240634,0.09857352,0.124453686,0.087105915,0.5220106],"study_design_scores_gemma":[0.00017147603,0.00061651744,0.0028868252,0.00009063909,0.00018066679,0.00067325745,0.00017638018,0.63522255,0.16095513,0.033627838,0.16527347,0.0001252573],"about_ca_topic_score_codex":0.0013831768,"about_ca_topic_score_gemma":0.0016393547,"teacher_disagreement_score":0.007674374,"about_ca_system_score_codex":0.0004972203,"about_ca_system_score_gemma":0.0018390074,"threshold_uncertainty_score":0.02567333},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12911637,0.00048467563,0.8525657,0.0003632449,0.00017991825,0.00013783002,0.00010832773,0.0076263165,0.009417634],"genre_scores_gemma":[0.5947939,0.000193101,0.39417586,0.00034918587,0.000109688284,0.00010911132,0.0002652517,0.00044093668,0.009562986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995858,0.00003597681,0.000015083499,0.0000624163,0.00022454071,0.00007612225],"domain_scores_gemma":[0.9993376,0.000090543355,0.00007584699,0.00022076324,0.0002117846,0.000063318046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026117364,0.0005537001,0.000363838,0.00053514866,0.0006786983,0.00065791135,0.0020409275,0.000536786,0.0028716773],"category_scores_gemma":[0.00085641304,0.0003050274,0.00024753218,0.0006259233,0.00035063026,0.00083729415,0.00065824436,0.00076422095,0.0011563606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001090871,0.00062136527,0.003799016,0.00025896216,0.00008185053,0.00029545047,0.0002960734,0.1161994,0.24354261,0.01574669,0.015477099,0.6025906],"study_design_scores_gemma":[0.00013272428,0.00062148244,0.0024580515,0.000022975944,0.00006066323,0.00040717915,0.00007815371,0.724112,0.23403108,0.01100958,0.026993578,0.00007260784],"about_ca_topic_score_codex":0.0013463655,"about_ca_topic_score_gemma":0.0032377306,"teacher_disagreement_score":0.0028716773,"about_ca_system_score_codex":0.00052761845,"about_ca_system_score_gemma":0.0006259352,"threshold_uncertainty_score":0.009606659},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026661413,0.0057308865,0.18516487,0.0034144567,0.004423784,0.00039650436,0.004522631,0.01350829,0.7561771],"genre_scores_gemma":[0.35276845,0.0044900044,0.11317768,0.003866892,0.0009930986,0.0006144271,0.0178567,0.0028854206,0.50334734],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991547,0.000068427886,0.000030252251,0.00015403428,0.00044619184,0.00014644956],"domain_scores_gemma":[0.99932516,0.00006156274,0.00003107066,0.00020746798,0.0003062773,0.00006847919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075626274,0.00058704504,0.00051729416,0.0008258775,0.0009929211,0.0021199228,0.0013308959,0.0011935527,0.089757524],"category_scores_gemma":[0.0013875504,0.0003333007,0.00055271015,0.0008924944,0.00040523196,0.0018780768,0.0021309785,0.0011745084,0.04023115],"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.0006423404,0.00014967947,0.0026979821,0.00058514206,0.00008379859,0.0004899313,0.0002494795,0.0100492835,0.03956247,0.13724269,0.31351182,0.49473536],"study_design_scores_gemma":[0.00006546847,0.00018739483,0.0013444294,0.000084256135,0.000029447781,0.0005199017,0.000095190044,0.014274757,0.024461772,0.020978354,0.9379162,0.00004295239],"about_ca_topic_score_codex":0.0016569779,"about_ca_topic_score_gemma":0.002116381,"teacher_disagreement_score":0.089757524,"about_ca_system_score_codex":0.0010746036,"about_ca_system_score_gemma":0.0013349532,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057102043,0.0020488221,0.61786085,0.0013213757,0.0011928111,0.0014066509,0.0046486487,0.08318515,0.23123361],"genre_scores_gemma":[0.4834767,0.0011782991,0.35147265,0.0027334539,0.000562282,0.0012373667,0.014697477,0.010114061,0.13452776],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99803394,0.00019788489,0.00013004753,0.00034777707,0.0009842095,0.00030615184],"domain_scores_gemma":[0.99381375,0.0005790893,0.0002647181,0.0033245946,0.001836702,0.00018119457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011479749,0.0008691844,0.0007154165,0.0011150865,0.0010213348,0.0019479647,0.0029713758,0.00078069174,0.03355185],"category_scores_gemma":[0.003643521,0.0005215995,0.0007385947,0.0013199986,0.0009516208,0.0028628977,0.0035849544,0.0013320652,0.0111368755],"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.0016614345,0.00044519047,0.0048896493,0.0013324525,0.00015751141,0.0005055558,0.0005620966,0.023944896,0.044012398,0.0932597,0.20260179,0.62662745],"study_design_scores_gemma":[0.00048977905,0.0007681091,0.0026863862,0.00025771727,0.00023906954,0.001131144,0.00033678123,0.1676775,0.09479788,0.07717992,0.65426594,0.00016976807],"about_ca_topic_score_codex":0.0047493316,"about_ca_topic_score_gemma":0.0061910474,"teacher_disagreement_score":0.03355185,"about_ca_system_score_codex":0.0009823831,"about_ca_system_score_gemma":0.0023144116,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025515242,0.00026547146,0.9822605,0.00034991905,0.00008043841,0.00007276567,0.00033088276,0.0018657963,0.012222656],"genre_scores_gemma":[0.08949695,0.0009644234,0.8906621,0.0006906715,0.00011638998,0.0007365546,0.0013655775,0.0010057433,0.0149615975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989791,0.000310539,0.000109519206,0.00010583145,0.00039851418,0.00009648459],"domain_scores_gemma":[0.9992077,0.0002908377,0.000072142764,0.00023613388,0.00016166604,0.000031568008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012914576,0.0007340214,0.00046208923,0.0011399161,0.000716611,0.0020645591,0.001628135,0.0010127361,0.005531987],"category_scores_gemma":[0.0024470226,0.00044331863,0.0009354268,0.001030464,0.0017632196,0.0031153297,0.001820171,0.0019481481,0.0026133324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003332985,0.00003354151,0.00031687127,0.00020025906,0.000012246548,0.00025986228,0.00051446405,0.031186895,0.0065097087,0.9063399,0.007777994,0.046814945],"study_design_scores_gemma":[0.000034626482,0.00004647494,0.00014506443,0.00012341492,0.000021084246,0.00034920056,0.000092554445,0.1805136,0.010371742,0.50979507,0.2984638,0.00004333631],"about_ca_topic_score_codex":0.0017920937,"about_ca_topic_score_gemma":0.0021513177,"teacher_disagreement_score":0.005531987,"about_ca_system_score_codex":0.0011571915,"about_ca_system_score_gemma":0.001201901,"threshold_uncertainty_score":0.018506348},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010245196,0.0003047567,0.97717154,0.00008761128,0.00005783489,0.00019269071,0.000047838017,0.0051138145,0.0067787524],"genre_scores_gemma":[0.12517807,0.0005331312,0.8675939,0.000103983235,0.000029565468,0.00037224017,0.00031687884,0.00085048523,0.005021803],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991198,0.00018037073,0.00006325712,0.00008485954,0.00047873432,0.00007307094],"domain_scores_gemma":[0.9987972,0.00028263358,0.000089567104,0.00044837658,0.00032926604,0.00005302234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093060377,0.0006091549,0.00033498043,0.0005876542,0.00032315138,0.0011300165,0.001773336,0.00057211454,0.0038481331],"category_scores_gemma":[0.0025495563,0.00052178046,0.00045306713,0.00044654854,0.00048776108,0.001163039,0.00065507204,0.0010398469,0.0012867881],"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.0002735214,0.00022332577,0.0015993331,0.0008143572,0.00011013791,0.00053572276,0.0005869271,0.086315595,0.21473339,0.11864227,0.012918685,0.5632467],"study_design_scores_gemma":[0.00021375394,0.0006981993,0.0021661874,0.00017202103,0.00013953735,0.0013143203,0.00009773745,0.45435414,0.2570457,0.030184561,0.253491,0.00012291402],"about_ca_topic_score_codex":0.0007640171,"about_ca_topic_score_gemma":0.0008102348,"teacher_disagreement_score":0.0038481331,"about_ca_system_score_codex":0.0005253895,"about_ca_system_score_gemma":0.0008522787,"threshold_uncertainty_score":0.012873292},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073605485,0.003385936,0.19198318,0.0030959349,0.0039344463,0.00088261015,0.038251232,0.24385972,0.44100145],"genre_scores_gemma":[0.46253836,0.0028464326,0.14877951,0.0030661859,0.00048741183,0.0013755125,0.09343403,0.049596492,0.237876],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993679,0.00006310571,0.00002915101,0.00011077278,0.00035011818,0.00007889847],"domain_scores_gemma":[0.999173,0.00011669075,0.000035517976,0.00023798218,0.00036174958,0.00007504642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000556543,0.0014174511,0.0006563494,0.00090904563,0.00058739015,0.0018528856,0.002237211,0.00092108466,0.06795043],"category_scores_gemma":[0.0024201893,0.00062945223,0.0008006205,0.0011201506,0.00029136756,0.0015758242,0.001591266,0.0014895388,0.024959903],"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.00071442407,0.00016221045,0.006423541,0.0006810762,0.00015033424,0.00041435403,0.0002270945,0.028607823,0.019876583,0.020782366,0.6834239,0.23853634],"study_design_scores_gemma":[0.0002009402,0.0003728034,0.004291571,0.00010820659,0.00006918046,0.0003897178,0.00008908397,0.18516523,0.04106272,0.010742592,0.75739264,0.000115311595],"about_ca_topic_score_codex":0.005057049,"about_ca_topic_score_gemma":0.0076646814,"teacher_disagreement_score":0.06795043,"about_ca_system_score_codex":0.0010959567,"about_ca_system_score_gemma":0.0008671555,"threshold_uncertainty_score":0},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003527602,0.00033065653,0.51809,0.00027013087,0.00023080554,0.00019976632,0.004280614,0.461559,0.01151143],"genre_scores_gemma":[0.06837207,0.0007627041,0.77409506,0.0010235457,0.00015831736,0.0011877273,0.017005898,0.11831556,0.01907909],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908245,0.00013415815,0.000087938104,0.00019000321,0.0003982412,0.00010718588],"domain_scores_gemma":[0.99722075,0.0014754088,0.00018811587,0.00035902916,0.00064004026,0.00011675156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013690745,0.0018460171,0.0006936263,0.0024587426,0.0005532072,0.0015208023,0.0023778703,0.0010209404,0.058127705],"category_scores_gemma":[0.008859945,0.0010267666,0.0009957463,0.00088671147,0.00057461555,0.002031479,0.0018544394,0.0017702265,0.019049354],"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.00079310936,0.0001815984,0.002165842,0.0011510493,0.00013393733,0.0014364704,0.00071028265,0.020078307,0.023996355,0.026097327,0.5090082,0.41424748],"study_design_scores_gemma":[0.00046778485,0.00015392681,0.0021775798,0.00065783126,0.00007497159,0.0019408455,0.00016744775,0.17598289,0.09939555,0.019878121,0.69879353,0.0003094946],"about_ca_topic_score_codex":0.0024896741,"about_ca_topic_score_gemma":0.0027322944,"teacher_disagreement_score":0.058127705,"about_ca_system_score_codex":0.0007126093,"about_ca_system_score_gemma":0.0013025581,"threshold_uncertainty_score":0.19445652},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9783366,0.00048673607,0.015197686,0.000040293995,0.000020394704,0.000019154175,0.00015371354,0.00029677502,0.0054486906],"genre_scores_gemma":[0.9918715,0.00021231498,0.006277557,0.000018330213,0.000005273516,0.000021423428,0.00017114039,0.000046812438,0.0013756331],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995369,0.000054837303,0.000029024332,0.000090185036,0.0001932041,0.00009585737],"domain_scores_gemma":[0.9993771,0.0002972336,0.000086323555,0.00010566875,0.0001121281,0.000021608897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027195047,0.0003951638,0.00022238943,0.0006678992,0.00017987392,0.00044120706,0.00040111187,0.00025060144,0.0019433275],"category_scores_gemma":[0.0014454727,0.0001538539,0.00015253384,0.0009210242,0.00019438082,0.00068907544,0.0001704193,0.00018290333,0.00031159044],"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.001471905,0.00031634726,0.028189553,0.0003447873,0.000160326,0.00050798134,0.00009245321,0.4801875,0.3485784,0.0048216498,0.0013012317,0.13402793],"study_design_scores_gemma":[0.000049340993,0.0015919458,0.034045767,0.000035822293,0.00013251642,0.0005367509,0.000150409,0.55238754,0.40357697,0.0015206026,0.005930925,0.00004139622],"about_ca_topic_score_codex":0.0011765475,"about_ca_topic_score_gemma":0.001210054,"teacher_disagreement_score":0.0019433275,"about_ca_system_score_codex":0.00048273744,"about_ca_system_score_gemma":0.0002173572,"threshold_uncertainty_score":0.0065010786},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016918693,0.00062291336,0.9028946,0.00035603883,0.0005403425,0.00034460123,0.00038855476,0.058603372,0.019330775],"genre_scores_gemma":[0.1549419,0.0005934232,0.7872434,0.00062991626,0.00030964325,0.0005610055,0.0011227468,0.028739331,0.025858527],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998497,0.0001769612,0.000084374406,0.00025310693,0.00086060335,0.00012798511],"domain_scores_gemma":[0.9983956,0.0004752318,0.00015507889,0.00060665223,0.00030768,0.000059710284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007184035,0.0007200694,0.0005231894,0.001069762,0.00077066314,0.0009063092,0.0010517857,0.00060902775,0.0069836117],"category_scores_gemma":[0.0033015953,0.00063744484,0.00084628066,0.0007454594,0.0009292645,0.0009717076,0.0015001434,0.001867198,0.0042071193],"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.00037929733,0.00017060991,0.0028524075,0.0008647884,0.000137198,0.00051990134,0.0008165872,0.00858876,0.15963621,0.04834412,0.06387268,0.7138174],"study_design_scores_gemma":[0.0002745033,0.00042481738,0.0045478195,0.00023405778,0.00013825513,0.0019126474,0.00010355235,0.08050183,0.30392778,0.045619715,0.56217664,0.00013837792],"about_ca_topic_score_codex":0.00068089727,"about_ca_topic_score_gemma":0.0009548777,"teacher_disagreement_score":0.0069836117,"about_ca_system_score_codex":0.00033404285,"about_ca_system_score_gemma":0.00094452366,"threshold_uncertainty_score":0.023362517},"labels":[],"label_agreement":null},{"id":"W4235443648","doi":"10.1145/2016603.1967692","title":"Lowering overhead in sampling-based execution monitoring and tracing","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Overhead (engineering); Debugging; Tracing; Sampling (signal processing); Embedded system; Distributed computing; Real-time computing; Software; Operating system","score_opus":0.06569044740153988,"score_gpt":0.2905479487889079,"score_spread":0.224857501387368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235443648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09012648,0.00088894635,0.89906615,0.00035872552,0.00006436976,0.00020065898,0.00006282505,0.007430081,0.0018018036],"genre_scores_gemma":[0.62451667,0.00039466785,0.37229887,0.00018886953,0.0000500306,0.00021835532,0.00015598084,0.0006296281,0.0015469142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9917191,0.0027836412,0.0006113784,0.00088742864,0.0032643313,0.00073409814],"domain_scores_gemma":[0.9660711,0.016003339,0.0040738806,0.010812252,0.0023925528,0.0006469344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003521514,0.0011729085,0.001134531,0.0018268193,0.00089388585,0.0016493221,0.0026033933,0.0010303942,0.0015277249],"category_scores_gemma":[0.02452837,0.0007713153,0.00051884446,0.0019716246,0.0016713955,0.004653025,0.0025837314,0.0016377526,0.00044377564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035660474,0.0005975631,0.015147463,0.00053993234,0.0001119609,0.00037567015,0.0013412285,0.122746944,0.13548961,0.044923823,0.0034585767,0.67170113],"study_design_scores_gemma":[0.00015160018,0.00053882773,0.0026127785,0.00008397745,0.00009162146,0.00032910015,0.000141745,0.8533442,0.11812549,0.0194097,0.0050891857,0.00008174449],"about_ca_topic_score_codex":0.0024263773,"about_ca_topic_score_gemma":0.002943942,"teacher_disagreement_score":0.003521514,"about_ca_system_score_codex":0.0015109011,"about_ca_system_score_gemma":0.0025097425,"threshold_uncertainty_score":0.01862377},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18085763,0.00122497,0.81088024,0.00020265885,0.000116100266,0.00006156062,0.000057814195,0.0027410341,0.0038580017],"genre_scores_gemma":[0.78218704,0.00046076576,0.21527791,0.00009828689,0.00003112749,0.00010576228,0.00009268241,0.00018042211,0.0015659591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998179,0.000044373286,0.000010976864,0.000042722764,0.00005149144,0.00003254643],"domain_scores_gemma":[0.9998155,0.00004729712,0.0000419764,0.00004583245,0.00003547607,0.000013897214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020214678,0.00048385368,0.00031020862,0.00036143462,0.00032833315,0.000452777,0.0006387536,0.00034338562,0.0006317601],"category_scores_gemma":[0.00044890164,0.0002423465,0.0004417906,0.0003416696,0.00027092462,0.0004063528,0.00044955965,0.00038434338,0.00018635845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031993174,0.000121994075,0.002003267,0.00017156621,0.00008224845,0.00020890133,0.00021906213,0.6007988,0.18892993,0.0054370738,0.0023060255,0.19940118],"study_design_scores_gemma":[0.000017424085,0.000097334094,0.0010313834,0.000007631345,0.0000223979,0.00009656438,0.000029167719,0.96913135,0.024652367,0.0022335085,0.0026608938,0.00001998222],"about_ca_topic_score_codex":0.0018440937,"about_ca_topic_score_gemma":0.0026762711,"teacher_disagreement_score":0.0018440937,"about_ca_system_score_codex":0.00037485833,"about_ca_system_score_gemma":0.0004984069,"threshold_uncertainty_score":0.0036667585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48231468,0.00057747914,0.49453592,0.0012627145,0.00006706407,0.0001633146,0.00016370881,0.005340498,0.015574691],"genre_scores_gemma":[0.93795896,0.00013726947,0.060322117,0.00007776841,0.000022427203,0.00009728239,0.00011040878,0.00031981707,0.00095377665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981509,0.00081269705,0.000084985295,0.00027231107,0.000508231,0.00017091326],"domain_scores_gemma":[0.9887677,0.0075333533,0.00048867404,0.0022695437,0.0007457063,0.00019508766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030701754,0.0008740374,0.0006266279,0.00071052444,0.0009135198,0.0013008924,0.0015765281,0.0006365997,0.0033703474],"category_scores_gemma":[0.017329806,0.000528107,0.00039712223,0.000988782,0.0013392364,0.0032730089,0.0012897347,0.0010736024,0.00044328798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051907235,0.00021896372,0.0041786814,0.00008928541,0.000050182298,0.00014679067,0.0003410662,0.8815841,0.02779052,0.018072259,0.0012152297,0.06579368],"study_design_scores_gemma":[0.00002526375,0.00003156325,0.00027107832,0.0000051317757,0.0000087422,0.000023670122,0.000029253073,0.9879517,0.0057619503,0.005444863,0.00043948778,0.000007238834],"about_ca_topic_score_codex":0.0044846344,"about_ca_topic_score_gemma":0.0046899705,"teacher_disagreement_score":0.0044846344,"about_ca_system_score_codex":0.0012827946,"about_ca_system_score_gemma":0.0013862975,"threshold_uncertainty_score":0.016236842},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98962677,0.00034584707,0.002343161,0.00007258916,0.000021376189,0.000033613975,0.00037154113,0.0010225843,0.0061624954],"genre_scores_gemma":[0.9938169,0.00012940113,0.0029300684,0.000038208716,0.000009261707,0.000018852808,0.0012021433,0.00007893403,0.0017762166],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99902654,0.00014131347,0.000059628193,0.00018031606,0.000431074,0.00016103897],"domain_scores_gemma":[0.99802667,0.00039586957,0.00012901044,0.00024851388,0.0010614615,0.00013852419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007179678,0.0006605221,0.00024491068,0.0008848926,0.00031852417,0.0005629516,0.0006400049,0.00025468884,0.004205927],"category_scores_gemma":[0.0027954918,0.00022865248,0.00017891328,0.0018065907,0.00024147096,0.00070496136,0.00038097473,0.0002638049,0.00094982],"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.00802441,0.0010705914,0.11001041,0.00078186207,0.00039310465,0.001051272,0.0006808021,0.30758753,0.17305033,0.00495726,0.03141152,0.36098096],"study_design_scores_gemma":[0.00048599998,0.0064840987,0.16229191,0.00005873524,0.00020898056,0.0009748509,0.00062627747,0.6864339,0.116645984,0.0014302266,0.024231827,0.00012720856],"about_ca_topic_score_codex":0.005362795,"about_ca_topic_score_gemma":0.0039085476,"teacher_disagreement_score":0.005362795,"about_ca_system_score_codex":0.0009647765,"about_ca_system_score_gemma":0.0007886867,"threshold_uncertainty_score":0.014070153},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05597799,0.005943733,0.61979115,0.0050188857,0.0022550314,0.0003352457,0.001508867,0.0556962,0.25347286],"genre_scores_gemma":[0.44577357,0.0034837266,0.25939822,0.004564683,0.00052545115,0.00038777315,0.0028666016,0.009296973,0.27370304],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99873704,0.00012443024,0.000056340497,0.00027437293,0.0006001143,0.00020775461],"domain_scores_gemma":[0.99831605,0.00045222335,0.0001145764,0.0006203939,0.0004177603,0.000078997764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070910284,0.0009602248,0.0005138845,0.0008601086,0.001024751,0.0020455965,0.002214112,0.0013241167,0.03454354],"category_scores_gemma":[0.003926108,0.00046336887,0.00065178546,0.00086969347,0.00086211803,0.003545939,0.0020145923,0.0018674432,0.014262801],"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.0005542491,0.0001673859,0.0016973881,0.0008142767,0.00006765401,0.0005502722,0.00038880584,0.023920316,0.047069453,0.07525998,0.15344203,0.6960682],"study_design_scores_gemma":[0.00012574512,0.0003507444,0.0016734654,0.00019219886,0.00011021833,0.0019183867,0.00016369943,0.102405876,0.11363706,0.057647444,0.72160906,0.00016605688],"about_ca_topic_score_codex":0.0018852287,"about_ca_topic_score_gemma":0.003393921,"teacher_disagreement_score":0.03454354,"about_ca_system_score_codex":0.0011296414,"about_ca_system_score_gemma":0.0013775025,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002164735,0.010305197,0.18592481,0.0012712332,0.0017937548,0.00013303384,0.00032602606,0.0019819424,0.7960993],"genre_scores_gemma":[0.022971297,0.011515008,0.0847813,0.0006753007,0.0007686547,0.00015077052,0.000686769,0.00054828776,0.8779025],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996253,0.000028744647,0.000012631451,0.000059426846,0.00024079377,0.00003298766],"domain_scores_gemma":[0.9997347,0.00005209516,0.000011054465,0.00009882305,0.00008518559,0.000018025321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002175604,0.0010744863,0.0005260146,0.0013194694,0.0008572237,0.0015448941,0.0014652789,0.00078785967,0.114345685],"category_scores_gemma":[0.0006270784,0.00052173546,0.000543378,0.0014383339,0.0007382625,0.0017521272,0.0012915512,0.0016582847,0.06231423],"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.000058062746,0.00006649211,0.00010486488,0.00061015924,0.000019087534,0.00009235972,0.00014582099,0.0027077396,0.012528858,0.20702963,0.1382024,0.6384346],"study_design_scores_gemma":[0.00001175166,0.000043557407,0.00021240165,0.00012697956,0.000013775371,0.00030371788,0.00003132503,0.001972486,0.0066378526,0.03783315,0.95279974,0.000013138486],"about_ca_topic_score_codex":0.00072219677,"about_ca_topic_score_gemma":0.0013626056,"teacher_disagreement_score":0.114345685,"about_ca_system_score_codex":0.0006789219,"about_ca_system_score_gemma":0.0009006131,"threshold_uncertainty_score":0.38252443},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77405405,0.00086835836,0.21989599,0.00018707478,0.00007319689,0.00004638107,0.000034028195,0.00085564615,0.0039853337],"genre_scores_gemma":[0.9637407,0.00007205662,0.035508018,0.00002587271,0.00001930321,0.00001626942,0.000024976353,0.000038411872,0.0005544646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99961984,0.00012413043,0.000025679088,0.000050277406,0.00011787905,0.00006230656],"domain_scores_gemma":[0.999252,0.00022857444,0.00013689946,0.00017206956,0.00013797541,0.00007245383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000640166,0.00035008532,0.00037908324,0.00039281114,0.00024960705,0.0004093058,0.0009337567,0.00018349128,0.0009415842],"category_scores_gemma":[0.0015714593,0.00015948602,0.00016517707,0.00042776906,0.00024274077,0.00053985254,0.0004790803,0.00030421105,0.00017779379],"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.0016528711,0.00052669214,0.007284993,0.00022627454,0.00008080873,0.0002092328,0.00017763219,0.47490424,0.24075991,0.0121630225,0.0024354975,0.2595788],"study_design_scores_gemma":[0.00007726593,0.00024650255,0.0014024402,0.000005573098,0.000023602473,0.00004063157,0.000017623268,0.9584664,0.03631436,0.001991236,0.0014041708,0.0000101858395],"about_ca_topic_score_codex":0.0005626571,"about_ca_topic_score_gemma":0.0010661966,"teacher_disagreement_score":0.0009415842,"about_ca_system_score_codex":0.0003481441,"about_ca_system_score_gemma":0.0005494197,"threshold_uncertainty_score":0.0033856034},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15814073,0.0026136504,0.74976176,0.00083596935,0.0008503195,0.00025832842,0.0013321807,0.05320272,0.033004366],"genre_scores_gemma":[0.8694533,0.0013048502,0.10666755,0.0005662727,0.00019162925,0.00028147106,0.0020652702,0.001536738,0.017932862],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923897,0.00014117309,0.000051045958,0.000115470626,0.00028263975,0.00017062589],"domain_scores_gemma":[0.9984409,0.00038305766,0.00009493684,0.0007535164,0.00022288052,0.00010460876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000640864,0.0006081316,0.0005415497,0.0003478795,0.00042847713,0.0014004136,0.0018593267,0.00034084698,0.0075425245],"category_scores_gemma":[0.003044759,0.00044632918,0.00038999927,0.00046449256,0.00040433675,0.0021226075,0.0017786887,0.0013524308,0.0020526063],"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.0021853682,0.0005622392,0.018843673,0.0006515363,0.0003238045,0.00086574256,0.0006556064,0.14356734,0.09678687,0.1262467,0.08775508,0.521556],"study_design_scores_gemma":[0.00016610515,0.00058624404,0.0027428544,0.000085359476,0.0001689151,0.00062575436,0.00016580823,0.64734095,0.15513876,0.03376401,0.15909548,0.00011967882],"about_ca_topic_score_codex":0.0013643722,"about_ca_topic_score_gemma":0.0016419698,"teacher_disagreement_score":0.0075425245,"about_ca_system_score_codex":0.000496677,"about_ca_system_score_gemma":0.001826481,"threshold_uncertainty_score":0.025232255},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020219288,0.0005629331,0.9944998,0.00024523938,0.000023379078,0.00005025806,0.00013079683,0.00031084174,0.0021547875],"genre_scores_gemma":[0.18754125,0.0036705574,0.80045384,0.00021799587,0.0001695152,0.0008307065,0.00065204926,0.00035893967,0.0061051757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990459,0.0002849422,0.000049762355,0.00014335528,0.0003891995,0.00008680157],"domain_scores_gemma":[0.9986935,0.0006687368,0.00015464083,0.00019769168,0.00024676678,0.000038572707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016560159,0.0012235839,0.0011443894,0.001169244,0.0005708835,0.0014909144,0.0026819648,0.0012617734,0.0019808693],"category_scores_gemma":[0.0036263878,0.00092200533,0.0012288995,0.0013877546,0.0013271007,0.0023098171,0.0008581754,0.0022895073,0.0006111318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010620501,0.000027678334,0.00029749412,0.000058499558,0.000024394829,0.00003125557,0.000034518198,0.9072151,0.0008102372,0.079698645,0.0007922901,0.010999272],"study_design_scores_gemma":[0.0000035761275,0.000012507757,0.00006373718,0.000012627744,0.000006924991,0.000012460659,0.0000073338474,0.9735291,0.00024612097,0.023338968,0.0027602345,0.0000063845187],"about_ca_topic_score_codex":0.01277307,"about_ca_topic_score_gemma":0.009668764,"teacher_disagreement_score":0.01277307,"about_ca_system_score_codex":0.0020986642,"about_ca_system_score_gemma":0.0030060273,"threshold_uncertainty_score":0.02539742},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8754409,0.00093996216,0.11590594,0.00022522568,0.000032520937,0.00003348853,0.000044685003,0.00027118067,0.0071061566],"genre_scores_gemma":[0.978311,0.00011378101,0.020943316,0.000017335533,0.000013387994,0.000016134318,0.00003069951,0.000056311885,0.00049808365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990175,0.00020940888,0.00004044348,0.00011281442,0.00039466255,0.0002251172],"domain_scores_gemma":[0.99430263,0.003490623,0.00053393847,0.0010210145,0.0004337781,0.00021798612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011878693,0.0006861168,0.00035377772,0.0005009782,0.0004924897,0.0009287648,0.00065886544,0.00051527773,0.001310114],"category_scores_gemma":[0.0071414164,0.0003788919,0.00033245937,0.0007839283,0.0007721382,0.00315074,0.0014537825,0.0009669993,0.00019333627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018275521,0.00039857402,0.016297948,0.0004050607,0.00013046616,0.0002781206,0.00043750752,0.5690814,0.1715893,0.08119092,0.00087665045,0.15748645],"study_design_scores_gemma":[0.0000715021,0.0014325217,0.012138989,0.000030464098,0.00015806744,0.00022960611,0.0002479461,0.8140854,0.084381804,0.08395354,0.0032187055,0.00005148237],"about_ca_topic_score_codex":0.00045916802,"about_ca_topic_score_gemma":0.0011138916,"teacher_disagreement_score":0.001310114,"about_ca_system_score_codex":0.00039897073,"about_ca_system_score_gemma":0.00042671844,"threshold_uncertainty_score":0.0062821507},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8863942,0.0014887896,0.10234427,0.0002578812,0.000041947103,0.000023086788,0.00006686196,0.0005237748,0.008859208],"genre_scores_gemma":[0.9886706,0.00014623032,0.0103483545,0.000023352377,0.00001154461,0.00001097081,0.000044278357,0.000039325765,0.0007052336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99951184,0.0001421457,0.00003347938,0.000046456345,0.00019840333,0.00006773355],"domain_scores_gemma":[0.99901485,0.0003909635,0.00011318872,0.00019295834,0.0002125493,0.00007545159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007273133,0.00030678633,0.00028667552,0.00036214653,0.00036208745,0.00052514445,0.0007933635,0.00023714436,0.0018614782],"category_scores_gemma":[0.0022024834,0.0001820655,0.0001458025,0.00048841105,0.00023877791,0.0010610844,0.00050563726,0.0003409419,0.0004210885],"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.0020938755,0.0003617006,0.015503076,0.00040725523,0.00008216702,0.0005201688,0.00026443443,0.34069616,0.2998342,0.023715798,0.0037494162,0.31277177],"study_design_scores_gemma":[0.000057631554,0.00038514746,0.0052585793,0.0000142865365,0.000040086965,0.0002550741,0.00010064568,0.89197856,0.088897586,0.008567339,0.0044269855,0.000018166716],"about_ca_topic_score_codex":0.00042028123,"about_ca_topic_score_gemma":0.0009030625,"teacher_disagreement_score":0.0018614782,"about_ca_system_score_codex":0.00032363637,"about_ca_system_score_gemma":0.00034647022,"threshold_uncertainty_score":0.006227255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15644749,0.000278759,0.8277995,0.00014924152,0.000035840585,0.0001005851,0.0002735981,0.012998519,0.0019164132],"genre_scores_gemma":[0.61393064,0.00013487531,0.38413483,0.000033429602,0.000017601755,0.000115105606,0.00047254725,0.00039202807,0.0007688926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964154,0.000099048855,0.000018556162,0.000053076375,0.00016171062,0.000026022373],"domain_scores_gemma":[0.9981036,0.0009177417,0.0003397374,0.00027606369,0.00031943087,0.00004342956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037322307,0.0007637161,0.00039032285,0.00056791917,0.00028326883,0.00037913996,0.00096968777,0.0003113808,0.0017423483],"category_scores_gemma":[0.0033380934,0.00042328474,0.0004024973,0.0005400816,0.00031499186,0.00075945305,0.00022379907,0.0004601622,0.00048669943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033943713,0.000099519384,0.0085823815,0.00017500026,0.000037263366,0.00011628694,0.00007311597,0.7379295,0.023976808,0.0054350877,0.0029774283,0.22025813],"study_design_scores_gemma":[0.000007431214,0.000037019014,0.00037303224,0.0000025807467,0.000004854463,0.0000150812175,0.0000031265088,0.9932962,0.0050636847,0.00083020655,0.0003620062,0.000004720865],"about_ca_topic_score_codex":0.007160554,"about_ca_topic_score_gemma":0.009112035,"teacher_disagreement_score":0.007160554,"about_ca_system_score_codex":0.0006659663,"about_ca_system_score_gemma":0.0018809099,"threshold_uncertainty_score":0.014237702},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068122125,0.0008294087,0.98515594,0.0004446371,0.000050614453,0.00009868794,0.00005589072,0.0014991884,0.0050534345],"genre_scores_gemma":[0.15903018,0.0010721614,0.8340623,0.0002891024,0.00007238446,0.0003610554,0.00014615522,0.00039906747,0.0045675496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994106,0.00016176305,0.000030404173,0.000087234665,0.0002276895,0.00008234453],"domain_scores_gemma":[0.9995578,0.00011548357,0.00003874857,0.00019884491,0.0000630709,0.000026098403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010943088,0.0006104387,0.00058900384,0.0005611307,0.0007687657,0.0017432983,0.0022918177,0.00096020236,0.0020577298],"category_scores_gemma":[0.0014815462,0.0005256432,0.00081848097,0.000754088,0.0015738604,0.0026268712,0.0013945465,0.0021349133,0.0006562706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007951438,0.000120174125,0.00069656095,0.00022472935,0.000052170675,0.00017106098,0.00035471728,0.36230436,0.021441065,0.48633158,0.006858249,0.121365815],"study_design_scores_gemma":[0.000048981172,0.0001255119,0.00024650132,0.00005215023,0.000041402145,0.00009578064,0.000076333796,0.7799719,0.0067218794,0.16909628,0.043484148,0.000039062965],"about_ca_topic_score_codex":0.0051268754,"about_ca_topic_score_gemma":0.0100174425,"teacher_disagreement_score":0.0051268754,"about_ca_system_score_codex":0.0012797987,"about_ca_system_score_gemma":0.0024492377,"threshold_uncertainty_score":0.010194063},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8715697,0.0014619015,0.10412596,0.00052446977,0.00007402871,0.000067180896,0.00018285082,0.0006705224,0.02132343],"genre_scores_gemma":[0.9705447,0.00017326875,0.026983723,0.000031247426,0.0000064908922,0.000027689179,0.00011634434,0.00010464566,0.0020119634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984384,0.0000493169,0.000005669304,0.000019515377,0.000049374965,0.00003224143],"domain_scores_gemma":[0.99979395,0.00010228163,0.000019274663,0.000019281113,0.000046950554,0.000018269448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034028606,0.000475667,0.00034052366,0.0002946682,0.0003078766,0.00063046213,0.0004646292,0.000280501,0.0016257323],"category_scores_gemma":[0.0010018927,0.00013876919,0.00020614042,0.00050609634,0.00022606655,0.0003666595,0.0003055994,0.00028849585,0.0002075104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001988461,0.00007982093,0.0013313884,0.000060919225,0.000023541392,0.00006102109,0.00003497349,0.9529149,0.017589217,0.00289053,0.0010948793,0.02372004],"study_design_scores_gemma":[0.000008309623,0.00003876442,0.0003536406,0.0000019596848,0.000003839728,0.0000061363944,0.0000133271515,0.9948245,0.0039461227,0.00044143148,0.00035970684,0.0000022405052],"about_ca_topic_score_codex":0.004655623,"about_ca_topic_score_gemma":0.0064514885,"teacher_disagreement_score":0.004655623,"about_ca_system_score_codex":0.0009588064,"about_ca_system_score_gemma":0.00070632884,"threshold_uncertainty_score":0.009257078},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40767878,0.024514453,0.3797319,0.0017296092,0.0012800061,0.0008880539,0.00230669,0.012044704,0.16982585],"genre_scores_gemma":[0.70224744,0.0049394527,0.21882853,0.0008321807,0.00043083553,0.000271002,0.0020598676,0.0008286084,0.06956215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996736,0.000032901593,0.000023511198,0.00004173885,0.0002007705,0.000027503396],"domain_scores_gemma":[0.9994512,0.00013166887,0.000102840946,0.00010682095,0.00016668998,0.00004075629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015999154,0.0006200641,0.00024990187,0.000701298,0.00030300257,0.00078429934,0.0004304026,0.00028327692,0.027653942],"category_scores_gemma":[0.0014596657,0.00015911918,0.00018857527,0.0011671025,0.0002081455,0.0012539793,0.00041636828,0.00037863106,0.004434079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051077787,0.00020589914,0.00539973,0.00091218355,0.00005886493,0.0003605938,0.00018183103,0.010041299,0.3916707,0.04836226,0.03160048,0.5106954],"study_design_scores_gemma":[0.00019033387,0.003130362,0.026116341,0.00035406929,0.00018824563,0.003181645,0.00025427295,0.095371984,0.28742096,0.048894804,0.5347649,0.00013203683],"about_ca_topic_score_codex":0.00039455344,"about_ca_topic_score_gemma":0.0011401778,"teacher_disagreement_score":0.027653942,"about_ca_system_score_codex":0.00037700197,"about_ca_system_score_gemma":0.00042611282,"threshold_uncertainty_score":0.092511594},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08253951,0.00221186,0.8694556,0.00082907185,0.0005545398,0.00020865606,0.00031900106,0.0038695198,0.040012214],"genre_scores_gemma":[0.6274493,0.0010994934,0.34676236,0.0004145076,0.00019131145,0.00029410655,0.00041184944,0.00037694225,0.023000108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998418,0.0000342713,0.0000093549315,0.00002919105,0.00006114112,0.000024216251],"domain_scores_gemma":[0.999681,0.00007665308,0.000018284847,0.0001525221,0.000040773128,0.00003085958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024371847,0.0002712159,0.00043469327,0.00042752465,0.00041635893,0.0016697143,0.0015469335,0.00043598952,0.0068584075],"category_scores_gemma":[0.0005560263,0.00019958864,0.00025594738,0.00070404523,0.00068736065,0.0019265604,0.0011807256,0.00054060045,0.0009132679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010662562,0.0005118022,0.0010662216,0.0003608858,0.000082555336,0.00027238415,0.00041717876,0.051095646,0.10808311,0.26228708,0.016222335,0.55853456],"study_design_scores_gemma":[0.000505659,0.00070469145,0.0007531735,0.00009421126,0.000116803625,0.00044559603,0.0003128884,0.697692,0.098333284,0.12692611,0.074019015,0.00009655825],"about_ca_topic_score_codex":0.00071536814,"about_ca_topic_score_gemma":0.001578096,"teacher_disagreement_score":0.0068584075,"about_ca_system_score_codex":0.00045303084,"about_ca_system_score_gemma":0.0007077263,"threshold_uncertainty_score":0.022943676},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23742543,0.00056874705,0.749992,0.00030670894,0.00007111793,0.000246408,0.00015050096,0.0082281735,0.003010938],"genre_scores_gemma":[0.83575183,0.00010233205,0.16178595,0.00013120563,0.000042347532,0.00014836468,0.00017813886,0.00023326444,0.0016265555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990958,0.00018018948,0.000053637195,0.0001739548,0.00031283626,0.00018363933],"domain_scores_gemma":[0.99702615,0.00082209165,0.00035635306,0.0012702846,0.0003554951,0.00016970889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011551953,0.000399086,0.00054797076,0.0007202822,0.00094524655,0.00067739526,0.0016567926,0.0005270301,0.00087654404],"category_scores_gemma":[0.0037389423,0.00037624798,0.00029815483,0.00082859694,0.0010582589,0.0018974032,0.0017090198,0.0005515224,0.00022461073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002198675,0.00045978976,0.012966592,0.0003134525,0.00021413881,0.0006257442,0.0015355996,0.25237322,0.16247685,0.03629153,0.011916575,0.5186279],"study_design_scores_gemma":[0.00016727006,0.0004525803,0.002291481,0.00001641823,0.000067325454,0.00026264603,0.0001766537,0.90072185,0.06147283,0.024150277,0.010140273,0.000080349644],"about_ca_topic_score_codex":0.0060190437,"about_ca_topic_score_gemma":0.01037189,"teacher_disagreement_score":0.0060190437,"about_ca_system_score_codex":0.0007233567,"about_ca_system_score_gemma":0.0009971034,"threshold_uncertainty_score":0.011968017},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2505237,0.00084790913,0.7350528,0.00049426605,0.00014261005,0.0001968533,0.0000697663,0.0038917991,0.008780263],"genre_scores_gemma":[0.75330955,0.00026756414,0.24362454,0.000117038035,0.00006253236,0.00013267978,0.000097944336,0.00031448808,0.0020736873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995864,0.000083314735,0.0000283595,0.00008072847,0.00013454058,0.000086650885],"domain_scores_gemma":[0.9992743,0.00022986931,0.00011246762,0.00020276303,0.00011969592,0.00006085229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005768201,0.0005359154,0.0005732168,0.00051784643,0.0007957463,0.000837627,0.00091168255,0.00045416263,0.0028346141],"category_scores_gemma":[0.0019086511,0.00046526204,0.00029435314,0.0006360991,0.00064202247,0.001076023,0.00074664596,0.0008588974,0.0005256239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011114811,0.00036738146,0.00451888,0.00022895927,0.00006654325,0.0005060126,0.0008787685,0.33920744,0.2307195,0.057577375,0.008783953,0.3560337],"study_design_scores_gemma":[0.00008554445,0.00011315498,0.0006474799,0.000014206375,0.000015607204,0.000089852074,0.000056941215,0.94229853,0.03981334,0.00802329,0.008820128,0.000021993048],"about_ca_topic_score_codex":0.0026357586,"about_ca_topic_score_gemma":0.004652285,"teacher_disagreement_score":0.0028346141,"about_ca_system_score_codex":0.0008559537,"about_ca_system_score_gemma":0.001490436,"threshold_uncertainty_score":0.009482741},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24862053,0.031825416,0.52562886,0.014359799,0.0018754726,0.00026928904,0.0026849243,0.0064473655,0.16828838],"genre_scores_gemma":[0.8320041,0.016697856,0.116847865,0.0019414765,0.00090438273,0.00023198244,0.0019660834,0.0021223312,0.02728391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990226,0.00020389154,0.000040121446,0.0001488708,0.0004028119,0.0001816781],"domain_scores_gemma":[0.998993,0.00033984333,0.00010848888,0.000250076,0.00023642246,0.00007220262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008547051,0.000993431,0.0006675762,0.0009388882,0.00087794074,0.003451527,0.0015356255,0.0009926893,0.008468743],"category_scores_gemma":[0.0024886108,0.0006101697,0.0005635733,0.0008958943,0.0011843832,0.006120933,0.0028686028,0.0020418852,0.0020428037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033456605,0.00034400914,0.010764592,0.0011596819,0.00018571179,0.0010356479,0.0015023653,0.15286346,0.0419486,0.5044302,0.053994924,0.23143633],"study_design_scores_gemma":[0.000050386203,0.00017882259,0.011826066,0.00032089255,0.00014879956,0.00067396933,0.00105854,0.4452984,0.014666406,0.28662267,0.23902504,0.00013006854],"about_ca_topic_score_codex":0.0040647928,"about_ca_topic_score_gemma":0.007007019,"teacher_disagreement_score":0.008468743,"about_ca_system_score_codex":0.0010625735,"about_ca_system_score_gemma":0.0012369627,"threshold_uncertainty_score":0.028330803},"labels":[],"label_agreement":null},{"id":"W4238446011","doi":"10.1145/1837854.1736011","title":"AASH","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Hypervisor; Computer science; Multi-core processor; Operating system; Virtual machine; Asymmetry; Thread (computing); Virtualization; Embedded system; Parallel computing; Cloud computing","score_opus":0.01563478540086508,"score_gpt":0.2642665672501201,"score_spread":0.24863178184925502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238446011","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002280201,0.002832597,0.009362693,0.004169692,0.0046697105,0.0002828576,0.007955715,0.01117307,0.9572734],"genre_scores_gemma":[0.016935881,0.002908926,0.006794287,0.0023586494,0.00092545204,0.00022828755,0.012325965,0.0031099408,0.9544127],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99852234,0.0002214754,0.000106897285,0.00031549833,0.00065445073,0.00017931162],"domain_scores_gemma":[0.99754745,0.0003322783,0.00014174584,0.00051430124,0.0007632219,0.00070098153],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012786564,0.0012956415,0.0008769258,0.0022476066,0.0019419093,0.0062121274,0.001869382,0.0029003518,0.78853047],"category_scores_gemma":[0.0044962107,0.0006026211,0.0007789013,0.0016384982,0.00073501293,0.0035723299,0.0044483836,0.0019322314,0.6731051],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042413152,0.00016632132,0.0010727136,0.0007949449,0.000029332554,0.00047765765,0.00027997795,0.00047821717,0.003188581,0.021407133,0.6190179,0.3526631],"study_design_scores_gemma":[0.000021858064,0.000028816321,0.00030298406,0.00009487804,0.000005317404,0.00024749365,0.000059558322,0.00021935633,0.0004607238,0.003002837,0.9955461,0.000009997936],"about_ca_topic_score_codex":0.0017768837,"about_ca_topic_score_gemma":0.002298615,"teacher_disagreement_score":0.21146953,"about_ca_system_score_codex":0.0011403207,"about_ca_system_score_gemma":0.002344235,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4238588277","doi":"10.1145/1508284.1508259","title":"RapidMRC","year":2009,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Multi-core processor; Parallel computing; Cache algorithms; Overhead (engineering); Cache invalidation; Smart Cache; Process (computing); Software; Code (set theory); Operating system; CPU cache; Programming language","score_opus":0.020706827356451817,"score_gpt":0.2700367176350224,"score_spread":0.24932989027857058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238588277","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09444012,0.0022304554,0.60392666,0.00055351754,0.00049827265,0.0011448883,0.019390583,0.22836591,0.049449604],"genre_scores_gemma":[0.4800412,0.0006179677,0.47738063,0.0005056355,0.0002100562,0.0010778124,0.01332548,0.009373288,0.017467873],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99735755,0.00035831268,0.00014281076,0.00052715937,0.0013945115,0.00021968965],"domain_scores_gemma":[0.99001884,0.0022895527,0.0010391759,0.0032449374,0.0032419928,0.00016551667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017607464,0.0014338872,0.0009886614,0.003411018,0.00055705354,0.0012697943,0.003097966,0.000972511,0.017250827],"category_scores_gemma":[0.012056363,0.0006058586,0.0006054305,0.0026651947,0.00033378374,0.0014703815,0.0010805498,0.00087151467,0.007987258],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013754511,0.0003382438,0.009378827,0.0008949736,0.00018486797,0.0004338475,0.00024727572,0.0939689,0.045030583,0.013989793,0.12248103,0.71167624],"study_design_scores_gemma":[0.00022657559,0.00046987121,0.009539134,0.000107344335,0.00007414805,0.0009841468,0.00007752706,0.7617584,0.10422786,0.007527249,0.11467946,0.00032837372],"about_ca_topic_score_codex":0.0063650575,"about_ca_topic_score_gemma":0.0065877154,"teacher_disagreement_score":0.017250827,"about_ca_system_score_codex":0.0012301848,"about_ca_system_score_gemma":0.0015253469,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38254124,0.00014958996,0.6113816,0.00014066367,0.000025682386,0.00010685475,0.000039733375,0.0013869059,0.0042277453],"genre_scores_gemma":[0.89802957,0.0000695426,0.10068558,0.000021037562,0.000008376858,0.000108352055,0.0000580141,0.00013440286,0.0008851452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994783,0.00018439947,0.000019743264,0.00009460612,0.00014564069,0.00007735155],"domain_scores_gemma":[0.9992735,0.00030472293,0.000079574704,0.00015715993,0.0001391156,0.00004596979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090138236,0.00049758,0.0005378418,0.00042690907,0.0004898501,0.00067128614,0.0009132361,0.00036344677,0.0010061432],"category_scores_gemma":[0.0027288366,0.00028906274,0.00032576488,0.0007321593,0.0005022211,0.000968058,0.00072843384,0.000483339,0.00020661544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012461153,0.000069864946,0.001301044,0.000027285736,0.000012515383,0.000040126375,0.000059728565,0.9553625,0.010654559,0.0058010234,0.00039458828,0.026152225],"study_design_scores_gemma":[0.000006565998,0.000015885116,0.00008926015,6.5885445e-7,0.0000019495299,0.0000026713321,0.000007710745,0.99615854,0.002582886,0.0009715955,0.00016068421,0.0000016445236],"about_ca_topic_score_codex":0.003218313,"about_ca_topic_score_gemma":0.002436261,"teacher_disagreement_score":0.003218313,"about_ca_system_score_codex":0.0009051735,"about_ca_system_score_gemma":0.0010656868,"threshold_uncertainty_score":0.006567478},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9495266,0.006422183,0.017036926,0.00044790856,0.00007896807,0.00008777129,0.0010353527,0.0011267001,0.024237517],"genre_scores_gemma":[0.9793971,0.0018214975,0.012094642,0.00007661174,0.00004560086,0.000047038604,0.0010891599,0.00017093956,0.005257434],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985329,0.0002177787,0.000083918494,0.0001339545,0.0008136592,0.00021783185],"domain_scores_gemma":[0.9949767,0.003359521,0.00025836908,0.0002987386,0.0010055407,0.000101094105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073029066,0.00051431573,0.00035948123,0.0010168809,0.000328289,0.0006291319,0.00062528206,0.00048251063,0.0056305374],"category_scores_gemma":[0.0051948857,0.00016691041,0.00030006887,0.0018143782,0.00030870634,0.0013985058,0.0002671846,0.00038382216,0.0007283437],"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.0086766295,0.0016565017,0.029994482,0.0019770258,0.00024655275,0.00048135832,0.0003073688,0.27362752,0.23601541,0.017645914,0.014800363,0.41457102],"study_design_scores_gemma":[0.00034883578,0.011567889,0.04718476,0.0001204125,0.0003463813,0.0007110273,0.00040370988,0.43726242,0.4695176,0.006712239,0.025644237,0.00018039362],"about_ca_topic_score_codex":0.0021423397,"about_ca_topic_score_gemma":0.0019051752,"teacher_disagreement_score":0.0056305374,"about_ca_system_score_codex":0.0010461943,"about_ca_system_score_gemma":0.00038064018,"threshold_uncertainty_score":0.018835962},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13651219,0.0006291019,0.8244499,0.00033956653,0.00016123065,0.00010458133,0.00023689044,0.022350146,0.015216431],"genre_scores_gemma":[0.7337836,0.00033964802,0.25917646,0.00025308228,0.000049955288,0.00015934535,0.00038681854,0.001241924,0.004609221],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893445,0.000284868,0.00007014305,0.00021195794,0.0003745398,0.00012411716],"domain_scores_gemma":[0.99851936,0.00034818504,0.00018306804,0.00066874933,0.00023732056,0.000043318938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008592969,0.00045896647,0.00034098802,0.0007863115,0.000713909,0.00080333574,0.0011817185,0.0003353781,0.002846536],"category_scores_gemma":[0.0023195997,0.00041486468,0.0005025388,0.0009075168,0.000886382,0.0017132359,0.0012763815,0.00070525135,0.0006294526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012202604,0.00017187855,0.012895606,0.0006332741,0.00014995645,0.0010020115,0.00083622726,0.25735897,0.13025059,0.16847846,0.018562652,0.40844017],"study_design_scores_gemma":[0.00007244255,0.00022643618,0.0019184868,0.000051759467,0.00005404894,0.0003294784,0.00011135163,0.7932318,0.1353309,0.042053994,0.026568945,0.000050355942],"about_ca_topic_score_codex":0.00230145,"about_ca_topic_score_gemma":0.0029804392,"teacher_disagreement_score":0.002846536,"about_ca_system_score_codex":0.0011364731,"about_ca_system_score_gemma":0.0011998066,"threshold_uncertainty_score":0.009522617},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04309386,0.00079699693,0.79042274,0.0002478964,0.00032218036,0.00034817055,0.0010892961,0.1363213,0.027357535],"genre_scores_gemma":[0.35588717,0.0010523521,0.5282098,0.0008468402,0.0001667949,0.0006187703,0.0047459486,0.038065474,0.0704068],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991479,0.00011621994,0.0000679728,0.00019783579,0.0003388781,0.00013111299],"domain_scores_gemma":[0.9979126,0.0006668906,0.00017523664,0.00086685544,0.00032875114,0.00004959851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006132074,0.0009228609,0.0005412122,0.0010536244,0.0004070755,0.0009982977,0.0015382642,0.00075317844,0.013194654],"category_scores_gemma":[0.004215568,0.0006194439,0.0006145396,0.00060853193,0.0004887294,0.0017776121,0.0021023713,0.0013815364,0.007070484],"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.000674663,0.00020571289,0.003301674,0.00066203665,0.00006546561,0.0014319357,0.0010562334,0.011525327,0.12478782,0.046664782,0.054040007,0.7555843],"study_design_scores_gemma":[0.00021127601,0.00030283263,0.0056997733,0.00032457893,0.00020203114,0.003250657,0.0002719002,0.11885929,0.3630218,0.05794276,0.44967827,0.0002349089],"about_ca_topic_score_codex":0.00070756004,"about_ca_topic_score_gemma":0.0012655563,"teacher_disagreement_score":0.013194654,"about_ca_system_score_codex":0.00047124422,"about_ca_system_score_gemma":0.00048361756,"threshold_uncertainty_score":0.044140518},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018118743,0.0005278511,0.8642463,0.00048062965,0.0003819686,0.00018589477,0.0011488082,0.09125781,0.02365193],"genre_scores_gemma":[0.15549159,0.0006272373,0.80807,0.00061177695,0.00014828671,0.0005958802,0.0031139655,0.023772474,0.007568741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955688,0.0008568627,0.0003876059,0.0007160264,0.0021927173,0.00027792645],"domain_scores_gemma":[0.9887838,0.004300334,0.00083062594,0.0030627789,0.002718691,0.00030381023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021370954,0.0011889203,0.0008091554,0.0012072341,0.0006915359,0.0023825637,0.002121918,0.0010219222,0.0060912394],"category_scores_gemma":[0.018547155,0.0006034945,0.000882347,0.0023954555,0.0010116136,0.002487172,0.0015597274,0.0022527794,0.0066493438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001541659,0.00066310604,0.00854899,0.0021172618,0.00024706445,0.0009408993,0.00080523983,0.08117316,0.14551409,0.055798274,0.08459049,0.61805964],"study_design_scores_gemma":[0.00042392703,0.00036397844,0.005750664,0.0004621169,0.00009750024,0.0011919606,0.00016154588,0.48597252,0.24056889,0.0687572,0.19599098,0.00025872828],"about_ca_topic_score_codex":0.0023627428,"about_ca_topic_score_gemma":0.0018857215,"teacher_disagreement_score":0.0060912394,"about_ca_system_score_codex":0.0007754564,"about_ca_system_score_gemma":0.001761193,"threshold_uncertainty_score":0.020377219},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019564103,0.0002960569,0.85729486,0.00038870767,0.00036130613,0.000330465,0.0011768892,0.09172827,0.028859258],"genre_scores_gemma":[0.119387105,0.00051009713,0.84592426,0.00038762242,0.00012285795,0.0005268473,0.0035406547,0.012130485,0.017469984],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995296,0.000049317856,0.00004921585,0.00012341587,0.00018467293,0.00006381261],"domain_scores_gemma":[0.99906653,0.00031151957,0.00009582753,0.00021900776,0.0002633397,0.000043703625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045167023,0.0006263571,0.00029484523,0.0005040464,0.0004966534,0.00061716564,0.0007358031,0.0004268794,0.010876166],"category_scores_gemma":[0.0030991384,0.00037273645,0.0006610397,0.0005459652,0.00039222193,0.0007347398,0.0007158704,0.0013440754,0.0042519434],"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.00050462864,0.0001635746,0.003667533,0.0009584679,0.00015691425,0.0010748493,0.00061696593,0.08777956,0.07579909,0.06893941,0.12911478,0.6312243],"study_design_scores_gemma":[0.0003019524,0.00023899182,0.0038969822,0.0003109393,0.00011975288,0.00094611174,0.000088740744,0.4364511,0.093457565,0.041514255,0.4225026,0.00017096843],"about_ca_topic_score_codex":0.0032600765,"about_ca_topic_score_gemma":0.003375834,"teacher_disagreement_score":0.010876166,"about_ca_system_score_codex":0.00036085103,"about_ca_system_score_gemma":0.0012322435,"threshold_uncertainty_score":0.036384463},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1869342,0.0013706977,0.80703884,0.0003596155,0.00012509151,0.00011882367,0.000023532035,0.0010594199,0.0029697763],"genre_scores_gemma":[0.7730381,0.00043443384,0.22528374,0.000089074856,0.00008302761,0.000081028054,0.000040033603,0.000099372555,0.00085119123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869776,0.0004880997,0.000087682194,0.0001340303,0.00040135818,0.00019115406],"domain_scores_gemma":[0.99705976,0.001318368,0.00039530257,0.0006111208,0.00048225434,0.00013319426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001770932,0.00050092733,0.00075747917,0.00066696317,0.00096703944,0.0010948615,0.0011819026,0.0004905517,0.0006117614],"category_scores_gemma":[0.0051628132,0.0002947474,0.00037902629,0.0011892851,0.00097182096,0.0015365339,0.00082256587,0.00068547897,0.00012982628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046946813,0.00026390562,0.0065680346,0.0002931372,0.00012205102,0.00020744457,0.00035065395,0.6053852,0.060059506,0.045153454,0.0025941343,0.27853307],"study_design_scores_gemma":[0.00003443695,0.00013709711,0.00048905186,0.000012192825,0.00003054383,0.000057802306,0.000053157535,0.96196413,0.017309656,0.017191207,0.0027048683,0.000015883134],"about_ca_topic_score_codex":0.0019225834,"about_ca_topic_score_gemma":0.002781302,"teacher_disagreement_score":0.0019225834,"about_ca_system_score_codex":0.0010222109,"about_ca_system_score_gemma":0.0019504664,"threshold_uncertainty_score":0.009365678},"labels":[],"label_agreement":null},{"id":"W4240517907","doi":"10.1145/2499368.2451157","title":"Traffic management","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Locality; Operating system; Linux kernel; Page fault; Embedded system; Virtual memory; Memory management; Overlay","score_opus":0.015768171220470858,"score_gpt":0.2423602508148654,"score_spread":0.22659207959439454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240517907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08081318,0.003521326,0.68938106,0.0029385295,0.0029693327,0.001936285,0.0033718643,0.065558165,0.14951016],"genre_scores_gemma":[0.7034687,0.0021320004,0.18751027,0.001380085,0.0011997815,0.0011516211,0.008248107,0.0038611763,0.091048315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976936,0.00025882787,0.0001850211,0.0005862576,0.0007769611,0.00049924414],"domain_scores_gemma":[0.99584717,0.00041830033,0.00025938498,0.0011818866,0.0018751355,0.00041816075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017411958,0.0015383016,0.0011681959,0.0027905204,0.0033392694,0.0054195435,0.0042336634,0.0013387225,0.017560923],"category_scores_gemma":[0.0060973424,0.00053125696,0.00079217635,0.0022597257,0.0007049778,0.0039757504,0.0028648844,0.001535741,0.008692427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072705874,0.0005921838,0.006564836,0.0003297615,0.00012622541,0.00034807378,0.0005407436,0.055067454,0.02960156,0.056056775,0.11920817,0.7308371],"study_design_scores_gemma":[0.00011737099,0.00039574405,0.003609361,0.000125307,0.00016475173,0.0005098534,0.0005649761,0.57768595,0.04410289,0.05918491,0.31333414,0.00020475234],"about_ca_topic_score_codex":0.006654527,"about_ca_topic_score_gemma":0.005470211,"teacher_disagreement_score":0.017560923,"about_ca_system_score_codex":0.0029148269,"about_ca_system_score_gemma":0.0032021652,"threshold_uncertainty_score":0.058747172},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09998575,0.0009844161,0.88082796,0.00028559024,0.00007993714,0.000064249434,0.00028433633,0.010880383,0.0066073965],"genre_scores_gemma":[0.4816473,0.0006573485,0.5088894,0.00019305425,0.000069547896,0.000096894386,0.00064348563,0.0028087313,0.004994231],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989247,0.00024276285,0.00009911621,0.00015477724,0.0004322135,0.00014645018],"domain_scores_gemma":[0.9984792,0.0005509625,0.00016594904,0.0004982654,0.00027728334,0.000028290424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082437217,0.00050175266,0.0004992266,0.0009976184,0.0008521045,0.0012469604,0.00088408473,0.00034880807,0.003134849],"category_scores_gemma":[0.003091865,0.0004211397,0.00066127506,0.0014722478,0.0009134476,0.0024765732,0.0009521795,0.001137696,0.0005263228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094184827,0.00017446809,0.008495666,0.00065405166,0.0001790127,0.00037264288,0.0009270213,0.1367976,0.20146856,0.117011465,0.0066972426,0.5262804],"study_design_scores_gemma":[0.00012473056,0.00023247581,0.0069024023,0.00013238519,0.00022429356,0.00033874356,0.000304024,0.45398924,0.332919,0.16981749,0.03488425,0.00013095957],"about_ca_topic_score_codex":0.0025619746,"about_ca_topic_score_gemma":0.003935557,"teacher_disagreement_score":0.003134849,"about_ca_system_score_codex":0.00076754106,"about_ca_system_score_gemma":0.001298489,"threshold_uncertainty_score":0.01048708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31296673,0.00021898077,0.6771054,0.000119155935,0.00004471263,0.00008413655,0.00006620171,0.004445936,0.0049487487],"genre_scores_gemma":[0.7629302,0.00011819692,0.23414855,0.00006573043,0.000019952733,0.000050059993,0.00015909792,0.00022437987,0.0022838125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998072,0.000042797095,0.000014657013,0.00003472888,0.000057898505,0.000042692656],"domain_scores_gemma":[0.99914217,0.00037066624,0.00012596704,0.00016033182,0.00016365148,0.000037201004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039346959,0.00032381353,0.00018618972,0.00021953142,0.0002552706,0.00026886913,0.00041466326,0.00014897436,0.0009796148],"category_scores_gemma":[0.0014271404,0.0001800007,0.00024153707,0.00024240611,0.00040598362,0.00046183096,0.00035408983,0.0003279471,0.00017745301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007435621,0.00014580505,0.011039246,0.00033601045,0.000058499467,0.00053636177,0.0006803284,0.16202353,0.29530433,0.052365553,0.00441442,0.4723524],"study_design_scores_gemma":[0.000084932304,0.0005835105,0.0021044065,0.000029272203,0.00006107825,0.0004203714,0.00004782885,0.6333437,0.31947654,0.023976222,0.019837745,0.00003442523],"about_ca_topic_score_codex":0.0012934721,"about_ca_topic_score_gemma":0.00181579,"teacher_disagreement_score":0.0012934721,"about_ca_system_score_codex":0.00027654495,"about_ca_system_score_gemma":0.0009243608,"threshold_uncertainty_score":0.003277123},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030124301,0.0012159548,0.53720105,0.0012327651,0.0011479822,0.00036928197,0.006393891,0.24436456,0.17795023],"genre_scores_gemma":[0.39566758,0.0010030045,0.3709584,0.0013619866,0.0003977648,0.00071374053,0.017585056,0.025684875,0.18662761],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993635,0.00010196873,0.00003501427,0.00013502802,0.00028845426,0.00007603872],"domain_scores_gemma":[0.9988859,0.00021658394,0.000071467664,0.0003995383,0.00033539385,0.00009109384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063562515,0.0006794727,0.0005403591,0.0006529273,0.00062938896,0.0015162028,0.0015436037,0.0007355995,0.057155635],"category_scores_gemma":[0.0022018955,0.00041947074,0.0005503674,0.00046874434,0.00043365447,0.0013671215,0.0012766327,0.0011708032,0.024479067],"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.001514049,0.00024060723,0.0028871808,0.0008086579,0.00009878881,0.00038024617,0.00028502438,0.029181698,0.042256273,0.055330615,0.2726693,0.5943476],"study_design_scores_gemma":[0.00027145483,0.0002205002,0.0014028938,0.0000762599,0.000038434082,0.00050480943,0.00004599791,0.23905544,0.06044053,0.027896916,0.6699759,0.00007096723],"about_ca_topic_score_codex":0.0017795212,"about_ca_topic_score_gemma":0.0018370427,"teacher_disagreement_score":0.057155635,"about_ca_system_score_codex":0.00068398524,"about_ca_system_score_gemma":0.0010496541,"threshold_uncertainty_score":0},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009484823,0.0040268945,0.45046562,0.00095671765,0.00081723405,0.0003815168,0.0018761015,0.022850586,0.5091405],"genre_scores_gemma":[0.14636654,0.004786996,0.32379618,0.0011364052,0.00064731616,0.0005673263,0.005261497,0.005056664,0.512381],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99929047,0.00008307129,0.000039534363,0.00014410185,0.00035927462,0.0000835092],"domain_scores_gemma":[0.99913496,0.00011363683,0.000019401094,0.00049494614,0.00018334834,0.00005380683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006455447,0.0007874727,0.0007651916,0.000740337,0.0007760496,0.0033442338,0.0020317845,0.0006889632,0.0852599],"category_scores_gemma":[0.0015369238,0.0006733907,0.0006700193,0.0018375462,0.0005357869,0.0033601057,0.0021432196,0.0016039868,0.03868656],"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.00024242979,0.00017097831,0.000489586,0.0005201575,0.000046829336,0.00013973647,0.0003813134,0.0037690978,0.022156935,0.25042233,0.16357829,0.5580823],"study_design_scores_gemma":[0.000042361382,0.00008662895,0.0005497077,0.00009789813,0.00003271056,0.0005633004,0.000053657157,0.020465566,0.029666528,0.105046004,0.84334755,0.000047988735],"about_ca_topic_score_codex":0.00052893895,"about_ca_topic_score_gemma":0.00085221214,"teacher_disagreement_score":0.0852599,"about_ca_system_score_codex":0.0005068545,"about_ca_system_score_gemma":0.0009233469,"threshold_uncertainty_score":0.28522277},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092568256,0.0022473019,0.61170965,0.00057359424,0.0005136833,0.0011248834,0.018694691,0.2212566,0.051311385],"genre_scores_gemma":[0.4738402,0.0006273195,0.4833782,0.0005169802,0.00021675345,0.0010694466,0.012926503,0.009294722,0.018129844],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974044,0.00035584628,0.00013832632,0.0005096514,0.0013774886,0.00021437908],"domain_scores_gemma":[0.99000883,0.0022754187,0.0010330915,0.0032608064,0.0032608653,0.00016104605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017666118,0.0013956194,0.0009803398,0.0034018478,0.0005655926,0.0012652382,0.0030114069,0.000958974,0.017253956],"category_scores_gemma":[0.012141335,0.00059497956,0.00060306303,0.0026630901,0.0003282671,0.0014851622,0.0010608966,0.000879623,0.0080353],"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.001324924,0.00032949532,0.00899977,0.00085870543,0.0001808439,0.0004185519,0.00023498056,0.09015856,0.044256162,0.014884181,0.12524518,0.7131086],"study_design_scores_gemma":[0.00022682764,0.00046153247,0.009457747,0.0001074907,0.000072831936,0.0009896008,0.00007605567,0.7595081,0.10362919,0.008027889,0.11711329,0.00032943604],"about_ca_topic_score_codex":0.0061260695,"about_ca_topic_score_gemma":0.006295833,"teacher_disagreement_score":0.017253956,"about_ca_system_score_codex":0.001220214,"about_ca_system_score_gemma":0.0014858787,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018242968,0.00008045358,0.97382665,0.00019337727,0.000047666534,0.00011374397,0.00010941259,0.004379044,0.003006764],"genre_scores_gemma":[0.45035103,0.00023110952,0.5391622,0.0005426495,0.00017270967,0.00040996913,0.00043654122,0.0026923397,0.0060014776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944353,0.0010710615,0.0003471206,0.0007462433,0.002779201,0.00062111905],"domain_scores_gemma":[0.9896108,0.00403034,0.0005930245,0.0041675367,0.0014599821,0.00013826582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003181313,0.0015385507,0.001404902,0.0022683847,0.0011951592,0.0033373747,0.0033148858,0.0011822112,0.003990894],"category_scores_gemma":[0.01541119,0.0013126795,0.0022265934,0.0016834008,0.0024012157,0.006528441,0.004308393,0.0035116486,0.0011970737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010313207,0.00020852173,0.004049615,0.00039742206,0.00019962713,0.00047455117,0.0007884571,0.22356848,0.029899921,0.4531835,0.006389332,0.27980918],"study_design_scores_gemma":[0.00006506012,0.00014118756,0.0003888858,0.00005958808,0.00014129086,0.00014660266,0.000084457904,0.6057832,0.04539808,0.33847216,0.00925679,0.00006266672],"about_ca_topic_score_codex":0.002007263,"about_ca_topic_score_gemma":0.0019293783,"teacher_disagreement_score":0.003990894,"about_ca_system_score_codex":0.0012328399,"about_ca_system_score_gemma":0.0018855185,"threshold_uncertainty_score":0.016824543},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4027745,0.026876418,0.22774628,0.009967446,0.004403505,0.0011084249,0.029838415,0.04459102,0.25269395],"genre_scores_gemma":[0.55251676,0.009646816,0.24160378,0.0057801236,0.0004106073,0.00103845,0.03201667,0.0046665566,0.15232031],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995658,0.00004983518,0.000027308886,0.00017070741,0.000119201504,0.000067220266],"domain_scores_gemma":[0.9995621,0.00008180265,0.000084084335,0.00011869299,0.00006863424,0.00008463261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003674242,0.0009547831,0.00071854354,0.0010153174,0.0021521233,0.0021003436,0.0012586615,0.001582391,0.013726703],"category_scores_gemma":[0.0010294694,0.0005482412,0.0009487021,0.00079648395,0.00082308333,0.0017288078,0.0016101181,0.002071352,0.009252365],"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.0026782888,0.00033838037,0.007819557,0.0028884348,0.00024934343,0.0019005854,0.0012966292,0.006089281,0.5719751,0.07908121,0.09295133,0.23273188],"study_design_scores_gemma":[0.00013482744,0.0004991193,0.0057988334,0.0003045508,0.00015104465,0.002513164,0.00028041235,0.007426929,0.062113866,0.013899003,0.9067794,0.00009895977],"about_ca_topic_score_codex":0.0014801908,"about_ca_topic_score_gemma":0.0019901148,"teacher_disagreement_score":0.013726703,"about_ca_system_score_codex":0.0011374783,"about_ca_system_score_gemma":0.00092552905,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029830125,0.00017075856,0.99471325,0.00012551779,0.000015062414,0.000034622066,0.00008474738,0.0002080401,0.0016649431],"genre_scores_gemma":[0.29103875,0.0014761945,0.6991915,0.00015397336,0.00011949036,0.00081850315,0.00048300647,0.00040149788,0.0063170777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993855,0.00017797746,0.000029887151,0.0001037588,0.0002373944,0.00006536931],"domain_scores_gemma":[0.99909186,0.00049845007,0.000116647134,0.00011806446,0.00014250271,0.000032567335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011028143,0.00095211144,0.00092552765,0.0008534909,0.0005980406,0.0011280532,0.0020682376,0.00110966,0.0020956784],"category_scores_gemma":[0.0030100944,0.000739315,0.0010094157,0.0009442812,0.0012357556,0.0018752614,0.0008014823,0.0018271819,0.00045601345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007029978,0.000015591899,0.00019853922,0.000021422795,0.000011153307,0.000019018738,0.000020780664,0.94983315,0.0006153738,0.0448829,0.0003151394,0.004059868],"study_design_scores_gemma":[0.000001956923,0.00000571079,0.000030904317,0.0000034555735,0.0000027910046,0.0000047267417,0.0000033791907,0.9869419,0.00013868634,0.012056888,0.0008066722,0.0000030223405],"about_ca_topic_score_codex":0.010179657,"about_ca_topic_score_gemma":0.008385325,"teacher_disagreement_score":0.010179657,"about_ca_system_score_codex":0.0015187148,"about_ca_system_score_gemma":0.0024239027,"threshold_uncertainty_score":0.020240843},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011553472,0.0067800987,0.60961074,0.0016723096,0.00091615255,0.00011409985,0.0001298371,0.002714988,0.36650825],"genre_scores_gemma":[0.34923235,0.008567115,0.27683157,0.00098108,0.0007464965,0.00027423978,0.00040764807,0.0017185268,0.36124098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916565,0.0001281891,0.00002731285,0.00015359296,0.00042354158,0.00010173915],"domain_scores_gemma":[0.99920696,0.00022465306,0.000036026264,0.00032930818,0.00013117926,0.000071983064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006888539,0.0007847411,0.0005156907,0.0006659638,0.000917838,0.0022758208,0.0013481375,0.00059195457,0.027437773],"category_scores_gemma":[0.0023460458,0.000488116,0.00050360884,0.00080791424,0.0015341889,0.004443306,0.003215448,0.002307559,0.0064068437],"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.00008951936,0.0000878023,0.00021495805,0.00023654003,0.000022354328,0.00007811458,0.00038674596,0.008814525,0.015240499,0.6868325,0.016045775,0.27195075],"study_design_scores_gemma":[0.000032681455,0.0000665875,0.00026641806,0.00016718525,0.000046037498,0.00045877416,0.00013308035,0.035432637,0.024370648,0.5639762,0.37500927,0.000040524475],"about_ca_topic_score_codex":0.00087394664,"about_ca_topic_score_gemma":0.0012605818,"teacher_disagreement_score":0.027437773,"about_ca_system_score_codex":0.0008578606,"about_ca_system_score_gemma":0.0011740548,"threshold_uncertainty_score":0.09178853},"labels":[],"label_agreement":null},{"id":"W4242116028","doi":"10.1145/3140587.3062346","title":"Miniphases: compilation using modular and efficient tree transformations","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Compiler; Tree traversal; Programming language; Modular design; Just-in-time compilation; Intermediate language; Optimizing compiler; Parallel computing; Cache; Modularity (biology); Compiler correctness; Dynamic compilation","score_opus":0.046258631912153465,"score_gpt":0.3064293902375374,"score_spread":0.26017075832538394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242116028","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020067828,0.00014424136,0.94852185,0.00009114261,0.00008405664,0.0001432371,0.00022129845,0.025001017,0.005725383],"genre_scores_gemma":[0.21209843,0.0002629311,0.76725143,0.00021931896,0.0000867484,0.00032064662,0.0012789485,0.010492199,0.00798926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990982,0.00021087923,0.00006790332,0.00016525744,0.00033791232,0.000119904675],"domain_scores_gemma":[0.9983109,0.00046483133,0.00014150869,0.0007855228,0.00022794055,0.00006933626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010032539,0.00074696273,0.00047134756,0.00087312685,0.00043978862,0.0010784633,0.0011828392,0.00044961876,0.004787148],"category_scores_gemma":[0.0029763114,0.00068541424,0.001154825,0.00083999045,0.000757959,0.0018003399,0.0018904813,0.0011043851,0.0022491599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060443336,0.00039474308,0.004616777,0.00062695926,0.00017539333,0.0005169088,0.0009324292,0.102094516,0.14181836,0.09375465,0.032420337,0.62204444],"study_design_scores_gemma":[0.00024220943,0.00048889825,0.0023418185,0.00011099186,0.00014317052,0.0008708158,0.00017940866,0.60951674,0.18133031,0.09724684,0.10741073,0.00011815179],"about_ca_topic_score_codex":0.0008230417,"about_ca_topic_score_gemma":0.001549023,"teacher_disagreement_score":0.004787148,"about_ca_system_score_codex":0.00043271974,"about_ca_system_score_gemma":0.0013266684,"threshold_uncertainty_score":0.016014576},"labels":[],"label_agreement":null},{"id":"W4242224286","doi":"10.1145/2398857.2384678","title":"Exploiting inter-sequence correlations for program behavior prediction","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"National Science Foundation","keywords":"Computer science; Scope (computer science); Locality; Speedup; Sequence (biology); Program analysis; Machine learning; Artificial intelligence; Programming language; Parallel computing","score_opus":0.07910759505903991,"score_gpt":0.3395400838164095,"score_spread":0.2604324887573696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242224286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16998467,0.0005419726,0.82305396,0.00025320912,0.000036288366,0.00008838579,0.00044117958,0.0038212186,0.0017791013],"genre_scores_gemma":[0.84180707,0.00037282708,0.15603073,0.00006878849,0.0000473144,0.00013519994,0.0006386427,0.00022511082,0.0006743401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881613,0.0003098187,0.0000742349,0.00022349673,0.0004903673,0.000086065134],"domain_scores_gemma":[0.9912191,0.004456962,0.0017436339,0.0013192866,0.0010509292,0.00021006209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012362024,0.0008843493,0.00061578903,0.0019038535,0.0004345075,0.00069507083,0.0006110776,0.00041646752,0.0007998903],"category_scores_gemma":[0.010076551,0.00052547036,0.00035816373,0.0018794091,0.00049460866,0.0018356293,0.00059047376,0.0011628346,0.00038113818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048157354,0.00035251866,0.09784522,0.00028468523,0.00012700248,0.0002968284,0.00033872982,0.4573643,0.035880823,0.016081328,0.0031939964,0.387753],"study_design_scores_gemma":[0.0000073784936,0.000120388824,0.004678649,0.000016877595,0.000025561882,0.00007600086,0.000024622812,0.9752343,0.010768059,0.00773607,0.0012891893,0.000022832486],"about_ca_topic_score_codex":0.0020854075,"about_ca_topic_score_gemma":0.0053421687,"teacher_disagreement_score":0.0020854075,"about_ca_system_score_codex":0.00055819657,"about_ca_system_score_gemma":0.0014458343,"threshold_uncertainty_score":0.0065377355},"labels":[],"label_agreement":null},{"id":"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012989625,0.29904252,0.6513991,0.00082752533,0.00030285137,0.00010619967,0.00020695828,0.0008435318,0.03428166],"genre_scores_gemma":[0.15591116,0.36589548,0.45469698,0.00064008497,0.0007497693,0.000328029,0.0006910677,0.0009875495,0.020099904],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993585,0.000117506606,0.000063740685,0.00011990035,0.00028795478,0.000052410964],"domain_scores_gemma":[0.9996092,0.00019797601,0.000037334354,0.000045596797,0.000097207034,0.000012750193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005761294,0.0014535617,0.0013420084,0.0017585292,0.0005114002,0.0013432411,0.001306839,0.00090513256,0.0034050825],"category_scores_gemma":[0.0010630125,0.000861128,0.0010999637,0.003592877,0.00050384755,0.0018516928,0.0006263631,0.00093280664,0.0014427237],"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.00012606625,0.0001444789,0.0008026219,0.0029023043,0.00009683698,0.00009507636,0.00012744444,0.13699248,0.010363724,0.06334329,0.008431628,0.7765741],"study_design_scores_gemma":[0.000052489315,0.00046573594,0.0020736489,0.0011089656,0.00016371382,0.000704976,0.00017019485,0.66281,0.026199939,0.07883003,0.2272779,0.0001423897],"about_ca_topic_score_codex":0.0014834004,"about_ca_topic_score_gemma":0.0012596324,"teacher_disagreement_score":0.0034050825,"about_ca_system_score_codex":0.0008302132,"about_ca_system_score_gemma":0.00073646393,"threshold_uncertainty_score":0.011391163},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6894079,0.0014768583,0.27925307,0.0006388697,0.00027032313,0.00015885082,0.00025505887,0.0036208539,0.02491833],"genre_scores_gemma":[0.87826276,0.00035171735,0.11509466,0.00013675663,0.000041210944,0.0000809504,0.00022200926,0.00017973768,0.005630086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977344,0.000037105987,0.0000108278255,0.000060893777,0.00007281285,0.000044929595],"domain_scores_gemma":[0.99959105,0.000094504976,0.00006181401,0.000115681745,0.00008918483,0.00004776835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021048692,0.00038017434,0.00024263759,0.00044952298,0.00039241512,0.0006073496,0.0012868488,0.00032343433,0.0036253093],"category_scores_gemma":[0.0006530054,0.00022408282,0.00033337795,0.0005882706,0.0003369186,0.0010246865,0.0004729827,0.00068799313,0.0005905058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012381813,0.0004513797,0.008011659,0.0004023959,0.00020800141,0.00048851344,0.00028056247,0.42139518,0.28379312,0.027824873,0.010762438,0.24514373],"study_design_scores_gemma":[0.00017479039,0.0020062116,0.004474845,0.00003128659,0.00012598399,0.0004801383,0.000083584295,0.86458087,0.09459543,0.008057825,0.025331141,0.000057887595],"about_ca_topic_score_codex":0.001135409,"about_ca_topic_score_gemma":0.0018084937,"teacher_disagreement_score":0.0036253093,"about_ca_system_score_codex":0.0006337793,"about_ca_system_score_gemma":0.00051894586,"threshold_uncertainty_score":0.012127876},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032399032,0.0013687805,0.7025492,0.0017264322,0.0023747433,0.00034190418,0.0073271454,0.019838374,0.23207429],"genre_scores_gemma":[0.29285297,0.0017198033,0.3488245,0.0009011259,0.0014806013,0.00037574224,0.0106949005,0.009730712,0.33341977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903405,0.0001233414,0.00006577504,0.0002535369,0.00040033713,0.00012291115],"domain_scores_gemma":[0.99824464,0.00017114592,0.0001193995,0.00096012227,0.00035121554,0.00015360351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000664214,0.0014398388,0.0008628951,0.0025815058,0.0013421777,0.0038339293,0.0013372031,0.0009054754,0.10008986],"category_scores_gemma":[0.0026927588,0.00062280754,0.00095658505,0.0021794382,0.001511276,0.0049425676,0.0023461864,0.0018019207,0.02993458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053867995,0.00012460402,0.0008387498,0.00032178013,0.00007319464,0.00031219752,0.00022604721,0.009445638,0.019326925,0.46503973,0.10124301,0.4025094],"study_design_scores_gemma":[0.0000781477,0.00014747505,0.001003843,0.00007989958,0.00007659293,0.00081067195,0.0001334428,0.05643326,0.03579697,0.4680122,0.4373321,0.00009539337],"about_ca_topic_score_codex":0.0015154487,"about_ca_topic_score_gemma":0.0021803675,"teacher_disagreement_score":0.10008986,"about_ca_system_score_codex":0.00070482667,"about_ca_system_score_gemma":0.00078622095,"threshold_uncertainty_score":0.33483392},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5920835,0.0026115105,0.39104995,0.0006874392,0.00025734585,0.00009320635,0.00013806557,0.005315174,0.007763827],"genre_scores_gemma":[0.97763,0.00028039748,0.019328516,0.00014407786,0.00003436746,0.000032745684,0.000049466536,0.00014916147,0.0023512172],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996762,0.00006564644,0.00002577055,0.00006789286,0.000082405626,0.00008212374],"domain_scores_gemma":[0.99922335,0.00025728176,0.00020177607,0.00020506365,0.00007160644,0.00004088807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034881552,0.0005209312,0.00033460252,0.0004023195,0.00045036818,0.0007369947,0.0009781776,0.00029906753,0.0021132857],"category_scores_gemma":[0.0015000592,0.00037881357,0.00018687858,0.00045406373,0.0005107747,0.0016990232,0.00075994787,0.0004534184,0.00031733752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016931217,0.00036085327,0.01478277,0.0006580027,0.00015062299,0.0012234244,0.0007545592,0.18269369,0.4353841,0.04766771,0.0070174267,0.30761364],"study_design_scores_gemma":[0.00012247307,0.0014984893,0.0045228973,0.0001020976,0.0002288825,0.00061453704,0.00020303544,0.55550236,0.40115905,0.016191531,0.019758932,0.000095785574],"about_ca_topic_score_codex":0.0010300856,"about_ca_topic_score_gemma":0.0029313525,"teacher_disagreement_score":0.0021132857,"about_ca_system_score_codex":0.00047968142,"about_ca_system_score_gemma":0.0009989381,"threshold_uncertainty_score":0.0070696473},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48112246,0.001248799,0.47195756,0.00036347183,0.00032366245,0.00041135607,0.00036325684,0.025294304,0.018915037],"genre_scores_gemma":[0.8748404,0.00020566404,0.11913382,0.00022857478,0.00005462401,0.00018570259,0.0004543984,0.000668123,0.0042287325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961746,0.00006766251,0.000025040554,0.00008477074,0.00010480895,0.00010018036],"domain_scores_gemma":[0.99943155,0.00012520718,0.00005689057,0.00012716338,0.00013984344,0.000119272714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005071287,0.0008326132,0.00045208482,0.00046732315,0.00046275594,0.00096061826,0.0017376323,0.0004070722,0.002248075],"category_scores_gemma":[0.0011456148,0.00024835413,0.00032440588,0.00041213812,0.00037131534,0.00094325066,0.00091218384,0.0005861804,0.00055918755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020677084,0.0010972125,0.015320813,0.00045092643,0.00025183815,0.00095803913,0.0006381962,0.39687797,0.25538817,0.02029615,0.02721101,0.279442],"study_design_scores_gemma":[0.000057035915,0.00020464322,0.00055805483,0.000008432727,0.000027870026,0.0000631986,0.00006270195,0.96410507,0.027386531,0.0018995897,0.005604541,0.000022239046],"about_ca_topic_score_codex":0.0025822977,"about_ca_topic_score_gemma":0.0066785756,"teacher_disagreement_score":0.0025822977,"about_ca_system_score_codex":0.00082327944,"about_ca_system_score_gemma":0.001249948,"threshold_uncertainty_score":0.0075205564},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9470642,0.0008977673,0.049020477,0.00016445747,0.0000140893135,0.000020073288,0.00010369117,0.00029502405,0.002420068],"genre_scores_gemma":[0.99472934,0.00015638798,0.004493758,0.0000146854,0.0000042562497,0.000018418581,0.00011666819,0.000059867678,0.00040663843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993081,0.00011827688,0.000024143754,0.00007106795,0.00031888988,0.00015940775],"domain_scores_gemma":[0.99381655,0.0042968607,0.0008471323,0.0003993295,0.000536742,0.00010340344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005691772,0.0005094179,0.0004287901,0.0007858864,0.00040306267,0.0008368758,0.0011134042,0.0008821498,0.0016809225],"category_scores_gemma":[0.0075690127,0.0003948981,0.0002961801,0.0012764528,0.0005777067,0.0029658363,0.0005925879,0.00083107356,0.00032939788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007725649,0.00017837653,0.019912155,0.00024345123,0.00008403265,0.00047967033,0.00017604131,0.90531087,0.048896458,0.0062546823,0.000570702,0.017121036],"study_design_scores_gemma":[0.00005105243,0.00047191675,0.012775347,0.000020273197,0.000039983257,0.00022927424,0.0001771106,0.9220208,0.05444631,0.008700978,0.0010193752,0.00004749384],"about_ca_topic_score_codex":0.0011756076,"about_ca_topic_score_gemma":0.0013363353,"teacher_disagreement_score":0.0016809225,"about_ca_system_score_codex":0.0006728653,"about_ca_system_score_gemma":0.0004155223,"threshold_uncertainty_score":0.0056232214},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6935998,0.008884656,0.28376117,0.0011350393,0.00021129048,0.0007277161,0.0007230122,0.0032612095,0.0076959883],"genre_scores_gemma":[0.7265186,0.0013162935,0.2681794,0.00014828058,0.000091499496,0.00058075844,0.000732349,0.00032583746,0.002107045],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9908483,0.005272643,0.000530139,0.00066833314,0.0023073254,0.0003732225],"domain_scores_gemma":[0.9168988,0.0635667,0.0031787124,0.008434382,0.0068967026,0.0010246888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0094001535,0.0009709081,0.0009854519,0.0025574726,0.0010532174,0.0013329922,0.0023460044,0.002328497,0.0021994151],"category_scores_gemma":[0.05111164,0.00049697753,0.0005582825,0.0023194652,0.0010853843,0.0034926895,0.0019978741,0.0011227529,0.00042327482],"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.0043989555,0.0020650767,0.02694028,0.0013802219,0.00041208602,0.00015649688,0.0005997206,0.43287304,0.0063714357,0.02259342,0.00703045,0.49517885],"study_design_scores_gemma":[0.0006893544,0.0014987332,0.0048749195,0.000091890695,0.00009560489,0.00020477959,0.0002481096,0.97693354,0.0063228053,0.0042361366,0.0047380016,0.00006617477],"about_ca_topic_score_codex":0.0039517023,"about_ca_topic_score_gemma":0.004167109,"teacher_disagreement_score":0.0094001535,"about_ca_system_score_codex":0.0020089974,"about_ca_system_score_gemma":0.0016841745,"threshold_uncertainty_score":0.049713373},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015752643,0.17975074,0.12559335,0.13085647,0.0029486674,0.00007211051,0.00022379232,0.0002509115,0.5445514],"genre_scores_gemma":[0.4208444,0.33376262,0.08488519,0.0210701,0.01263675,0.0003796948,0.0002683237,0.0005881305,0.12556483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877435,0.00038995815,0.00005799854,0.000111209316,0.00054582336,0.00012070724],"domain_scores_gemma":[0.99794763,0.0012980398,0.0001405077,0.00007642529,0.00039533287,0.00014211179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018289594,0.0012136677,0.00050857227,0.0025490907,0.0012397203,0.00722227,0.0012917436,0.0053375647,0.008574161],"category_scores_gemma":[0.0026183433,0.00057409005,0.0003759228,0.0022664422,0.0039639566,0.015555458,0.0015022627,0.0039637117,0.0015767914],"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.000019231902,0.000025293219,0.00011656981,0.00015498762,0.0000035367198,0.00015234834,0.00016904257,0.0019917637,0.0005204252,0.96023905,0.009968112,0.026639659],"study_design_scores_gemma":[0.00001641735,0.00008944642,0.00044124466,0.00046837734,0.000010948627,0.00055963604,0.0013434519,0.01235221,0.00077744614,0.51463425,0.46928075,0.00002592602],"about_ca_topic_score_codex":0.0023506025,"about_ca_topic_score_gemma":0.0034948108,"teacher_disagreement_score":0.008574161,"about_ca_system_score_codex":0.0028664388,"about_ca_system_score_gemma":0.0015500484,"threshold_uncertainty_score":0.028683424},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8833158,0.0006975155,0.097379506,0.00021511222,0.00009862164,0.00017183262,0.0005137088,0.013184034,0.004423829],"genre_scores_gemma":[0.8618202,0.00025524513,0.13326852,0.00014537355,0.00002394955,0.00012241155,0.0011517314,0.0016241838,0.0015883915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993253,0.00012908434,0.00006690284,0.00009600668,0.00025435805,0.00012831062],"domain_scores_gemma":[0.99728644,0.0010843957,0.00038176548,0.00044354255,0.0007296146,0.00007426725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005082791,0.0009523042,0.0003017566,0.0007523223,0.00041102993,0.0005506717,0.00090476515,0.00036144306,0.0015457806],"category_scores_gemma":[0.0042772014,0.00033543646,0.0003873801,0.0010061801,0.00032732365,0.0008219911,0.00042264568,0.0006035874,0.00043852127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009269395,0.0007064498,0.01710413,0.0004711314,0.00011076193,0.0005615139,0.000464867,0.42085505,0.32235307,0.0030765869,0.0074072634,0.22596228],"study_design_scores_gemma":[0.000099773984,0.00052442314,0.0067021674,0.00002631944,0.00007019829,0.0002278567,0.00019190935,0.8456896,0.13978414,0.0016071155,0.0050336625,0.00004290587],"about_ca_topic_score_codex":0.0026108266,"about_ca_topic_score_gemma":0.0051901187,"teacher_disagreement_score":0.0026108266,"about_ca_system_score_codex":0.00062843,"about_ca_system_score_gemma":0.0011912409,"threshold_uncertainty_score":0.005191207},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21157762,0.008720623,0.6278323,0.008920061,0.0022171815,0.0004338829,0.00022868163,0.0038422632,0.13622735],"genre_scores_gemma":[0.59183353,0.0030136318,0.36642808,0.0020900485,0.00040214436,0.00029920234,0.00015069128,0.0007952931,0.034987286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994746,0.0001387278,0.00006042696,0.000051577048,0.00018263569,0.00009207668],"domain_scores_gemma":[0.9992091,0.00023422914,0.000080619924,0.000104922816,0.00032337586,0.000047746187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001348716,0.00037811685,0.00023884371,0.0004979536,0.000543492,0.002058197,0.0005445972,0.0005451953,0.0018441167],"category_scores_gemma":[0.002633532,0.00057138404,0.0003798235,0.0006296572,0.0006939327,0.0019397535,0.0005705315,0.0017262584,0.0007363303],"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.00082775846,0.00011438627,0.0050686025,0.00076908804,0.000062881954,0.0010319693,0.0014604321,0.080117054,0.09849213,0.4793206,0.011304445,0.32143065],"study_design_scores_gemma":[0.00020706415,0.0014658641,0.005778164,0.00059254054,0.0003309737,0.0013738406,0.0009796333,0.16854888,0.09195879,0.19311556,0.5354744,0.0001742656],"about_ca_topic_score_codex":0.0010808439,"about_ca_topic_score_gemma":0.0030312552,"teacher_disagreement_score":0.002058197,"about_ca_system_score_codex":0.00064152,"about_ca_system_score_gemma":0.0015770302,"threshold_uncertainty_score":0.0071327686},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30226123,0.0013451552,0.6779853,0.00060957886,0.00009049157,0.00008080689,0.00012219665,0.0038229614,0.01368226],"genre_scores_gemma":[0.878648,0.00045235275,0.11249286,0.0001440248,0.000045353958,0.00006376541,0.00015261804,0.00033473404,0.0076663597],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998456,0.00001940288,0.0000079568445,0.000026182164,0.0000650301,0.000035725192],"domain_scores_gemma":[0.9998253,0.000042597203,0.0000387227,0.000040898034,0.00004031738,0.00001219909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018375425,0.00043421786,0.00023091368,0.00037294795,0.00026921288,0.00035631974,0.0007335728,0.00020868084,0.0030783915],"category_scores_gemma":[0.0005169799,0.0001890437,0.00017197167,0.0005588884,0.00022861958,0.0009373548,0.00044491803,0.00032081504,0.0005753466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003430313,0.00017389601,0.0020924646,0.00021774576,0.00003800012,0.00014437576,0.00011494942,0.071233094,0.5571106,0.019211462,0.0046616406,0.34465867],"study_design_scores_gemma":[0.00013185166,0.000789601,0.0033550886,0.000027829894,0.00007764706,0.00041181373,0.00007631972,0.6784432,0.25447708,0.03584946,0.026318766,0.000041379313],"about_ca_topic_score_codex":0.00068607106,"about_ca_topic_score_gemma":0.0014972812,"teacher_disagreement_score":0.0030783915,"about_ca_system_score_codex":0.00032004828,"about_ca_system_score_gemma":0.0004911178,"threshold_uncertainty_score":0.010298252},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1373189,0.00036040467,0.85486317,0.00013053989,0.000013641476,0.00004978465,0.00013639856,0.0011626995,0.005964577],"genre_scores_gemma":[0.8326931,0.0004997068,0.162787,0.000041222032,0.0000147040855,0.00008352651,0.000224604,0.00021980211,0.0034363917],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990463,0.000007980022,0.0000048238703,0.000018082368,0.000054745742,0.000009820014],"domain_scores_gemma":[0.99983084,0.00007376044,0.000028551096,0.00001660768,0.000044157674,0.0000060775346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011019355,0.00028731828,0.00022877133,0.0005384594,0.00026507257,0.00042791158,0.00037733978,0.00016508621,0.0017382734],"category_scores_gemma":[0.00045763364,0.00019147877,0.00022685209,0.00036393915,0.00034372392,0.00075287017,0.0001777965,0.00042447678,0.0004292596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002461834,0.0001049612,0.0073650414,0.00035486702,0.00005730222,0.00024364734,0.0005913695,0.2922558,0.35459918,0.04198501,0.0017144219,0.30048224],"study_design_scores_gemma":[0.0000074377763,0.00011017809,0.0019898154,0.000013152372,0.00001961199,0.00015979684,0.000058312144,0.9281715,0.05965479,0.0059850486,0.0038150845,0.000015206875],"about_ca_topic_score_codex":0.0013991538,"about_ca_topic_score_gemma":0.0013738365,"teacher_disagreement_score":0.0017382734,"about_ca_system_score_codex":0.00040758206,"about_ca_system_score_gemma":0.00034256588,"threshold_uncertainty_score":0.0058151484},"labels":[],"label_agreement":null},{"id":"W4244697326","doi":"10.1145/2499368.2451118","title":"GPUDet","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Debugging; Parallel computing; Scalability; Nondeterministic algorithm; Thread (computing); Compiler; Multi-core processor; Massively parallel; Correctness; Execution model; Programming language; Operating system; Theoretical computer science","score_opus":0.01849169908033233,"score_gpt":0.2516386902440366,"score_spread":0.2331469911637043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244697326","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024925575,0.0023547742,0.33664733,0.0024037017,0.0023568256,0.0006341798,0.0119006885,0.17479712,0.44397983],"genre_scores_gemma":[0.23989153,0.001956025,0.34920204,0.0034556214,0.00042790934,0.0008664367,0.03969775,0.02105577,0.34344697],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993198,0.00008490438,0.000039339233,0.0001553215,0.0003047164,0.000095899915],"domain_scores_gemma":[0.99905974,0.00009756911,0.000046051788,0.00034271448,0.00036482167,0.000089135814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005280058,0.0009735219,0.0006328877,0.0006936478,0.00069483375,0.0021507526,0.0024075932,0.0012650755,0.09432103],"category_scores_gemma":[0.001791605,0.0006196718,0.0006497224,0.00089849054,0.0004427953,0.0017197651,0.0021461197,0.0017901124,0.044936165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007860796,0.00015866158,0.0037937232,0.00050797005,0.00010474287,0.00040435212,0.00024126,0.012704792,0.02348613,0.09219724,0.54811805,0.31749696],"study_design_scores_gemma":[0.0001374237,0.0001444478,0.00093910965,0.00005394358,0.000024982455,0.0004017796,0.00003892828,0.05413234,0.01753532,0.01036743,0.9161721,0.000052209467],"about_ca_topic_score_codex":0.0034189618,"about_ca_topic_score_gemma":0.005516037,"teacher_disagreement_score":0.09432103,"about_ca_system_score_codex":0.0012396561,"about_ca_system_score_gemma":0.0013704429,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25403196,0.0040960214,0.6500306,0.0047476357,0.0005379405,0.00006312442,0.0009203028,0.0012666351,0.08430588],"genre_scores_gemma":[0.9660059,0.0013732152,0.011785464,0.00016700063,0.00016094022,0.00004496737,0.00049714494,0.00008922078,0.019876044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995105,0.00022823295,0.000022222515,0.000070631766,0.00011380331,0.000054590044],"domain_scores_gemma":[0.9985643,0.0008787109,0.00013523114,0.00013102576,0.00025456757,0.00003614925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010026351,0.00035597832,0.00055004907,0.0010673251,0.0003731421,0.0012017511,0.00043157247,0.0006511339,0.010187241],"category_scores_gemma":[0.006011121,0.00019537286,0.00046792845,0.0012098022,0.00053454586,0.0010755485,0.0005983733,0.0010183448,0.0009241896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000621307,0.000043210635,0.0030932908,0.00007764226,0.00007323843,0.00029033082,0.00017437252,0.28394797,0.0011265161,0.66229945,0.008879507,0.039932355],"study_design_scores_gemma":[0.000011192485,0.00002116471,0.0008499237,0.000023038667,0.000021821144,0.000034427278,0.000028038923,0.8037346,0.0004278366,0.1906876,0.004147443,0.00001285058],"about_ca_topic_score_codex":0.0069402615,"about_ca_topic_score_gemma":0.0035243698,"teacher_disagreement_score":0.010187241,"about_ca_system_score_codex":0.00085388863,"about_ca_system_score_gemma":0.00058060035,"threshold_uncertainty_score":0.03407973},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065462897,0.00038587212,0.45077142,0.002009152,0.0010544535,0.000499895,0.0108212065,0.4457166,0.08219508],"genre_scores_gemma":[0.12708606,0.0010090084,0.49652758,0.007155453,0.001487607,0.0015988356,0.051050644,0.15619908,0.15788577],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9962477,0.00049373286,0.00033248463,0.00049154356,0.0021353776,0.0002991924],"domain_scores_gemma":[0.98970675,0.0022230851,0.00068720477,0.0037794986,0.0031660567,0.0004373527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034847718,0.0021392787,0.0010352964,0.0019594997,0.0012645659,0.0041486328,0.0044378396,0.002266027,0.091958016],"category_scores_gemma":[0.011605935,0.0014189003,0.0011656992,0.0026135126,0.002203042,0.0036453602,0.003668385,0.0028188052,0.05678682],"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.00066100305,0.00014698898,0.001542324,0.0007567791,0.000087531225,0.0005009739,0.00020429345,0.006724078,0.022917507,0.030262962,0.71920943,0.21698616],"study_design_scores_gemma":[0.0003178401,0.00029211355,0.002946528,0.0002754252,0.00005212975,0.0009526782,0.00004762909,0.0723585,0.056019567,0.02857727,0.8379585,0.0002017344],"about_ca_topic_score_codex":0.0086082,"about_ca_topic_score_gemma":0.014181451,"teacher_disagreement_score":0.091958016,"about_ca_system_score_codex":0.002578509,"about_ca_system_score_gemma":0.0035429867,"threshold_uncertainty_score":0.30763018},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9762622,0.00054913276,0.017948974,0.00014855416,0.00004172823,0.00007302088,0.000121213765,0.0007656526,0.004089553],"genre_scores_gemma":[0.9823841,0.00014271575,0.016449723,0.00003841681,0.00000870996,0.000027272376,0.00011309153,0.000041509214,0.0007945696],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995765,0.000085384134,0.00002890317,0.00004897025,0.00012965205,0.00013059519],"domain_scores_gemma":[0.99847823,0.0006555712,0.00018547768,0.00025381235,0.00034818117,0.00007878923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004957786,0.00058822124,0.0002393101,0.0003849695,0.00031389072,0.0003483249,0.00081613206,0.00025354116,0.0014102565],"category_scores_gemma":[0.0019088864,0.0001929192,0.00019162761,0.00056677224,0.00029548965,0.00070477463,0.00022488052,0.00032380485,0.00017409606],"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.0024102428,0.0011735903,0.01170064,0.0007134881,0.0001486423,0.00031764625,0.00013423232,0.3481088,0.4503228,0.004369786,0.0038834314,0.1767167],"study_design_scores_gemma":[0.0002873464,0.005967704,0.010562837,0.000035823792,0.00014964095,0.00027448582,0.00009867627,0.65125644,0.32702467,0.00068591593,0.00361708,0.00003939949],"about_ca_topic_score_codex":0.002807848,"about_ca_topic_score_gemma":0.0032283126,"teacher_disagreement_score":0.002807848,"about_ca_system_score_codex":0.00062783365,"about_ca_system_score_gemma":0.00090099295,"threshold_uncertainty_score":0.005583048},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10238481,0.00066044054,0.87706834,0.00033174234,0.00011983071,0.00012277073,0.00026085842,0.013209902,0.005841286],"genre_scores_gemma":[0.30053332,0.00023052236,0.69504905,0.000200958,0.000057646255,0.00014663364,0.00047776892,0.001160393,0.0021437854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988285,0.00037794662,0.000094559226,0.00014401053,0.0004318153,0.00012315687],"domain_scores_gemma":[0.9978326,0.000855642,0.00030095284,0.0004480743,0.0005239049,0.000038872182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009935182,0.00072757155,0.0006362789,0.0013825695,0.0007746812,0.0008438713,0.0008198383,0.0003498743,0.0028683587],"category_scores_gemma":[0.0029574893,0.00054011965,0.00070520496,0.001824328,0.00076053507,0.0010247725,0.00089803775,0.00071758375,0.0009500174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012127053,0.00018778109,0.0048418157,0.0005167249,0.00014002578,0.00068015803,0.0004038887,0.30167085,0.08669146,0.058355596,0.01645627,0.5288428],"study_design_scores_gemma":[0.00012001473,0.00017150019,0.00075772847,0.000047482208,0.000054858363,0.0001930952,0.00008215888,0.8567291,0.09776448,0.029012924,0.015033739,0.000033033684],"about_ca_topic_score_codex":0.00096927944,"about_ca_topic_score_gemma":0.002004076,"teacher_disagreement_score":0.0028683587,"about_ca_system_score_codex":0.0007894013,"about_ca_system_score_gemma":0.0011859179,"threshold_uncertainty_score":0.009595573},"labels":[],"label_agreement":null},{"id":"W4245755273","doi":"10.1145/3263322","title":"Session details: Optimization","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Session (web analytics); Programming language; World Wide Web","score_opus":0.028576190589446028,"score_gpt":0.28137966886513127,"score_spread":0.2528034782756852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245755273","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019381315,0.0057288334,0.01771507,0.011688385,0.02481852,0.0011501545,0.034950517,0.008931617,0.8930788],"genre_scores_gemma":[0.0107956305,0.0023889625,0.003648087,0.001231318,0.0036138007,0.0003025641,0.009003387,0.0027145555,0.9663018],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99940586,0.00009665597,0.000022967986,0.00015849316,0.00018143747,0.00013461125],"domain_scores_gemma":[0.99894184,0.00020229658,0.000027550837,0.0002220461,0.00018648061,0.00041981196],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010744419,0.0017980438,0.002516597,0.0006819402,0.0014694962,0.0044900365,0.0016887793,0.0022953802,0.88300353],"category_scores_gemma":[0.0021242858,0.00043196653,0.0016184733,0.0015566095,0.00034719484,0.0016661128,0.0020874625,0.00246596,0.7286033],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020274894,0.00011910643,0.00005199347,0.0001766498,0.00002153675,0.000015861982,0.0000069801936,0.00047003682,0.0008885852,0.0016699939,0.957838,0.0385386],"study_design_scores_gemma":[0.00016690504,0.00015217166,0.0006374618,0.00007530256,0.000031855816,0.000037006535,0.00002404277,0.0020795155,0.0010513838,0.0030394045,0.992683,0.000022054684],"about_ca_topic_score_codex":0.0018165524,"about_ca_topic_score_gemma":0.0037934913,"teacher_disagreement_score":0.88300353,"about_ca_system_score_codex":0.0012189745,"about_ca_system_score_gemma":0.0018095511,"threshold_uncertainty_score":0.16688126},"labels":[],"label_agreement":null},{"id":"W4245783794","doi":"10.1145/1961296.1950391","title":"Flikker","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Dram; Embedded system; Correctness; Energy consumption; Software; Operating system; Computer hardware; Programming language","score_opus":0.051716058342789854,"score_gpt":0.25963449058543114,"score_spread":0.20791843224264128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245783794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056705974,0.005676885,0.6355458,0.004594336,0.002047336,0.00035461635,0.0015224235,0.056898575,0.23665404],"genre_scores_gemma":[0.45395696,0.0032865417,0.26529866,0.004369297,0.00048886484,0.0004042849,0.0028599428,0.009535193,0.25980026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867165,0.00013072047,0.000060381117,0.00029139052,0.0006253881,0.0002205631],"domain_scores_gemma":[0.99819034,0.00049026014,0.00012281157,0.0006774526,0.0004373095,0.00008181631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071962073,0.0010042207,0.0005251632,0.0008737464,0.0010343682,0.0020437527,0.0023813897,0.0013561718,0.03403904],"category_scores_gemma":[0.00406481,0.0004814512,0.00067144673,0.0008742761,0.0008964037,0.0036630717,0.0021171505,0.0018733792,0.01386666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005928724,0.00017756225,0.0017837582,0.0008869726,0.000070568116,0.00059168454,0.0004261453,0.025256675,0.050937153,0.07409997,0.1436649,0.7015117],"study_design_scores_gemma":[0.00013063278,0.00037921203,0.0017347102,0.00020034092,0.000118898824,0.0020243146,0.00017468199,0.10386632,0.120698854,0.058395498,0.7121054,0.00017113825],"about_ca_topic_score_codex":0.0019159266,"about_ca_topic_score_gemma":0.00348122,"teacher_disagreement_score":0.03403904,"about_ca_system_score_codex":0.001133799,"about_ca_system_score_gemma":0.0013876397,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034108907,0.0003465994,0.94791543,0.0009126829,0.00018197915,0.0001534966,0.00058412843,0.0034729245,0.012323858],"genre_scores_gemma":[0.49931607,0.00057331024,0.48010284,0.00071417144,0.00014031708,0.0006946717,0.0012626749,0.00086389866,0.01633203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980623,0.00038110197,0.00017422372,0.00058834977,0.0005473798,0.00024658637],"domain_scores_gemma":[0.99610066,0.0014465649,0.00029622015,0.0014235324,0.000542747,0.00019014311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009831013,0.0007993383,0.00087282737,0.00051790493,0.0011900256,0.0027354443,0.0023355936,0.001308387,0.0060047084],"category_scores_gemma":[0.005461069,0.0004735996,0.0015182573,0.00062935386,0.0028343902,0.0036827512,0.0025812995,0.0020542617,0.0012475401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060680613,0.0001317027,0.003171362,0.00037121875,0.00008561146,0.00036052568,0.0006905761,0.22530888,0.014755653,0.6913004,0.0060534356,0.05716382],"study_design_scores_gemma":[0.00007787917,0.00020579406,0.0003466435,0.00008113676,0.00009192667,0.00018666855,0.000117835516,0.59083396,0.012524748,0.36201283,0.03345369,0.00006694303],"about_ca_topic_score_codex":0.0051595257,"about_ca_topic_score_gemma":0.0059030186,"teacher_disagreement_score":0.0060047084,"about_ca_system_score_codex":0.001354768,"about_ca_system_score_gemma":0.0024327636,"threshold_uncertainty_score":0.020087779},"labels":[],"label_agreement":null},{"id":"W4245984267","doi":"10.1145/2714064.2660204","title":"Cybertron","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Ministry of Science and Technology of the People's Republic of China; National Natural Science Foundation of China","keywords":"Computer science; Granularity; Reduction (mathematics); Encoding (memory); Computation; Parallel computing; Focus (optics); Big data; State (computer science); Algorithm; Programming language; Operating system","score_opus":0.015045178171347663,"score_gpt":0.25070451830976737,"score_spread":0.23565934013841972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245984267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038090654,0.0032515477,0.57372195,0.0028857985,0.0014005447,0.00066526904,0.0046297517,0.10426727,0.27108726],"genre_scores_gemma":[0.24915387,0.0030020936,0.58101374,0.0024203744,0.0004434751,0.00089662464,0.019118676,0.013807742,0.13014343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876785,0.00015737535,0.00007207477,0.00030910957,0.00057819486,0.00011550052],"domain_scores_gemma":[0.9976417,0.0005256306,0.00015716553,0.00090299617,0.0006228728,0.00014965978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093572144,0.0009993869,0.0005825887,0.0009537189,0.00057034317,0.0019200068,0.002516045,0.00065474526,0.04646147],"category_scores_gemma":[0.0031337137,0.0005526751,0.00065057096,0.0011373834,0.00079763087,0.00362646,0.0020840862,0.001856245,0.014649414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012324947,0.00043776626,0.0025645846,0.0009559615,0.00009215526,0.0002138018,0.0002038491,0.02679134,0.037159324,0.094680324,0.21173444,0.6239339],"study_design_scores_gemma":[0.0003240669,0.0007689856,0.0020708418,0.00017793446,0.00009029208,0.0006155518,0.00010327346,0.21850055,0.07744169,0.043686114,0.65610385,0.00011685387],"about_ca_topic_score_codex":0.0020684297,"about_ca_topic_score_gemma":0.004190402,"teacher_disagreement_score":0.04646147,"about_ca_system_score_codex":0.0013297606,"about_ca_system_score_gemma":0.002306052,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011622603,0.0009098362,0.7001434,0.0019333281,0.0031797723,0.00041079163,0.004970297,0.035497095,0.24133289],"genre_scores_gemma":[0.115444876,0.0010991695,0.69420385,0.0011365863,0.00083996454,0.0006134854,0.006755922,0.015575712,0.16433047],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999074,0.00007742238,0.00004273815,0.0001364524,0.0005176428,0.00015179787],"domain_scores_gemma":[0.99899095,0.00022061638,0.00004007368,0.00021154263,0.0004502231,0.00008646665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005354142,0.0015010444,0.0007824599,0.0016322727,0.0008200669,0.0017175905,0.0011175392,0.000532651,0.2375036],"category_scores_gemma":[0.003755708,0.0004245866,0.00080682326,0.0011163636,0.0005242242,0.002153458,0.0019996662,0.0016589004,0.12275262],"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.00017536235,0.000112641945,0.000640805,0.00041697538,0.000028470566,0.00029508022,0.00017196528,0.0023628492,0.010372175,0.045284793,0.37146407,0.56867474],"study_design_scores_gemma":[0.00013061478,0.00018302735,0.0012968482,0.00012467295,0.000030930907,0.0012211713,0.00024575435,0.045178562,0.031127622,0.12099684,0.79937094,0.0000930124],"about_ca_topic_score_codex":0.0018772876,"about_ca_topic_score_gemma":0.0040400284,"teacher_disagreement_score":0.2375036,"about_ca_system_score_codex":0.00045475937,"about_ca_system_score_gemma":0.00078846427,"threshold_uncertainty_score":0.7945287},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022141816,0.00031660302,0.97323596,0.00013420908,0.000054604046,0.00008023121,0.000066752444,0.0018998628,0.0020700076],"genre_scores_gemma":[0.13118955,0.0004543105,0.8630986,0.00009030335,0.00004712312,0.00014283031,0.00034568875,0.00027422307,0.0043573477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957997,0.000039803937,0.000022439157,0.00004735182,0.0002678869,0.000042578104],"domain_scores_gemma":[0.9995803,0.00013827147,0.000053852844,0.00011174628,0.00009851028,0.00001722401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004942762,0.0005707826,0.00058516226,0.0009756767,0.0004372498,0.000988571,0.0010015282,0.0004644536,0.0022301227],"category_scores_gemma":[0.001509929,0.00022674439,0.00039240406,0.0012920727,0.0006042796,0.0015593071,0.0007173769,0.0006736308,0.0013409659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052765897,0.00020691896,0.0009534126,0.00028455077,0.00006981834,0.0002541751,0.00022869007,0.14536679,0.11441061,0.044100963,0.004943964,0.68865246],"study_design_scores_gemma":[0.0000979049,0.00015314414,0.0003866229,0.000018674415,0.000021269754,0.00029638797,0.000059013728,0.8646484,0.10963614,0.013615935,0.011034967,0.00003148272],"about_ca_topic_score_codex":0.0020537386,"about_ca_topic_score_gemma":0.0020476542,"teacher_disagreement_score":0.0022301227,"about_ca_system_score_codex":0.0004732535,"about_ca_system_score_gemma":0.0008382721,"threshold_uncertainty_score":0.0074605346},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102164865,0.00019977543,0.86873776,0.00019105786,0.00012788603,0.00024272045,0.0014303235,0.014111752,0.012793928],"genre_scores_gemma":[0.44152546,0.00038584374,0.54156774,0.00013519185,0.000028586495,0.0005564327,0.0026728373,0.0009069084,0.012220989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982136,0.000023992869,0.000011926116,0.000020180722,0.00010258052,0.000019990395],"domain_scores_gemma":[0.9996044,0.00014330116,0.000032848307,0.00010209229,0.000094912684,0.000022329043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002617874,0.00036150354,0.00028013083,0.00027621794,0.00016762572,0.00034575388,0.0009634657,0.00048236348,0.0033726],"category_scores_gemma":[0.0009069113,0.00031747128,0.00041571664,0.00025241598,0.00023778692,0.000493685,0.0004323297,0.0008383839,0.0006331212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010362665,0.0000712715,0.0013711227,0.00015421415,0.00004934921,0.00023713862,0.00014130946,0.859587,0.0625389,0.029962907,0.004994757,0.040788393],"study_design_scores_gemma":[0.000028243061,0.00005796266,0.00022844036,0.0000046042255,0.000012858261,0.000051131727,0.000006979157,0.97050977,0.014595852,0.0030021938,0.011492977,0.000009042499],"about_ca_topic_score_codex":0.0014362917,"about_ca_topic_score_gemma":0.0018568619,"teacher_disagreement_score":0.0033726,"about_ca_system_score_codex":0.00026822978,"about_ca_system_score_gemma":0.00085492624,"threshold_uncertainty_score":0.011282504},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9783366,0.00048673607,0.015197686,0.000040293995,0.000020394704,0.000019154175,0.00015371354,0.00029677502,0.0054486906],"genre_scores_gemma":[0.9918715,0.00021231498,0.006277557,0.000018330213,0.000005273516,0.000021423428,0.00017114039,0.000046812438,0.0013756331],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995369,0.000054837303,0.000029024332,0.000090185036,0.0001932041,0.00009585737],"domain_scores_gemma":[0.9993771,0.0002972336,0.000086323555,0.00010566875,0.0001121281,0.000021608897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027195047,0.0003951638,0.00022238943,0.0006678992,0.00017987392,0.00044120706,0.00040111187,0.00025060144,0.0019433275],"category_scores_gemma":[0.0014454727,0.0001538539,0.00015253384,0.0009210242,0.00019438082,0.00068907544,0.0001704193,0.00018290333,0.00031159044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001471905,0.00031634726,0.028189553,0.0003447873,0.000160326,0.00050798134,0.00009245321,0.4801875,0.3485784,0.0048216498,0.0013012317,0.13402793],"study_design_scores_gemma":[0.000049340993,0.0015919458,0.034045767,0.000035822293,0.00013251642,0.0005367509,0.000150409,0.55238754,0.40357697,0.0015206026,0.005930925,0.00004139622],"about_ca_topic_score_codex":0.0011765475,"about_ca_topic_score_gemma":0.001210054,"teacher_disagreement_score":0.0019433275,"about_ca_system_score_codex":0.00048273744,"about_ca_system_score_gemma":0.0002173572,"threshold_uncertainty_score":0.0065010786},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009572777,0.0023917113,0.3232825,0.010301943,0.0029428457,0.0005731718,0.01065695,0.08147168,0.5588065],"genre_scores_gemma":[0.11489315,0.0040500234,0.19315043,0.004815452,0.00081558374,0.0010256033,0.02331468,0.014139194,0.64379585],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987477,0.00018764506,0.00006994119,0.00020590212,0.0006483408,0.0001405134],"domain_scores_gemma":[0.9970034,0.00048101885,0.0001338667,0.0010877284,0.0010920159,0.00020205505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014882986,0.0008744643,0.000550653,0.0012787458,0.0010367271,0.004640956,0.0022543245,0.001467553,0.14236133],"category_scores_gemma":[0.0054139,0.00061609485,0.0007719311,0.001364811,0.0007178457,0.004403103,0.0019709836,0.0021971057,0.07858764],"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.00031166448,0.00012525205,0.0015431579,0.00031433976,0.000019759871,0.00018337663,0.00016641963,0.013466584,0.0039690635,0.18106663,0.53380215,0.26503164],"study_design_scores_gemma":[0.000032055832,0.000043971188,0.0003299755,0.00006649863,0.0000069481284,0.00018085788,0.000037863585,0.029460104,0.002101386,0.023542935,0.94417226,0.000025096497],"about_ca_topic_score_codex":0.0057069515,"about_ca_topic_score_gemma":0.006950013,"teacher_disagreement_score":0.14236133,"about_ca_system_score_codex":0.0028192864,"about_ca_system_score_gemma":0.0034405196,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8715697,0.0014619015,0.10412596,0.00052446977,0.00007402871,0.000067180896,0.00018285082,0.0006705224,0.02132343],"genre_scores_gemma":[0.9705447,0.00017326875,0.026983723,0.000031247426,0.0000064908922,0.000027689179,0.00011634434,0.00010464566,0.0020119634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984384,0.0000493169,0.000005669304,0.000019515377,0.000049374965,0.00003224143],"domain_scores_gemma":[0.99979395,0.00010228163,0.000019274663,0.000019281113,0.000046950554,0.000018269448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034028606,0.000475667,0.00034052366,0.0002946682,0.0003078766,0.00063046213,0.0004646292,0.000280501,0.0016257323],"category_scores_gemma":[0.0010018927,0.00013876919,0.00020614042,0.00050609634,0.00022606655,0.0003666595,0.0003055994,0.00028849585,0.0002075104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001988461,0.00007982093,0.0013313884,0.000060919225,0.000023541392,0.00006102109,0.00003497349,0.9529149,0.017589217,0.00289053,0.0010948793,0.02372004],"study_design_scores_gemma":[0.000008309623,0.00003876442,0.0003536406,0.0000019596848,0.000003839728,0.0000061363944,0.0000133271515,0.9948245,0.0039461227,0.00044143148,0.00035970684,0.0000022405052],"about_ca_topic_score_codex":0.004655623,"about_ca_topic_score_gemma":0.0064514885,"teacher_disagreement_score":0.004655623,"about_ca_system_score_codex":0.0009588064,"about_ca_system_score_gemma":0.00070632884,"threshold_uncertainty_score":0.009257078},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40923202,0.0025876632,0.57271063,0.0007764925,0.00016241669,0.00009575331,0.00008376824,0.005672569,0.008678653],"genre_scores_gemma":[0.92362165,0.00040292527,0.073093206,0.000058172573,0.000032908185,0.000036110665,0.00007796104,0.00006648879,0.00261056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998634,0.000035204972,0.0000098410965,0.00001910102,0.000043972108,0.000028420893],"domain_scores_gemma":[0.99949205,0.00014581364,0.000078530735,0.00016354525,0.00008466365,0.000035346886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018862741,0.000294159,0.00025524505,0.00024012191,0.00026994795,0.00042046217,0.0007955195,0.00029139227,0.0019827236],"category_scores_gemma":[0.0008383488,0.0001553939,0.0001963638,0.0003711338,0.00027719614,0.00086964417,0.00032448873,0.00060290494,0.0003494646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016320181,0.00039107373,0.0053223083,0.00024001527,0.00005605717,0.00049966644,0.00023298022,0.3411031,0.15075782,0.03490606,0.0067546186,0.45810434],"study_design_scores_gemma":[0.00017256333,0.00057723455,0.001896685,0.000022942053,0.00006741065,0.0002509846,0.000115523115,0.87889224,0.08625249,0.020759428,0.010951219,0.000041254367],"about_ca_topic_score_codex":0.0005610679,"about_ca_topic_score_gemma":0.0017152204,"teacher_disagreement_score":0.0019827236,"about_ca_system_score_codex":0.00019798495,"about_ca_system_score_gemma":0.00027892145,"threshold_uncertainty_score":0.0066328645},"labels":[],"label_agreement":null},{"id":"W4247329450","doi":"10.1145/2544173.2509525","title":"Multiverse","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canada Excellence Research Chairs, Government of Canada; Georgia Institute of Technology; National Science Foundation","keywords":"Computer science; Scalability; Speculative execution; Speculative multithreading; Task parallelism; Speculation; Implicit parallelism; Parallel computing; Commit; Exploit; Programming paradigm; Instruction-level parallelism; Parallelism (grammar); Semantics (computer science); Programming language; Multithreading; Thread (computing); Operating system","score_opus":0.019980055376845447,"score_gpt":0.2529514713999429,"score_spread":0.23297141602309746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247329450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016103186,0.0013375827,0.79951626,0.0011609539,0.00083031773,0.00038296665,0.003150903,0.086391605,0.0911261],"genre_scores_gemma":[0.23168704,0.0013499596,0.5830662,0.0015886206,0.0003550013,0.0007245287,0.0108542945,0.020241635,0.15013273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988268,0.00015814384,0.00008300677,0.00028566268,0.0004734051,0.00017296468],"domain_scores_gemma":[0.9985952,0.0003131176,0.00008069866,0.00063973345,0.00026303955,0.000108193824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012973864,0.0008950488,0.00068603543,0.0007550558,0.00076281023,0.0023336068,0.0029773049,0.0010605812,0.04611912],"category_scores_gemma":[0.0032513398,0.00068669283,0.0012272758,0.00068069575,0.0009770199,0.0042146174,0.0045855395,0.0016258485,0.012641728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011542119,0.00022645858,0.0030177378,0.00094623485,0.00015238948,0.00065193983,0.00096212723,0.019199772,0.022672804,0.32036522,0.17856573,0.45208523],"study_design_scores_gemma":[0.00017357501,0.00018348602,0.0006752388,0.00015375283,0.00007083116,0.0006608452,0.00016309875,0.08264513,0.029491736,0.15299433,0.73267597,0.00011200541],"about_ca_topic_score_codex":0.0013216226,"about_ca_topic_score_gemma":0.0018923808,"teacher_disagreement_score":0.04611912,"about_ca_system_score_codex":0.00074364187,"about_ca_system_score_gemma":0.0012287187,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07949999,0.003466957,0.69673896,0.0028944549,0.002925414,0.0019085874,0.003250635,0.0626033,0.14671183],"genre_scores_gemma":[0.70097303,0.002159681,0.19095542,0.0013583408,0.001210411,0.0011533202,0.008046246,0.003794331,0.090349294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977221,0.00025601036,0.00018025243,0.000572814,0.00077273574,0.00049607374],"domain_scores_gemma":[0.9959488,0.00040547448,0.00025456873,0.0011447113,0.0018461803,0.00040023396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001754764,0.001511643,0.0011680223,0.0027497855,0.0032687928,0.0053243507,0.004145915,0.001309418,0.016909918],"category_scores_gemma":[0.006056181,0.00052192726,0.0007887077,0.0022706587,0.00068771583,0.003882366,0.0027462402,0.0015377436,0.008367862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070944923,0.0005812575,0.006281187,0.00031630887,0.00012421682,0.00032681832,0.00050860416,0.05659683,0.029410083,0.05557393,0.11822023,0.73135114],"study_design_scores_gemma":[0.00011488406,0.00038839987,0.00355825,0.000119024415,0.00016073346,0.0004868185,0.0005243956,0.5944112,0.043755352,0.05692694,0.29935482,0.00019918017],"about_ca_topic_score_codex":0.006596068,"about_ca_topic_score_gemma":0.0053988206,"teacher_disagreement_score":0.016909918,"about_ca_system_score_codex":0.0029006647,"about_ca_system_score_gemma":0.0031943622,"threshold_uncertainty_score":0.056569338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050396346,0.00021083184,0.9306132,0.00026786746,0.000050296447,0.00014889275,0.0004142909,0.01464784,0.0032504487],"genre_scores_gemma":[0.37415504,0.00027379396,0.6161961,0.00020415758,0.00005528414,0.00027851912,0.0019800072,0.004113297,0.0027438342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804425,0.00043989933,0.00008807775,0.000246772,0.00092151825,0.00025959554],"domain_scores_gemma":[0.9945129,0.003130636,0.00037492163,0.001104905,0.000717985,0.00015873606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011374442,0.0012258809,0.0009234415,0.0022851306,0.0010784592,0.0019002417,0.0016376793,0.0012762181,0.0038343281],"category_scores_gemma":[0.010669591,0.000709428,0.0015922891,0.0016420815,0.0012916859,0.0029940186,0.0016139515,0.0017707556,0.0016322045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006305961,0.00034705337,0.009503114,0.00071114494,0.00012202185,0.0007223838,0.00088768126,0.3497633,0.05255825,0.11517058,0.018081829,0.45150203],"study_design_scores_gemma":[0.000036481902,0.00004462824,0.00085150654,0.00004085273,0.000024690895,0.00010721831,0.00009567831,0.89552236,0.014608971,0.0835385,0.0051007024,0.000028329805],"about_ca_topic_score_codex":0.004962982,"about_ca_topic_score_gemma":0.0073918207,"teacher_disagreement_score":0.004962982,"about_ca_system_score_codex":0.0018785067,"about_ca_system_score_gemma":0.0033953858,"threshold_uncertainty_score":0.013629556},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121183716,0.051006198,0.5549292,0.0033125414,0.0030248733,0.00034344362,0.00076258666,0.0064968425,0.25894058],"genre_scores_gemma":[0.621304,0.019020913,0.22682223,0.0007572222,0.00067021255,0.00014592047,0.00092597265,0.00053199346,0.12982154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998276,0.000024311243,0.0000072009334,0.000032601543,0.00007701879,0.000031256648],"domain_scores_gemma":[0.9998276,0.000033877943,0.000016369606,0.00003413968,0.00007124031,0.000016680868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012438158,0.0004622787,0.0002532626,0.0003878115,0.00028777256,0.00077147107,0.00057921273,0.0003375156,0.01664475],"category_scores_gemma":[0.00044125275,0.0002066113,0.00022462594,0.000587277,0.00017361961,0.0005802488,0.0002372036,0.0007077334,0.0047854306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006718761,0.00019122353,0.0010663203,0.0009847076,0.000097604025,0.000637489,0.0001500304,0.02798411,0.14315918,0.08891188,0.067061305,0.66908425],"study_design_scores_gemma":[0.00023251215,0.0012500499,0.0042859823,0.00050734536,0.000118409975,0.0018160319,0.00016075477,0.11892522,0.17944872,0.035644826,0.657531,0.0000791981],"about_ca_topic_score_codex":0.0008857753,"about_ca_topic_score_gemma":0.0020413676,"teacher_disagreement_score":0.01664475,"about_ca_system_score_codex":0.00040617466,"about_ca_system_score_gemma":0.00038611548,"threshold_uncertainty_score":0.055682242},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118659556,0.00022003248,0.8478206,0.00026678297,0.00006121816,0.00019344717,0.0006220176,0.029444093,0.0027123163],"genre_scores_gemma":[0.6900124,0.00015811568,0.30334154,0.00014103446,0.000034720357,0.0003444847,0.0015043087,0.0016027933,0.002860616],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974618,0.00056328025,0.00016271106,0.0004047494,0.0011767903,0.00023061331],"domain_scores_gemma":[0.9916707,0.0027110805,0.0008332422,0.0028977378,0.0016502342,0.00023710504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013195523,0.0007786731,0.00066516676,0.0017301628,0.00048288426,0.0012855118,0.0016884819,0.0007790508,0.0014189497],"category_scores_gemma":[0.012349889,0.0005318829,0.00035121187,0.0016464541,0.00051026157,0.0019315179,0.00095199625,0.0010695944,0.0006384605],"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.0010184464,0.00053428434,0.030531013,0.00030489409,0.00012048501,0.0005600202,0.00097501004,0.09198845,0.12865314,0.02598729,0.010672427,0.70865446],"study_design_scores_gemma":[0.000046381727,0.00026147845,0.0042828433,0.000034824716,0.00004291732,0.00040627937,0.00013130959,0.8193326,0.15032876,0.013111687,0.011949235,0.00007161429],"about_ca_topic_score_codex":0.002169542,"about_ca_topic_score_gemma":0.0024572776,"teacher_disagreement_score":0.002169542,"about_ca_system_score_codex":0.00072817534,"about_ca_system_score_gemma":0.0013117197,"threshold_uncertainty_score":0.0069785714},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051202253,0.0024636767,0.8858029,0.0006059347,0.00047230264,0.00017369047,0.00011002011,0.0026130187,0.056556135],"genre_scores_gemma":[0.8098626,0.001134546,0.1608008,0.00091539865,0.00044395318,0.00028604487,0.00033488567,0.00053237483,0.025689429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990452,0.00021698671,0.000028478238,0.00020575615,0.00034413513,0.00015934135],"domain_scores_gemma":[0.9987764,0.00043121708,0.00007632473,0.00027536912,0.0003563689,0.00008433928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015213253,0.0008941444,0.0011009927,0.0006500153,0.0006744804,0.0010610633,0.0020428756,0.0007521778,0.0076133986],"category_scores_gemma":[0.0035365198,0.0003264722,0.0006071129,0.0007183641,0.0006125368,0.0012280295,0.001483512,0.00093241833,0.0028994803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051121676,0.0003534617,0.0043774196,0.00040612914,0.00020186097,0.0002645421,0.0002866567,0.33535555,0.023694301,0.07402828,0.026221849,0.5342988],"study_design_scores_gemma":[0.00010218261,0.00030744547,0.001092797,0.000038277754,0.00009396676,0.00037165958,0.000062870626,0.90506953,0.009278824,0.0460223,0.037526358,0.00003379985],"about_ca_topic_score_codex":0.0008879268,"about_ca_topic_score_gemma":0.0012460266,"teacher_disagreement_score":0.0076133986,"about_ca_system_score_codex":0.000614099,"about_ca_system_score_gemma":0.00074396696,"threshold_uncertainty_score":0.025469303},"labels":[],"label_agreement":null},{"id":"W4248578803","doi":"10.1145/1449955.1449796","title":"Analyzing the performance of code-copying virtual machines","year":2008,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Bytecode; Copying; Programming language; Virtual machine; Just-in-time compilation; Interpreter; Parallel computing; PowerPC; Operating system; Pentium; Software","score_opus":0.02563609218180765,"score_gpt":0.26194069591475094,"score_spread":0.2363046037329433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248578803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99219936,0.000242302,0.004297083,0.00003981681,0.000023103259,0.00002645285,0.00009446382,0.0012704146,0.0018069057],"genre_scores_gemma":[0.99230486,0.00007610666,0.0063656815,0.000017508002,0.000007686492,0.000026590282,0.00037443524,0.00025436183,0.00057271245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725336,0.0005264292,0.00022392492,0.00053670665,0.00089690706,0.000562593],"domain_scores_gemma":[0.9892917,0.004833221,0.0009500818,0.0027192303,0.001794906,0.00041086413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015369824,0.0009086018,0.00047861354,0.00089063356,0.0004937462,0.0010807425,0.0018847658,0.00063192425,0.0012689945],"category_scores_gemma":[0.012845359,0.0004536086,0.0003925562,0.0013698804,0.0010873968,0.0017278938,0.0008547263,0.0010087456,0.00039450475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039450605,0.0012648574,0.08975168,0.00085009856,0.00037796737,0.0007442662,0.0022214036,0.46604207,0.217824,0.012951517,0.00570092,0.19832607],"study_design_scores_gemma":[0.00012300728,0.0016574922,0.032835145,0.00006177795,0.00013807148,0.00028132167,0.00040793756,0.7760918,0.18084982,0.002657008,0.004807335,0.0000893305],"about_ca_topic_score_codex":0.0028222317,"about_ca_topic_score_gemma":0.0014914541,"teacher_disagreement_score":0.0028222317,"about_ca_system_score_codex":0.0011487264,"about_ca_system_score_gemma":0.00091194914,"threshold_uncertainty_score":0.008334637},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013420439,0.012896178,0.22100319,0.0018791396,0.004327125,0.00016299653,0.00074585655,0.0041271877,0.7535163],"genre_scores_gemma":[0.013335358,0.011100575,0.060181133,0.0006508485,0.001578783,0.0001990006,0.0015816787,0.0010472148,0.91032535],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995474,0.000036017376,0.000015932243,0.00009818552,0.00027352135,0.000028837874],"domain_scores_gemma":[0.99968433,0.000047608715,0.000010865215,0.00012312975,0.00011136957,0.000022625085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033038668,0.0014512001,0.00093723735,0.001065399,0.0007715152,0.0024859833,0.0013548377,0.0009371726,0.11360972],"category_scores_gemma":[0.0009394532,0.00062244554,0.0005170526,0.0018463255,0.00071369845,0.0021143025,0.0017435829,0.0021005315,0.09758098],"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.00005706836,0.000048640286,0.000071912706,0.00048291002,0.00003442741,0.000069649606,0.00008187788,0.003799829,0.0064920303,0.11517994,0.3270643,0.5466174],"study_design_scores_gemma":[0.000008329398,0.000024034798,0.00014947126,0.00008651327,0.000012541766,0.00015377745,0.000016203372,0.0055073346,0.0035716929,0.0643909,0.92606634,0.000012809551],"about_ca_topic_score_codex":0.0005099258,"about_ca_topic_score_gemma":0.0006786644,"teacher_disagreement_score":0.11360972,"about_ca_system_score_codex":0.0006485515,"about_ca_system_score_gemma":0.0007846513,"threshold_uncertainty_score":0.38006234},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024925575,0.0023547742,0.33664733,0.0024037017,0.0023568256,0.0006341798,0.0119006885,0.17479712,0.44397983],"genre_scores_gemma":[0.23989153,0.001956025,0.34920204,0.0034556214,0.00042790934,0.0008664367,0.03969775,0.02105577,0.34344697],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993198,0.00008490438,0.000039339233,0.0001553215,0.0003047164,0.000095899915],"domain_scores_gemma":[0.99905974,0.00009756911,0.000046051788,0.00034271448,0.00036482167,0.000089135814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005280058,0.0009735219,0.0006328877,0.0006936478,0.00069483375,0.0021507526,0.0024075932,0.0012650755,0.09432103],"category_scores_gemma":[0.001791605,0.0006196718,0.0006497224,0.00089849054,0.0004427953,0.0017197651,0.0021461197,0.0017901124,0.044936165],"study_design_candidate":"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.0007860796,0.00015866158,0.0037937232,0.00050797005,0.00010474287,0.00040435212,0.00024126,0.012704792,0.02348613,0.09219724,0.54811805,0.31749696],"study_design_scores_gemma":[0.0001374237,0.0001444478,0.00093910965,0.00005394358,0.000024982455,0.0004017796,0.00003892828,0.05413234,0.01753532,0.01036743,0.9161721,0.000052209467],"about_ca_topic_score_codex":0.0034189618,"about_ca_topic_score_gemma":0.005516037,"teacher_disagreement_score":0.09432103,"about_ca_system_score_codex":0.0012396561,"about_ca_system_score_gemma":0.0013704429,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85814303,0.0018945246,0.10411642,0.000818307,0.00022914908,0.00012502611,0.00040421725,0.009740847,0.024528412],"genre_scores_gemma":[0.8182475,0.0007141227,0.17431156,0.00023758426,0.000045007448,0.00016168128,0.001115853,0.0018451046,0.0033215764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991371,0.00022708166,0.000038020844,0.00009908143,0.00034669897,0.0001520635],"domain_scores_gemma":[0.9988487,0.00041504932,0.00009275215,0.00022931694,0.00034776833,0.00006633731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009611557,0.0006535022,0.00043452112,0.0004294596,0.00046454146,0.0010139989,0.0014168,0.00052512717,0.0014324022],"category_scores_gemma":[0.0025246523,0.00033478567,0.00047057428,0.00080085476,0.0004600177,0.0012943372,0.00064801186,0.0010312157,0.0003873005],"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.0011843612,0.0010429298,0.014871936,0.0007123588,0.00017011013,0.00083546655,0.0007708395,0.6749707,0.07791652,0.034851518,0.023217378,0.16945598],"study_design_scores_gemma":[0.00013398641,0.00038833238,0.002154276,0.000046891146,0.000043278684,0.00008161218,0.00016564662,0.95103997,0.030611789,0.004927044,0.010377334,0.000029907162],"about_ca_topic_score_codex":0.006862344,"about_ca_topic_score_gemma":0.0072195358,"teacher_disagreement_score":0.006862344,"about_ca_system_score_codex":0.00076117925,"about_ca_system_score_gemma":0.0015259244,"threshold_uncertainty_score":0.0136448145},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38443035,0.00070898765,0.6012626,0.00050139986,0.00011287991,0.00016440259,0.00013510678,0.006211567,0.006472682],"genre_scores_gemma":[0.81292033,0.0002432328,0.18377824,0.000171404,0.00003644897,0.00013361464,0.00020119546,0.00035045366,0.002165055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995554,0.000099640114,0.00003595843,0.000079831,0.00015970197,0.000069457325],"domain_scores_gemma":[0.9981325,0.0006021598,0.00023929842,0.0007062475,0.00022727365,0.0000925168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000729053,0.00046683341,0.00027357924,0.00027027784,0.00043190955,0.00072867546,0.0011456623,0.0003235361,0.00092875597],"category_scores_gemma":[0.0027387047,0.0004023408,0.00033055083,0.00035887668,0.000810614,0.0011614137,0.0008887161,0.0008025083,0.00025936292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014469657,0.0004038526,0.013605597,0.00054109347,0.00017626853,0.0005194584,0.0012042809,0.39858127,0.25909212,0.059491117,0.007719948,0.25721803],"study_design_scores_gemma":[0.00007102016,0.000275037,0.0011819637,0.00002449165,0.00006325055,0.0000960625,0.00008890745,0.894982,0.07543075,0.018766353,0.008993231,0.000026886019],"about_ca_topic_score_codex":0.0018002687,"about_ca_topic_score_gemma":0.0036034486,"teacher_disagreement_score":0.0018002687,"about_ca_system_score_codex":0.0006149166,"about_ca_system_score_gemma":0.0014081233,"threshold_uncertainty_score":0.004461527},"labels":[],"label_agreement":null},{"id":"W4249895474","doi":"10.1145/1837855.1806670","title":"A graph theoretic approach to cache-conscious placement of data for direct mapped caches","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cache; Cache pollution; Cache algorithms; Parallel computing; Cache coloring; Cache invalidation; Bottleneck; Cache-oblivious algorithm; Page cache; Smart Cache; Optimizing compiler; CPU cache; Compiler; Operating system; Embedded system","score_opus":0.04559014292249517,"score_gpt":0.2956529427253662,"score_spread":0.250062799802871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249895474","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028491563,0.00017463435,0.9940655,0.00019466714,0.00003918568,0.000102763726,0.000059256883,0.00022930178,0.002285503],"genre_scores_gemma":[0.10186231,0.00072831195,0.8928348,0.00015407392,0.00007352301,0.00027622943,0.00024230673,0.00017204667,0.0036563128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990889,0.00034116718,0.000041581658,0.00016234248,0.0002822216,0.0000837576],"domain_scores_gemma":[0.9989525,0.00050909683,0.00011139889,0.00018810804,0.00018935336,0.00004952351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086533884,0.0012207999,0.0010875175,0.001744682,0.0014098698,0.0019905516,0.0024102298,0.0011251715,0.0036910814],"category_scores_gemma":[0.0031373117,0.0011402745,0.0014118099,0.0028600418,0.0015758766,0.0021792836,0.0013042402,0.0017161219,0.0009715099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058330475,0.00012175505,0.00042812433,0.00035163458,0.00006785711,0.0001945336,0.00023998864,0.6961838,0.005269936,0.20918477,0.005243331,0.08265593],"study_design_scores_gemma":[0.000026001819,0.000081516286,0.00013634299,0.000034102624,0.000029973096,0.00013342335,0.00007996546,0.83892983,0.00204202,0.15089436,0.007583834,0.000028626453],"about_ca_topic_score_codex":0.0059309737,"about_ca_topic_score_gemma":0.010797038,"teacher_disagreement_score":0.0059309737,"about_ca_system_score_codex":0.002540908,"about_ca_system_score_gemma":0.0033056696,"threshold_uncertainty_score":0.018435597},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053233013,0.00032412235,0.9421442,0.000085747364,0.000011701573,0.000045268327,0.00007953997,0.00073175965,0.0033446166],"genre_scores_gemma":[0.66594094,0.0008490437,0.32707873,0.000059456546,0.000027969172,0.0001723176,0.00026482073,0.0002880462,0.0053186323],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998536,0.00001232134,0.0000070532637,0.000026573287,0.000088874884,0.00001152792],"domain_scores_gemma":[0.999762,0.00011069879,0.00003568189,0.000026125203,0.000058040114,0.000007529176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016621858,0.00034871645,0.00028384654,0.00073781447,0.00027886563,0.00047194687,0.00043414874,0.00022201255,0.0020926113],"category_scores_gemma":[0.0007177725,0.00023129286,0.0002580394,0.0005031634,0.00041977657,0.00092931226,0.00022641581,0.00056302536,0.0005168917],"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.0002176203,0.00010874141,0.0050215945,0.0003456392,0.00006674589,0.0002359166,0.00055223814,0.31548285,0.28615117,0.06956542,0.0014928656,0.32075927],"study_design_scores_gemma":[0.0000068280883,0.000092319875,0.0013286988,0.000013448015,0.000018986259,0.00014144396,0.00004062812,0.95227367,0.032715827,0.008862598,0.0044906735,0.0000149819],"about_ca_topic_score_codex":0.0011178582,"about_ca_topic_score_gemma":0.001328531,"teacher_disagreement_score":0.0020926113,"about_ca_system_score_codex":0.000453319,"about_ca_system_score_gemma":0.00042093862,"threshold_uncertainty_score":0.0070004463},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015012699,0.0017362682,0.5598725,0.0015054843,0.0030723156,0.0014390415,0.014162885,0.11577111,0.28742772],"genre_scores_gemma":[0.19789626,0.0018208284,0.32637078,0.0026387246,0.0015792053,0.0015501835,0.045984197,0.0334503,0.38870952],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984151,0.00015830797,0.00011743163,0.00041411968,0.00066396,0.00023098788],"domain_scores_gemma":[0.99803513,0.0003044713,0.00008287805,0.0010350241,0.00038482135,0.0001577085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011939928,0.0013933894,0.0012520822,0.0017458684,0.0014757884,0.0036823365,0.0023264473,0.00095645053,0.12498461],"category_scores_gemma":[0.0033686452,0.00075770076,0.0011027687,0.002135463,0.0006206908,0.0043632747,0.004889211,0.0017994831,0.052794013],"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.0013153083,0.0002973154,0.0014205147,0.00073965744,0.00011940612,0.00026078583,0.0005201264,0.0022462062,0.016688066,0.1426997,0.43445292,0.39924005],"study_design_scores_gemma":[0.00026524568,0.00017726015,0.0008462789,0.00013396975,0.00012517162,0.0003781795,0.00023923152,0.0127303675,0.03859459,0.09747067,0.8489559,0.00008312724],"about_ca_topic_score_codex":0.0017803936,"about_ca_topic_score_gemma":0.0022884554,"teacher_disagreement_score":0.12498461,"about_ca_system_score_codex":0.000809874,"about_ca_system_score_gemma":0.0016623329,"threshold_uncertainty_score":0.41811514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11387032,0.00023324163,0.8807281,0.00007930192,0.00001418357,0.000063038606,0.000068187444,0.00055906206,0.0043845605],"genre_scores_gemma":[0.6925174,0.00026327817,0.30100206,0.000050802613,0.000028476363,0.00012750467,0.00025238306,0.00018386132,0.0055742073],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995691,0.00007877525,0.000043145523,0.00009918015,0.00014953793,0.00006018576],"domain_scores_gemma":[0.99885046,0.00041686412,0.00023123344,0.0002537312,0.00020303472,0.00004471815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003582561,0.0003292999,0.00037166683,0.0004759988,0.0004510726,0.0004302992,0.00066600187,0.0002046774,0.0019517546],"category_scores_gemma":[0.0019317984,0.00025824638,0.00032682283,0.00075758965,0.00063103804,0.0010863324,0.00055528275,0.0003816701,0.00041144274],"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.0004844418,0.00012584479,0.008745988,0.00030061608,0.000061225015,0.0009302608,0.0006788581,0.34603205,0.1146951,0.16197127,0.002925895,0.36304846],"study_design_scores_gemma":[0.000038015183,0.00013677291,0.0012028335,0.000018459748,0.000032843975,0.0003144306,0.000057906014,0.90886354,0.033663116,0.04924368,0.006403135,0.000025202218],"about_ca_topic_score_codex":0.0015776993,"about_ca_topic_score_gemma":0.0034279877,"teacher_disagreement_score":0.0019517546,"about_ca_system_score_codex":0.00035880675,"about_ca_system_score_gemma":0.0007664743,"threshold_uncertainty_score":0.0065292716},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5489821,0.0004772043,0.43493336,0.00036548154,0.00027745223,0.00025833485,0.0001993761,0.0027818547,0.011724885],"genre_scores_gemma":[0.9426407,0.00010753574,0.05383584,0.00010470003,0.00007026668,0.00009363205,0.00037026487,0.00018268266,0.0025943639],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874383,0.00029462238,0.00008478216,0.0002023464,0.00035771466,0.00031670945],"domain_scores_gemma":[0.9964226,0.0011092402,0.0003559859,0.00075317087,0.0009771177,0.00038182552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080775603,0.0006680176,0.0006574124,0.00070639147,0.0012019263,0.0011211194,0.0013465489,0.00053723005,0.0029697926],"category_scores_gemma":[0.004552752,0.0003876296,0.0002528317,0.0010562546,0.00041131096,0.0012355173,0.001120887,0.0006196272,0.0008811669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032816413,0.00088364875,0.016216137,0.00037815882,0.00014239039,0.0010587354,0.001258179,0.41117743,0.09979276,0.03443057,0.018889612,0.41249073],"study_design_scores_gemma":[0.0000747803,0.00020750269,0.0023874748,0.0000077566,0.00002140541,0.0002094507,0.00019149746,0.97088695,0.011351044,0.009393073,0.0052473233,0.000021774971],"about_ca_topic_score_codex":0.0023950362,"about_ca_topic_score_gemma":0.003223437,"teacher_disagreement_score":0.0029697926,"about_ca_system_score_codex":0.0011372513,"about_ca_system_score_gemma":0.001173204,"threshold_uncertainty_score":0.009934962},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032009454,0.000119202625,0.98624474,0.0000845332,0.000034768305,0.000084385,0.00004926139,0.005830711,0.004351469],"genre_scores_gemma":[0.074165195,0.00028007507,0.9131839,0.0002452129,0.000037283695,0.00021530347,0.0005490356,0.001668266,0.009655699],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987715,0.00013758027,0.000054076212,0.00033370574,0.00057890976,0.00012426969],"domain_scores_gemma":[0.9990049,0.00016440985,0.00005097456,0.00048819344,0.00024522824,0.000046368445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066284585,0.00083575345,0.00067365036,0.0008085862,0.00040856336,0.001385003,0.0025333816,0.0011148566,0.006245584],"category_scores_gemma":[0.0019594857,0.00055428204,0.0009261289,0.0008864112,0.0007236845,0.0018730994,0.0024440004,0.0020383,0.0027090658],"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.00018032732,0.0003185792,0.0008008829,0.00023482584,0.00012484536,0.00033243033,0.0004043989,0.09528511,0.090990715,0.057847537,0.010900028,0.74258024],"study_design_scores_gemma":[0.00007340903,0.00024179385,0.00048669774,0.000054604123,0.00013743796,0.00039185997,0.00006854394,0.7897927,0.08002939,0.05414588,0.07450585,0.0000717053],"about_ca_topic_score_codex":0.0015130729,"about_ca_topic_score_gemma":0.0026500155,"teacher_disagreement_score":0.006245584,"about_ca_system_score_codex":0.0005775182,"about_ca_system_score_gemma":0.0012249028,"threshold_uncertainty_score":0.020893574},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018271059,0.00027690703,0.9728013,0.00040801492,0.00030602008,0.00019491783,0.00010716907,0.004626628,0.0030080185],"genre_scores_gemma":[0.60247386,0.00051533367,0.381229,0.0004898729,0.00049102464,0.00068505347,0.0005043854,0.0014964857,0.012114946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777645,0.0006203871,0.00021583744,0.00028208908,0.00082345045,0.0002817052],"domain_scores_gemma":[0.99379843,0.0024608509,0.00043049565,0.0018333592,0.0010355398,0.00044125508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003931512,0.00096005417,0.0007629323,0.0007534134,0.0014213354,0.0029055453,0.004891137,0.0011808504,0.005567923],"category_scores_gemma":[0.010732404,0.0006303408,0.0006371727,0.0008129644,0.001200137,0.004653855,0.0032072419,0.0021214746,0.0010588064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020136926,0.0006343049,0.0053757597,0.00073507644,0.00019895473,0.0007317233,0.0020100146,0.30155894,0.05681334,0.29754627,0.030259233,0.30212265],"study_design_scores_gemma":[0.00015404278,0.00020054288,0.00036000082,0.000039275532,0.000041105795,0.00008553045,0.0001039405,0.899448,0.013506961,0.061988287,0.024015505,0.000056895748],"about_ca_topic_score_codex":0.0028749546,"about_ca_topic_score_gemma":0.0031729273,"teacher_disagreement_score":0.005567923,"about_ca_system_score_codex":0.0014854218,"about_ca_system_score_gemma":0.0022368012,"threshold_uncertainty_score":0.020792067},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37377796,0.00044193864,0.6220373,0.00013853428,0.000023157383,0.00006806211,0.000036028156,0.0014025961,0.0020744582],"genre_scores_gemma":[0.8719693,0.00007641532,0.12691675,0.00005713258,0.000008622342,0.000029929435,0.00005616235,0.000072730225,0.0008129332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970275,0.00007479811,0.000009049643,0.00006659277,0.000076163546,0.00007059221],"domain_scores_gemma":[0.99941254,0.00025475828,0.00011424482,0.00010591787,0.000064549924,0.000047923804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005440704,0.00048762717,0.0004199146,0.00035066786,0.00043017248,0.00043533853,0.00089816144,0.00029467102,0.0008024334],"category_scores_gemma":[0.0014095206,0.00023761217,0.00026048653,0.00041422527,0.0004306476,0.00068967725,0.0006404363,0.0004048611,0.00016850744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007161008,0.00019726834,0.0040717865,0.00009638649,0.00004344425,0.00030809778,0.00017051844,0.7320785,0.11638541,0.0076358235,0.0013390089,0.13695763],"study_design_scores_gemma":[0.000023812443,0.00011218008,0.00040614873,0.0000020417483,0.000008128352,0.00004041149,0.00002013994,0.9811668,0.014261697,0.0034144837,0.00053825084,0.000005907448],"about_ca_topic_score_codex":0.001458391,"about_ca_topic_score_gemma":0.0031119613,"teacher_disagreement_score":0.001458391,"about_ca_system_score_codex":0.0004903668,"about_ca_system_score_gemma":0.0006940881,"threshold_uncertainty_score":0.0035578609},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009127582,0.000108077584,0.987817,0.00013860242,0.000018482455,0.000033067652,0.00008550032,0.0018106176,0.0008610663],"genre_scores_gemma":[0.34487256,0.00028376322,0.65124476,0.00017545027,0.00011216434,0.00020302166,0.0002879244,0.0005925229,0.002227847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824476,0.00037637804,0.00008607868,0.00026085466,0.00092043367,0.00011154856],"domain_scores_gemma":[0.9957054,0.0022248272,0.0004145173,0.00090132176,0.00069113466,0.00006281044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016504586,0.00092912506,0.0007410471,0.0024577382,0.0012154307,0.001458611,0.0016787514,0.0008788024,0.0025460953],"category_scores_gemma":[0.012448394,0.0008731405,0.0009973139,0.0018679741,0.0011297007,0.0033689253,0.0015595381,0.0017487503,0.0007726807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025906638,0.0001007396,0.0054679923,0.0001364496,0.00007866602,0.00011818259,0.00018856605,0.45541432,0.017532235,0.22130823,0.004991616,0.29440394],"study_design_scores_gemma":[0.0000066125513,0.000022893691,0.0002542594,0.000009504591,0.000016263004,0.00002687896,0.000006460382,0.9539805,0.0027981035,0.041437548,0.0014241681,0.000016854177],"about_ca_topic_score_codex":0.0036458273,"about_ca_topic_score_gemma":0.0037977917,"teacher_disagreement_score":0.0036458273,"about_ca_system_score_codex":0.0011991239,"about_ca_system_score_gemma":0.0033143626,"threshold_uncertainty_score":0.008728504},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040953662,0.0007192388,0.0006144021,0.0015455101,0.0004929868,0.00010060706,0.94285643,0.004312178,0.008405013],"genre_scores_gemma":[0.014400019,0.00011688468,0.0009889483,0.000117192416,0.000057972087,0.00006825331,0.9803848,0.0000976583,0.0037682906],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99920875,0.00007860594,0.0000407445,0.00020049943,0.00033084207,0.00014053937],"domain_scores_gemma":[0.99849176,0.00014399027,0.00007111142,0.0003200406,0.00078464445,0.00018853876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012750718,0.0015407123,0.0011677085,0.002051087,0.0011156433,0.0014126288,0.0020460277,0.0014717025,0.0063541466],"category_scores_gemma":[0.003313413,0.0002768098,0.0006121534,0.0033998229,0.00044890656,0.00094945275,0.0009917133,0.0012250609,0.009494588],"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.00025120468,0.00007889489,0.0021828495,0.00008305375,0.000024618705,0.000023519442,0.000018388968,0.0014672355,0.00023198451,0.0002586077,0.98551035,0.009869357],"study_design_scores_gemma":[0.0007758599,0.00024593566,0.09535067,0.00016161222,0.000110722576,0.00024894983,0.00046922584,0.043455992,0.007667298,0.0020218084,0.8493931,0.000098921286],"about_ca_topic_score_codex":0.11515509,"about_ca_topic_score_gemma":0.2054317,"teacher_disagreement_score":0.11515509,"about_ca_system_score_codex":0.0024622409,"about_ca_system_score_gemma":0.0025307296,"threshold_uncertainty_score":0.22896963},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006167164,0.00018377841,0.99119955,0.00016115504,0.000019639612,0.000031161286,0.00006947101,0.0012709342,0.0008971083],"genre_scores_gemma":[0.2840681,0.0004975849,0.71199363,0.00018297935,0.00013684902,0.00019618018,0.00023213096,0.0004969208,0.0021956423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981001,0.00044362384,0.000090239984,0.00027955268,0.0009781721,0.00010835594],"domain_scores_gemma":[0.99532783,0.002451693,0.00044195523,0.0009575629,0.0007628877,0.000057948415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019216257,0.0009625596,0.0008101777,0.0026194097,0.0012275799,0.0015703398,0.0017395457,0.00093682,0.0023345973],"category_scores_gemma":[0.012808419,0.0009359652,0.0010940816,0.0021654807,0.0013350652,0.0036530923,0.0014708373,0.0019584815,0.00073500065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018577212,0.00007912576,0.004176775,0.0001642704,0.00008070854,0.000099429155,0.00017679176,0.3936667,0.013539346,0.27159703,0.004765484,0.31146854],"study_design_scores_gemma":[0.0000070591113,0.000025585958,0.0003191945,0.000014769527,0.000022627964,0.00003722458,0.00000804177,0.9316897,0.0027780014,0.0627128,0.002363945,0.000021033813],"about_ca_topic_score_codex":0.0035546198,"about_ca_topic_score_gemma":0.0031838815,"teacher_disagreement_score":0.0035546198,"about_ca_system_score_codex":0.001337894,"about_ca_system_score_gemma":0.0033038557,"threshold_uncertainty_score":0.010162652},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015096848,0.011436734,0.19382216,0.0012064418,0.002376062,0.0001578057,0.0011012059,0.007933588,0.7804563],"genre_scores_gemma":[0.006635116,0.005883115,0.052666597,0.0005013817,0.00033130398,0.00013213624,0.0016657271,0.0010470059,0.93113756],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997129,0.000022913251,0.0000080598165,0.00006288109,0.00016705196,0.000026064667],"domain_scores_gemma":[0.9998202,0.0000238762,0.000006290772,0.00004994399,0.000083939696,0.000015771548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017574005,0.0015083575,0.00083865685,0.0014051006,0.00067064515,0.0018475833,0.0016941653,0.0011491999,0.20967136],"category_scores_gemma":[0.00059137796,0.000639632,0.00046643283,0.0023505578,0.0003802762,0.001772995,0.0015608394,0.0020986123,0.1308314],"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.000053236512,0.000027475142,0.00005957284,0.00026403632,0.000014804352,0.000048659327,0.00006678647,0.0016721558,0.006704036,0.045875877,0.3532284,0.59198505],"study_design_scores_gemma":[0.000009590655,0.000015269175,0.00009810945,0.000062823536,0.0000088270135,0.00010478744,0.0000111857935,0.0026840863,0.0027533472,0.0111077,0.98313564,0.00000863819],"about_ca_topic_score_codex":0.0009014056,"about_ca_topic_score_gemma":0.0016130044,"teacher_disagreement_score":0.20967136,"about_ca_system_score_codex":0.00054667675,"about_ca_system_score_gemma":0.0005123082,"threshold_uncertainty_score":0.70142055},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0081120785,0.00059115305,0.9109638,0.00044053106,0.00069029344,0.00028153896,0.0006037739,0.04490915,0.033407655],"genre_scores_gemma":[0.12448284,0.00073828804,0.8116668,0.001054622,0.00028380298,0.00057651754,0.0031131206,0.008519231,0.049564734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998706,0.00015310122,0.00018155214,0.0002476025,0.00051388453,0.00019791545],"domain_scores_gemma":[0.99902105,0.00012318415,0.00010658423,0.00033127904,0.00025406564,0.00016381934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017517187,0.00076495286,0.000751369,0.0010768295,0.0011570851,0.004934769,0.0026265287,0.0009967763,0.011695225],"category_scores_gemma":[0.0021309715,0.001125401,0.0013416295,0.00069118047,0.00093331473,0.0038520815,0.0025444261,0.0028861894,0.006276049],"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.00084522145,0.00026307875,0.0024996246,0.00061303563,0.00011715554,0.00055210816,0.0015083055,0.012648492,0.026180295,0.4936629,0.15461631,0.3064935],"study_design_scores_gemma":[0.00012777637,0.00012737744,0.0004699167,0.00012845312,0.000072955256,0.00040611834,0.000085131294,0.03625197,0.01840301,0.028004343,0.9158132,0.00010985418],"about_ca_topic_score_codex":0.0036052933,"about_ca_topic_score_gemma":0.0040714927,"teacher_disagreement_score":0.011695225,"about_ca_system_score_codex":0.0018424795,"about_ca_system_score_gemma":0.002597762,"threshold_uncertainty_score":0.03912449},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031080732,0.0012571543,0.93747586,0.0008604701,0.00061332143,0.00014413675,0.00033682166,0.010757632,0.017473802],"genre_scores_gemma":[0.42475432,0.00090144173,0.54770327,0.00025287163,0.000084054744,0.00016078098,0.00097002374,0.0007210777,0.024452206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996331,0.00007536527,0.000010407189,0.00004971815,0.00019506642,0.000036392965],"domain_scores_gemma":[0.99933225,0.00025832994,0.000038068585,0.00014662372,0.00017462765,0.000050029706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035647393,0.0005617145,0.00090383465,0.0010492281,0.0006588346,0.0012321685,0.0014153915,0.0010460753,0.025740715],"category_scores_gemma":[0.0024765416,0.000446429,0.0003614465,0.0013299349,0.0005272203,0.0008863883,0.0011908868,0.0010078364,0.004065453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024719054,0.00016748004,0.004143529,0.00050154404,0.00017624287,0.0006503916,0.00025583265,0.032779444,0.11515829,0.018951155,0.06358627,0.76115805],"study_design_scores_gemma":[0.0005273054,0.0006693268,0.004169768,0.000106412874,0.00016962504,0.0011698927,0.00011328229,0.77055514,0.120291494,0.020811986,0.08129469,0.00012100205],"about_ca_topic_score_codex":0.0034892722,"about_ca_topic_score_gemma":0.0033754266,"teacher_disagreement_score":0.025740715,"about_ca_system_score_codex":0.0005101237,"about_ca_system_score_gemma":0.00068061077,"threshold_uncertainty_score":0.08611125},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005635815,0.0002513372,0.99455535,0.00027198248,0.00014793355,0.00006211813,0.000026581112,0.0001652411,0.0039558066],"genre_scores_gemma":[0.11640531,0.0027048544,0.86179596,0.0010098038,0.000965606,0.0009725884,0.00012955187,0.0006193431,0.015396959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841833,0.000296195,0.00008072138,0.00023310064,0.000864126,0.00010755386],"domain_scores_gemma":[0.99820423,0.0008317597,0.00018189527,0.00027444892,0.00042305735,0.000084563755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002304658,0.0013991931,0.00095731264,0.0021976973,0.0013001988,0.0017056379,0.002682164,0.0012360576,0.0080417525],"category_scores_gemma":[0.006824207,0.0007935075,0.0014753719,0.0014675076,0.0025529417,0.004898986,0.0026292582,0.003837635,0.0022869578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039855382,0.000074092095,0.00017471866,0.00040838055,0.00006262315,0.00015949908,0.00021894283,0.043197215,0.019397492,0.8786782,0.008190239,0.049398787],"study_design_scores_gemma":[0.00006086826,0.00008951007,0.0001390562,0.000108610664,0.000055824064,0.00044717896,0.000054904427,0.4837183,0.008669985,0.44612285,0.060460776,0.00007212557],"about_ca_topic_score_codex":0.000885423,"about_ca_topic_score_gemma":0.0007688935,"teacher_disagreement_score":0.0080417525,"about_ca_system_score_codex":0.0015911813,"about_ca_system_score_gemma":0.002274102,"threshold_uncertainty_score":0.026902318},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17881252,0.00016013828,0.8003812,0.00013666299,0.000050744093,0.00011394426,0.00013143677,0.009478352,0.010735008],"genre_scores_gemma":[0.3876588,0.00012812616,0.60585356,0.00010057965,0.00001129295,0.000088150475,0.00035048113,0.001338829,0.004470111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998241,0.000025104078,0.000009048775,0.000048267426,0.00006750459,0.000026046271],"domain_scores_gemma":[0.9996606,0.00008704943,0.000036811452,0.000115651965,0.00008810092,0.000011826868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027844188,0.0002829023,0.00023005749,0.00029346655,0.00023870257,0.00049637014,0.0006902829,0.0003173,0.0014611196],"category_scores_gemma":[0.0010079036,0.00020175474,0.00024228434,0.0003357172,0.0005475247,0.00047961916,0.00035901016,0.0005645149,0.00040624302],"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.00042442232,0.00013537347,0.0022181356,0.00022935195,0.00003641419,0.0004256723,0.00046637753,0.40441415,0.1407615,0.078037605,0.007065595,0.36578542],"study_design_scores_gemma":[0.00008734505,0.0002628966,0.00085657486,0.000026535794,0.000027583861,0.00030753436,0.000058295653,0.8179465,0.1320163,0.015814984,0.032563977,0.0000314411],"about_ca_topic_score_codex":0.0014224612,"about_ca_topic_score_gemma":0.0019079183,"teacher_disagreement_score":0.0014611196,"about_ca_system_score_codex":0.0004000585,"about_ca_system_score_gemma":0.0007260816,"threshold_uncertainty_score":0.0048879385},"labels":[],"label_agreement":null},{"id":"W4254059104","doi":"10.1145/2714064.2660218","title":"MIX10","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Compiler; Programming language; MATLAB; Concurrency; Set (abstract data type); Parallel computing","score_opus":0.016994453282950704,"score_gpt":0.25460416065250485,"score_spread":0.23760970736955414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254059104","genre_codex":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016352667,0.0012226714,0.32725537,0.0011325555,0.001445828,0.0006856443,0.026723634,0.45888987,0.16629185],"genre_scores_gemma":[0.08199078,0.001556838,0.3374944,0.0024802112,0.00032028602,0.0015781692,0.10544889,0.17786138,0.29126903],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985843,0.0001635771,0.00013112064,0.00035539342,0.00056434073,0.00020131326],"domain_scores_gemma":[0.99833137,0.0003683571,0.00013534396,0.00036643198,0.0006622646,0.00013620775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009979164,0.0014343597,0.0007320888,0.0011063041,0.0006509527,0.0021936556,0.002785806,0.0010047068,0.14247346],"category_scores_gemma":[0.004234956,0.0010933914,0.0011284917,0.0008083146,0.00054645014,0.0028656921,0.0031865383,0.001853608,0.10379191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011892365,0.00023387551,0.0035931347,0.0016096447,0.00012719278,0.00058105227,0.000617735,0.0072283135,0.0270824,0.05501887,0.5967607,0.3059579],"study_design_scores_gemma":[0.00011043307,0.000121701465,0.00095562066,0.00012221519,0.00003551154,0.00045735497,0.00009272573,0.013551976,0.028485706,0.009921245,0.9460728,0.00007281236],"about_ca_topic_score_codex":0.001327083,"about_ca_topic_score_gemma":0.0018520164,"teacher_disagreement_score":0.14247346,"about_ca_system_score_codex":0.0008220342,"about_ca_system_score_gemma":0.001726127,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011171372,0.00013392273,0.9835587,0.000070564245,0.000016906082,0.000028208731,0.00019705501,0.004349191,0.00047401217],"genre_scores_gemma":[0.33886707,0.00029306023,0.6556169,0.00011846635,0.000051001276,0.00018006084,0.0006934285,0.0005968397,0.0035832312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949396,0.000098252676,0.000025779616,0.00010761809,0.00023380975,0.000040668343],"domain_scores_gemma":[0.99918634,0.00035038206,0.00013360695,0.00017203674,0.00013748182,0.000020167518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007146373,0.0008029439,0.0006852752,0.00090514845,0.00025069705,0.0011201127,0.0016413407,0.0005794537,0.0026360506],"category_scores_gemma":[0.0035540708,0.0006086436,0.00052499323,0.0005139156,0.0003378462,0.0020310075,0.00060463016,0.0009875477,0.0010212979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031674362,0.00015462193,0.009718266,0.00021464098,0.00017485871,0.00011037228,0.00007549424,0.5241837,0.052427035,0.014323333,0.0051720636,0.39312887],"study_design_scores_gemma":[0.000016046268,0.00006240301,0.000700318,0.000009359143,0.000018986864,0.000049624166,0.0000059322865,0.9717268,0.022840299,0.0018473672,0.0027009079,0.000021976975],"about_ca_topic_score_codex":0.002177215,"about_ca_topic_score_gemma":0.004366354,"teacher_disagreement_score":0.0026360506,"about_ca_system_score_codex":0.00056540663,"about_ca_system_score_gemma":0.00077717524,"threshold_uncertainty_score":0.008818448},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04926009,0.00018881157,0.9429445,0.00010760775,0.000041119143,0.00006648592,0.000021423626,0.005582388,0.0017875485],"genre_scores_gemma":[0.61500895,0.00009315761,0.3817499,0.00004209134,0.000026758966,0.00007283406,0.00007640257,0.00073933887,0.0021905708],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984341,0.00045511607,0.000120500175,0.00024769377,0.0005466015,0.00019605666],"domain_scores_gemma":[0.9967861,0.0011081437,0.00046771666,0.00097220106,0.0005051689,0.00016073346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019341257,0.0005936462,0.0005882784,0.0010212642,0.0007719741,0.0013702614,0.0017625702,0.0005268862,0.0031221341],"category_scores_gemma":[0.0072652437,0.0005181155,0.00033105005,0.00060765416,0.00078866864,0.0014807464,0.0016623915,0.0011783475,0.0007772075],"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.0016016216,0.00027959025,0.0063393107,0.00027513728,0.0000695453,0.00033684814,0.0011796869,0.11308096,0.13781446,0.1662702,0.0060954965,0.5666571],"study_design_scores_gemma":[0.00013994705,0.00022849966,0.0007267253,0.00003410743,0.000037258735,0.00010776599,0.000072140865,0.894386,0.078107655,0.017273137,0.008847903,0.000038819067],"about_ca_topic_score_codex":0.002636398,"about_ca_topic_score_gemma":0.0020292955,"teacher_disagreement_score":0.0031221341,"about_ca_system_score_codex":0.0011675268,"about_ca_system_score_gemma":0.0020838086,"threshold_uncertainty_score":0.010444522},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009221025,0.00077558926,0.9412037,0.00059817976,0.0008815306,0.00036858974,0.00048322938,0.00986577,0.03660232],"genre_scores_gemma":[0.5087232,0.0016587453,0.42251554,0.0008321178,0.0009282073,0.0011528472,0.0019577863,0.0041211247,0.058110416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975969,0.0006464319,0.00018627183,0.0005497148,0.00064802065,0.00037273823],"domain_scores_gemma":[0.9972717,0.00066750176,0.0001700978,0.0012841964,0.0004451811,0.00016123804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002006222,0.0010819115,0.0011647746,0.0011111472,0.0015181467,0.0025569361,0.0017102618,0.0009902149,0.022035357],"category_scores_gemma":[0.0060886913,0.0006401571,0.00073443877,0.0013719635,0.0012875563,0.003025389,0.003504211,0.0016433102,0.007505482],"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.0009561765,0.0002399534,0.0013534237,0.0005797927,0.0001782282,0.00035355563,0.0009301204,0.076226026,0.027888404,0.5285207,0.0696899,0.2930836],"study_design_scores_gemma":[0.0003633304,0.00025087124,0.0005749141,0.00014995012,0.00010412042,0.00023797064,0.00017795525,0.29913464,0.035065364,0.45381606,0.21000166,0.00012319008],"about_ca_topic_score_codex":0.0022530016,"about_ca_topic_score_gemma":0.0025295264,"teacher_disagreement_score":0.022035357,"about_ca_system_score_codex":0.0012515987,"about_ca_system_score_gemma":0.0023419946,"threshold_uncertainty_score":0.07371563},"labels":[],"label_agreement":null},{"id":"W4254630438","doi":"10.1145/1508284.1508281","title":"Phantom-BTB","year":2009,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Granularity; Working set; Overhead (engineering); Random access; Parallel computing; Table (database); Embedded system; Operating system; Database","score_opus":0.021253206978345544,"score_gpt":0.27922439181900605,"score_spread":0.2579711848406605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254630438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12952098,0.003598977,0.72316396,0.0011636919,0.0012319158,0.000510593,0.0034618902,0.068478495,0.068869494],"genre_scores_gemma":[0.6428048,0.00082902965,0.28433052,0.0018193044,0.00022669934,0.0005621309,0.006524111,0.0029921131,0.059911203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994024,0.00007596282,0.000039214305,0.00012753908,0.0002449408,0.00010997871],"domain_scores_gemma":[0.99858165,0.0001533003,0.00012779045,0.000530265,0.00047018606,0.00013679797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037251247,0.0006619094,0.0006368625,0.00074733,0.0005010651,0.00128825,0.0026201734,0.00072060997,0.019427305],"category_scores_gemma":[0.0016335236,0.00068914803,0.00047225333,0.0010007822,0.000564492,0.0021158876,0.0014810235,0.0008728535,0.0058862204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0042770393,0.0004993984,0.005203089,0.0011333398,0.00020140511,0.00079861464,0.00036610433,0.05559044,0.302321,0.048987184,0.147183,0.43343952],"study_design_scores_gemma":[0.0005384676,0.0036494203,0.0047335173,0.00014456203,0.00018886063,0.0023561325,0.00009690453,0.34461907,0.2160142,0.022859512,0.40453655,0.00026283442],"about_ca_topic_score_codex":0.0019283014,"about_ca_topic_score_gemma":0.002338719,"teacher_disagreement_score":0.019427305,"about_ca_system_score_codex":0.0010706313,"about_ca_system_score_gemma":0.0014063121,"threshold_uncertainty_score":0.06499082},"labels":[],"label_agreement":null},{"id":"W4254689785","doi":"10.1145/2517326.2451541","title":"A modular approach to on-stack replacement in LLVM","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Compiler; Just-in-time compilation; Modular design; Programming language; Optimizing compiler; Operating system; Interrupt; Dynamic compilation; Virtual machine; Code generation; Embedded system; Parallel computing; Key (lock)","score_opus":0.026329957680627594,"score_gpt":0.2605417547975208,"score_spread":0.2342117971168932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254689785","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008824726,0.00058168976,0.9330873,0.00048565184,0.0003184161,0.00023031993,0.00020606896,0.04480887,0.011456915],"genre_scores_gemma":[0.18400477,0.0008237356,0.77844274,0.0015008673,0.0002979419,0.000529894,0.0010830526,0.017214255,0.016102755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977914,0.00038344972,0.00019903111,0.0003423974,0.0009618272,0.00032189747],"domain_scores_gemma":[0.99819714,0.00032458687,0.00015275362,0.0007878572,0.00041122866,0.00012635298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015802273,0.0008749515,0.0006248784,0.001130332,0.0006294568,0.0023144116,0.003757123,0.00093965506,0.005986405],"category_scores_gemma":[0.004768519,0.00090853334,0.001267297,0.00054242584,0.001374934,0.0035560976,0.0037453063,0.00305908,0.0034018203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066328346,0.0003501427,0.0050213444,0.0009701179,0.00021582942,0.0009658742,0.0021151083,0.055598974,0.09377208,0.25114954,0.06898476,0.5201929],"study_design_scores_gemma":[0.00017115171,0.00026269295,0.0013364,0.0003953097,0.00017979927,0.00083851116,0.00014015674,0.29564613,0.09325008,0.10589471,0.5016448,0.00024009994],"about_ca_topic_score_codex":0.0017840858,"about_ca_topic_score_gemma":0.0023355214,"teacher_disagreement_score":0.005986405,"about_ca_system_score_codex":0.001291588,"about_ca_system_score_gemma":0.001877965,"threshold_uncertainty_score":0.020026505},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07237219,0.0014927533,0.70095587,0.0008682985,0.00091576524,0.0007583936,0.00094307674,0.19030398,0.031389758],"genre_scores_gemma":[0.67241496,0.0011952758,0.2761068,0.0015975367,0.0004068808,0.00087177544,0.002472353,0.018111205,0.026823329],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99559706,0.0006502303,0.0003141573,0.0006998051,0.0022056592,0.0005331066],"domain_scores_gemma":[0.98549694,0.003358045,0.0008601986,0.007993791,0.002004442,0.00028658687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022083626,0.0012822127,0.0009252129,0.00080935546,0.0009985095,0.0018703839,0.002642324,0.0009374419,0.0099328635],"category_scores_gemma":[0.01349109,0.00088287296,0.00082802115,0.0006952315,0.0012407155,0.0028389804,0.0028804592,0.0020185644,0.004455047],"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.0012103186,0.00051412475,0.01943172,0.0019837224,0.00028992587,0.0009306813,0.0016591861,0.022908257,0.17587176,0.033273585,0.08098018,0.66094655],"study_design_scores_gemma":[0.00029474872,0.0014132828,0.019550288,0.0003969123,0.00034576614,0.0020691364,0.00031810117,0.2171198,0.3521161,0.035855025,0.37024963,0.0002711798],"about_ca_topic_score_codex":0.00082189,"about_ca_topic_score_gemma":0.0009028788,"teacher_disagreement_score":0.0099328635,"about_ca_system_score_codex":0.0006556551,"about_ca_system_score_gemma":0.0017507926,"threshold_uncertainty_score":0.033228755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04815875,0.00022708006,0.91036576,0.00032569573,0.00014322948,0.00034865743,0.001969166,0.025691876,0.012769827],"genre_scores_gemma":[0.5045209,0.0004998621,0.47351208,0.0003961742,0.00005694274,0.0009843154,0.0038099247,0.0020178687,0.014201857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996792,0.000082670194,0.000023280601,0.000042641863,0.000140542,0.000031707816],"domain_scores_gemma":[0.9994567,0.00023495306,0.000048161884,0.00013179358,0.00008993578,0.000038510512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005374277,0.00050544547,0.00038399894,0.00039204292,0.00024497116,0.0007379108,0.002162536,0.0005204761,0.008162523],"category_scores_gemma":[0.0014960984,0.0005112216,0.000497699,0.00044230258,0.00040401577,0.0013477703,0.00081821845,0.0010135358,0.0010532461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039731563,0.0001321827,0.0019167168,0.0002893677,0.00010042341,0.00018861957,0.00009951959,0.86827546,0.021102348,0.032721885,0.012142117,0.06263407],"study_design_scores_gemma":[0.000058281057,0.000056942434,0.00009288042,0.0000045589863,0.000012565193,0.00003944223,0.0000059865743,0.98236024,0.0055718403,0.0043441937,0.0074436907,0.000009425337],"about_ca_topic_score_codex":0.0022992373,"about_ca_topic_score_gemma":0.0027815201,"teacher_disagreement_score":0.008162523,"about_ca_system_score_codex":0.0005294025,"about_ca_system_score_gemma":0.0013013615,"threshold_uncertainty_score":0.027306378},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001439592,0.011507492,0.15997599,0.0013873345,0.003005657,0.000153382,0.0012304373,0.007964977,0.8133351],"genre_scores_gemma":[0.0070969174,0.006653424,0.04736119,0.00058049156,0.00048753864,0.00014571472,0.002048461,0.0011947803,0.93443143],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997106,0.00002221603,0.000008196331,0.00006594437,0.00016622836,0.000026682737],"domain_scores_gemma":[0.9998023,0.00002483969,0.000006800028,0.00005810997,0.000089357025,0.000018655823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018846292,0.0015651605,0.0008021115,0.0013637915,0.00067458744,0.0019929847,0.0016572406,0.0011697916,0.22456698],"category_scores_gemma":[0.0006416319,0.0006149849,0.00046893876,0.0022874158,0.0003942393,0.0018668016,0.0016606625,0.0022216951,0.14869416],"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.000056093395,0.000028425775,0.000059956248,0.000302681,0.000014930653,0.000047049252,0.000066318185,0.0015717933,0.006283379,0.05007923,0.3979614,0.54352874],"study_design_scores_gemma":[0.00000882588,0.000013708786,0.0000865134,0.000058680194,0.000007522527,0.00008541477,0.00000937179,0.0020548222,0.0021449889,0.0115108285,0.9840121,0.0000071363406],"about_ca_topic_score_codex":0.00072166347,"about_ca_topic_score_gemma":0.0012098241,"teacher_disagreement_score":0.22456698,"about_ca_system_score_codex":0.00053633546,"about_ca_system_score_gemma":0.00050664245,"threshold_uncertainty_score":0.7512514},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014052745,0.00020307668,0.971501,0.0005417868,0.00019693756,0.00009545228,0.00008552917,0.004492699,0.008830757],"genre_scores_gemma":[0.15809444,0.00038215847,0.8306896,0.0006094172,0.00017129931,0.00029913904,0.00016355318,0.0010428024,0.008547468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99829775,0.00047628974,0.00023830378,0.00020554593,0.0006338891,0.00014819227],"domain_scores_gemma":[0.9968707,0.0008980943,0.00030314023,0.0011015557,0.0006851362,0.00014137909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026104914,0.0005407924,0.00051519054,0.00048912596,0.00070474774,0.0023469534,0.0014250652,0.00083481375,0.002901728],"category_scores_gemma":[0.0039266767,0.00070137053,0.0013157749,0.0003498059,0.0021822627,0.0028003182,0.0021869475,0.002790393,0.0011351953],"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.00026312587,0.00012517629,0.0010478444,0.0003663122,0.00004249735,0.00058331894,0.0015521555,0.026772136,0.0112353675,0.8666469,0.0070408317,0.08432435],"study_design_scores_gemma":[0.00022728484,0.00021496725,0.0002686896,0.00023429198,0.00011204559,0.0011397586,0.00023081937,0.19000542,0.019109404,0.492115,0.29624134,0.00010097051],"about_ca_topic_score_codex":0.000494645,"about_ca_topic_score_gemma":0.0008838919,"teacher_disagreement_score":0.002901728,"about_ca_system_score_codex":0.00050707173,"about_ca_system_score_gemma":0.0013335928,"threshold_uncertainty_score":0.013805747},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033664084,0.009877969,0.8551267,0.00095916376,0.0017200836,0.00016941712,0.0007508708,0.027138894,0.10089046],"genre_scores_gemma":[0.06831621,0.019714355,0.7346549,0.0011709074,0.0012462283,0.00045145926,0.004407166,0.005591646,0.1644471],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928373,0.00007640262,0.000061895975,0.00011999593,0.00037066432,0.000087232314],"domain_scores_gemma":[0.99940014,0.0001646147,0.000038208,0.00022356749,0.00012297272,0.000050432736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006657696,0.0010405207,0.0007734137,0.0013654805,0.0006689149,0.0039768927,0.0023449187,0.0011996398,0.016400471],"category_scores_gemma":[0.0020846229,0.00070117676,0.0006798001,0.002787957,0.0005291006,0.0031564012,0.002029167,0.0019488735,0.014399494],"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.000102846825,0.0001393641,0.00027403646,0.00092218077,0.000052852774,0.00022063636,0.0003962088,0.0030129517,0.02078558,0.20159139,0.09147421,0.6810278],"study_design_scores_gemma":[0.000026983393,0.000057569894,0.0002618316,0.00023593077,0.000049055307,0.0006201063,0.00008420004,0.012350595,0.017481307,0.0696371,0.8991576,0.00003764671],"about_ca_topic_score_codex":0.00055883115,"about_ca_topic_score_gemma":0.0004949985,"teacher_disagreement_score":0.016400471,"about_ca_system_score_codex":0.0006248412,"about_ca_system_score_gemma":0.00091465504,"threshold_uncertainty_score":0.05486512},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2884657,0.00094231294,0.6753874,0.00021609155,0.00018673827,0.00024604358,0.00012100016,0.025290199,0.009144515],"genre_scores_gemma":[0.88885534,0.00020406883,0.10533518,0.00020168403,0.00003514761,0.000108554435,0.00018495852,0.0006058911,0.0044690357],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995523,0.0000803391,0.000022904633,0.000110533605,0.00012467941,0.0001093139],"domain_scores_gemma":[0.9993986,0.00010548505,0.0000752574,0.00028271103,0.00006121336,0.00007663472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000353744,0.00049962697,0.000331236,0.0002565873,0.00031174227,0.0010508422,0.0021152333,0.00033149408,0.0029034435],"category_scores_gemma":[0.00096337346,0.00037225368,0.0002447034,0.0001661376,0.0004625745,0.0013930391,0.0013427217,0.0009111519,0.0007193129],"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.0037740478,0.000735845,0.013855418,0.0007095772,0.00033145538,0.001394754,0.0014385934,0.06789936,0.3217491,0.036151424,0.022461439,0.5294989],"study_design_scores_gemma":[0.00034636375,0.0021211435,0.0072765765,0.00009624602,0.00018959821,0.0020357347,0.00021713786,0.5972919,0.2798144,0.009192434,0.10122807,0.00019039564],"about_ca_topic_score_codex":0.000934569,"about_ca_topic_score_gemma":0.00086492836,"teacher_disagreement_score":0.0029034435,"about_ca_system_score_codex":0.00042565467,"about_ca_system_score_gemma":0.00064056664,"threshold_uncertainty_score":0.0097129345},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00501336,0.006235602,0.8322189,0.0009785441,0.003033627,0.00044701446,0.008305165,0.06172454,0.082043335],"genre_scores_gemma":[0.12072856,0.01915856,0.6066781,0.0020885768,0.002796779,0.0010319405,0.023726564,0.030051537,0.19373934],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989672,0.00009703598,0.00013372411,0.00025409722,0.00043510876,0.00011287158],"domain_scores_gemma":[0.99900156,0.00017685909,0.00006782234,0.00046549994,0.00017159975,0.00011661212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081222306,0.0014686924,0.0012904481,0.0011132217,0.0007059059,0.006326442,0.0022909532,0.000920739,0.055943094],"category_scores_gemma":[0.0027421946,0.0009738656,0.00093876873,0.0022087828,0.0011474229,0.009295971,0.0027808812,0.0024885375,0.036508244],"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.00064832205,0.00009001919,0.00048345013,0.0012052661,0.00006079483,0.000321095,0.000385856,0.0022622836,0.01614985,0.2540841,0.2607203,0.46358865],"study_design_scores_gemma":[0.000089607194,0.00007650861,0.00032955327,0.00020335703,0.00006561332,0.0007276178,0.00007012847,0.007715182,0.016092107,0.1033678,0.8712006,0.0000619845],"about_ca_topic_score_codex":0.0010953074,"about_ca_topic_score_gemma":0.0008663718,"teacher_disagreement_score":0.055943094,"about_ca_system_score_codex":0.00050036184,"about_ca_system_score_gemma":0.0009701683,"threshold_uncertainty_score":0.18714833},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18541437,0.005885262,0.2501345,0.002803525,0.001875819,0.0004140276,0.008332026,0.040052418,0.5050881],"genre_scores_gemma":[0.64985347,0.002775639,0.1012146,0.0021924523,0.00040179378,0.00032244605,0.01351797,0.0038051503,0.22591645],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99947244,0.000043224867,0.000025843408,0.00010130664,0.00025619962,0.00010107813],"domain_scores_gemma":[0.99917954,0.000114617455,0.00006958865,0.0002556704,0.0003275021,0.000053025746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029136063,0.00046445892,0.00044216032,0.00054317684,0.00045157853,0.0013144485,0.0011132684,0.0005502924,0.04615929],"category_scores_gemma":[0.0011870945,0.00024236843,0.0003601414,0.001018943,0.0002836196,0.0015791602,0.0008803257,0.0007074529,0.016857957],"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.0009911774,0.00027889642,0.00609327,0.0009491892,0.0000798344,0.00038116076,0.00015629012,0.059920117,0.058838066,0.069781415,0.19440407,0.6081266],"study_design_scores_gemma":[0.00015646046,0.0006800897,0.005412959,0.000120084864,0.00006967512,0.0007543149,0.000116369156,0.18293495,0.08019634,0.03175241,0.69772685,0.00007952582],"about_ca_topic_score_codex":0.0022132369,"about_ca_topic_score_gemma":0.0033159524,"teacher_disagreement_score":0.04615929,"about_ca_system_score_codex":0.00076929334,"about_ca_system_score_gemma":0.0010078221,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03066859,0.00017507988,0.9655903,0.0001074899,0.000030791824,0.00006408924,0.0000568173,0.0028053191,0.00050144654],"genre_scores_gemma":[0.6525927,0.00014387746,0.34487665,0.00024411142,0.000060385115,0.00021444632,0.0002040639,0.0005311684,0.0011325947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947812,0.0015086965,0.00049850455,0.00074455864,0.0018064182,0.0006605127],"domain_scores_gemma":[0.9869725,0.0049940445,0.0016438288,0.004749398,0.0013897929,0.00025049574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039962674,0.0010434019,0.0010442999,0.0018323873,0.0010442068,0.0019604752,0.002596912,0.0011433308,0.0014273674],"category_scores_gemma":[0.0147966575,0.0009292721,0.0022156264,0.0010676322,0.0024689152,0.0046340865,0.0036438485,0.0028231444,0.0003571628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013291101,0.0004575806,0.039301418,0.0009383691,0.00059642957,0.0017137564,0.0027462824,0.39305648,0.13272864,0.22365446,0.0050328183,0.19844468],"study_design_scores_gemma":[0.000046854904,0.00023052633,0.0011051912,0.00005053696,0.00014397904,0.00034656536,0.00010261612,0.9002679,0.03985705,0.05362683,0.0041687805,0.0000531236],"about_ca_topic_score_codex":0.0020472198,"about_ca_topic_score_gemma":0.0024528098,"teacher_disagreement_score":0.0039962674,"about_ca_system_score_codex":0.0012770937,"about_ca_system_score_gemma":0.0021809526,"threshold_uncertainty_score":0.021134555},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010352673,0.00047154227,0.9716898,0.00095578376,0.00024058152,0.000051203177,0.00012889405,0.009388149,0.0067213844],"genre_scores_gemma":[0.26790476,0.0016917269,0.7041237,0.0013035428,0.00054320804,0.00018132111,0.00059443095,0.012182365,0.011474903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984977,0.00042317083,0.00013501942,0.00022570888,0.0005524209,0.00016597318],"domain_scores_gemma":[0.996427,0.00086115825,0.00016997689,0.0016584347,0.00062592013,0.00025752146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003153372,0.00084429234,0.0005930089,0.000605438,0.00049348996,0.0032587394,0.0024373122,0.0008292932,0.003444277],"category_scores_gemma":[0.005863217,0.00081385847,0.0008615379,0.0005757331,0.0023034436,0.0066406536,0.0035241453,0.002929572,0.0019218387],"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.0005852974,0.00021083931,0.004582751,0.00064806966,0.00013968334,0.00070724194,0.0028931054,0.020443289,0.042465817,0.5462817,0.02645444,0.35458776],"study_design_scores_gemma":[0.00012514369,0.00031302715,0.001423756,0.00026619626,0.00023428466,0.0008948766,0.0005379636,0.15713125,0.05421837,0.55540824,0.22927606,0.00017082522],"about_ca_topic_score_codex":0.0011893797,"about_ca_topic_score_gemma":0.0017775723,"teacher_disagreement_score":0.003444277,"about_ca_system_score_codex":0.0005099956,"about_ca_system_score_gemma":0.0011236918,"threshold_uncertainty_score":0.016676784},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03503314,0.0021522553,0.7630551,0.0013618299,0.0013087945,0.0002999946,0.007846745,0.102817826,0.08612428],"genre_scores_gemma":[0.39762828,0.0020847854,0.43408835,0.0019222382,0.00032337924,0.0006145905,0.02600998,0.015451398,0.12187702],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99960977,0.000043480955,0.000026152731,0.000103079285,0.00015442648,0.0000632222],"domain_scores_gemma":[0.9995266,0.00007910645,0.000033545428,0.00018800839,0.00013612045,0.00003656825],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00049286237,0.0011923441,0.0006108097,0.0006341095,0.00036150558,0.0018023804,0.002304088,0.00072507275,0.055996187],"category_scores_gemma":[0.0023001563,0.0005531352,0.0008025882,0.00087702525,0.0004831955,0.0033345926,0.0020258548,0.0013514812,0.020149669],"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.0017481856,0.00019657431,0.002692168,0.0011032373,0.00019671158,0.00023393842,0.00017987222,0.07780693,0.037853923,0.12527336,0.2839639,0.4687512],"study_design_scores_gemma":[0.00023526707,0.00043928574,0.0011560692,0.00014294281,0.0000963675,0.0004659328,0.000099162426,0.5257345,0.05469957,0.06470104,0.35212517,0.0001047348],"about_ca_topic_score_codex":0.0025698803,"about_ca_topic_score_gemma":0.0045848694,"teacher_disagreement_score":0.9440038,"about_ca_system_score_codex":0.0008377547,"about_ca_system_score_gemma":0.0012797364,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51187944,0.00040159692,0.4730321,0.00020018299,0.00015433921,0.00013141091,0.00025502013,0.00648536,0.0074605257],"genre_scores_gemma":[0.9368285,0.000062781815,0.061158255,0.00008877989,0.000021197786,0.000040370676,0.00013626585,0.00020776458,0.0014561095],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962604,0.00008692987,0.000021168767,0.00007910346,0.0001269155,0.000059780225],"domain_scores_gemma":[0.99928963,0.00025453317,0.00013580022,0.00018672994,0.00010594019,0.000027399728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000367894,0.00044812288,0.00017478132,0.0004120099,0.00017885733,0.00035360575,0.00054807577,0.00018024168,0.0022275916],"category_scores_gemma":[0.0011779694,0.00014450189,0.00015656768,0.00018752206,0.00029147396,0.00038081207,0.0003262939,0.00033571833,0.00025201848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001264438,0.00015987246,0.008082569,0.00030980178,0.00007405726,0.0006563954,0.00027579578,0.2798967,0.37541533,0.011231565,0.004579054,0.31805444],"study_design_scores_gemma":[0.00010988599,0.0009326752,0.0032835712,0.00003292872,0.000038681024,0.00034075795,0.00007145904,0.6191454,0.36088887,0.0042685797,0.010856006,0.000031208023],"about_ca_topic_score_codex":0.0006378377,"about_ca_topic_score_gemma":0.0010581419,"teacher_disagreement_score":0.0022275916,"about_ca_system_score_codex":0.000538743,"about_ca_system_score_gemma":0.00034505298,"threshold_uncertainty_score":0.0074520707},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0453946,0.019912485,0.237107,0.006294913,0.0042327447,0.0010158592,0.016126791,0.087668486,0.5822471],"genre_scores_gemma":[0.28023395,0.0066762334,0.13612041,0.009284718,0.0012390194,0.0011134103,0.03331262,0.0074053947,0.52461416],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999159,0.00008571054,0.00006128752,0.00020442366,0.0003490628,0.00014044301],"domain_scores_gemma":[0.9985342,0.000114245595,0.0000540143,0.00053249736,0.00067440426,0.0000905435],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000699037,0.0011905556,0.0007742993,0.00085909915,0.0012147785,0.0032972107,0.0037223767,0.0008913909,0.08431203],"category_scores_gemma":[0.0015964312,0.00064586493,0.0007194997,0.0013022096,0.00050924555,0.0048633725,0.0025945813,0.0018503502,0.036348578],"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.0012371377,0.00020544764,0.0041478896,0.0010618276,0.00018715892,0.00046237695,0.00044896104,0.007973409,0.019685484,0.141144,0.5816528,0.24179345],"study_design_scores_gemma":[0.0001734075,0.0003025622,0.000690993,0.00014791013,0.00009936052,0.00040068265,0.00013025319,0.017952275,0.021645203,0.023585496,0.93479913,0.00007266127],"about_ca_topic_score_codex":0.00505537,"about_ca_topic_score_gemma":0.007232384,"teacher_disagreement_score":0.915688,"about_ca_system_score_codex":0.001885277,"about_ca_system_score_gemma":0.0020250154,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036144042,0.005724965,0.0185295,0.0072543854,0.041640867,0.0008136067,0.01192647,0.003614466,0.90688133],"genre_scores_gemma":[0.014805703,0.0027913619,0.00788744,0.001125487,0.0068176016,0.00040508472,0.018696547,0.0011439061,0.9463269],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944264,0.00006652898,0.000016370279,0.00011787107,0.00025308272,0.000103624014],"domain_scores_gemma":[0.99892944,0.000037788806,0.000022758019,0.000083442166,0.00057701743,0.00034952315],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012021455,0.0010749425,0.00060931395,0.0013732263,0.0010785604,0.0032262956,0.0013224964,0.0013567861,0.37470487],"category_scores_gemma":[0.0011256814,0.00022066885,0.00059417717,0.0011380705,0.00025667023,0.0012859164,0.0020082903,0.0016185597,0.2070109],"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.00015392646,0.00007439438,0.00023949183,0.00015526886,0.000010403973,0.000085137544,0.00002101458,0.0004794537,0.0018074958,0.0033951718,0.8979036,0.09567469],"study_design_scores_gemma":[0.00001601764,0.000060841026,0.0005774864,0.00004779736,0.0000050470326,0.0000652864,0.000028321403,0.0008766499,0.0009887428,0.00091142,0.99641365,0.00000887214],"about_ca_topic_score_codex":0.003031542,"about_ca_topic_score_gemma":0.004880876,"teacher_disagreement_score":0.62529516,"about_ca_system_score_codex":0.0011428833,"about_ca_system_score_gemma":0.0016259204,"threshold_uncertainty_score":0.89190763},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028478585,0.00015779975,0.98977494,0.0001364673,0.000042937045,0.000055598586,0.00017400568,0.0041221837,0.0026881632],"genre_scores_gemma":[0.13526393,0.00051455875,0.85301965,0.00030399644,0.00018210751,0.00021538287,0.0008922061,0.0044399216,0.00516826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938228,0.0013153605,0.0005354472,0.0009606584,0.0028786089,0.0004869522],"domain_scores_gemma":[0.99546546,0.0015013863,0.00038684168,0.0014574573,0.0011008346,0.000087944725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035515958,0.0012297017,0.001014138,0.0027907172,0.0009664471,0.0047993036,0.0020206538,0.000993669,0.004450443],"category_scores_gemma":[0.006540901,0.0012507377,0.0031122155,0.0013931069,0.0020773793,0.0056685507,0.0020644118,0.0036297336,0.0021758035],"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.00025377958,0.00013451358,0.0038390632,0.000779818,0.00018095119,0.0007252931,0.001438701,0.037323363,0.058460392,0.7248532,0.007439734,0.16457114],"study_design_scores_gemma":[0.000058950107,0.00018229641,0.0018163533,0.0007290661,0.00031546486,0.0011415997,0.00030540145,0.33357784,0.16788511,0.3336481,0.16013423,0.00020566724],"about_ca_topic_score_codex":0.0016300086,"about_ca_topic_score_gemma":0.0014556956,"teacher_disagreement_score":0.0047993036,"about_ca_system_score_codex":0.001913497,"about_ca_system_score_gemma":0.0023849357,"threshold_uncertainty_score":0.018782914},"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":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0743211,0.00073271693,0.26287687,0.00099682,0.0009191249,0.0010323047,0.016944995,0.50533664,0.13683954],"genre_scores_gemma":[0.27885967,0.0009145396,0.47607985,0.0006962734,0.0003002925,0.00096932193,0.07442526,0.09083813,0.07691662],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925584,0.000063762294,0.000059375485,0.00018909556,0.00029568226,0.00013627682],"domain_scores_gemma":[0.9988238,0.00014019814,0.000039702656,0.00034706327,0.0005659134,0.00008331455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059979764,0.0013515527,0.00047563546,0.00095923495,0.00066196016,0.0010828236,0.0012467823,0.000299437,0.041734513],"category_scores_gemma":[0.0025708962,0.00072743837,0.0008379607,0.0014129942,0.00025591956,0.0013618616,0.0009099858,0.0014056258,0.03385776],"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.0007258982,0.00039318838,0.006341664,0.0005422955,0.0001241528,0.00071702065,0.00046175852,0.011981454,0.06071537,0.014556251,0.4829707,0.42047036],"study_design_scores_gemma":[0.00042276227,0.00045364987,0.01185743,0.00016830827,0.00012346325,0.00076293014,0.0004959685,0.19629711,0.1569393,0.023160353,0.6091178,0.00020093362],"about_ca_topic_score_codex":0.003412904,"about_ca_topic_score_gemma":0.006520127,"teacher_disagreement_score":0.041734513,"about_ca_system_score_codex":0.00064576464,"about_ca_system_score_gemma":0.0016668116,"threshold_uncertainty_score":0.1396159},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001765281,0.008831932,0.05726147,0.0051477044,0.0011860966,0.00003912273,0.00006953076,0.00022294109,0.9254759],"genre_scores_gemma":[0.23438287,0.01274441,0.043574605,0.003440948,0.0025276875,0.0003581372,0.00021686258,0.0005667021,0.7021878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940586,0.00016455256,0.00001773827,0.000101191945,0.0002497832,0.0000608321],"domain_scores_gemma":[0.9992065,0.00034298422,0.000033787997,0.00023196067,0.00010073486,0.00008401283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073595846,0.00080380286,0.0005212215,0.0009949034,0.0021991064,0.0053781923,0.0011875164,0.0012201808,0.023209391],"category_scores_gemma":[0.0024825481,0.0005479074,0.00047994388,0.001303397,0.00836525,0.009734403,0.0022000042,0.0039797025,0.0053255023],"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.000001700962,0.000002149143,0.000006971922,0.000005310341,5.581169e-7,0.000004314815,0.000088318244,0.00006755682,0.000031896187,0.9913936,0.0054119313,0.0029856018],"study_design_scores_gemma":[0.0000025307002,0.0000025810295,0.000016181959,0.0000132252035,0.0000013242827,0.000029638322,0.00005887509,0.00036827126,0.00006123874,0.9011332,0.09831054,0.0000024206513],"about_ca_topic_score_codex":0.00200522,"about_ca_topic_score_gemma":0.0023115668,"teacher_disagreement_score":0.023209391,"about_ca_system_score_codex":0.0022318708,"about_ca_system_score_gemma":0.0017390348,"threshold_uncertainty_score":0.077643156},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10993675,0.0004283287,0.8757942,0.0002415803,0.0001619232,0.00013262426,0.00020650968,0.007659682,0.0054383595],"genre_scores_gemma":[0.4745183,0.00017562055,0.51907855,0.00020988402,0.0000763263,0.00017583197,0.0008860785,0.0006851539,0.0041943234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993586,0.00009868399,0.000038783513,0.00008972443,0.00029749188,0.00011674194],"domain_scores_gemma":[0.9991161,0.00023689397,0.00008026093,0.00024033876,0.0002333906,0.00009297255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063594297,0.0007646796,0.00066179456,0.0007593449,0.00088095164,0.00068794325,0.0010993509,0.0003244937,0.0018290544],"category_scores_gemma":[0.0016663738,0.00036015324,0.0006161606,0.001075154,0.0005227572,0.0011580961,0.0016985906,0.000743605,0.00053816714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000660973,0.00041127182,0.0110224765,0.0002224919,0.0001516758,0.00026963404,0.00053183053,0.3468081,0.038299087,0.019071871,0.015697278,0.56685334],"study_design_scores_gemma":[0.00005846585,0.00014667184,0.00084001984,0.000008658364,0.000022016633,0.00005797994,0.000060884147,0.9732473,0.012986836,0.0069301575,0.005623965,0.000017149956],"about_ca_topic_score_codex":0.006731331,"about_ca_topic_score_gemma":0.014451003,"teacher_disagreement_score":0.006731331,"about_ca_system_score_codex":0.0006120746,"about_ca_system_score_gemma":0.0018572182,"threshold_uncertainty_score":0.013384283},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089135535,0.00025298996,0.8785847,0.00022145148,0.000114509494,0.00018802627,0.000092210365,0.024593465,0.0068171904],"genre_scores_gemma":[0.40614742,0.00014889802,0.5828063,0.00020754065,0.000043092197,0.00026506782,0.00034956733,0.0053018196,0.0047302754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986449,0.00023363074,0.00010881731,0.00023391188,0.0005816408,0.00019705604],"domain_scores_gemma":[0.9983479,0.0002843529,0.00015614693,0.00068221433,0.00045533766,0.00007406394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076046336,0.00086315785,0.00044303975,0.0004206091,0.0004345518,0.0011388188,0.0022761477,0.0005644724,0.0016084036],"category_scores_gemma":[0.0032470683,0.00067990157,0.0005612152,0.00045954614,0.00067667005,0.0015606425,0.001363626,0.0019787287,0.0011231155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00097415684,0.0008424758,0.01076382,0.0006775696,0.00026830682,0.00073886727,0.0008408763,0.18672295,0.36767426,0.027770704,0.012786272,0.38993973],"study_design_scores_gemma":[0.00009302178,0.00039391528,0.0028676728,0.000051553587,0.00010944372,0.00036565145,0.00011378414,0.6729926,0.28257278,0.008405012,0.03194501,0.00008963768],"about_ca_topic_score_codex":0.0009887674,"about_ca_topic_score_gemma":0.002309951,"teacher_disagreement_score":0.0022761477,"about_ca_system_score_codex":0.00056020275,"about_ca_system_score_gemma":0.0013911235,"threshold_uncertainty_score":0.0053806305},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003447044,0.00019592482,0.3236876,0.00023656158,0.00015463628,0.00039971594,0.008848986,0.64516497,0.017864542],"genre_scores_gemma":[0.16723517,0.00086639187,0.46213588,0.0016004271,0.0004034964,0.0032162163,0.10034096,0.21185893,0.052342556],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987703,0.00013363606,0.00010334338,0.0002957785,0.0005204409,0.00017655359],"domain_scores_gemma":[0.9982085,0.0004454478,0.0001747245,0.0004535067,0.00052219,0.00019567953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015985081,0.0018184052,0.0007543054,0.0013763058,0.00056588807,0.001667807,0.0029296596,0.00083203387,0.055739872],"category_scores_gemma":[0.0057381466,0.00088098174,0.0008435626,0.0010398593,0.0007689389,0.0019448948,0.0018899057,0.0021791353,0.026739132],"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.0018163746,0.00016901297,0.0036985355,0.00075315294,0.00014778115,0.0004604669,0.0005934311,0.009927109,0.025125049,0.01603186,0.6597445,0.28153276],"study_design_scores_gemma":[0.0010107547,0.00020294583,0.005299597,0.00022921913,0.00006641781,0.0007362555,0.000092634895,0.19649169,0.049977124,0.01338781,0.73229814,0.00020737908],"about_ca_topic_score_codex":0.005864888,"about_ca_topic_score_gemma":0.004427579,"teacher_disagreement_score":0.055739872,"about_ca_system_score_codex":0.0014899671,"about_ca_system_score_gemma":0.0021539296,"threshold_uncertainty_score":0.18646848},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51871234,0.0007867165,0.38202,0.0011413184,0.0002982146,0.00014894591,0.00283133,0.074513316,0.019547764],"genre_scores_gemma":[0.87550724,0.0003191385,0.11322932,0.00010770769,0.00003462471,0.000074701056,0.0018964467,0.0039385613,0.0048921546],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995327,0.00009342149,0.000027449709,0.000057806257,0.00021583233,0.0000729304],"domain_scores_gemma":[0.99816436,0.000689133,0.00013500858,0.00034833967,0.0004802574,0.00018287821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059619494,0.00065478985,0.0003522925,0.0015122268,0.00035344416,0.0011009328,0.0006452224,0.00037797232,0.004003842],"category_scores_gemma":[0.0021391087,0.00018974148,0.00036640107,0.00103428,0.00037236264,0.000709405,0.0007190566,0.0010146139,0.000476866],"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.0020603137,0.00071244244,0.038816217,0.0008778235,0.00017095447,0.0018776187,0.007094122,0.21827936,0.17696358,0.038803633,0.051444948,0.46289897],"study_design_scores_gemma":[0.000054748,0.00018661752,0.016772527,0.00015284767,0.00004729814,0.00037743963,0.0005596988,0.8302676,0.10708189,0.0061122053,0.03828463,0.00010241568],"about_ca_topic_score_codex":0.0050431048,"about_ca_topic_score_gemma":0.0027512044,"teacher_disagreement_score":0.0050431048,"about_ca_system_score_codex":0.00062062073,"about_ca_system_score_gemma":0.00080073264,"threshold_uncertainty_score":0.013394237},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85250247,0.0006002329,0.054136075,0.0001367658,0.00016235982,0.00030107406,0.0006971687,0.080920905,0.010542872],"genre_scores_gemma":[0.94540393,0.00014183167,0.04591348,0.000108903856,0.000019117495,0.00012983059,0.0014447189,0.0046310853,0.0022070033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99689263,0.0008807934,0.00027398588,0.0005829083,0.00094362145,0.00042601523],"domain_scores_gemma":[0.9922829,0.0027559376,0.0005113039,0.00260669,0.0012691097,0.0005740751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003130041,0.0011998992,0.00072247,0.00071465503,0.00049385394,0.0012375436,0.0024600541,0.00074342545,0.0023036234],"category_scores_gemma":[0.008739781,0.0006658613,0.00054115674,0.0007347577,0.000987943,0.0017401362,0.0012226998,0.0014563564,0.0009606594],"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.008112579,0.003755016,0.05043757,0.001637872,0.0005788589,0.0014949191,0.0022044706,0.3557488,0.2813816,0.018460376,0.024201961,0.2519859],"study_design_scores_gemma":[0.0002497557,0.0019788146,0.013609833,0.00006978302,0.00008512551,0.0003753687,0.00022498582,0.691877,0.27193636,0.0025604123,0.016856775,0.00017572132],"about_ca_topic_score_codex":0.0022033753,"about_ca_topic_score_gemma":0.002072262,"teacher_disagreement_score":0.003130041,"about_ca_system_score_codex":0.0010437424,"about_ca_system_score_gemma":0.0011463473,"threshold_uncertainty_score":0.016553402},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029880548,0.0001695562,0.9612479,0.0001634615,0.000046354788,0.000053507512,0.000034344037,0.0059182197,0.0024860096],"genre_scores_gemma":[0.53819174,0.00028749483,0.4578968,0.00010652729,0.000023020375,0.00012405441,0.00014230315,0.000661947,0.0025661173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999074,0.0003676132,0.000049670158,0.00009645383,0.00030064522,0.00011162685],"domain_scores_gemma":[0.9975618,0.0009428781,0.00017478374,0.00090171746,0.00030370874,0.0001150475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014023167,0.00061306125,0.00035953042,0.0004974247,0.00035760555,0.0012660899,0.0015709342,0.00075896765,0.0029901112],"category_scores_gemma":[0.0035176186,0.00041659453,0.00043522898,0.0003888851,0.0010379732,0.0018497198,0.0011899775,0.00145758,0.00050174835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007882558,0.0002843479,0.008461474,0.00030833736,0.000117447475,0.0004845524,0.0008688545,0.5657518,0.040489122,0.09528044,0.006060121,0.2811052],"study_design_scores_gemma":[0.000055819633,0.00014392551,0.00041487266,0.000030885705,0.000019528736,0.00010266537,0.000054309075,0.9492969,0.02507315,0.016082196,0.0086999005,0.00002578462],"about_ca_topic_score_codex":0.0028813824,"about_ca_topic_score_gemma":0.0032572653,"teacher_disagreement_score":0.0029901112,"about_ca_system_score_codex":0.0007185192,"about_ca_system_score_gemma":0.0010442317,"threshold_uncertainty_score":0.0100028515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27017418,0.001207244,0.70860565,0.00046085814,0.00018989363,0.00042279187,0.00035722193,0.005572787,0.01300946],"genre_scores_gemma":[0.8307993,0.00020622273,0.16515169,0.00014713989,0.00002892376,0.00018865445,0.00021394258,0.000040425482,0.0032237535],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99982136,0.000026114,0.000019948367,0.000035381738,0.000061662904,0.00003563592],"domain_scores_gemma":[0.99983275,0.00002054796,0.000023670571,0.000028133501,0.00007674417,0.000018073893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013504259,0.00019940642,0.0002984557,0.0003174646,0.00031334598,0.00048277288,0.001133529,0.0004036897,0.0021161744],"category_scores_gemma":[0.00022834267,0.00016941527,0.00024996264,0.0002677571,0.00011859014,0.0004047098,0.00024068922,0.00028104385,0.00046790953],"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.0007988309,0.00038198783,0.007106159,0.0009378663,0.00036884678,0.0012620449,0.00028704482,0.20938066,0.5103504,0.013975646,0.01023304,0.24491742],"study_design_scores_gemma":[0.00023998276,0.0012616679,0.0028427842,0.000049726652,0.00016938313,0.0007766645,0.00006523044,0.83115584,0.14168122,0.0011984431,0.020504927,0.00005414213],"about_ca_topic_score_codex":0.0015900643,"about_ca_topic_score_gemma":0.002103493,"teacher_disagreement_score":0.0021161744,"about_ca_system_score_codex":0.00037691515,"about_ca_system_score_gemma":0.00067748246,"threshold_uncertainty_score":0.0070793033},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012334603,0.000059848742,0.9876552,0.0001683283,0.00009011615,0.000043040516,0.00034027125,0.006910262,0.0034994397],"genre_scores_gemma":[0.04866066,0.000359087,0.9333523,0.0007141172,0.000100862075,0.0005637252,0.0016672943,0.00796312,0.0066187927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860966,0.00029840137,0.00014028336,0.00015197584,0.00070220727,0.000097446784],"domain_scores_gemma":[0.99866736,0.0005982031,0.00010182748,0.00023945974,0.0003065294,0.00008666184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017101665,0.0007722721,0.0006956666,0.00070193096,0.000635286,0.002271011,0.0021874749,0.0010335614,0.0074835913],"category_scores_gemma":[0.0062073222,0.0005815288,0.001324058,0.00060872076,0.0016462408,0.0017928436,0.0030361358,0.0035492766,0.0036007857],"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.00016220415,0.0000956074,0.0019263313,0.00073805626,0.00008578933,0.0004326184,0.00072209386,0.114909165,0.02052502,0.68543243,0.032106303,0.14286427],"study_design_scores_gemma":[0.000089324865,0.000055759167,0.0002073325,0.00016885923,0.000027069753,0.00023958138,0.00009270034,0.52308065,0.020427931,0.2169957,0.23854724,0.00006781325],"about_ca_topic_score_codex":0.0018826759,"about_ca_topic_score_gemma":0.0026992348,"teacher_disagreement_score":0.0074835913,"about_ca_system_score_codex":0.00078880123,"about_ca_system_score_gemma":0.0025187668,"threshold_uncertainty_score":0.025035143},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022445205,0.06931229,0.123989895,0.005587882,0.019585377,0.000240436,0.00080707704,0.00445202,0.7737806],"genre_scores_gemma":[0.0067286496,0.022133492,0.016632505,0.0008357186,0.0034108472,0.00014119917,0.00054024335,0.0006338106,0.94894344],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994413,0.00004275949,0.000017056143,0.00008166759,0.00037586337,0.000041310934],"domain_scores_gemma":[0.9992968,0.00017261358,0.00003737483,0.00015145775,0.00023844787,0.00010324187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047583843,0.0022202334,0.0018862349,0.0018877832,0.0011216989,0.00280962,0.0011768506,0.001329541,0.09978428],"category_scores_gemma":[0.0014072285,0.0007123696,0.00041011715,0.0038181574,0.0009621699,0.0031718805,0.0019963118,0.0033545948,0.08873051],"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.000042203344,0.0000457706,0.00008954238,0.00035523856,0.000022436441,0.000052517804,0.00006325228,0.001328982,0.0022471817,0.052699,0.53438133,0.40867245],"study_design_scores_gemma":[0.000010408445,0.0000466222,0.0002661556,0.00014061872,0.000013653138,0.00017401841,0.000025775329,0.0032303187,0.0011487325,0.028650751,0.9662788,0.000014214494],"about_ca_topic_score_codex":0.0006923461,"about_ca_topic_score_gemma":0.0013601941,"teacher_disagreement_score":0.09978428,"about_ca_system_score_codex":0.00079153833,"about_ca_system_score_gemma":0.00091349153,"threshold_uncertainty_score":0.3338117},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47151005,0.0010394977,0.4953405,0.00024805954,0.00023083761,0.00013173536,0.00024702953,0.012520615,0.018731738],"genre_scores_gemma":[0.92214304,0.000092006274,0.06990346,0.00007525076,0.000024424126,0.00006231787,0.00016610336,0.0005946315,0.0069387355],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996666,0.00007530623,0.000023108856,0.000049372993,0.00009842778,0.000087225046],"domain_scores_gemma":[0.9992787,0.0002959223,0.00007777106,0.00016205944,0.00013604984,0.000049502698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041173957,0.0007323142,0.0004743589,0.00044893654,0.0005472729,0.00076297554,0.001483466,0.00031237927,0.0101160575],"category_scores_gemma":[0.0011581111,0.0002624489,0.0004236044,0.00035949273,0.00029617953,0.000999675,0.0006959905,0.00043866676,0.00092815835],"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.005333016,0.0006448739,0.0045577744,0.0008083626,0.00028682555,0.0007733713,0.00055136165,0.38349432,0.16002418,0.017202543,0.012075426,0.41424796],"study_design_scores_gemma":[0.0001515314,0.00059577695,0.000992386,0.000032074044,0.00008890572,0.00013756205,0.000099062105,0.930536,0.055982064,0.004295634,0.0070476853,0.000041308263],"about_ca_topic_score_codex":0.0015851272,"about_ca_topic_score_gemma":0.0041723833,"teacher_disagreement_score":0.0101160575,"about_ca_system_score_codex":0.00037810512,"about_ca_system_score_gemma":0.00083712785,"threshold_uncertainty_score":0.03384161},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32753786,0.004173654,0.25983638,0.018388957,0.002254531,0.000906004,0.0064575323,0.07784898,0.302596],"genre_scores_gemma":[0.82828665,0.0011123923,0.1051199,0.001496706,0.00035053585,0.00037569721,0.0044877143,0.0027664069,0.056004066],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982843,0.00025627261,0.000062078565,0.0001612141,0.0011151012,0.0001210619],"domain_scores_gemma":[0.9983991,0.0002327354,0.000084083236,0.00039233838,0.00073298183,0.00015880441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011621059,0.00042599565,0.00036003994,0.0005027348,0.0007139851,0.0014797815,0.00066321617,0.0004249482,0.0069582677],"category_scores_gemma":[0.0019654685,0.00028496017,0.00020308935,0.00077363406,0.0007364755,0.0014635532,0.0010076761,0.0015668888,0.0032051879],"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.0010302166,0.00040526298,0.0071506975,0.0004400225,0.00007705299,0.00065925904,0.0011355198,0.04392028,0.13379908,0.035993572,0.3990666,0.3763225],"study_design_scores_gemma":[0.00018121561,0.0008254488,0.009798493,0.00013530924,0.000052648207,0.0003692757,0.00033458235,0.13019888,0.14075993,0.010944111,0.7062062,0.00019389826],"about_ca_topic_score_codex":0.0053762663,"about_ca_topic_score_gemma":0.0062615266,"teacher_disagreement_score":0.0069582677,"about_ca_system_score_codex":0.0010930144,"about_ca_system_score_gemma":0.0015382906,"threshold_uncertainty_score":0.02327776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4766907,0.00041875124,0.50560665,0.00013917121,0.000060449616,0.00011224263,0.0002247155,0.008084094,0.008663271],"genre_scores_gemma":[0.78038245,0.0001034525,0.2166436,0.000066687404,0.000017238006,0.000103878294,0.0003654315,0.0007395261,0.001577743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955314,0.00011620566,0.000023235014,0.00009529582,0.00009564525,0.000116374125],"domain_scores_gemma":[0.9991217,0.00040834755,0.00012007675,0.00018842827,0.0001246623,0.000036725844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000613113,0.0007411414,0.0004270821,0.0003984848,0.0003486415,0.00055699755,0.00081373175,0.00028208946,0.0010752374],"category_scores_gemma":[0.001877789,0.00030931615,0.00044259467,0.00045078286,0.00055151875,0.0006337832,0.00060896267,0.0004293169,0.00031195785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047976506,0.00023013803,0.004419034,0.00030917465,0.000054448843,0.00029521054,0.00018872954,0.80826753,0.05748026,0.011047074,0.0027206293,0.11450807],"study_design_scores_gemma":[0.00003061298,0.0001642977,0.000429196,0.0000092540095,0.000016261967,0.000039761715,0.00003707005,0.9735748,0.020024402,0.0045352476,0.0011319013,0.000007253559],"about_ca_topic_score_codex":0.001852644,"about_ca_topic_score_gemma":0.0037549054,"teacher_disagreement_score":0.001852644,"about_ca_system_score_codex":0.0006094699,"about_ca_system_score_gemma":0.0011475234,"threshold_uncertainty_score":0.0044220686},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045016245,0.003797042,0.008427351,0.0029181296,0.006961383,0.00012550097,0.0018622415,0.0011286068,0.97432965],"genre_scores_gemma":[0.0013698577,0.0018497339,0.00172922,0.00081720593,0.0010608189,0.000067646775,0.0013171564,0.00028664613,0.9915017],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99942964,0.000046430207,0.000017765948,0.00012157691,0.0003241,0.000060534865],"domain_scores_gemma":[0.99931335,0.00008325577,0.000024258472,0.000100296216,0.0003320216,0.0001467484],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000517041,0.00097329105,0.0005815452,0.0016144088,0.0011249525,0.003452639,0.0014387271,0.0014729376,0.53934884],"category_scores_gemma":[0.0018707241,0.00031581213,0.00049735856,0.0013422123,0.0005133413,0.0027144796,0.0022147,0.0017344548,0.4803984],"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.00002586433,0.000038670605,0.00008500133,0.00018091436,0.0000028009981,0.000040635,0.000086818305,0.00020732895,0.0007163256,0.034922343,0.74553424,0.21815917],"study_design_scores_gemma":[0.000001688955,0.0000063394577,0.00005409887,0.000053494663,9.556738e-7,0.0000256836,0.000020554618,0.0000343916,0.00011556478,0.0040065963,0.9956781,0.0000024546978],"about_ca_topic_score_codex":0.0013347727,"about_ca_topic_score_gemma":0.002416013,"teacher_disagreement_score":0.53934884,"about_ca_system_score_codex":0.0011518493,"about_ca_system_score_gemma":0.0015827768,"threshold_uncertainty_score":0.65706295},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08828289,0.0017189194,0.7890743,0.003212356,0.0013337818,0.00024158518,0.0021470247,0.0063879085,0.107601255],"genre_scores_gemma":[0.7269126,0.0011286861,0.19403817,0.0013507297,0.0007409036,0.00030529793,0.0024118267,0.0021646668,0.07094712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975352,0.0005536732,0.0002061745,0.0003102008,0.0009813269,0.0004134246],"domain_scores_gemma":[0.99284184,0.0013239245,0.0003529287,0.004370162,0.00097572466,0.00013539691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018484674,0.00057643943,0.000885796,0.00084903603,0.0011596892,0.0029049804,0.0029833326,0.0011799925,0.011312682],"category_scores_gemma":[0.0076966668,0.00050428574,0.00063733,0.0017885325,0.0016336987,0.008131898,0.0024026132,0.0022648263,0.0024500568],"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.00033289084,0.000084794796,0.0005021759,0.00013271812,0.000022778528,0.0003132082,0.00020831141,0.020584757,0.003847915,0.89547515,0.017366588,0.061128803],"study_design_scores_gemma":[0.00007550227,0.000049005317,0.00019951265,0.00004117871,0.000039389728,0.0003017615,0.00010944733,0.09741265,0.01420997,0.8511664,0.036357034,0.000038078928],"about_ca_topic_score_codex":0.00285176,"about_ca_topic_score_gemma":0.0026744148,"teacher_disagreement_score":0.011312682,"about_ca_system_score_codex":0.0011891752,"about_ca_system_score_gemma":0.0019346745,"threshold_uncertainty_score":0.037844718},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25527024,0.0014052562,0.7204858,0.000613133,0.00022718128,0.00020231085,0.00022152958,0.0068861106,0.014688554],"genre_scores_gemma":[0.9174113,0.0002405203,0.07851634,0.00011058927,0.000046345427,0.00009003053,0.00034016123,0.00030240044,0.0029423232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996587,0.000047204,0.000016002177,0.00007538316,0.00010709695,0.0000956362],"domain_scores_gemma":[0.999701,0.000050782626,0.000044165587,0.00006324823,0.00009408263,0.000046690664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003242012,0.000712052,0.00046994578,0.00071406853,0.0007517017,0.0008339782,0.0013237441,0.00035887296,0.0021300977],"category_scores_gemma":[0.0007638901,0.00022084522,0.00037594233,0.00092740264,0.0002577345,0.0011848672,0.00083968433,0.00044372215,0.000655832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070348685,0.00051312393,0.006240937,0.00021651288,0.00010739457,0.00041660343,0.00024124428,0.416857,0.08309928,0.0095576625,0.013461206,0.46858558],"study_design_scores_gemma":[0.000020370746,0.000085668406,0.002092275,0.000008650354,0.000022577218,0.0000671937,0.00010379737,0.97453034,0.011515078,0.005727845,0.0058030947,0.000023130306],"about_ca_topic_score_codex":0.0028982658,"about_ca_topic_score_gemma":0.0048427912,"teacher_disagreement_score":0.0028982658,"about_ca_system_score_codex":0.0007490173,"about_ca_system_score_gemma":0.00078768475,"threshold_uncertainty_score":0.0071258545},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0905233,0.002744491,0.87175804,0.00037639905,0.00031890345,0.00008108128,0.00048550696,0.01970343,0.014008808],"genre_scores_gemma":[0.44249442,0.00078115304,0.5444819,0.00026000073,0.00011216867,0.0001107992,0.0012650137,0.0023660979,0.008128464],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994041,0.00009180627,0.00003452145,0.00012250956,0.00022543703,0.000121657424],"domain_scores_gemma":[0.99895775,0.0002711561,0.000064280044,0.0003186565,0.00033202724,0.000056074714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039326467,0.00086690066,0.0006572752,0.0007800444,0.0007072614,0.0017848986,0.0020589777,0.00067784544,0.0038606268],"category_scores_gemma":[0.0018672842,0.0006269905,0.00043535762,0.0010508607,0.0003544296,0.001618972,0.0016862017,0.0010737404,0.0016753554],"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.00078622263,0.00021290558,0.0032750426,0.00052563415,0.00010914537,0.00028163812,0.00026459168,0.056669477,0.1815818,0.01229912,0.023678275,0.72031605],"study_design_scores_gemma":[0.000051557166,0.00010717353,0.0016842998,0.000049404473,0.000056200806,0.00021501708,0.00009834618,0.8701415,0.096724965,0.012441528,0.018394552,0.000035421137],"about_ca_topic_score_codex":0.0019993752,"about_ca_topic_score_gemma":0.0038705857,"teacher_disagreement_score":0.0038606268,"about_ca_system_score_codex":0.00041856102,"about_ca_system_score_gemma":0.00091678137,"threshold_uncertainty_score":0.012915075},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0944002,0.001848432,0.4985292,0.0024392367,0.0021648963,0.0006257081,0.015232824,0.044839133,0.33992034],"genre_scores_gemma":[0.5669932,0.00047901654,0.25175992,0.0005254311,0.00026171628,0.00020760621,0.008256686,0.0030677896,0.16844866],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99964964,0.000041861345,0.000007973621,0.00006081538,0.00019031786,0.00004943897],"domain_scores_gemma":[0.9994796,0.000098791614,0.000033437263,0.00011693102,0.000214107,0.00005715297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006612574,0.000343292,0.0004420813,0.00071495713,0.00071714283,0.0010833534,0.0011674005,0.00085766043,0.059529584],"category_scores_gemma":[0.00090619177,0.00030297486,0.00023644423,0.00079444493,0.00030285673,0.00069999567,0.0005784324,0.0008268743,0.015324857],"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.0066283424,0.00031254775,0.010491977,0.0005479998,0.00009930032,0.0011324913,0.00066256773,0.0341891,0.2176022,0.029698439,0.3033241,0.39531094],"study_design_scores_gemma":[0.0004440845,0.0014111872,0.032240313,0.00020035249,0.00014828566,0.0015354382,0.0002446702,0.2940606,0.23327066,0.010681075,0.4255569,0.00020650488],"about_ca_topic_score_codex":0.0028570776,"about_ca_topic_score_gemma":0.0038135916,"teacher_disagreement_score":0.059529584,"about_ca_system_score_codex":0.0006834447,"about_ca_system_score_gemma":0.0006922781,"threshold_uncertainty_score":0.19914633},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99670655,0.00019768975,0.0012959068,0.00014720549,0.000005677575,0.000018040146,0.00011958127,0.000102163365,0.0014073021],"genre_scores_gemma":[0.9954204,0.00015472104,0.002664401,0.00006746973,0.0000057804523,0.000020315352,0.00033978076,0.00007493589,0.0012521779],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9953591,0.0019617048,0.00033168856,0.0004600593,0.0015496741,0.00033780374],"domain_scores_gemma":[0.84437066,0.114837244,0.020201944,0.009071404,0.008954926,0.0025638817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054046954,0.00025353802,0.00019840371,0.0020207844,0.00046180107,0.0013551681,0.0012495082,0.0009864866,0.0016568037],"category_scores_gemma":[0.097978145,0.00038439102,0.00030846742,0.0018670674,0.0010580603,0.002610783,0.0010544528,0.0015394314,0.00058951497],"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.0004939673,0.0015051166,0.7953655,0.00030367868,0.00012126081,0.0004209903,0.0067897686,0.0072115427,0.0042230156,0.003851221,0.002919426,0.17679448],"study_design_scores_gemma":[0.00008132604,0.0022122646,0.81698257,0.0005556786,0.00026553692,0.002278681,0.010996207,0.1164445,0.015692096,0.006457629,0.027900804,0.0001326374],"about_ca_topic_score_codex":0.0031448056,"about_ca_topic_score_gemma":0.0046634227,"teacher_disagreement_score":0.0054046954,"about_ca_system_score_codex":0.0011505258,"about_ca_system_score_gemma":0.001499545,"threshold_uncertainty_score":0.02858311},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4763091,0.0032426391,0.45939726,0.00059927156,0.00065430126,0.0003596487,0.0017784268,0.02570758,0.031951804],"genre_scores_gemma":[0.7381072,0.0006232743,0.25017613,0.00015414415,0.00006373369,0.00024707874,0.0016735661,0.0007172147,0.008237643],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99919015,0.00010881507,0.000075810494,0.00013850647,0.00035906353,0.00012771232],"domain_scores_gemma":[0.9992743,0.00018775168,0.00007742971,0.00013445664,0.0002865051,0.000039514725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062333187,0.0008723667,0.00049377274,0.0011267284,0.00029649088,0.0007375948,0.0011201308,0.0004684031,0.013433297],"category_scores_gemma":[0.0019482281,0.00021908413,0.00022924689,0.001184047,0.0002103182,0.001208754,0.000315683,0.00050743844,0.0023504728],"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.003799636,0.00047650197,0.006981588,0.001355172,0.0001891317,0.001136666,0.0004956964,0.06867973,0.12628362,0.015377875,0.031368695,0.7438557],"study_design_scores_gemma":[0.0009185725,0.0037802148,0.014667717,0.00025850438,0.0001972729,0.0016530048,0.00038048852,0.50709075,0.41042525,0.0036158958,0.056867406,0.00014491644],"about_ca_topic_score_codex":0.001810678,"about_ca_topic_score_gemma":0.0014309754,"teacher_disagreement_score":0.013433297,"about_ca_system_score_codex":0.0007056779,"about_ca_system_score_gemma":0.0005888888,"threshold_uncertainty_score":0.044938862},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048263194,0.014330792,0.20186584,0.003166951,0.0027698812,0.00008845455,0.00029172093,0.0016839872,0.77097607],"genre_scores_gemma":[0.14914411,0.019691905,0.079426214,0.0017743701,0.0015421907,0.00030692256,0.0008569506,0.0010119253,0.7462453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952435,0.000054159205,0.000016258331,0.000106119805,0.00022720628,0.00007200222],"domain_scores_gemma":[0.99969363,0.000076175624,0.000013810729,0.00011425506,0.00007031488,0.000031831623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037450116,0.0010387681,0.0005744425,0.0008582592,0.0010706236,0.003025553,0.0014880302,0.0011749101,0.05334659],"category_scores_gemma":[0.001085903,0.0004482207,0.00045567716,0.0007862044,0.0013188394,0.0047106524,0.002536747,0.0019553886,0.019842826],"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.000040613857,0.00003712892,0.00008275293,0.00019467415,0.000012296254,0.000069361326,0.00017183849,0.0011345409,0.004811238,0.7823915,0.049363118,0.16169097],"study_design_scores_gemma":[0.0000128376005,0.000049409813,0.00016834756,0.00018364521,0.000012373074,0.00028992,0.00010499925,0.0038620771,0.0056657814,0.3720049,0.6176246,0.000021132788],"about_ca_topic_score_codex":0.00023980891,"about_ca_topic_score_gemma":0.00033922095,"teacher_disagreement_score":0.05334659,"about_ca_system_score_codex":0.0006860364,"about_ca_system_score_gemma":0.00045315048,"threshold_uncertainty_score":0.17846215},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8546213,0.00057501305,0.12571295,0.00027420008,0.00009986446,0.00013607093,0.00081352034,0.0013127555,0.016454369],"genre_scores_gemma":[0.9788937,0.00033104836,0.015158949,0.00003139779,0.0000056890203,0.000041555588,0.00019012301,0.00016550453,0.0051819477],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994734,0.000057084962,0.000024186698,0.00008631565,0.0003079375,0.00005109495],"domain_scores_gemma":[0.9991148,0.00046820438,0.000076467266,0.00012416833,0.00018802487,0.00002826325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048332682,0.000370842,0.00051298377,0.00035718374,0.00034330672,0.0007742794,0.00062665896,0.00040688287,0.0058666314],"category_scores_gemma":[0.0016228341,0.0003199366,0.00038999406,0.0006152848,0.0003538646,0.0007036894,0.0003719057,0.00043651974,0.00063373335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021302334,0.00032182917,0.008416996,0.0013753992,0.000109177985,0.0004030426,0.00076317694,0.16581015,0.66929376,0.008077143,0.0014276037,0.14187148],"study_design_scores_gemma":[0.00012300805,0.0012402005,0.010553272,0.000049325772,0.00008364654,0.00025176964,0.00040246942,0.14751096,0.82060534,0.001897306,0.017213736,0.00006901186],"about_ca_topic_score_codex":0.0016234957,"about_ca_topic_score_gemma":0.0021920279,"teacher_disagreement_score":0.0058666314,"about_ca_system_score_codex":0.00067464396,"about_ca_system_score_gemma":0.00056308974,"threshold_uncertainty_score":0.019625783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20767008,0.0009730284,0.7293915,0.00065242854,0.00017474827,0.00022136055,0.0005233042,0.05270953,0.0076840534],"genre_scores_gemma":[0.8939593,0.000081317696,0.10201502,0.00032359507,0.000029978224,0.00012106737,0.0005418322,0.00075764663,0.0021703306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992061,0.00018257585,0.00003312189,0.00024449505,0.00021972711,0.00011389653],"domain_scores_gemma":[0.99880624,0.0005889706,0.00008059211,0.0002446467,0.0001837895,0.00009574666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013758995,0.0010906912,0.000801422,0.00036358647,0.0003840059,0.0009085905,0.002222434,0.00079207215,0.0026555413],"category_scores_gemma":[0.0043498576,0.0005449298,0.00035588245,0.00040819874,0.00065895927,0.0015215056,0.0012008745,0.0017697983,0.00075782393],"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.00061171904,0.00046517717,0.0039536157,0.00008537928,0.000099055775,0.00011859121,0.00011452774,0.79269123,0.016904455,0.002523329,0.009508924,0.17292391],"study_design_scores_gemma":[0.000021151787,0.000029669189,0.00013478177,0.000001323286,0.0000026571192,0.000006756657,0.0000063688535,0.9973117,0.001533792,0.00060185604,0.00034543365,0.000004492396],"about_ca_topic_score_codex":0.010806963,"about_ca_topic_score_gemma":0.011009999,"teacher_disagreement_score":0.010806963,"about_ca_system_score_codex":0.0010042016,"about_ca_system_score_gemma":0.0014765749,"threshold_uncertainty_score":0.02148813},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021218112,0.009029301,0.89257467,0.0017571226,0.0031139757,0.00036903226,0.0008543831,0.018887259,0.052196052],"genre_scores_gemma":[0.3765975,0.006168058,0.5103864,0.0033217014,0.001501684,0.00085407175,0.0020148435,0.0019941758,0.0971615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994319,0.0000817014,0.000051302486,0.00013306472,0.00020291863,0.00009901175],"domain_scores_gemma":[0.9989999,0.00017004953,0.00010204904,0.00040083536,0.0002558671,0.000071245784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005173117,0.0008760139,0.00046352833,0.00087659084,0.0005804144,0.0023688618,0.0030064315,0.00091453956,0.018709876],"category_scores_gemma":[0.0023018739,0.00029358632,0.00061564404,0.0015494735,0.0009127338,0.0052174716,0.0020063615,0.0017549144,0.0066277413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009252902,0.0001917136,0.0015184348,0.00086459116,0.00012603485,0.0004897072,0.00028463922,0.01146119,0.04263422,0.31514096,0.0649176,0.56144553],"study_design_scores_gemma":[0.00018655497,0.00081344263,0.0005135715,0.00018050772,0.00023526956,0.0012644657,0.00015782558,0.10374386,0.08491678,0.11570798,0.69217247,0.000107283166],"about_ca_topic_score_codex":0.0007020018,"about_ca_topic_score_gemma":0.0009381035,"teacher_disagreement_score":0.018709876,"about_ca_system_score_codex":0.0007181485,"about_ca_system_score_gemma":0.00088426884,"threshold_uncertainty_score":0.06259072},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021218112,0.009029301,0.89257467,0.0017571226,0.0031139757,0.00036903226,0.0008543831,0.018887259,0.052196052],"genre_scores_gemma":[0.3765975,0.006168058,0.5103864,0.0033217014,0.001501684,0.00085407175,0.0020148435,0.0019941758,0.0971615],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994319,0.0000817014,0.000051302486,0.00013306472,0.00020291863,0.00009901175],"domain_scores_gemma":[0.9989999,0.00017004953,0.00010204904,0.00040083536,0.0002558671,0.000071245784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005173117,0.0008760139,0.00046352833,0.00087659084,0.0005804144,0.0023688618,0.0030064315,0.00091453956,0.018709876],"category_scores_gemma":[0.0023018739,0.00029358632,0.00061564404,0.0015494735,0.0009127338,0.0052174716,0.0020063615,0.0017549144,0.0066277413],"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.0009252902,0.0001917136,0.0015184348,0.00086459116,0.00012603485,0.0004897072,0.00028463922,0.01146119,0.04263422,0.31514096,0.0649176,0.56144553],"study_design_scores_gemma":[0.00018655497,0.00081344263,0.0005135715,0.00018050772,0.00023526956,0.0012644657,0.00015782558,0.10374386,0.08491678,0.11570798,0.69217247,0.000107283166],"about_ca_topic_score_codex":0.0007020018,"about_ca_topic_score_gemma":0.0009381035,"teacher_disagreement_score":0.018709876,"about_ca_system_score_codex":0.0007181485,"about_ca_system_score_gemma":0.00088426884,"threshold_uncertainty_score":0.06259072},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2716156,0.0024129595,0.4931231,0.0010852806,0.00060317456,0.0002938105,0.008470021,0.21007931,0.012316616],"genre_scores_gemma":[0.7767622,0.00038835843,0.20116055,0.00046138212,0.000088668574,0.0002724613,0.009594297,0.0036008842,0.00767123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949,0.00007904315,0.000032413052,0.00013392136,0.00018572797,0.00007888223],"domain_scores_gemma":[0.9986141,0.00055328966,0.0001588771,0.00021676984,0.0003572513,0.00009969353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009327537,0.0022570933,0.00049470155,0.00072665996,0.00044186955,0.000843342,0.0015409727,0.00064255996,0.00626943],"category_scores_gemma":[0.0045610685,0.00072570314,0.00049278676,0.0006033887,0.0003896065,0.0017443142,0.000673018,0.0015797421,0.0018120713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019329524,0.00036830787,0.025654769,0.00059195573,0.00025117997,0.0002849232,0.00020730899,0.6483234,0.01933956,0.006377372,0.0872652,0.20940308],"study_design_scores_gemma":[0.000034571352,0.000082667604,0.0010085556,0.000009658469,0.000011284787,0.000017909162,0.000014063513,0.99025047,0.0049080704,0.0014439963,0.0022027714,0.00001590069],"about_ca_topic_score_codex":0.015190925,"about_ca_topic_score_gemma":0.03491526,"teacher_disagreement_score":0.015190925,"about_ca_system_score_codex":0.0011312825,"about_ca_system_score_gemma":0.0026985263,"threshold_uncertainty_score":0.030205011},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06004886,0.0019426632,0.76331866,0.0012298652,0.00066375366,0.0002774944,0.0007849533,0.15996125,0.0117725665],"genre_scores_gemma":[0.3984024,0.000604316,0.55315036,0.0013045393,0.00025791745,0.00031279575,0.0034497723,0.022551883,0.019966017],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990482,0.00026268896,0.00003414717,0.00023649799,0.0002723992,0.0001460245],"domain_scores_gemma":[0.9989525,0.00032671774,0.00006694238,0.00032971072,0.0002132818,0.0001108641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014739254,0.0020699352,0.00096952147,0.0004578208,0.00040568245,0.001311553,0.003291751,0.0016631759,0.010931496],"category_scores_gemma":[0.0033645923,0.0006291164,0.0007334746,0.0002740162,0.00070717954,0.001980988,0.0015827632,0.0033952454,0.0060088057],"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.0010386619,0.0008441155,0.0031449597,0.00045064074,0.00019821529,0.00022321274,0.00030948213,0.2969946,0.04064983,0.007178581,0.07630973,0.5726579],"study_design_scores_gemma":[0.0001262347,0.00044437437,0.00039606917,0.000033720535,0.000032617176,0.000074535965,0.000018450757,0.950481,0.027391212,0.002805244,0.01815951,0.00003700546],"about_ca_topic_score_codex":0.0030207396,"about_ca_topic_score_gemma":0.0039020719,"teacher_disagreement_score":0.010931496,"about_ca_system_score_codex":0.0007742761,"about_ca_system_score_gemma":0.0012040163,"threshold_uncertainty_score":0.036569476},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033130497,0.0004176489,0.9443693,0.00048449528,0.00038786302,0.00013678413,0.00043053413,0.008148152,0.012494672],"genre_scores_gemma":[0.44614294,0.00033791992,0.53950506,0.00037471717,0.00014346805,0.0002465053,0.0010280835,0.001249734,0.010971648],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999548,0.00009096881,0.00002475206,0.00006802569,0.00018179724,0.000086319225],"domain_scores_gemma":[0.99912566,0.00019406881,0.00006313412,0.00027599555,0.00024770462,0.00009342905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005818218,0.0009336767,0.0006319703,0.0004271998,0.00049640535,0.00089048926,0.0015541945,0.0004816187,0.0074618794],"category_scores_gemma":[0.002419568,0.000355828,0.00052497874,0.00063860416,0.0005744515,0.0016548077,0.0015321143,0.0012137538,0.0015585865],"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.0014516799,0.0004762045,0.0022858295,0.0004802311,0.0001917541,0.00034157906,0.00026383068,0.2506431,0.059000358,0.053878926,0.07555921,0.5554273],"study_design_scores_gemma":[0.000075389114,0.00014155977,0.0001895613,0.0000200767,0.000019736244,0.00007758093,0.00005025102,0.96395296,0.011813977,0.017406125,0.0062289666,0.000023780087],"about_ca_topic_score_codex":0.002534617,"about_ca_topic_score_gemma":0.007741616,"teacher_disagreement_score":0.0074618794,"about_ca_system_score_codex":0.0004233261,"about_ca_system_score_gemma":0.0014064327,"threshold_uncertainty_score":0.024962485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059884734,0.00027449106,0.9180606,0.0012742166,0.00010115571,0.00025293068,0.00015194803,0.0007333708,0.019266617],"genre_scores_gemma":[0.5304776,0.0007800954,0.44684055,0.00043472255,0.00014622041,0.0012421795,0.0003331176,0.0005857557,0.01915971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988392,0.00041021465,0.00006154508,0.00018019904,0.00037952367,0.00012934445],"domain_scores_gemma":[0.9987381,0.000617691,0.000102961414,0.00023452053,0.0002141619,0.000092542825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012054243,0.0008021127,0.0005794521,0.00072273856,0.0012187794,0.0029243103,0.0025220395,0.0017994856,0.003315765],"category_scores_gemma":[0.0030882119,0.00047530944,0.0012015187,0.000925611,0.0042532035,0.0041423785,0.0015931755,0.0022216188,0.00062019116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006628009,0.000060099042,0.00043785974,0.0000862971,0.000016301183,0.00022590131,0.00045440806,0.21643831,0.0030857928,0.7749158,0.00062261027,0.0035902918],"study_design_scores_gemma":[0.00007574365,0.00007449543,0.00010429134,0.000025486666,0.000023400196,0.000060475126,0.00008394242,0.74000496,0.0019021078,0.24954428,0.008082563,0.000018279758],"about_ca_topic_score_codex":0.0068032322,"about_ca_topic_score_gemma":0.003822624,"teacher_disagreement_score":0.0068032322,"about_ca_system_score_codex":0.0020471925,"about_ca_system_score_gemma":0.002586541,"threshold_uncertainty_score":0.014853537},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08005244,0.0010847137,0.8963,0.00043201487,0.0003757418,0.00005171421,0.00006533705,0.00061016314,0.021027915],"genre_scores_gemma":[0.6978606,0.0011095252,0.27187333,0.00020696787,0.00032764225,0.000100959325,0.00010986406,0.00074496143,0.027666248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993413,0.00021128448,0.000032956217,0.00009237107,0.00025597555,0.00006605065],"domain_scores_gemma":[0.9984842,0.00069913163,0.00010430983,0.0003689344,0.00024126253,0.00010223457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011737887,0.000606959,0.0009321327,0.0010803085,0.0005953035,0.0015259578,0.0013551229,0.0009326347,0.003219669],"category_scores_gemma":[0.0057290457,0.00040684626,0.0009189896,0.00057902257,0.0017705576,0.0024903787,0.0018804003,0.0017562205,0.0009655889],"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.00003220315,0.000037841484,0.00021045825,0.00011870497,0.000018587412,0.00015302989,0.00016407255,0.009865514,0.0084344745,0.9620544,0.00081109104,0.018099675],"study_design_scores_gemma":[0.000038621136,0.00007657041,0.0005347462,0.000055524975,0.00002722859,0.00032385503,0.000053460724,0.27198794,0.012018144,0.70034236,0.014485164,0.000056512916],"about_ca_topic_score_codex":0.0006632275,"about_ca_topic_score_gemma":0.0008326926,"teacher_disagreement_score":0.003219669,"about_ca_system_score_codex":0.00074115413,"about_ca_system_score_gemma":0.0005797203,"threshold_uncertainty_score":0.010770857},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012323483,0.0129702445,0.96088636,0.011186127,0.0015801949,0.00006565561,0.000060361923,0.00024563682,0.011773131],"genre_scores_gemma":[0.04510866,0.028886504,0.8964256,0.0045050005,0.00441508,0.0011584355,0.00024560312,0.0005794186,0.018675739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988757,0.0005826695,0.000066627974,0.000121620586,0.00029544407,0.000057865742],"domain_scores_gemma":[0.99804556,0.0011499998,0.00009576713,0.00024426068,0.00034489436,0.0001194734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005024331,0.0013493964,0.0011772969,0.0011749436,0.0011286067,0.0031845944,0.0024603654,0.0031800775,0.009839668],"category_scores_gemma":[0.005872756,0.0006261518,0.001683268,0.0011618381,0.0035412128,0.008351662,0.0024225807,0.005729546,0.0027212661],"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.000015690532,0.00004215736,0.0000884525,0.00024072036,0.000020245114,0.000031526983,0.00008628378,0.012992319,0.00039286382,0.94592834,0.009911049,0.03025021],"study_design_scores_gemma":[0.000012882973,0.000025421008,0.00005333706,0.00011950529,0.000005198286,0.00003520009,0.000037374655,0.042158037,0.00022807668,0.9239809,0.033328045,0.000015921143],"about_ca_topic_score_codex":0.0006004969,"about_ca_topic_score_gemma":0.00078108127,"teacher_disagreement_score":0.009839668,"about_ca_system_score_codex":0.0013419886,"about_ca_system_score_gemma":0.0012021759,"threshold_uncertainty_score":0.032916903},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006603951,0.00010936475,0.9802545,0.0005275591,0.00013247796,0.000107699096,0.00048375796,0.0052249376,0.006555709],"genre_scores_gemma":[0.1665221,0.0004353332,0.8022364,0.0010782628,0.000338667,0.00052222173,0.0016486922,0.0064114183,0.020806832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983608,0.00032543522,0.00018878173,0.00032445378,0.0005860175,0.00021447049],"domain_scores_gemma":[0.99698204,0.0014084665,0.0002497755,0.00051443884,0.00071420544,0.00013108202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016015193,0.0008349968,0.00051022024,0.0007451074,0.00080136623,0.0026252475,0.0017698389,0.00085901807,0.0081846],"category_scores_gemma":[0.0059171664,0.00087630353,0.00095649075,0.0010738387,0.0015329791,0.0042948667,0.0019409123,0.0033134068,0.0021611874],"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.00016458923,0.00011918536,0.0010079794,0.0006905983,0.000031116753,0.00041089766,0.0010675853,0.009405751,0.020793805,0.8349972,0.019113077,0.11219833],"study_design_scores_gemma":[0.0000729048,0.00012326603,0.0006245779,0.00019032588,0.00009242718,0.00075967103,0.000280692,0.12676604,0.024122167,0.6661168,0.18075153,0.000099738805],"about_ca_topic_score_codex":0.002206112,"about_ca_topic_score_gemma":0.002041137,"teacher_disagreement_score":0.0081846,"about_ca_system_score_codex":0.00082076073,"about_ca_system_score_gemma":0.001876364,"threshold_uncertainty_score":0.027380228},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014160157,0.0010344594,0.96753335,0.001464136,0.00019174667,0.000059024434,0.00005063401,0.0025990203,0.012907462],"genre_scores_gemma":[0.28673255,0.002914229,0.69317347,0.0012924125,0.00041617424,0.00018871899,0.00037048035,0.004293848,0.010618096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984811,0.0004589216,0.000083163264,0.00028111858,0.0005633471,0.00013230788],"domain_scores_gemma":[0.9968905,0.0013936572,0.00020849546,0.00095845363,0.0003783897,0.00017065121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020816876,0.0005399464,0.0002566964,0.0007143775,0.00061402057,0.002098226,0.0013171597,0.00057264674,0.0038995263],"category_scores_gemma":[0.0056048515,0.0005931694,0.0005502019,0.0007815872,0.0015833789,0.004758823,0.0029163726,0.0029847254,0.0010746921],"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.0001365125,0.0002068544,0.0017983763,0.00043402766,0.000043740554,0.00028002588,0.0021545165,0.022932343,0.013137054,0.47799274,0.0126238065,0.46826002],"study_design_scores_gemma":[0.00004214801,0.00016607517,0.0010426329,0.00024296212,0.000072330484,0.00057593297,0.0006803772,0.17390648,0.017656919,0.6600266,0.14553684,0.00005077988],"about_ca_topic_score_codex":0.0011031906,"about_ca_topic_score_gemma":0.0018287157,"teacher_disagreement_score":0.0038995263,"about_ca_system_score_codex":0.0007864906,"about_ca_system_score_gemma":0.0013898934,"threshold_uncertainty_score":0.013045192},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45671657,0.002888095,0.49829602,0.0008550384,0.00025840593,0.00026321542,0.000327917,0.03261613,0.0077786422],"genre_scores_gemma":[0.86680305,0.00029133027,0.12881625,0.0003797459,0.00008160436,0.000161937,0.000340133,0.000744912,0.0023809716],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99871945,0.00038111603,0.00008379005,0.00016158659,0.00041151405,0.00024260281],"domain_scores_gemma":[0.99716574,0.00092747976,0.0003822056,0.00093035394,0.0003837833,0.00021038324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014801563,0.0011168108,0.000634302,0.00072796363,0.0007300485,0.001087258,0.003023619,0.00061335583,0.00197241],"category_scores_gemma":[0.0045410693,0.00046169254,0.00035742405,0.0010644976,0.0009316417,0.003195252,0.0027211122,0.0013845171,0.0006819899],"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.0029357318,0.0010365898,0.012406806,0.0012245411,0.000175495,0.0009117791,0.0013641105,0.35045615,0.17398492,0.014683045,0.027542915,0.41327798],"study_design_scores_gemma":[0.00032558697,0.0012590053,0.0023922133,0.000045660396,0.00010755197,0.00031954577,0.00026067684,0.90956414,0.06690528,0.006317567,0.012452937,0.000049872226],"about_ca_topic_score_codex":0.0018161348,"about_ca_topic_score_gemma":0.0030025754,"teacher_disagreement_score":0.003023619,"about_ca_system_score_codex":0.00080116506,"about_ca_system_score_gemma":0.0017529433,"threshold_uncertainty_score":0.007827938},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42636427,0.0016480392,0.56016666,0.00030316008,0.00011622871,0.00014884648,0.00008744627,0.007843497,0.003321773],"genre_scores_gemma":[0.9367631,0.00020282959,0.062030938,0.00003913218,0.000017527767,0.00004374078,0.000094339724,0.00017718346,0.0006311495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994093,0.00018116717,0.00003659958,0.000106738175,0.00015897556,0.0001072863],"domain_scores_gemma":[0.9992842,0.00018547344,0.000069026544,0.00017419313,0.00020156831,0.00008567527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056724815,0.0009260389,0.0005133658,0.00064362824,0.0007147916,0.0010905769,0.0014624672,0.0003314126,0.0006781339],"category_scores_gemma":[0.0017160478,0.00035391634,0.0002578729,0.0008595134,0.0003179374,0.000999543,0.0007759232,0.00050022115,0.00028762143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010357226,0.00043330024,0.013479055,0.00026968098,0.00015714885,0.0004453366,0.0006282778,0.42397213,0.19346635,0.005168294,0.005943654,0.35500103],"study_design_scores_gemma":[0.000016169548,0.00008134325,0.0019429458,0.000005007373,0.00003414245,0.00007735041,0.000061167506,0.96857196,0.025723979,0.0013585346,0.0021071958,0.000020284484],"about_ca_topic_score_codex":0.004829836,"about_ca_topic_score_gemma":0.0053539155,"teacher_disagreement_score":0.004829836,"about_ca_system_score_codex":0.00068110914,"about_ca_system_score_gemma":0.0011040127,"threshold_uncertainty_score":0.009603441},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24666026,0.005746476,0.67157376,0.0013476323,0.001091145,0.00017311417,0.00021494372,0.004770102,0.06842249],"genre_scores_gemma":[0.90612745,0.0011517721,0.041650772,0.00027767583,0.00016491994,0.0001532305,0.00011798803,0.0008982131,0.04945806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989324,0.0002192126,0.00005983847,0.00013211722,0.00035680088,0.00029969268],"domain_scores_gemma":[0.9970187,0.0013049296,0.00019555498,0.0012225709,0.0001800309,0.00007819541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012241727,0.00052270986,0.00090772094,0.00077268033,0.0011216888,0.0019377901,0.0020919552,0.0012890232,0.009145121],"category_scores_gemma":[0.007030425,0.0006047451,0.00057068083,0.0008629403,0.002354159,0.005138144,0.0031017796,0.002325499,0.0010998442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089992373,0.000110434754,0.0005087601,0.00033350507,0.000040021696,0.0004931961,0.00060174696,0.03508841,0.012630799,0.81521344,0.0064931274,0.12758674],"study_design_scores_gemma":[0.00009729819,0.00016027645,0.0003078149,0.00013052061,0.000060253347,0.00048084315,0.0002136947,0.1214308,0.03685691,0.8213719,0.018826794,0.000062801984],"about_ca_topic_score_codex":0.000409619,"about_ca_topic_score_gemma":0.00047512137,"teacher_disagreement_score":0.009145121,"about_ca_system_score_codex":0.0007651793,"about_ca_system_score_gemma":0.00068462075,"threshold_uncertainty_score":0.030593455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009633797,0.00016577248,0.9787306,0.0002090953,0.00013891168,0.000050579452,0.00011039058,0.0033879175,0.007572927],"genre_scores_gemma":[0.15030284,0.00023489841,0.8374205,0.00023347398,0.00005982057,0.00019284202,0.0005319682,0.0015498728,0.00947374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964,0.0000653278,0.000017369412,0.000060293147,0.00016063689,0.000056372508],"domain_scores_gemma":[0.9993656,0.00014407904,0.00004587426,0.00014242505,0.0002533706,0.000048589845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004319188,0.0009587896,0.0005934262,0.00049040304,0.0004505938,0.0009411478,0.001281947,0.00059586804,0.01259728],"category_scores_gemma":[0.0023171206,0.00033493573,0.0005443793,0.0007083525,0.0005388372,0.0012595418,0.0009934405,0.0011743216,0.0055853436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003306546,0.00015735095,0.001580457,0.00055888534,0.00010290219,0.00031219705,0.00037477043,0.4782468,0.029292163,0.10506093,0.035566676,0.34841615],"study_design_scores_gemma":[0.000029204997,0.00004797777,0.00017075079,0.000022717453,0.0000088103225,0.00008277357,0.00006678495,0.95411664,0.0065019964,0.021672955,0.017264046,0.000015314698],"about_ca_topic_score_codex":0.0038604361,"about_ca_topic_score_gemma":0.006884169,"teacher_disagreement_score":0.01259728,"about_ca_system_score_codex":0.00063209713,"about_ca_system_score_gemma":0.000984082,"threshold_uncertainty_score":0.042142153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13372332,0.0008819961,0.84867966,0.0008493317,0.00009383711,0.000092995484,0.000145881,0.0057104016,0.009822521],"genre_scores_gemma":[0.81058955,0.00026409375,0.1855393,0.00027776076,0.00004024524,0.00012423261,0.00017397212,0.00036971032,0.0026211538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996307,0.00008142338,0.000015446234,0.00008144194,0.00013518719,0.000055825752],"domain_scores_gemma":[0.9995721,0.00015982438,0.000054478936,0.00010184083,0.00008992257,0.00002178377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026514154,0.00067638763,0.0005657624,0.00057775545,0.0005321522,0.0011282869,0.0012898773,0.00044211204,0.0020927289],"category_scores_gemma":[0.001603222,0.00029073656,0.000363531,0.0010441109,0.0004752711,0.0014610654,0.00068204256,0.0009928416,0.00050895853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021888046,0.00017044265,0.003241395,0.00014880669,0.000079467405,0.00014750878,0.00012197052,0.7474385,0.026237939,0.013292311,0.006795938,0.20210686],"study_design_scores_gemma":[0.0000063279244,0.000027775955,0.000263539,0.0000045423158,0.000005769999,0.000015745794,0.000009856409,0.99141675,0.0046869093,0.0024259312,0.0011320196,0.000004825541],"about_ca_topic_score_codex":0.004185977,"about_ca_topic_score_gemma":0.006590593,"teacher_disagreement_score":0.004185977,"about_ca_system_score_codex":0.0010365394,"about_ca_system_score_gemma":0.000819968,"threshold_uncertainty_score":0.008323193},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034679364,0.0003836441,0.9591274,0.0003741419,0.0000613268,0.000104663886,0.00011791303,0.0019792372,0.0031722698],"genre_scores_gemma":[0.1913108,0.00017199617,0.8055767,0.0002691765,0.00002799643,0.0002474318,0.00024341226,0.00043559854,0.0017168063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989526,0.0004071078,0.000056862384,0.000157121,0.00026676178,0.00015959011],"domain_scores_gemma":[0.997981,0.0011490496,0.00012550128,0.00030322967,0.0003343603,0.00010689896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019273822,0.0007676804,0.0008969294,0.0010011365,0.000656314,0.00077308464,0.0015878046,0.0011391996,0.004208314],"category_scores_gemma":[0.0067615034,0.00052221585,0.000693816,0.0013855769,0.0010972463,0.0012982659,0.0013088569,0.0013163008,0.0007217172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052914774,0.00019414976,0.0027391312,0.0002141311,0.00008576929,0.000102945625,0.00026054584,0.69251734,0.010959419,0.03994859,0.009297981,0.24315085],"study_design_scores_gemma":[0.00004155994,0.000056536555,0.00013484569,0.000013321794,0.000010567734,0.00002528915,0.000019790064,0.98583,0.0020805742,0.010207549,0.0015698895,0.000010033747],"about_ca_topic_score_codex":0.0062407386,"about_ca_topic_score_gemma":0.007903227,"teacher_disagreement_score":0.0062407386,"about_ca_system_score_codex":0.001003851,"about_ca_system_score_gemma":0.0025066338,"threshold_uncertainty_score":0.0140782595},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.511504,0.0004974493,0.47401094,0.0010167693,0.00005834364,0.0008122604,0.00053018105,0.00036344377,0.011206663],"genre_scores_gemma":[0.808729,0.00026436144,0.188495,0.0001644168,0.00003126944,0.00038624188,0.00020134877,0.00008622966,0.0016422451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9958597,0.0022188525,0.000193725,0.00051157136,0.0008674149,0.00034869072],"domain_scores_gemma":[0.98790216,0.0076306034,0.00090858596,0.0018894634,0.0014063827,0.00026284828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042114705,0.0005753954,0.00039275739,0.0010036874,0.001121732,0.0015882992,0.0013825755,0.0014368136,0.0009837192],"category_scores_gemma":[0.0097732665,0.00030562968,0.00064889004,0.0015412074,0.0013949662,0.0011354197,0.0013159304,0.0011289513,0.0001951007],"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.0006413182,0.002057903,0.112248026,0.0011640382,0.00030953943,0.0069839265,0.0075840754,0.4808388,0.039867397,0.08440252,0.00787393,0.25602862],"study_design_scores_gemma":[0.00015002859,0.0013558123,0.027185082,0.00028082915,0.00021148525,0.0033602824,0.007849828,0.8289516,0.048436426,0.04939804,0.032641273,0.00017936986],"about_ca_topic_score_codex":0.003961331,"about_ca_topic_score_gemma":0.004687824,"teacher_disagreement_score":0.0042114705,"about_ca_system_score_codex":0.0010329521,"about_ca_system_score_gemma":0.0009095187,"threshold_uncertainty_score":0.022272646},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020596089,0.0017472281,0.8643698,0.0050512543,0.001245805,0.00014690807,0.0018655122,0.083254755,0.021722585],"genre_scores_gemma":[0.10388282,0.002114329,0.80455,0.0030022918,0.00056322024,0.00025062572,0.008156462,0.056001656,0.021478666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770856,0.0005084996,0.00018362289,0.00039591442,0.0009266488,0.00027679466],"domain_scores_gemma":[0.9943909,0.0012183088,0.00024050732,0.0028805155,0.0009554034,0.00031430295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027397822,0.0016882054,0.0013396001,0.0011019113,0.00084866805,0.0059429957,0.0033826258,0.0022024068,0.01633773],"category_scores_gemma":[0.010729447,0.0010425284,0.00097173254,0.0025985828,0.0012812024,0.0135716135,0.004064922,0.0026099328,0.011150096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001590399,0.00038372356,0.002848592,0.00092962873,0.00021387658,0.00041179897,0.0017721484,0.006514649,0.055232473,0.106660366,0.2829775,0.54046476],"study_design_scores_gemma":[0.00044260322,0.00019258169,0.0015036222,0.00035837223,0.00010890488,0.0005379553,0.0006580414,0.08868986,0.09552855,0.15943849,0.6522531,0.00028792833],"about_ca_topic_score_codex":0.0019319281,"about_ca_topic_score_gemma":0.0027025256,"teacher_disagreement_score":0.01633773,"about_ca_system_score_codex":0.0008119209,"about_ca_system_score_gemma":0.0013318857,"threshold_uncertainty_score":0.054655135},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048815366,0.00016345666,0.9810034,0.00014454247,0.00015461867,0.00014784888,0.00020677997,0.007485154,0.005812706],"genre_scores_gemma":[0.10047453,0.00025063538,0.87492424,0.00032824348,0.00008048273,0.0003513618,0.00073682563,0.0022497505,0.020603891],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990551,0.00008892475,0.0000703277,0.00028375245,0.00038325856,0.00011858357],"domain_scores_gemma":[0.9992742,0.0001411346,0.00007172148,0.00030698426,0.0001750679,0.000030846964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064150017,0.0008507165,0.00086262135,0.0018654658,0.0012554736,0.0016451284,0.001868255,0.00092021236,0.014812772],"category_scores_gemma":[0.002554471,0.0011554005,0.0011166268,0.0016471761,0.0012633548,0.0024612583,0.0021811996,0.0018023667,0.0043273233],"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.0007112806,0.00015063863,0.0023792593,0.0005218675,0.000099160294,0.00046497176,0.00049778755,0.018546116,0.09547124,0.15966709,0.02697319,0.6945174],"study_design_scores_gemma":[0.00026400443,0.0003603112,0.001786932,0.0001382139,0.000117547315,0.0010098473,0.00017106997,0.42568603,0.20101918,0.13246538,0.23676138,0.00022015754],"about_ca_topic_score_codex":0.0049745883,"about_ca_topic_score_gemma":0.0067449897,"teacher_disagreement_score":0.014812772,"about_ca_system_score_codex":0.000794241,"about_ca_system_score_gemma":0.001550847,"threshold_uncertainty_score":0.049553633},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47130597,0.0014949667,0.47236216,0.00046780932,0.00012115659,0.00016027917,0.0006639131,0.048720766,0.004703063],"genre_scores_gemma":[0.89409125,0.00020036423,0.10180209,0.00017898754,0.000049600294,0.00007597147,0.0007104314,0.0018893037,0.001002103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649316,0.00074464065,0.00024029169,0.000711565,0.001363978,0.00044629912],"domain_scores_gemma":[0.9846554,0.007073633,0.0020322863,0.0036074184,0.002444987,0.00018618732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026011767,0.0017535791,0.0007644038,0.0028847875,0.00044248815,0.0013175518,0.0013115279,0.00043603586,0.001203236],"category_scores_gemma":[0.011151541,0.0008979034,0.0011781299,0.0016083998,0.0011600688,0.0028888364,0.0009214841,0.0012231936,0.00036109693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012533416,0.00034830254,0.06352047,0.00038528471,0.00033157933,0.00024522963,0.0003209122,0.557631,0.056627017,0.012848796,0.0057498617,0.30073825],"study_design_scores_gemma":[0.00003119372,0.00016926453,0.003640624,0.000022390006,0.0000801158,0.000042847496,0.000023198763,0.95979583,0.03141062,0.003487253,0.0012577726,0.000038910315],"about_ca_topic_score_codex":0.007315552,"about_ca_topic_score_gemma":0.007875339,"teacher_disagreement_score":0.007315552,"about_ca_system_score_codex":0.0014130797,"about_ca_system_score_gemma":0.0036052624,"threshold_uncertainty_score":0.0145459175},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05524083,0.0008811192,0.8916439,0.00016347729,0.00010558542,0.00016568422,0.0005065005,0.039031494,0.012261383],"genre_scores_gemma":[0.42136687,0.00038284936,0.5687744,0.00016489624,0.000042868527,0.00025367076,0.0010797608,0.0017882128,0.0061464924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978954,0.000026052225,0.000012126808,0.00002738532,0.00010467485,0.000040285264],"domain_scores_gemma":[0.99985015,0.000042409047,0.000020136718,0.00003130622,0.00003827569,0.000017670058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022010147,0.000857519,0.00037111453,0.0005685052,0.00024926983,0.00049179496,0.00093741465,0.00028834707,0.005762049],"category_scores_gemma":[0.00046823206,0.00028931943,0.0005630047,0.00031474626,0.00026761112,0.00051786273,0.0005146048,0.0005987812,0.0013264511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074548315,0.0001715056,0.004169797,0.00067615544,0.00015864035,0.00052013836,0.000261819,0.25054651,0.19843385,0.027829535,0.02670254,0.489784],"study_design_scores_gemma":[0.00013959761,0.00023942118,0.0010763273,0.000039599076,0.00003145969,0.00016873716,0.000036351743,0.9021787,0.05765601,0.004605619,0.033785004,0.00004321152],"about_ca_topic_score_codex":0.002364508,"about_ca_topic_score_gemma":0.004369317,"teacher_disagreement_score":0.005762049,"about_ca_system_score_codex":0.00050748297,"about_ca_system_score_gemma":0.00088976504,"threshold_uncertainty_score":0.019275963},"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":"other","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030740535,0.0033237578,0.26912746,0.002275591,0.004102511,0.00076261,0.013885347,0.06494097,0.61084116],"genre_scores_gemma":[0.223275,0.0025073346,0.22077169,0.0028116992,0.0005833868,0.0011804708,0.047043853,0.014050695,0.48777583],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996146,0.000038245296,0.00002362786,0.00009165701,0.00014429605,0.00008758477],"domain_scores_gemma":[0.9996511,0.000027570608,0.000014411957,0.00011394758,0.00013341988,0.000059524864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002570116,0.00086207985,0.0006661942,0.00059165194,0.0008171016,0.0018221325,0.0012987297,0.00068333664,0.1292515],"category_scores_gemma":[0.0010738437,0.00038768025,0.00048841175,0.00081588124,0.0002747809,0.0013595206,0.0025647336,0.0010644839,0.063796684],"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.0007346545,0.00010024523,0.0015586438,0.0005139107,0.000057501802,0.00042629894,0.00026865484,0.0055654133,0.027509619,0.050496858,0.52931845,0.3834498],"study_design_scores_gemma":[0.00010029548,0.000076258795,0.0007808365,0.000051710573,0.000019160903,0.00027244477,0.00006280337,0.016003788,0.0134599665,0.010105976,0.95903915,0.000027590886],"about_ca_topic_score_codex":0.0029021297,"about_ca_topic_score_gemma":0.0038430495,"teacher_disagreement_score":0.1292515,"about_ca_system_score_codex":0.0004998389,"about_ca_system_score_gemma":0.00090096204,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66709584,0.0020431564,0.18539958,0.0017840366,0.0013073344,0.00067353656,0.011513494,0.04954582,0.08063726],"genre_scores_gemma":[0.8917853,0.00063921744,0.077631004,0.00041753048,0.000107748776,0.0008314995,0.015301096,0.0037769598,0.009509594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99759895,0.00049996615,0.00013371593,0.00027148548,0.0011488518,0.00034714612],"domain_scores_gemma":[0.99622923,0.0009864428,0.00016104234,0.0008188495,0.0015663655,0.00023811888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012770972,0.00144205,0.0007854533,0.0010678057,0.00094386697,0.0010174216,0.0026819613,0.000792859,0.005552597],"category_scores_gemma":[0.005184044,0.00041183023,0.00064301083,0.0025339746,0.00083037495,0.001327865,0.0011537068,0.0016279985,0.0015701992],"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.0015317199,0.00113042,0.015525539,0.0013138732,0.00048135992,0.00045699632,0.00047796985,0.6821745,0.04495654,0.024997812,0.11177117,0.11518206],"study_design_scores_gemma":[0.00013800692,0.00045530972,0.005471071,0.0000384211,0.000049292616,0.000106875115,0.00019600266,0.9332622,0.036170058,0.004496614,0.01954873,0.0000673623],"about_ca_topic_score_codex":0.0076084007,"about_ca_topic_score_gemma":0.006359061,"teacher_disagreement_score":0.0076084007,"about_ca_system_score_codex":0.00092762086,"about_ca_system_score_gemma":0.0014681051,"threshold_uncertainty_score":0.018575251},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022166831,0.00063523464,0.9661628,0.00027573854,0.000093257615,0.00008767896,0.00031230733,0.0046287943,0.0056372858],"genre_scores_gemma":[0.18168801,0.00037042642,0.8128635,0.0001477793,0.00003293951,0.00015635006,0.0006697488,0.00038614764,0.0036850048],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994418,0.0001182379,0.000056671244,0.000057184832,0.00025105217,0.00007497231],"domain_scores_gemma":[0.9993017,0.0002202983,0.000049350638,0.00013011503,0.0002506751,0.000048000995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005100753,0.0004295793,0.00043922494,0.00068245764,0.0005962498,0.0010136444,0.0014873884,0.0005913002,0.0048881834],"category_scores_gemma":[0.0020116656,0.00032310208,0.00031633888,0.0016614121,0.00030193562,0.0016799466,0.00085500855,0.0006629454,0.001985491],"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.00096743915,0.00035222576,0.0016585971,0.00064669654,0.00012586669,0.0005368533,0.00038246723,0.18218313,0.07933618,0.08221384,0.050089926,0.60150677],"study_design_scores_gemma":[0.00017281855,0.00023978589,0.00041927662,0.000052812946,0.000034864377,0.00023839273,0.00008731098,0.91854715,0.021392867,0.03140712,0.02736254,0.000044968278],"about_ca_topic_score_codex":0.002570226,"about_ca_topic_score_gemma":0.0041681696,"teacher_disagreement_score":0.0048881834,"about_ca_system_score_codex":0.00049639493,"about_ca_system_score_gemma":0.0011108028,"threshold_uncertainty_score":0.016352594},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021463102,0.00032774982,0.9829113,0.00028685876,0.000112354355,0.000047200814,0.00018089642,0.010321973,0.0036652898],"genre_scores_gemma":[0.14976045,0.00042527987,0.8302587,0.00078375026,0.00018866966,0.00033512176,0.0010013154,0.004863458,0.012383234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990398,0.0003274438,0.00004980649,0.00018556925,0.0003007881,0.00009654219],"domain_scores_gemma":[0.9992774,0.00035859708,0.000044884695,0.0001474559,0.000111046844,0.00006056566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015579426,0.0010708888,0.0011656799,0.00063559425,0.00043485244,0.002041112,0.002297962,0.0015513994,0.016686684],"category_scores_gemma":[0.004714942,0.00071129407,0.00083209056,0.0008283309,0.0011643365,0.002077134,0.0028011308,0.003742609,0.007861142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049381953,0.00021911113,0.00067082606,0.00045942274,0.00010330128,0.0002915229,0.00019499264,0.34648466,0.005678878,0.13056704,0.05291356,0.46192282],"study_design_scores_gemma":[0.000051603445,0.000052725263,0.000059407037,0.000029096782,0.000009094279,0.000050811694,0.000016126352,0.949504,0.0017457587,0.039281324,0.009183715,0.000016257502],"about_ca_topic_score_codex":0.003221259,"about_ca_topic_score_gemma":0.0062833754,"teacher_disagreement_score":0.016686684,"about_ca_system_score_codex":0.0007785043,"about_ca_system_score_gemma":0.0019566007,"threshold_uncertainty_score":0.05582249},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009971817,0.023786714,0.6132619,0.016432535,0.033642724,0.0011252852,0.0058195004,0.016158221,0.27980137],"genre_scores_gemma":[0.03569029,0.016121715,0.45430037,0.0027378357,0.0036312481,0.0010894982,0.019630456,0.010640281,0.45615834],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975858,0.000936607,0.00019179807,0.00030723403,0.00076215103,0.00021638272],"domain_scores_gemma":[0.9958696,0.0014598203,0.00012908221,0.001081523,0.0010244636,0.0004355457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037213727,0.0016840117,0.0013723419,0.0016420808,0.0015485885,0.0044754934,0.001473409,0.0012922825,0.11184794],"category_scores_gemma":[0.0067253495,0.0013502731,0.0013809155,0.0018097019,0.0014738146,0.0028355333,0.0028168461,0.0040663276,0.04039129],"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.00026061674,0.00021375086,0.00088719436,0.00027369946,0.000055756464,0.00015790729,0.00020639684,0.004838458,0.002657913,0.020707114,0.70197964,0.2677616],"study_design_scores_gemma":[0.000059573893,0.00006788172,0.00045596762,0.00017302643,0.000028730627,0.0001448529,0.00006441191,0.009808737,0.001681679,0.013459194,0.9740326,0.00002331535],"about_ca_topic_score_codex":0.008034681,"about_ca_topic_score_gemma":0.016316477,"teacher_disagreement_score":0.11184794,"about_ca_system_score_codex":0.0013227125,"about_ca_system_score_gemma":0.0053685233,"threshold_uncertainty_score":0.37416863},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003205875,0.0015817545,0.00029866188,0.030489612,0.9663676,0.000010776551,0.00003131608,0.000055141565,0.0011331241],"genre_scores_gemma":[0.00057699654,0.0017416028,0.00026886968,0.020224735,0.9692751,0.00002030963,0.000024498928,0.000081101265,0.0077867387],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99413645,0.0007905216,0.00076622353,0.0007332108,0.003166385,0.00040725432],"domain_scores_gemma":[0.9729546,0.008823379,0.0015509049,0.0008124134,0.012310227,0.0035484757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065282644,0.0031723857,0.0038404434,0.0031726256,0.0033969386,0.010127553,0.0036943231,0.016574016,0.013962393],"category_scores_gemma":[0.031069515,0.0012281436,0.0033360873,0.0019532766,0.002368517,0.0033206411,0.0015758909,0.02749529,0.01155846],"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.0000316896,0.000010837573,0.000032090036,0.0001289567,0.000021962574,0.00014610172,0.000007066362,0.00006014444,0.000050138726,0.00032352936,0.9955467,0.003640674],"study_design_scores_gemma":[0.00007241302,0.000032653024,0.00037290514,0.0003710017,0.000082943516,0.00044312348,0.000036192752,0.0007258027,0.0002368865,0.0018605993,0.9957344,0.000031143947],"about_ca_topic_score_codex":0.0014210321,"about_ca_topic_score_gemma":0.004192689,"teacher_disagreement_score":0.016574016,"about_ca_system_score_codex":0.002503056,"about_ca_system_score_gemma":0.0031525192,"threshold_uncertainty_score":0.046708822},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04142791,0.00015593057,0.92069715,0.00015503466,0.00006992667,0.00031974498,0.00019360326,0.032714527,0.004266248],"genre_scores_gemma":[0.42888692,0.0002197935,0.55453444,0.0004592954,0.000054263215,0.0008162686,0.0010991791,0.0032387727,0.010691076],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916196,0.00010997365,0.00007568468,0.00011345246,0.0003504651,0.00018858149],"domain_scores_gemma":[0.998591,0.00033921775,0.00017193031,0.0003420769,0.00037995694,0.00017574654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009950944,0.0009167044,0.00078244606,0.0010521696,0.00072611996,0.0019145967,0.004989442,0.0008743178,0.007561845],"category_scores_gemma":[0.002226982,0.0010960794,0.00092222187,0.00084401644,0.00081063097,0.0017657594,0.0022281385,0.0013407909,0.0034635537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035006532,0.0014408851,0.013737629,0.0015716221,0.00058860675,0.0021350072,0.0021013387,0.16021779,0.3804772,0.07959533,0.036506694,0.31812727],"study_design_scores_gemma":[0.00034198095,0.0009044641,0.0022479254,0.00011540113,0.00024333688,0.0003347625,0.00018370939,0.7436249,0.18666217,0.006451907,0.058739595,0.00014982632],"about_ca_topic_score_codex":0.003027337,"about_ca_topic_score_gemma":0.0018280187,"teacher_disagreement_score":0.007561845,"about_ca_system_score_codex":0.0010921338,"about_ca_system_score_gemma":0.0017400582,"threshold_uncertainty_score":0.025296867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0405042,0.00015089767,0.9459486,0.00020801391,0.00006732369,0.00013977264,0.00016227261,0.0051863217,0.007632594],"genre_scores_gemma":[0.35346273,0.0002295842,0.635655,0.00032625362,0.00006567478,0.00025875153,0.0006697981,0.0027741306,0.006558055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994318,0.00008230419,0.000026017831,0.000099722085,0.00025396558,0.00010622956],"domain_scores_gemma":[0.9994337,0.0001680021,0.000071273054,0.00018332413,0.00012248737,0.00002122902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039994123,0.0007690349,0.0004308825,0.00062153704,0.0004515473,0.0008316395,0.00076036295,0.00044422282,0.0033230816],"category_scores_gemma":[0.00197971,0.0003218266,0.0010004868,0.0006023343,0.0012167617,0.0009213537,0.0011433178,0.0009861698,0.0009707877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042486453,0.00025566015,0.004846387,0.00032113947,0.00008272318,0.00063553004,0.0006210342,0.35069737,0.058364015,0.12740715,0.014159207,0.44218487],"study_design_scores_gemma":[0.000052492367,0.00022856813,0.0010838845,0.000050120198,0.00005262429,0.00027769996,0.00012732438,0.8672723,0.037838325,0.0704558,0.022524718,0.000036143563],"about_ca_topic_score_codex":0.0023135429,"about_ca_topic_score_gemma":0.002767821,"teacher_disagreement_score":0.0033230816,"about_ca_system_score_codex":0.0004894683,"about_ca_system_score_gemma":0.0012367293,"threshold_uncertainty_score":0.011116803},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45725122,0.0017759098,0.4811354,0.0007032982,0.00034533552,0.00046218577,0.0007198734,0.050903093,0.006703732],"genre_scores_gemma":[0.8387369,0.00039359473,0.15606113,0.000309441,0.000058004083,0.00020242269,0.0009115339,0.001239744,0.0020872105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998958,0.00019156946,0.00011740979,0.00017251325,0.00039801467,0.00016256148],"domain_scores_gemma":[0.99745077,0.0005383252,0.00024404784,0.0011181559,0.00042914198,0.00021962766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011897365,0.0009248529,0.0005187023,0.00050915044,0.00056282524,0.0014471222,0.0027985068,0.00050401204,0.0016755013],"category_scores_gemma":[0.0036883187,0.0008650561,0.0004487791,0.0004671982,0.0007392404,0.0026985658,0.0022161365,0.0014259408,0.0004959478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021842066,0.0009118228,0.03262645,0.0011166666,0.00054304174,0.0005404146,0.0015730734,0.42980126,0.22432952,0.023252478,0.036205005,0.24691601],"study_design_scores_gemma":[0.00015131898,0.00034947996,0.004624253,0.00003505312,0.000060319537,0.00013248491,0.00008193363,0.94214433,0.031043613,0.0033028685,0.018003091,0.00007132318],"about_ca_topic_score_codex":0.004267393,"about_ca_topic_score_gemma":0.0048275245,"teacher_disagreement_score":0.004267393,"about_ca_system_score_codex":0.0007217846,"about_ca_system_score_gemma":0.0019854465,"threshold_uncertainty_score":0.008485138},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04514859,0.00046167645,0.9063258,0.0023644136,0.0010859661,0.00032976113,0.0008751255,0.02798328,0.015425333],"genre_scores_gemma":[0.49288923,0.0009257625,0.45834637,0.0014468529,0.0003850895,0.0004086481,0.0023609735,0.021556115,0.021680977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9879655,0.002537794,0.0011666266,0.001546267,0.005523105,0.0012606136],"domain_scores_gemma":[0.9276633,0.028231109,0.004119045,0.023848806,0.015405704,0.000732055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006273465,0.0014652434,0.0012851029,0.0014283035,0.001598719,0.0041161347,0.00190304,0.0022881038,0.012770255],"category_scores_gemma":[0.062136225,0.0013488819,0.0020532168,0.0011198497,0.00380838,0.0078117624,0.0047071883,0.0027331195,0.0057768445],"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.0017991582,0.0005908677,0.016280662,0.003403885,0.00040584925,0.0056826146,0.0029731882,0.034475707,0.09681133,0.42371088,0.06698081,0.346885],"study_design_scores_gemma":[0.00029975834,0.0003556807,0.0030273742,0.0010230535,0.0006095189,0.0033869157,0.0005671822,0.14095122,0.33126184,0.35088465,0.1674156,0.0002171644],"about_ca_topic_score_codex":0.0017577376,"about_ca_topic_score_gemma":0.0015333147,"teacher_disagreement_score":0.012770255,"about_ca_system_score_codex":0.0016599044,"about_ca_system_score_gemma":0.0044383667,"threshold_uncertainty_score":0.042720795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021954985,0.0028523188,0.96063876,0.001407995,0.00034153886,0.00008433705,0.00011694589,0.00048658307,0.012116546],"genre_scores_gemma":[0.5339325,0.0055454783,0.4459412,0.0013466224,0.00056947,0.00073241827,0.0007050083,0.0017245357,0.009502775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957722,0.0018252061,0.00024321486,0.0005403298,0.0013193729,0.00029965138],"domain_scores_gemma":[0.9521532,0.038806513,0.001752324,0.0026969104,0.003909725,0.00068140525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010759015,0.0019736418,0.0012818011,0.0017248293,0.0011750595,0.002623026,0.0018528795,0.0016256161,0.0038041905],"category_scores_gemma":[0.07872908,0.000753416,0.0011003158,0.0014258159,0.0053257453,0.005051965,0.003826264,0.004885591,0.0013129746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039311193,0.000119825614,0.0021956728,0.0004498136,0.00008176737,0.00022260605,0.00032077671,0.5331885,0.004019466,0.4101286,0.0050894767,0.043790236],"study_design_scores_gemma":[0.000018793997,0.00006125115,0.0002402669,0.00013991848,0.000011280351,0.000040430947,0.000021506323,0.9002222,0.0016119748,0.09623872,0.0013727243,0.000020983382],"about_ca_topic_score_codex":0.0040228027,"about_ca_topic_score_gemma":0.0034574282,"teacher_disagreement_score":0.010759015,"about_ca_system_score_codex":0.00233205,"about_ca_system_score_gemma":0.0022469277,"threshold_uncertainty_score":0.056899786},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12321387,0.0013435847,0.8556043,0.00043033986,0.00034287543,0.00009307933,0.00067013025,0.0041161734,0.01418563],"genre_scores_gemma":[0.8122645,0.0006512206,0.17565668,0.00017887044,0.00007939917,0.0001016684,0.00090748724,0.00031569682,0.009844459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998889,0.000014889526,0.000006369316,0.000039667517,0.000029834015,0.000020447265],"domain_scores_gemma":[0.9998266,0.00004762103,0.00001395514,0.000032586096,0.000065136184,0.000014151265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023896557,0.0006536598,0.00036353583,0.00029611518,0.00024421533,0.00039248454,0.0008565982,0.00026423758,0.0044250176],"category_scores_gemma":[0.0006261151,0.00017969409,0.0003055924,0.00043516673,0.00014213176,0.0009432471,0.00037730165,0.00065748225,0.0008930516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055939466,0.00028176117,0.0017774133,0.00030434475,0.000097411066,0.00012597097,0.00006711285,0.63160807,0.06080352,0.014232525,0.011142756,0.2789997],"study_design_scores_gemma":[0.000008432045,0.00005139879,0.00014004322,0.0000043269347,0.00001610186,0.0000099926965,0.000005488171,0.9894527,0.006105673,0.0027892957,0.0014127189,0.000003755794],"about_ca_topic_score_codex":0.005467905,"about_ca_topic_score_gemma":0.011900049,"teacher_disagreement_score":0.005467905,"about_ca_system_score_codex":0.0005536165,"about_ca_system_score_gemma":0.00095802615,"threshold_uncertainty_score":0.014803171},"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":"empirical","genre_gemma":"dataset","domain_codex":null,"domain_gemma":"reproducibility","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":"reproducibility","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6631727,0.0012474258,0.2750184,0.0023843383,0.00048410846,0.0014447254,0.00901244,0.023483386,0.023752443],"genre_scores_gemma":[0.9175832,0.0002786514,0.06466294,0.00027951403,0.00014187537,0.0009589702,0.006314385,0.0028723574,0.00690806],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.98861456,0.004294693,0.00090032775,0.0023356457,0.0030191303,0.00083568296],"domain_scores_gemma":[0.844209,0.09098461,0.017472288,0.026183592,0.017737947,0.0034125424],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.015046558,0.001194107,0.00090801844,0.003938977,0.0011862862,0.0033304065,0.002299981,0.0015790272,0.006392435],"category_scores_gemma":[0.1238989,0.0011022452,0.0010877822,0.0031296068,0.0013851521,0.0067473347,0.0027119275,0.0022630265,0.0053550964],"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.0019178708,0.0006196988,0.59184355,0.0018207682,0.00045834342,0.0018611125,0.020359047,0.027096555,0.032203965,0.033156686,0.03374793,0.25491446],"study_design_scores_gemma":[0.000234437,0.0013794746,0.53568196,0.00050579995,0.00040751693,0.0024829928,0.010948262,0.29480475,0.014952248,0.038682334,0.09930991,0.0006104173],"about_ca_topic_score_codex":0.0101803,"about_ca_topic_score_gemma":0.005996577,"teacher_disagreement_score":0.98495346,"about_ca_system_score_codex":0.0016508703,"about_ca_system_score_gemma":0.0031069962,"threshold_uncertainty_score":0.079574704},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9341821,0.00033509708,0.058524076,0.00019000165,0.000069558024,0.00012070043,0.0014486635,0.002900097,0.0022296472],"genre_scores_gemma":[0.97751117,0.00011806516,0.020261338,0.00001752915,0.000021520176,0.00007730684,0.0012827725,0.000088183006,0.00062198646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991227,0.00007585318,0.000079363155,0.00017734959,0.00045845858,0.00008640074],"domain_scores_gemma":[0.9950147,0.001847282,0.0012495779,0.00050579896,0.0011426359,0.00023996104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095754425,0.0005012815,0.0004245925,0.0041556694,0.00025361488,0.00095276476,0.00047694347,0.00036165572,0.00084101077],"category_scores_gemma":[0.008053637,0.00013107403,0.00030620542,0.0020538354,0.00036089355,0.0008673172,0.00039876183,0.00055862183,0.0003296407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009746279,0.00065309583,0.39599994,0.00057858904,0.00021328648,0.0013065661,0.001101327,0.06889543,0.086259596,0.0048571774,0.0049063493,0.43425402],"study_design_scores_gemma":[0.000016264776,0.0006133991,0.29066795,0.000052554136,0.00005205855,0.00051074906,0.0006107953,0.65264624,0.047901724,0.0032975571,0.0035379243,0.00009283698],"about_ca_topic_score_codex":0.0025977448,"about_ca_topic_score_gemma":0.0023968392,"teacher_disagreement_score":0.0041556694,"about_ca_system_score_codex":0.0005022462,"about_ca_system_score_gemma":0.00039623963,"threshold_uncertainty_score":0.005165279},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20540631,0.0010575494,0.74993,0.00032829522,0.00014382781,0.0005572434,0.0005862086,0.008195824,0.03379481],"genre_scores_gemma":[0.7692891,0.00029211325,0.22164081,0.00015721805,0.000022032427,0.0002577293,0.0005671821,0.00012483457,0.007649007],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998683,0.000017303435,0.0000111831505,0.000025911944,0.000047253492,0.000030073981],"domain_scores_gemma":[0.99991393,0.000012843744,0.000015514439,0.000013490547,0.00003812861,0.000006089649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013003145,0.00027827575,0.00020555475,0.00023224244,0.000192385,0.00029968863,0.0008461084,0.00029050076,0.0032046288],"category_scores_gemma":[0.00016386124,0.00017208386,0.00024554663,0.00018705489,0.00012364805,0.00025199927,0.00012796315,0.00023088064,0.0007147384],"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.0006622504,0.00020567671,0.0034846344,0.0012133183,0.00016218607,0.0010387063,0.00035531545,0.2845303,0.41179386,0.023660524,0.011171539,0.26172167],"study_design_scores_gemma":[0.00015770363,0.0015191955,0.0027758633,0.00006720428,0.00013477777,0.0009888028,0.000063139196,0.731032,0.21433994,0.0021660472,0.046694547,0.000060724196],"about_ca_topic_score_codex":0.0010469182,"about_ca_topic_score_gemma":0.0013567829,"teacher_disagreement_score":0.0032046288,"about_ca_system_score_codex":0.00028282194,"about_ca_system_score_gemma":0.00062416296,"threshold_uncertainty_score":0.010720491},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021509544,0.24289095,0.09632802,0.057988353,0.5062727,0.00040680627,0.00081221823,0.0010821926,0.09206789],"genre_scores_gemma":[0.015747583,0.18089965,0.025465345,0.008159826,0.6466612,0.00033120954,0.0011830787,0.0014021446,0.1201499],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99701107,0.00056766835,0.00024304067,0.0005639086,0.0013989039,0.0002154213],"domain_scores_gemma":[0.9917824,0.0040678135,0.0003085307,0.0007946446,0.002221866,0.00082458585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003204597,0.0019754705,0.0024774724,0.002709911,0.0018115798,0.0060581677,0.002620167,0.0035201588,0.042616688],"category_scores_gemma":[0.009308988,0.00091554533,0.0014822312,0.0032917745,0.0022067092,0.0065454543,0.0026384224,0.0070381393,0.014963587],"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.00006909435,0.00008610173,0.00037340302,0.001096486,0.000079686084,0.00017492003,0.000067402696,0.0022140334,0.0005842345,0.033291392,0.84688324,0.11507994],"study_design_scores_gemma":[0.00001587774,0.00008611449,0.0004134292,0.00050940923,0.000035024044,0.0005806056,0.000058115424,0.0066829105,0.00030438486,0.037585344,0.9536972,0.000031645748],"about_ca_topic_score_codex":0.0010170393,"about_ca_topic_score_gemma":0.0020582539,"teacher_disagreement_score":0.042616688,"about_ca_system_score_codex":0.002322779,"about_ca_system_score_gemma":0.0020554576,"threshold_uncertainty_score":0.14256704},"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":"commentary","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003317598,0.19931862,0.015004462,0.38721976,0.28190562,0.00037177003,0.0016845982,0.0005696284,0.11060793],"genre_scores_gemma":[0.06808865,0.41160032,0.011472831,0.09033157,0.1819323,0.00039318643,0.002176601,0.0010521386,0.23295243],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9932989,0.0014741233,0.00037975813,0.0004909589,0.0040878966,0.00026833237],"domain_scores_gemma":[0.94831955,0.013224721,0.0019249133,0.0032320886,0.031301774,0.0019970522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010400562,0.00045502238,0.00096785935,0.0031692586,0.0014124715,0.002900691,0.0020029559,0.002993532,0.021096388],"category_scores_gemma":[0.06764987,0.00040429298,0.00041414532,0.0022176893,0.0031250254,0.0040880563,0.0019328735,0.0031173148,0.007533478],"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.00003968277,0.000014878145,0.00012502795,0.0012032968,0.000025779502,0.000040122555,0.00006959371,0.0002055679,0.000399324,0.040969174,0.84585977,0.11104781],"study_design_scores_gemma":[0.000009628435,0.000023428725,0.0005047988,0.0005948358,0.00001582228,0.00009449532,0.00003031405,0.000218652,0.00061144296,0.0078546,0.990026,0.00001605447],"about_ca_topic_score_codex":0.0025287985,"about_ca_topic_score_gemma":0.004244851,"teacher_disagreement_score":0.021096388,"about_ca_system_score_codex":0.003042742,"about_ca_system_score_gemma":0.0068937014,"threshold_uncertainty_score":0.0705744},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35749665,0.0038433257,0.5019091,0.0007334623,0.0006527335,0.0007705058,0.0029599615,0.09983497,0.031799372],"genre_scores_gemma":[0.82184386,0.00070396176,0.16056475,0.00042976235,0.00011862232,0.00030223344,0.003521879,0.0010781626,0.011436742],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99960965,0.000058352423,0.000028858021,0.000090631074,0.00015316188,0.000059373517],"domain_scores_gemma":[0.99939036,0.00010236795,0.00006172255,0.0002122722,0.00015267901,0.00008048849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042133607,0.00071362936,0.00040175402,0.00055573595,0.0004889666,0.00087698054,0.0021444694,0.0004315706,0.008845486],"category_scores_gemma":[0.0010317984,0.00036160677,0.00025684966,0.00074651075,0.00038971027,0.0017930169,0.0015072734,0.00073612895,0.0019366329],"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.004746479,0.0008442809,0.0143759055,0.0015331154,0.00021096236,0.0009314205,0.0007746471,0.053160567,0.23635449,0.023888601,0.11766852,0.54551107],"study_design_scores_gemma":[0.0007820729,0.0032276819,0.012491115,0.00012882918,0.00017713677,0.0014880514,0.00033051491,0.56468356,0.232829,0.010843304,0.17280908,0.00020963694],"about_ca_topic_score_codex":0.0013321362,"about_ca_topic_score_gemma":0.0016139607,"teacher_disagreement_score":0.008845486,"about_ca_system_score_codex":0.0005495329,"about_ca_system_score_gemma":0.0009804117,"threshold_uncertainty_score":0.029591084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17905457,0.0012340264,0.7462331,0.00097431004,0.0003522878,0.0005073034,0.001347639,0.003867048,0.06642966],"genre_scores_gemma":[0.89394385,0.00061988167,0.08336088,0.00029171404,0.00008081162,0.00047836168,0.00045470198,0.00022819248,0.020541787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996953,0.000054444306,0.000015492287,0.00005133598,0.000112297275,0.00007113564],"domain_scores_gemma":[0.99967444,0.00007174939,0.000047190115,0.00007337288,0.000089633126,0.000043609354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002747898,0.00076521316,0.00039989507,0.00034480816,0.0004195479,0.0012871356,0.0014047675,0.0006844257,0.0064374036],"category_scores_gemma":[0.0006531688,0.00034724086,0.00052383286,0.0003507185,0.00081796595,0.0011514089,0.0007925093,0.0008198383,0.0007668278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022098843,0.000064467014,0.0008750636,0.0002102441,0.000050457576,0.00048556313,0.000110894776,0.87600106,0.009689227,0.09635174,0.0030496123,0.012890682],"study_design_scores_gemma":[0.00007088716,0.00023554041,0.00031445504,0.00002520413,0.00004544477,0.00012900877,0.000030754105,0.9657596,0.003009745,0.017150778,0.013209458,0.000019262006],"about_ca_topic_score_codex":0.0039277677,"about_ca_topic_score_gemma":0.0049771923,"teacher_disagreement_score":0.0064374036,"about_ca_system_score_codex":0.0005206582,"about_ca_system_score_gemma":0.0012940617,"threshold_uncertainty_score":0.021535218},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030916154,0.0013126408,0.857098,0.0009391745,0.0008813834,0.00012395998,0.00039299953,0.024637908,0.08369782],"genre_scores_gemma":[0.20902975,0.00120156,0.7426229,0.0007764797,0.00040058076,0.00016338316,0.0008920609,0.00611922,0.03879403],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99969983,0.00003270337,0.000017651737,0.000047308382,0.00016566539,0.000036870377],"domain_scores_gemma":[0.9995109,0.00017287859,0.000030002911,0.00015222617,0.00011222293,0.000021802014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025729035,0.0011446336,0.00040910873,0.0006784698,0.00043081638,0.0017050236,0.0012750541,0.00045123792,0.017288547],"category_scores_gemma":[0.0012647894,0.0005873893,0.00067036395,0.0008188971,0.0006888782,0.0028666297,0.0011754457,0.0016460881,0.008072687],"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.00040788064,0.00021641912,0.00117238,0.0006309328,0.00008845829,0.0003959317,0.0003883274,0.016897207,0.09157667,0.22583148,0.05352817,0.60886616],"study_design_scores_gemma":[0.00032269704,0.00028761633,0.0009944373,0.00022224251,0.00016897066,0.00076195813,0.0001592515,0.22121924,0.20008513,0.27943504,0.29620925,0.00013412278],"about_ca_topic_score_codex":0.00091191364,"about_ca_topic_score_gemma":0.00248141,"teacher_disagreement_score":0.017288547,"about_ca_system_score_codex":0.00040203155,"about_ca_system_score_gemma":0.000715412,"threshold_uncertainty_score":0.057835937},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082499966,0.00015470508,0.89013857,0.00022762324,0.00015739059,0.000070699294,0.00014647027,0.018687567,0.007917021],"genre_scores_gemma":[0.46190864,0.00007977261,0.52895916,0.00017186983,0.000056699737,0.00013142727,0.00062392355,0.0018308024,0.006237704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943656,0.00008032251,0.000050183837,0.000101998274,0.00022532463,0.00010560381],"domain_scores_gemma":[0.9987023,0.0003125759,0.00012611541,0.0004819642,0.0003105397,0.000066591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042077716,0.00071335403,0.0004767812,0.0006415986,0.0005679073,0.001296952,0.0011043904,0.00037427843,0.0034330576],"category_scores_gemma":[0.0018654766,0.0003454786,0.00054363697,0.0007828138,0.000742268,0.0011513338,0.0017427772,0.0009931172,0.0019396879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007455936,0.0003773792,0.004791588,0.00030686273,0.000101045334,0.00052888005,0.00065326964,0.17977926,0.19603695,0.098487735,0.024286535,0.49390483],"study_design_scores_gemma":[0.00007613314,0.00019835785,0.00073801045,0.00002873299,0.00002372757,0.0001582358,0.000058949296,0.8668053,0.09441093,0.020818299,0.01663453,0.000048920298],"about_ca_topic_score_codex":0.002002524,"about_ca_topic_score_gemma":0.0025606882,"teacher_disagreement_score":0.0034330576,"about_ca_system_score_codex":0.0006194778,"about_ca_system_score_gemma":0.001359766,"threshold_uncertainty_score":0.011484683},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057713076,0.0002541008,0.93513876,0.00025533116,0.0000571859,0.00006679961,0.00017887996,0.0007709613,0.0055648456],"genre_scores_gemma":[0.6456495,0.00048877153,0.34548292,0.00019724469,0.00015397147,0.000111829824,0.0005232124,0.00022588695,0.00716674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995105,0.000060713624,0.000024970366,0.000104566425,0.00014867912,0.00015042855],"domain_scores_gemma":[0.9993856,0.00013774102,0.000072537914,0.00027430247,0.00008037144,0.00004938445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005309041,0.0006183267,0.00059974816,0.0004672218,0.00044388775,0.00091212126,0.0007003376,0.0004295171,0.005739932],"category_scores_gemma":[0.0018414467,0.00025083235,0.0003885638,0.00088289694,0.0008073109,0.0021833573,0.00147548,0.00081041356,0.0010336619],"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.00089958357,0.00022122516,0.0023825841,0.00050991157,0.000053322074,0.0014508514,0.00029690293,0.07670314,0.11094342,0.45372748,0.009803251,0.3430083],"study_design_scores_gemma":[0.00013909127,0.00026621012,0.0013489495,0.000061933344,0.00004028181,0.0014046239,0.00013775531,0.43685105,0.09563629,0.43845767,0.025600297,0.00005584544],"about_ca_topic_score_codex":0.0005350977,"about_ca_topic_score_gemma":0.0012529459,"teacher_disagreement_score":0.005739932,"about_ca_system_score_codex":0.0003124701,"about_ca_system_score_gemma":0.0004366916,"threshold_uncertainty_score":0.019201994},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01751006,0.0022122168,0.9680886,0.00026769066,0.00050440844,0.000074787175,0.00011849599,0.0012849163,0.00993877],"genre_scores_gemma":[0.14648907,0.0006485781,0.8313067,0.00017612023,0.00015582569,0.0002094909,0.00025483215,0.00039618742,0.020363176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996486,0.000093672854,0.000023935729,0.00005045908,0.00014039596,0.000042940497],"domain_scores_gemma":[0.99955815,0.000117915726,0.00001604161,0.00011231079,0.00017655543,0.00001895794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038805537,0.0005180627,0.0006239167,0.00046528716,0.0005547125,0.0010504489,0.0015977314,0.000753112,0.006293369],"category_scores_gemma":[0.0014049154,0.00022091536,0.000488608,0.00079089514,0.00034902175,0.001148453,0.00088932854,0.0011016221,0.0012538735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007801259,0.00018047953,0.00090377737,0.00046642523,0.00015108577,0.0002259883,0.00016745551,0.17923158,0.03377457,0.1151222,0.021776496,0.6472199],"study_design_scores_gemma":[0.00006442977,0.00010334253,0.0003362097,0.000033030763,0.00003639005,0.00019539356,0.000022437313,0.9541413,0.009463147,0.015771477,0.019819962,0.00001295329],"about_ca_topic_score_codex":0.001634815,"about_ca_topic_score_gemma":0.0030247201,"teacher_disagreement_score":0.006293369,"about_ca_system_score_codex":0.00070582656,"about_ca_system_score_gemma":0.0009999208,"threshold_uncertainty_score":0.021053374},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01969603,0.00034458467,0.95095724,0.0004886605,0.00016748684,0.00031041144,0.0006091382,0.02131015,0.006116297],"genre_scores_gemma":[0.12970665,0.00021426096,0.84891963,0.00063878845,0.00011039311,0.00035324603,0.0022168104,0.005400622,0.012439634],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99747366,0.00051699777,0.000160187,0.0005725392,0.0010427947,0.00023380984],"domain_scores_gemma":[0.9925982,0.002414477,0.00043457415,0.0031624688,0.0012562526,0.00013394265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014678731,0.0014383415,0.001110313,0.0013633346,0.0008357299,0.0014309386,0.0029272705,0.00087408826,0.008243088],"category_scores_gemma":[0.0077367714,0.00055824255,0.0022512355,0.0011574075,0.0014296434,0.0028378682,0.0021492038,0.0024398107,0.002540409],"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.000733404,0.00046735513,0.0044024726,0.0009795263,0.00018777086,0.00039046898,0.0005075071,0.053110894,0.07416258,0.050764404,0.04247885,0.7718149],"study_design_scores_gemma":[0.00015330322,0.0004753086,0.0018365473,0.00015627766,0.0002536615,0.00082913594,0.00027620883,0.63779175,0.12770157,0.13587795,0.09452253,0.0001258246],"about_ca_topic_score_codex":0.002538316,"about_ca_topic_score_gemma":0.0056577753,"teacher_disagreement_score":0.008243088,"about_ca_system_score_codex":0.0009863807,"about_ca_system_score_gemma":0.0021976796,"threshold_uncertainty_score":0.02757585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03193944,0.00027653386,0.963978,0.00018783197,0.000050310828,0.000034848457,0.00005316427,0.002417359,0.0010624578],"genre_scores_gemma":[0.70020527,0.00028526754,0.29358754,0.00028778636,0.00010653866,0.00017398685,0.0002705014,0.0003520693,0.0047310297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957246,0.000072168004,0.00002461911,0.000116171344,0.00015092458,0.00006352299],"domain_scores_gemma":[0.999005,0.00044962935,0.00013235811,0.0001514632,0.00021621103,0.000045283356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006470682,0.0007695826,0.0010756499,0.00069154846,0.00046317038,0.0011337947,0.0018412381,0.0009445192,0.0022733372],"category_scores_gemma":[0.0032924816,0.00043585527,0.000505645,0.0006403329,0.0006377085,0.0018668266,0.0010113548,0.0015940084,0.00097125134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036531992,0.00020469169,0.0034173492,0.00011183741,0.00006217244,0.00016023713,0.00013369507,0.73848516,0.01631683,0.00817204,0.0025313082,0.23003939],"study_design_scores_gemma":[0.0000028228237,0.000010569192,0.00004441495,0.000002309553,0.0000023212629,0.00001054157,0.0000032783978,0.9980679,0.0009685254,0.000700346,0.00018500334,0.0000019583304],"about_ca_topic_score_codex":0.0053284816,"about_ca_topic_score_gemma":0.00470581,"teacher_disagreement_score":0.0053284816,"about_ca_system_score_codex":0.00074058643,"about_ca_system_score_gemma":0.0016837319,"threshold_uncertainty_score":0.010594904},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24624346,0.015203453,0.2581764,0.14003552,0.029420359,0.0012841328,0.026933387,0.13010249,0.15260093],"genre_scores_gemma":[0.6145018,0.006433302,0.1856748,0.02331195,0.0048872977,0.0010701702,0.064622276,0.037566602,0.061931863],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98908615,0.0025269603,0.00048244375,0.0006858589,0.0063575017,0.00086105836],"domain_scores_gemma":[0.9699229,0.013244471,0.001548358,0.0037694506,0.009105535,0.0024093858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009289259,0.0011745223,0.00073905615,0.0013642996,0.0008921114,0.0030305034,0.0029475917,0.0015547755,0.010516912],"category_scores_gemma":[0.046677276,0.0006468207,0.0010700062,0.002161535,0.0015464659,0.0027590706,0.0016119903,0.0037468104,0.003137555],"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.0012615945,0.00044822672,0.0071436646,0.00089714496,0.00019216767,0.0004452944,0.0002978029,0.015525187,0.014163909,0.03328955,0.7680161,0.15831938],"study_design_scores_gemma":[0.0011595997,0.0024113122,0.0126434425,0.0007270149,0.0002646102,0.0013966003,0.0007558501,0.14253882,0.045902707,0.059392657,0.7323706,0.00043668263],"about_ca_topic_score_codex":0.005898717,"about_ca_topic_score_gemma":0.0093614645,"teacher_disagreement_score":0.010516912,"about_ca_system_score_codex":0.0013375672,"about_ca_system_score_gemma":0.0034324443,"threshold_uncertainty_score":0.049126923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14201882,0.006054942,0.71386725,0.047893476,0.0007372814,0.00040054764,0.0021573652,0.0027962027,0.08407421],"genre_scores_gemma":[0.7053786,0.0046845563,0.26183534,0.0043110554,0.0021592723,0.00065101386,0.0028398181,0.0014835777,0.016656779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9850455,0.005283022,0.00079748087,0.0023916739,0.0046906816,0.0017916764],"domain_scores_gemma":[0.85959166,0.12273798,0.0036262306,0.008445024,0.003696109,0.0019029212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009118901,0.0012830403,0.001963368,0.0021358512,0.0030493988,0.0069138757,0.0044248416,0.0021555515,0.016349036],"category_scores_gemma":[0.06539991,0.0014054098,0.002842238,0.0033795296,0.0071747447,0.028191034,0.008694859,0.010949698,0.002159442],"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.00036352183,0.00021719284,0.0021869692,0.0007425335,0.00012513832,0.0002324251,0.00084355427,0.034921866,0.0021292097,0.8852304,0.015618584,0.057388503],"study_design_scores_gemma":[0.000053627453,0.000028684814,0.0003992834,0.000054299195,0.000046296682,0.00008608296,0.000105528095,0.072588384,0.0009250533,0.92069864,0.0049853795,0.000028775776],"about_ca_topic_score_codex":0.0044949367,"about_ca_topic_score_gemma":0.0045664934,"teacher_disagreement_score":0.016349036,"about_ca_system_score_codex":0.0058024414,"about_ca_system_score_gemma":0.0043578367,"threshold_uncertainty_score":0.054692984},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076489694,0.00034476558,0.91563743,0.00026781292,0.00006144297,0.00003951982,0.00012022608,0.004375132,0.0026639893],"genre_scores_gemma":[0.6813558,0.00022333187,0.3154939,0.00014888961,0.000053371692,0.000097683485,0.0003507052,0.00034340614,0.0019329523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996885,0.00007201336,0.000024603542,0.000074436044,0.0000972779,0.000043291726],"domain_scores_gemma":[0.9988808,0.00055787736,0.00010412243,0.00032676564,0.00010552948,0.000024990524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004299601,0.0003915508,0.000424565,0.0004131071,0.00035235865,0.00044903203,0.0007103914,0.00030665385,0.0021434817],"category_scores_gemma":[0.0038952723,0.00028006913,0.00037782284,0.00053277164,0.0005880921,0.0014274169,0.0007153684,0.0008225976,0.0004379483],"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.0003092291,0.000082604856,0.002028919,0.00010769297,0.000043924778,0.00014249732,0.00017388733,0.6344683,0.01999983,0.020899141,0.0038952923,0.31784865],"study_design_scores_gemma":[0.000010568146,0.000039038674,0.00010253677,0.0000048297456,0.000005785567,0.000019562114,0.000014039133,0.98220855,0.00819932,0.008317575,0.0010739948,0.0000041493586],"about_ca_topic_score_codex":0.004546448,"about_ca_topic_score_gemma":0.0090688765,"teacher_disagreement_score":0.004546448,"about_ca_system_score_codex":0.00047443868,"about_ca_system_score_gemma":0.0010884373,"threshold_uncertainty_score":0.009039938},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020151677,0.00029861426,0.9619631,0.0028876315,0.00011200803,0.00014136716,0.0001786803,0.0011137218,0.013153184],"genre_scores_gemma":[0.6212329,0.0007629181,0.36438826,0.0012734835,0.00048622463,0.00065770163,0.00048306255,0.0009169015,0.009798496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955996,0.0014372293,0.00033341235,0.00068153924,0.001535346,0.00041286089],"domain_scores_gemma":[0.9853784,0.0064456495,0.00093076495,0.0053546606,0.001505795,0.00038466952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004480353,0.0008536409,0.0007011109,0.0012811817,0.0012690235,0.0042730765,0.0022840523,0.0018804908,0.0053869765],"category_scores_gemma":[0.01608113,0.001051671,0.0024546082,0.0011294698,0.0052684085,0.009119624,0.0040493715,0.0061908653,0.00077799964],"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.00003791614,0.00007340211,0.00055573444,0.00007906427,0.000020286514,0.00009652631,0.00021757517,0.03476785,0.0017303153,0.94909185,0.0017495718,0.011579921],"study_design_scores_gemma":[0.00003354789,0.000055922512,0.00011832712,0.000050294635,0.00003298113,0.00008812549,0.000081930135,0.14715615,0.003307943,0.8380191,0.011034835,0.000020881356],"about_ca_topic_score_codex":0.0027135953,"about_ca_topic_score_gemma":0.0025591892,"teacher_disagreement_score":0.0053869765,"about_ca_system_score_codex":0.0021048628,"about_ca_system_score_gemma":0.0026044298,"threshold_uncertainty_score":0.023694634},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6457238,0.0015495965,0.3487306,0.00018211259,0.00008176464,0.000074060124,0.00013084132,0.0014346363,0.0020926017],"genre_scores_gemma":[0.97699887,0.00012754003,0.022476645,0.000022166218,0.000009751857,0.000025263704,0.000048847392,0.00003855879,0.00025235012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988134,0.00022448663,0.00005669138,0.00021415435,0.00054699375,0.00014436973],"domain_scores_gemma":[0.99217016,0.0040361704,0.0020049084,0.0006028626,0.0009788388,0.00020710805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011493865,0.00057176646,0.00036194685,0.0011191405,0.00042101226,0.0007377734,0.0008431588,0.00034946657,0.0006271355],"category_scores_gemma":[0.010063194,0.00030823462,0.00014629283,0.00096524163,0.0004947263,0.0010645879,0.0005624115,0.00071753346,0.00010729635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007331847,0.00025159086,0.029294524,0.00027449676,0.00010266668,0.0002451095,0.0003880086,0.81080234,0.061628517,0.008599621,0.000900601,0.08677934],"study_design_scores_gemma":[0.000008440381,0.00008008078,0.0020974355,0.0000067543647,0.000010766222,0.00003439397,0.00002158766,0.98633236,0.009893676,0.0011513177,0.0003519251,0.000011240974],"about_ca_topic_score_codex":0.0048194192,"about_ca_topic_score_gemma":0.0049661524,"teacher_disagreement_score":0.0048194192,"about_ca_system_score_codex":0.0010293684,"about_ca_system_score_gemma":0.001296063,"threshold_uncertainty_score":0.009582758},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09378762,0.00023164104,0.89458007,0.00014013983,0.00009592939,0.00009298354,0.000060498332,0.001552594,0.009458587],"genre_scores_gemma":[0.58058006,0.00016326229,0.41630563,0.00006394973,0.000024645411,0.00010416916,0.00016251135,0.00024852145,0.0023472353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995571,0.00010279556,0.000035153997,0.00005326223,0.00017464331,0.00007706289],"domain_scores_gemma":[0.99937326,0.00021432282,0.00006499498,0.00012656642,0.00016030483,0.00006044152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007793932,0.0006210547,0.0004453568,0.00072026055,0.00038656188,0.0009802997,0.00073231594,0.00036157487,0.0022189314],"category_scores_gemma":[0.0018600028,0.00025172238,0.00039824116,0.00063818553,0.0006260918,0.0009190732,0.00074387155,0.0005899036,0.00034539195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039726726,0.00020033323,0.0028944372,0.0002165338,0.000075382064,0.00031977004,0.00032380963,0.48371595,0.048089575,0.19283149,0.0040728296,0.26686257],"study_design_scores_gemma":[0.00005877846,0.000088109686,0.00026135857,0.000012356735,0.00001408966,0.00004137751,0.000039260376,0.95718104,0.010483532,0.02811358,0.003687631,0.000018981493],"about_ca_topic_score_codex":0.0032559931,"about_ca_topic_score_gemma":0.004748511,"teacher_disagreement_score":0.0032559931,"about_ca_system_score_codex":0.0006718494,"about_ca_system_score_gemma":0.0016593126,"threshold_uncertainty_score":0.0074230433},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13800816,0.0021007103,0.6598968,0.0006958843,0.0005060783,0.00046822766,0.003412014,0.17037956,0.024532601],"genre_scores_gemma":[0.53081566,0.0005889534,0.44117725,0.00049025856,0.00008150298,0.0003846132,0.0065263165,0.011703866,0.0082316715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998321,0.0002477309,0.00015269741,0.0003422792,0.0007016723,0.00023463639],"domain_scores_gemma":[0.998539,0.00028457743,0.00006312624,0.000512032,0.000503528,0.00009781837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011107933,0.0010970143,0.0006415882,0.000491511,0.00059292326,0.0018959345,0.0026255597,0.00053611613,0.004613505],"category_scores_gemma":[0.003400356,0.0006153906,0.0006518858,0.00091636565,0.0007731023,0.0019086511,0.0017364738,0.001490248,0.0020193981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002921637,0.00071175187,0.018694704,0.0012850919,0.0003650065,0.0011338912,0.0019586463,0.105501935,0.1320706,0.045984987,0.21989845,0.4694733],"study_design_scores_gemma":[0.00031480912,0.00032280275,0.0031291877,0.00006402338,0.000066744855,0.000319842,0.00033210524,0.78968596,0.100097835,0.012685193,0.092891626,0.000089882364],"about_ca_topic_score_codex":0.010997508,"about_ca_topic_score_gemma":0.01296169,"teacher_disagreement_score":0.010997508,"about_ca_system_score_codex":0.0014671261,"about_ca_system_score_gemma":0.0023572652,"threshold_uncertainty_score":0.021866977},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03692878,0.0002063471,0.94445586,0.00008797991,0.00011888841,0.000075993215,0.00020874085,0.0068061636,0.011111302],"genre_scores_gemma":[0.33855906,0.0001609052,0.6528023,0.00011832247,0.000040695464,0.0001828027,0.00065682724,0.0018397368,0.005639404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996364,0.00005193696,0.00003518456,0.00007970692,0.00012046041,0.00007625304],"domain_scores_gemma":[0.99945706,0.00019665474,0.00005936083,0.00016319957,0.000093951545,0.000029747505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004241958,0.0004792913,0.00042931896,0.000433021,0.00046221702,0.00069268554,0.000747538,0.00031917653,0.007751069],"category_scores_gemma":[0.0016909868,0.0004016826,0.00074236427,0.00043797982,0.00060853944,0.0008693455,0.0010149606,0.00087926857,0.0016027115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079183927,0.0001246114,0.0038590117,0.00061499537,0.00008081606,0.0005505233,0.00064732344,0.30565903,0.15680367,0.1379607,0.014420181,0.37848738],"study_design_scores_gemma":[0.00007521541,0.00024013057,0.0006418284,0.000074403455,0.000029327635,0.00018568491,0.000115250084,0.77090514,0.11016532,0.07820066,0.039323103,0.000043937074],"about_ca_topic_score_codex":0.00090468803,"about_ca_topic_score_gemma":0.0016471386,"teacher_disagreement_score":0.007751069,"about_ca_system_score_codex":0.0004148202,"about_ca_system_score_gemma":0.00064250914,"threshold_uncertainty_score":0.025929928},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048943907,0.00029820518,0.9276707,0.000106586005,0.000047759582,0.000100531295,0.00014623506,0.01271387,0.0099721765],"genre_scores_gemma":[0.61169094,0.00014208625,0.380072,0.000117109485,0.000022019565,0.0002352448,0.0003614158,0.0017598812,0.0055993325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996854,0.00003946491,0.000010294212,0.000050460414,0.00016374592,0.00005066385],"domain_scores_gemma":[0.99979,0.000050720737,0.00002167871,0.000039600476,0.000080953556,0.000017056384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032817852,0.000690248,0.00043828366,0.0005263173,0.00035342464,0.00061379146,0.0012321396,0.0004187831,0.003353941],"category_scores_gemma":[0.00080837816,0.00022934178,0.00042889436,0.00040216823,0.0002787415,0.00043060986,0.00058418646,0.00066957314,0.0006729907],"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.00023977841,0.00020559125,0.002701334,0.00022728724,0.000073702715,0.00023441983,0.00017885242,0.59667057,0.1140841,0.013248695,0.0093407575,0.262795],"study_design_scores_gemma":[0.000016258253,0.000050962062,0.00039252892,0.000008428174,0.000009083501,0.000043608332,0.0000135649,0.977948,0.015623679,0.0014255896,0.0044558006,0.000012478231],"about_ca_topic_score_codex":0.0035118472,"about_ca_topic_score_gemma":0.0042864024,"teacher_disagreement_score":0.0035118472,"about_ca_system_score_codex":0.00064926344,"about_ca_system_score_gemma":0.00095167616,"threshold_uncertainty_score":0.011220098},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016842583,0.0012082488,0.78340054,0.00046457295,0.0005646252,0.00013083291,0.00916174,0.17378928,0.029596006],"genre_scores_gemma":[0.038934607,0.0025777388,0.75167453,0.0015268149,0.00038299232,0.0009767534,0.033137,0.102961086,0.06782852],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984981,0.00023252309,0.00010964513,0.00021003165,0.0007975887,0.00015212024],"domain_scores_gemma":[0.9981792,0.00064552005,0.00015654546,0.00033287425,0.00055248436,0.00013331328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013763943,0.0016276807,0.0014215473,0.001380993,0.00070008537,0.0023028343,0.003416016,0.0013359549,0.0737132],"category_scores_gemma":[0.004745418,0.0011425045,0.0019834435,0.0016315994,0.00071207975,0.0020021182,0.002959391,0.0030699829,0.057618063],"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.00033994298,0.00013703472,0.0013955059,0.0016040254,0.00027313558,0.00028091378,0.0002076233,0.03793083,0.01352259,0.037434764,0.5914591,0.31541452],"study_design_scores_gemma":[0.0001780146,0.00008815413,0.00095134124,0.00020916798,0.000052495005,0.00036676845,0.0000221553,0.0733694,0.014169976,0.01860889,0.89183754,0.00014613186],"about_ca_topic_score_codex":0.002781569,"about_ca_topic_score_gemma":0.002758606,"teacher_disagreement_score":0.0737132,"about_ca_system_score_codex":0.0006403792,"about_ca_system_score_gemma":0.002197573,"threshold_uncertainty_score":0.2465952},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38552114,0.0044421297,0.5485555,0.0008976716,0.00059921865,0.00035712562,0.0010331812,0.015574872,0.043019187],"genre_scores_gemma":[0.92332613,0.00035184226,0.065361656,0.00034975703,0.000104050305,0.00013404648,0.0009197258,0.00051787694,0.008934962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998599,0.00012700488,0.00007015601,0.00018036459,0.0005482696,0.00047520734],"domain_scores_gemma":[0.99763453,0.00038343458,0.00021495884,0.00094991206,0.0006686844,0.00014852677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006222732,0.0006279483,0.0006512716,0.0008347442,0.0008481426,0.0016182339,0.002982371,0.0005078004,0.00798359],"category_scores_gemma":[0.0022474355,0.0003349868,0.00051658705,0.0012746631,0.00089797395,0.003329593,0.002239606,0.0008057603,0.0013962999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020201413,0.0005870775,0.010512254,0.0010350727,0.00030111233,0.0008124975,0.00036325716,0.1941688,0.0780013,0.077217035,0.06495474,0.57002676],"study_design_scores_gemma":[0.00033842103,0.001447467,0.0035600448,0.00016743784,0.0003011238,0.0014938553,0.00041002623,0.7482068,0.11509833,0.043658685,0.08516569,0.00015218327],"about_ca_topic_score_codex":0.0033890137,"about_ca_topic_score_gemma":0.0070493883,"teacher_disagreement_score":0.00798359,"about_ca_system_score_codex":0.0012078874,"about_ca_system_score_gemma":0.0026354415,"threshold_uncertainty_score":0.026707768},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07447083,0.001976331,0.7271446,0.00080819573,0.0011464604,0.000620173,0.0029218183,0.1588958,0.03201577],"genre_scores_gemma":[0.5234253,0.0011598611,0.4286867,0.0010452229,0.00032888484,0.00081820256,0.008697088,0.013842491,0.021996185],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99901736,0.00014321783,0.00009951698,0.00016124327,0.00039643166,0.0001821176],"domain_scores_gemma":[0.9985929,0.0003293193,0.00008678588,0.00043220638,0.00035546292,0.0002032497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001374828,0.0012650068,0.0006893339,0.0008722649,0.00085775804,0.0014927115,0.0031453632,0.00057767396,0.01731923],"category_scores_gemma":[0.0041412693,0.0008633705,0.00083944754,0.0010501272,0.0007108614,0.002353916,0.0025947639,0.0016655513,0.004153036],"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.0042009116,0.0008507077,0.012641392,0.000995407,0.0005344072,0.0009124221,0.0008542011,0.15234815,0.060296055,0.07785769,0.29396036,0.3945483],"study_design_scores_gemma":[0.0005252339,0.0003322564,0.0011384086,0.00005008195,0.00008484152,0.00016509237,0.0001248183,0.8502411,0.031336922,0.02773259,0.088161774,0.00010696741],"about_ca_topic_score_codex":0.004626746,"about_ca_topic_score_gemma":0.008756677,"teacher_disagreement_score":0.01731923,"about_ca_system_score_codex":0.0013186603,"about_ca_system_score_gemma":0.0032461993,"threshold_uncertainty_score":0.057938576},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36848104,0.0009663192,0.28786844,0.0005380608,0.0006186832,0.00031927088,0.0014614924,0.3007734,0.03897327],"genre_scores_gemma":[0.70756894,0.0003327636,0.2423335,0.0004852632,0.000102899015,0.0002486197,0.004128065,0.027885126,0.016914701],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998212,0.00024178173,0.00011442131,0.00028296493,0.0008654087,0.0002833254],"domain_scores_gemma":[0.9977258,0.000754944,0.00018366755,0.0007192755,0.0005062531,0.00011016235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011660435,0.001044097,0.00060482696,0.0007553955,0.00074952387,0.0010668382,0.0019005763,0.0006800733,0.005665998],"category_scores_gemma":[0.0041908617,0.0005926173,0.00077806565,0.00081711996,0.0008446501,0.0016857666,0.0012576358,0.0014280702,0.0018570643],"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.003097767,0.0014073725,0.013409233,0.0011894007,0.00025118535,0.0012267117,0.00088307617,0.06874532,0.25932533,0.030507,0.07272936,0.5472282],"study_design_scores_gemma":[0.00074652495,0.0008613001,0.011149624,0.00013182855,0.00016529582,0.0006183611,0.00015271307,0.5234016,0.36270148,0.01259742,0.087219015,0.00025476448],"about_ca_topic_score_codex":0.0046002087,"about_ca_topic_score_gemma":0.0064524934,"teacher_disagreement_score":0.005665998,"about_ca_system_score_codex":0.00088351796,"about_ca_system_score_gemma":0.0021297976,"threshold_uncertainty_score":0.018954635},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046875835,0.00017301102,0.6724043,0.00019709622,0.00013632212,0.00041333257,0.0021539896,0.31523857,0.0045958417],"genre_scores_gemma":[0.12546954,0.00048739032,0.74981487,0.00078102463,0.00016147601,0.0019346765,0.010145457,0.09637996,0.014825565],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983612,0.00020874033,0.00018142576,0.00044175645,0.00061661203,0.00019031616],"domain_scores_gemma":[0.99588495,0.0013549271,0.0002675276,0.0010997896,0.0010794161,0.00031339668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027057067,0.00225436,0.0014986171,0.003119553,0.0007716409,0.004283302,0.0054249824,0.0013645763,0.031495336],"category_scores_gemma":[0.008089631,0.0018617627,0.0016983835,0.0019593681,0.0009866031,0.0030356061,0.002538416,0.0028399955,0.012137972],"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.0029209866,0.00086783175,0.008966252,0.0022339185,0.0007017956,0.0011417108,0.0020301428,0.021713747,0.10921375,0.036874514,0.19239555,0.62093973],"study_design_scores_gemma":[0.0014779413,0.00054599385,0.00829496,0.0004893947,0.0005011729,0.0009975632,0.00045716923,0.46057767,0.23558111,0.038571734,0.25194857,0.00055675994],"about_ca_topic_score_codex":0.004326557,"about_ca_topic_score_gemma":0.0032015822,"teacher_disagreement_score":0.031495336,"about_ca_system_score_codex":0.0009138171,"about_ca_system_score_gemma":0.0021510976,"threshold_uncertainty_score":0.105362356},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025499642,0.0010123522,0.99074054,0.00021874804,0.0001236582,0.00013503616,0.00004443992,0.000768051,0.004407261],"genre_scores_gemma":[0.12780696,0.003443101,0.8515303,0.00028860004,0.0002185556,0.00063418003,0.00019186398,0.00055789965,0.015328514],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977652,0.00031801363,0.00013000607,0.00041204423,0.0012250812,0.00014960096],"domain_scores_gemma":[0.99843436,0.0004908844,0.00014954875,0.0005295738,0.00035224977,0.00004336212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013999349,0.0007880229,0.00058600865,0.0017244631,0.00097347185,0.002010926,0.002489699,0.0010472159,0.0061026793],"category_scores_gemma":[0.004334407,0.0006126979,0.0009531098,0.0018892059,0.0013133211,0.0025861755,0.0020910057,0.002039152,0.0024618416],"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.00023240164,0.000232147,0.0009978613,0.00092497846,0.0001152196,0.00018714278,0.0006730709,0.060437985,0.056380454,0.23872106,0.007788858,0.6333089],"study_design_scores_gemma":[0.00012235618,0.00024548476,0.0011958902,0.00035195338,0.000092734925,0.00094643893,0.00042122984,0.5509013,0.10830002,0.16918857,0.16809617,0.00013783442],"about_ca_topic_score_codex":0.001328355,"about_ca_topic_score_gemma":0.000881775,"teacher_disagreement_score":0.0061026793,"about_ca_system_score_codex":0.0011028626,"about_ca_system_score_gemma":0.0015471154,"threshold_uncertainty_score":0.020415485},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14177428,0.0030036191,0.32237265,0.0052405284,0.0025307871,0.0005081307,0.0031314266,0.03473417,0.4867045],"genre_scores_gemma":[0.49606836,0.0013198905,0.26761785,0.0015341062,0.00036558913,0.00039811633,0.0073619825,0.001620312,0.22371379],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99967873,0.000038659724,0.000017544126,0.000051874118,0.00017335986,0.00003984262],"domain_scores_gemma":[0.99958795,0.000035310786,0.00003392115,0.000092019094,0.00018862213,0.00006216201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077842677,0.00047634082,0.0002308811,0.00045253127,0.0005375709,0.00092635833,0.00090310775,0.00056960457,0.019620102],"category_scores_gemma":[0.0007898776,0.00029306448,0.00023134868,0.00044296437,0.0002667041,0.0010708068,0.0008154612,0.0010800059,0.008118897],"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.0012079625,0.0002268436,0.005825334,0.00028128375,0.000063730804,0.0008478155,0.00053810526,0.009212911,0.21786092,0.08016726,0.39456356,0.2892044],"study_design_scores_gemma":[0.00011690046,0.00092853984,0.00445256,0.0000581757,0.00003707032,0.0008193795,0.000110042274,0.047793817,0.07684776,0.004442774,0.8643227,0.000070204085],"about_ca_topic_score_codex":0.0018162436,"about_ca_topic_score_gemma":0.004018203,"teacher_disagreement_score":0.019620102,"about_ca_system_score_codex":0.0009033805,"about_ca_system_score_gemma":0.00090024254,"threshold_uncertainty_score":0.06563574},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8000771,0.00061589497,0.19304086,0.00047290805,0.00017144263,0.000043115535,0.000087900095,0.00075495034,0.0047358577],"genre_scores_gemma":[0.9936366,0.000024331444,0.00591054,0.000019840836,0.000004580165,0.0000075156086,0.00001975578,0.000015585703,0.00036110322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997328,0.000052727744,0.000013445285,0.00005788177,0.00006325013,0.00007986008],"domain_scores_gemma":[0.9990393,0.00046133375,0.00008032498,0.00006833,0.000252525,0.000098299715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050608977,0.00032669544,0.0003379158,0.00028491943,0.00023327836,0.0003860005,0.000669148,0.0002675017,0.0015635593],"category_scores_gemma":[0.0022358566,0.00017129414,0.00013856833,0.000254241,0.00023896739,0.000543218,0.00031714543,0.00057939545,0.000121348035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076056254,0.0003519666,0.005054661,0.00006991742,0.000029976847,0.00009872545,0.00005881251,0.8879757,0.009882228,0.0029383607,0.0019644306,0.09081463],"study_design_scores_gemma":[0.0000043107493,0.000020117104,0.00020771779,0.0000010747663,0.0000020702619,0.0000028876543,0.000005391593,0.9986791,0.0007464079,0.0002796183,0.000049989,0.0000013343155],"about_ca_topic_score_codex":0.0070504337,"about_ca_topic_score_gemma":0.010177936,"teacher_disagreement_score":0.0070504337,"about_ca_system_score_codex":0.0007925074,"about_ca_system_score_gemma":0.0013517148,"threshold_uncertainty_score":0.014018774},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034569174,0.27951577,0.3903471,0.18133228,0.0017862581,0.00007559148,0.00010405661,0.0008270241,0.11144275],"genre_scores_gemma":[0.5647653,0.13084236,0.26266932,0.011494346,0.0028256942,0.00013154585,0.00007459657,0.00037307537,0.026823722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9973525,0.0011030354,0.00013833455,0.00026501215,0.0009395622,0.00020141575],"domain_scores_gemma":[0.995001,0.0025067716,0.00021534364,0.0008983663,0.0010899953,0.0002885359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044879755,0.0006533007,0.00046976123,0.0015680813,0.0012139798,0.008378532,0.0020864597,0.0032975557,0.0024550231],"category_scores_gemma":[0.0077637606,0.00056541414,0.00026856654,0.002081328,0.007811686,0.007780172,0.002365361,0.004799381,0.0009628843],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009774404,0.00010602228,0.0009065561,0.00042074826,0.00003138343,0.00012526143,0.0020662532,0.0042709443,0.00235107,0.7293404,0.0144997705,0.2457839],"study_design_scores_gemma":[0.000038140857,0.00021831747,0.0012414722,0.0014152457,0.00003433157,0.0006816194,0.0031762356,0.019652078,0.004294431,0.67388695,0.2952828,0.00007836153],"about_ca_topic_score_codex":0.0031521493,"about_ca_topic_score_gemma":0.005051162,"teacher_disagreement_score":0.008378532,"about_ca_system_score_codex":0.0017294267,"about_ca_system_score_gemma":0.001850817,"threshold_uncertainty_score":0.023734987},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15825705,0.0007076313,0.8025778,0.00079793745,0.0002861455,0.00019234557,0.0007201989,0.0009863955,0.035474427],"genre_scores_gemma":[0.8642041,0.00071443437,0.115949616,0.00022336064,0.00009847706,0.0005178172,0.00044523878,0.00025071332,0.017596258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980193,0.000033000662,0.000007830618,0.00004400355,0.00007413143,0.00003910037],"domain_scores_gemma":[0.99979156,0.00006674912,0.000029255043,0.0000428554,0.000043667198,0.000026030128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020783256,0.00048822764,0.0010740648,0.00041083092,0.0007584886,0.0010821491,0.0017854805,0.0013312566,0.0043219742],"category_scores_gemma":[0.0005228721,0.0004458491,0.0008946557,0.0005570663,0.001085737,0.0016324671,0.00065833936,0.0011657997,0.000606332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003967855,0.000041430445,0.00035041955,0.000047209985,0.000022678661,0.0001016771,0.00003138682,0.9477106,0.0043887226,0.044661473,0.00035989267,0.0022448632],"study_design_scores_gemma":[0.00001419189,0.000009965825,0.000054620534,0.0000015081888,0.0000040164937,0.0000130842855,0.0000032833666,0.994504,0.0005393844,0.00414262,0.00070955633,0.0000037963441],"about_ca_topic_score_codex":0.0077344584,"about_ca_topic_score_gemma":0.0032734415,"teacher_disagreement_score":0.0077344584,"about_ca_system_score_codex":0.0011931219,"about_ca_system_score_gemma":0.001783887,"threshold_uncertainty_score":0.015378833},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20760728,0.0008496006,0.7527831,0.0002549621,0.00010279349,0.00009606412,0.0005032718,0.03253579,0.0052671535],"genre_scores_gemma":[0.7825369,0.00031206213,0.21072242,0.00010194627,0.00005642026,0.00010168004,0.0009131061,0.0010097413,0.0042457143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952185,0.0000914048,0.000028738412,0.00011006352,0.00017574754,0.00007218672],"domain_scores_gemma":[0.9986663,0.00044073132,0.00019538579,0.00036534495,0.00028533308,0.00004695694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035362868,0.0008666422,0.0004573142,0.00078612985,0.00035178754,0.0007659033,0.000801598,0.00035774076,0.0029446462],"category_scores_gemma":[0.0019442589,0.00038822906,0.0004232593,0.0006949476,0.0003636036,0.0009445952,0.00054251426,0.0005550917,0.0010739962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082606624,0.00018464225,0.019165764,0.00031635945,0.00008932932,0.00017926238,0.00017767728,0.21600887,0.08682159,0.0067883707,0.0074696727,0.6619724],"study_design_scores_gemma":[0.00002719685,0.0001638107,0.002134978,0.000023365199,0.000028710754,0.00007961098,0.000021349577,0.92509043,0.06268063,0.0054505086,0.0042787306,0.000020628211],"about_ca_topic_score_codex":0.004047247,"about_ca_topic_score_gemma":0.0063647884,"teacher_disagreement_score":0.004047247,"about_ca_system_score_codex":0.0005072731,"about_ca_system_score_gemma":0.0015616466,"threshold_uncertainty_score":0.0098508},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054048233,0.0006184515,0.936834,0.00040621308,0.00010967435,0.00012185474,0.00008369955,0.0017900122,0.0059879534],"genre_scores_gemma":[0.33634642,0.00055449194,0.65657717,0.00018735774,0.000055688968,0.00027823608,0.00019594218,0.0006390675,0.0051656426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992323,0.00021127031,0.000047053414,0.0001018775,0.0002877551,0.00011968781],"domain_scores_gemma":[0.99815625,0.0011009149,0.00016606301,0.00023271941,0.00026529602,0.00007861358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015863132,0.0011373531,0.0014580624,0.0009479572,0.00062055537,0.0019509568,0.0011471289,0.0011400941,0.005548875],"category_scores_gemma":[0.0051662656,0.00060999324,0.00066753617,0.0007710772,0.001178758,0.001592077,0.0012371741,0.0015430894,0.0014315418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075689296,0.000267681,0.002258256,0.0004825747,0.00012370311,0.00024497233,0.0004493244,0.587765,0.05259752,0.040004008,0.0045013307,0.31054878],"study_design_scores_gemma":[0.00006173663,0.00009177307,0.00025266627,0.000034812907,0.000019544908,0.00004515599,0.0000750891,0.9754784,0.01191104,0.007892547,0.004120927,0.000016296839],"about_ca_topic_score_codex":0.0047716293,"about_ca_topic_score_gemma":0.0075886915,"teacher_disagreement_score":0.005548875,"about_ca_system_score_codex":0.0009756507,"about_ca_system_score_gemma":0.0017310403,"threshold_uncertainty_score":0.018562794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33353218,0.00035921513,0.6486997,0.00033185034,0.00009363937,0.00007732697,0.0001414437,0.0030412825,0.01372326],"genre_scores_gemma":[0.859801,0.00011657681,0.1365479,0.00013649254,0.000012606744,0.0000629414,0.000117683245,0.00025865226,0.002946189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997867,0.00004016125,0.000016575144,0.000048806156,0.000048018337,0.000059793536],"domain_scores_gemma":[0.9995415,0.00011815792,0.00003774617,0.00024438405,0.00004386331,0.000014321585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035307705,0.0003915206,0.00025734186,0.00023913126,0.00024424374,0.0006912259,0.00083602575,0.00028607107,0.002343953],"category_scores_gemma":[0.0012737026,0.00020198397,0.0002666774,0.00024966276,0.00052465533,0.0012701652,0.00061206234,0.00051629415,0.00047036752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005072027,0.00014198036,0.0024425706,0.0002502922,0.000048988873,0.00058698334,0.00046880715,0.52430445,0.13662449,0.06902187,0.0029909366,0.26261142],"study_design_scores_gemma":[0.00008620409,0.000445392,0.0013141145,0.000045734992,0.00005627518,0.0002240643,0.0002199001,0.7920015,0.13241187,0.057851076,0.0153103005,0.00003369837],"about_ca_topic_score_codex":0.00164929,"about_ca_topic_score_gemma":0.0028887638,"teacher_disagreement_score":0.002343953,"about_ca_system_score_codex":0.00036791788,"about_ca_system_score_gemma":0.0005892726,"threshold_uncertainty_score":0.007841289},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12980229,0.0017080881,0.7246721,0.00081083586,0.0029974922,0.00033818695,0.004221672,0.091683425,0.04376593],"genre_scores_gemma":[0.3528541,0.00077227404,0.5687709,0.00063887023,0.00031405158,0.00037280697,0.008891321,0.014489789,0.052895945],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996406,0.000023580818,0.000045437308,0.00007844292,0.00016519931,0.00004682888],"domain_scores_gemma":[0.99900645,0.00018134248,0.000054394648,0.00028506684,0.00043022426,0.00004250196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022701717,0.0011012177,0.00046451227,0.00096541457,0.0004390495,0.0010179534,0.0009067579,0.00050340634,0.01649878],"category_scores_gemma":[0.0028249358,0.00025932732,0.00042975417,0.00095331913,0.000432463,0.0010871637,0.0011033524,0.0008378888,0.008034681],"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.00076551375,0.00011906909,0.0017269364,0.0004927912,0.00005469111,0.00076372904,0.0005124545,0.006123736,0.1694373,0.014446471,0.08026539,0.72529185],"study_design_scores_gemma":[0.0001271181,0.00029150367,0.0023904839,0.00017325577,0.000085646774,0.0012000087,0.00031814535,0.10213032,0.6312284,0.01969215,0.24225543,0.00010752648],"about_ca_topic_score_codex":0.0015034296,"about_ca_topic_score_gemma":0.0018413757,"teacher_disagreement_score":0.01649878,"about_ca_system_score_codex":0.00036653786,"about_ca_system_score_gemma":0.00041266964,"threshold_uncertainty_score":0.0551939},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11743837,0.0010850022,0.841379,0.0004040344,0.00054477353,0.00026154952,0.00018722894,0.016482092,0.022217931],"genre_scores_gemma":[0.5254981,0.0007120842,0.44225544,0.00030332024,0.00013751809,0.0001738607,0.00044668518,0.001846451,0.028626574],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922454,0.00015427939,0.00007838934,0.00018302603,0.0002635811,0.00009617184],"domain_scores_gemma":[0.9985719,0.00023915022,0.00010285419,0.0005977374,0.0003480221,0.0001403214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097377016,0.00037988526,0.0003845827,0.00040937035,0.00042723498,0.0017456574,0.0010550789,0.00035961304,0.0029224784],"category_scores_gemma":[0.002162964,0.0003714876,0.00044276007,0.00051742856,0.0009714659,0.0014811751,0.0010991027,0.001427209,0.0007558517],"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.0022840165,0.00065058557,0.006106026,0.0007685645,0.00019254744,0.000683968,0.0012555826,0.03269932,0.31959456,0.18521193,0.01222747,0.43832546],"study_design_scores_gemma":[0.0004440673,0.0012049681,0.0032358367,0.00024543024,0.0002439131,0.0010041281,0.00015766727,0.45099005,0.30951768,0.035084084,0.19771637,0.00015578269],"about_ca_topic_score_codex":0.0017918813,"about_ca_topic_score_gemma":0.0022663386,"teacher_disagreement_score":0.0029224784,"about_ca_system_score_codex":0.00067688775,"about_ca_system_score_gemma":0.0015473762,"threshold_uncertainty_score":0.009776652},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10803443,0.0010651908,0.8758133,0.00033829472,0.00007876558,0.000076736455,0.00003146763,0.0018726978,0.0126891015],"genre_scores_gemma":[0.60419226,0.0006874937,0.39177728,0.00010502084,0.000043140317,0.00009449564,0.000091266746,0.00040037968,0.002608658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996753,0.00008245491,0.000013743861,0.00005388195,0.00011587081,0.000058844755],"domain_scores_gemma":[0.99944645,0.0001956873,0.0000787785,0.00016833446,0.0000830631,0.000027707523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054610154,0.0005302841,0.00040608502,0.0005426753,0.00048743945,0.00073400856,0.0008758295,0.0003922158,0.0014339349],"category_scores_gemma":[0.0016296486,0.00027861394,0.0004197577,0.00058706047,0.0006570645,0.0011126264,0.00092214503,0.00090030686,0.0003854061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022987882,0.00013257997,0.004122029,0.00018301565,0.00007778943,0.00023269828,0.00029113636,0.5852602,0.08368685,0.074521735,0.0022822449,0.24897982],"study_design_scores_gemma":[0.000018074892,0.0001058531,0.0006795081,0.000019611765,0.000023651522,0.00006580985,0.00004585435,0.96028787,0.01686631,0.015090757,0.006782708,0.000014056697],"about_ca_topic_score_codex":0.0019511833,"about_ca_topic_score_gemma":0.0024176375,"teacher_disagreement_score":0.0019511833,"about_ca_system_score_codex":0.00054758525,"about_ca_system_score_gemma":0.0007394926,"threshold_uncertainty_score":0.004796982},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056409,0.00054115563,0.86443174,0.00078491477,0.0003778996,0.00019076084,0.00035157733,0.019427085,0.05748588],"genre_scores_gemma":[0.60192037,0.0006281012,0.32997802,0.0003625027,0.00023917893,0.00038149452,0.000981252,0.002568995,0.06294009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99846894,0.00041759442,0.00012496831,0.0002477154,0.0005065126,0.0002342383],"domain_scores_gemma":[0.9963552,0.0008786896,0.00025219505,0.0014397068,0.0007790459,0.00029525923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018946148,0.0005813653,0.00038738988,0.0004973483,0.0008237412,0.0028250068,0.0018311205,0.00078525685,0.014752403],"category_scores_gemma":[0.004289933,0.00042277883,0.0005192116,0.00064336084,0.0013348878,0.0039615026,0.0031916667,0.001718352,0.0029411076],"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.0017891297,0.00019660918,0.0032229316,0.0005347915,0.00007879754,0.0009146072,0.0012818049,0.097927555,0.03511595,0.69179887,0.02866881,0.13847013],"study_design_scores_gemma":[0.0002747436,0.00031513916,0.000782768,0.00015987673,0.000094853,0.0005183777,0.00020755829,0.37556896,0.041316573,0.16632472,0.41432092,0.0001156433],"about_ca_topic_score_codex":0.001661042,"about_ca_topic_score_gemma":0.0014399684,"teacher_disagreement_score":0.014752403,"about_ca_system_score_codex":0.0010024097,"about_ca_system_score_gemma":0.0010352999,"threshold_uncertainty_score":0.04935175},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05193672,0.00042471997,0.92056924,0.00021705675,0.000103749226,0.00005612298,0.00019658406,0.014877301,0.011618527],"genre_scores_gemma":[0.34022108,0.00024342035,0.65294343,0.00020066013,0.000046544727,0.0001006935,0.00077152054,0.0016781738,0.003794482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995926,0.00006757591,0.000031351447,0.00007901019,0.0001478215,0.00008158054],"domain_scores_gemma":[0.99922657,0.00025274267,0.00006550599,0.00024333697,0.00017938555,0.00003240618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060753315,0.0009481812,0.00051258685,0.00038116562,0.0003833636,0.0008571592,0.001043135,0.00037078527,0.004263404],"category_scores_gemma":[0.0022313583,0.00041795138,0.0009511658,0.000404705,0.0005630506,0.0013304296,0.0010231287,0.0010167554,0.0014266919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032370645,0.00013215838,0.0043723052,0.00032178164,0.000108213935,0.00023576156,0.0004059569,0.49202633,0.04280592,0.0653356,0.015765058,0.3781672],"study_design_scores_gemma":[0.000014490123,0.00003992493,0.00021734947,0.000013337373,0.000013733647,0.000045145145,0.00002530716,0.9668624,0.015904494,0.011017741,0.0058372235,0.000008907469],"about_ca_topic_score_codex":0.0055771107,"about_ca_topic_score_gemma":0.006609458,"teacher_disagreement_score":0.0055771107,"about_ca_system_score_codex":0.00090671005,"about_ca_system_score_gemma":0.002060088,"threshold_uncertainty_score":0.014262497},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5879393,0.055854797,0.32550478,0.0014789413,0.00088844734,0.00022607179,0.0007144678,0.0030511776,0.024342066],"genre_scores_gemma":[0.94097966,0.005009907,0.04860568,0.00026832995,0.00014066786,0.000082247476,0.0005079303,0.00012209937,0.0042834966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912626,0.00018158609,0.00007711537,0.00023677963,0.00027930763,0.000098971745],"domain_scores_gemma":[0.9978974,0.001107948,0.00018647601,0.00019300128,0.00050280796,0.000112219925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014280438,0.0007434765,0.00079267996,0.00093353796,0.00026108997,0.0012115199,0.0009892875,0.0010176096,0.0020695657],"category_scores_gemma":[0.006384608,0.00019531345,0.00054315507,0.0010172157,0.00044337672,0.0032334495,0.0006256093,0.00076391443,0.0005327018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016796587,0.00039681586,0.008779741,0.0010708171,0.00039061686,0.0005679205,0.00046753485,0.08529372,0.025803309,0.013166409,0.0045188107,0.85786456],"study_design_scores_gemma":[0.000051775307,0.0020534487,0.007878042,0.00014721825,0.00032517742,0.00060087646,0.00029770174,0.95453507,0.018713284,0.009557865,0.005758902,0.000080643564],"about_ca_topic_score_codex":0.004384784,"about_ca_topic_score_gemma":0.0035537872,"teacher_disagreement_score":0.004384784,"about_ca_system_score_codex":0.0006274981,"about_ca_system_score_gemma":0.0007147926,"threshold_uncertainty_score":0.00871855},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37490767,0.021558488,0.41880283,0.007338146,0.005290476,0.0005471331,0.0010306095,0.014308766,0.15621585],"genre_scores_gemma":[0.7698597,0.0039231055,0.15925293,0.0038523588,0.0005328134,0.0002944297,0.0016820963,0.0017429625,0.058859643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990522,0.000071885894,0.000038743343,0.00016815175,0.000418048,0.00025103544],"domain_scores_gemma":[0.9984877,0.000141108,0.00008948857,0.000492316,0.00055222365,0.0002371341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079908775,0.0007493543,0.0005800151,0.0005334223,0.00093550613,0.001353733,0.0024934048,0.0008244975,0.014727673],"category_scores_gemma":[0.0021021282,0.0004448769,0.00063925784,0.0005245199,0.00077517494,0.004040479,0.003230689,0.0016050969,0.004549244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062065304,0.0004039088,0.005242882,0.0012721039,0.0002443737,0.0009985281,0.000794126,0.03142798,0.1631071,0.15879732,0.12047772,0.51661325],"study_design_scores_gemma":[0.00019012336,0.0011386268,0.0034779117,0.00027457095,0.0002601587,0.0017300888,0.0005038601,0.14887045,0.13622233,0.102578014,0.6045853,0.00016847483],"about_ca_topic_score_codex":0.0018996486,"about_ca_topic_score_gemma":0.0040485966,"teacher_disagreement_score":0.014727673,"about_ca_system_score_codex":0.001033534,"about_ca_system_score_gemma":0.0012428588,"threshold_uncertainty_score":0.04926902},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047835026,0.004859315,0.39070043,0.004911876,0.0041223858,0.0018725067,0.008672027,0.047486376,0.48954013],"genre_scores_gemma":[0.23659779,0.003260348,0.37475488,0.0038012706,0.0007803618,0.00067180063,0.01693413,0.0066312253,0.3565682],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99793136,0.00013228599,0.0000566364,0.00038890084,0.001079607,0.00041122775],"domain_scores_gemma":[0.99744415,0.00019344606,0.00009884376,0.00072433805,0.0011862027,0.00035309582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001209187,0.0011585635,0.001455733,0.0023327256,0.0035547651,0.0035138484,0.003162204,0.0012018816,0.117697924],"category_scores_gemma":[0.00328361,0.000612733,0.0009624386,0.0031133594,0.00078313163,0.0026130937,0.0048650824,0.00175231,0.08078305],"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.00067180145,0.00023310461,0.003668578,0.00050454715,0.00006665763,0.0006265499,0.00026275002,0.0058618565,0.016260039,0.036819156,0.34032714,0.59469783],"study_design_scores_gemma":[0.00014734926,0.0003391343,0.0036362223,0.00019398604,0.000091215064,0.0019000128,0.0005697175,0.043779932,0.026811715,0.0276775,0.89464897,0.00020417736],"about_ca_topic_score_codex":0.0046963836,"about_ca_topic_score_gemma":0.011449578,"teacher_disagreement_score":0.117697924,"about_ca_system_score_codex":0.0012264544,"about_ca_system_score_gemma":0.0029820008,"threshold_uncertainty_score":0.3937388},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01176546,0.0005655931,0.7572036,0.00027770997,0.00066382636,0.0001786499,0.0017924961,0.20195845,0.025594227],"genre_scores_gemma":[0.21202871,0.0005958054,0.62013143,0.0009674986,0.000206644,0.0008500938,0.006498803,0.09541099,0.06330996],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996619,0.00006369829,0.000015890182,0.00007439979,0.00012466716,0.00005951268],"domain_scores_gemma":[0.9994098,0.00030156167,0.000023834558,0.00011507401,0.000090393376,0.000059297032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006718225,0.0017116504,0.0012034103,0.00053954544,0.00060643913,0.0016082374,0.003864092,0.0018110271,0.065720886],"category_scores_gemma":[0.0025793703,0.0010281203,0.0011467448,0.00046012056,0.0006082388,0.001392362,0.0014861609,0.0026483173,0.016754204],"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.0032611184,0.0008763385,0.00436572,0.002350787,0.0006489391,0.001012224,0.0007171824,0.17575787,0.038643733,0.06909436,0.24393702,0.45933485],"study_design_scores_gemma":[0.0007761867,0.00020366718,0.0011638482,0.00017467725,0.000092880415,0.00040253866,0.00009366828,0.75344807,0.03659781,0.026420088,0.18047877,0.00014775137],"about_ca_topic_score_codex":0.0032650367,"about_ca_topic_score_gemma":0.0061249756,"teacher_disagreement_score":0.065720886,"about_ca_system_score_codex":0.0006714893,"about_ca_system_score_gemma":0.00097040867,"threshold_uncertainty_score":0.21985829},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053950204,0.000056326957,0.9660447,0.000185067,0.00007092216,0.00007294506,0.00028077743,0.02410645,0.0037877546],"genre_scores_gemma":[0.1201895,0.00021721149,0.8578917,0.00041942383,0.0001084129,0.00045488184,0.0016800016,0.015208754,0.003830159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807286,0.00042451452,0.00024747808,0.00019933686,0.00086309697,0.0001926696],"domain_scores_gemma":[0.9976672,0.0007094578,0.00024428777,0.00061119755,0.00067446614,0.000093484516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020277346,0.0010316427,0.00056285557,0.0008345116,0.00062769424,0.0017858281,0.0015079452,0.0006339514,0.005970522],"category_scores_gemma":[0.006546614,0.0007191237,0.001064018,0.000696021,0.0012834711,0.002852628,0.0019343613,0.0021429434,0.0023915274],"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.00048284675,0.00035314317,0.0036901387,0.0010769437,0.00009803987,0.00077650364,0.0011490434,0.09748076,0.082085766,0.5319596,0.04864609,0.23220107],"study_design_scores_gemma":[0.00015288217,0.00019784915,0.0009656602,0.00024403329,0.00006445527,0.00058571366,0.00013575362,0.46893916,0.1448989,0.19643413,0.18724008,0.00014128386],"about_ca_topic_score_codex":0.000778096,"about_ca_topic_score_gemma":0.0011524645,"teacher_disagreement_score":0.005970522,"about_ca_system_score_codex":0.0007864438,"about_ca_system_score_gemma":0.0028123974,"threshold_uncertainty_score":0.019973338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1818485,0.0019473254,0.7893584,0.000671489,0.00012956015,0.00009124558,0.000099083554,0.0021280937,0.023726225],"genre_scores_gemma":[0.8167438,0.0008412001,0.17859468,0.00008991269,0.000045236855,0.00007885679,0.0001092611,0.00015907254,0.003337886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994825,0.00012038732,0.00002034745,0.00006121833,0.00025890846,0.00005652415],"domain_scores_gemma":[0.99924845,0.00032877145,0.000061494946,0.00016003798,0.00017884134,0.000022435652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060237246,0.00045071603,0.00049591303,0.000621024,0.00042935842,0.0007424881,0.00089081057,0.00032380363,0.0016675426],"category_scores_gemma":[0.00263237,0.00019631175,0.00036359963,0.0012866644,0.0004935469,0.0013729373,0.00048278118,0.0005055368,0.00044087326],"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.00066295604,0.00022380306,0.0060154176,0.0004103614,0.00010490718,0.00042831388,0.00023647874,0.6095862,0.03384274,0.104123145,0.005200087,0.23916565],"study_design_scores_gemma":[0.000010360221,0.00004989932,0.00041938713,0.0000055922305,0.000008668242,0.000044866643,0.000014618349,0.987145,0.006752099,0.0037771524,0.001766186,0.0000061428827],"about_ca_topic_score_codex":0.0023479033,"about_ca_topic_score_gemma":0.0011184893,"teacher_disagreement_score":0.0023479033,"about_ca_system_score_codex":0.00083438,"about_ca_system_score_gemma":0.0005864696,"threshold_uncertainty_score":0.006053865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19624844,0.0010498329,0.7365111,0.0013378696,0.00030098532,0.00024800844,0.0006530866,0.037553225,0.02609751],"genre_scores_gemma":[0.52482295,0.00056719634,0.4663667,0.00046313534,0.000092068345,0.00040797205,0.0011263433,0.002220958,0.0039327196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994367,0.00012870842,0.000024408231,0.00006656577,0.0002609889,0.00008261727],"domain_scores_gemma":[0.9990715,0.00026572574,0.000058971917,0.00032979308,0.00019288702,0.0000811338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009418269,0.00060001574,0.0005325401,0.00045878737,0.00075319025,0.0011312196,0.0017077285,0.0005926365,0.002302359],"category_scores_gemma":[0.0028745146,0.00031696772,0.00036736394,0.001334509,0.00091152306,0.0015912584,0.0022642005,0.0014542429,0.000834677],"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.0008540522,0.00026931777,0.008979833,0.0007027078,0.00013178756,0.000678635,0.00065668416,0.6504613,0.05921684,0.07951881,0.031431537,0.16709845],"study_design_scores_gemma":[0.00017289339,0.00017777228,0.0013259655,0.000051793428,0.000022599592,0.0001430795,0.0001056984,0.9003746,0.029021446,0.030241037,0.03831471,0.0000484576],"about_ca_topic_score_codex":0.0033901185,"about_ca_topic_score_gemma":0.004003045,"teacher_disagreement_score":0.0033901185,"about_ca_system_score_codex":0.000673756,"about_ca_system_score_gemma":0.0012374917,"threshold_uncertainty_score":0.007702112},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03043762,0.0024037305,0.8171753,0.0007561409,0.00080535014,0.00055917865,0.00672643,0.12685938,0.014276839],"genre_scores_gemma":[0.074688666,0.0004765326,0.8937715,0.00038474606,0.00024273222,0.0005682254,0.014619526,0.0060927714,0.009155323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987166,0.00012205712,0.00010009505,0.0002759849,0.0006141321,0.00017117673],"domain_scores_gemma":[0.9985417,0.0004066367,0.00008782198,0.0004952017,0.0003664491,0.000102208476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085486914,0.0020269002,0.0012776825,0.0026315337,0.0012083759,0.002003996,0.0044293096,0.0014444181,0.016827328],"category_scores_gemma":[0.005487872,0.000721732,0.0012363731,0.003885541,0.00062912237,0.0041669486,0.0026099526,0.0015120497,0.010203876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010910574,0.00033734608,0.0025344137,0.0005913709,0.0001232198,0.00023270176,0.00020516028,0.023154953,0.021550417,0.010267939,0.15065761,0.78925383],"study_design_scores_gemma":[0.0005751427,0.00045694163,0.0021889338,0.0000941626,0.000096273136,0.0007673152,0.0001486096,0.7923195,0.044089776,0.027990935,0.1311136,0.00015890582],"about_ca_topic_score_codex":0.008580616,"about_ca_topic_score_gemma":0.009258342,"teacher_disagreement_score":0.016827328,"about_ca_system_score_codex":0.0013902739,"about_ca_system_score_gemma":0.002338432,"threshold_uncertainty_score":0.05629295},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45116705,0.00074976374,0.5308455,0.0007174222,0.00025548637,0.00006512246,0.000429286,0.0023424502,0.013427995],"genre_scores_gemma":[0.97897846,0.00009398038,0.019472113,0.0000649527,0.000035260797,0.00002295313,0.00008751343,0.00015829883,0.0010864738],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99987185,0.000023183647,0.000007176037,0.00004217925,0.000030982374,0.000024586192],"domain_scores_gemma":[0.99930847,0.00038353496,0.000051190593,0.0001489948,0.000047159072,0.00006062319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002081975,0.000392963,0.0004649085,0.00026119506,0.000315356,0.0007716748,0.0004559981,0.00049897586,0.0025425183],"category_scores_gemma":[0.0021403865,0.00033043142,0.00025630486,0.00039461078,0.00044629155,0.0008687347,0.0007392862,0.00064717274,0.00071886263],"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.00048445052,0.00016597203,0.003091074,0.00013798302,0.00008663147,0.00029335826,0.00012350861,0.034917668,0.8072556,0.01703452,0.0026271637,0.13378209],"study_design_scores_gemma":[0.00005453239,0.00023672119,0.012840179,0.000024516277,0.000057341735,0.00053552946,0.00010076955,0.77343136,0.17735015,0.031159533,0.004152087,0.00005722308],"about_ca_topic_score_codex":0.0006085725,"about_ca_topic_score_gemma":0.0012095764,"teacher_disagreement_score":0.0025425183,"about_ca_system_score_codex":0.00029699106,"about_ca_system_score_gemma":0.00036826177,"threshold_uncertainty_score":0.008505583},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008328763,0.13723767,0.6639836,0.0024026178,0.0033232912,0.00019285972,0.0010753701,0.003942332,0.17951354],"genre_scores_gemma":[0.15451701,0.13875982,0.2686798,0.000965623,0.0026857674,0.0005289959,0.0024129401,0.0017849493,0.42966506],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99977726,0.00003597104,0.000010351917,0.00002631936,0.00013595916,0.000014052127],"domain_scores_gemma":[0.99965227,0.0001440856,0.000022458938,0.000073720126,0.00009008111,0.000017416602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023887034,0.0012092354,0.0010621698,0.0006559901,0.00023132199,0.0013984859,0.0010125532,0.00090744765,0.01544727],"category_scores_gemma":[0.0009349991,0.00075827,0.00041790516,0.001758371,0.00052512815,0.0015594712,0.0006644359,0.0013145136,0.008299542],"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.00006185348,0.000104966755,0.0005166891,0.0011625927,0.00007179612,0.00012020871,0.000103624596,0.27252278,0.006205564,0.13696,0.1712282,0.41094175],"study_design_scores_gemma":[0.000030513494,0.00010390712,0.0010070404,0.0003158383,0.000053032065,0.00055619574,0.000053527016,0.3933851,0.0034576932,0.13779996,0.46319804,0.000039144325],"about_ca_topic_score_codex":0.0013635285,"about_ca_topic_score_gemma":0.0019518149,"teacher_disagreement_score":0.01544727,"about_ca_system_score_codex":0.00049248035,"about_ca_system_score_gemma":0.00075327454,"threshold_uncertainty_score":0.051676214},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2859381,0.00086082006,0.6733925,0.00027179308,0.00013054014,0.00025882368,0.00040087473,0.02836482,0.010381665],"genre_scores_gemma":[0.7888826,0.00037963604,0.194252,0.0002878938,0.000056535027,0.00022617614,0.0010565082,0.002731799,0.012126847],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994941,0.00006069213,0.00003087065,0.000117179865,0.00022147266,0.00007562715],"domain_scores_gemma":[0.9990055,0.00026785297,0.00013527063,0.0003798204,0.00015312027,0.00005839563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035981397,0.0008027148,0.00038265798,0.0005963123,0.00028867688,0.0003350606,0.0012585027,0.00030264806,0.0020860576],"category_scores_gemma":[0.0014870862,0.0003368672,0.0005498918,0.00035941458,0.0005548656,0.0009024394,0.0012971616,0.00070132077,0.00084582146],"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.0009402746,0.00028880138,0.010851667,0.0003821646,0.00012543301,0.000657082,0.00084122614,0.06383995,0.390679,0.009625416,0.011783943,0.5099851],"study_design_scores_gemma":[0.00014301576,0.00084806065,0.009481553,0.000068930865,0.00018125963,0.0012005563,0.0003059937,0.53783965,0.37321225,0.011096579,0.0655356,0.000086549415],"about_ca_topic_score_codex":0.00106051,"about_ca_topic_score_gemma":0.0026676739,"teacher_disagreement_score":0.0020860576,"about_ca_system_score_codex":0.00037715814,"about_ca_system_score_gemma":0.00061819237,"threshold_uncertainty_score":0.006978512},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14245768,0.0007366438,0.80535275,0.0002709814,0.00022249162,0.0002133871,0.0005014086,0.023266984,0.026977625],"genre_scores_gemma":[0.58414185,0.00028178853,0.40083513,0.00015878164,0.00005464546,0.00027913568,0.0016404251,0.0040842462,0.008524052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995453,0.000054939053,0.0000277878,0.00005769628,0.00020966944,0.00010461934],"domain_scores_gemma":[0.99922216,0.00018295649,0.00006053355,0.00018383905,0.0002785837,0.00007192014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036394157,0.00070145074,0.00045631177,0.00047919515,0.00058504764,0.0009546812,0.001631212,0.0005388886,0.0042248336],"category_scores_gemma":[0.002392843,0.0003535589,0.00042985787,0.0007451156,0.0003715988,0.0009873619,0.001186106,0.0011314243,0.0019337807],"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.0008128661,0.00069327967,0.008444147,0.0005372865,0.00012103245,0.00097131496,0.0008083596,0.42715538,0.06913324,0.05485272,0.037884995,0.39858538],"study_design_scores_gemma":[0.000054082782,0.000059225567,0.0012126158,0.000024616336,0.000017866443,0.00010079943,0.00005781715,0.956151,0.023959477,0.0074812933,0.010858705,0.000022490254],"about_ca_topic_score_codex":0.0039334954,"about_ca_topic_score_gemma":0.0053584552,"teacher_disagreement_score":0.0042248336,"about_ca_system_score_codex":0.0006325039,"about_ca_system_score_gemma":0.001068204,"threshold_uncertainty_score":0.014133513},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4372528,0.0003119841,0.4939612,0.0009524505,0.00028778592,0.00032019778,0.0007306892,0.028302697,0.037880152],"genre_scores_gemma":[0.83769023,0.00010159034,0.15308213,0.00024858737,0.000029343442,0.00024396463,0.00081855274,0.0010665224,0.006719065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995084,0.00011072424,0.000023555067,0.00009200474,0.00019006155,0.00007527708],"domain_scores_gemma":[0.9993405,0.00015199222,0.000040863,0.0002017547,0.00020185496,0.00006314841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062605186,0.00047419273,0.0002745596,0.0003036964,0.00064274034,0.0008219966,0.0015729405,0.00035461716,0.0028204808],"category_scores_gemma":[0.0019196795,0.0003206481,0.00024670613,0.00052462664,0.0005276888,0.0011229572,0.00066992326,0.0009497146,0.0005267175],"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.0021262323,0.0008867614,0.013547547,0.00044863817,0.00014409167,0.00081888854,0.0012789846,0.5579547,0.181443,0.05193394,0.040933963,0.14848323],"study_design_scores_gemma":[0.00014966144,0.00033514565,0.0019322735,0.00001735556,0.00002352309,0.00009771208,0.00010235382,0.9411275,0.037851144,0.004691804,0.013632063,0.000039496383],"about_ca_topic_score_codex":0.0050833253,"about_ca_topic_score_gemma":0.007040836,"teacher_disagreement_score":0.0050833253,"about_ca_system_score_codex":0.000888697,"about_ca_system_score_gemma":0.001356834,"threshold_uncertainty_score":0.010107458},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083647564,0.02639509,0.70955473,0.0011044216,0.0027658346,0.00025403147,0.0018654265,0.019499704,0.15491319],"genre_scores_gemma":[0.52962714,0.013141283,0.29465276,0.00073899666,0.0015425445,0.0004367201,0.0032585298,0.0052730143,0.15132906],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929154,0.00008880273,0.000072028444,0.00006778297,0.00036462976,0.00011509244],"domain_scores_gemma":[0.9985475,0.0004986551,0.000074418844,0.0005780055,0.00023925069,0.00006211686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044699956,0.0007136042,0.0012645418,0.0018280395,0.0009841978,0.0031105692,0.0017375223,0.0004698385,0.016303884],"category_scores_gemma":[0.0024116049,0.0005380161,0.00038949877,0.005098926,0.0009476849,0.0068123853,0.0024978505,0.00090214016,0.0041872533],"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.00048866414,0.000075029755,0.0005944335,0.00071215717,0.00004123554,0.00027706,0.00032961814,0.01111017,0.014772856,0.40037376,0.049017366,0.5222076],"study_design_scores_gemma":[0.000107128195,0.00026112914,0.0007667444,0.0002625387,0.0001021028,0.0006317235,0.00026301562,0.07885406,0.040992092,0.6775062,0.20016299,0.00009029809],"about_ca_topic_score_codex":0.0008093833,"about_ca_topic_score_gemma":0.0013797843,"teacher_disagreement_score":0.016303884,"about_ca_system_score_codex":0.0008789046,"about_ca_system_score_gemma":0.00070951355,"threshold_uncertainty_score":0.054541945},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040372033,0.014813447,0.022660496,0.032923874,0.12119837,0.0022050971,0.02685646,0.011858409,0.7634466],"genre_scores_gemma":[0.017171666,0.0050450335,0.004698351,0.004126277,0.017498512,0.0008073655,0.009901397,0.003615929,0.93713546],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999353,0.000104549945,0.000027850552,0.00016080443,0.00020924464,0.00014463808],"domain_scores_gemma":[0.9976145,0.00026988273,0.0000683299,0.00028515465,0.0006748748,0.0010871898],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015935656,0.0015017985,0.0017732362,0.00073505257,0.0019350842,0.0051305685,0.0014537832,0.0036837573,0.7555791],"category_scores_gemma":[0.002680143,0.0004693063,0.0016653333,0.00097182055,0.00040870803,0.0016055638,0.003083642,0.0031892871,0.5120976],"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.00031842728,0.00006525798,0.000104016464,0.00016649849,0.0000152354205,0.000028241146,0.000015311602,0.00011726502,0.0011384375,0.0009952737,0.96882945,0.028206456],"study_design_scores_gemma":[0.000092325274,0.00012193225,0.00045498036,0.00009958333,0.000013721369,0.000076157135,0.000019830508,0.0003419872,0.0010444731,0.0015353824,0.996185,0.0000146341235],"about_ca_topic_score_codex":0.0014333574,"about_ca_topic_score_gemma":0.0026634422,"teacher_disagreement_score":0.24442089,"about_ca_system_score_codex":0.001080112,"about_ca_system_score_gemma":0.0017274678,"threshold_uncertainty_score":0.3486367},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009133654,0.00039169536,0.9149687,0.00033031715,0.000054916203,0.0001788226,0.0006183761,0.07172661,0.0025969427],"genre_scores_gemma":[0.11957104,0.00032330645,0.8637127,0.00045880725,0.00004461072,0.00048624063,0.0036036365,0.007755216,0.0040445044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974554,0.00074490206,0.00013006576,0.00055115216,0.0009274656,0.00019097947],"domain_scores_gemma":[0.99733245,0.0012160213,0.0002131202,0.0008529891,0.00033793124,0.00004749825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015276537,0.0022462758,0.00091451395,0.0015629504,0.000699057,0.0012702196,0.0033412026,0.00095856027,0.0063654734],"category_scores_gemma":[0.005026017,0.0010348596,0.0032062682,0.001031566,0.0013570447,0.0032168252,0.0028191844,0.0029310794,0.0023828084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044922234,0.00031583823,0.003237555,0.0013020515,0.00023502248,0.00046354628,0.0007039465,0.23846681,0.0417225,0.049912564,0.04878049,0.6144105],"study_design_scores_gemma":[0.00009211365,0.00012255114,0.0003554396,0.000059164166,0.00008543854,0.00015528954,0.000106044,0.9094436,0.026384234,0.037430823,0.025717856,0.000047399404],"about_ca_topic_score_codex":0.005327521,"about_ca_topic_score_gemma":0.012201033,"teacher_disagreement_score":0.0063654734,"about_ca_system_score_codex":0.0012008683,"about_ca_system_score_gemma":0.00326255,"threshold_uncertainty_score":0.021294653},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010549922,0.0025255086,0.0019512927,0.4440096,0.44712296,0.0004641374,0.002554969,0.0021567638,0.09815981],"genre_scores_gemma":[0.00819704,0.002094815,0.0019342763,0.33836633,0.11060438,0.0006957288,0.0018327897,0.0013641963,0.53491044],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99446964,0.0011927268,0.0002797695,0.00074151164,0.002471993,0.0008442887],"domain_scores_gemma":[0.9594763,0.0063492,0.0013794239,0.0013178128,0.015984263,0.015493027],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.005579494,0.0014818092,0.0010502192,0.0011774163,0.0036378892,0.008498517,0.0021117546,0.01230512,0.3727279],"category_scores_gemma":[0.0488232,0.0004719306,0.0011879813,0.0006378438,0.0012370062,0.0053682867,0.004971372,0.01117264,0.25625324],"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.000029744826,0.000013249722,0.00006857009,0.000041222313,0.0000016007345,0.00006421465,0.000056587513,0.0000070444075,0.0000555207,0.00048236252,0.98970515,0.009474738],"study_design_scores_gemma":[0.000018698593,0.000031347085,0.00017506944,0.000092894734,0.0000031254565,0.00014002481,0.00024679638,0.000024009147,0.000075429314,0.0007781654,0.9984028,0.000011678381],"about_ca_topic_score_codex":0.00093041494,"about_ca_topic_score_gemma":0.0016861631,"teacher_disagreement_score":0.6272721,"about_ca_system_score_codex":0.002440411,"about_ca_system_score_gemma":0.0052348324,"threshold_uncertainty_score":0.8947275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013552367,0.000043885633,0.97860914,0.00020120929,0.000032724445,0.000058885074,0.00012631236,0.0042269817,0.0031484647],"genre_scores_gemma":[0.2788009,0.000094246374,0.7120872,0.00034386845,0.000058785492,0.00018207796,0.0005040829,0.001757632,0.0061712014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881893,0.00025432155,0.00011270448,0.00029094168,0.00037542984,0.000147604],"domain_scores_gemma":[0.99851996,0.0006180811,0.00012304336,0.00041762274,0.00027725633,0.000044061904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011461377,0.0005811163,0.00041984377,0.00062031735,0.0006240347,0.0014409408,0.0015010429,0.0005585715,0.0061341925],"category_scores_gemma":[0.0030035945,0.00055577257,0.0012589847,0.00033967415,0.0017690933,0.002399577,0.002025582,0.0020411536,0.0019578405],"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.0003584163,0.00014938798,0.0025712268,0.00058240135,0.000059271548,0.00044821273,0.0013525891,0.038319226,0.09882574,0.61829066,0.012086022,0.22695684],"study_design_scores_gemma":[0.000054530854,0.00017485589,0.0005228049,0.00008548983,0.00006346894,0.0005115725,0.00021833996,0.50080436,0.13005273,0.32345206,0.04397729,0.00008255567],"about_ca_topic_score_codex":0.0014075877,"about_ca_topic_score_gemma":0.002907805,"teacher_disagreement_score":0.0061341925,"about_ca_system_score_codex":0.0011199206,"about_ca_system_score_gemma":0.0015945163,"threshold_uncertainty_score":0.020520866},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04067232,0.014711336,0.6463033,0.005622328,0.002113953,0.00016443648,0.00092329615,0.00081136473,0.28867763],"genre_scores_gemma":[0.5054692,0.014268083,0.1716226,0.002097538,0.0038382434,0.0008344855,0.0014298819,0.0010049271,0.29943502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99950886,0.00014298935,0.000036615198,0.00010747836,0.00014494649,0.00005920052],"domain_scores_gemma":[0.9990075,0.00051489536,0.0001316817,0.0000896794,0.0002032862,0.00005295795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009196593,0.0011806525,0.0012297495,0.0014617807,0.00093679235,0.0027274718,0.0014859105,0.0018849568,0.022389404],"category_scores_gemma":[0.006750829,0.00064223364,0.001083465,0.002079755,0.0018838106,0.0038624078,0.0013286662,0.0030841804,0.005373628],"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.000007288402,0.000012440095,0.000037262365,0.000039115253,0.0000059794647,0.000025973563,0.000098048906,0.0016692933,0.000203017,0.9799238,0.005995054,0.01198286],"study_design_scores_gemma":[0.000011003804,0.0000058921473,0.000054642736,0.000018417993,0.0000056739177,0.00006432215,0.0000296841,0.014603247,0.00013704496,0.97840995,0.0066466792,0.000013439944],"about_ca_topic_score_codex":0.0011384799,"about_ca_topic_score_gemma":0.0012634842,"teacher_disagreement_score":0.022389404,"about_ca_system_score_codex":0.0010432965,"about_ca_system_score_gemma":0.0009021527,"threshold_uncertainty_score":0.07490003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014002997,0.00019784432,0.9812021,0.00019875717,0.000100580575,0.00008319732,0.0001458601,0.0008406655,0.0032279755],"genre_scores_gemma":[0.24040276,0.00018829074,0.7537355,0.00022088284,0.00009093119,0.00046587613,0.00047125242,0.0016347918,0.002789675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984086,0.0003904255,0.00012625159,0.00018569164,0.0007663028,0.00012275095],"domain_scores_gemma":[0.9921442,0.003462132,0.0007061634,0.0007838769,0.002371287,0.000532349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002856367,0.0006829587,0.0006728294,0.0010836181,0.00083934073,0.0010459009,0.0021683336,0.0011795847,0.0028297538],"category_scores_gemma":[0.019273382,0.00043252754,0.0005391393,0.00051761646,0.0009363024,0.0017693454,0.0021423623,0.0018027613,0.00084710034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003533632,0.000121642144,0.0065452955,0.00035922715,0.00008263524,0.00030233996,0.0003311215,0.76917803,0.024671605,0.090435304,0.0069758813,0.1006436],"study_design_scores_gemma":[0.000014736864,0.000023203875,0.00037693,0.000022864988,0.0000051031875,0.000029450195,0.000010743129,0.9833329,0.0038396,0.00966054,0.0026651064,0.000018839679],"about_ca_topic_score_codex":0.0025695248,"about_ca_topic_score_gemma":0.0031563276,"teacher_disagreement_score":0.002856367,"about_ca_system_score_codex":0.0009385022,"about_ca_system_score_gemma":0.0021184394,"threshold_uncertainty_score":0.015106142},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028616488,0.00029946922,0.96128243,0.0001903533,0.00007297472,0.000079506506,0.00016365676,0.0015397657,0.007755402],"genre_scores_gemma":[0.2163966,0.00022301811,0.77713513,0.00007214277,0.000038436207,0.00020509645,0.00049410475,0.00024792447,0.0051874635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997557,0.000047606438,0.00001471981,0.000024977135,0.00012855073,0.00002832913],"domain_scores_gemma":[0.9995394,0.00012674752,0.000041685595,0.000107890795,0.00015297259,0.000031308606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032157692,0.00053074246,0.00046873,0.00058442145,0.00048297035,0.0007055787,0.001022338,0.00052927964,0.0046755983],"category_scores_gemma":[0.0017167897,0.00028475103,0.00039521352,0.0011752397,0.00043919747,0.0007515742,0.0011962617,0.00068554754,0.0015206113],"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.0003251229,0.00019172965,0.0023269607,0.00024002104,0.00007928112,0.00027608027,0.00031737666,0.5141839,0.0210595,0.1320386,0.016810374,0.31215116],"study_design_scores_gemma":[0.000030839932,0.00002373782,0.00010292926,0.000006217566,0.000002620304,0.000030878193,0.000018250981,0.98386616,0.0020801255,0.01106548,0.0027678702,0.0000049314244],"about_ca_topic_score_codex":0.004320608,"about_ca_topic_score_gemma":0.00895718,"teacher_disagreement_score":0.0046755983,"about_ca_system_score_codex":0.00050436525,"about_ca_system_score_gemma":0.0011855452,"threshold_uncertainty_score":0.01564145},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031334687,0.0020776489,0.7946133,0.0083993375,0.0016869329,0.00018559651,0.0026894636,0.12984702,0.029166043],"genre_scores_gemma":[0.12807527,0.0021790406,0.74811697,0.0031972558,0.0007164918,0.0002551185,0.013112404,0.07209416,0.032253258],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975318,0.00052600517,0.00019202598,0.0003969286,0.001104002,0.0002491983],"domain_scores_gemma":[0.99127614,0.0021648454,0.00034639475,0.0034448337,0.0021976558,0.00057008286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003207492,0.0014303944,0.0008572,0.00127668,0.00072826765,0.004456921,0.0029529934,0.0011137011,0.026041353],"category_scores_gemma":[0.008787586,0.00074515434,0.0008738047,0.0017840117,0.0009946176,0.009299543,0.0025981884,0.0022549157,0.011666408],"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.0013097313,0.00031774322,0.0036411048,0.0007657319,0.0001339508,0.00034728096,0.0010887741,0.00711966,0.039710578,0.062397413,0.405649,0.47751895],"study_design_scores_gemma":[0.00031078255,0.00017202001,0.0018671101,0.00045002069,0.000108566586,0.00041903977,0.0004751888,0.07688085,0.09081614,0.075582765,0.752664,0.0002534456],"about_ca_topic_score_codex":0.0026907327,"about_ca_topic_score_gemma":0.0022419665,"teacher_disagreement_score":0.026041353,"about_ca_system_score_codex":0.00097152096,"about_ca_system_score_gemma":0.0012640674,"threshold_uncertainty_score":0.08711702},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038548785,0.022567317,0.36139145,0.0038378597,0.0061156563,0.0001022675,0.00031877385,0.002242185,0.5995697],"genre_scores_gemma":[0.093177274,0.01429779,0.06836063,0.0013258999,0.0030586496,0.00024771813,0.0006754735,0.0012344839,0.81762207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996846,0.000054213368,0.000013402455,0.00009028227,0.000118981356,0.000038726997],"domain_scores_gemma":[0.99979943,0.000055062294,0.000011747323,0.00007129812,0.000042124182,0.000020349147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004017318,0.0011025071,0.0006747028,0.000659813,0.00091403344,0.0020020476,0.0008118257,0.00068022433,0.035022527],"category_scores_gemma":[0.0008911815,0.00053323497,0.00041244604,0.0013126157,0.0012801473,0.002432575,0.0011301199,0.001818342,0.013620253],"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.000059641716,0.000031143467,0.000059426133,0.00015114046,0.0000148799145,0.000035396548,0.00018283358,0.0041884226,0.0036762895,0.74521166,0.0794124,0.1669767],"study_design_scores_gemma":[0.000020901733,0.000041009436,0.0001512353,0.0000748093,0.000018880712,0.00007315011,0.00006366475,0.007798149,0.003495958,0.41058087,0.57766443,0.000016815095],"about_ca_topic_score_codex":0.0014192632,"about_ca_topic_score_gemma":0.0016295857,"teacher_disagreement_score":0.035022527,"about_ca_system_score_codex":0.0012380022,"about_ca_system_score_gemma":0.0010401114,"threshold_uncertainty_score":0.11716205},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025084189,0.0038303377,0.045905154,0.0013677601,0.0007729518,0.00012579428,0.00095627474,0.0015471469,0.9429863],"genre_scores_gemma":[0.022721494,0.007337455,0.031202987,0.0007821977,0.00048233342,0.00015146942,0.002382808,0.00063552265,0.93430364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976546,0.000017947004,0.000009008757,0.000048939353,0.00011347585,0.000045167588],"domain_scores_gemma":[0.9997811,0.00002052884,0.000008966864,0.00003503886,0.0001213878,0.00003310185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022077133,0.00083846267,0.00028154886,0.001110578,0.0011405586,0.0023472903,0.0011084931,0.0007704994,0.16157523],"category_scores_gemma":[0.00055036444,0.00041537004,0.0003157146,0.0012063013,0.0004205205,0.0017816917,0.0010638848,0.0011335302,0.087149255],"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.00005391152,0.000075634314,0.00022136442,0.00046663854,0.000006030567,0.00016334113,0.00036699534,0.0028946407,0.008687314,0.48197848,0.19122471,0.31386092],"study_design_scores_gemma":[0.0000025404354,0.000013271129,0.0000962786,0.000056144567,0.0000026152147,0.000096933,0.000053982065,0.0005166778,0.0009890585,0.01996922,0.9781979,0.0000053287986],"about_ca_topic_score_codex":0.0028013065,"about_ca_topic_score_gemma":0.0045900564,"teacher_disagreement_score":0.16157523,"about_ca_system_score_codex":0.0011062551,"about_ca_system_score_gemma":0.0013804376,"threshold_uncertainty_score":0.540523},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047508825,0.0002458865,0.8671041,0.0005917521,0.00023315373,0.00017107907,0.0029146108,0.0702578,0.0109727625],"genre_scores_gemma":[0.4745387,0.00022609418,0.49471453,0.00078352675,0.00012727892,0.0005908395,0.007674738,0.013704861,0.0076394062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997898,0.000049777424,0.000009879452,0.000046238158,0.000080388534,0.000024050321],"domain_scores_gemma":[0.999456,0.00023046715,0.000046997342,0.00010091898,0.00011883441,0.000046865982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091017096,0.0010826781,0.0004560493,0.00049246626,0.00035460314,0.00076083693,0.0027655936,0.001014223,0.010939031],"category_scores_gemma":[0.003988033,0.0006524797,0.00064068264,0.00037407796,0.00045107797,0.0012448314,0.0013272915,0.0015829825,0.003735711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021959473,0.00008103036,0.0045431512,0.00013641137,0.00016051007,0.0001747129,0.00009199175,0.87132776,0.0044386666,0.009680851,0.031266786,0.077878565],"study_design_scores_gemma":[0.000015698686,0.0000069777593,0.00015209589,0.0000038340277,0.0000024566714,0.000011402525,0.0000033438878,0.9954282,0.0013198458,0.0013769382,0.0016729926,0.000006127389],"about_ca_topic_score_codex":0.005914006,"about_ca_topic_score_gemma":0.0054084463,"teacher_disagreement_score":0.010939031,"about_ca_system_score_codex":0.00088495796,"about_ca_system_score_gemma":0.0010453773,"threshold_uncertainty_score":0.03659469},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11653292,0.0008200287,0.8091642,0.0006846292,0.0001961924,0.0003581432,0.00078026287,0.065204546,0.006259036],"genre_scores_gemma":[0.6245495,0.00042290532,0.3627262,0.0005872576,0.00008513277,0.00017814523,0.0019653407,0.0030486202,0.00643693],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978218,0.00032340738,0.00014310374,0.00050435367,0.0009203745,0.00028696496],"domain_scores_gemma":[0.9933437,0.002002137,0.00083805254,0.0027788056,0.00081803114,0.0002192814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024149443,0.0012803405,0.00066609675,0.0013211136,0.000732555,0.0018161461,0.0015782274,0.00093830057,0.0023021114],"category_scores_gemma":[0.008585745,0.00060236134,0.00076707784,0.00056282734,0.001214642,0.0030759664,0.0022414983,0.0016488801,0.0013596877],"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.001776505,0.00061008625,0.031853087,0.00072801247,0.00024863915,0.0011750831,0.0010111149,0.048111722,0.2205417,0.024930382,0.034127653,0.6348861],"study_design_scores_gemma":[0.00020730044,0.00091492373,0.009017159,0.0001849564,0.00018840427,0.0015201677,0.00032301206,0.5383135,0.36641428,0.031174963,0.051589467,0.00015187296],"about_ca_topic_score_codex":0.0018375228,"about_ca_topic_score_gemma":0.0022416124,"teacher_disagreement_score":0.0024149443,"about_ca_system_score_codex":0.0006705946,"about_ca_system_score_gemma":0.00236818,"threshold_uncertainty_score":0.012771606},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09146377,0.00083683495,0.8662003,0.00029457544,0.00007719669,0.00022530153,0.0015981826,0.030553723,0.008750105],"genre_scores_gemma":[0.59588003,0.00037600298,0.3911742,0.00018994958,0.000039863015,0.00024319145,0.0025164676,0.0037604496,0.005819843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832577,0.0002017277,0.000086585285,0.00032258997,0.00086876936,0.00019444844],"domain_scores_gemma":[0.9965198,0.0010045045,0.00060650153,0.00093548,0.00085578,0.00007802237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007447994,0.0007464766,0.0005612347,0.0029135353,0.00061479706,0.0014639845,0.0012256526,0.00048264614,0.0041457396],"category_scores_gemma":[0.0042384244,0.00044690966,0.0009776293,0.0023288922,0.0008776155,0.0021235389,0.0012179003,0.00079478306,0.0014559701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070802664,0.00038210617,0.03660042,0.0009380214,0.00020038016,0.0009078446,0.0014643199,0.12799296,0.11554026,0.061587505,0.02132732,0.6323508],"study_design_scores_gemma":[0.00005721425,0.00028581684,0.007394742,0.00011476197,0.00011917345,0.00066019583,0.00041529984,0.75798243,0.15846325,0.03839222,0.035997223,0.000117696676],"about_ca_topic_score_codex":0.0040114857,"about_ca_topic_score_gemma":0.0059461123,"teacher_disagreement_score":0.0041457396,"about_ca_system_score_codex":0.0011949787,"about_ca_system_score_gemma":0.0020616357,"threshold_uncertainty_score":0.013868868},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0484826,0.005865771,0.922962,0.00079528365,0.0001738636,0.00019352762,0.00016120198,0.0005244054,0.020841392],"genre_scores_gemma":[0.8200173,0.0063889804,0.16583857,0.00028468593,0.000177999,0.00072852185,0.00025662332,0.0005610931,0.0057461737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983053,0.0005997067,0.000113343085,0.000271543,0.0005550698,0.00015501636],"domain_scores_gemma":[0.99707496,0.001665963,0.00029330427,0.00052158406,0.00037834243,0.00006581393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029813403,0.00070368836,0.00084706926,0.0011163023,0.0007376932,0.001681546,0.001604226,0.000839942,0.004165758],"category_scores_gemma":[0.00830315,0.00043199168,0.0006954631,0.0010452972,0.0025434168,0.0031905216,0.0013064332,0.0015488407,0.0006541493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011304502,0.000085834436,0.0010157833,0.0010621881,0.000077157085,0.000064641754,0.00022677111,0.268826,0.030422531,0.62502676,0.0015849107,0.0714943],"study_design_scores_gemma":[0.000028331813,0.00037722324,0.0007982435,0.00021185345,0.00007776124,0.00016475026,0.00010930874,0.6830055,0.045966927,0.25147456,0.017706066,0.000079508856],"about_ca_topic_score_codex":0.00048575853,"about_ca_topic_score_gemma":0.00048177806,"teacher_disagreement_score":0.004165758,"about_ca_system_score_codex":0.0018864368,"about_ca_system_score_gemma":0.0013039681,"threshold_uncertainty_score":0.015766978},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9743492,0.0004410213,0.016520627,0.00031771237,0.000048698657,0.00011543204,0.0004990977,0.0008695702,0.0068387017],"genre_scores_gemma":[0.98156744,0.00023020977,0.01654061,0.000044394772,0.000013714288,0.00003016647,0.00035706355,0.00022427065,0.0009921422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99829656,0.0006418053,0.00007718446,0.00020966268,0.0004786967,0.00029605918],"domain_scores_gemma":[0.9959125,0.002341527,0.00024965702,0.0004916847,0.0006468506,0.0003578077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012897225,0.00070751517,0.00045665252,0.0011763922,0.0010199852,0.0016485222,0.001613877,0.0011957769,0.0014906994],"category_scores_gemma":[0.0056841257,0.00035503323,0.00043911126,0.0022080569,0.0010283397,0.0011876815,0.0012201808,0.001137293,0.00041183652],"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.0030907376,0.0028655203,0.16904366,0.0014101068,0.00032441024,0.019822389,0.009024758,0.52330065,0.037614714,0.022624047,0.027712157,0.18316683],"study_design_scores_gemma":[0.00022461555,0.0015067941,0.072876126,0.00020057324,0.00013373565,0.003485876,0.00576035,0.84274876,0.03333137,0.009938385,0.029636178,0.0001573237],"about_ca_topic_score_codex":0.008030987,"about_ca_topic_score_gemma":0.007907531,"teacher_disagreement_score":0.008030987,"about_ca_system_score_codex":0.0011871703,"about_ca_system_score_gemma":0.00065354863,"threshold_uncertainty_score":0.015968442},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015772985,0.026148116,0.8327606,0.0016602715,0.004383846,0.0001576827,0.00045623997,0.0040412648,0.12881471],"genre_scores_gemma":[0.024479546,0.027309675,0.71549094,0.0008492949,0.0033392208,0.00064614986,0.0013445034,0.0021753751,0.22436534],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993936,0.0000995032,0.000033787943,0.00008302442,0.00034981297,0.00004028898],"domain_scores_gemma":[0.9994399,0.00020126451,0.00002519868,0.00018082764,0.00012922344,0.000023453395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049538765,0.0018993746,0.0014159523,0.0011863224,0.0006391783,0.002434088,0.001668227,0.0010447024,0.03714444],"category_scores_gemma":[0.0017842266,0.0009769738,0.00065728714,0.003352131,0.00096767995,0.0030888298,0.0014777523,0.0028599792,0.024220996],"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.000085838554,0.00005697493,0.000095908894,0.0007051933,0.00007000722,0.00006945427,0.00006831094,0.022624237,0.0045409678,0.34718606,0.17450142,0.44999555],"study_design_scores_gemma":[0.00004793803,0.00005398763,0.00018599987,0.0001314806,0.000043559412,0.00022150492,0.00002397378,0.07018781,0.0029070447,0.43304214,0.49312994,0.000024617759],"about_ca_topic_score_codex":0.000498467,"about_ca_topic_score_gemma":0.0006005701,"teacher_disagreement_score":0.03714444,"about_ca_system_score_codex":0.00067434116,"about_ca_system_score_gemma":0.0007575427,"threshold_uncertainty_score":0.124260545},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015772985,0.026148116,0.8327606,0.0016602715,0.004383846,0.0001576827,0.00045623997,0.0040412648,0.12881471],"genre_scores_gemma":[0.024479546,0.027309675,0.71549094,0.0008492949,0.0033392208,0.00064614986,0.0013445034,0.0021753751,0.22436534],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993936,0.0000995032,0.000033787943,0.00008302442,0.00034981297,0.00004028898],"domain_scores_gemma":[0.9994399,0.00020126451,0.00002519868,0.00018082764,0.00012922344,0.000023453395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049538765,0.0018993746,0.0014159523,0.0011863224,0.0006391783,0.002434088,0.001668227,0.0010447024,0.03714444],"category_scores_gemma":[0.0017842266,0.0009769738,0.00065728714,0.003352131,0.00096767995,0.0030888298,0.0014777523,0.0028599792,0.024220996],"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.000085838554,0.00005697493,0.000095908894,0.0007051933,0.00007000722,0.00006945427,0.00006831094,0.022624237,0.0045409678,0.34718606,0.17450142,0.44999555],"study_design_scores_gemma":[0.00004793803,0.00005398763,0.00018599987,0.0001314806,0.000043559412,0.00022150492,0.00002397378,0.07018781,0.0029070447,0.43304214,0.49312994,0.000024617759],"about_ca_topic_score_codex":0.000498467,"about_ca_topic_score_gemma":0.0006005701,"teacher_disagreement_score":0.03714444,"about_ca_system_score_codex":0.00067434116,"about_ca_system_score_gemma":0.0007575427,"threshold_uncertainty_score":0.124260545},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5040509,0.00080624555,0.41642678,0.0003772134,0.00024386746,0.00022099083,0.0014164113,0.066272505,0.010184958],"genre_scores_gemma":[0.89469546,0.00021082434,0.09904346,0.0001097263,0.00003087352,0.00010161224,0.0012538208,0.0016380011,0.0029163347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983753,0.00028246385,0.000079693105,0.00025703767,0.00077272777,0.00023263755],"domain_scores_gemma":[0.99680436,0.0009750545,0.00026527324,0.0012721367,0.00051568064,0.0001675304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058113434,0.00086345273,0.00056646037,0.0010991713,0.00064869184,0.0010419571,0.0016210929,0.0005340152,0.0026109074],"category_scores_gemma":[0.005520784,0.0004997584,0.000336043,0.0015853001,0.000655866,0.0012907664,0.00091658003,0.0010046153,0.0011636879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002330378,0.0007393068,0.033699732,0.00069279387,0.0001732115,0.0008834052,0.0014575813,0.074985504,0.3482297,0.013942485,0.024469769,0.49839607],"study_design_scores_gemma":[0.00009560247,0.0004934851,0.016796568,0.00006605746,0.00006626056,0.00038515637,0.00026712072,0.6077432,0.3504131,0.0052206065,0.01834088,0.00011187736],"about_ca_topic_score_codex":0.005283982,"about_ca_topic_score_gemma":0.0069191386,"teacher_disagreement_score":0.005283982,"about_ca_system_score_codex":0.0009564989,"about_ca_system_score_gemma":0.0014421832,"threshold_uncertainty_score":0.010506451},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11403072,0.0010977004,0.8343216,0.0012214889,0.0005171813,0.000119200624,0.00020411472,0.007343857,0.041144144],"genre_scores_gemma":[0.47037077,0.0004500971,0.51943916,0.0003101776,0.00006985185,0.00010891623,0.00033754462,0.0006800743,0.008233425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997528,0.000047978716,0.000013198415,0.000041886593,0.00010730036,0.000036804526],"domain_scores_gemma":[0.99968815,0.00007091276,0.000026695781,0.00010282119,0.00008793672,0.000023544973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002308078,0.00037682784,0.00041684066,0.0003594348,0.00047749758,0.0007646297,0.0007180859,0.00041871783,0.0035328954],"category_scores_gemma":[0.000878278,0.00022356787,0.00037549372,0.0005611754,0.00037199882,0.0006342527,0.0004862454,0.00095118576,0.00087615574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004054532,0.00019028073,0.003000311,0.00020268417,0.00009460072,0.00033699468,0.00025290862,0.5141421,0.09118155,0.06178077,0.022828763,0.3055835],"study_design_scores_gemma":[0.00002841363,0.00006169644,0.00052150537,0.000012230506,0.000013153631,0.000055774613,0.00002505878,0.95979923,0.010342497,0.007936302,0.021193812,0.000010349945],"about_ca_topic_score_codex":0.008122096,"about_ca_topic_score_gemma":0.011757248,"teacher_disagreement_score":0.008122096,"about_ca_system_score_codex":0.0009730796,"about_ca_system_score_gemma":0.0014307867,"threshold_uncertainty_score":0.01614964},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01944941,0.00069523166,0.95531535,0.00024969666,0.00028225264,0.000102709135,0.00022887356,0.01654135,0.0071350564],"genre_scores_gemma":[0.2967657,0.000496094,0.688329,0.0005237731,0.00017153128,0.0003377002,0.00072960014,0.004065376,0.008581207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995322,0.00010081384,0.00004021556,0.00008209563,0.00017087303,0.00007376219],"domain_scores_gemma":[0.998919,0.00046086992,0.00007741421,0.00025640574,0.00020189321,0.00008443486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008548468,0.0006981369,0.0006171951,0.0005500378,0.00067122886,0.0010161671,0.0017186718,0.0006407312,0.007670871],"category_scores_gemma":[0.0034103375,0.00047181727,0.00062462443,0.000730003,0.0011869627,0.0019036244,0.0016119013,0.0014569694,0.0019448373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013126396,0.00024612457,0.0034728188,0.00062801107,0.0000956235,0.00064243685,0.0007652846,0.20041114,0.051430523,0.20744309,0.042999577,0.4905528],"study_design_scores_gemma":[0.00019473924,0.00019506359,0.00035874572,0.00008807714,0.00002986967,0.00022009721,0.000063215644,0.8143444,0.041302223,0.10143388,0.041702893,0.00006674643],"about_ca_topic_score_codex":0.0027200177,"about_ca_topic_score_gemma":0.004105977,"teacher_disagreement_score":0.007670871,"about_ca_system_score_codex":0.000937057,"about_ca_system_score_gemma":0.0013875286,"threshold_uncertainty_score":0.025661647},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015278111,0.00004738457,0.97565687,0.0001953504,0.000035530447,0.000069359616,0.00015070738,0.005214943,0.003351748],"genre_scores_gemma":[0.29000407,0.00009220714,0.7003414,0.00034111325,0.000052774667,0.00018250661,0.0005491168,0.0018685022,0.0065682675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896,0.00020417394,0.00010010645,0.0002645467,0.0003299941,0.00014113409],"domain_scores_gemma":[0.99860054,0.00057958066,0.00011582364,0.0003760378,0.00028439774,0.00004358811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001056995,0.000585685,0.00040518967,0.0006016544,0.0006040558,0.0014112963,0.0014843422,0.000549448,0.006608446],"category_scores_gemma":[0.0027656935,0.00054355926,0.0012509944,0.00029908976,0.0016598112,0.0023827336,0.0019086193,0.0018989769,0.00204649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041735914,0.00016962731,0.0031254138,0.0006850985,0.00006684911,0.00053842063,0.0016539965,0.038346197,0.122420266,0.56726164,0.01323509,0.2520801],"study_design_scores_gemma":[0.00005805334,0.0002187818,0.0006320882,0.00010259662,0.00007457652,0.00063993316,0.0002791883,0.51081055,0.16057248,0.27304983,0.05346424,0.00009761031],"about_ca_topic_score_codex":0.0015612064,"about_ca_topic_score_gemma":0.0032654451,"teacher_disagreement_score":0.006608446,"about_ca_system_score_codex":0.0010600636,"about_ca_system_score_gemma":0.0016563461,"threshold_uncertainty_score":0.022107482},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7317316,0.0006154464,0.2587758,0.0003621147,0.000030057157,0.000051754294,0.00021861681,0.002306636,0.005907931],"genre_scores_gemma":[0.9751296,0.00018886077,0.0239503,0.00003056739,0.0000071628624,0.00002500788,0.000107394946,0.00012311859,0.00043784114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99948955,0.00011390234,0.00002924194,0.00011785008,0.00017413542,0.000075414195],"domain_scores_gemma":[0.9990989,0.00042284757,0.00013674865,0.0001733036,0.0001278626,0.00004034422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051569636,0.00035108818,0.00027724163,0.0007018075,0.0003256416,0.0008721066,0.00053684687,0.00028535957,0.0006405001],"category_scores_gemma":[0.0043401807,0.00030635082,0.00013960453,0.00063244783,0.00046553934,0.0014835678,0.00033729477,0.0005471504,0.00018756531],"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.00040373678,0.0002765928,0.050971657,0.00030915448,0.00003865129,0.00032824787,0.0021905773,0.58534634,0.09029005,0.026085,0.00320301,0.24055703],"study_design_scores_gemma":[0.000010579431,0.000116715455,0.019287642,0.000030435089,0.000012261183,0.00013066003,0.00031653309,0.9434887,0.022216711,0.009951673,0.004406254,0.000031870095],"about_ca_topic_score_codex":0.004121408,"about_ca_topic_score_gemma":0.0033810635,"teacher_disagreement_score":0.004121408,"about_ca_system_score_codex":0.00064117345,"about_ca_system_score_gemma":0.0006017286,"threshold_uncertainty_score":0.008194864},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16108403,0.0027694765,0.7896066,0.0007623651,0.0004989928,0.00020173712,0.0006026061,0.011841048,0.032633226],"genre_scores_gemma":[0.69396293,0.0004494701,0.29435036,0.00031940924,0.000054500368,0.00016898126,0.0006886087,0.00023724575,0.009768477],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996276,0.000050158593,0.00003194285,0.000085008476,0.00014341783,0.00006178138],"domain_scores_gemma":[0.99954873,0.000057918318,0.00004017107,0.0001114269,0.00020295705,0.000038842718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036088377,0.00066465186,0.0003631839,0.00061169756,0.0004510412,0.0009353658,0.0019932503,0.00042271838,0.006042855],"category_scores_gemma":[0.0012248451,0.00031144937,0.0003462701,0.0008143224,0.00032725657,0.0011472786,0.0006598718,0.00072234194,0.0013026549],"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.0019660664,0.00027017784,0.00769399,0.0007547834,0.00027038946,0.00065938366,0.00043103,0.16681272,0.124205664,0.087454475,0.054293662,0.55518776],"study_design_scores_gemma":[0.00013121427,0.0005769581,0.0012401403,0.00007590552,0.000098449156,0.00040331442,0.00007031094,0.8889613,0.052680474,0.01518279,0.04050946,0.000069678135],"about_ca_topic_score_codex":0.004423982,"about_ca_topic_score_gemma":0.008230156,"teacher_disagreement_score":0.006042855,"about_ca_system_score_codex":0.0011393212,"about_ca_system_score_gemma":0.0010619148,"threshold_uncertainty_score":0.020215392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015772985,0.026148116,0.8327606,0.0016602715,0.004383846,0.0001576827,0.00045623997,0.0040412648,0.12881471],"genre_scores_gemma":[0.024479546,0.027309675,0.71549094,0.0008492949,0.0033392208,0.00064614986,0.0013445034,0.0021753751,0.22436534],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993936,0.0000995032,0.000033787943,0.00008302442,0.00034981297,0.00004028898],"domain_scores_gemma":[0.9994399,0.00020126451,0.00002519868,0.00018082764,0.00012922344,0.000023453395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049538765,0.0018993746,0.0014159523,0.0011863224,0.0006391783,0.002434088,0.001668227,0.0010447024,0.03714444],"category_scores_gemma":[0.0017842266,0.0009769738,0.00065728714,0.003352131,0.00096767995,0.0030888298,0.0014777523,0.0028599792,0.024220996],"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.000085838554,0.00005697493,0.000095908894,0.0007051933,0.00007000722,0.00006945427,0.00006831094,0.022624237,0.0045409678,0.34718606,0.17450142,0.44999555],"study_design_scores_gemma":[0.00004793803,0.00005398763,0.00018599987,0.0001314806,0.000043559412,0.00022150492,0.00002397378,0.07018781,0.0029070447,0.43304214,0.49312994,0.000024617759],"about_ca_topic_score_codex":0.000498467,"about_ca_topic_score_gemma":0.0006005701,"teacher_disagreement_score":0.03714444,"about_ca_system_score_codex":0.00067434116,"about_ca_system_score_gemma":0.0007575427,"threshold_uncertainty_score":0.124260545},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16397296,0.0017072898,0.19362237,0.0025661925,0.00086938986,0.0011352068,0.007858673,0.05380944,0.57445854],"genre_scores_gemma":[0.5843789,0.0005482111,0.15327598,0.0011986548,0.0001863585,0.00085252133,0.012775025,0.002748584,0.24403583],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99963987,0.00003126109,0.000011139748,0.00003834736,0.00020931348,0.00007015899],"domain_scores_gemma":[0.99965465,0.000032681004,0.00002405549,0.000064308326,0.00015794784,0.00006638697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054109073,0.00046777728,0.00025690036,0.00036963067,0.00036096407,0.0006949853,0.00086906384,0.00041349974,0.03512366],"category_scores_gemma":[0.0007576798,0.00035968967,0.00021465981,0.00047760474,0.00017750532,0.0006603065,0.0007459817,0.0011344159,0.011939556],"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.0019803373,0.00034018912,0.0060537294,0.00041881224,0.00007064919,0.0003987095,0.00045948423,0.014621114,0.13434087,0.097481616,0.4925247,0.25130978],"study_design_scores_gemma":[0.00026022588,0.0012600183,0.0066008028,0.000053815536,0.000033118733,0.00078463164,0.000060836413,0.055182494,0.05976645,0.0067536156,0.8691591,0.00008498812],"about_ca_topic_score_codex":0.0009075319,"about_ca_topic_score_gemma":0.0015476046,"teacher_disagreement_score":0.03512366,"about_ca_system_score_codex":0.00075015204,"about_ca_system_score_gemma":0.0010960794,"threshold_uncertainty_score":0.117500424},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015426578,0.0036725334,0.9659998,0.0011071834,0.0001613343,0.00008951741,0.00015198495,0.0017320625,0.011658977],"genre_scores_gemma":[0.47144973,0.0066028237,0.5077255,0.00039625782,0.00025172345,0.0003159357,0.00048494138,0.00019675943,0.01257635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997992,0.00003877915,0.000010833001,0.000045974106,0.00008778795,0.000017369295],"domain_scores_gemma":[0.99967444,0.00014173928,0.000038393984,0.00005315076,0.00008338058,0.000008904129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004931488,0.00060475117,0.00055328174,0.0006197716,0.00035151516,0.001265419,0.000916319,0.0005877068,0.0031777085],"category_scores_gemma":[0.0012383821,0.00033662163,0.0005763142,0.0006041241,0.000364097,0.0014232764,0.00050801627,0.0012266524,0.0008986626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004170802,0.0000707663,0.001172858,0.00025198868,0.000092055176,0.0000725598,0.000060560284,0.6838508,0.005717597,0.036420736,0.0041490854,0.26809922],"study_design_scores_gemma":[0.0000039574165,0.000015772133,0.00014484888,0.000025605728,0.000009662169,0.000016515643,0.000009840831,0.9816954,0.0012772499,0.012565315,0.0042295777,0.000006196102],"about_ca_topic_score_codex":0.0023971617,"about_ca_topic_score_gemma":0.004145708,"teacher_disagreement_score":0.0031777085,"about_ca_system_score_codex":0.00081117457,"about_ca_system_score_gemma":0.0006416579,"threshold_uncertainty_score":0.010630488},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015426578,0.0036725334,0.9659998,0.0011071834,0.0001613343,0.00008951741,0.00015198495,0.0017320625,0.011658977],"genre_scores_gemma":[0.47144973,0.0066028237,0.5077255,0.00039625782,0.00025172345,0.0003159357,0.00048494138,0.00019675943,0.01257635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997992,0.00003877915,0.000010833001,0.000045974106,0.00008778795,0.000017369295],"domain_scores_gemma":[0.99967444,0.00014173928,0.000038393984,0.00005315076,0.00008338058,0.000008904129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004931488,0.00060475117,0.00055328174,0.0006197716,0.00035151516,0.001265419,0.000916319,0.0005877068,0.0031777085],"category_scores_gemma":[0.0012383821,0.00033662163,0.0005763142,0.0006041241,0.000364097,0.0014232764,0.00050801627,0.0012266524,0.0008986626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004170802,0.0000707663,0.001172858,0.00025198868,0.000092055176,0.0000725598,0.000060560284,0.6838508,0.005717597,0.036420736,0.0041490854,0.26809922],"study_design_scores_gemma":[0.0000039574165,0.000015772133,0.00014484888,0.000025605728,0.000009662169,0.000016515643,0.000009840831,0.9816954,0.0012772499,0.012565315,0.0042295777,0.000006196102],"about_ca_topic_score_codex":0.0023971617,"about_ca_topic_score_gemma":0.004145708,"teacher_disagreement_score":0.0031777085,"about_ca_system_score_codex":0.00081117457,"about_ca_system_score_gemma":0.0006416579,"threshold_uncertainty_score":0.010630488},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9594505,0.00054022047,0.034334056,0.00008447641,0.00002867914,0.000027989367,0.00026650712,0.0005793525,0.004688182],"genre_scores_gemma":[0.99343127,0.00011005974,0.005373196,0.000012635046,0.000004921751,0.000015794245,0.0002227281,0.000058545505,0.0007708597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997274,0.0000540953,0.000012771196,0.000074610376,0.00008207001,0.00004902718],"domain_scores_gemma":[0.99960476,0.00016366511,0.00003347343,0.000058600977,0.00011897095,0.000020557894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023208858,0.00040381344,0.00034820865,0.0009733889,0.0002204371,0.00044653073,0.00050843385,0.000221089,0.0017111322],"category_scores_gemma":[0.0012269772,0.00014478574,0.00024764362,0.0012663618,0.00018678114,0.0006047353,0.00021764837,0.00016965825,0.0003618882],"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.00234016,0.00038409547,0.061481915,0.00037085696,0.00022972787,0.0006992023,0.0003124068,0.4645252,0.12987341,0.0030782456,0.005494326,0.33121043],"study_design_scores_gemma":[0.00003196348,0.0004886985,0.038339313,0.000017709675,0.000066922614,0.00022913358,0.00018342945,0.908825,0.048229963,0.0010235704,0.002543764,0.000020690102],"about_ca_topic_score_codex":0.0018133707,"about_ca_topic_score_gemma":0.0027541837,"teacher_disagreement_score":0.0018133707,"about_ca_system_score_codex":0.00031379232,"about_ca_system_score_gemma":0.00020250733,"threshold_uncertainty_score":0.005724311},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027130593,0.0011505169,0.7862223,0.00032765925,0.00018699728,0.00021046837,0.0010314003,0.17892936,0.0048106653],"genre_scores_gemma":[0.26681966,0.00052691123,0.70582896,0.00061932916,0.00010207939,0.0005078906,0.00418477,0.012535305,0.008875106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992884,0.00012461584,0.0000428353,0.00022582988,0.00023200446,0.00008622909],"domain_scores_gemma":[0.99922335,0.00031659027,0.00009288716,0.00021133551,0.00011729749,0.000038426137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007557149,0.0019170674,0.0008764351,0.0010510014,0.00033424256,0.0009212752,0.002608626,0.0010337835,0.008899469],"category_scores_gemma":[0.0033229364,0.0008535726,0.0011419501,0.00071017176,0.00073704147,0.0018784585,0.0012700278,0.0020212498,0.003377155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053623103,0.00027040203,0.003275583,0.00057310204,0.00017129249,0.00019283567,0.000111609574,0.38329485,0.01633211,0.015844332,0.05191513,0.5274825],"study_design_scores_gemma":[0.000059029466,0.000057263485,0.00019394132,0.000016963559,0.0000108866825,0.00003756262,0.00000957923,0.98338425,0.0053603845,0.005291814,0.0055658887,0.000012422837],"about_ca_topic_score_codex":0.0036916882,"about_ca_topic_score_gemma":0.008303098,"teacher_disagreement_score":0.008899469,"about_ca_system_score_codex":0.0011940405,"about_ca_system_score_gemma":0.0020889193,"threshold_uncertainty_score":0.029771745},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008146123,0.0005301987,0.90308535,0.0001549245,0.00032875934,0.00062382506,0.0009657252,0.07858898,0.0075762337],"genre_scores_gemma":[0.06088006,0.0006404003,0.8981543,0.0005120233,0.00018700851,0.002588193,0.0042832238,0.022132756,0.010621952],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977428,0.00036254016,0.00025823803,0.00038692547,0.000835312,0.00041420248],"domain_scores_gemma":[0.99757224,0.0004944718,0.00018616032,0.0007606264,0.00065663934,0.00032981014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002697428,0.0016924823,0.0011277368,0.0011431474,0.0010050453,0.0025194797,0.0058671297,0.0015678955,0.02080178],"category_scores_gemma":[0.006307666,0.0014914747,0.0016629179,0.001665261,0.00097140117,0.002669741,0.0025474823,0.0035543123,0.01605684],"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.004170418,0.0009653117,0.0059745796,0.0028929831,0.0007268178,0.0013973846,0.00106332,0.058044713,0.111049876,0.10064562,0.2518245,0.46124452],"study_design_scores_gemma":[0.0016725942,0.0008381534,0.0022915981,0.0003680481,0.00032992437,0.0010083874,0.0000869368,0.33315414,0.106662855,0.038703006,0.5144341,0.00045029263],"about_ca_topic_score_codex":0.0017154113,"about_ca_topic_score_gemma":0.0011530245,"teacher_disagreement_score":0.02080178,"about_ca_system_score_codex":0.00087863585,"about_ca_system_score_gemma":0.0034026352,"threshold_uncertainty_score":0.0695889},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019641666,0.0004000564,0.9641811,0.00023153664,0.00008132585,0.0001073618,0.0002720963,0.004125037,0.010959815],"genre_scores_gemma":[0.24213931,0.00027082278,0.7487485,0.0002389808,0.000022685892,0.00024989713,0.00061831565,0.0009992751,0.0067122076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971753,0.00006174347,0.000018845787,0.000053883818,0.000107351734,0.000040564362],"domain_scores_gemma":[0.9995146,0.00021270024,0.000036210506,0.00012449862,0.00009234568,0.000019630093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035826123,0.00091710204,0.0005049038,0.0007017446,0.0003952171,0.0009072748,0.0007971442,0.0007316536,0.009421165],"category_scores_gemma":[0.0014125193,0.00040015858,0.0007156136,0.0007406852,0.0006281168,0.0008705391,0.00089069374,0.0010313203,0.0014795954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002017843,0.00012237397,0.00074074103,0.00032872017,0.000060451264,0.00015522468,0.00009716834,0.4871035,0.025194084,0.04155797,0.0104506295,0.43398738],"study_design_scores_gemma":[0.00003558135,0.000075710734,0.00013275363,0.000024506651,0.000024373843,0.00005233907,0.000020234877,0.9578991,0.009307905,0.024400119,0.008014425,0.000012927763],"about_ca_topic_score_codex":0.0026792446,"about_ca_topic_score_gemma":0.0042885807,"teacher_disagreement_score":0.009421165,"about_ca_system_score_codex":0.0006924813,"about_ca_system_score_gemma":0.001150831,"threshold_uncertainty_score":0.03151697},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15177682,0.0006708456,0.82695407,0.00042558214,0.0001455162,0.00016249598,0.00029775835,0.0019441445,0.017622797],"genre_scores_gemma":[0.66944975,0.00060661725,0.3225277,0.00013617105,0.00003890339,0.0003973032,0.0004560361,0.0007867987,0.0056006988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999582,0.00015114338,0.000016884744,0.000045945322,0.00015463971,0.00004928485],"domain_scores_gemma":[0.9992142,0.00045589646,0.00004570967,0.00012482946,0.00012201923,0.000037356775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069182436,0.0005526422,0.00049411977,0.0004871343,0.00067701587,0.0009871526,0.0010642057,0.00087733736,0.0035639822],"category_scores_gemma":[0.0023514559,0.00034216963,0.0006208914,0.0005963123,0.000428793,0.0008800506,0.0008951707,0.000656152,0.0005984281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015580759,0.00007994896,0.001209322,0.00014885026,0.000039942064,0.00007256998,0.00020026173,0.9219542,0.014826105,0.014895479,0.0009219769,0.045495424],"study_design_scores_gemma":[0.000022446215,0.000038692146,0.00031410583,0.000014541431,0.0000075231096,0.00001491462,0.000034850196,0.9857076,0.0053831046,0.0051303986,0.003323796,0.000008045764],"about_ca_topic_score_codex":0.0031034697,"about_ca_topic_score_gemma":0.0032391069,"teacher_disagreement_score":0.0035639822,"about_ca_system_score_codex":0.0007437659,"about_ca_system_score_gemma":0.00085208873,"threshold_uncertainty_score":0.0119226575},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012615152,0.00037080608,0.0018506722,0.000263566,0.00015817814,0.0001500341,0.9790683,0.01161833,0.0052586626],"genre_scores_gemma":[0.0012533736,0.000101434365,0.00268195,0.00012075959,0.000014419143,0.0002875505,0.99367225,0.0006220598,0.0012461717],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982905,0.00034048318,0.00016856618,0.0004900529,0.00052059285,0.00018987448],"domain_scores_gemma":[0.9978531,0.0006291255,0.00011987408,0.00079836795,0.0004223018,0.00017720685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001796044,0.004435624,0.0015736895,0.0023347184,0.0009616168,0.0023441368,0.00480792,0.0023467375,0.057887238],"category_scores_gemma":[0.006070786,0.0010761798,0.0022857469,0.0044079074,0.0008042238,0.0014021251,0.001785315,0.0031662064,0.10478725],"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.00010768445,0.00008269913,0.00031488185,0.0006004633,0.00004141936,0.000033954613,0.000011809393,0.0034869772,0.00018600083,0.00061585,0.9891979,0.005320348],"study_design_scores_gemma":[0.0012959747,0.00011861535,0.0034423342,0.00031736548,0.000072752,0.0003028805,0.00007820738,0.019556807,0.003105816,0.0070096315,0.9646205,0.0000792315],"about_ca_topic_score_codex":0.016351167,"about_ca_topic_score_gemma":0.03397821,"teacher_disagreement_score":0.057887238,"about_ca_system_score_codex":0.0021841708,"about_ca_system_score_gemma":0.0022026005,"threshold_uncertainty_score":0.1936521},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00271331,0.00015737489,0.0019682287,0.00011250895,0.00013455225,0.00003974244,0.9880086,0.0020754803,0.0047901175],"genre_scores_gemma":[0.006793677,0.00008315233,0.0045689624,0.00007401585,0.000042658325,0.00015658715,0.98501414,0.0007851108,0.0024817425],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993205,0.000081114566,0.000059766222,0.0002458315,0.00019425128,0.0000984858],"domain_scores_gemma":[0.9990584,0.000121317185,0.000083212304,0.00025280958,0.00041973445,0.000064470594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012043191,0.0012436492,0.0011060023,0.0016638323,0.00051449344,0.0019436263,0.002159848,0.0010553101,0.031745266],"category_scores_gemma":[0.0031169858,0.00044767503,0.0012433088,0.0022735547,0.00025009707,0.0014772888,0.0009350378,0.0014651811,0.034679573],"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.00023620341,0.000079014484,0.009355766,0.0004646131,0.00025971056,0.000066223496,0.000057745907,0.014288858,0.0012608897,0.0022845494,0.95255697,0.019089375],"study_design_scores_gemma":[0.00033701173,0.000047885525,0.029484235,0.00027854522,0.00016401835,0.000097527954,0.000121174824,0.02620183,0.0026453934,0.0058933026,0.93459135,0.00013759536],"about_ca_topic_score_codex":0.030164488,"about_ca_topic_score_gemma":0.034809437,"teacher_disagreement_score":0.031745266,"about_ca_system_score_codex":0.0008989473,"about_ca_system_score_gemma":0.0013952126,"threshold_uncertainty_score":0.10619843},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019715205,0.0001008613,0.0011291017,0.00007532552,0.00008152168,0.000029366955,0.9919151,0.0013316841,0.0033656107],"genre_scores_gemma":[0.0046129,0.00006105973,0.002914175,0.000048040827,0.000027268148,0.000107292835,0.9900961,0.0004547631,0.0016784535],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993699,0.00006566765,0.000055385204,0.00021900471,0.00019717577,0.000092823124],"domain_scores_gemma":[0.9990056,0.00011716081,0.00009029557,0.00027101915,0.0004465326,0.00006933939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010153068,0.001143174,0.0010093945,0.0017315865,0.0004925538,0.0017229739,0.0020226142,0.0009595183,0.027022664],"category_scores_gemma":[0.0028592246,0.0004204954,0.001058985,0.0023791443,0.00023862586,0.0012661327,0.0008296457,0.0013744654,0.029902736],"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.00019280035,0.000070198825,0.00913247,0.0004124203,0.00019174708,0.00005702527,0.000053153042,0.009480955,0.0011616781,0.0018945896,0.96146464,0.01588827],"study_design_scores_gemma":[0.0002885329,0.000039404706,0.03534328,0.00023629432,0.00012213441,0.00009559189,0.00011117348,0.017250042,0.0026929704,0.0045016096,0.9392009,0.00011798362],"about_ca_topic_score_codex":0.038310807,"about_ca_topic_score_gemma":0.047240213,"teacher_disagreement_score":0.038310807,"about_ca_system_score_codex":0.0009558238,"about_ca_system_score_gemma":0.0013911288,"threshold_uncertainty_score":0.0903998},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062724913,0.00016139461,0.00028129123,0.00011417914,0.00010600862,0.000026871512,0.994739,0.0021627592,0.0017812647],"genre_scores_gemma":[0.0011125642,0.00004410963,0.00056575076,0.00005154691,0.000014602186,0.00007353761,0.99733907,0.00015112701,0.00064762676],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99770564,0.0002765862,0.0002507007,0.00051889993,0.00091566955,0.00033250917],"domain_scores_gemma":[0.9956864,0.0006488357,0.0002951488,0.0017126502,0.0013286608,0.00032831007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014112788,0.0037575103,0.0017037434,0.0031685322,0.0012810255,0.002777427,0.0036215994,0.0038699221,0.048121784],"category_scores_gemma":[0.006739762,0.0008365346,0.0017816221,0.0061516305,0.00071879826,0.0016223753,0.0019073552,0.0027852631,0.10820856],"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.00019033847,0.00006860954,0.0006554892,0.0005135479,0.000025128453,0.000032829957,0.000009975304,0.0009556049,0.00029310482,0.0005913815,0.9929289,0.0037350894],"study_design_scores_gemma":[0.0007709396,0.000098047625,0.0041825892,0.00016934842,0.000041073174,0.00016557353,0.0000513809,0.0031607691,0.0031193723,0.0035322215,0.98465943,0.000049148683],"about_ca_topic_score_codex":0.011988399,"about_ca_topic_score_gemma":0.021168996,"teacher_disagreement_score":0.048121784,"about_ca_system_score_codex":0.0018298199,"about_ca_system_score_gemma":0.002569175,"threshold_uncertainty_score":0.16098338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006336879,0.00016208422,0.00027606107,0.00011626179,0.000105846164,0.000026592332,0.99475783,0.0021339406,0.0017875609],"genre_scores_gemma":[0.0011240529,0.000044302862,0.0005675305,0.00005095038,0.000014810108,0.00007370622,0.997311,0.00015187288,0.0006617438],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976972,0.0002802859,0.000250171,0.0005225245,0.0009194648,0.00033034696],"domain_scores_gemma":[0.99567395,0.00066584145,0.00029755902,0.001702762,0.001332508,0.00032741047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014252601,0.0037624724,0.0016973554,0.0032225056,0.001280817,0.0027790808,0.0036567634,0.003880248,0.04877001],"category_scores_gemma":[0.0068681575,0.00083516946,0.0017729669,0.006166335,0.0007219487,0.0016545132,0.0019323307,0.0027824817,0.108731836],"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.00018347718,0.000067558605,0.0006611553,0.00050462555,0.000024808593,0.00003209411,0.000009847447,0.0009469358,0.00028306062,0.00057913567,0.99299145,0.0037159254],"study_design_scores_gemma":[0.00074347114,0.00009527689,0.0041477475,0.00016658078,0.00004097351,0.0001598832,0.00005117622,0.0031305123,0.0030209282,0.0035432542,0.98485154,0.00004865669],"about_ca_topic_score_codex":0.011815309,"about_ca_topic_score_gemma":0.02094801,"teacher_disagreement_score":0.04877001,"about_ca_system_score_codex":0.001835467,"about_ca_system_score_gemma":0.002566835,"threshold_uncertainty_score":0.16315192},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007754663,0.0011238042,0.0023306604,0.0026012983,0.001248816,0.0009714582,0.9309254,0.039246254,0.013797643],"genre_scores_gemma":[0.0051595517,0.0001979581,0.0050460375,0.0008979108,0.00007985518,0.00091977726,0.9774699,0.0028158647,0.007413023],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9909293,0.0037177498,0.0007928805,0.0014058681,0.002257141,0.0008970079],"domain_scores_gemma":[0.98108196,0.0062090396,0.0006829243,0.0060473946,0.004585361,0.0013932313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008846716,0.0049263733,0.0026575765,0.003022922,0.0017913764,0.0031850939,0.0044480944,0.0035079464,0.078335],"category_scores_gemma":[0.027772987,0.0012853201,0.002951354,0.0033355055,0.0012025314,0.0028413665,0.004053643,0.0031760188,0.13669711],"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.00049117795,0.00013180372,0.00035885963,0.00038608784,0.000042043517,0.000013826664,0.000025074538,0.00027375846,0.000160164,0.0001238948,0.9923636,0.0056298017],"study_design_scores_gemma":[0.0062636873,0.00057219004,0.013941258,0.0007689745,0.00029129555,0.00022905147,0.0006215932,0.009827819,0.0038846838,0.0028242236,0.9605709,0.00020438423],"about_ca_topic_score_codex":0.041406453,"about_ca_topic_score_gemma":0.084267065,"teacher_disagreement_score":0.078335,"about_ca_system_score_codex":0.0028111287,"about_ca_system_score_gemma":0.0039794566,"threshold_uncertainty_score":0.2620567},"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":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005153815,0.00009340448,0.000638452,0.00006130735,0.000064575055,0.000031103085,0.99497813,0.0028619792,0.0007556057],"genre_scores_gemma":[0.0009165308,0.000042593583,0.0009019922,0.000026618822,0.000008361227,0.00009525596,0.99738723,0.00019626843,0.00042514654],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990239,0.00009913929,0.0001017877,0.0003957234,0.00023697266,0.00014237918],"domain_scores_gemma":[0.99871314,0.00023021748,0.000091086345,0.00041895322,0.00045707167,0.000089595786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079018966,0.0039713136,0.001659733,0.0029690543,0.00069246814,0.0022233857,0.0034893733,0.0023762477,0.031657014],"category_scores_gemma":[0.004471026,0.0006881387,0.002023761,0.0050697685,0.0004129609,0.00172936,0.0015007056,0.0025102512,0.07192759],"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.00012390158,0.0000560212,0.0012654605,0.00050267985,0.000050265804,0.000046616886,0.000023281862,0.0028046952,0.00038277023,0.0007789201,0.98772335,0.0062420103],"study_design_scores_gemma":[0.00039387957,0.00006522897,0.0054492196,0.0003138581,0.00008644559,0.00019138577,0.00014233627,0.017031321,0.0020356576,0.003979843,0.97021985,0.00009109582],"about_ca_topic_score_codex":0.027321648,"about_ca_topic_score_gemma":0.048707094,"teacher_disagreement_score":0.031657014,"about_ca_system_score_codex":0.0014400786,"about_ca_system_score_gemma":0.0018743986,"threshold_uncertainty_score":0.10590327},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16696215,0.0010247675,0.7670695,0.00092506513,0.0003379168,0.00018011843,0.00028039946,0.026057381,0.037162673],"genre_scores_gemma":[0.6500253,0.00053510116,0.3348237,0.00023938839,0.0001053638,0.00026221457,0.0007181098,0.0019058324,0.0113849025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999506,0.000110720175,0.000015369664,0.00007698476,0.00020606749,0.000084947904],"domain_scores_gemma":[0.9994018,0.0001766275,0.000040534425,0.00017013532,0.00015088485,0.00006014585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050229026,0.00092556386,0.00051147555,0.00045270968,0.0010998825,0.0008532522,0.0016883701,0.0006354189,0.004783705],"category_scores_gemma":[0.0017881255,0.00029535673,0.00037140757,0.00076503964,0.00056085107,0.0015356065,0.0020230976,0.0014503,0.0014947712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080124574,0.00051933946,0.011183755,0.00076789234,0.00020420049,0.0010644523,0.001634761,0.27056816,0.12673436,0.041099135,0.058321275,0.48710147],"study_design_scores_gemma":[0.00009839637,0.0003377764,0.002395271,0.000037088797,0.00004250808,0.00032089645,0.00022074628,0.8936309,0.054729514,0.008433908,0.039693203,0.000059728467],"about_ca_topic_score_codex":0.0038446141,"about_ca_topic_score_gemma":0.0068627642,"teacher_disagreement_score":0.004783705,"about_ca_system_score_codex":0.00057340506,"about_ca_system_score_gemma":0.0011693671,"threshold_uncertainty_score":0.016003132},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057253852,0.000038103695,0.0002805367,0.00005464014,0.000049711758,0.000051054118,0.99787116,0.00069360994,0.0009039351],"genre_scores_gemma":[0.00042993514,0.00006692916,0.0013956953,0.00015857784,0.00002234092,0.0003883385,0.99550194,0.00052548,0.0015107371],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99793845,0.00026240942,0.00045947995,0.00068443996,0.0004001396,0.00025499339],"domain_scores_gemma":[0.98965985,0.0033627946,0.00080683053,0.002180733,0.003368519,0.00062136515],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018277324,0.0022923858,0.0018036711,0.005398426,0.0011843522,0.0033110804,0.002418721,0.001475017,0.3118699],"category_scores_gemma":[0.016312154,0.0009933141,0.0014544168,0.008771166,0.000581344,0.0027732025,0.0018422453,0.0024784824,0.22749552],"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.00008643352,0.000022938126,0.00051658106,0.0005935702,0.000016002034,0.000016326736,0.00001598608,0.00011728588,0.0002450404,0.00048220708,0.9948639,0.0030236717],"study_design_scores_gemma":[0.00021078216,0.000024774761,0.0020999105,0.00027152323,0.000030861458,0.00008309724,0.0000737384,0.0002210487,0.0009808216,0.0021719278,0.9937949,0.00003665441],"about_ca_topic_score_codex":0.009393056,"about_ca_topic_score_gemma":0.01251413,"teacher_disagreement_score":0.3118699,"about_ca_system_score_codex":0.0016315527,"about_ca_system_score_gemma":0.0032826695,"threshold_uncertainty_score":0.98153406},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022564274,0.00005096752,0.000056513534,0.00003688371,0.000008804823,0.0000109431585,0.9985708,0.00040939945,0.00063001923],"genre_scores_gemma":[0.0006230333,0.000047252994,0.00027874604,0.000020472287,0.0000022222657,0.000029967307,0.99854374,0.000062768326,0.00039175176],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992987,0.00006071141,0.000056428766,0.00019186483,0.00022122104,0.0001709811],"domain_scores_gemma":[0.9980568,0.00027876,0.000109243665,0.00035117223,0.00097545335,0.00022850558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005843195,0.0021897638,0.0013983173,0.0036198155,0.0015157156,0.0023710672,0.0032763176,0.0016163067,0.03472171],"category_scores_gemma":[0.0042697527,0.000766418,0.0011894747,0.009173905,0.00070224307,0.0008936516,0.0014699404,0.0018538622,0.034811743],"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.000050457606,0.000016846707,0.0012078498,0.0003920989,0.0000370911,0.00002404514,0.000025765103,0.00080894434,0.00009200223,0.00060183986,0.9946136,0.0021295138],"study_design_scores_gemma":[0.00027834254,0.000012487718,0.008905705,0.00025641944,0.000043692922,0.000060394697,0.0001276028,0.0019810735,0.00050394353,0.0012111433,0.98657167,0.0000475223],"about_ca_topic_score_codex":0.7649797,"about_ca_topic_score_gemma":0.87614477,"teacher_disagreement_score":0.7649797,"about_ca_system_score_codex":0.007375978,"about_ca_system_score_gemma":0.014894319,"threshold_uncertainty_score":0.47280872},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022564274,0.00005096752,0.000056513534,0.00003688371,0.000008804823,0.0000109431585,0.9985708,0.00040939945,0.00063001923],"genre_scores_gemma":[0.0006230333,0.000047252994,0.00027874604,0.000020472287,0.0000022222657,0.000029967307,0.99854374,0.000062768326,0.00039175176],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992987,0.00006071141,0.000056428766,0.00019186483,0.00022122104,0.0001709811],"domain_scores_gemma":[0.9980568,0.00027876,0.000109243665,0.00035117223,0.00097545335,0.00022850558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005843195,0.0021897638,0.0013983173,0.0036198155,0.0015157156,0.0023710672,0.0032763176,0.0016163067,0.03472171],"category_scores_gemma":[0.0042697527,0.000766418,0.0011894747,0.009173905,0.00070224307,0.0008936516,0.0014699404,0.0018538622,0.034811743],"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.000050457606,0.000016846707,0.0012078498,0.0003920989,0.0000370911,0.00002404514,0.000025765103,0.00080894434,0.00009200223,0.00060183986,0.9946136,0.0021295138],"study_design_scores_gemma":[0.00027834254,0.000012487718,0.008905705,0.00025641944,0.000043692922,0.000060394697,0.0001276028,0.0019810735,0.00050394353,0.0012111433,0.98657167,0.0000475223],"about_ca_topic_score_codex":0.7649797,"about_ca_topic_score_gemma":0.87614477,"teacher_disagreement_score":0.7649797,"about_ca_system_score_codex":0.007375978,"about_ca_system_score_gemma":0.014894319,"threshold_uncertainty_score":0.47280872},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5911581,0.00025830264,0.37454474,0.00029519855,0.00028615852,0.00012323774,0.00010069583,0.0008333393,0.032400273],"genre_scores_gemma":[0.9212882,0.00015797201,0.072920345,0.000090070454,0.000025522564,0.00013372382,0.00008564448,0.00012909935,0.005169387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998348,0.000025051708,0.000008654905,0.00003099796,0.000060733204,0.000039704388],"domain_scores_gemma":[0.99965656,0.000074590425,0.00007198222,0.00009429366,0.000058725753,0.000043810578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019497574,0.00028896163,0.00018259541,0.00037741943,0.00040071725,0.00054197514,0.00034282118,0.0004310871,0.0016828898],"category_scores_gemma":[0.0007629731,0.00021499493,0.00024791388,0.000159341,0.00083613617,0.000584906,0.0009132809,0.0004641356,0.0003883359],"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.00012878324,0.00006448241,0.0010351958,0.0001125003,0.000015572128,0.00035741666,0.0005308263,0.07699704,0.20334011,0.6743627,0.001510263,0.04154521],"study_design_scores_gemma":[0.00006338583,0.00029298943,0.0007339143,0.00005317913,0.000011413242,0.0003206418,0.00019430165,0.5857482,0.19730958,0.1932059,0.021990947,0.00007556181],"about_ca_topic_score_codex":0.0004533065,"about_ca_topic_score_gemma":0.0006386039,"teacher_disagreement_score":0.0016828898,"about_ca_system_score_codex":0.0003545808,"about_ca_system_score_gemma":0.00032487692,"threshold_uncertainty_score":0.005629778},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97527474,0.0016090075,0.012410843,0.00012543715,0.00003604564,0.000027703334,0.00034602062,0.0005189763,0.009651228],"genre_scores_gemma":[0.99440056,0.0003610522,0.0029708112,0.000023133258,0.000010470293,0.000020359501,0.00040818166,0.00012844453,0.0016770452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99951947,0.00009006185,0.000022501572,0.000087413064,0.00014744083,0.0001331053],"domain_scores_gemma":[0.9992849,0.00035327364,0.000045987592,0.00008374951,0.00019407438,0.000038081445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036500304,0.00042754118,0.00042590935,0.00080591696,0.00026089363,0.00061767024,0.000593168,0.00023377557,0.0022264926],"category_scores_gemma":[0.0016357967,0.00013016394,0.00029604402,0.0016378158,0.0002491698,0.0006976424,0.00024807677,0.00019977026,0.0005170102],"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.004033378,0.00044986402,0.034072027,0.0008477199,0.00045337394,0.0009975249,0.00035870526,0.4690229,0.18652314,0.0069469623,0.010579208,0.28571525],"study_design_scores_gemma":[0.00011057333,0.0019369349,0.050897337,0.000056598918,0.0002535035,0.0005605725,0.0004116697,0.7960519,0.13562612,0.0029036864,0.011140286,0.000050826566],"about_ca_topic_score_codex":0.0011933055,"about_ca_topic_score_gemma":0.0017747257,"teacher_disagreement_score":0.0022264926,"about_ca_system_score_codex":0.00037675872,"about_ca_system_score_gemma":0.00030834277,"threshold_uncertainty_score":0.007448375},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79336804,0.0015320148,0.18006186,0.0002855687,0.00037613756,0.00006913182,0.00024257731,0.002762453,0.021302165],"genre_scores_gemma":[0.96326613,0.00021803679,0.030144945,0.000053077307,0.000027525328,0.000035198715,0.00014780203,0.000048145546,0.0060589807],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999267,0.000012252224,0.0000057724433,0.000015370973,0.000016453072,0.000023523566],"domain_scores_gemma":[0.99989676,0.000015942129,0.00002298909,0.000025064803,0.000023963166,0.000015225308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014936594,0.00028871762,0.00021836694,0.00023820465,0.00029851944,0.00055548415,0.0009746751,0.00014057914,0.0028528462],"category_scores_gemma":[0.00017585202,0.00012615575,0.00015984774,0.00034408557,0.00012384463,0.0005808165,0.00035057057,0.00025900634,0.00033789052],"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.003482853,0.0006934802,0.008870791,0.000617107,0.00021400627,0.0008747545,0.00033014177,0.079198554,0.5514476,0.088982135,0.013153405,0.2521352],"study_design_scores_gemma":[0.00019593301,0.0014630889,0.004319123,0.000060064263,0.00016046478,0.00040416932,0.00011243045,0.677372,0.28197882,0.012645248,0.021233842,0.000054765598],"about_ca_topic_score_codex":0.0007240094,"about_ca_topic_score_gemma":0.00216121,"teacher_disagreement_score":0.0028528462,"about_ca_system_score_codex":0.00035275088,"about_ca_system_score_gemma":0.0005634892,"threshold_uncertainty_score":0.0095437765},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085722744,0.0031749913,0.7587298,0.0030811173,0.00115152,0.0002482477,0.0012014536,0.10817899,0.0385111],"genre_scores_gemma":[0.5490863,0.0011107328,0.40943345,0.0018732938,0.0002597902,0.00043931688,0.0016010758,0.009123912,0.027072223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856794,0.00025736963,0.00012895958,0.00031523692,0.00048998185,0.0002405331],"domain_scores_gemma":[0.9967765,0.0011104381,0.00012282818,0.0013486545,0.00048176298,0.00015980889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011663279,0.0016376084,0.00074568315,0.0011031895,0.00078767457,0.0026221042,0.0049804235,0.0012672009,0.027893806],"category_scores_gemma":[0.009196978,0.00081679766,0.0009525234,0.0015616853,0.0014459223,0.0073126536,0.0038624702,0.0039666686,0.008236932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030073088,0.00047683992,0.0036658223,0.0011015647,0.00023615263,0.00061619637,0.0006169484,0.048619147,0.06817888,0.086180195,0.11117212,0.67612886],"study_design_scores_gemma":[0.00060063286,0.0005170654,0.0014593507,0.00023950817,0.00021750473,0.0007011697,0.00017580253,0.6072713,0.20109001,0.08928952,0.09827826,0.00015984243],"about_ca_topic_score_codex":0.0032351974,"about_ca_topic_score_gemma":0.0051912027,"teacher_disagreement_score":0.027893806,"about_ca_system_score_codex":0.0016066694,"about_ca_system_score_gemma":0.0025078596,"threshold_uncertainty_score":0.09331411},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016207322,0.00014290013,0.9785025,0.00008973275,0.00006566034,0.000031868334,0.00005426319,0.0014652599,0.0034405643],"genre_scores_gemma":[0.28512472,0.0002597736,0.70495075,0.00018892428,0.000042077663,0.00012168425,0.00033163486,0.00085267756,0.008127756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945253,0.000085199645,0.000038194812,0.000089278416,0.00027427688,0.00006044937],"domain_scores_gemma":[0.9989856,0.00037715628,0.0000983702,0.00033011998,0.00017245075,0.000036338326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007129717,0.00073084736,0.00047724388,0.0004913531,0.00041020944,0.0012914478,0.0010574809,0.00052482914,0.006996616],"category_scores_gemma":[0.00331027,0.00030100782,0.0006340085,0.00060455955,0.0008815348,0.0014956654,0.0018436067,0.00096946,0.0022257555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005048626,0.00010981156,0.0018377495,0.000432889,0.00011842227,0.00068284967,0.00066193345,0.1704118,0.12620066,0.18588996,0.008613547,0.50453556],"study_design_scores_gemma":[0.000034397457,0.00008922753,0.00036502362,0.00003084859,0.000021947793,0.00040759673,0.00007047501,0.8443996,0.09959715,0.036458563,0.018489048,0.00003618572],"about_ca_topic_score_codex":0.00081919646,"about_ca_topic_score_gemma":0.00085940043,"teacher_disagreement_score":0.006996616,"about_ca_system_score_codex":0.00053510966,"about_ca_system_score_gemma":0.0006865685,"threshold_uncertainty_score":0.02340597},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22663382,0.030507421,0.26126227,0.0066834986,0.0075707627,0.0022818998,0.115149066,0.12616771,0.2237435],"genre_scores_gemma":[0.30590716,0.0057608676,0.24629164,0.002547841,0.0010468711,0.0019265984,0.3797388,0.029603312,0.027176894],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9945102,0.00090618595,0.00041052126,0.000515433,0.0030474493,0.00061014324],"domain_scores_gemma":[0.9941158,0.0010057491,0.000329126,0.00087718305,0.0031100519,0.0005621697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004422525,0.0018588408,0.000930876,0.0027222175,0.0007933265,0.0023711957,0.0040804455,0.0010064255,0.0058993236],"category_scores_gemma":[0.009495081,0.00063241075,0.0010062616,0.0045041125,0.0006158418,0.0030183368,0.0020213586,0.0023240193,0.0037139812],"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.0016376383,0.00043103925,0.008589887,0.0015153574,0.0002951525,0.0002461707,0.00016105808,0.08053625,0.016601253,0.024935061,0.70200086,0.1630503],"study_design_scores_gemma":[0.00064018875,0.00090370496,0.016414335,0.00053613284,0.00020825332,0.0003982613,0.00018742164,0.26185495,0.036683552,0.015895981,0.6660197,0.00025744294],"about_ca_topic_score_codex":0.019835098,"about_ca_topic_score_gemma":0.016642293,"teacher_disagreement_score":0.019835098,"about_ca_system_score_codex":0.0028512285,"about_ca_system_score_gemma":0.0037905823,"threshold_uncertainty_score":0.03943926},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04522264,0.00057109585,0.93174547,0.00037323215,0.00019583401,0.0002899643,0.0019244383,0.008200699,0.01147661],"genre_scores_gemma":[0.32552442,0.00041613597,0.65133506,0.000527569,0.00012830188,0.0007416248,0.0034821113,0.0010415467,0.01680332],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783653,0.00036089416,0.0002839339,0.0004290675,0.0007648587,0.00032473772],"domain_scores_gemma":[0.99302226,0.0016486725,0.0004736838,0.0033451288,0.0012638303,0.00024650228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011755163,0.00062794704,0.00075824215,0.0008876387,0.0011023291,0.0024412759,0.002449481,0.0007833021,0.009354313],"category_scores_gemma":[0.006719004,0.0007163453,0.000983552,0.0019203476,0.0012653272,0.0069310064,0.0034586722,0.0018273402,0.0030496554],"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.0015353721,0.00033973253,0.0044208784,0.00081888697,0.00011877687,0.00061308814,0.0013188359,0.070724994,0.04306567,0.36776736,0.029002178,0.4802743],"study_design_scores_gemma":[0.00025712213,0.0008450637,0.0011090724,0.00022914303,0.00018659707,0.0006901354,0.0004581508,0.37194017,0.046788238,0.4095103,0.16780816,0.00017783293],"about_ca_topic_score_codex":0.0025654351,"about_ca_topic_score_gemma":0.0036821684,"teacher_disagreement_score":0.009354313,"about_ca_system_score_codex":0.0008904668,"about_ca_system_score_gemma":0.0018204092,"threshold_uncertainty_score":0.031293333},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005099134,0.000046650926,0.00009726124,0.0001857589,0.00008373631,0.000034989043,0.9978448,0.00021325653,0.0009835786],"genre_scores_gemma":[0.002765139,0.00003482455,0.00055745215,0.00014237095,0.000034424444,0.00023682724,0.99440175,0.000085180756,0.0017420622],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972031,0.00075065077,0.0003578437,0.00060230267,0.000736817,0.0003493763],"domain_scores_gemma":[0.98697877,0.0033783584,0.0011403869,0.0049368395,0.0028996202,0.00066602667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041085538,0.0014541599,0.001313951,0.0022925395,0.0011767783,0.0021953231,0.0037216237,0.0027979852,0.06846966],"category_scores_gemma":[0.027331598,0.00068851915,0.0014531084,0.004454582,0.000685363,0.0009647172,0.001790714,0.0023419554,0.0635718],"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.00013237933,0.000038588234,0.001479442,0.00028930578,0.000041642175,0.000024543733,0.000022019269,0.0003097346,0.0000642043,0.00051287987,0.9954444,0.001640833],"study_design_scores_gemma":[0.0018196044,0.000099121266,0.017940646,0.00043019233,0.000120102144,0.00016791564,0.00030210236,0.0014876907,0.00088269234,0.0037294829,0.9729259,0.000094544484],"about_ca_topic_score_codex":0.026499797,"about_ca_topic_score_gemma":0.0613261,"teacher_disagreement_score":0.06846966,"about_ca_system_score_codex":0.001441004,"about_ca_system_score_gemma":0.0030419813,"threshold_uncertainty_score":0.22905385},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010619032,0.0009936003,0.013933529,0.0003289395,0.00021732507,0.00019451782,0.7836958,0.19485621,0.0047182217],"genre_scores_gemma":[0.003192225,0.00049337815,0.02557592,0.00052846764,0.000058412992,0.0011151165,0.95268494,0.013579746,0.002771811],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982759,0.00029858452,0.00019749296,0.0005241346,0.0004482524,0.00025553443],"domain_scores_gemma":[0.9982957,0.0005322925,0.00011850643,0.0006313012,0.00031986702,0.00010226285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016547834,0.0056288023,0.002863977,0.003580197,0.0011600477,0.0033355386,0.008280772,0.0022720245,0.08610777],"category_scores_gemma":[0.00720831,0.002497672,0.0039549563,0.0059997924,0.00068244373,0.00310193,0.0041083214,0.0031624564,0.16478951],"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.00015735309,0.000035697667,0.00030421364,0.00095190556,0.00008484209,0.00003326395,0.00002559561,0.0015962047,0.00034352744,0.000752908,0.9838291,0.011885455],"study_design_scores_gemma":[0.0011343485,0.000092034636,0.001731477,0.0003734594,0.00012142619,0.00029677316,0.00009642544,0.027768185,0.007868403,0.011875587,0.9485044,0.00013739432],"about_ca_topic_score_codex":0.0121180685,"about_ca_topic_score_gemma":0.025452908,"teacher_disagreement_score":0.08610777,"about_ca_system_score_codex":0.0019309205,"about_ca_system_score_gemma":0.0027860936,"threshold_uncertainty_score":0.28805918},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24252191,0.003348069,0.7096541,0.0021856828,0.00055594253,0.00023443284,0.000510164,0.029222965,0.011766808],"genre_scores_gemma":[0.84100497,0.00047936125,0.1514224,0.00052359526,0.0001118463,0.00012579655,0.00039805155,0.00071191165,0.00522206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988844,0.0002368639,0.00007467411,0.00016949027,0.00044686435,0.0001877742],"domain_scores_gemma":[0.9974088,0.0006219149,0.00033529734,0.0011090046,0.00040413506,0.000120891375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011599825,0.0008692477,0.00047426394,0.0005179563,0.0006976507,0.0011549108,0.0020798806,0.00074825576,0.0031981405],"category_scores_gemma":[0.003930948,0.00063479,0.00051567965,0.0005690123,0.0013038253,0.0024705564,0.0021224057,0.0015494381,0.0006723727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028995404,0.000530046,0.0163944,0.0007451622,0.00038470738,0.0006987812,0.0009762762,0.25472647,0.18538733,0.06391746,0.045835912,0.42750388],"study_design_scores_gemma":[0.0001994345,0.0005382231,0.0011957047,0.00006627316,0.00014429382,0.00027894834,0.00015581318,0.8193477,0.114572994,0.03778206,0.02562547,0.00009301635],"about_ca_topic_score_codex":0.0023686376,"about_ca_topic_score_gemma":0.0058674435,"teacher_disagreement_score":0.0031981405,"about_ca_system_score_codex":0.0007152536,"about_ca_system_score_gemma":0.0019873402,"threshold_uncertainty_score":0.010698855},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031550337,0.00066754426,0.95368373,0.00041735743,0.00015656966,0.00006260466,0.000060344442,0.0041855206,0.009215977],"genre_scores_gemma":[0.60445154,0.00057109975,0.38444906,0.00028575974,0.00027484208,0.00016584482,0.00014762548,0.0011078947,0.008546309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735165,0.00061129685,0.00016814271,0.00036259077,0.0009939418,0.0005123828],"domain_scores_gemma":[0.996804,0.00092334545,0.00044251783,0.0013596351,0.00030413023,0.00016646011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002293734,0.00058451813,0.0006736549,0.0010702168,0.0011762998,0.0032457027,0.0016232467,0.0010139081,0.0021297266],"category_scores_gemma":[0.006129671,0.0006475605,0.0011471463,0.0006484524,0.003526745,0.0044063027,0.004000525,0.0022351588,0.00066948956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003595131,0.00006500868,0.0019369713,0.00020056534,0.00005189076,0.00042489878,0.00082178315,0.05327506,0.018536592,0.8392556,0.0024229672,0.08264908],"study_design_scores_gemma":[0.00008249627,0.00016690184,0.0011314072,0.00019554372,0.00016684485,0.0005416794,0.00019329248,0.414492,0.05343762,0.48790902,0.041513633,0.0001695444],"about_ca_topic_score_codex":0.0018202151,"about_ca_topic_score_gemma":0.0022486516,"teacher_disagreement_score":0.0032457027,"about_ca_system_score_codex":0.0015941012,"about_ca_system_score_gemma":0.002802138,"threshold_uncertainty_score":0.0121305585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4551061,0.0032760724,0.49072906,0.0014520606,0.00052562094,0.00024258593,0.0003926779,0.015152292,0.033123538],"genre_scores_gemma":[0.86399394,0.00039244027,0.12351771,0.00048736826,0.00006946624,0.00013234462,0.00028648772,0.00042935595,0.010690894],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998136,0.000017090782,0.000010802599,0.00003636436,0.00008044606,0.000041619398],"domain_scores_gemma":[0.9996433,0.000064488035,0.000054505217,0.00010466423,0.00009547817,0.000037639868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020210556,0.0003832021,0.0002394927,0.00038220975,0.00037624725,0.00082094886,0.0018127459,0.00033341735,0.0040112115],"category_scores_gemma":[0.0006196845,0.0002019913,0.00016102508,0.0003435634,0.00037224093,0.001784817,0.0014000236,0.0006416533,0.0009207188],"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.0011298717,0.00030660507,0.0056820405,0.00057829823,0.00006602562,0.0010986747,0.0009968872,0.03487595,0.6030548,0.047307163,0.032960583,0.27194312],"study_design_scores_gemma":[0.00017479826,0.0008581849,0.0016857616,0.00007778212,0.000057763198,0.0006867974,0.00032308395,0.44564763,0.44873297,0.009115797,0.09254043,0.000098947115],"about_ca_topic_score_codex":0.0017801455,"about_ca_topic_score_gemma":0.0026233094,"teacher_disagreement_score":0.0040112115,"about_ca_system_score_codex":0.0008412576,"about_ca_system_score_gemma":0.0008117921,"threshold_uncertainty_score":0.013418853},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015716217,0.00006636229,0.9607609,0.00034500464,0.00010007743,0.00010991984,0.0002515145,0.01671548,0.0059345705],"genre_scores_gemma":[0.18723223,0.00032344207,0.7927576,0.00066480215,0.00008899307,0.00052260654,0.0011678684,0.0072086114,0.010033949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99853456,0.0004144719,0.00023047636,0.00024567515,0.00040209055,0.00017268238],"domain_scores_gemma":[0.9946956,0.0021241936,0.00038016323,0.0017834757,0.0008554036,0.00016123941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034656362,0.00092348363,0.00039477577,0.00056969444,0.0005835815,0.0025661439,0.0025512376,0.0011235757,0.0051208613],"category_scores_gemma":[0.009152971,0.000984097,0.001388922,0.00054286857,0.002183859,0.006860356,0.0040648086,0.0029361271,0.0016323521],"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.0006954563,0.00024215473,0.0054928693,0.0010859113,0.00010490646,0.0013975587,0.0033224444,0.04419514,0.043238875,0.7218875,0.024613371,0.1537238],"study_design_scores_gemma":[0.00019529134,0.0002967057,0.001118836,0.00034673512,0.00013313211,0.0010868347,0.000308039,0.239661,0.0852555,0.2879045,0.38351527,0.0001782372],"about_ca_topic_score_codex":0.0015372772,"about_ca_topic_score_gemma":0.0014967709,"teacher_disagreement_score":0.0051208613,"about_ca_system_score_codex":0.0008417853,"about_ca_system_score_gemma":0.002523879,"threshold_uncertainty_score":0.01832825},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024629755,0.0015670651,0.8357754,0.0012151456,0.0012779009,0.0002587794,0.0015268683,0.086726904,0.047022257],"genre_scores_gemma":[0.5188324,0.0010381293,0.24763522,0.0026289432,0.0012443843,0.00078397803,0.0038621186,0.019311104,0.20466371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985884,0.00024339314,0.00009007874,0.00023311988,0.0005924567,0.00025251674],"domain_scores_gemma":[0.9973859,0.00038323304,0.00018795601,0.0016079752,0.00030831769,0.00012658787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012434669,0.0014491576,0.0009968076,0.00094989745,0.0008541645,0.0021476399,0.0022999463,0.0012139804,0.045982353],"category_scores_gemma":[0.0027778125,0.00067636254,0.0006614345,0.0009045541,0.0015796904,0.0036794734,0.003661871,0.0022699903,0.021189308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031460118,0.00030380266,0.0016292051,0.0006529853,0.0001243199,0.00043591033,0.0005269774,0.01716441,0.071941406,0.20727687,0.22392562,0.47287247],"study_design_scores_gemma":[0.00034611786,0.00084983266,0.0011492079,0.00019929449,0.00013403363,0.0013200737,0.00013441728,0.13858384,0.20085552,0.18512787,0.47105062,0.00024915836],"about_ca_topic_score_codex":0.00041779203,"about_ca_topic_score_gemma":0.00067566126,"teacher_disagreement_score":0.045982353,"about_ca_system_score_codex":0.0009629471,"about_ca_system_score_gemma":0.0013525422,"threshold_uncertainty_score":0.1538263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20286633,0.0013614272,0.7086874,0.00084798504,0.00022242712,0.000294873,0.0004974508,0.07126112,0.013961001],"genre_scores_gemma":[0.8067004,0.0003243777,0.1850534,0.00047553098,0.000050863877,0.00012474226,0.0005439131,0.0014807711,0.005246086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983057,0.00033087423,0.00009724679,0.0002341379,0.000651544,0.0003804553],"domain_scores_gemma":[0.9958527,0.0011640497,0.0005679039,0.0017403036,0.00054098736,0.00013398398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015742097,0.0010365774,0.0005371532,0.00089896616,0.00046114915,0.0010880372,0.0024148778,0.00061249535,0.0031833777],"category_scores_gemma":[0.004899125,0.0005602682,0.00068308006,0.00046224848,0.0014558051,0.0020728558,0.0023593677,0.0015947341,0.0008053842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021892993,0.00046044716,0.029825669,0.0012963045,0.0003346617,0.0012389099,0.00093983096,0.19438937,0.20428225,0.09794027,0.036342703,0.43076026],"study_design_scores_gemma":[0.000116641146,0.00074842473,0.0030590992,0.00012605722,0.0001893352,0.0007663745,0.00012877624,0.65417665,0.28729105,0.02393199,0.02931159,0.00015402566],"about_ca_topic_score_codex":0.002297995,"about_ca_topic_score_gemma":0.004868859,"teacher_disagreement_score":0.0031833777,"about_ca_system_score_codex":0.0007583794,"about_ca_system_score_gemma":0.0023662176,"threshold_uncertainty_score":0.010649443},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024853738,0.0003479841,0.5097507,0.00018813842,0.00022831564,0.00014531972,0.0075162128,0.4684347,0.010903206],"genre_scores_gemma":[0.080496594,0.00082050625,0.63103384,0.0011851143,0.00022369635,0.0012931799,0.033219542,0.21936731,0.032360148],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99901783,0.00012613817,0.00006609624,0.00020082374,0.0003748321,0.00021426521],"domain_scores_gemma":[0.99867815,0.00057850935,0.00007457629,0.00029303326,0.00026398696,0.00011186476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001195851,0.0031674556,0.0020071846,0.0013969337,0.0010272523,0.0024194932,0.0043710144,0.0014213767,0.11012477],"category_scores_gemma":[0.00549874,0.0019823008,0.0025380708,0.0016225923,0.00092433934,0.0030119668,0.003022337,0.004953391,0.051787626],"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.0016616562,0.00044637607,0.0032012053,0.001840421,0.0004436345,0.00043942232,0.00036063016,0.055051558,0.009806685,0.033753,0.5965641,0.29643124],"study_design_scores_gemma":[0.0008774325,0.00013095238,0.0014207095,0.00019790593,0.00011187648,0.00027806024,0.00008692864,0.686221,0.040288452,0.066091284,0.2040575,0.00023789934],"about_ca_topic_score_codex":0.0055498197,"about_ca_topic_score_gemma":0.011135909,"teacher_disagreement_score":0.11012477,"about_ca_system_score_codex":0.0012584602,"about_ca_system_score_gemma":0.0029875266,"threshold_uncertainty_score":0.36840403},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14245662,0.0038164984,0.76965743,0.00082047854,0.0012028791,0.0005547846,0.00091515546,0.05060443,0.029971758],"genre_scores_gemma":[0.5065581,0.0010809153,0.46362123,0.00090786384,0.0002270805,0.000353195,0.0019805455,0.0043430426,0.020928077],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99940157,0.000070075,0.00004144883,0.00009492166,0.00029269513,0.00009920553],"domain_scores_gemma":[0.9989095,0.00023827591,0.00015173439,0.0003505102,0.00025886446,0.0000911344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000496807,0.0010120325,0.0005586178,0.0011100792,0.0007962636,0.00072660035,0.0019639977,0.0004193116,0.005878549],"category_scores_gemma":[0.0018621889,0.00047786752,0.0005269882,0.00095555757,0.0006053584,0.0013653187,0.0014786504,0.001393771,0.001594511],"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.0014533516,0.0006353653,0.008016316,0.0006000165,0.00017793992,0.00050652504,0.00068207923,0.06293516,0.14779674,0.02673124,0.0903138,0.6601515],"study_design_scores_gemma":[0.00056931196,0.0016986718,0.00524862,0.00012611202,0.00024688826,0.0007583221,0.00028139463,0.6593512,0.16218914,0.01653479,0.15275034,0.00024523484],"about_ca_topic_score_codex":0.004993913,"about_ca_topic_score_gemma":0.012945084,"teacher_disagreement_score":0.005878549,"about_ca_system_score_codex":0.00086434215,"about_ca_system_score_gemma":0.0028498732,"threshold_uncertainty_score":0.019665658},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045037877,0.0006582777,0.8129511,0.00026325948,0.00011448199,0.00029391554,0.00060092466,0.12725703,0.012823223],"genre_scores_gemma":[0.43343636,0.00054372306,0.5381504,0.00047304033,0.00010192324,0.00066091557,0.002648519,0.010590096,0.013394966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922085,0.00017482864,0.000058907764,0.00015252375,0.00027724117,0.000115648276],"domain_scores_gemma":[0.999064,0.00032091528,0.00013149138,0.00024170786,0.00015514763,0.000086658896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014187633,0.00122693,0.000392187,0.0005993008,0.00035367283,0.0011258685,0.002039051,0.0004920456,0.012382315],"category_scores_gemma":[0.0020613961,0.00077869085,0.0010900727,0.00031039442,0.00058399356,0.0015183411,0.0011666024,0.0011654522,0.0029470536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018066871,0.00055799185,0.010933388,0.0012525218,0.00028742978,0.0012172858,0.0010676373,0.17437004,0.13126472,0.047309574,0.08760153,0.5423312],"study_design_scores_gemma":[0.0003402859,0.00056579965,0.0019335349,0.00011838849,0.00007769846,0.00059977657,0.000104577746,0.83014715,0.05791896,0.013863844,0.094239034,0.00009089286],"about_ca_topic_score_codex":0.0015953887,"about_ca_topic_score_gemma":0.002124299,"teacher_disagreement_score":0.012382315,"about_ca_system_score_codex":0.0007688543,"about_ca_system_score_gemma":0.0013861405,"threshold_uncertainty_score":0.041423023},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28195214,0.0038390185,0.703163,0.0005046826,0.00013686072,0.00011025768,0.00020960577,0.0027228312,0.007361498],"genre_scores_gemma":[0.94409907,0.0003221493,0.053789854,0.00012498538,0.000036862933,0.00005765748,0.00017276248,0.000069008805,0.0013277417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995384,0.000054981396,0.000029204797,0.000045374294,0.0002531842,0.00007886153],"domain_scores_gemma":[0.99926096,0.00014162473,0.000120274686,0.00014774766,0.00028966676,0.00003963032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040561013,0.0003456919,0.00026536183,0.0004983969,0.0004336141,0.0006224467,0.0012962926,0.00025452717,0.0011998696],"category_scores_gemma":[0.000773344,0.0001914773,0.00028496506,0.00048591924,0.00029599943,0.0008314462,0.00046401372,0.00044292666,0.00022887517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061613676,0.00021111037,0.009965066,0.00075501704,0.00021659861,0.00072838843,0.0003461561,0.47591597,0.18604244,0.039612446,0.010279882,0.27531078],"study_design_scores_gemma":[0.000053030275,0.0005448617,0.0010646095,0.000034189226,0.00008043711,0.00024736617,0.00005640249,0.9374352,0.04214945,0.006300454,0.012001618,0.000032281914],"about_ca_topic_score_codex":0.0018651009,"about_ca_topic_score_gemma":0.006259738,"teacher_disagreement_score":0.0018651009,"about_ca_system_score_codex":0.0007072985,"about_ca_system_score_gemma":0.0015789873,"threshold_uncertainty_score":0.0051318407},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39345106,0.0020787388,0.5764894,0.0008122912,0.00045129634,0.00017701663,0.0004383418,0.016326461,0.009775517],"genre_scores_gemma":[0.84875625,0.00022788616,0.14793077,0.00020614067,0.000029603809,0.000073057185,0.00039899527,0.00027719027,0.0021001175],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990609,0.00014872452,0.00007333171,0.00016249175,0.00040701992,0.00014743154],"domain_scores_gemma":[0.99826705,0.00034230883,0.00025900552,0.0005163221,0.00050322287,0.00011210946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007203309,0.0009807055,0.00047461016,0.0009087914,0.0005631649,0.00089921156,0.0018958985,0.0004314057,0.0030735664],"category_scores_gemma":[0.0028950875,0.00034783623,0.0004125302,0.00074173947,0.0006760403,0.0016984546,0.0008152882,0.0008725289,0.0005290714],"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.0023926888,0.00035133937,0.01794307,0.0007948616,0.00020787236,0.0010564949,0.0006056135,0.18850885,0.18602301,0.029980825,0.028265415,0.54387],"study_design_scores_gemma":[0.000059067104,0.0005471738,0.0022695572,0.00004766455,0.00006116964,0.00029954038,0.00011273944,0.8870162,0.09012404,0.008508632,0.010906785,0.000047394176],"about_ca_topic_score_codex":0.00555834,"about_ca_topic_score_gemma":0.009126021,"teacher_disagreement_score":0.00555834,"about_ca_system_score_codex":0.0016695998,"about_ca_system_score_gemma":0.0015478521,"threshold_uncertainty_score":0.012113869},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018575724,0.00012563402,0.9956677,0.00003999953,0.000037905626,0.000014206234,0.000018267141,0.00009934841,0.0021394223],"genre_scores_gemma":[0.27891973,0.0018458298,0.7066423,0.00020949998,0.00016965228,0.0003635431,0.00029280636,0.00039559332,0.011161043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965155,0.000073735544,0.00001613074,0.00006725206,0.00015966053,0.00003171181],"domain_scores_gemma":[0.99980444,0.00006087244,0.00003872193,0.00005283824,0.000029938314,0.000013169322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003566468,0.0011536595,0.00086886354,0.0006005258,0.00052404637,0.00066814333,0.0011302857,0.0005879491,0.0026864174],"category_scores_gemma":[0.00093607494,0.00051812787,0.0012473096,0.0004620223,0.0010299364,0.0016394617,0.0011398721,0.0012192439,0.0009174742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001855334,0.00003508524,0.00021983974,0.00014112786,0.000025984518,0.00013709991,0.000110765344,0.8280135,0.007463692,0.13166086,0.0012460686,0.030927457],"study_design_scores_gemma":[0.0000074798045,0.000025239457,0.00006054452,0.000015071757,0.000011352157,0.00006859148,0.000020070232,0.9581222,0.0012263071,0.030258853,0.010171551,0.000012713012],"about_ca_topic_score_codex":0.0031729601,"about_ca_topic_score_gemma":0.0035605375,"teacher_disagreement_score":0.0031729601,"about_ca_system_score_codex":0.00048343508,"about_ca_system_score_gemma":0.00073151494,"threshold_uncertainty_score":0.00898695},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07516417,0.00018943471,0.9135994,0.00020444817,0.00009497065,0.00014017789,0.00013414881,0.00676897,0.0037042573],"genre_scores_gemma":[0.27080297,0.000084026215,0.7253413,0.000103647566,0.000023777475,0.00012025393,0.00039090114,0.0013694853,0.0017636502],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995166,0.00009152505,0.000031557902,0.0000733394,0.00018640792,0.00010063667],"domain_scores_gemma":[0.99925476,0.0002416307,0.00006902926,0.0001581947,0.00023239989,0.00004402336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061095116,0.000832112,0.00041691517,0.00063465297,0.0005015597,0.0007331179,0.0008644525,0.00042825725,0.0031446994],"category_scores_gemma":[0.0017838954,0.00053758605,0.00049649976,0.00043667204,0.0005249127,0.000876228,0.00080163585,0.0009812261,0.00086439936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076860865,0.00037681623,0.0054221293,0.00036097987,0.00008583195,0.00026046118,0.0005018271,0.33785793,0.14044361,0.031743985,0.014483452,0.4676944],"study_design_scores_gemma":[0.00012433164,0.00036693265,0.0006756005,0.00003507082,0.000029903289,0.00008141265,0.00008180288,0.8958503,0.082230635,0.009046661,0.011448787,0.000028602006],"about_ca_topic_score_codex":0.0022760222,"about_ca_topic_score_gemma":0.0039619147,"teacher_disagreement_score":0.0031446994,"about_ca_system_score_codex":0.0006087866,"about_ca_system_score_gemma":0.0024894478,"threshold_uncertainty_score":0.010520101},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33929077,0.0016583616,0.6179802,0.0005064593,0.0004394877,0.00009367705,0.00017945483,0.018952219,0.02089936],"genre_scores_gemma":[0.90325785,0.00027029682,0.089714445,0.00013442953,0.000054704316,0.000048632664,0.00017445268,0.0008271295,0.0055180658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995752,0.000087479806,0.000031156273,0.00007105618,0.00014008487,0.00009502167],"domain_scores_gemma":[0.999199,0.00023238316,0.00004588831,0.0003238482,0.00012140566,0.000077586184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007722438,0.00054816855,0.0006659901,0.00041027868,0.0005277535,0.001697438,0.0016742016,0.00051687105,0.0030383796],"category_scores_gemma":[0.0014715736,0.00039893595,0.00045377208,0.000526451,0.0006064669,0.0015965573,0.001922502,0.0011382737,0.0005583168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015320188,0.0005083891,0.007212107,0.00042207591,0.00018437064,0.0007829717,0.0005165307,0.43580607,0.10569491,0.06918601,0.014032328,0.3641222],"study_design_scores_gemma":[0.00003843733,0.000094714356,0.0008632513,0.000024907795,0.000033914224,0.00013886095,0.00007310984,0.95532995,0.022112863,0.015057969,0.0061986656,0.000033286822],"about_ca_topic_score_codex":0.0013126276,"about_ca_topic_score_gemma":0.0014071413,"teacher_disagreement_score":0.0030383796,"about_ca_system_score_codex":0.0005344827,"about_ca_system_score_gemma":0.0004981381,"threshold_uncertainty_score":0.01016438},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06676971,0.00054115144,0.90518975,0.0003312167,0.00029309298,0.00020399733,0.00017293623,0.007575139,0.01892286],"genre_scores_gemma":[0.61397207,0.00020915088,0.37453797,0.00025378822,0.000055196193,0.00028388368,0.0003372858,0.0007701341,0.009580577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995333,0.00008402669,0.000017437094,0.00008146647,0.00015517551,0.00012865287],"domain_scores_gemma":[0.9992138,0.00015367553,0.00008269438,0.00020781595,0.00025864984,0.00008339018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005965906,0.0008764426,0.00045048216,0.00041436314,0.0004986661,0.00096905883,0.0021622747,0.0004800281,0.007854024],"category_scores_gemma":[0.0013304283,0.00033966365,0.0005457836,0.00037480635,0.0005032144,0.0009826636,0.0010071574,0.0009885206,0.0012996064],"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.0008124796,0.0003201462,0.0015782228,0.0005436885,0.00017189239,0.00033644467,0.00019039078,0.49011722,0.08938457,0.03809068,0.029712718,0.34874153],"study_design_scores_gemma":[0.00005986634,0.00045092733,0.0003190901,0.000028653487,0.00004707059,0.000104133505,0.000044679244,0.95735985,0.025157599,0.006561646,0.009841492,0.000024943323],"about_ca_topic_score_codex":0.0034886159,"about_ca_topic_score_gemma":0.009023404,"teacher_disagreement_score":0.007854024,"about_ca_system_score_codex":0.00094909273,"about_ca_system_score_gemma":0.001769272,"threshold_uncertainty_score":0.026274323},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052610636,0.0003826764,0.9414065,0.00062858686,0.00006277939,0.00012076892,0.00033548777,0.0019319314,0.002520688],"genre_scores_gemma":[0.53441423,0.00039210392,0.45739713,0.0006600015,0.00013965649,0.00039688783,0.0016025134,0.00047229868,0.004525173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987878,0.00040766876,0.00005947312,0.00029649344,0.00030813186,0.00014041012],"domain_scores_gemma":[0.99551684,0.0021167956,0.00033418712,0.0014171974,0.00043017988,0.0001848574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022579227,0.0014746063,0.0011525325,0.00081037614,0.00035578763,0.0013020668,0.0019239628,0.0017778354,0.0027281775],"category_scores_gemma":[0.012971889,0.00046882362,0.0006985249,0.0011346224,0.0012959223,0.0033934324,0.0029944715,0.0032600146,0.0010084895],"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.0006010729,0.0004167791,0.001650509,0.00033822525,0.0000970335,0.0002659409,0.0003853459,0.47154897,0.022415154,0.05235866,0.009896659,0.4400257],"study_design_scores_gemma":[0.00003657484,0.000090302514,0.00014875778,0.000021402018,0.000012899223,0.000063329884,0.000035283338,0.9651115,0.0057282145,0.027565323,0.0011759279,0.000010585142],"about_ca_topic_score_codex":0.0022173855,"about_ca_topic_score_gemma":0.0024758915,"teacher_disagreement_score":0.0027281775,"about_ca_system_score_codex":0.0008987315,"about_ca_system_score_gemma":0.0015292873,"threshold_uncertainty_score":0.0119411945},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114654504,0.00033814795,0.78502643,0.00037522867,0.0003593319,0.0005902584,0.001188631,0.08602049,0.011447005],"genre_scores_gemma":[0.51974225,0.00042900207,0.4618492,0.0002991242,0.00006193926,0.0007922496,0.0027200563,0.0094284285,0.0046776617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890566,0.00028386104,0.00007581703,0.000170015,0.0004286102,0.0001360691],"domain_scores_gemma":[0.99581677,0.0023397184,0.00019642491,0.00084132876,0.0005765271,0.00022912683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002128743,0.0014819406,0.00057532,0.0007935646,0.00037311955,0.0010823692,0.0021399162,0.000785548,0.0064970907],"category_scores_gemma":[0.008049966,0.00064122386,0.0006435832,0.0005115504,0.0006947589,0.0014213936,0.0014969142,0.001424515,0.0016619406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003200459,0.0012111164,0.013429844,0.0018219692,0.00037467145,0.0032942304,0.0018748167,0.32832885,0.21003519,0.03242062,0.07411249,0.32989576],"study_design_scores_gemma":[0.0003709569,0.00043492788,0.002494314,0.00009108901,0.00005585897,0.00049435766,0.00011972443,0.82447463,0.1273736,0.007325245,0.03669242,0.000072807714],"about_ca_topic_score_codex":0.0009022442,"about_ca_topic_score_gemma":0.00083969237,"teacher_disagreement_score":0.0064970907,"about_ca_system_score_codex":0.00042878723,"about_ca_system_score_gemma":0.0006261533,"threshold_uncertainty_score":0.021734893},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6092355,0.0005552791,0.36639822,0.00025442892,0.000074857664,0.00009078827,0.00011226326,0.0036677793,0.019610867],"genre_scores_gemma":[0.97370625,0.000064042484,0.024637373,0.000040208528,0.000007325842,0.000028613067,0.000050751572,0.00017507648,0.001290397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965525,0.00006019835,0.000014438802,0.00008818754,0.00011991674,0.00006204561],"domain_scores_gemma":[0.99940753,0.00021898872,0.00007575889,0.0001471931,0.00011644254,0.000034082466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043022865,0.0005614367,0.00029454206,0.0005039659,0.00030449455,0.0007891843,0.00081388175,0.00032650083,0.0017925074],"category_scores_gemma":[0.0021794029,0.0001764986,0.0002889101,0.00047589873,0.0003046278,0.00070045644,0.00056339573,0.00041750836,0.00034395567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026930845,0.00020712732,0.005199303,0.00009822484,0.00005414608,0.00018532666,0.00012340074,0.7533833,0.060080055,0.0040137926,0.0020919838,0.17429404],"study_design_scores_gemma":[0.000005374324,0.000054628188,0.0011647963,0.0000044920776,0.000007881984,0.000027779692,0.000015251513,0.98425424,0.0127254175,0.00096647546,0.00076709944,0.0000066524544],"about_ca_topic_score_codex":0.002487256,"about_ca_topic_score_gemma":0.0027401547,"teacher_disagreement_score":0.002487256,"about_ca_system_score_codex":0.00075873005,"about_ca_system_score_gemma":0.00042845754,"threshold_uncertainty_score":0.005996585},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6092355,0.0005552791,0.36639822,0.00025442892,0.000074857664,0.00009078827,0.00011226326,0.0036677793,0.019610867],"genre_scores_gemma":[0.97370625,0.000064042484,0.024637373,0.000040208528,0.000007325842,0.000028613067,0.000050751572,0.00017507648,0.001290397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965525,0.00006019835,0.000014438802,0.00008818754,0.00011991674,0.00006204561],"domain_scores_gemma":[0.99940753,0.00021898872,0.00007575889,0.0001471931,0.00011644254,0.000034082466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043022865,0.0005614367,0.00029454206,0.0005039659,0.00030449455,0.0007891843,0.00081388175,0.00032650083,0.0017925074],"category_scores_gemma":[0.0021794029,0.0001764986,0.0002889101,0.00047589873,0.0003046278,0.00070045644,0.00056339573,0.00041750836,0.00034395567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026930845,0.00020712732,0.005199303,0.00009822484,0.00005414608,0.00018532666,0.00012340074,0.7533833,0.060080055,0.0040137926,0.0020919838,0.17429404],"study_design_scores_gemma":[0.000005374324,0.000054628188,0.0011647963,0.0000044920776,0.000007881984,0.000027779692,0.000015251513,0.98425424,0.0127254175,0.00096647546,0.00076709944,0.0000066524544],"about_ca_topic_score_codex":0.002487256,"about_ca_topic_score_gemma":0.0027401547,"teacher_disagreement_score":0.002487256,"about_ca_system_score_codex":0.00075873005,"about_ca_system_score_gemma":0.00042845754,"threshold_uncertainty_score":0.005996585},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09722842,0.011800571,0.80084187,0.032637086,0.0015045074,0.0000693554,0.00010511006,0.001977633,0.053835493],"genre_scores_gemma":[0.6871369,0.0069896947,0.28868482,0.0037166304,0.0007362392,0.00024469793,0.00013280589,0.0005911297,0.011767168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987888,0.00036580258,0.00005963362,0.00017944125,0.00048328488,0.00012305043],"domain_scores_gemma":[0.99819994,0.0006179566,0.00013330003,0.0006772834,0.00026883034,0.00010267752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034073389,0.00039761732,0.00036930753,0.0006290196,0.0006585019,0.0023368017,0.0013422206,0.0010009997,0.0018774396],"category_scores_gemma":[0.0061693513,0.0004279251,0.0002651178,0.00057779043,0.0033561192,0.007817268,0.0019325322,0.0038958683,0.0007144078],"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.00012026205,0.000049481892,0.00072772213,0.0002340465,0.000015672964,0.000076076736,0.0005362635,0.013311828,0.009122047,0.84839,0.009553474,0.1178632],"study_design_scores_gemma":[0.00006351249,0.00030162072,0.0006450058,0.0003017364,0.000020722055,0.00024369705,0.00062300893,0.072250985,0.020605855,0.75025386,0.15463209,0.0000579056],"about_ca_topic_score_codex":0.00035397624,"about_ca_topic_score_gemma":0.00040552256,"teacher_disagreement_score":0.0034073389,"about_ca_system_score_codex":0.0009006312,"about_ca_system_score_gemma":0.0008738963,"threshold_uncertainty_score":0.018019974},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05582468,0.01687989,0.71738017,0.0013112429,0.00036113456,0.0006380696,0.0027314033,0.0025556018,0.20231782],"genre_scores_gemma":[0.5412911,0.014679876,0.3745188,0.0004836378,0.0003712093,0.0006873387,0.0032153486,0.0013686247,0.063383974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991642,0.000102232014,0.000049062313,0.000143305,0.0004861071,0.00005514278],"domain_scores_gemma":[0.9991192,0.00034704836,0.000106213556,0.00014416115,0.0002521469,0.000031125044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004667344,0.000671817,0.00042057058,0.001811597,0.00056530477,0.001895403,0.00049622176,0.00038650344,0.00693672],"category_scores_gemma":[0.0017571913,0.00029335468,0.00034378245,0.0018492698,0.0006685191,0.0017407683,0.00058254873,0.0007982183,0.0016456641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011591583,0.00013043011,0.0042691333,0.0014032117,0.000057528465,0.00026289077,0.00054388423,0.07541971,0.07830904,0.49010575,0.021366771,0.3280157],"study_design_scores_gemma":[0.000015679905,0.00016127637,0.0077664442,0.0005078522,0.000048417318,0.0012085714,0.00033908803,0.21856019,0.08233669,0.24088861,0.44809383,0.00007331387],"about_ca_topic_score_codex":0.00079291983,"about_ca_topic_score_gemma":0.0011945041,"teacher_disagreement_score":0.00693672,"about_ca_system_score_codex":0.0007501038,"about_ca_system_score_gemma":0.00073304004,"threshold_uncertainty_score":0.023205698},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14272863,0.002280183,0.7872419,0.0010221425,0.00087383087,0.0004318753,0.0014709049,0.016527573,0.04742296],"genre_scores_gemma":[0.55649817,0.00068175246,0.4190982,0.0006230569,0.00012515202,0.00031961335,0.0022258586,0.0003852789,0.020042889],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99984074,0.000020638385,0.0000105570725,0.000024060884,0.0000711042,0.000032734006],"domain_scores_gemma":[0.99975055,0.000037246948,0.000024303667,0.000056519468,0.00009693674,0.00003443128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018731116,0.00039507487,0.00029762258,0.00047681056,0.00032343186,0.0006464568,0.0010091139,0.00037861086,0.00910857],"category_scores_gemma":[0.0005461013,0.00018774872,0.0002661681,0.0008382693,0.00021472285,0.00059346063,0.00053704187,0.00076939305,0.0019374755],"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.0016920178,0.00036429928,0.0052578878,0.001066133,0.00014906272,0.001025212,0.0002946283,0.06089337,0.25952867,0.06566781,0.105146885,0.49891403],"study_design_scores_gemma":[0.00026534777,0.0009070408,0.0038826056,0.00011122503,0.00008607528,0.0009954396,0.000096521704,0.64571524,0.15055165,0.010574711,0.18668488,0.00012921762],"about_ca_topic_score_codex":0.00092155696,"about_ca_topic_score_gemma":0.0013849568,"teacher_disagreement_score":0.00910857,"about_ca_system_score_codex":0.00046209828,"about_ca_system_score_gemma":0.00068476726,"threshold_uncertainty_score":0.030471206},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8488814,0.0007536067,0.124119,0.0007354394,0.00023425983,0.00009633801,0.00057972537,0.008432429,0.01616772],"genre_scores_gemma":[0.9161597,0.00031106794,0.0644218,0.00035877837,0.00010853351,0.00012890653,0.0011106515,0.004146512,0.013254124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953923,0.00069307134,0.00034078528,0.00080083596,0.0020279726,0.00074495317],"domain_scores_gemma":[0.9843717,0.0068363445,0.001384598,0.004635514,0.0019544826,0.0008173045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022690066,0.00057684426,0.00042294996,0.00096906105,0.0013915376,0.0020253998,0.0018670968,0.000995084,0.0032426915],"category_scores_gemma":[0.019895209,0.0009973258,0.0005011922,0.001746042,0.0013531839,0.0029982817,0.0018349121,0.0022633958,0.0012121542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004605124,0.0011657799,0.08425268,0.00091971696,0.00017380333,0.0025041923,0.0046927375,0.092080675,0.12090718,0.120964594,0.04154286,0.52619064],"study_design_scores_gemma":[0.0003254909,0.0007668637,0.04184405,0.00029384042,0.0003123765,0.00468607,0.002181086,0.56899124,0.13964045,0.18864773,0.05205267,0.00025821457],"about_ca_topic_score_codex":0.0019826358,"about_ca_topic_score_gemma":0.0055602137,"teacher_disagreement_score":0.0032426915,"about_ca_system_score_codex":0.00090827496,"about_ca_system_score_gemma":0.0019411839,"threshold_uncertainty_score":0.011999786},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09239813,0.0033437442,0.80822223,0.00078312826,0.0011901039,0.000088915534,0.00014683943,0.012137081,0.081689864],"genre_scores_gemma":[0.62507254,0.0009834942,0.33043346,0.00020462992,0.00022471265,0.000062045714,0.00027649407,0.00072511914,0.042017512],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99977845,0.00003371185,0.000009207854,0.00003212965,0.00010017567,0.000046328692],"domain_scores_gemma":[0.9997106,0.00006042832,0.000013325073,0.0000821109,0.000101284706,0.00003222195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021365703,0.0005123197,0.00033275047,0.0003874266,0.00033923192,0.0010846133,0.00111638,0.00044690588,0.009267243],"category_scores_gemma":[0.0006718968,0.00026618864,0.00020773766,0.00059332774,0.00018491446,0.00091691763,0.00073845143,0.0008187848,0.0020451564],"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.0007124038,0.00028407667,0.0019045797,0.00028259135,0.00008154289,0.00036639505,0.00014868379,0.08104791,0.07644177,0.03844881,0.02268297,0.77759826],"study_design_scores_gemma":[0.00014530403,0.00052409316,0.0018830217,0.00008788459,0.000077818004,0.00053810835,0.00011184632,0.77967185,0.09217837,0.031864222,0.092868045,0.000049480223],"about_ca_topic_score_codex":0.0011135356,"about_ca_topic_score_gemma":0.0022864062,"teacher_disagreement_score":0.009267243,"about_ca_system_score_codex":0.00047225802,"about_ca_system_score_gemma":0.00036683097,"threshold_uncertainty_score":0.031001985},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057602003,0.0007315566,0.49655515,0.0002535525,0.0002081378,0.00026171494,0.0135045005,0.47758475,0.0051403986],"genre_scores_gemma":[0.14383748,0.0017270409,0.6996485,0.0010319101,0.00014459093,0.0020581752,0.05535911,0.07923683,0.016956227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890864,0.0001938881,0.00015268417,0.00025136996,0.0003852184,0.000108261236],"domain_scores_gemma":[0.9968683,0.002010324,0.0002792913,0.0003957604,0.00037593793,0.000070370785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016252998,0.0039647343,0.0009818401,0.0020739103,0.0005149122,0.0021038975,0.0038843693,0.0016361948,0.037020743],"category_scores_gemma":[0.008588888,0.0021313669,0.00278405,0.0011005816,0.00058483635,0.0023869288,0.0016186698,0.0030307842,0.012150724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007691629,0.00039314397,0.011473951,0.0037505603,0.0006085955,0.0010578941,0.0003878259,0.39400604,0.014883953,0.01714276,0.21900989,0.33651614],"study_design_scores_gemma":[0.0002661308,0.00018117469,0.0011303475,0.00029096645,0.00008767897,0.00030390426,0.00007198602,0.8764054,0.020318149,0.014659519,0.086161055,0.00012370851],"about_ca_topic_score_codex":0.0065255375,"about_ca_topic_score_gemma":0.013449939,"teacher_disagreement_score":0.037020743,"about_ca_system_score_codex":0.0011312729,"about_ca_system_score_gemma":0.0027632865,"threshold_uncertainty_score":0.12384671},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016099216,0.0006598289,0.9084836,0.00063856156,0.0011856436,0.00008494364,0.0014634171,0.036309462,0.035075184],"genre_scores_gemma":[0.14777045,0.00045254565,0.8013147,0.00041131038,0.0004480006,0.00043701608,0.0036580714,0.011306216,0.034201603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991109,0.00012396931,0.0000527252,0.000101739584,0.00050479505,0.00010587146],"domain_scores_gemma":[0.99780136,0.00042274166,0.000071037175,0.0008879491,0.0006813725,0.00013561414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006410552,0.0013280186,0.0014350804,0.0013001553,0.0018110952,0.0016725472,0.0037911911,0.0011045103,0.033121586],"category_scores_gemma":[0.0036224907,0.00076684396,0.0014067173,0.0027103196,0.0006581791,0.0023017589,0.002862153,0.0024588376,0.014144326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009740166,0.00033081588,0.0016526722,0.00046610888,0.00020719744,0.0004260572,0.00050176925,0.13759196,0.02809385,0.096857004,0.16506004,0.5678386],"study_design_scores_gemma":[0.00022223454,0.00009905097,0.0008773831,0.000056260204,0.00006528053,0.00019049179,0.00008550658,0.82146704,0.020543324,0.077992186,0.07829316,0.00010803849],"about_ca_topic_score_codex":0.0052145324,"about_ca_topic_score_gemma":0.0105944285,"teacher_disagreement_score":0.033121586,"about_ca_system_score_codex":0.0008367594,"about_ca_system_score_gemma":0.0010587086,"threshold_uncertainty_score":0.11080277},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81391186,0.003985128,0.1327083,0.00358149,0.00038970637,0.00006329496,0.00018195748,0.0013125932,0.043865614],"genre_scores_gemma":[0.99067444,0.00025088032,0.0055292323,0.00042456968,0.00007924253,0.000025302275,0.000028381262,0.000063690655,0.002924177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985487,0.00022271568,0.000054991997,0.0002632727,0.00030516356,0.000605135],"domain_scores_gemma":[0.9960375,0.0014554549,0.0005234673,0.0010329357,0.00053834537,0.00041223573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010889968,0.00037506942,0.00059429783,0.00034969806,0.0009770832,0.0014590793,0.0014091864,0.0016508931,0.0042241756],"category_scores_gemma":[0.0057237577,0.00034086435,0.0002130766,0.00047041167,0.001482695,0.0028489898,0.0017976031,0.0010968853,0.0008856408],"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.0016386127,0.000584911,0.06202299,0.0009883273,0.00021720775,0.009483144,0.0026018328,0.16516517,0.10583457,0.37529838,0.030780975,0.24538386],"study_design_scores_gemma":[0.00018857917,0.0009452214,0.026551956,0.00016463296,0.0001627511,0.010695979,0.0023508358,0.45422027,0.063831076,0.34720007,0.0935288,0.00015980926],"about_ca_topic_score_codex":0.0008799038,"about_ca_topic_score_gemma":0.0013569071,"teacher_disagreement_score":0.0042241756,"about_ca_system_score_codex":0.0007061892,"about_ca_system_score_gemma":0.00060054264,"threshold_uncertainty_score":0.014131308},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013287068,0.00036823686,0.9395277,0.00036967034,0.00007184678,0.00011694528,0.00019581284,0.043260634,0.0028020435],"genre_scores_gemma":[0.38572598,0.0006699039,0.59204245,0.000622988,0.00012816269,0.0004719482,0.0014439812,0.0047354354,0.01415918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991714,0.00020450557,0.000072359326,0.00021313233,0.00025132674,0.00008741337],"domain_scores_gemma":[0.9988426,0.00022520148,0.000078154735,0.0006388124,0.00014360386,0.00007169187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012076516,0.0009419831,0.00061845814,0.00068677886,0.0005406144,0.0019957752,0.0027856606,0.0010406699,0.006181862],"category_scores_gemma":[0.00303919,0.0005977403,0.00086928747,0.0005400414,0.0009379891,0.004500879,0.003023001,0.0020626483,0.00276897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001557855,0.00046332166,0.002597578,0.0005806076,0.00017925509,0.0005493056,0.0015898116,0.08580228,0.09066598,0.13180871,0.033993624,0.6502117],"study_design_scores_gemma":[0.000069567504,0.0002174421,0.0004335696,0.000047649173,0.00006949728,0.0002816004,0.000121834106,0.8438689,0.05425458,0.05375562,0.04678615,0.00009360537],"about_ca_topic_score_codex":0.0031654793,"about_ca_topic_score_gemma":0.0032891927,"teacher_disagreement_score":0.006181862,"about_ca_system_score_codex":0.0012477231,"about_ca_system_score_gemma":0.0014256252,"threshold_uncertainty_score":0.020680428},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24894667,0.0047369595,0.72222096,0.00025710533,0.0002557664,0.0002813927,0.00037759868,0.010851729,0.012071749],"genre_scores_gemma":[0.90954274,0.0003651706,0.08571628,0.00018340247,0.00008596442,0.00015496575,0.00028934106,0.00025194645,0.0034101992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979867,0.00025673382,0.00021528218,0.0003470516,0.0009198579,0.00027433076],"domain_scores_gemma":[0.9942814,0.0015347535,0.001061862,0.001910169,0.00097062043,0.00024118501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011942959,0.0004906565,0.00058493664,0.0012986048,0.0005533459,0.0010295582,0.0020938155,0.00049182685,0.0033244386],"category_scores_gemma":[0.005962013,0.00029724205,0.00032798774,0.001069731,0.00076176814,0.0018832567,0.0014758946,0.0007392485,0.0007929414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019871988,0.00042751766,0.020685716,0.00059548626,0.00014908255,0.0002913991,0.00044102877,0.0849365,0.20197856,0.033215683,0.0067792493,0.64851254],"study_design_scores_gemma":[0.0003586228,0.0026120043,0.008727484,0.00016259133,0.0002601914,0.001470169,0.00020655293,0.64203393,0.2854814,0.020055437,0.038340297,0.0002913444],"about_ca_topic_score_codex":0.0010531413,"about_ca_topic_score_gemma":0.0013629729,"teacher_disagreement_score":0.0033244386,"about_ca_system_score_codex":0.00062411564,"about_ca_system_score_gemma":0.0017870136,"threshold_uncertainty_score":0.011121392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23549704,0.0004949099,0.721187,0.0007643203,0.0003969362,0.00018646389,0.0012031203,0.009991655,0.03027861],"genre_scores_gemma":[0.69840205,0.00022540712,0.29298237,0.00015227552,0.000037273898,0.0001853185,0.0014721153,0.00064223417,0.0059010307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997291,0.000055884197,0.000016499798,0.00005014178,0.00010154123,0.00004690602],"domain_scores_gemma":[0.9994862,0.00016861413,0.000027178523,0.000118745,0.0001492722,0.00004991131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038232817,0.00062089256,0.0005592974,0.0003953671,0.0005416607,0.0007885138,0.0010242669,0.00058719475,0.0044429917],"category_scores_gemma":[0.0014842976,0.0003903171,0.0007171934,0.0005860891,0.0004515787,0.00071046216,0.0008038764,0.0010482456,0.0007077742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021598715,0.000069331596,0.0022917655,0.00009850878,0.000049444927,0.00021881635,0.00012708569,0.9320251,0.010511031,0.01886099,0.004380319,0.031151608],"study_design_scores_gemma":[0.00001776784,0.0000127354315,0.00015560006,0.000003241218,0.0000030216027,0.0000154918,0.000010809306,0.9930902,0.0018020382,0.0027608403,0.0021239347,0.0000043588166],"about_ca_topic_score_codex":0.010496552,"about_ca_topic_score_gemma":0.009958476,"teacher_disagreement_score":0.010496552,"about_ca_system_score_codex":0.0007422797,"about_ca_system_score_gemma":0.0010805767,"threshold_uncertainty_score":0.020870924},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034677725,0.000043723667,0.9590525,0.0001535695,0.00005207379,0.00006838505,0.00003786419,0.0005981611,0.0053159534],"genre_scores_gemma":[0.5194036,0.00011519657,0.475596,0.00009765722,0.00003330697,0.000265868,0.00014381071,0.0002687895,0.0040758047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916375,0.0002938355,0.000061492436,0.000116296505,0.0002691307,0.000095483345],"domain_scores_gemma":[0.99814403,0.0009468476,0.00011693647,0.0004492592,0.00023690467,0.00010600652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013129045,0.00049172534,0.0004255295,0.00071462407,0.00066265604,0.001265915,0.0017767382,0.00073996285,0.0031443916],"category_scores_gemma":[0.0044527655,0.00034727596,0.0008714811,0.00048462843,0.0017546236,0.0021467747,0.0019712078,0.0013793198,0.00041242564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008079742,0.000058502585,0.0003759492,0.00004801244,0.000020212477,0.00007260996,0.0001520246,0.13993141,0.0037175126,0.8411674,0.00045950024,0.013916185],"study_design_scores_gemma":[0.000030305739,0.00002779741,0.000027461641,0.000008384014,0.000009234641,0.000017244933,0.000015983274,0.8779342,0.0054455297,0.1149438,0.0015272184,0.000012751487],"about_ca_topic_score_codex":0.0013360478,"about_ca_topic_score_gemma":0.0013983067,"teacher_disagreement_score":0.0031443916,"about_ca_system_score_codex":0.0013612956,"about_ca_system_score_gemma":0.0012054725,"threshold_uncertainty_score":0.010519028},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017383777,0.0012253894,0.89006364,0.0010778168,0.00035745662,0.00020911198,0.0006574603,0.06218135,0.026844084],"genre_scores_gemma":[0.22122525,0.0011037964,0.7498097,0.00097289606,0.00032882355,0.00029451176,0.002537011,0.010449189,0.013278948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853206,0.00024917477,0.00006571103,0.0002264944,0.0007174094,0.00020912397],"domain_scores_gemma":[0.9981255,0.00046075444,0.00011506235,0.0006405714,0.00046813994,0.00019001482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015972834,0.0009891825,0.0005047007,0.00077528646,0.00053033535,0.0019486285,0.0028782508,0.0007363366,0.008227977],"category_scores_gemma":[0.0032941957,0.00054467074,0.0007986595,0.00063054956,0.0010447815,0.003286544,0.0021825265,0.0031332136,0.0031146174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010337409,0.0005970693,0.003018662,0.0011811143,0.00013995475,0.00035559307,0.0008487628,0.089005694,0.065944955,0.18364915,0.07228289,0.5819424],"study_design_scores_gemma":[0.00022677275,0.00034264923,0.00070371525,0.00021534484,0.00010040606,0.0002849002,0.000082398554,0.5104654,0.060076773,0.03910606,0.38826302,0.00013258442],"about_ca_topic_score_codex":0.0038893763,"about_ca_topic_score_gemma":0.0028902832,"teacher_disagreement_score":0.008227977,"about_ca_system_score_codex":0.00084413827,"about_ca_system_score_gemma":0.0026764302,"threshold_uncertainty_score":0.027525306},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08231684,0.0006636993,0.81935585,0.00052487873,0.00086510385,0.000192175,0.00091446406,0.03760279,0.057564136],"genre_scores_gemma":[0.41479972,0.00018637067,0.56482893,0.00033159132,0.000106746826,0.00036021936,0.0009727774,0.005105902,0.013307826],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998292,0.000036774567,0.0000071778386,0.000017832948,0.000067743036,0.00004136766],"domain_scores_gemma":[0.9997553,0.00005422175,0.000011207018,0.00007632424,0.000059068978,0.000043770386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002693854,0.0007237466,0.00090468425,0.00040641578,0.0005789936,0.0008964681,0.002009624,0.00077281764,0.01926612],"category_scores_gemma":[0.0011228155,0.00038387213,0.0005593104,0.0005970519,0.0004339704,0.00065295777,0.0013851363,0.0014976856,0.0041154134],"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.0014658786,0.00036585855,0.0027884038,0.0006046026,0.00038243338,0.0010093262,0.0005355632,0.24887697,0.031401277,0.14308327,0.08794907,0.4815374],"study_design_scores_gemma":[0.00014132814,0.000058754315,0.00039277703,0.000031744068,0.00002411847,0.000079851765,0.000042042986,0.96457803,0.00805366,0.014309981,0.012258105,0.000029658615],"about_ca_topic_score_codex":0.0030755128,"about_ca_topic_score_gemma":0.0074812146,"teacher_disagreement_score":0.01926612,"about_ca_system_score_codex":0.00047930935,"about_ca_system_score_gemma":0.0011105848,"threshold_uncertainty_score":0.064451635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33966637,0.0004834687,0.64938694,0.00030359137,0.00007370864,0.00010571747,0.00025992992,0.0025567238,0.007163551],"genre_scores_gemma":[0.9070408,0.00016740133,0.08692884,0.00009366671,0.00002906093,0.00011233853,0.00024490565,0.00047667287,0.004906299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995009,0.00016902169,0.000030747393,0.00011926802,0.00009040645,0.00008961508],"domain_scores_gemma":[0.9962154,0.0022244663,0.00039771045,0.00061104895,0.0002708541,0.0002804879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069132214,0.0005278929,0.00065331446,0.0010327583,0.00071241,0.0008301511,0.0012341447,0.000772179,0.0047579156],"category_scores_gemma":[0.0057121003,0.0006175481,0.00046108782,0.0010184476,0.0011075716,0.0028679017,0.0012961111,0.0013140186,0.0002886502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006360724,0.00022657288,0.0015681754,0.00022047978,0.000053371936,0.0005743288,0.00030520032,0.75091356,0.0074590053,0.17876227,0.0026669393,0.056613944],"study_design_scores_gemma":[0.000027298229,0.000060013597,0.00025412702,0.000015318163,0.000019176578,0.000038250935,0.00003271563,0.82028645,0.0016714794,0.17693886,0.0006439907,0.000012221407],"about_ca_topic_score_codex":0.003629906,"about_ca_topic_score_gemma":0.0051933997,"teacher_disagreement_score":0.0047579156,"about_ca_system_score_codex":0.00075869134,"about_ca_system_score_gemma":0.0009523047,"threshold_uncertainty_score":0.015916824},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42666587,0.0043470454,0.4643573,0.0014991043,0.00085687905,0.00060948293,0.0035253905,0.05745902,0.040679872],"genre_scores_gemma":[0.876856,0.00038294596,0.10451753,0.0005072851,0.00009606501,0.0002650882,0.0023685948,0.0012885819,0.0137179615],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99952996,0.00005875988,0.000055644094,0.000092121045,0.00017908734,0.00008438746],"domain_scores_gemma":[0.9988304,0.00020499551,0.00016388852,0.00045409362,0.00029429403,0.000052412353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003354518,0.0008567758,0.0003481534,0.0006072298,0.00045072162,0.000846825,0.0019030791,0.00037390966,0.020835578],"category_scores_gemma":[0.0016923405,0.00027895975,0.00038233306,0.0008025859,0.00029022119,0.001452838,0.0006884135,0.00063812046,0.00396828],"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.002711855,0.00034585156,0.009648645,0.0011238307,0.00014698984,0.0008789809,0.0003471439,0.022619536,0.20684955,0.022332443,0.08527097,0.6477242],"study_design_scores_gemma":[0.0005041319,0.0015675195,0.0043657804,0.00018832555,0.00022483688,0.001155169,0.00021388469,0.21080539,0.6315039,0.011343202,0.13796535,0.00016259948],"about_ca_topic_score_codex":0.0013898305,"about_ca_topic_score_gemma":0.0037496826,"teacher_disagreement_score":0.020835578,"about_ca_system_score_codex":0.0009589572,"about_ca_system_score_gemma":0.0011374614,"threshold_uncertainty_score":0.06970197},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.448168,0.011932283,0.4751933,0.010613235,0.0017781848,0.00028114434,0.00047611017,0.028627908,0.022929803],"genre_scores_gemma":[0.84891295,0.00080028916,0.14105786,0.0023423326,0.00018771211,0.00018560891,0.00047543528,0.001406961,0.004630864],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99595624,0.0012656896,0.0002834702,0.0005705003,0.001380429,0.0005435856],"domain_scores_gemma":[0.9853507,0.0043221363,0.0008468745,0.0071352255,0.0018675055,0.00047750722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003625726,0.0010968554,0.0007874078,0.0006883804,0.0010574461,0.002766055,0.0034362336,0.0018147529,0.0028112463],"category_scores_gemma":[0.017877482,0.0009783393,0.0007558006,0.0010326087,0.0020447508,0.0055584977,0.002411769,0.0037352198,0.0013672203],"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.004276039,0.00058353756,0.07693069,0.0012179179,0.0003723594,0.004131775,0.0041593867,0.09893648,0.16324927,0.13947913,0.059568785,0.4470946],"study_design_scores_gemma":[0.00027962576,0.0010583116,0.0055468148,0.00040323794,0.00021739336,0.0018819453,0.00078440487,0.6279958,0.17062744,0.078066595,0.11294621,0.00019222035],"about_ca_topic_score_codex":0.00408206,"about_ca_topic_score_gemma":0.0057302904,"teacher_disagreement_score":0.00408206,"about_ca_system_score_codex":0.001477981,"about_ca_system_score_gemma":0.002837022,"threshold_uncertainty_score":0.019174874},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6385523,0.0023710695,0.28371885,0.00093285815,0.0003282562,0.00032094814,0.0006208429,0.01593436,0.05722052],"genre_scores_gemma":[0.92197967,0.00024337159,0.057639472,0.00030654552,0.00004671046,0.00018661887,0.00045862468,0.0003195129,0.018819533],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999819,0.000022861179,0.000007753928,0.000039745246,0.00007140471,0.000039282986],"domain_scores_gemma":[0.9997017,0.000087964414,0.000048186455,0.00008106058,0.000053304702,0.000027855753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002994253,0.00030777653,0.00028331636,0.0003191178,0.00045254637,0.0006906244,0.001402587,0.00034330293,0.008419225],"category_scores_gemma":[0.00058519567,0.00020804968,0.00014270293,0.0004551371,0.00043793244,0.0018317428,0.0009727079,0.00057120324,0.0013509413],"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.0026453207,0.00064160913,0.007261799,0.0008849491,0.00007301346,0.0015796714,0.0011102046,0.07508246,0.4034641,0.11868462,0.05694066,0.33163148],"study_design_scores_gemma":[0.00020878631,0.00070454966,0.0022881147,0.000064719214,0.000049975468,0.00054264336,0.0002936818,0.5528443,0.3346195,0.013048991,0.09525185,0.000082921724],"about_ca_topic_score_codex":0.0008961287,"about_ca_topic_score_gemma":0.0016946008,"teacher_disagreement_score":0.008419225,"about_ca_system_score_codex":0.00071599626,"about_ca_system_score_gemma":0.00052885606,"threshold_uncertainty_score":0.028165102},"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":"commentary","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080080476,0.0034695456,0.0016690826,0.6085731,0.34071487,0.00021921385,0.0013281262,0.0008649459,0.04236037],"genre_scores_gemma":[0.0077592293,0.002825914,0.0022069567,0.34314895,0.09420397,0.00050785136,0.0009906314,0.0007200186,0.5476365],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959545,0.00046139897,0.00019650809,0.00053438474,0.002426454,0.00042682726],"domain_scores_gemma":[0.9859591,0.0009724979,0.00047065783,0.00053072564,0.008529163,0.003537837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042451676,0.00079828105,0.0008395379,0.0010653218,0.002693166,0.0052543585,0.0013349894,0.00672368,0.09328462],"category_scores_gemma":[0.012904076,0.00059243717,0.0007135512,0.0007091934,0.000673323,0.0022997567,0.0019111725,0.009747025,0.06984293],"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.0000131085435,0.0000063860357,0.00004579513,0.000011817221,0.000001136186,0.000012089096,0.0000041518406,0.000008045061,0.00004504346,0.0003429616,0.9963858,0.0031235677],"study_design_scores_gemma":[0.000010475214,0.00001633917,0.00038386235,0.000027052427,0.0000032748067,0.000031829015,0.000029204795,0.000048579986,0.00014646498,0.00023952009,0.99905425,0.000009218206],"about_ca_topic_score_codex":0.0033636556,"about_ca_topic_score_gemma":0.0060179513,"teacher_disagreement_score":0.09328462,"about_ca_system_score_codex":0.0026747177,"about_ca_system_score_gemma":0.0066305865,"threshold_uncertainty_score":0.31206816},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008268644,0.0065368293,0.8111839,0.0022281893,0.0034787897,0.00007329588,0.00013972585,0.0016779249,0.16641268],"genre_scores_gemma":[0.14277758,0.010607897,0.68704903,0.0012626685,0.0023027703,0.00021837576,0.00032106013,0.0010731082,0.15438755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998093,0.000029771842,0.0000074749205,0.000031543004,0.000103184946,0.000018651792],"domain_scores_gemma":[0.99981445,0.00006364091,0.000008987007,0.000054719927,0.000042839998,0.00001546331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022677294,0.0005743374,0.0003818559,0.00045952073,0.0005976056,0.0016606356,0.00094051094,0.00056638697,0.008787478],"category_scores_gemma":[0.0006887465,0.00030252544,0.00042446985,0.0010502542,0.0010294645,0.0021074545,0.0011812409,0.0018805866,0.002636418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057305435,0.000043958895,0.00011847732,0.00020930296,0.000025838553,0.0000964473,0.00011185714,0.014474701,0.009471747,0.8261623,0.020897487,0.12833072],"study_design_scores_gemma":[0.000024841638,0.000057324745,0.00013048352,0.000071287046,0.00002397414,0.00031180613,0.00004428201,0.1206696,0.010500092,0.52411664,0.34402084,0.000028807597],"about_ca_topic_score_codex":0.00039740952,"about_ca_topic_score_gemma":0.00057878945,"teacher_disagreement_score":0.008787478,"about_ca_system_score_codex":0.00053832366,"about_ca_system_score_gemma":0.00038147645,"threshold_uncertainty_score":0.02939707},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00491649,0.0013874911,0.90100473,0.0005089892,0.00068878644,0.00012280696,0.00031565301,0.0013616225,0.089693405],"genre_scores_gemma":[0.12473394,0.0011752676,0.7407951,0.0007670021,0.00030871254,0.0007144281,0.00076677866,0.001932504,0.12880628],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975973,0.00007130086,0.000010530155,0.00004157915,0.000090813744,0.000026106363],"domain_scores_gemma":[0.99979776,0.000074628646,0.000014640711,0.0000411609,0.00005618667,0.000015628788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004259012,0.0007593626,0.0013936735,0.0006974978,0.0006899067,0.0009579632,0.0010649423,0.0011091216,0.024945507],"category_scores_gemma":[0.0012623834,0.00037299417,0.0007760678,0.00062544324,0.00065841817,0.0006874662,0.0013274507,0.0015541998,0.009779294],"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.00030277774,0.00015534379,0.00043032493,0.0009856541,0.000184289,0.00029779706,0.00017592285,0.18851732,0.011651771,0.2975619,0.07073688,0.42900005],"study_design_scores_gemma":[0.00012125191,0.00014813496,0.00050362357,0.00020874884,0.000069818285,0.000498271,0.00006989357,0.76540273,0.01044125,0.08458944,0.13785933,0.00008750681],"about_ca_topic_score_codex":0.0013738294,"about_ca_topic_score_gemma":0.0025869678,"teacher_disagreement_score":0.024945507,"about_ca_system_score_codex":0.0004677706,"about_ca_system_score_gemma":0.0011312712,"threshold_uncertainty_score":0.08345097},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022443203,0.00034828827,0.9596326,0.0001460266,0.00012106944,0.00008892152,0.00006404282,0.003550156,0.013605661],"genre_scores_gemma":[0.33713424,0.00043115576,0.6431317,0.00018581627,0.000110562076,0.00017486047,0.00029518496,0.000343619,0.018192984],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996031,0.00006187822,0.000028860088,0.000083472965,0.00016737022,0.000055362114],"domain_scores_gemma":[0.9992829,0.00015366916,0.000077302066,0.00023827021,0.00021967989,0.00002823056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003352312,0.0007391336,0.00028001468,0.0006558332,0.00050596,0.0011504464,0.0013848467,0.0003971474,0.010981773],"category_scores_gemma":[0.0012342305,0.00035073725,0.0003975059,0.00084110093,0.00042249518,0.0015375788,0.00063102477,0.00075972197,0.002529276],"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.0005718225,0.00022619242,0.001139388,0.0005324074,0.00010965796,0.00045578516,0.00031092044,0.04896002,0.23349483,0.12511133,0.0110151665,0.5780725],"study_design_scores_gemma":[0.00014765987,0.00086130016,0.001301872,0.00011006666,0.000100209094,0.001710621,0.00015204387,0.5165363,0.30484658,0.05051583,0.12360999,0.00010754384],"about_ca_topic_score_codex":0.00092937035,"about_ca_topic_score_gemma":0.0027154982,"teacher_disagreement_score":0.010981773,"about_ca_system_score_codex":0.00057281624,"about_ca_system_score_gemma":0.00081408536,"threshold_uncertainty_score":0.03673768},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047585275,0.0006074411,0.3894082,0.00025552677,0.00019869315,0.00024406612,0.019294377,0.58064,0.004593129],"genre_scores_gemma":[0.14215016,0.001586148,0.61437106,0.0010287069,0.00014668093,0.0022358655,0.09167151,0.12868537,0.01812442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856335,0.00025121475,0.00019596877,0.00031925447,0.00053375703,0.0001364533],"domain_scores_gemma":[0.9960169,0.0024993573,0.00034513933,0.0004947244,0.00054807,0.00009576443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020287884,0.004281031,0.0011820039,0.002418087,0.0005411836,0.0023988946,0.0046367813,0.0018022783,0.048641518],"category_scores_gemma":[0.010981742,0.0024167234,0.0030943793,0.0012968329,0.00071031763,0.0023656602,0.0019974122,0.0031031687,0.016836261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008427152,0.00040063515,0.01048034,0.004533924,0.0005993358,0.0012274216,0.00038620766,0.35859406,0.012653772,0.017668627,0.30038086,0.29223213],"study_design_scores_gemma":[0.00035058171,0.00019239425,0.001394031,0.00039356877,0.00010190324,0.00031533174,0.00007748281,0.84013176,0.022736086,0.018717967,0.11542882,0.00016005173],"about_ca_topic_score_codex":0.006316633,"about_ca_topic_score_gemma":0.011748326,"teacher_disagreement_score":0.048641518,"about_ca_system_score_codex":0.0012749145,"about_ca_system_score_gemma":0.002890767,"threshold_uncertainty_score":0.16272211},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05732611,0.00033691918,0.8847477,0.0005368343,0.00027321858,0.00077424437,0.00068060996,0.03458797,0.02073642],"genre_scores_gemma":[0.42131814,0.00036148945,0.5527359,0.0005417635,0.00012007938,0.0018398637,0.0031200699,0.0041776663,0.015785018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915636,0.00013613857,0.00006451043,0.00013655244,0.00034221608,0.00016425249],"domain_scores_gemma":[0.99876595,0.00014975415,0.000062225794,0.00028760516,0.00058877666,0.00014563116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008279986,0.0009106056,0.00059420575,0.0006660681,0.0010281727,0.0011647552,0.0037101568,0.0006571117,0.00429055],"category_scores_gemma":[0.002363152,0.0006135693,0.00056846644,0.00086272036,0.00075379584,0.0010325414,0.0013439034,0.001859509,0.002071855],"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.0018472363,0.001157783,0.0143492,0.0012920204,0.0005785336,0.0015719132,0.0025208006,0.36463818,0.12002587,0.080367714,0.102268666,0.30938214],"study_design_scores_gemma":[0.00023670525,0.00028466486,0.0018333863,0.000038502207,0.000071432754,0.00016083472,0.00017234162,0.8693546,0.059947483,0.007488517,0.06031894,0.00009257937],"about_ca_topic_score_codex":0.00552701,"about_ca_topic_score_gemma":0.0053737047,"teacher_disagreement_score":0.00552701,"about_ca_system_score_codex":0.00096581475,"about_ca_system_score_gemma":0.0024080502,"threshold_uncertainty_score":0.014353335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003361192,0.00016198897,0.9941553,0.00010910372,0.00006156594,0.00004457868,0.000156947,0.0007048049,0.001244468],"genre_scores_gemma":[0.26126266,0.00040167817,0.7266125,0.00023624738,0.0004854849,0.00031667406,0.0012183592,0.00048361983,0.008982723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998235,0.0004937044,0.00008668101,0.00037874357,0.0006913634,0.0001145871],"domain_scores_gemma":[0.99725217,0.0013017966,0.00018316782,0.0006743364,0.00047364092,0.0001148303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020530762,0.0009620205,0.0015122694,0.0013268902,0.0005634167,0.0015928366,0.0013343018,0.00092871214,0.0075065196],"category_scores_gemma":[0.008686897,0.0005680299,0.00078700494,0.00094054325,0.00066283165,0.0028737807,0.0027139024,0.0015542072,0.0023979284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005000251,0.0001875467,0.0026316433,0.0002678464,0.000272946,0.000186732,0.000095630756,0.18116857,0.040163707,0.13745356,0.012480011,0.62459177],"study_design_scores_gemma":[0.000023495764,0.000045230478,0.0005085964,0.000015278956,0.000028564127,0.00008215418,0.000009528311,0.9453744,0.0066488623,0.043987215,0.0032579338,0.000018663517],"about_ca_topic_score_codex":0.00093258667,"about_ca_topic_score_gemma":0.0014100402,"teacher_disagreement_score":0.0075065196,"about_ca_system_score_codex":0.0006153625,"about_ca_system_score_gemma":0.0011701895,"threshold_uncertainty_score":0.025111794},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89729124,0.00094703113,0.0410637,0.0004953736,0.00031061893,0.00016384102,0.003806647,0.011011784,0.0449098],"genre_scores_gemma":[0.9593195,0.000451349,0.024905356,0.00009786675,0.000034618424,0.00018111621,0.006198384,0.0012002648,0.0076115564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997253,0.00004910653,0.000017951248,0.0000540647,0.000087122426,0.00006645025],"domain_scores_gemma":[0.99898785,0.00030527683,0.000036593217,0.0001294985,0.00046174222,0.00007913661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002884579,0.00055556255,0.00036590052,0.00046701453,0.00031214824,0.00037679588,0.0008153438,0.00032243895,0.00720141],"category_scores_gemma":[0.0016148946,0.00020832398,0.00034258596,0.00079592096,0.00017265287,0.0005594229,0.0003295766,0.00063286873,0.0011542598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005205977,0.00091072515,0.015617752,0.00073823665,0.00023127468,0.00037941817,0.0003404547,0.62229985,0.062344994,0.0076698577,0.05122871,0.23303273],"study_design_scores_gemma":[0.00034033426,0.00065495,0.014718567,0.00003347779,0.00007723797,0.00013552739,0.00015658667,0.90127945,0.068158545,0.0014938506,0.012905564,0.000045928475],"about_ca_topic_score_codex":0.007900322,"about_ca_topic_score_gemma":0.005560554,"teacher_disagreement_score":0.007900322,"about_ca_system_score_codex":0.00040012007,"about_ca_system_score_gemma":0.00088590913,"threshold_uncertainty_score":0.024091065},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21352202,0.0005139237,0.77063584,0.0002594619,0.000024417232,0.00007072627,0.00008426399,0.002225432,0.012663973],"genre_scores_gemma":[0.8380035,0.000112833986,0.15972202,0.000056922818,0.000010116519,0.00006085004,0.000089330555,0.0002703251,0.001674148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994678,0.00013225852,0.00002399683,0.00006570452,0.00019989647,0.000110351735],"domain_scores_gemma":[0.99929297,0.00036822332,0.00008236233,0.0001690531,0.000060672686,0.00002675709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005046971,0.0007364036,0.0004958005,0.0005494038,0.00036701476,0.0006936709,0.00075326057,0.0003692665,0.0017709184],"category_scores_gemma":[0.0017957115,0.0002526924,0.00036263518,0.00057023606,0.00075096387,0.001078639,0.0009863601,0.0005613904,0.00040716847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025153405,0.00013844635,0.0016903923,0.00018732113,0.00003109693,0.00015598546,0.00019103647,0.7447697,0.047755066,0.026810298,0.0016591205,0.17636003],"study_design_scores_gemma":[0.000020251486,0.000108255044,0.00027295607,0.0000146191005,0.000014955368,0.0000456168,0.000041425625,0.960861,0.021857655,0.014860959,0.0018916505,0.000010626325],"about_ca_topic_score_codex":0.0019198075,"about_ca_topic_score_gemma":0.003277497,"teacher_disagreement_score":0.0019198075,"about_ca_system_score_codex":0.0008422185,"about_ca_system_score_gemma":0.0011697788,"threshold_uncertainty_score":0.006110728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063773134,0.0004857224,0.0009368913,0.00044764837,0.0003566026,0.00014928558,0.0011244025,0.0011975009,0.9946643],"genre_scores_gemma":[0.000944898,0.00035147686,0.00057310774,0.00031087748,0.00008015136,0.000075373675,0.0006551703,0.00027354376,0.9967354],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991555,0.000060877734,0.00008174911,0.00031451948,0.00019321108,0.000194217],"domain_scores_gemma":[0.99719065,0.0007790436,0.0001671267,0.00040008425,0.00064053014,0.00082255586],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001418106,0.003626603,0.0022875203,0.0028375387,0.0028872848,0.00493761,0.0036582157,0.0054470887,0.98952043],"category_scores_gemma":[0.0018641282,0.0013123769,0.0017133835,0.0032229316,0.0031876613,0.0064677843,0.0036577727,0.0034736688,0.9935615],"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.0006216494,0.000296599,0.0011705161,0.0007793553,0.0000636952,0.00032219265,0.00012755288,0.0007413301,0.0030903013,0.0058510043,0.41265425,0.5742816],"study_design_scores_gemma":[0.000102016915,0.00019012089,0.001121631,0.00050017744,0.000025278378,0.00046786308,0.00020290789,0.0004515343,0.00066851877,0.0010904329,0.99513644,0.00004312173],"about_ca_topic_score_codex":0.0053753387,"about_ca_topic_score_gemma":0.0039904793,"teacher_disagreement_score":0.010479569,"about_ca_system_score_codex":0.0013409996,"about_ca_system_score_gemma":0.0010014796,"threshold_uncertainty_score":0.014947772},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042576424,0.00042141837,0.00093167584,0.0003909688,0.00033269986,0.00011494006,0.0011177445,0.0011217805,0.99514294],"genre_scores_gemma":[0.0006170649,0.00021279017,0.00046352902,0.00017707756,0.000066625784,0.000059535138,0.00053776643,0.00021182437,0.9976539],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912435,0.00005948635,0.0000706922,0.0003127772,0.00024861333,0.0001840345],"domain_scores_gemma":[0.9975067,0.00068004994,0.00017996397,0.00033228946,0.00051232945,0.0007887717],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012702588,0.003304176,0.002233069,0.0032795493,0.0024066658,0.0045042834,0.0039236024,0.0060322015,0.99019253],"category_scores_gemma":[0.0018366054,0.0010739563,0.001717728,0.003562746,0.002227085,0.005808001,0.0033859145,0.003187511,0.99342597],"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.00043146004,0.0002548646,0.00085168297,0.0006778036,0.00004736319,0.000254877,0.00009721113,0.000623962,0.0022830332,0.0076798988,0.35812616,0.6286716],"study_design_scores_gemma":[0.000066547174,0.00012258367,0.00059920165,0.00032808282,0.000013844388,0.000280611,0.0000933556,0.00037423204,0.00046822525,0.0008460492,0.996779,0.000028229866],"about_ca_topic_score_codex":0.0046389075,"about_ca_topic_score_gemma":0.0031408526,"teacher_disagreement_score":0.009807467,"about_ca_system_score_codex":0.0015276509,"about_ca_system_score_gemma":0.0014767902,"threshold_uncertainty_score":0.013989091},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025453596,0.00051948766,0.0017162879,0.00030964075,0.00018381665,0.000060252172,0.0011483306,0.00147503,0.9943327],"genre_scores_gemma":[0.0007227607,0.00028810205,0.00064621057,0.0001052978,0.00003653286,0.000044018103,0.00066591846,0.00033663688,0.9971546],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999474,0.00003119111,0.00003316871,0.00019005717,0.00017444254,0.00009720742],"domain_scores_gemma":[0.9982346,0.0005608066,0.00012517787,0.00028125965,0.0003319895,0.0004660437],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009441615,0.0023047961,0.0016076526,0.002187932,0.0014171414,0.0044818805,0.0032629722,0.004138389,0.9823198],"category_scores_gemma":[0.0015948093,0.0009273139,0.0009714429,0.0026861518,0.0013178883,0.0044978117,0.002991513,0.0022722355,0.99119675],"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.00018500374,0.00013030376,0.00039815248,0.00049963966,0.000023855873,0.00011860897,0.000065137494,0.00048947276,0.0029106257,0.00683941,0.3460491,0.6422906],"study_design_scores_gemma":[0.0000251572,0.00005485136,0.00046907458,0.00024444135,0.000010093102,0.00020061957,0.00006441293,0.00024150715,0.0005669982,0.0013174305,0.9967894,0.000016028218],"about_ca_topic_score_codex":0.0028297324,"about_ca_topic_score_gemma":0.0023691626,"teacher_disagreement_score":0.017680228,"about_ca_system_score_codex":0.0010163394,"about_ca_system_score_gemma":0.00076525327,"threshold_uncertainty_score":0.025218725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026695582,0.0005158131,0.001640522,0.0003360569,0.00018911109,0.00006026154,0.0010317029,0.0014192058,0.9945404],"genre_scores_gemma":[0.00068216067,0.00028398464,0.0005725115,0.00012206878,0.000038126596,0.000042927226,0.0005965502,0.00031842678,0.9973431],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994286,0.000032250235,0.00003675759,0.0002083822,0.0001868359,0.0001071629],"domain_scores_gemma":[0.99801743,0.0006189347,0.00015205918,0.00030089752,0.00037544616,0.0005351917],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001007237,0.0023746137,0.0016674291,0.0021667834,0.0014871025,0.0049102097,0.0033412457,0.004396789,0.98275936],"category_scores_gemma":[0.0017156687,0.00092223776,0.0010033733,0.00257551,0.0013261769,0.005029108,0.0032154508,0.0022941793,0.9917101],"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.00018075148,0.0001392847,0.00042698334,0.00047657243,0.000023105227,0.00012994034,0.0000724616,0.00050594186,0.0028684384,0.0065957503,0.33645466,0.6521262],"study_design_scores_gemma":[0.000024387333,0.00005941619,0.0004996193,0.00027710618,0.000010409102,0.00021371609,0.000079635895,0.00023884607,0.0005281588,0.0013499644,0.9967019,0.000016921118],"about_ca_topic_score_codex":0.0027856075,"about_ca_topic_score_gemma":0.0024607845,"teacher_disagreement_score":0.017240644,"about_ca_system_score_codex":0.0010595204,"about_ca_system_score_gemma":0.0007922156,"threshold_uncertainty_score":0.024591625},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021625341,0.0003862077,0.0015345744,0.000291036,0.00017184018,0.00005444675,0.0007992045,0.0012393732,0.99530715],"genre_scores_gemma":[0.0005881024,0.00023936339,0.00058636157,0.00010962231,0.000035136807,0.000037566988,0.0005138387,0.00030410508,0.997586],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948525,0.000030635398,0.000032014632,0.00019018388,0.00017144902,0.00009044453],"domain_scores_gemma":[0.9981342,0.0005397045,0.00012168851,0.00030068602,0.00037875137,0.0005250147],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009176876,0.002167167,0.0014347347,0.0021730878,0.0013657322,0.0044988263,0.0030118222,0.0040706326,0.9832388],"category_scores_gemma":[0.0017158273,0.0008245646,0.000914744,0.0025820178,0.0012306155,0.004375582,0.0027628215,0.0020889621,0.99137235],"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.00015526616,0.00012977044,0.00037770986,0.0004153501,0.000018828037,0.00010412014,0.000070346214,0.0004138216,0.0024486026,0.006578541,0.35731983,0.6319678],"study_design_scores_gemma":[0.000019558815,0.000046665555,0.00041198393,0.00020396619,0.000007976998,0.00017245515,0.000060643943,0.00019996504,0.00039826173,0.0011036055,0.9973623,0.00001262776],"about_ca_topic_score_codex":0.0029664594,"about_ca_topic_score_gemma":0.0023739336,"teacher_disagreement_score":0.016761184,"about_ca_system_score_codex":0.00097440905,"about_ca_system_score_gemma":0.0007835896,"threshold_uncertainty_score":0.023907721},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026130112,0.0005344209,0.0015987655,0.00035549625,0.00019008991,0.000060150975,0.0010842861,0.0014355972,0.99448],"genre_scores_gemma":[0.00065791927,0.00029400544,0.0005598009,0.00012631711,0.000037840062,0.00004434338,0.0006309763,0.00031914207,0.9973296],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99940884,0.000033173663,0.00003851561,0.00021656675,0.00019130732,0.0001116502],"domain_scores_gemma":[0.9979972,0.0006289569,0.00015882423,0.00029795253,0.00036378778,0.00055322354],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010124843,0.0025100103,0.0017399456,0.0022046138,0.0015238618,0.0049121557,0.0033921297,0.004511452,0.9828895],"category_scores_gemma":[0.0017434966,0.00095820596,0.0010109287,0.002611963,0.0013626297,0.005110021,0.0033404056,0.002328035,0.9918281],"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.00018846852,0.00014328062,0.00041762562,0.0004933082,0.000023759048,0.00013185198,0.000075210286,0.00049331214,0.0028766028,0.006515116,0.34879786,0.6398435],"study_design_scores_gemma":[0.000025576106,0.00006071745,0.0005009049,0.00027925897,0.000010826982,0.00021706897,0.00008265751,0.0002269013,0.00053085876,0.00138524,0.9966627,0.000017289098],"about_ca_topic_score_codex":0.0027161373,"about_ca_topic_score_gemma":0.002369495,"teacher_disagreement_score":0.017110527,"about_ca_system_score_codex":0.0010342943,"about_ca_system_score_gemma":0.00082901714,"threshold_uncertainty_score":0.024406075},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026595563,0.0005124098,0.0018283798,0.00039655305,0.0002035036,0.00005663862,0.0010547092,0.0014570839,0.9942247],"genre_scores_gemma":[0.00076333503,0.00029483685,0.0006533112,0.00013660142,0.000043007818,0.00004311858,0.00063368905,0.0003591994,0.9970728],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994399,0.000033883734,0.00003666893,0.00019363376,0.00019118284,0.000104704624],"domain_scores_gemma":[0.99805164,0.00061150745,0.00015311608,0.00030569747,0.00036340038,0.00051472243],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010470763,0.002255789,0.0016283543,0.001967974,0.0013723073,0.0049065626,0.0030951544,0.0041446765,0.9802935],"category_scores_gemma":[0.001703594,0.00088875246,0.000987798,0.002382542,0.0013422269,0.0049326997,0.0031525223,0.0023341419,0.99069107],"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.00018061868,0.00013238046,0.0004500345,0.00045139733,0.000024561527,0.00012431736,0.000075794065,0.00048325764,0.0029683816,0.0075236303,0.34334245,0.6442432],"study_design_scores_gemma":[0.000022906099,0.000052732714,0.00049431325,0.0002393903,0.000009642867,0.00020554182,0.00007127581,0.00020906773,0.00048307236,0.0014358516,0.9967604,0.000015815891],"about_ca_topic_score_codex":0.0024991373,"about_ca_topic_score_gemma":0.002303094,"teacher_disagreement_score":0.019706488,"about_ca_system_score_codex":0.0009921753,"about_ca_system_score_gemma":0.0008482852,"threshold_uncertainty_score":0.028108835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026419785,0.00050312805,0.001640782,0.00038272183,0.0001919232,0.000053064035,0.0009144655,0.0013483048,0.9947014],"genre_scores_gemma":[0.00072269194,0.00029813417,0.00063441484,0.00013867846,0.00004242365,0.0000408029,0.0005616256,0.0003212091,0.99723995],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951327,0.00002986476,0.00003359348,0.00016850907,0.00016215314,0.00009257933],"domain_scores_gemma":[0.99822575,0.00054484874,0.00014469762,0.00028122336,0.00030998955,0.00049344334],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00095484767,0.002205025,0.001464513,0.001902591,0.0013263432,0.0045822198,0.0028707434,0.003984332,0.9784021],"category_scores_gemma":[0.0016655592,0.00082392065,0.0008943046,0.0023216964,0.0012404964,0.0050321296,0.0030126427,0.0022183245,0.9895656],"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.00015168563,0.00012861378,0.0004618546,0.00042857567,0.00002106626,0.00011745179,0.00007854929,0.00043296415,0.0025197777,0.007889257,0.34629163,0.64147866],"study_design_scores_gemma":[0.000020141715,0.000048358404,0.0005546225,0.00022726436,0.000008879043,0.00020175216,0.00007104748,0.00018685326,0.00041428686,0.0014399696,0.9968123,0.000014570122],"about_ca_topic_score_codex":0.0025265696,"about_ca_topic_score_gemma":0.002406106,"teacher_disagreement_score":0.021597922,"about_ca_system_score_codex":0.00089677697,"about_ca_system_score_gemma":0.000799826,"threshold_uncertainty_score":0.03080684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024645106,0.0004242003,0.0016355588,0.00037409618,0.00019063016,0.00005245811,0.00095615344,0.0013313221,0.99478924],"genre_scores_gemma":[0.0007554316,0.00025354937,0.0006117634,0.00013525302,0.00004139577,0.00003866961,0.00055209344,0.0003573961,0.99725455],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999496,0.00003105242,0.00003291131,0.00017696636,0.00017425713,0.00008880447],"domain_scores_gemma":[0.9981943,0.00056552514,0.00013910273,0.00028735778,0.00036646624,0.00044726656],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009857974,0.0020236406,0.0014840369,0.001928059,0.001309514,0.0050907317,0.0028901196,0.0041080443,0.9809738],"category_scores_gemma":[0.0016786763,0.00087265315,0.0009685844,0.0023466966,0.0012932176,0.0048081144,0.0027314667,0.0023474891,0.99063534],"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.00017287351,0.000121632394,0.00047626326,0.00043752708,0.000024282672,0.00013693549,0.0000780002,0.0005140659,0.0030586713,0.008156086,0.3573249,0.62949884],"study_design_scores_gemma":[0.000020556146,0.000043958044,0.00044979862,0.000214613,0.000008559235,0.0002079456,0.00006335091,0.00019484836,0.00042969393,0.0012576199,0.99709487,0.000014203822],"about_ca_topic_score_codex":0.0026103116,"about_ca_topic_score_gemma":0.0022627497,"teacher_disagreement_score":0.01902622,"about_ca_system_score_codex":0.001030349,"about_ca_system_score_gemma":0.0007818219,"threshold_uncertainty_score":0.02713859},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041766085,0.0015494584,0.88591784,0.001014039,0.0022315138,0.0004125463,0.0013803319,0.046368945,0.019359311],"genre_scores_gemma":[0.4593284,0.00036334142,0.49468023,0.0015320589,0.00049357413,0.00042788792,0.0021888511,0.0042124246,0.03677328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997396,0.00035494173,0.00015989797,0.00042880097,0.0011059908,0.0005543881],"domain_scores_gemma":[0.9909508,0.002225247,0.0003680406,0.0038932962,0.002253109,0.00030938795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019384745,0.0021536015,0.0015711108,0.0019066518,0.002215895,0.0021279186,0.003464737,0.0014769392,0.02059371],"category_scores_gemma":[0.01096633,0.000741158,0.0008628076,0.0021707283,0.0010783368,0.0025735362,0.0026015998,0.0025772206,0.0038300776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022655646,0.0006094365,0.0022625276,0.00055161904,0.00018071708,0.00047355422,0.00020136219,0.092048846,0.024875615,0.047952086,0.1301677,0.69841105],"study_design_scores_gemma":[0.0003593907,0.0005474543,0.0009636476,0.00011034128,0.00014336122,0.00039353286,0.00009778763,0.8443235,0.066396184,0.053889006,0.032642245,0.00013366865],"about_ca_topic_score_codex":0.011687281,"about_ca_topic_score_gemma":0.023466805,"teacher_disagreement_score":0.02059371,"about_ca_system_score_codex":0.0017961456,"about_ca_system_score_gemma":0.008116612,"threshold_uncertainty_score":0.06889278},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076819733,0.00041962313,0.9048199,0.00018195702,0.00016205151,0.00014828227,0.000944461,0.076352544,0.009289228],"genre_scores_gemma":[0.2995784,0.00076503406,0.6496115,0.000649059,0.00029124695,0.00094826263,0.0061252182,0.02271178,0.019319586],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983589,0.00043538283,0.0001563173,0.0002469699,0.00055277837,0.00024968098],"domain_scores_gemma":[0.9959895,0.0010055113,0.00023001526,0.0021304903,0.00039436534,0.00025027042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026469787,0.0013128258,0.0011703555,0.0014733311,0.0010361691,0.002019351,0.0043562413,0.0014383291,0.034106866],"category_scores_gemma":[0.0072838278,0.0012238252,0.00094202335,0.0016886113,0.0010361391,0.00409672,0.0052186274,0.0027852524,0.010129623],"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.0041077146,0.0004097632,0.0036179118,0.0012926083,0.00034652962,0.00054780993,0.0011639502,0.035797507,0.07554155,0.20788464,0.15237235,0.5169177],"study_design_scores_gemma":[0.001274612,0.0006592727,0.0013666364,0.00030594392,0.0002490012,0.00051734573,0.00026405902,0.4277292,0.15841329,0.16013943,0.24878535,0.00029589934],"about_ca_topic_score_codex":0.0015176609,"about_ca_topic_score_gemma":0.0028327897,"teacher_disagreement_score":0.034106866,"about_ca_system_score_codex":0.00075248285,"about_ca_system_score_gemma":0.0014339254,"threshold_uncertainty_score":0.11409891},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2680368,0.00096084405,0.71447915,0.00070493214,0.00021043391,0.00020280159,0.0003331595,0.0064506237,0.008621193],"genre_scores_gemma":[0.9200156,0.00012160823,0.07733886,0.00023312191,0.000017845503,0.00012742537,0.00032272656,0.00024767464,0.0015751448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993814,0.00021005594,0.00003624026,0.00013797366,0.00014821046,0.00008612198],"domain_scores_gemma":[0.99838793,0.0009600802,0.0001106306,0.00022704712,0.00025268111,0.00006162032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013311933,0.0013823392,0.00068276864,0.00044333845,0.0002489931,0.0007100029,0.0019152099,0.0010638396,0.0020064437],"category_scores_gemma":[0.0050273333,0.00043704564,0.0006487095,0.00026619577,0.00078665104,0.0010395016,0.000899761,0.0014801226,0.00042055675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008494724,0.000038018377,0.00086610584,0.00004404984,0.000025148896,0.000080696955,0.00003147503,0.9720638,0.0031176733,0.0011073769,0.000597851,0.021942863],"study_design_scores_gemma":[0.0000043869136,0.000019125724,0.00006957575,0.0000044369917,0.000003021685,0.0000109494085,0.000003626724,0.9971687,0.0020126335,0.000573066,0.00012793303,0.0000025615402],"about_ca_topic_score_codex":0.007453648,"about_ca_topic_score_gemma":0.0076787956,"teacher_disagreement_score":0.007453648,"about_ca_system_score_codex":0.0011833891,"about_ca_system_score_gemma":0.0009585945,"threshold_uncertainty_score":0.014820516},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12177872,0.09101129,0.58340555,0.0065371157,0.0022700776,0.00018198632,0.00035788427,0.0017104587,0.19274688],"genre_scores_gemma":[0.49945384,0.044915177,0.41674674,0.0016329009,0.00068216375,0.00021269347,0.00050452905,0.00041958567,0.035432376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996985,0.000045633977,0.000015059485,0.000047023048,0.00015714462,0.0000366529],"domain_scores_gemma":[0.9994537,0.00016271647,0.000048068312,0.00008486071,0.00020449041,0.000046193705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058147975,0.00035315787,0.0003461757,0.0005402855,0.00025820723,0.0014987648,0.00079350104,0.00074345944,0.002978092],"category_scores_gemma":[0.001089579,0.00027044074,0.00031273742,0.0007392379,0.0006797324,0.0019812388,0.00090841006,0.0019835192,0.0013964076],"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.00016008271,0.00011994113,0.0024271477,0.0011122522,0.00009218139,0.0003210694,0.00026885813,0.023866374,0.09858172,0.5035695,0.011221027,0.35825992],"study_design_scores_gemma":[0.00006079837,0.0013527877,0.004465741,0.00074061507,0.0001509146,0.0022208209,0.00030195742,0.14552198,0.12234679,0.17743388,0.5452349,0.00016880031],"about_ca_topic_score_codex":0.00049381016,"about_ca_topic_score_gemma":0.0011031013,"teacher_disagreement_score":0.002978092,"about_ca_system_score_codex":0.00081228453,"about_ca_system_score_gemma":0.0006584884,"threshold_uncertainty_score":0.009962678},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010630664,0.011067364,0.8390395,0.0021962882,0.0030792411,0.00009007881,0.0010166808,0.0110623045,0.13138543],"genre_scores_gemma":[0.04647598,0.014922454,0.5185107,0.0024741688,0.0032826508,0.00065172673,0.004885178,0.010826319,0.3979708],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908507,0.00017962273,0.00003846265,0.00015942659,0.00044813685,0.00008924482],"domain_scores_gemma":[0.9989127,0.0003769265,0.000038210383,0.0003792079,0.0002311636,0.00006187123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000658651,0.0019462077,0.0017233167,0.0018317892,0.00091742666,0.004602395,0.0024482382,0.0015857393,0.077804595],"category_scores_gemma":[0.0033145642,0.0010593195,0.0008902976,0.006177821,0.0011117322,0.0040773614,0.0028710836,0.003680271,0.060340725],"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.00006689377,0.000063930944,0.000119539676,0.00032738806,0.00004091779,0.000046835226,0.000036643647,0.012649463,0.0009020017,0.15798129,0.3892532,0.4385119],"study_design_scores_gemma":[0.00004525365,0.000027661315,0.00020162905,0.00017572561,0.000033086184,0.00018048637,0.000040144932,0.10259902,0.0023445038,0.38125798,0.5130622,0.000032235093],"about_ca_topic_score_codex":0.0012610172,"about_ca_topic_score_gemma":0.0018416098,"teacher_disagreement_score":0.077804595,"about_ca_system_score_codex":0.0010697076,"about_ca_system_score_gemma":0.0016759839,"threshold_uncertainty_score":0.26028228},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.936102,0.0015615608,0.042176865,0.0003157437,0.000094625684,0.0002443625,0.0013484295,0.006134526,0.012022038],"genre_scores_gemma":[0.9658839,0.00038003369,0.030004507,0.00008858258,0.00003988384,0.00017612518,0.001338848,0.0008775474,0.0012105731],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607486,0.00068181875,0.00020592687,0.00044192516,0.0019358521,0.0006596143],"domain_scores_gemma":[0.987605,0.008090034,0.0007820771,0.0014863396,0.0016721832,0.00036446107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026322124,0.0011929872,0.0009278246,0.002670489,0.0007315156,0.0014163771,0.0011507153,0.0005667428,0.0015517783],"category_scores_gemma":[0.013530393,0.00043441865,0.0007595754,0.0038082532,0.0008174377,0.0027503436,0.0011149463,0.0011466001,0.00034746868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007308556,0.0023860973,0.13790685,0.0020115173,0.0009575446,0.0009095043,0.002775534,0.25990748,0.15297966,0.026616834,0.017349223,0.38889116],"study_design_scores_gemma":[0.00031452155,0.0035516166,0.1129905,0.00014768365,0.00036373147,0.0007529615,0.0012482235,0.79708284,0.060839206,0.011790171,0.010678384,0.0002401586],"about_ca_topic_score_codex":0.0063518044,"about_ca_topic_score_gemma":0.0045429366,"teacher_disagreement_score":0.0063518044,"about_ca_system_score_codex":0.00083724863,"about_ca_system_score_gemma":0.0011520046,"threshold_uncertainty_score":0.013920665},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25145593,0.0022483473,0.6577801,0.00092948566,0.00048043256,0.00022781173,0.0010556113,0.043027833,0.04279445],"genre_scores_gemma":[0.71556896,0.00062556367,0.2686358,0.0004997303,0.00012348389,0.00019876874,0.0022147584,0.0019561558,0.010176677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977547,0.0000308399,0.000014448638,0.000031959124,0.00010003074,0.00004732631],"domain_scores_gemma":[0.9994849,0.00015328039,0.000042746185,0.00014065746,0.00011627399,0.000062082385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038941766,0.00058298337,0.00034826525,0.0004906871,0.00044171483,0.00074045727,0.0013641125,0.0004069372,0.006619681],"category_scores_gemma":[0.0014861284,0.00027008876,0.00033252913,0.0005718992,0.000678634,0.0017508233,0.0013999016,0.0007209205,0.0013341035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017606446,0.00029775,0.008201,0.00085065194,0.00018112693,0.0010525262,0.00085156463,0.0902032,0.15356481,0.07667731,0.07121413,0.5951452],"study_design_scores_gemma":[0.0002263703,0.0005883605,0.0022348382,0.00009659238,0.000041738258,0.00037742834,0.00016528359,0.7380417,0.15948083,0.028629668,0.07002374,0.000093474606],"about_ca_topic_score_codex":0.0024297081,"about_ca_topic_score_gemma":0.0033360333,"teacher_disagreement_score":0.006619681,"about_ca_system_score_codex":0.00069583923,"about_ca_system_score_gemma":0.0010172103,"threshold_uncertainty_score":0.022145092},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5493434,0.0032266704,0.1351119,0.0008142181,0.00075794803,0.00063182943,0.0038254315,0.020316867,0.2859718],"genre_scores_gemma":[0.84143865,0.0005058159,0.07904678,0.00056098495,0.000066598055,0.00019358208,0.006480188,0.00037821225,0.07132909],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99981886,0.00001300024,0.000008346307,0.000042068154,0.00007557723,0.000042233565],"domain_scores_gemma":[0.9998983,0.0000071522186,0.000016556454,0.000016964543,0.00004229049,0.000018635885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015026878,0.00032446248,0.00017789961,0.00026180764,0.00023080315,0.0004831522,0.00088037807,0.00024595388,0.017983245],"category_scores_gemma":[0.000254264,0.00016158955,0.00018674872,0.00030190797,0.0001811032,0.00048815671,0.00035551586,0.00034050207,0.0020335983],"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.0023319728,0.00030015342,0.009143231,0.00081013376,0.00017913461,0.00040335243,0.00017698796,0.024109423,0.29535863,0.052186463,0.27919155,0.33580893],"study_design_scores_gemma":[0.0006070342,0.0032006947,0.019915141,0.00008371233,0.00015434014,0.0010224935,0.000112043635,0.16006392,0.2793424,0.0064236526,0.5289535,0.00012101722],"about_ca_topic_score_codex":0.0014784399,"about_ca_topic_score_gemma":0.0038759378,"teacher_disagreement_score":0.017983245,"about_ca_system_score_codex":0.0009249988,"about_ca_system_score_gemma":0.0009744416,"threshold_uncertainty_score":0.06015998},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034088034,0.24343204,0.6765221,0.0024442,0.0014208719,0.00024266954,0.0006869066,0.003154736,0.038008526],"genre_scores_gemma":[0.21697055,0.2777887,0.48587626,0.0013872896,0.0015268432,0.000360307,0.0020409958,0.0021183456,0.011930733],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992756,0.00014195242,0.00009032782,0.0001289362,0.0002697771,0.00009341421],"domain_scores_gemma":[0.99871576,0.0005508963,0.0001014387,0.00020302458,0.00036707547,0.00006184452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008823079,0.0010593624,0.000893238,0.0013871547,0.00068822363,0.0010943422,0.0013647622,0.0005816266,0.005648011],"category_scores_gemma":[0.0031623407,0.0008807443,0.00087267515,0.0033140744,0.00040260053,0.0017838173,0.0007910542,0.0017242958,0.001800698],"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.0003761231,0.00017835092,0.002032519,0.0035311412,0.00014360013,0.00011962718,0.00023896029,0.09447703,0.019248469,0.048911694,0.028518913,0.8022235],"study_design_scores_gemma":[0.00015200512,0.0007013828,0.0024513255,0.0012621568,0.00021411621,0.0006512423,0.00029640214,0.4757565,0.030918185,0.047162738,0.44029891,0.00013499595],"about_ca_topic_score_codex":0.003461816,"about_ca_topic_score_gemma":0.0034661056,"teacher_disagreement_score":0.005648011,"about_ca_system_score_codex":0.00096910814,"about_ca_system_score_gemma":0.0018581916,"threshold_uncertainty_score":0.018894494},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028512556,0.00042907038,0.9472561,0.0011496056,0.00009117841,0.00015805352,0.00018016949,0.0017751659,0.020448118],"genre_scores_gemma":[0.6004562,0.0007524023,0.38259408,0.00087967626,0.00024352982,0.0006069003,0.00046708898,0.0011628323,0.0128373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99625766,0.0011126341,0.0003146522,0.0007137107,0.0011402486,0.00046113555],"domain_scores_gemma":[0.99521554,0.0020157436,0.00048071917,0.0017235504,0.00047750477,0.00008692293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002758934,0.0005089966,0.0005300935,0.0007485043,0.0009215316,0.0023429238,0.0014570972,0.0010643901,0.0033188472],"category_scores_gemma":[0.009239999,0.000503732,0.0013662812,0.0007727403,0.004257895,0.0044993046,0.0030315164,0.002743974,0.00066023535],"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.00006616626,0.000058279762,0.0006797728,0.00015516729,0.000029343077,0.00015430491,0.0005213863,0.021175396,0.0054596076,0.9371518,0.0012358568,0.03331289],"study_design_scores_gemma":[0.000030389112,0.000056541674,0.00024748634,0.000057159632,0.00004014325,0.00015409614,0.00012444655,0.036547784,0.010664018,0.9342012,0.017854935,0.000021862961],"about_ca_topic_score_codex":0.0024752931,"about_ca_topic_score_gemma":0.0017242285,"teacher_disagreement_score":0.0033188472,"about_ca_system_score_codex":0.0014156894,"about_ca_system_score_gemma":0.0024395115,"threshold_uncertainty_score":0.0145908},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035727315,0.006117886,0.041291412,0.0011039182,0.0023619372,0.00061009516,0.06314899,0.029398296,0.82024],"genre_scores_gemma":[0.17412211,0.0057986025,0.12461069,0.001859401,0.00058682915,0.0016631617,0.24871448,0.018120892,0.42452383],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988194,0.00018340217,0.000064720276,0.00015758743,0.0005667148,0.00020807235],"domain_scores_gemma":[0.9983847,0.00030540806,0.000039054667,0.0003399047,0.0008154909,0.00011541879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078608945,0.0017398943,0.0008183955,0.0022365726,0.0010429248,0.001809342,0.0026555953,0.00090345106,0.1242755],"category_scores_gemma":[0.0036370114,0.00053174986,0.0006274308,0.004202986,0.0003020378,0.0014783329,0.0009894416,0.0015462082,0.0564163],"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.00057610316,0.00036978163,0.00045893315,0.0009830056,0.000050179555,0.000079844984,0.00005314295,0.017571278,0.0062146825,0.022243673,0.79979366,0.15160576],"study_design_scores_gemma":[0.00029385273,0.000353121,0.0014131173,0.00028877932,0.00006921014,0.00016169864,0.0001119206,0.05749914,0.040419333,0.022625288,0.87670237,0.0000622458],"about_ca_topic_score_codex":0.003989829,"about_ca_topic_score_gemma":0.0060009523,"teacher_disagreement_score":0.1242755,"about_ca_system_score_codex":0.001193447,"about_ca_system_score_gemma":0.00099735,"threshold_uncertainty_score":0.415743},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06693359,0.0004266253,0.91322976,0.00041868136,0.00014672856,0.00013684602,0.000107527805,0.0012444423,0.017355718],"genre_scores_gemma":[0.6851897,0.0005104404,0.30962142,0.000147217,0.000042013053,0.000364319,0.00014462147,0.00027332304,0.0037069607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975437,0.000085270825,0.000010731449,0.000025043266,0.0000924156,0.000032199765],"domain_scores_gemma":[0.9993175,0.00035567183,0.00006984121,0.000109004475,0.00009475387,0.000053326305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007023601,0.000417632,0.00041372195,0.000375983,0.0005400767,0.0008748698,0.0017916083,0.0006569649,0.0020803637],"category_scores_gemma":[0.002276751,0.0003478591,0.0006317099,0.00026833417,0.0009260062,0.0009120374,0.0014884886,0.0009896627,0.00028656324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065712484,0.00004632653,0.0014747696,0.0000792192,0.000040711868,0.00011130032,0.00012471217,0.921613,0.0033753482,0.058215525,0.0009366574,0.013916714],"study_design_scores_gemma":[0.000007637134,0.000013551916,0.000046185152,0.0000053086915,0.0000032548332,0.000010123274,0.0000060141706,0.9954014,0.00041701717,0.0033077423,0.0007789331,0.0000028458064],"about_ca_topic_score_codex":0.003998749,"about_ca_topic_score_gemma":0.002802867,"teacher_disagreement_score":0.003998749,"about_ca_system_score_codex":0.0005575351,"about_ca_system_score_gemma":0.0014051514,"threshold_uncertainty_score":0.007950962},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057057373,0.0007744668,0.8833019,0.00084667554,0.00030543667,0.00017979702,0.0006221917,0.042877458,0.014034694],"genre_scores_gemma":[0.46193784,0.00030189948,0.5261005,0.0005098559,0.0001236865,0.00028684374,0.001533379,0.0013539838,0.007852],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995029,0.000108904045,0.00003093718,0.00016566308,0.00011939743,0.000072101684],"domain_scores_gemma":[0.99925214,0.00026033566,0.00004201761,0.00026529573,0.000121526115,0.000058704907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063428294,0.000994098,0.00059330626,0.00044798796,0.00069945585,0.0013211621,0.0019142741,0.0005950547,0.004129287],"category_scores_gemma":[0.0027651463,0.0004644018,0.00055498036,0.0007595182,0.00059854356,0.0021957264,0.0017544449,0.001490309,0.0021495312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014606495,0.0006278782,0.00450824,0.000484346,0.00024670284,0.0009257818,0.00071649347,0.19976245,0.072755694,0.05038686,0.05851996,0.60960495],"study_design_scores_gemma":[0.000051646828,0.00011489886,0.0002222291,0.000011489212,0.000028015242,0.00009496977,0.000040554994,0.954646,0.019669209,0.016971044,0.008127427,0.00002250575],"about_ca_topic_score_codex":0.0043161917,"about_ca_topic_score_gemma":0.006363513,"teacher_disagreement_score":0.0043161917,"about_ca_system_score_codex":0.0008578896,"about_ca_system_score_gemma":0.0021531302,"threshold_uncertainty_score":0.013813853},"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":"commentary","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038057353,0.22693531,0.3018188,0.33584234,0.011691758,0.00032198775,0.0005922719,0.0018622796,0.082877904],"genre_scores_gemma":[0.4902323,0.18278486,0.26699936,0.026044467,0.012131321,0.00045553234,0.0014592363,0.0005050125,0.019387905],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99592173,0.0014194907,0.00026509826,0.0005206415,0.0011502305,0.0007227909],"domain_scores_gemma":[0.9761806,0.006284802,0.0013697622,0.004255849,0.009899491,0.002009525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.028103458,0.00091448956,0.0009991446,0.0011321029,0.001084978,0.008727223,0.0033650626,0.0032876874,0.0054820245],"category_scores_gemma":[0.016361725,0.0004114598,0.00059537723,0.0023001933,0.0024380265,0.014883246,0.0029686366,0.0056691444,0.0016976382],"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.00031990057,0.0005303837,0.0025957597,0.0010261342,0.00009518674,0.000068578556,0.00047256943,0.009940853,0.0030757424,0.42602775,0.049067736,0.50677943],"study_design_scores_gemma":[0.00011627785,0.00065347657,0.0034459168,0.0024131814,0.000092739094,0.00027356937,0.0026385612,0.04764588,0.0054137846,0.520959,0.41621536,0.00013225444],"about_ca_topic_score_codex":0.0031605978,"about_ca_topic_score_gemma":0.00236617,"teacher_disagreement_score":0.028103458,"about_ca_system_score_codex":0.0024551747,"about_ca_system_score_gemma":0.009094507,"threshold_uncertainty_score":0.14862704},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007369337,0.0021318302,0.94707865,0.0106794145,0.0007559547,0.00011177833,0.00017238857,0.0033349039,0.028365761],"genre_scores_gemma":[0.28424534,0.003811123,0.68407434,0.0031066197,0.0009628523,0.000354834,0.0004388747,0.00117947,0.021826515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983791,0.0004861232,0.00009299899,0.0002858041,0.00061040797,0.00014561086],"domain_scores_gemma":[0.99605787,0.0017242698,0.00023633063,0.0012695327,0.00048807665,0.00022407879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002661976,0.0010868054,0.0009891541,0.0012012544,0.0008969906,0.0043854127,0.00346673,0.0019511294,0.0140459845],"category_scores_gemma":[0.009783566,0.0010364747,0.0015254783,0.0013634872,0.0031457532,0.008772286,0.0037237583,0.0049603195,0.004204044],"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.00031317028,0.00030023247,0.0016622429,0.0003754814,0.0001677635,0.00019592229,0.0004265611,0.1049225,0.008303019,0.5862482,0.02263519,0.27444974],"study_design_scores_gemma":[0.00006426239,0.00012577072,0.0002587232,0.00013131225,0.00008742477,0.00011848171,0.000089132496,0.52154315,0.004327558,0.4093639,0.06382876,0.000061537125],"about_ca_topic_score_codex":0.0031601891,"about_ca_topic_score_gemma":0.0038686707,"teacher_disagreement_score":0.0140459845,"about_ca_system_score_codex":0.0011246433,"about_ca_system_score_gemma":0.0024303994,"threshold_uncertainty_score":0.046988487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012516025,0.00016845629,0.97861975,0.00034676585,0.000035542427,0.0002877895,0.0004110858,0.0047746766,0.0028398847],"genre_scores_gemma":[0.22226363,0.00043497782,0.77163273,0.0002533739,0.000057285906,0.00088928366,0.0009640469,0.0014457802,0.0020589335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979481,0.0006903976,0.00016116703,0.00035144668,0.00067571393,0.00017311306],"domain_scores_gemma":[0.99579924,0.0016207861,0.00037010634,0.0016349631,0.00045612553,0.00011873025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033415745,0.0015431341,0.0005410747,0.0014067856,0.0006100354,0.0020460999,0.0030697903,0.0012822396,0.0030095435],"category_scores_gemma":[0.009486483,0.0008824625,0.0012119994,0.0005321646,0.0013526987,0.0029908847,0.0020518142,0.002623841,0.00071905076],"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.0002300184,0.00038116958,0.0052577453,0.0006318926,0.00015879325,0.0005841597,0.00097061286,0.59542143,0.05196357,0.24965271,0.0065725422,0.08817539],"study_design_scores_gemma":[0.000054342523,0.0002149231,0.0007343458,0.00012965509,0.000055194767,0.00029496462,0.00013912348,0.85993654,0.022512287,0.08381385,0.032039206,0.00007560666],"about_ca_topic_score_codex":0.0014669151,"about_ca_topic_score_gemma":0.0025514208,"teacher_disagreement_score":0.0033415745,"about_ca_system_score_codex":0.0010257805,"about_ca_system_score_gemma":0.0016052909,"threshold_uncertainty_score":0.017672122},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007685094,0.0009436469,0.9826082,0.0002640285,0.00015910776,0.00006575035,0.00019439077,0.0053157522,0.0027639766],"genre_scores_gemma":[0.30959192,0.00063225906,0.6758462,0.001127935,0.00017308738,0.00042452282,0.0010901863,0.0018926954,0.009221218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939895,0.00020952482,0.000030377183,0.00017200904,0.00014168522,0.00004743191],"domain_scores_gemma":[0.99941885,0.00026913424,0.00004558772,0.0001237514,0.0001016593,0.000040972194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013417124,0.0014297651,0.0012624689,0.00053279777,0.0003487462,0.0008944588,0.0019717333,0.0017510733,0.0034924308],"category_scores_gemma":[0.002768429,0.00068782596,0.0010308861,0.00043554234,0.00071636384,0.0011662635,0.0015204381,0.0025066445,0.0016599637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020002283,0.000083270505,0.0009919035,0.00017519094,0.00020747217,0.00012395182,0.000075990945,0.72081405,0.0060702497,0.013769628,0.018967424,0.23852092],"study_design_scores_gemma":[0.00001864019,0.000024231535,0.00007631305,0.0000076138836,0.0000078628145,0.000025929046,0.0000033767462,0.9938114,0.0009397916,0.0032140594,0.0018620789,0.000008577558],"about_ca_topic_score_codex":0.002734166,"about_ca_topic_score_gemma":0.003896349,"teacher_disagreement_score":0.0034924308,"about_ca_system_score_codex":0.0005612008,"about_ca_system_score_gemma":0.00097226136,"threshold_uncertainty_score":0.011683404},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056094754,0.0011937397,0.60905033,0.00512442,0.0032377772,0.0019233203,0.012772757,0.24632058,0.06428241],"genre_scores_gemma":[0.17497772,0.0012779895,0.63586354,0.0014860092,0.0014289084,0.0023788968,0.054081388,0.06406218,0.06444339],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99790514,0.00024250442,0.00012079822,0.00017392937,0.0012405847,0.00031709118],"domain_scores_gemma":[0.99443865,0.00031650963,0.00023071562,0.0009770227,0.003331036,0.0007060854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035070877,0.0009700301,0.00064764946,0.0013341334,0.0012716552,0.0025847147,0.0023658944,0.0006303252,0.018742913],"category_scores_gemma":[0.007950655,0.00089948677,0.0007098943,0.0014705565,0.0004757613,0.0027176347,0.0026294596,0.0030920592,0.016657392],"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.0009307204,0.00022310126,0.0052570794,0.00036663577,0.00005742695,0.00063349586,0.0007317888,0.021884331,0.03864806,0.030167619,0.67596555,0.2251343],"study_design_scores_gemma":[0.00034358923,0.0005419737,0.010134728,0.00027844557,0.000071759074,0.0005772257,0.00026651332,0.11982414,0.05837097,0.016432488,0.7928915,0.00026663102],"about_ca_topic_score_codex":0.0038269004,"about_ca_topic_score_gemma":0.002807315,"teacher_disagreement_score":0.018742913,"about_ca_system_score_codex":0.0013812365,"about_ca_system_score_gemma":0.0035218734,"threshold_uncertainty_score":0.062701285},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005219633,0.00063704234,0.9320724,0.0036483181,0.00084187445,0.00036260174,0.0007418976,0.027298229,0.029177979],"genre_scores_gemma":[0.043440152,0.0018668146,0.9153258,0.0015190041,0.0007064358,0.00135487,0.0014204868,0.0072679203,0.02709852],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985287,0.0003783225,0.0000987398,0.0002603485,0.0005725857,0.00016127541],"domain_scores_gemma":[0.99580485,0.0015931651,0.00023792281,0.0006067396,0.0010313968,0.00072604546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022687023,0.0011675617,0.0006943895,0.0012494511,0.0008572923,0.0022834255,0.0025307382,0.00090162415,0.037979927],"category_scores_gemma":[0.010710555,0.00045122093,0.0008914958,0.0011165029,0.0009452776,0.0040451735,0.0038809779,0.0030545725,0.019588798],"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.00015559436,0.0005682736,0.0012323145,0.0008728582,0.000027743183,0.00061394804,0.0019393464,0.0077452473,0.011425598,0.15182367,0.22631715,0.59727824],"study_design_scores_gemma":[0.00012206722,0.00018692615,0.0012683593,0.0008736335,0.00003115361,0.0010856184,0.00041623172,0.083134,0.026789159,0.2287676,0.6571489,0.00017634564],"about_ca_topic_score_codex":0.00040987055,"about_ca_topic_score_gemma":0.00042496604,"teacher_disagreement_score":0.037979927,"about_ca_system_score_codex":0.00070391205,"about_ca_system_score_gemma":0.0024107392,"threshold_uncertainty_score":0.12705553},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14961226,0.0024299268,0.47430828,0.0012517618,0.0018438369,0.0009903432,0.04066659,0.13683102,0.19206597],"genre_scores_gemma":[0.52724767,0.001117353,0.3448702,0.0014946504,0.0001908926,0.0015220947,0.032075398,0.015531929,0.075949915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995875,0.000092108865,0.000027616325,0.00005412204,0.0001613596,0.00007731641],"domain_scores_gemma":[0.99925643,0.00020460239,0.00004337399,0.00014004289,0.00027656154,0.000079003126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000572947,0.0010397077,0.0006402627,0.0005329354,0.00058669434,0.000828063,0.0030690809,0.0009061265,0.031674895],"category_scores_gemma":[0.0017773516,0.0006005533,0.0007534447,0.0008627409,0.00027547523,0.0011048034,0.00068126235,0.0016004355,0.0056108823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011713451,0.00039450283,0.002645389,0.0007961315,0.00037777115,0.00016667336,0.00020844427,0.6971943,0.019121388,0.023851294,0.17509246,0.07898034],"study_design_scores_gemma":[0.00026494946,0.00016622829,0.00041534906,0.000037323138,0.00007346688,0.000046085945,0.000025693487,0.90665454,0.0120855495,0.00535826,0.07483028,0.000042306492],"about_ca_topic_score_codex":0.015126451,"about_ca_topic_score_gemma":0.01827612,"teacher_disagreement_score":0.031674895,"about_ca_system_score_codex":0.0009734311,"about_ca_system_score_gemma":0.0020872164,"threshold_uncertainty_score":0.10596305},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013172133,0.0075046434,0.7809027,0.0012405445,0.0013449113,0.0004164623,0.0014264091,0.027666815,0.17818035],"genre_scores_gemma":[0.019146431,0.017386654,0.7356275,0.0017122575,0.0008968846,0.0009635859,0.004879019,0.02617893,0.19320875],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987196,0.00016802861,0.00010222707,0.0001867972,0.0007456733,0.00007772962],"domain_scores_gemma":[0.9986185,0.00054726686,0.000054325064,0.00026159218,0.0004166866,0.00010171224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009866825,0.0014355889,0.0006082423,0.0016093863,0.0009615536,0.004694699,0.0018265375,0.0011228737,0.033723142],"category_scores_gemma":[0.0041425615,0.0014525376,0.00095604116,0.0019132212,0.001116839,0.005071888,0.001874413,0.00431611,0.04353028],"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.000105111714,0.00008965603,0.00020475374,0.0016336454,0.000035316836,0.00036889483,0.001461303,0.0038129927,0.016915802,0.34232846,0.1537728,0.4792713],"study_design_scores_gemma":[0.000011516447,0.000015046716,0.00008168,0.0003488325,0.000009997193,0.0003750326,0.000037870825,0.0030063672,0.0043399306,0.044959206,0.9467903,0.000024196124],"about_ca_topic_score_codex":0.00091865734,"about_ca_topic_score_gemma":0.0008189892,"teacher_disagreement_score":0.033723142,"about_ca_system_score_codex":0.00071115175,"about_ca_system_score_gemma":0.0012112401,"threshold_uncertainty_score":0.11281514},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020232259,0.015684217,0.60989374,0.0021416296,0.0018790311,0.00020946408,0.00095263077,0.017112402,0.35010365],"genre_scores_gemma":[0.038179055,0.02517417,0.40635115,0.003086691,0.0013608148,0.0005151362,0.0026057023,0.014420785,0.50830644],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995316,0.000055864315,0.000025751937,0.000098788274,0.00025386966,0.00003404174],"domain_scores_gemma":[0.99934965,0.00033707177,0.000024040904,0.000104092054,0.000146612,0.000038410293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000477308,0.001025544,0.00040325927,0.0009129968,0.00065778504,0.0027965032,0.0009167831,0.000953019,0.03475092],"category_scores_gemma":[0.0019170556,0.00064733136,0.00062566024,0.0011100369,0.0009167298,0.0034357996,0.00094611425,0.0027638872,0.017902667],"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.000049976985,0.00006103287,0.00011937002,0.00077320356,0.0000122156225,0.0001965755,0.00092602544,0.004742433,0.008002596,0.33875626,0.17919198,0.46716836],"study_design_scores_gemma":[0.000009695769,0.000011332129,0.000076969096,0.00031897903,0.000006085224,0.00029010404,0.00002956807,0.0033072175,0.0025371236,0.06254133,0.9308557,0.000015942687],"about_ca_topic_score_codex":0.0011735477,"about_ca_topic_score_gemma":0.0011441578,"teacher_disagreement_score":0.03475092,"about_ca_system_score_codex":0.001041069,"about_ca_system_score_gemma":0.00081634516,"threshold_uncertainty_score":0.116253376},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14864664,0.0004600851,0.8262313,0.00025120226,0.00022065423,0.00013593204,0.00018564495,0.017693026,0.0061755576],"genre_scores_gemma":[0.48221678,0.00009135048,0.5119014,0.00016456077,0.000027179405,0.00011684394,0.00032795363,0.0006206171,0.0045333435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977785,0.00005736697,0.000009120819,0.000039261107,0.00006722253,0.00004913774],"domain_scores_gemma":[0.9996369,0.00013998496,0.00003223288,0.0000714524,0.00009439176,0.000025116859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040640065,0.000688198,0.00062047195,0.00056115264,0.00052212103,0.0004910483,0.001468875,0.0006624666,0.0037260638],"category_scores_gemma":[0.0010808778,0.0002760984,0.00046677777,0.00044628902,0.00038127846,0.0005913041,0.00070554373,0.0007931843,0.0006575653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062792364,0.0003591674,0.0016868527,0.00015435509,0.00012865182,0.00021196326,0.00016651813,0.44735578,0.027301071,0.011053526,0.010511324,0.50044286],"study_design_scores_gemma":[0.000040681247,0.00010061304,0.0001394611,0.0000050650965,0.000011678026,0.000026833766,0.000019386322,0.99015146,0.006403481,0.001991076,0.0011013864,0.000008830382],"about_ca_topic_score_codex":0.005360087,"about_ca_topic_score_gemma":0.009794364,"teacher_disagreement_score":0.005360087,"about_ca_system_score_codex":0.00048430474,"about_ca_system_score_gemma":0.0013841524,"threshold_uncertainty_score":0.012464941},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38998142,0.002702302,0.56889117,0.0014885301,0.0003049662,0.00006023208,0.0002222821,0.002059113,0.03428994],"genre_scores_gemma":[0.97721684,0.0006395027,0.019014211,0.00015643692,0.00008114695,0.000047737372,0.00010862038,0.0001845652,0.0025508136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895966,0.00019886623,0.00005859992,0.00013442173,0.0004212709,0.00022717018],"domain_scores_gemma":[0.9967359,0.001628154,0.0005698268,0.0005706491,0.00037655534,0.000118853044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011283541,0.0005201056,0.00029489247,0.00042898452,0.00051479536,0.001081212,0.00068468566,0.00030848596,0.003092488],"category_scores_gemma":[0.004511219,0.00027207134,0.00028492132,0.0003992637,0.0010129011,0.0011232283,0.001432289,0.0013379457,0.00041496436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010317991,0.000094332914,0.006681507,0.00038600693,0.00005820324,0.00048226208,0.00031622275,0.4978065,0.08092744,0.3261011,0.004780181,0.08133449],"study_design_scores_gemma":[0.000028842545,0.00029311885,0.001076822,0.00004703262,0.00004740417,0.00019742247,0.000076912795,0.8964679,0.03928994,0.053423665,0.0090195015,0.00003145572],"about_ca_topic_score_codex":0.0012263235,"about_ca_topic_score_gemma":0.0013274103,"teacher_disagreement_score":0.003092488,"about_ca_system_score_codex":0.0007373744,"about_ca_system_score_gemma":0.0017113994,"threshold_uncertainty_score":0.010345459},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035432268,0.0005583048,0.9492645,0.00039212557,0.00011193198,0.000075102864,0.00019256631,0.0062917117,0.0076814415],"genre_scores_gemma":[0.40214175,0.00039744496,0.5867667,0.00048050386,0.000054164924,0.00017222919,0.0006314715,0.00067136186,0.008684312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996339,0.000052804397,0.000023486129,0.00006942053,0.00016797503,0.000052317824],"domain_scores_gemma":[0.999605,0.00012436938,0.00004645607,0.00009361617,0.00010785446,0.000022699252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005555943,0.00084445975,0.0004351439,0.00040210172,0.0003425435,0.0009829163,0.0013753178,0.0005131224,0.0057660197],"category_scores_gemma":[0.002198894,0.00033930485,0.0002368987,0.000497295,0.00056287216,0.002134887,0.0010346752,0.0011367481,0.0016757222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053054263,0.00017749009,0.001730905,0.00029704644,0.000055144927,0.0001906004,0.00024075498,0.14209941,0.062290885,0.036332697,0.017606432,0.7384481],"study_design_scores_gemma":[0.000032536977,0.00010206369,0.00029719895,0.000028129014,0.000013477669,0.00009344657,0.00006236994,0.9456235,0.036254454,0.009662261,0.0078121955,0.000018442355],"about_ca_topic_score_codex":0.0028838166,"about_ca_topic_score_gemma":0.006007834,"teacher_disagreement_score":0.0057660197,"about_ca_system_score_codex":0.0006755872,"about_ca_system_score_gemma":0.0012379716,"threshold_uncertainty_score":0.019289315},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038335685,0.0004915007,0.8714487,0.007207361,0.00022190045,0.000080815626,0.000054389984,0.00033688793,0.08182275],"genre_scores_gemma":[0.48543477,0.00092794246,0.49805537,0.00116902,0.00014171655,0.00023393557,0.00007592119,0.00026193107,0.013699471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990075,0.00051138026,0.000044461085,0.00010861893,0.0002655494,0.00006256567],"domain_scores_gemma":[0.99678385,0.0022787172,0.000111282854,0.00030758284,0.00038901062,0.00012943591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025214097,0.0006888965,0.00052708865,0.00065161,0.0012110238,0.0031805842,0.0022179624,0.0018244054,0.005427049],"category_scores_gemma":[0.0062628384,0.00042023294,0.0007371918,0.0004603456,0.0059917127,0.009277677,0.002421507,0.0037098075,0.0008452957],"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.000006213255,0.0000149975895,0.000071776194,0.000027471273,0.0000013615688,0.00010138934,0.0014990083,0.0023729873,0.00040002,0.98956746,0.0012778947,0.0046593794],"study_design_scores_gemma":[0.000017621476,0.000020309873,0.000090440204,0.00009150148,0.000004496205,0.00027804248,0.00073704,0.04795729,0.0012460478,0.89966744,0.049870662,0.000019117171],"about_ca_topic_score_codex":0.0011238727,"about_ca_topic_score_gemma":0.0010685455,"teacher_disagreement_score":0.005427049,"about_ca_system_score_codex":0.0015985972,"about_ca_system_score_gemma":0.0009949883,"threshold_uncertainty_score":0.018155336},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20603365,0.0024422593,0.7540556,0.002782125,0.00036171472,0.00020997306,0.0026031095,0.023707181,0.0078042396],"genre_scores_gemma":[0.8194191,0.0005408851,0.17317112,0.0006853102,0.000087604756,0.0002435532,0.0024308132,0.00048272123,0.0029388405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996019,0.00007991545,0.000018906301,0.00011754117,0.000106662876,0.00007504041],"domain_scores_gemma":[0.99888986,0.00043744614,0.000046749246,0.00036918884,0.00017745305,0.0000793399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009823514,0.0011823238,0.00076350657,0.00048498524,0.00034861956,0.001249404,0.0026759324,0.001128755,0.0036534083],"category_scores_gemma":[0.004342225,0.0005302747,0.0005075732,0.00061882427,0.000620096,0.002645354,0.001644661,0.0023374788,0.0007480123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084194576,0.00034743943,0.006174322,0.00027199485,0.00014547912,0.00027246735,0.00021928744,0.69027275,0.012044115,0.01004746,0.021452602,0.2579101],"study_design_scores_gemma":[0.000012452615,0.000022529704,0.0002115315,0.000004475197,0.0000051026386,0.000017362965,0.000012642191,0.994635,0.0017053804,0.002868352,0.00049974065,0.000005530285],"about_ca_topic_score_codex":0.016450152,"about_ca_topic_score_gemma":0.022157716,"teacher_disagreement_score":0.016450152,"about_ca_system_score_codex":0.00097500294,"about_ca_system_score_gemma":0.0013724222,"threshold_uncertainty_score":0.032708824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104243554,0.0005602736,0.7471556,0.0011492742,0.00032294713,0.00031981876,0.00028477324,0.027579747,0.11838407],"genre_scores_gemma":[0.14207454,0.0006289959,0.7979418,0.00048300892,0.00007204761,0.00019983301,0.0006421092,0.0029694454,0.05498833],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995395,0.0000707931,0.000017715245,0.00006833527,0.00023853332,0.00006512281],"domain_scores_gemma":[0.9991916,0.00021877923,0.000057881727,0.000094317504,0.0002217873,0.00021560502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065794075,0.00065565476,0.00027808,0.0003228536,0.00020692497,0.0008589281,0.001019398,0.00034248977,0.023424977],"category_scores_gemma":[0.0021379753,0.00031572874,0.00035322536,0.00021267716,0.00021918192,0.0011913821,0.0017769414,0.00088733766,0.006548388],"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.00033070653,0.0011842693,0.0033875394,0.0004921855,0.00001649779,0.0005066949,0.0020461655,0.009002082,0.099244274,0.012077193,0.041028276,0.8306841],"study_design_scores_gemma":[0.0002159734,0.0016095726,0.008036658,0.00036028022,0.000050091705,0.001898185,0.0006161908,0.070380226,0.10848633,0.007525782,0.80071527,0.00010542249],"about_ca_topic_score_codex":0.00056291965,"about_ca_topic_score_gemma":0.0021023552,"teacher_disagreement_score":0.023424977,"about_ca_system_score_codex":0.00037517332,"about_ca_system_score_gemma":0.0012518509,"threshold_uncertainty_score":0.07836437},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.337916,0.006594016,0.36801383,0.0010008657,0.0009230366,0.0006351777,0.003610465,0.26241603,0.018890578],"genre_scores_gemma":[0.71738654,0.0007572253,0.25635225,0.000669708,0.00014436537,0.00038213475,0.00659069,0.0029746257,0.014742478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957544,0.000048352344,0.000026953561,0.00012074531,0.00015593332,0.000072612325],"domain_scores_gemma":[0.9992392,0.00024502695,0.0000777717,0.00019768298,0.00016456403,0.000075656615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035548199,0.0013449308,0.00054757483,0.000896469,0.00056341296,0.00064985245,0.0028320423,0.00068742683,0.005616195],"category_scores_gemma":[0.0017543413,0.0005430958,0.00052485167,0.0012331007,0.00056954136,0.0017514402,0.0011190221,0.0009662197,0.0018277959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003599437,0.0010176598,0.016366817,0.0010305524,0.00038009472,0.00058988156,0.00034696815,0.112683274,0.11917664,0.008623256,0.1306399,0.60554564],"study_design_scores_gemma":[0.00066653755,0.0011579347,0.0040969434,0.00004037424,0.00010956732,0.0002841169,0.00007303402,0.88245875,0.072012104,0.005863017,0.03311882,0.00011883071],"about_ca_topic_score_codex":0.009358896,"about_ca_topic_score_gemma":0.020211147,"teacher_disagreement_score":0.009358896,"about_ca_system_score_codex":0.00093877676,"about_ca_system_score_gemma":0.0021980666,"threshold_uncertainty_score":0.01878804},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34935033,0.0004715948,0.6197517,0.00028856576,0.0003145462,0.00029307508,0.0005500789,0.0019683167,0.027011737],"genre_scores_gemma":[0.91809505,0.000059515016,0.07831668,0.00003366237,0.00004642347,0.00021234632,0.00022729677,0.00013601314,0.0028730647],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.993359,0.0025926204,0.0003176451,0.0009768737,0.0022320761,0.0005218695],"domain_scores_gemma":[0.9891915,0.0041510086,0.0018899674,0.0014355411,0.0024750275,0.00085704296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027892923,0.00062065705,0.000538639,0.002239096,0.001008576,0.0022552942,0.0012232156,0.0005426686,0.003534927],"category_scores_gemma":[0.01852779,0.00023204101,0.00029571116,0.0019276821,0.0012498469,0.0023472,0.0017337614,0.0009347248,0.00066012406],"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.002639862,0.0005636369,0.057808936,0.00054717413,0.00014216935,0.00034489608,0.003237173,0.10518628,0.04606322,0.275707,0.0076033715,0.50015634],"study_design_scores_gemma":[0.00010985872,0.0018238631,0.028463146,0.00010099593,0.00007935279,0.00046048916,0.0012548649,0.7566657,0.06835216,0.10702154,0.0354203,0.0002476928],"about_ca_topic_score_codex":0.0018317369,"about_ca_topic_score_gemma":0.0017393817,"teacher_disagreement_score":0.003534927,"about_ca_system_score_codex":0.001304672,"about_ca_system_score_gemma":0.0014016946,"threshold_uncertainty_score":0.014751375},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053308178,0.00302377,0.8500135,0.0014821562,0.0009021449,0.00018807255,0.0019696623,0.01281624,0.076296285],"genre_scores_gemma":[0.4762403,0.0014642365,0.48409688,0.00059882307,0.0002140269,0.00047082824,0.0027054066,0.0069465353,0.027262961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996557,0.00008633413,0.000020193433,0.000032135056,0.00016149701,0.000044193243],"domain_scores_gemma":[0.9994289,0.00015148094,0.00003958564,0.00010859927,0.00019585545,0.00007549597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043255396,0.00067566347,0.00094231433,0.00044124832,0.0005133809,0.0009839677,0.0015079632,0.00079414673,0.012512238],"category_scores_gemma":[0.0021744964,0.0003799778,0.00068630616,0.00090901315,0.00035906935,0.0007778443,0.0014977419,0.0017477184,0.003105561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055691367,0.00022524911,0.004199962,0.0005780241,0.000371328,0.00057180144,0.0005654597,0.55690104,0.01305373,0.14545451,0.07707307,0.20044895],"study_design_scores_gemma":[0.00008021165,0.000025851443,0.00051055057,0.000032564207,0.000020123469,0.00007526583,0.000035481455,0.9593343,0.0026445258,0.012988533,0.024220286,0.000032390544],"about_ca_topic_score_codex":0.009359422,"about_ca_topic_score_gemma":0.0114436215,"teacher_disagreement_score":0.012512238,"about_ca_system_score_codex":0.0005354543,"about_ca_system_score_gemma":0.0015472781,"threshold_uncertainty_score":0.0418576},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9639707,0.00028482729,0.018993732,0.00016668979,0.000058402675,0.00028162953,0.00090770435,0.0093351295,0.006001173],"genre_scores_gemma":[0.9182743,0.00019241695,0.06860532,0.00017684505,0.000027036294,0.0004884325,0.0030457184,0.0044150865,0.0047748457],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.996345,0.0011229416,0.0002984023,0.0010317421,0.0008949018,0.00030703016],"domain_scores_gemma":[0.96498245,0.021042861,0.0033020084,0.0046973024,0.00468175,0.0012936062],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0033290647,0.001143546,0.00052732986,0.0011731621,0.0005238693,0.0011518071,0.0012572824,0.00093010283,0.004062288],"category_scores_gemma":[0.033694092,0.0005055669,0.00038962634,0.0009377805,0.0007627168,0.0011190696,0.0014017832,0.0010264042,0.0028971597],"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.008577806,0.0028498995,0.09764338,0.0034359829,0.0004972672,0.0021897831,0.028326135,0.017759418,0.26207674,0.0034849069,0.05062449,0.52253425],"study_design_scores_gemma":[0.0012090139,0.008945474,0.37326193,0.00073560624,0.00038917654,0.003247195,0.006184525,0.2077616,0.30497092,0.004825855,0.0878005,0.0006681984],"about_ca_topic_score_codex":0.0022438394,"about_ca_topic_score_gemma":0.0041467696,"teacher_disagreement_score":0.99667096,"about_ca_system_score_codex":0.00057890837,"about_ca_system_score_gemma":0.0006921867,"threshold_uncertainty_score":0.01760602},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10743207,0.00058542856,0.87593365,0.00022894121,0.00025288173,0.00021456597,0.0002077159,0.009301373,0.005843439],"genre_scores_gemma":[0.88581425,0.00017538952,0.10981528,0.00024413763,0.000050820116,0.00009617814,0.00036939574,0.0002927515,0.0031418633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996051,0.00003989874,0.000024690571,0.00009767741,0.00011963465,0.00011296715],"domain_scores_gemma":[0.99950945,0.00011007107,0.000055682234,0.0001483249,0.000117517295,0.00005907501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037502937,0.0008606919,0.0004863896,0.00061610277,0.0006296181,0.0008244837,0.0013236526,0.00046579525,0.0027550927],"category_scores_gemma":[0.0013243059,0.00017934218,0.00037991497,0.0004906588,0.00049903535,0.0010547457,0.0009361325,0.0007668059,0.00044305265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000910312,0.00048172084,0.0073188613,0.00024735715,0.00007342844,0.0005100362,0.00036189688,0.23058125,0.10733754,0.016122261,0.015424151,0.6206313],"study_design_scores_gemma":[0.00003593657,0.00014621102,0.0010059349,0.000016213227,0.000017458951,0.00016754177,0.00006065872,0.9596238,0.026341118,0.0053877668,0.007167676,0.000029626035],"about_ca_topic_score_codex":0.0041308342,"about_ca_topic_score_gemma":0.00611432,"teacher_disagreement_score":0.0041308342,"about_ca_system_score_codex":0.0008386492,"about_ca_system_score_gemma":0.0011449406,"threshold_uncertainty_score":0.009216726},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88962567,0.00035957422,0.06223115,0.00044025088,0.00011681445,0.00021020687,0.0005769129,0.033067502,0.0133719575],"genre_scores_gemma":[0.9763974,0.000051143237,0.020645756,0.000105121704,0.000013687742,0.000037069192,0.00044006712,0.00028638827,0.0020233956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990626,0.00015969235,0.000048674625,0.00016264257,0.00036602607,0.00020039154],"domain_scores_gemma":[0.99675876,0.0008461224,0.00024953054,0.0009784546,0.0008356126,0.00033156187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009597446,0.0010732781,0.00064064417,0.0009133196,0.0007236414,0.0011457839,0.0015946309,0.0004458693,0.0029347397],"category_scores_gemma":[0.004661097,0.0003642444,0.00017023366,0.0009930142,0.00058983197,0.0012332457,0.0007799984,0.0007115768,0.00046812653],"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.006040497,0.0018987393,0.015804354,0.0003714434,0.00014657683,0.0010615297,0.00060196075,0.41151312,0.18220286,0.0057190033,0.024917932,0.349722],"study_design_scores_gemma":[0.00017809946,0.00047471817,0.004463637,0.000011086023,0.00003081716,0.00013830629,0.00010378478,0.95186627,0.038704276,0.0008118671,0.0031771306,0.000040126783],"about_ca_topic_score_codex":0.02945189,"about_ca_topic_score_gemma":0.026899075,"teacher_disagreement_score":0.02945189,"about_ca_system_score_codex":0.0014377533,"about_ca_system_score_gemma":0.0016874109,"threshold_uncertainty_score":0.058560908},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06620411,0.002132517,0.9152847,0.00034030952,0.00017772686,0.000057583202,0.00019190703,0.005556829,0.0100542605],"genre_scores_gemma":[0.50176865,0.0013884028,0.48617324,0.00022816754,0.00020403323,0.000080910584,0.00050838356,0.0004788466,0.009169359],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997551,0.00004571915,0.000018443585,0.00005002005,0.00010457875,0.000026229274],"domain_scores_gemma":[0.99913484,0.00041565212,0.00008848044,0.00014005482,0.00020035828,0.000020650603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034556768,0.0008853501,0.00060730794,0.0008964532,0.0002991437,0.00075419573,0.0009978309,0.00040394568,0.004989901],"category_scores_gemma":[0.0015787813,0.0003067185,0.00042744353,0.0015890222,0.00016517848,0.0013734224,0.0003101131,0.0010675025,0.0019285767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002498676,0.00023882766,0.0011772276,0.00012455649,0.000052815376,0.000040595878,0.000025746103,0.14290756,0.033113852,0.0029692226,0.0048398385,0.8142599],"study_design_scores_gemma":[0.000018028779,0.00008927451,0.0005405772,0.00001574988,0.000033504708,0.0000492819,0.0000060047146,0.97631806,0.018010613,0.0030783,0.0018320745,0.000008423222],"about_ca_topic_score_codex":0.0014578258,"about_ca_topic_score_gemma":0.003468653,"teacher_disagreement_score":0.004989901,"about_ca_system_score_codex":0.000368528,"about_ca_system_score_gemma":0.0005904979,"threshold_uncertainty_score":0.016692877},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06717879,0.00056085543,0.7693249,0.00074296235,0.00071811024,0.00024801373,0.0011795706,0.03513927,0.124907576],"genre_scores_gemma":[0.6166043,0.0005192311,0.32961047,0.00063790055,0.00043726392,0.00028018243,0.0030154614,0.015175385,0.033719715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873275,0.00023199047,0.00011416363,0.00022646217,0.00046219918,0.00023240766],"domain_scores_gemma":[0.99692863,0.0007811035,0.000095355375,0.0017976932,0.00033615707,0.00006104204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076090085,0.0008497232,0.0006008682,0.0007844828,0.0005483109,0.0016875876,0.0013582672,0.00051347836,0.026622618],"category_scores_gemma":[0.004839665,0.00047893912,0.0015675506,0.0011844762,0.0010717696,0.0024984195,0.0019903327,0.0018352659,0.004814747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010496287,0.000368389,0.0022637672,0.00053663476,0.00017144298,0.00034086304,0.00027254742,0.07972938,0.02727166,0.21044567,0.038008075,0.6395418],"study_design_scores_gemma":[0.00022973634,0.0003029271,0.001663252,0.00013278393,0.00021005992,0.00031747032,0.0001404503,0.39870837,0.07993301,0.432531,0.08575803,0.000072922],"about_ca_topic_score_codex":0.0024404214,"about_ca_topic_score_gemma":0.003926384,"teacher_disagreement_score":0.026622618,"about_ca_system_score_codex":0.0005835015,"about_ca_system_score_gemma":0.0012408107,"threshold_uncertainty_score":0.08906156},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040445887,0.00007881978,0.91224575,0.00017976864,0.00008337105,0.00020340407,0.0001610213,0.040987346,0.0056146],"genre_scores_gemma":[0.22480123,0.00014015297,0.75679296,0.0003722522,0.00003682978,0.00037357304,0.0009456794,0.011834178,0.004703232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827397,0.00035584552,0.00014730726,0.00028065557,0.0006694137,0.00027282975],"domain_scores_gemma":[0.9961436,0.001151871,0.0003734891,0.001467911,0.00069445686,0.00016871135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024350444,0.0010116537,0.0003262099,0.000959208,0.0005273706,0.0013525396,0.0021623361,0.0008646696,0.002551893],"category_scores_gemma":[0.008438973,0.0008649485,0.0011275134,0.00066849747,0.001237216,0.0028891044,0.0037418404,0.0024075028,0.0010259745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001219427,0.00079327944,0.018044103,0.0011037788,0.00035774292,0.0016251801,0.003083244,0.08245474,0.17962469,0.123675995,0.039935064,0.5480827],"study_design_scores_gemma":[0.00023827389,0.00039403813,0.0033436974,0.00020256669,0.00015775759,0.0010637629,0.00032285834,0.5240927,0.2852149,0.045110762,0.13966203,0.00019675292],"about_ca_topic_score_codex":0.0018251505,"about_ca_topic_score_gemma":0.002214073,"teacher_disagreement_score":0.002551893,"about_ca_system_score_codex":0.00063249393,"about_ca_system_score_gemma":0.0028339063,"threshold_uncertainty_score":0.0128778815},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001254734,0.0022967563,0.059793558,0.0012170378,0.0028302846,0.00020799637,0.0061735203,0.046965614,0.8792604],"genre_scores_gemma":[0.010447742,0.0021606921,0.040304363,0.0012410238,0.0012409266,0.00040841068,0.01569967,0.01730878,0.9111885],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99929607,0.0000623884,0.00003032896,0.00014850439,0.00037326204,0.000089449706],"domain_scores_gemma":[0.999027,0.0001266898,0.000035653684,0.0003053703,0.00033880997,0.00016647899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005350059,0.0014703458,0.000998616,0.0016716708,0.0016212002,0.0042163227,0.0024388211,0.0013559518,0.47604156],"category_scores_gemma":[0.0020836547,0.0010594517,0.00078566297,0.001827101,0.00051006535,0.004020704,0.0033013804,0.0031465564,0.42430967],"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.00007836071,0.0000761128,0.0001220249,0.00022871883,0.000012867293,0.000043051663,0.00008068569,0.0006904215,0.0020976502,0.02642724,0.7368536,0.23328932],"study_design_scores_gemma":[0.00002019796,0.000020762263,0.00012855188,0.00007490596,0.000008360656,0.00007909202,0.00002387977,0.0015558584,0.0016586805,0.016823508,0.97958905,0.00001725226],"about_ca_topic_score_codex":0.00094649964,"about_ca_topic_score_gemma":0.0011039122,"teacher_disagreement_score":0.47604156,"about_ca_system_score_codex":0.0006772462,"about_ca_system_score_gemma":0.00079766475,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018588173,0.006350084,0.5000195,0.0012179313,0.0027488286,0.00012955646,0.002756862,0.027007513,0.45791093],"genre_scores_gemma":[0.020692471,0.0059878123,0.36272895,0.0010268929,0.0011019985,0.00035471417,0.0051766257,0.016391974,0.58653855],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99954295,0.000043433956,0.000023316956,0.00010676853,0.00024295249,0.000040574065],"domain_scores_gemma":[0.99945253,0.0000732759,0.000021732612,0.00013779163,0.00026949056,0.000045199333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000333032,0.0014200668,0.00084309734,0.0011213842,0.00075205567,0.0029659038,0.0017309561,0.0009115904,0.12873603],"category_scores_gemma":[0.0013983,0.0007393052,0.000648882,0.0023533078,0.0005447844,0.00219849,0.0014578709,0.0024428533,0.11087216],"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.000045575398,0.00004956059,0.00014578148,0.0003622196,0.0000222751,0.00006601563,0.00009192437,0.005071922,0.0060823434,0.09274511,0.43010423,0.46521303],"study_design_scores_gemma":[0.000010632225,0.0000172171,0.00017221904,0.00012183729,0.0000109432285,0.00014983841,0.000023302713,0.015198597,0.0061325077,0.036638364,0.9415019,0.000022568389],"about_ca_topic_score_codex":0.0019772255,"about_ca_topic_score_gemma":0.0020605754,"teacher_disagreement_score":0.12873603,"about_ca_system_score_codex":0.0008671824,"about_ca_system_score_gemma":0.00092020625,"threshold_uncertainty_score":0.43066496},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022030137,0.007348409,0.63330644,0.0011938427,0.0028462007,0.00012963841,0.0019414013,0.024275556,0.3267555],"genre_scores_gemma":[0.029846549,0.007242126,0.4342509,0.0012297344,0.001139706,0.00048370872,0.005060293,0.016655784,0.50409114],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99946755,0.00004803548,0.00002819256,0.00010621564,0.00029762078,0.000052325737],"domain_scores_gemma":[0.9994042,0.00007298928,0.00001921846,0.0001394534,0.0003197946,0.000044386532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039706205,0.0013712628,0.0007414497,0.0011237432,0.0006854408,0.0027757832,0.0016775237,0.00087172317,0.06831991],"category_scores_gemma":[0.0015484204,0.0008656638,0.0006623189,0.0020293042,0.0005353632,0.0018175608,0.0012870113,0.002389211,0.059617274],"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.000052146188,0.00004553749,0.00017810617,0.00034666908,0.00003069855,0.00008791127,0.0000861261,0.010171366,0.006338186,0.10336184,0.35756582,0.5217356],"study_design_scores_gemma":[0.000013403461,0.000018268995,0.0002432841,0.00016461614,0.00001412039,0.00018322203,0.000027474774,0.035562824,0.007888395,0.053121407,0.9027322,0.000030857478],"about_ca_topic_score_codex":0.0029395225,"about_ca_topic_score_gemma":0.002836,"teacher_disagreement_score":0.06831991,"about_ca_system_score_codex":0.0009039191,"about_ca_system_score_gemma":0.0011490723,"threshold_uncertainty_score":0.22855288},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016814194,0.0037764495,0.082421936,0.0011647973,0.0030584398,0.0002478356,0.0064894604,0.048889,0.85227066],"genre_scores_gemma":[0.008811005,0.0024552536,0.046045393,0.00079077395,0.0008987966,0.00041382728,0.014150126,0.014046745,0.912388],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992392,0.000055696913,0.00002939503,0.0001345924,0.0004531134,0.00008795073],"domain_scores_gemma":[0.9991916,0.0001117416,0.000024721061,0.00024212588,0.0003032086,0.00012650492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005682191,0.0015166578,0.001063828,0.0017935878,0.0015008864,0.0039306027,0.0023570163,0.0011586678,0.3861657],"category_scores_gemma":[0.0017546746,0.0011888841,0.00074240455,0.0019587146,0.00042623165,0.0035858692,0.0028189942,0.0029879056,0.32272694],"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.000095774536,0.00007952659,0.000116715055,0.00022323085,0.000012589332,0.00004786305,0.000070432536,0.0011883128,0.0022356417,0.024931615,0.67369884,0.29729947],"study_design_scores_gemma":[0.000020826874,0.000022327189,0.00017811172,0.00007831159,0.000008082587,0.00010224263,0.00002405366,0.002245934,0.0017095644,0.019852242,0.9757402,0.000018087663],"about_ca_topic_score_codex":0.0009683002,"about_ca_topic_score_gemma":0.0012157017,"teacher_disagreement_score":0.3861657,"about_ca_system_score_codex":0.0006609632,"about_ca_system_score_gemma":0.00092599477,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007916784,0.017253423,0.003640769,0.00097328715,0.0008238326,0.00002108054,0.00065440196,0.00070210325,0.97513944],"genre_scores_gemma":[0.003481824,0.008988932,0.0028035415,0.00054365594,0.00029405934,0.00002182682,0.0004317099,0.00029259775,0.9831419],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996773,0.000019864796,0.000010819291,0.00006007643,0.0001982631,0.00003367168],"domain_scores_gemma":[0.9996681,0.00008088951,0.000015437769,0.00005559333,0.00009948498,0.00008035897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016484509,0.0008647816,0.00091829547,0.0013711564,0.0009800199,0.0047966214,0.0010376747,0.0007231093,0.2845657],"category_scores_gemma":[0.0008954808,0.0005500957,0.00039561986,0.0039122193,0.0005883883,0.0040244292,0.001453305,0.0017048402,0.13514577],"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.000035874786,0.00005084598,0.0002230219,0.00022758658,0.000007073629,0.000058622845,0.00018689848,0.0002737759,0.001175749,0.08133386,0.6337458,0.2826809],"study_design_scores_gemma":[0.0000021742917,0.000009226161,0.00025657364,0.00010439989,0.0000032441833,0.00010531488,0.00006609547,0.00013831703,0.00014079806,0.008580481,0.9905901,0.0000032713806],"about_ca_topic_score_codex":0.0021023182,"about_ca_topic_score_gemma":0.004932646,"teacher_disagreement_score":0.2845657,"about_ca_system_score_codex":0.0008189225,"about_ca_system_score_gemma":0.0010010827,"threshold_uncertainty_score":0.95196706},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058154906,0.00373745,0.0052474756,0.007961526,0.0007511105,0.000019876907,0.0003170959,0.0006437634,0.9755062],"genre_scores_gemma":[0.23476507,0.009016555,0.011390322,0.0060062166,0.0012162961,0.00022658882,0.0014331908,0.0023700006,0.7335758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993344,0.00019893456,0.000023321694,0.00016103253,0.00015250762,0.00012976845],"domain_scores_gemma":[0.999332,0.0001501851,0.000054113883,0.00018213605,0.00011158031,0.00016998428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008720601,0.0004853288,0.0004613584,0.001693101,0.0033468078,0.008490793,0.0010464236,0.0013827124,0.09027579],"category_scores_gemma":[0.0029676952,0.0003261636,0.00034554346,0.0021033238,0.0037385216,0.008034073,0.0043599554,0.0022801307,0.02584189],"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.00002946611,0.000008599064,0.00020841217,0.000024883973,0.0000031346071,0.000039231556,0.0005095025,0.00010940108,0.00007794258,0.89892596,0.065832555,0.03423092],"study_design_scores_gemma":[0.0000067084607,0.0000059306553,0.00013742353,0.00007828895,0.0000019551387,0.00006393842,0.0003078179,0.0002414088,0.000071347036,0.1745662,0.82451344,0.0000055548617],"about_ca_topic_score_codex":0.003359612,"about_ca_topic_score_gemma":0.0042421934,"teacher_disagreement_score":0.09027579,"about_ca_system_score_codex":0.0022898505,"about_ca_system_score_gemma":0.0015706553,"threshold_uncertainty_score":0.3020026},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016072778,0.0021254374,0.32740694,0.0006212105,0.0012489519,0.00041529516,0.014972065,0.14262323,0.5089796],"genre_scores_gemma":[0.012808506,0.002087229,0.27156252,0.0011579747,0.0005815154,0.0008225547,0.028404657,0.04068659,0.64188844],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987783,0.00008331823,0.00007351265,0.00024190274,0.00071070495,0.0001123072],"domain_scores_gemma":[0.9990019,0.00017523531,0.00003946261,0.00032502768,0.00037538938,0.000083013016],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00060623256,0.0026658499,0.0015620837,0.0021474722,0.0010564724,0.0029567825,0.003457573,0.001172718,0.35904402],"category_scores_gemma":[0.0022013874,0.001316117,0.0015892462,0.0029603662,0.000601352,0.0032622,0.0023115154,0.003302184,0.39486042],"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.0001216027,0.00007491225,0.00013952672,0.0005529035,0.000030811905,0.0000849489,0.000062897896,0.0026561916,0.004847081,0.038205728,0.5800232,0.37320012],"study_design_scores_gemma":[0.00004946109,0.000035375324,0.00024171328,0.00011994707,0.000024485575,0.00020341141,0.000014526549,0.008707232,0.006802902,0.024206398,0.95954835,0.000046231762],"about_ca_topic_score_codex":0.0018153266,"about_ca_topic_score_gemma":0.0020651105,"teacher_disagreement_score":0.35904402,"about_ca_system_score_codex":0.0008616943,"about_ca_system_score_gemma":0.0012894019,"threshold_uncertainty_score":0.9142459},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00221535,0.009900419,0.59290713,0.001075462,0.0030904808,0.00014749441,0.0028013836,0.030701673,0.35716054],"genre_scores_gemma":[0.024973057,0.0077538826,0.42664948,0.0010854268,0.0010429563,0.00051557325,0.0060756477,0.018632937,0.51327103],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994697,0.000046515033,0.000027490654,0.00011142595,0.00029023556,0.000054562675],"domain_scores_gemma":[0.99943143,0.00008458113,0.000019921654,0.0001406918,0.00027749248,0.000045844827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037982967,0.0016124777,0.0008725351,0.0013759794,0.00069150137,0.0026915416,0.0017247965,0.00097441184,0.08729253],"category_scores_gemma":[0.0014643304,0.0009770092,0.000621447,0.0025488809,0.00054904225,0.0020338024,0.0013487777,0.0024964618,0.07743944],"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.00005799257,0.000046239496,0.00014428906,0.000352192,0.000023637194,0.00008164112,0.000075587675,0.008228344,0.005583735,0.07532862,0.38774297,0.5223348],"study_design_scores_gemma":[0.000015339949,0.000019571411,0.0002493975,0.00014742953,0.000012906081,0.0002117449,0.000026184523,0.029266795,0.0065138233,0.046369094,0.91713595,0.000031883235],"about_ca_topic_score_codex":0.0022247538,"about_ca_topic_score_gemma":0.002408355,"teacher_disagreement_score":0.08729253,"about_ca_system_score_codex":0.0007869836,"about_ca_system_score_gemma":0.0011000884,"threshold_uncertainty_score":0.2920226},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016685918,0.08472124,0.043502547,0.0036348568,0.0051741684,0.00006624583,0.00045515096,0.0018890812,0.8588881],"genre_scores_gemma":[0.010280255,0.024888119,0.015907642,0.0008028926,0.0012731185,0.0000815478,0.00039030443,0.00045556377,0.94592065],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997476,0.000022316359,0.0000064485566,0.000039424558,0.00015866791,0.000025559906],"domain_scores_gemma":[0.99983954,0.00004244898,0.000007770122,0.000037872825,0.00005064147,0.000021658292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024330337,0.0010419621,0.00097152067,0.0011441752,0.0010441621,0.0031135946,0.0010622477,0.000976697,0.0862828],"category_scores_gemma":[0.00069209374,0.0008012975,0.00033088314,0.0028031108,0.000840267,0.0028800895,0.0012161325,0.0028684677,0.034455534],"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.000040034458,0.0000392563,0.000100802805,0.00025082365,0.000013111698,0.000041494324,0.00014565497,0.002120436,0.0020029529,0.33718717,0.44411337,0.21394491],"study_design_scores_gemma":[0.0000054586735,0.000014228024,0.00014381709,0.00006334736,0.0000046340238,0.00006247514,0.000032088003,0.0013598797,0.0003832437,0.06333398,0.9345899,0.0000069328294],"about_ca_topic_score_codex":0.0014741893,"about_ca_topic_score_gemma":0.0026339365,"teacher_disagreement_score":0.0862828,"about_ca_system_score_codex":0.0011864698,"about_ca_system_score_gemma":0.0010700644,"threshold_uncertainty_score":0.28864467},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019832647,0.0023794114,0.09886348,0.0013731123,0.0031600248,0.00025418273,0.005888342,0.049678575,0.8364195],"genre_scores_gemma":[0.014259615,0.0019626813,0.058711097,0.0010189201,0.0010505795,0.00047157743,0.016008787,0.015636967,0.8908798],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924904,0.000058942696,0.000028911947,0.000122998,0.00044530272,0.0000948225],"domain_scores_gemma":[0.99914515,0.00010563325,0.000024860914,0.00024696198,0.00034380888,0.00013343772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057316304,0.0011777477,0.00080928224,0.0012648712,0.001436891,0.0037334936,0.0022687907,0.0010405133,0.32415578],"category_scores_gemma":[0.0018675072,0.0008994494,0.0007229466,0.0012952251,0.00040372316,0.002877523,0.002682678,0.0026783275,0.26343635],"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.00009413342,0.00007785202,0.00015018368,0.00020007223,0.000013296017,0.00005078214,0.00008050844,0.0013583871,0.0024574809,0.032549743,0.68926924,0.2736983],"study_design_scores_gemma":[0.000021666605,0.000021430158,0.00018480286,0.00007503044,0.000008143098,0.00008976516,0.000027298667,0.0027746654,0.002066969,0.021932654,0.97278005,0.000017537084],"about_ca_topic_score_codex":0.0012406264,"about_ca_topic_score_gemma":0.0014451162,"teacher_disagreement_score":0.32415578,"about_ca_system_score_codex":0.0006925314,"about_ca_system_score_gemma":0.0009938433,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011220354,0.000349026,0.88005143,0.00013001614,0.000060831604,0.00018058547,0.00034497355,0.105286956,0.0023758712],"genre_scores_gemma":[0.124616906,0.00029299126,0.85698456,0.00022519952,0.000034400367,0.00030471003,0.0020279074,0.010919088,0.004594175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986186,0.00021009006,0.00011448256,0.00033943958,0.0005528246,0.00016449083],"domain_scores_gemma":[0.9986174,0.0004555805,0.0001601454,0.00046287448,0.00024633674,0.000057751342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013157048,0.0019443404,0.00063571753,0.001178973,0.0005028805,0.0010710352,0.0022387635,0.0009838018,0.00639942],"category_scores_gemma":[0.003557404,0.00083144824,0.001400259,0.0004791401,0.0010323662,0.0011410248,0.001943545,0.0017495238,0.0033370324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055298634,0.00024294615,0.003202178,0.0010865228,0.0001316116,0.0007970297,0.00078850245,0.13423176,0.15829782,0.020642437,0.033674035,0.64635223],"study_design_scores_gemma":[0.00014507922,0.0002957451,0.00092128007,0.00012926005,0.00007719678,0.0004251447,0.000089448426,0.755685,0.17975715,0.012644279,0.04970445,0.00012605086],"about_ca_topic_score_codex":0.0033493694,"about_ca_topic_score_gemma":0.0042874324,"teacher_disagreement_score":0.00639942,"about_ca_system_score_codex":0.00086321874,"about_ca_system_score_gemma":0.002037947,"threshold_uncertainty_score":0.0214082},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28233358,0.00054387585,0.6790224,0.00067000027,0.00021415863,0.00022256725,0.00026714997,0.020540284,0.016186107],"genre_scores_gemma":[0.73881024,0.000092257775,0.25536954,0.00020279057,0.000052982617,0.00017725838,0.0003771532,0.001002347,0.003915351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991642,0.00015582844,0.000045754008,0.00019233931,0.0002473799,0.000194539],"domain_scores_gemma":[0.9979619,0.000707285,0.00019261932,0.00047981256,0.00042310738,0.00023524219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010720132,0.0010228748,0.0005002679,0.000490642,0.0008559659,0.00125438,0.0025445204,0.0005823847,0.0036413318],"category_scores_gemma":[0.003750153,0.00038131047,0.00044191675,0.0007476449,0.0008788317,0.0014246391,0.001922672,0.0011882484,0.0007422574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010890778,0.00048157212,0.00954861,0.00028923454,0.00010742293,0.00028793444,0.00049378467,0.6760353,0.051051598,0.013598165,0.016400708,0.23061655],"study_design_scores_gemma":[0.00007112428,0.00009470427,0.000421595,0.000006014481,0.000014838517,0.000026142689,0.000054882283,0.98096883,0.013803342,0.00178539,0.0027408595,0.000012180842],"about_ca_topic_score_codex":0.012148795,"about_ca_topic_score_gemma":0.019069782,"teacher_disagreement_score":0.012148795,"about_ca_system_score_codex":0.0015273024,"about_ca_system_score_gemma":0.0034637444,"threshold_uncertainty_score":0.024156153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31305033,0.0030770558,0.47972408,0.0006690522,0.0005529174,0.00067931705,0.0022324019,0.18498553,0.015029282],"genre_scores_gemma":[0.8217668,0.00039961882,0.1614636,0.0009757711,0.00011056244,0.00023896137,0.0029124627,0.0016333628,0.010498715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993228,0.00007510865,0.00005907147,0.00019538339,0.00021849162,0.0001292179],"domain_scores_gemma":[0.9977562,0.00025327638,0.00014708658,0.0010828696,0.0005242931,0.00023625072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068069674,0.0009382997,0.00058239495,0.0008434472,0.00070435763,0.0014950858,0.0033177084,0.00051275274,0.006535007],"category_scores_gemma":[0.002098113,0.0005603576,0.0005329819,0.0010272005,0.0005764318,0.0029294826,0.0027979652,0.00073518703,0.0017861463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036957343,0.00087236136,0.034080975,0.0005995995,0.0004890637,0.00048899255,0.00073606014,0.08467596,0.17725955,0.009349807,0.10051937,0.5872326],"study_design_scores_gemma":[0.00039342913,0.0013356137,0.011317637,0.00004164185,0.00029603453,0.0005548978,0.00022738444,0.82205683,0.11012116,0.007838549,0.045489438,0.0003274111],"about_ca_topic_score_codex":0.008650857,"about_ca_topic_score_gemma":0.0115961535,"teacher_disagreement_score":0.008650857,"about_ca_system_score_codex":0.0012637886,"about_ca_system_score_gemma":0.0014834031,"threshold_uncertainty_score":0.021861732},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068514136,0.0005397667,0.0073002824,0.0019185273,0.0028575328,0.000060848186,0.0005210598,0.0005100055,0.9856069],"genre_scores_gemma":[0.012326979,0.0004897244,0.0033206847,0.0010526212,0.0009793157,0.00008537724,0.0005789584,0.00082484155,0.98034143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987142,0.00024196818,0.000055813518,0.00037639937,0.00048827063,0.0001233606],"domain_scores_gemma":[0.9983524,0.0003870886,0.00006278528,0.0004876143,0.00062137307,0.00008874711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070463656,0.001078153,0.0007362124,0.0015919397,0.0027799953,0.0034555048,0.0018380773,0.0012218882,0.3290732],"category_scores_gemma":[0.004604825,0.00039671018,0.0007575759,0.0015284859,0.0022103912,0.0044314126,0.0028942975,0.0028305573,0.2045315],"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.00006246549,0.000020869731,0.00009024063,0.00017027499,0.000007849448,0.00013632013,0.00077695795,0.0000965244,0.00092690997,0.47465855,0.43425882,0.08879432],"study_design_scores_gemma":[0.000004821967,0.000007732948,0.0000674572,0.000034924717,0.0000033802437,0.00013175186,0.000095353884,0.000070471535,0.0003547692,0.04701936,0.9522033,0.000006696203],"about_ca_topic_score_codex":0.002236713,"about_ca_topic_score_gemma":0.0029910025,"teacher_disagreement_score":0.3290732,"about_ca_system_score_codex":0.0014810108,"about_ca_system_score_gemma":0.0012434035,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25168616,0.0007700529,0.7234058,0.0009321399,0.0012928325,0.00039933057,0.00026978654,0.008857218,0.012386792],"genre_scores_gemma":[0.77731925,0.00017954964,0.21450013,0.00038073238,0.00021647743,0.00013822789,0.0003087399,0.00055362965,0.0064032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995788,0.000085548556,0.000031558688,0.00006957961,0.00014812863,0.00008635876],"domain_scores_gemma":[0.9983358,0.000265039,0.00008679151,0.0003180644,0.00064200244,0.0003524902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087429065,0.00043052118,0.0005247944,0.00046780004,0.0011417413,0.0010467302,0.0017247496,0.00039162993,0.003057507],"category_scores_gemma":[0.0028807798,0.00033533448,0.00032293334,0.0005983308,0.0004319542,0.00086016476,0.0014577002,0.0009264276,0.0008930341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034317488,0.0029116848,0.0134192305,0.00038636383,0.00030778826,0.0006994071,0.0009205542,0.18336143,0.27541488,0.06642701,0.06338762,0.38933235],"study_design_scores_gemma":[0.00038646872,0.00038907735,0.0012544129,0.000013136645,0.00007603527,0.0001005043,0.000096060416,0.9449443,0.028223481,0.010310625,0.014163042,0.000042835116],"about_ca_topic_score_codex":0.0033557538,"about_ca_topic_score_gemma":0.009066742,"teacher_disagreement_score":0.0033557538,"about_ca_system_score_codex":0.0007083143,"about_ca_system_score_gemma":0.0037625686,"threshold_uncertainty_score":0.010228395},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3892922,0.019607937,0.37999323,0.0009670132,0.000896906,0.001134017,0.009586902,0.14571677,0.05280496],"genre_scores_gemma":[0.8322352,0.0018745364,0.1371289,0.0006240733,0.00010515171,0.00044360964,0.008444131,0.0031805953,0.015963666],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99933594,0.00006087044,0.000069686415,0.00006896774,0.0003620281,0.0001024068],"domain_scores_gemma":[0.9986589,0.00024634486,0.00020142182,0.00031575852,0.0004871757,0.000090455804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039526477,0.00061541086,0.0004468788,0.00094900094,0.00039936422,0.0010505955,0.002888073,0.00055503537,0.008381056],"category_scores_gemma":[0.0018905253,0.00036194475,0.00041172814,0.0012440248,0.00020299082,0.001441927,0.00063943723,0.0007026473,0.0014744034],"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.0036243277,0.00076985976,0.018707016,0.0030158407,0.00052191067,0.0011330573,0.00049327605,0.06976599,0.12850063,0.014953359,0.15632854,0.60218626],"study_design_scores_gemma":[0.0010312948,0.0033249184,0.012587171,0.0004498357,0.00048794472,0.0019243216,0.00024152965,0.4060559,0.23156585,0.0044030705,0.33750135,0.00042683556],"about_ca_topic_score_codex":0.0037644785,"about_ca_topic_score_gemma":0.010071638,"teacher_disagreement_score":0.008381056,"about_ca_system_score_codex":0.001076732,"about_ca_system_score_gemma":0.0015712057,"threshold_uncertainty_score":0.028037488},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008029705,0.00013613714,0.9867251,0.00009000801,0.000045843273,0.000051117826,0.00004324554,0.0019891858,0.002889659],"genre_scores_gemma":[0.47097716,0.00022280993,0.5220327,0.00018358958,0.000052119285,0.0002326832,0.00021065035,0.00020048353,0.0058879075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997675,0.000045079203,0.000013764779,0.00005041318,0.00008550696,0.00003789716],"domain_scores_gemma":[0.99972755,0.00009942611,0.000025796711,0.00005606561,0.000061626844,0.00002961751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049708557,0.0004588954,0.00049258716,0.0002594366,0.00024723238,0.00053796766,0.0014811468,0.0005599708,0.00484176],"category_scores_gemma":[0.001191634,0.00036520528,0.00028839547,0.00027253007,0.0004252432,0.0006060015,0.0008867993,0.0011624033,0.0009861788],"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.0004307235,0.00015189465,0.0011678371,0.00021081866,0.00008572526,0.00015040775,0.000105554645,0.6006574,0.022234721,0.033371434,0.006773819,0.33465973],"study_design_scores_gemma":[0.000018463359,0.000054659653,0.00009375503,0.000005571829,0.000005667102,0.000017060385,0.00000345543,0.9927147,0.0028881032,0.002335788,0.0018570516,0.0000056545014],"about_ca_topic_score_codex":0.0033273564,"about_ca_topic_score_gemma":0.004544017,"teacher_disagreement_score":0.00484176,"about_ca_system_score_codex":0.0005171029,"about_ca_system_score_gemma":0.001439683,"threshold_uncertainty_score":0.016197324},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30488226,0.013733354,0.16529222,0.006994648,0.0035763958,0.00018450925,0.012319059,0.14734688,0.34567064],"genre_scores_gemma":[0.71022844,0.0032730112,0.09877612,0.0010679533,0.0004941494,0.00015843158,0.018027393,0.02387682,0.1440978],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993818,0.00008080829,0.000014802129,0.000069850095,0.00035244285,0.000100417936],"domain_scores_gemma":[0.9993617,0.00019661403,0.000022087628,0.00011852872,0.00021633916,0.00008482959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008143822,0.0006623201,0.0005190072,0.00050425564,0.00045190897,0.001487824,0.0010893906,0.0004580216,0.015494675],"category_scores_gemma":[0.0022458578,0.00051280286,0.0003414078,0.001165107,0.00032428835,0.0015875946,0.0009629866,0.0016585381,0.0039957287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011774972,0.00021451099,0.0029505533,0.0003300535,0.0000682107,0.0002362172,0.0005036394,0.036629573,0.018886121,0.017796868,0.5007632,0.42044362],"study_design_scores_gemma":[0.00019609326,0.0005126052,0.014207569,0.00017196393,0.00008270393,0.00036149993,0.0003615451,0.46953052,0.04189613,0.027734721,0.4447887,0.00015597865],"about_ca_topic_score_codex":0.0077728685,"about_ca_topic_score_gemma":0.010855199,"teacher_disagreement_score":0.015494675,"about_ca_system_score_codex":0.00064356753,"about_ca_system_score_gemma":0.0009783934,"threshold_uncertainty_score":0.05183482},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020993906,0.0001890414,0.7420371,0.00024500335,0.00029435626,0.00013423823,0.0038157508,0.23697774,0.014207386],"genre_scores_gemma":[0.071325876,0.0006195217,0.6750783,0.0012347362,0.00024947588,0.00093407615,0.013173451,0.19233297,0.045051686],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908197,0.00010576708,0.000082858154,0.0001688442,0.00041432754,0.00014620599],"domain_scores_gemma":[0.99885535,0.0004193077,0.000059492173,0.00031325265,0.00022137229,0.00013118827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010074582,0.001346488,0.0010789658,0.0008461174,0.00090878585,0.0021130885,0.003076857,0.00096915296,0.07064403],"category_scores_gemma":[0.0033012894,0.0012050684,0.0019170876,0.001054252,0.0010795827,0.0032303664,0.0031992926,0.0038385831,0.035616826],"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.00071765675,0.00031366723,0.0012616896,0.0013145583,0.00018021098,0.000374262,0.00051129283,0.019818535,0.020986695,0.08544217,0.4920978,0.37698135],"study_design_scores_gemma":[0.0005159398,0.00011954851,0.0010830275,0.00023579132,0.000089340836,0.00058620353,0.0001304535,0.2029316,0.06641121,0.2072565,0.52039003,0.00025043785],"about_ca_topic_score_codex":0.001790836,"about_ca_topic_score_gemma":0.0026382303,"teacher_disagreement_score":0.07064403,"about_ca_system_score_codex":0.0006709258,"about_ca_system_score_gemma":0.0021671753,"threshold_uncertainty_score":0.23632777},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00612909,0.0002189795,0.90319425,0.00012430448,0.00013118707,0.00016873886,0.0007958442,0.08498383,0.004253699],"genre_scores_gemma":[0.1814583,0.00042617312,0.78125125,0.00035811492,0.00008150622,0.0007489507,0.0049123825,0.020578185,0.010185151],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992157,0.00017123549,0.0000684181,0.00020580186,0.0002497995,0.00008900464],"domain_scores_gemma":[0.9984301,0.00074950577,0.000093460214,0.00040179744,0.00027685272,0.000048352424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011684285,0.0015153916,0.0006347071,0.0010050031,0.00041978894,0.0014081536,0.0024257058,0.0009123007,0.016528642],"category_scores_gemma":[0.003387447,0.0009955552,0.0010111434,0.00072367623,0.0006463711,0.0019425766,0.0013846515,0.0012953324,0.0051618707],"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.0011356289,0.0003368358,0.0041704844,0.0015873598,0.00032364126,0.0012293477,0.0005227613,0.1132775,0.10489169,0.064347915,0.08740993,0.620767],"study_design_scores_gemma":[0.00026018737,0.00024488234,0.00056502136,0.00013891594,0.0001269872,0.00052733556,0.00008219374,0.73147464,0.1637736,0.043190476,0.059512097,0.00010364689],"about_ca_topic_score_codex":0.000992649,"about_ca_topic_score_gemma":0.0015484581,"teacher_disagreement_score":0.016528642,"about_ca_system_score_codex":0.00058948854,"about_ca_system_score_gemma":0.0016225073,"threshold_uncertainty_score":0.0552938},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6462608,0.006293311,0.2952863,0.00079324935,0.00041266164,0.0005049323,0.0005356284,0.03706095,0.012852166],"genre_scores_gemma":[0.956208,0.00037524264,0.03746555,0.00016885114,0.000040581897,0.00012514717,0.00038914356,0.0003316973,0.004895805],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992291,0.00009359211,0.000075331074,0.00012954471,0.00029426778,0.0001783317],"domain_scores_gemma":[0.99764985,0.00025515846,0.00029151994,0.0010256884,0.00062375824,0.00015402935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004880697,0.00054086535,0.00058896403,0.00081410474,0.00076044846,0.001059842,0.0017691785,0.00047735652,0.0028367362],"category_scores_gemma":[0.0025026537,0.00026919463,0.00032752997,0.0009421832,0.0004574585,0.0024058553,0.0012418997,0.00068091473,0.0007015437],"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.0048690448,0.0011381826,0.024130508,0.0014624884,0.00052770023,0.0016027284,0.0011218283,0.04845916,0.3861235,0.065214165,0.06129183,0.40405878],"study_design_scores_gemma":[0.00036913794,0.0017714228,0.0060521816,0.00013751713,0.0002748613,0.0018410645,0.0002568896,0.5114069,0.3980252,0.006359146,0.07329244,0.00021328786],"about_ca_topic_score_codex":0.002183934,"about_ca_topic_score_gemma":0.0031837863,"teacher_disagreement_score":0.0028367362,"about_ca_system_score_codex":0.0010843471,"about_ca_system_score_gemma":0.0017202637,"threshold_uncertainty_score":0.009489834},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02737199,0.00015345412,0.96583533,0.0002105042,0.00004421413,0.00004208823,0.000060886236,0.0028798524,0.0034017344],"genre_scores_gemma":[0.38668138,0.00011999824,0.60669893,0.00017692984,0.000042030126,0.00017103433,0.00026966588,0.00094837206,0.0048917183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99976,0.000037477334,0.000010195536,0.000046525704,0.000105472995,0.000040260187],"domain_scores_gemma":[0.9996164,0.00010047007,0.000037900212,0.00008460049,0.00012362545,0.000037063375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003839808,0.00063295255,0.000545845,0.0005844435,0.00053268985,0.0005636136,0.0013955322,0.000669658,0.002822389],"category_scores_gemma":[0.001485537,0.00040641072,0.0006555167,0.00062778493,0.00049973984,0.0010599444,0.00078959996,0.0009739571,0.0005690175],"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.000089178466,0.00008340672,0.0012191919,0.00006179174,0.00005063681,0.000054770873,0.00006752331,0.85392165,0.008902704,0.01180702,0.0028980093,0.12084402],"study_design_scores_gemma":[0.0000038083945,0.000008698982,0.000038272345,0.0000011883972,0.0000020391788,0.0000060217767,0.0000040393384,0.99769586,0.0006505315,0.001193955,0.00039342692,0.0000019744994],"about_ca_topic_score_codex":0.007248723,"about_ca_topic_score_gemma":0.012620248,"teacher_disagreement_score":0.007248723,"about_ca_system_score_codex":0.00077456684,"about_ca_system_score_gemma":0.0015532795,"threshold_uncertainty_score":0.014413059},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02158931,0.0072060144,0.649376,0.0053445348,0.004999459,0.0010913009,0.0314669,0.1854043,0.09352224],"genre_scores_gemma":[0.116824,0.009154712,0.6722022,0.0025564698,0.0012843488,0.0022126448,0.10709496,0.046901703,0.041768942],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805045,0.0005548366,0.00019256459,0.00018025674,0.0008583943,0.00016339537],"domain_scores_gemma":[0.9929594,0.0018566814,0.00030476224,0.0013843547,0.002753509,0.000741333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003945634,0.001772466,0.0009966182,0.0014316712,0.00072527496,0.0024361857,0.003914582,0.0010575182,0.030528812],"category_scores_gemma":[0.012772565,0.0012493089,0.0015676572,0.0016624088,0.00048130343,0.0032128461,0.0019493799,0.0038944948,0.012842131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018401792,0.0007167483,0.0077691735,0.001858617,0.00060783164,0.00037370663,0.00038895506,0.12819742,0.0107370075,0.033022705,0.42089963,0.39358804],"study_design_scores_gemma":[0.00043010732,0.0002064518,0.0018717474,0.0003714372,0.00017754978,0.0001864644,0.000059144808,0.40445572,0.0132876765,0.012341011,0.5664619,0.00015080097],"about_ca_topic_score_codex":0.008757492,"about_ca_topic_score_gemma":0.01012166,"teacher_disagreement_score":0.030528812,"about_ca_system_score_codex":0.0012585183,"about_ca_system_score_gemma":0.0041118953,"threshold_uncertainty_score":0.10212904},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54658186,0.0013101334,0.24474537,0.0009565407,0.00053948513,0.00035741169,0.0008565484,0.0090888785,0.1955637],"genre_scores_gemma":[0.8829101,0.0002876125,0.05286571,0.0002530478,0.00011152854,0.00007331925,0.0010592222,0.00021244702,0.062226985],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999323,0.000011250587,0.0000037481345,0.000009626744,0.000024361183,0.00001877307],"domain_scores_gemma":[0.9999237,0.000012107079,0.000010098609,0.00001255702,0.000029106204,0.0000124548915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010373821,0.00023428275,0.00009345038,0.00018136327,0.00019406561,0.00052286586,0.00038951382,0.00025848582,0.010304658],"category_scores_gemma":[0.00017324009,0.000062178326,0.00008047584,0.00022306303,0.00014747086,0.00038514184,0.00023620336,0.00029410518,0.0020841039],"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.0023554487,0.00022083033,0.009444536,0.00030950137,0.000063691856,0.00088112795,0.00029158156,0.015734395,0.24931358,0.032681353,0.086020716,0.60268325],"study_design_scores_gemma":[0.00031309645,0.0037372722,0.017123763,0.000051423376,0.000099924866,0.0016111439,0.00036500348,0.1643556,0.30466056,0.0043308153,0.50330997,0.000041499294],"about_ca_topic_score_codex":0.00084777334,"about_ca_topic_score_gemma":0.001150779,"teacher_disagreement_score":0.010304658,"about_ca_system_score_codex":0.00027835614,"about_ca_system_score_gemma":0.00024872975,"threshold_uncertainty_score":0.034472525},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007204071,0.00011081785,0.97782063,0.00010998252,0.000029637971,0.00006782679,0.0001179471,0.012975617,0.0015634657],"genre_scores_gemma":[0.238777,0.00019483407,0.75192213,0.00030313816,0.00007602879,0.00027767717,0.00076671096,0.0049417657,0.0027406707],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956864,0.0011748079,0.00046559586,0.00075264677,0.0015077568,0.00041277602],"domain_scores_gemma":[0.993437,0.0028230068,0.00060422183,0.0022105393,0.0008301104,0.0000951274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033504618,0.001496644,0.00088763284,0.0016306249,0.00058113236,0.0027862925,0.0024968004,0.00096979534,0.0044839038],"category_scores_gemma":[0.012097678,0.0009117051,0.0023801327,0.0007917899,0.002433223,0.004207561,0.0031874853,0.0027612112,0.0019166514],"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.00067278196,0.00025805156,0.007845436,0.001289802,0.00014453469,0.00048232015,0.0016496441,0.16202995,0.061108924,0.32176074,0.00895273,0.43380514],"study_design_scores_gemma":[0.000099714394,0.0003162372,0.00086945546,0.00024172678,0.00014722842,0.00036399422,0.00018149325,0.6276998,0.11002598,0.22741981,0.032511428,0.00012317547],"about_ca_topic_score_codex":0.00146791,"about_ca_topic_score_gemma":0.0020499728,"teacher_disagreement_score":0.0044839038,"about_ca_system_score_codex":0.0014809086,"about_ca_system_score_gemma":0.002130571,"threshold_uncertainty_score":0.01771915},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03912963,0.0007415832,0.9339382,0.0013347885,0.000115328585,0.00022091149,0.0009152938,0.019172624,0.00443166],"genre_scores_gemma":[0.38258594,0.0006535857,0.60537964,0.000695827,0.00010650317,0.00054614997,0.0034605316,0.0043770713,0.0021946984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9715286,0.014379301,0.0014693984,0.0025492306,0.00883462,0.0012389285],"domain_scores_gemma":[0.9547869,0.024149667,0.002404642,0.01337546,0.0046935803,0.00058973883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014409202,0.0018394146,0.0016015262,0.0025503666,0.0011324546,0.005439242,0.005124643,0.0021739865,0.003905951],"category_scores_gemma":[0.06705427,0.0014557095,0.0026524805,0.001953904,0.003369404,0.010674273,0.008009012,0.004902348,0.001593636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062563847,0.0005308272,0.009338469,0.0020106016,0.0003943118,0.00079357845,0.00090854324,0.5501775,0.026292542,0.21913801,0.017610379,0.17217964],"study_design_scores_gemma":[0.000087794564,0.00020304354,0.0004199299,0.00023957573,0.00009014093,0.00019309529,0.00021382282,0.81705815,0.023528444,0.1452655,0.0126473205,0.000053218315],"about_ca_topic_score_codex":0.003993346,"about_ca_topic_score_gemma":0.00771224,"teacher_disagreement_score":0.014409202,"about_ca_system_score_codex":0.0025871142,"about_ca_system_score_gemma":0.0075995806,"threshold_uncertainty_score":0.07620406},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093889646,0.0011007416,0.8435974,0.0010025175,0.0004536521,0.00013609965,0.000248959,0.048879758,0.010691151],"genre_scores_gemma":[0.52047735,0.0004488714,0.4679156,0.0005083799,0.0002441633,0.00014941354,0.0006819887,0.0044934493,0.005080855],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99743724,0.00055560144,0.00016198464,0.00036963943,0.0011378303,0.00033774943],"domain_scores_gemma":[0.9967127,0.0009927192,0.0003094016,0.0012147713,0.0006286855,0.0001417671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023812526,0.0012175553,0.0006127406,0.001082211,0.0005847778,0.0017597267,0.0012115949,0.0006749475,0.0029313092],"category_scores_gemma":[0.0046694265,0.0007803504,0.00083901046,0.00092498946,0.001694346,0.0030867823,0.0024429592,0.0014921892,0.0011039427],"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.0013077001,0.00052154314,0.016613742,0.00073104264,0.00023490378,0.00081364304,0.00095771067,0.14783226,0.13696487,0.063319504,0.026623994,0.6040791],"study_design_scores_gemma":[0.0001993896,0.00042882987,0.0024282404,0.00013840348,0.00016201171,0.0004012908,0.00015202243,0.7877215,0.12241242,0.045353975,0.04045654,0.00014534483],"about_ca_topic_score_codex":0.0030857876,"about_ca_topic_score_gemma":0.0036734059,"teacher_disagreement_score":0.0030857876,"about_ca_system_score_codex":0.0007375611,"about_ca_system_score_gemma":0.0024653652,"threshold_uncertainty_score":0.012593389},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17144914,0.0015398794,0.74054986,0.002563671,0.00047174285,0.00072811556,0.008626737,0.06154938,0.012521429],"genre_scores_gemma":[0.5979533,0.00028716098,0.36916426,0.0011955381,0.00011737662,0.00078807265,0.018353222,0.0017632061,0.010377841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988244,0.00034454328,0.000067761306,0.00042853734,0.00024120645,0.00009350881],"domain_scores_gemma":[0.99783796,0.0012335349,0.000102188664,0.00040714827,0.0003315583,0.000087739245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001488941,0.0012465963,0.00079157186,0.00088718894,0.00048628091,0.0017123333,0.002792395,0.0016733595,0.006795137],"category_scores_gemma":[0.0075612045,0.00060600584,0.0013899747,0.00056055875,0.00081118115,0.0023146493,0.0014976441,0.0032793714,0.003914113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001011251,0.0006452343,0.008323005,0.0006431845,0.00021120907,0.00082124077,0.0006681876,0.5015788,0.024388324,0.017833663,0.06391973,0.3799562],"study_design_scores_gemma":[0.00003782132,0.00005246705,0.00025615565,0.000012127679,0.000011887564,0.0000584446,0.000034399676,0.9881259,0.0035250336,0.0037717996,0.004099104,0.000014834619],"about_ca_topic_score_codex":0.011585485,"about_ca_topic_score_gemma":0.023082355,"teacher_disagreement_score":0.011585485,"about_ca_system_score_codex":0.0014260114,"about_ca_system_score_gemma":0.0015995908,"threshold_uncertainty_score":0.023036063},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16626918,0.0013125193,0.79776907,0.00027911816,0.00020286266,0.000158239,0.00030342146,0.028634697,0.0050708894],"genre_scores_gemma":[0.753605,0.0002360872,0.24158742,0.0001987375,0.00006775943,0.00010209701,0.00043781148,0.0006295067,0.0031355734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951935,0.00005967092,0.000027217451,0.000118597854,0.00019446529,0.00008075308],"domain_scores_gemma":[0.9991166,0.00014661235,0.00016085272,0.0002900971,0.00023223505,0.000053576605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037585292,0.00064042164,0.00045157442,0.0006425217,0.00030193446,0.00071333494,0.002312359,0.0003526939,0.0014698369],"category_scores_gemma":[0.001553255,0.00033284692,0.0003062501,0.00069004117,0.00031910808,0.001110725,0.0007492119,0.00077790656,0.0006270957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016218695,0.00051584555,0.010318589,0.00020332754,0.000110988825,0.00045026976,0.0003405547,0.10554069,0.21050806,0.00612696,0.013860693,0.65040225],"study_design_scores_gemma":[0.00006927051,0.0006930754,0.0019542559,0.000021447504,0.00006632975,0.00018942931,0.000036447822,0.8867256,0.102503255,0.001567428,0.0061062486,0.000067131725],"about_ca_topic_score_codex":0.003731442,"about_ca_topic_score_gemma":0.005894999,"teacher_disagreement_score":0.003731442,"about_ca_system_score_codex":0.00053614506,"about_ca_system_score_gemma":0.001138135,"threshold_uncertainty_score":0.0074194074},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016712459,0.00014229194,0.971208,0.00016055845,0.00005208515,0.00013973087,0.00011598587,0.0047332123,0.0067356895],"genre_scores_gemma":[0.35373217,0.0004607282,0.6340696,0.00038296566,0.000061714076,0.0004375338,0.0005836742,0.0017606989,0.008510831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995641,0.00008655737,0.00003091692,0.000077576355,0.00016330469,0.00007763822],"domain_scores_gemma":[0.9993349,0.00019981785,0.00008542905,0.0002273921,0.00009023468,0.00006231215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008362768,0.00072435517,0.0002991705,0.00034219,0.00031266143,0.0011073754,0.0017968264,0.0004505878,0.0036495866],"category_scores_gemma":[0.0014961362,0.00045355156,0.0007881487,0.000304579,0.0006877341,0.0013020006,0.0015280589,0.0010365606,0.0006303311],"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.0005148614,0.0002896449,0.004295615,0.0007271807,0.00011776164,0.0006276645,0.0007322476,0.41447425,0.054865472,0.13225462,0.018436726,0.37266403],"study_design_scores_gemma":[0.000078047175,0.00020635515,0.00033640277,0.00004775098,0.00004080005,0.00017452297,0.000057145317,0.9008915,0.018176487,0.037410274,0.042550437,0.000030212332],"about_ca_topic_score_codex":0.0018898308,"about_ca_topic_score_gemma":0.003634023,"teacher_disagreement_score":0.0036495866,"about_ca_system_score_codex":0.00052138005,"about_ca_system_score_gemma":0.0017050642,"threshold_uncertainty_score":0.012209117},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30678245,0.0033361984,0.58309495,0.0004663511,0.000826525,0.00084462995,0.0014318983,0.0621507,0.041066278],"genre_scores_gemma":[0.75525564,0.00046219255,0.21977587,0.0006810842,0.00014221265,0.000355134,0.00178347,0.0013163545,0.020227922],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995666,0.00003466157,0.00003135757,0.00010339885,0.00019304226,0.00007094249],"domain_scores_gemma":[0.9996424,0.000054635948,0.00006741867,0.00008696645,0.000104996645,0.00004357653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030607963,0.0005543544,0.00034033638,0.0005711374,0.00024576095,0.00087868853,0.002624944,0.00039063737,0.007528802],"category_scores_gemma":[0.00071550236,0.00033527214,0.00035817688,0.0002516715,0.00029441938,0.00095997,0.0008636836,0.000674851,0.0012247174],"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.0014817275,0.00044767023,0.007068896,0.0010433958,0.00023692696,0.0010369726,0.00041705693,0.054536033,0.3777526,0.025491444,0.043601133,0.4868862],"study_design_scores_gemma":[0.00053616706,0.0016986581,0.0037848835,0.00009612079,0.00018642636,0.0011458247,0.00009380375,0.32036492,0.48485667,0.0029547166,0.18410058,0.00018131049],"about_ca_topic_score_codex":0.001184378,"about_ca_topic_score_gemma":0.0018953038,"teacher_disagreement_score":0.007528802,"about_ca_system_score_codex":0.0006977807,"about_ca_system_score_gemma":0.0007074977,"threshold_uncertainty_score":0.02518636},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.699893,0.0017855089,0.24859624,0.00045343977,0.00043916208,0.00022041312,0.0004370392,0.025739543,0.022435704],"genre_scores_gemma":[0.9517978,0.0001570294,0.044150393,0.00017539124,0.000021552381,0.000042827458,0.00028674665,0.00060388685,0.0027643447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995339,0.000060619346,0.00004141204,0.00009441345,0.00012554729,0.00014406632],"domain_scores_gemma":[0.999321,0.00010760296,0.00006598886,0.00024106023,0.00014134056,0.00012312223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049609767,0.00052910415,0.00028704066,0.00029802066,0.00044480272,0.0009723702,0.001232395,0.00024515623,0.0023234542],"category_scores_gemma":[0.0014539257,0.00020212693,0.00023624458,0.00044066066,0.0005750919,0.0012416673,0.001246625,0.0006786673,0.0005029114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00520243,0.0011056649,0.027366882,0.00091694755,0.00020209415,0.0012934178,0.0007908488,0.19241698,0.2708714,0.03806965,0.031759392,0.4300044],"study_design_scores_gemma":[0.0001999756,0.00062049506,0.008149234,0.000049711114,0.00008654168,0.00075006916,0.00028300105,0.7998534,0.14587009,0.008173022,0.03582047,0.00014402288],"about_ca_topic_score_codex":0.0032162198,"about_ca_topic_score_gemma":0.004291864,"teacher_disagreement_score":0.0032162198,"about_ca_system_score_codex":0.0006094214,"about_ca_system_score_gemma":0.001038305,"threshold_uncertainty_score":0.007772684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22139156,0.0026888591,0.656239,0.0008873942,0.0005214399,0.00043270728,0.0021202073,0.059198312,0.0565205],"genre_scores_gemma":[0.6556373,0.00044463354,0.32580099,0.00045705232,0.000074383745,0.00028934857,0.0025975916,0.00092579616,0.01377295],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99974376,0.00004676498,0.000012479935,0.000033918157,0.00011634904,0.000046737965],"domain_scores_gemma":[0.9997521,0.00006524075,0.000029928497,0.000057125933,0.000064567495,0.00003099229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003183065,0.00079599343,0.00029918534,0.00041798502,0.00026125732,0.0005763631,0.0010381028,0.0003296627,0.014872399],"category_scores_gemma":[0.00074597425,0.00026909533,0.00028813301,0.00039343358,0.00023092689,0.0006814298,0.0006062773,0.00056397764,0.0027185886],"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.0018319522,0.00041659028,0.0076445504,0.0013332058,0.00028839736,0.0014228724,0.00041225922,0.10801868,0.13611291,0.030504366,0.14831993,0.5636943],"study_design_scores_gemma":[0.0007240495,0.0017133005,0.0044151177,0.00015019861,0.00008896021,0.0007989601,0.00017753203,0.7489702,0.1187444,0.009772125,0.11435587,0.00008922087],"about_ca_topic_score_codex":0.0013199641,"about_ca_topic_score_gemma":0.002925445,"teacher_disagreement_score":0.014872399,"about_ca_system_score_codex":0.00044156788,"about_ca_system_score_gemma":0.0005622989,"threshold_uncertainty_score":0.04975313},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8998843,0.0009995423,0.06820373,0.0003251636,0.00008862064,0.000113697344,0.0040264656,0.01559035,0.010768098],"genre_scores_gemma":[0.9569162,0.00017507568,0.0338478,0.00012823576,0.000027081504,0.0001080962,0.006072461,0.0014897841,0.0012352846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9974993,0.00028837126,0.0001552251,0.0003224201,0.0013109935,0.00042376833],"domain_scores_gemma":[0.99246866,0.0031335345,0.0006154709,0.0016040177,0.0020577903,0.00012060895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001284255,0.0009776703,0.0004084323,0.0023707433,0.00043447435,0.00083337165,0.0011394694,0.00045501566,0.0020244103],"category_scores_gemma":[0.00854766,0.0004498464,0.00068002596,0.0021736657,0.0007748182,0.001500247,0.00068961387,0.0008047612,0.00050913054],"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.0017109426,0.00039730748,0.135403,0.0007192234,0.0002515107,0.0006151128,0.00048409528,0.51995397,0.098477416,0.015717248,0.030216856,0.19605337],"study_design_scores_gemma":[0.000031317923,0.00037710363,0.017376272,0.00005035839,0.000068828675,0.00026178153,0.000118359785,0.88355035,0.08729025,0.0038031114,0.007021864,0.00005042947],"about_ca_topic_score_codex":0.007333327,"about_ca_topic_score_gemma":0.0077245845,"teacher_disagreement_score":0.007333327,"about_ca_system_score_codex":0.0011568328,"about_ca_system_score_gemma":0.0016025085,"threshold_uncertainty_score":0.014581323},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6489548,0.0013441762,0.3243039,0.00050313387,0.00016232883,0.00015115034,0.00053520256,0.010527459,0.013517791],"genre_scores_gemma":[0.93009955,0.00014066976,0.06705333,0.00010261757,0.000017451766,0.00006891994,0.00037897512,0.00020551492,0.0019330409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994442,0.00012181184,0.000039208797,0.0000904786,0.0002008309,0.000103384904],"domain_scores_gemma":[0.99849296,0.00032243822,0.00011489337,0.00076356146,0.00020996248,0.00009615222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059338455,0.0005066113,0.00040039973,0.00031268824,0.00050728396,0.00095875113,0.001442015,0.0003793598,0.002697809],"category_scores_gemma":[0.0025009615,0.00031254103,0.00021840027,0.00059399457,0.0005005615,0.0018839802,0.0015989916,0.000679092,0.00044312363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014239877,0.00043023715,0.016941315,0.0006838251,0.00022581534,0.000792928,0.0013001724,0.5237725,0.11597728,0.032727066,0.022011269,0.2837137],"study_design_scores_gemma":[0.00006600918,0.00029119395,0.0030914673,0.000025662963,0.00003653761,0.00020216519,0.00029417136,0.92842484,0.039497696,0.01589647,0.012143779,0.000029999868],"about_ca_topic_score_codex":0.002867524,"about_ca_topic_score_gemma":0.0050916644,"teacher_disagreement_score":0.002867524,"about_ca_system_score_codex":0.00087566255,"about_ca_system_score_gemma":0.0010011856,"threshold_uncertainty_score":0.009025037},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08504849,0.00067680114,0.88849175,0.0014407695,0.0001584258,0.00014370693,0.00024119826,0.0015648992,0.022233967],"genre_scores_gemma":[0.9117855,0.00090800493,0.07302172,0.0003023791,0.00010634019,0.0003871541,0.00025465788,0.0008413722,0.012392944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995316,0.00010359252,0.000011885106,0.000083623636,0.00017808772,0.000091139955],"domain_scores_gemma":[0.9992786,0.00029643322,0.00008892854,0.00010661841,0.0001726674,0.000056744622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051348936,0.00092363503,0.0006629416,0.0006527098,0.00077253894,0.0009524721,0.0027847122,0.0014699209,0.0028640686],"category_scores_gemma":[0.0026342385,0.0004199084,0.0004919654,0.0007122277,0.00091191364,0.0025323394,0.0008495625,0.0015098318,0.0009916864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029232062,0.000038528444,0.00041530206,0.00002491406,0.0000069465686,0.00004433155,0.00005068305,0.9764703,0.0029557936,0.014485578,0.0012833027,0.0041950378],"study_design_scores_gemma":[0.0000019866297,0.000009330156,0.000053635405,0.0000017880566,0.0000014614583,0.000008261064,0.0000055472315,0.9974184,0.00034839855,0.0017601802,0.0003880918,0.0000028908878],"about_ca_topic_score_codex":0.00669081,"about_ca_topic_score_gemma":0.0045155226,"teacher_disagreement_score":0.00669081,"about_ca_system_score_codex":0.0017280147,"about_ca_system_score_gemma":0.0013147853,"threshold_uncertainty_score":0.013303697},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121183395,0.00046987485,0.7163053,0.00070061604,0.000655406,0.00041962907,0.0010396095,0.09450352,0.06472258],"genre_scores_gemma":[0.29339862,0.00019520339,0.6733125,0.00037690188,0.000085345004,0.00032105364,0.002397565,0.012199288,0.017713502],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99895656,0.00013323616,0.000073894975,0.00011255694,0.0005248232,0.00019886048],"domain_scores_gemma":[0.99850583,0.00038765368,0.000082460465,0.00029865358,0.0006495569,0.00007582609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092497235,0.0005438832,0.00032353055,0.00075982226,0.0005286633,0.0014712568,0.0014637518,0.0005206751,0.004673719],"category_scores_gemma":[0.004920213,0.0006055122,0.0005337801,0.0004965362,0.00052755984,0.0013484238,0.0013936238,0.0013652217,0.0029834304],"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.0012220768,0.00054989423,0.011936995,0.00054782274,0.00006906486,0.0021158813,0.0020257067,0.10196299,0.05954499,0.137595,0.11695193,0.5654776],"study_design_scores_gemma":[0.00024876767,0.0002235762,0.0024833626,0.00022963078,0.00003434071,0.0006840472,0.00023319956,0.5407089,0.13827121,0.03870095,0.2780433,0.00013872102],"about_ca_topic_score_codex":0.0022879548,"about_ca_topic_score_gemma":0.0026962534,"teacher_disagreement_score":0.004673719,"about_ca_system_score_codex":0.000755753,"about_ca_system_score_gemma":0.0018289107,"threshold_uncertainty_score":0.015635133},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04066892,0.00048205323,0.5968153,0.00038370155,0.00033144088,0.00015833881,0.001392451,0.34574312,0.014024629],"genre_scores_gemma":[0.32545415,0.0005852345,0.5450793,0.00092797837,0.00012536864,0.00057648425,0.0063767037,0.10500016,0.015874615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993393,0.00010065663,0.000054989105,0.00016034067,0.00022944075,0.000115208095],"domain_scores_gemma":[0.99856573,0.0005313682,0.000088576904,0.0004990552,0.0002384014,0.00007691645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009689009,0.0011753002,0.0004295472,0.00055156974,0.00031532024,0.0012205667,0.0020768226,0.00062918384,0.008724901],"category_scores_gemma":[0.004933278,0.0008681394,0.0012740466,0.0004639361,0.00089652365,0.0026189126,0.0023791976,0.0024196645,0.00392542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023145182,0.0006097047,0.01474207,0.001609058,0.0003383563,0.00095752213,0.0016718317,0.120144494,0.06525236,0.10984148,0.21241497,0.47010368],"study_design_scores_gemma":[0.0003933182,0.00024353049,0.0027474025,0.00016629255,0.00010727422,0.00041755874,0.00016726642,0.6996123,0.10588728,0.058851484,0.13127016,0.00013617429],"about_ca_topic_score_codex":0.002522631,"about_ca_topic_score_gemma":0.0034319027,"teacher_disagreement_score":0.008724901,"about_ca_system_score_codex":0.0008913318,"about_ca_system_score_gemma":0.0018601932,"threshold_uncertainty_score":0.02918768},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7120381,0.005128828,0.06490085,0.008793023,0.0017782667,0.00020728118,0.12912434,0.0037382364,0.07429096],"genre_scores_gemma":[0.9579309,0.0015468345,0.0075102,0.00021295573,0.0002016205,0.00008934075,0.02378115,0.00016977986,0.0085570505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995309,0.00004348051,0.000021869755,0.00010989366,0.00022270037,0.000071098104],"domain_scores_gemma":[0.9949791,0.0011885789,0.00091231416,0.00027403247,0.0020834424,0.00056256127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010313876,0.0007988822,0.00042911049,0.0026141414,0.00029312904,0.0015643344,0.000563439,0.0011363882,0.005034004],"category_scores_gemma":[0.007368849,0.00048821187,0.00053110527,0.0024252408,0.00024537745,0.0021752373,0.0004898457,0.0019171195,0.0024733196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001367921,0.00014701516,0.12329326,0.0005565878,0.00017769387,0.00054667523,0.00015025541,0.6139813,0.009234607,0.04122744,0.122260936,0.08705631],"study_design_scores_gemma":[0.000056504614,0.0003526285,0.1548763,0.00016996589,0.00008191445,0.00021242534,0.0002287193,0.75103164,0.0075163594,0.023034455,0.062326357,0.00011274458],"about_ca_topic_score_codex":0.014056502,"about_ca_topic_score_gemma":0.013209091,"teacher_disagreement_score":0.014056502,"about_ca_system_score_codex":0.0021545764,"about_ca_system_score_gemma":0.0013930723,"threshold_uncertainty_score":0.027949393},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031885605,0.0019937335,0.95463413,0.0005080855,0.0002997935,0.00006863117,0.0003363585,0.004150074,0.0061234934],"genre_scores_gemma":[0.46994388,0.00044748036,0.5219492,0.0003281504,0.00009255205,0.00008005185,0.0005528726,0.00027251037,0.00633332],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995865,0.0000558944,0.000023068165,0.000060939492,0.00022564555,0.00004789239],"domain_scores_gemma":[0.999549,0.00009395553,0.000036318896,0.000080964914,0.00020438121,0.00003537082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032323273,0.00072287355,0.0006704716,0.0004032151,0.0004220822,0.0010094354,0.001340637,0.0003830224,0.0049088933],"category_scores_gemma":[0.0013234762,0.000272581,0.00019037993,0.00062017876,0.00034645404,0.0010847476,0.0008801491,0.00093147525,0.0010608733],"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.0011003893,0.00030355598,0.0013808227,0.00048353386,0.0001092341,0.00013504841,0.00018753247,0.10722111,0.13572742,0.03604191,0.03055435,0.6867551],"study_design_scores_gemma":[0.000055446373,0.00016424082,0.00027155594,0.000029689403,0.000018838464,0.00009233896,0.00003340279,0.9419433,0.042054914,0.009258737,0.006047556,0.00002988319],"about_ca_topic_score_codex":0.0030220165,"about_ca_topic_score_gemma":0.010080437,"teacher_disagreement_score":0.0049088933,"about_ca_system_score_codex":0.00050171703,"about_ca_system_score_gemma":0.0013991273,"threshold_uncertainty_score":0.016421854},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5352632,0.005662978,0.27792862,0.0071960753,0.0009850259,0.000192309,0.00098357,0.0069956225,0.1647926],"genre_scores_gemma":[0.9526207,0.0009268982,0.019969236,0.0013451006,0.00040704684,0.000095156174,0.0004005625,0.00097392855,0.023261398],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99856013,0.0001385467,0.000049445218,0.0003357635,0.00061940384,0.00029678934],"domain_scores_gemma":[0.9966799,0.0011455527,0.00042253762,0.0011374503,0.00048557686,0.00012899912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000741313,0.0007988289,0.0005858735,0.00090048695,0.0015193318,0.0018884409,0.0013011997,0.001273007,0.010495973],"category_scores_gemma":[0.0047773756,0.0005745394,0.00046932508,0.0011426955,0.0022466711,0.004530081,0.002157306,0.0014341446,0.0029629203],"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.0016735884,0.00025661296,0.036131263,0.0009646403,0.0002457084,0.005636072,0.0024249044,0.05076869,0.095323674,0.32615438,0.07368001,0.40674046],"study_design_scores_gemma":[0.0001734881,0.00066906895,0.015607878,0.00027907893,0.00033666298,0.007986223,0.0023303323,0.16071276,0.15000784,0.39703402,0.26463902,0.00022355736],"about_ca_topic_score_codex":0.0011025686,"about_ca_topic_score_gemma":0.0022811713,"teacher_disagreement_score":0.010495973,"about_ca_system_score_codex":0.0006305018,"about_ca_system_score_gemma":0.0007610433,"threshold_uncertainty_score":0.0351125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032344986,0.00034471077,0.876223,0.0004340382,0.0005851162,0.00014309587,0.001037302,0.07669485,0.012192811],"genre_scores_gemma":[0.1352088,0.000120348304,0.84352106,0.00033634336,0.00014545476,0.00018815366,0.003276691,0.005531083,0.011672003],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936944,0.000096932046,0.00004364347,0.00023112047,0.00015569346,0.00010326238],"domain_scores_gemma":[0.9981748,0.0007719488,0.00006470047,0.0005045449,0.00039947854,0.000084534324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010711321,0.001820969,0.0007777857,0.000718233,0.00087144744,0.0015369122,0.0030578936,0.0008652169,0.026331756],"category_scores_gemma":[0.0042039505,0.001317956,0.0014178413,0.0008746106,0.0008749782,0.0025782688,0.00161757,0.0025815978,0.008568828],"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.0010629098,0.00024744595,0.002297239,0.0003654636,0.00026356263,0.00026607627,0.0001901271,0.14050172,0.026235698,0.025071437,0.08467725,0.71882105],"study_design_scores_gemma":[0.00011506364,0.000052527816,0.0003752367,0.000019263514,0.000042520354,0.000040616254,0.000034296743,0.9501633,0.018258428,0.021555549,0.009320609,0.000022508124],"about_ca_topic_score_codex":0.017276643,"about_ca_topic_score_gemma":0.038444348,"teacher_disagreement_score":0.026331756,"about_ca_system_score_codex":0.001332562,"about_ca_system_score_gemma":0.0024343925,"threshold_uncertainty_score":0.08808851},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02744682,0.0015622616,0.8738121,0.00034287715,0.0007566854,0.00014625308,0.0011078622,0.014306162,0.08051903],"genre_scores_gemma":[0.12451194,0.00080956565,0.81014085,0.00022940997,0.00012197381,0.00023610471,0.0023195231,0.0020696004,0.059560936],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996946,0.000034851706,0.000021898466,0.000026633601,0.00017329137,0.000048761187],"domain_scores_gemma":[0.9996076,0.000085908476,0.000017833332,0.000090202164,0.00016166073,0.000036667006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022363738,0.0010517967,0.00059148396,0.00090040936,0.0005197114,0.001403443,0.0017076423,0.00069497846,0.041479427],"category_scores_gemma":[0.0015283055,0.00044944565,0.0005111536,0.002173672,0.00022310301,0.0010896262,0.0011500152,0.0010471835,0.013180897],"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.00066878705,0.00018612645,0.000788012,0.00038271063,0.000092672875,0.00031645116,0.00020965931,0.034362387,0.028374583,0.06726956,0.09441331,0.77293575],"study_design_scores_gemma":[0.00024782403,0.00020101573,0.00089274027,0.00012516264,0.000051798208,0.0005946693,0.00014704185,0.72608805,0.040037524,0.050231498,0.18131955,0.00006307928],"about_ca_topic_score_codex":0.0030776323,"about_ca_topic_score_gemma":0.009132862,"teacher_disagreement_score":0.041479427,"about_ca_system_score_codex":0.000604444,"about_ca_system_score_gemma":0.00092762045,"threshold_uncertainty_score":0.13876253},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08518392,0.005139577,0.82718116,0.0017320096,0.0004724185,0.0002392918,0.0006507343,0.018796934,0.060604014],"genre_scores_gemma":[0.36329806,0.0033144301,0.6015027,0.0005977259,0.0003180956,0.00023263397,0.0016662047,0.0020330579,0.027037017],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985935,0.00021103257,0.00009528489,0.0001836032,0.0006969068,0.00021969566],"domain_scores_gemma":[0.99859184,0.00047883828,0.00014337405,0.00042164183,0.00028534257,0.00007897115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000908375,0.0013163792,0.0007559191,0.001872659,0.0008643537,0.0024906204,0.0028188976,0.00064573606,0.01569301],"category_scores_gemma":[0.0027413107,0.00055813085,0.0007406997,0.0045810994,0.0006738979,0.0041940846,0.0016605866,0.0010775564,0.0062471386],"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.0017883979,0.00021159864,0.0017282726,0.0009243227,0.000075849806,0.00020699878,0.00022408048,0.026266258,0.07302762,0.081562534,0.029678876,0.7843052],"study_design_scores_gemma":[0.0005539429,0.0015020675,0.0031516892,0.00036985727,0.00032845314,0.0014464218,0.0004930496,0.44983932,0.23509051,0.09136855,0.21563804,0.00021814744],"about_ca_topic_score_codex":0.0029102447,"about_ca_topic_score_gemma":0.0057643144,"teacher_disagreement_score":0.01569301,"about_ca_system_score_codex":0.0017880115,"about_ca_system_score_gemma":0.0022718108,"threshold_uncertainty_score":0.05249834},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10451514,0.002325884,0.8328947,0.0013359257,0.00046235285,0.00023572777,0.0005799458,0.0053662085,0.05228417],"genre_scores_gemma":[0.68845206,0.0008057631,0.29474178,0.0008218352,0.00009578996,0.00017045444,0.00045181805,0.00025306267,0.014207484],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998615,0.000015702604,0.0000065988143,0.000032263342,0.000055601166,0.000028400518],"domain_scores_gemma":[0.99983454,0.000029444933,0.000024603476,0.000017177828,0.000074255404,0.00001999436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013689217,0.00038874592,0.00017236419,0.0002127662,0.00020536747,0.0005618939,0.00085150066,0.00033072577,0.004905927],"category_scores_gemma":[0.0003412739,0.00014096856,0.00019450558,0.00024801175,0.00014535594,0.00050920114,0.00023184177,0.0002986894,0.0014443769],"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.0004375497,0.00028963908,0.0049291593,0.0009594667,0.00017660137,0.00078269036,0.00030370275,0.09847506,0.32913533,0.045392808,0.047967672,0.47115025],"study_design_scores_gemma":[0.00010272776,0.0011878692,0.0022991218,0.00014476455,0.00016513043,0.00088615547,0.0001786293,0.72811365,0.13857889,0.014330331,0.11394433,0.00006842805],"about_ca_topic_score_codex":0.0014165147,"about_ca_topic_score_gemma":0.0046077105,"teacher_disagreement_score":0.004905927,"about_ca_system_score_codex":0.00050104223,"about_ca_system_score_gemma":0.000937219,"threshold_uncertainty_score":0.01641202},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66958284,0.04715246,0.18693888,0.002074772,0.00095732405,0.0005335279,0.0013670428,0.0028220355,0.08857118],"genre_scores_gemma":[0.8846849,0.012922424,0.08668796,0.00025490526,0.00013231412,0.00012240896,0.00074300996,0.00012976669,0.014322255],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996239,0.000039375343,0.000027679454,0.0000586182,0.00021392707,0.000036578927],"domain_scores_gemma":[0.9994072,0.00009911332,0.0000911293,0.000052630003,0.0003236689,0.000026274063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039982304,0.0002591558,0.00017617173,0.0009959614,0.00024775648,0.0007654436,0.00052838516,0.00040055398,0.0045970287],"category_scores_gemma":[0.00064905704,0.00015599589,0.00027740924,0.001810934,0.00016597104,0.0010420976,0.00025492572,0.0004562626,0.0015332432],"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.00025270565,0.0001631732,0.006896433,0.0014819214,0.000034051227,0.0008817998,0.00036941998,0.0066755153,0.58515185,0.010184577,0.010240531,0.37766796],"study_design_scores_gemma":[0.00007990201,0.0029653963,0.022200197,0.0002191612,0.00018927375,0.0055009676,0.0007603692,0.027567253,0.60986465,0.005392905,0.32518032,0.000079657926],"about_ca_topic_score_codex":0.0008548623,"about_ca_topic_score_gemma":0.0015050396,"teacher_disagreement_score":0.0045970287,"about_ca_system_score_codex":0.00048160218,"about_ca_system_score_gemma":0.00037107914,"threshold_uncertainty_score":0.015378654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22811748,0.00032631823,0.7560749,0.00069861097,0.00011646208,0.00021747588,0.0017496757,0.00812514,0.004573939],"genre_scores_gemma":[0.4615252,0.00028929027,0.53111213,0.000159322,0.0000479936,0.00024972484,0.0038307868,0.0005110678,0.002274434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941814,0.000070692884,0.00004739773,0.00006890451,0.00032954494,0.00006533623],"domain_scores_gemma":[0.99842405,0.0004580065,0.00016489382,0.00032643593,0.0005652245,0.00006148624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045324725,0.0006498868,0.0005234473,0.0010820574,0.0004641259,0.0008200653,0.0008900902,0.0004122118,0.0027848922],"category_scores_gemma":[0.0042985673,0.0003475722,0.00042244568,0.0016965606,0.0003857625,0.0017802836,0.0010164169,0.00077250507,0.0010298442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000979149,0.0003713467,0.01537234,0.00056497066,0.00010149367,0.0007572085,0.00067945506,0.14078555,0.13008992,0.014996186,0.024929725,0.67037255],"study_design_scores_gemma":[0.00005968437,0.00022710729,0.002620747,0.000026505446,0.000021137466,0.00027760008,0.00024008936,0.92359203,0.053591687,0.01243259,0.0068876855,0.000023105194],"about_ca_topic_score_codex":0.0019600498,"about_ca_topic_score_gemma":0.0031372,"teacher_disagreement_score":0.0027848922,"about_ca_system_score_codex":0.00033783657,"about_ca_system_score_gemma":0.0012237472,"threshold_uncertainty_score":0.009316325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018385302,0.00046822356,0.8741752,0.00016864296,0.000081847174,0.00016094065,0.00016358144,0.1007516,0.005644639],"genre_scores_gemma":[0.38854316,0.0007150776,0.5774035,0.0006603354,0.0001175452,0.00048064828,0.001105599,0.01724876,0.013725374],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988362,0.0002299222,0.00009126026,0.00023409171,0.0004379908,0.00017058608],"domain_scores_gemma":[0.9987709,0.00030713822,0.00012963073,0.00060101144,0.00011016821,0.00008110073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009857293,0.0009302465,0.0007588443,0.0006252391,0.0005754538,0.001352503,0.0030637223,0.00075863244,0.0043974756],"category_scores_gemma":[0.0029584682,0.0008300573,0.00080914306,0.00047650115,0.0011941412,0.0025411195,0.00329284,0.001782557,0.0020697785],"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.0011270782,0.00046835458,0.005183227,0.00085189904,0.00011767081,0.0006742127,0.0011548249,0.04000841,0.1217568,0.10362831,0.04304458,0.68198454],"study_design_scores_gemma":[0.00022262645,0.0005544301,0.0026531047,0.00015732931,0.000119270735,0.00085211033,0.00018100413,0.60127157,0.2007416,0.0438368,0.1491705,0.00023966702],"about_ca_topic_score_codex":0.0016503392,"about_ca_topic_score_gemma":0.0018857833,"teacher_disagreement_score":0.0043974756,"about_ca_system_score_codex":0.00076603505,"about_ca_system_score_gemma":0.0011371748,"threshold_uncertainty_score":0.014711022},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012458189,0.00035655734,0.9133446,0.00024212543,0.00011774059,0.00016674158,0.001466418,0.060148314,0.011699346],"genre_scores_gemma":[0.17083456,0.0008103653,0.79021794,0.00075544725,0.00007707104,0.0011313282,0.006772354,0.016228883,0.01317215],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997079,0.00005523401,0.000029157314,0.00004541732,0.000121425335,0.000040836178],"domain_scores_gemma":[0.999731,0.00009480935,0.000031660355,0.00005523239,0.000058561393,0.000028683222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036549836,0.00066516484,0.0004406718,0.0003885877,0.00035665734,0.0009890227,0.0014832866,0.0005821943,0.0061619915],"category_scores_gemma":[0.0013447187,0.00045838894,0.000797469,0.0005705427,0.0007666942,0.0010522001,0.001163454,0.0014594606,0.0027991454],"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.00078138354,0.00018147357,0.004072036,0.0014179396,0.00017938722,0.0008324339,0.0015235058,0.19573212,0.061830167,0.22169015,0.18466282,0.32709655],"study_design_scores_gemma":[0.00017051633,0.00013026646,0.00057723117,0.000119808225,0.000038821177,0.00033267876,0.00008072838,0.6604059,0.035695054,0.046788644,0.2555834,0.000076977216],"about_ca_topic_score_codex":0.0016683746,"about_ca_topic_score_gemma":0.002498025,"teacher_disagreement_score":0.0061619915,"about_ca_system_score_codex":0.00042832724,"about_ca_system_score_gemma":0.0011742393,"threshold_uncertainty_score":0.020613909},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5678862,0.00028592013,0.4147417,0.00016214266,0.000042557855,0.00013488032,0.0009406238,0.013836181,0.001969779],"genre_scores_gemma":[0.9019145,0.00008813711,0.09584904,0.00006390554,0.000014471961,0.00009875369,0.0008081212,0.00033786453,0.0008252046],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99907887,0.00013018593,0.00007405712,0.00020069012,0.00044533922,0.000070815964],"domain_scores_gemma":[0.9932881,0.002558005,0.0012901094,0.0017304219,0.00097113615,0.00016223881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050378894,0.00061168446,0.00041594458,0.0014682849,0.00028493817,0.0005449163,0.0006053215,0.00052198616,0.00091146707],"category_scores_gemma":[0.0067239953,0.00033209287,0.00026917,0.0010228407,0.00032259268,0.00082651863,0.0005005775,0.00063551916,0.0003990936],"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.0011707662,0.0003772078,0.10669099,0.0005291013,0.00015834816,0.0005722815,0.0007382687,0.047728054,0.38321963,0.0037698213,0.0031783187,0.45186725],"study_design_scores_gemma":[0.00004451387,0.00052830763,0.0549722,0.000048630656,0.000073798314,0.00085702346,0.00015327838,0.57106173,0.35978818,0.006647162,0.005739524,0.00008563335],"about_ca_topic_score_codex":0.00080265815,"about_ca_topic_score_gemma":0.0015401058,"teacher_disagreement_score":0.0014682849,"about_ca_system_score_codex":0.0002760755,"about_ca_system_score_gemma":0.00047964387,"threshold_uncertainty_score":0.0030491948},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31102195,0.0032696298,0.66042775,0.0004341444,0.00031158826,0.00022164243,0.0006848939,0.002867473,0.020760894],"genre_scores_gemma":[0.82954925,0.0017568239,0.1585234,0.00017933304,0.000105801955,0.00020768426,0.0011520175,0.0005605604,0.007964981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924916,0.00008535528,0.000043124597,0.0001122097,0.00037496877,0.00013509615],"domain_scores_gemma":[0.9984627,0.0005703325,0.0002300669,0.00031312116,0.0003663771,0.00005745598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064566865,0.0005166144,0.00035976787,0.00074314105,0.00053645583,0.0014688161,0.00076889974,0.00044876325,0.0031416574],"category_scores_gemma":[0.0032236162,0.00026129818,0.00035615178,0.0013683275,0.0007498661,0.003255586,0.0005003409,0.0006952527,0.0008122757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011945813,0.00025550142,0.02036699,0.0011438129,0.00020056944,0.00049834856,0.0007502249,0.18394104,0.21414632,0.25966087,0.013903681,0.3039381],"study_design_scores_gemma":[0.00008544856,0.00041883116,0.007242746,0.000068330424,0.00012016061,0.000889796,0.00033144077,0.59856105,0.19607908,0.13646786,0.059654817,0.00008035613],"about_ca_topic_score_codex":0.0012992071,"about_ca_topic_score_gemma":0.0014806738,"teacher_disagreement_score":0.0031416574,"about_ca_system_score_codex":0.0006068092,"about_ca_system_score_gemma":0.0008406234,"threshold_uncertainty_score":0.010509908},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010279884,0.020667173,0.3522235,0.011900517,0.01605473,0.00065279886,0.0121965865,0.035823017,0.5402019],"genre_scores_gemma":[0.027250007,0.015351032,0.13943744,0.0010010803,0.0014896932,0.00027746274,0.022813404,0.0050997743,0.7872801],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910897,0.00009261189,0.000028097857,0.00013166471,0.00046756404,0.0001710571],"domain_scores_gemma":[0.9988042,0.0001323824,0.000014146356,0.00017679516,0.000686854,0.00018556106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012992438,0.0019365473,0.0019022994,0.0011862828,0.002256285,0.0042177625,0.0024470831,0.0009866467,0.11531128],"category_scores_gemma":[0.0018952407,0.0007444751,0.0009281806,0.0025486748,0.0012173958,0.002141598,0.0019108952,0.002191248,0.059903573],"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.00015523193,0.00007503742,0.00026170778,0.00017878982,0.000021803171,0.00006501562,0.0001520307,0.0017585796,0.0015407782,0.013054131,0.79161876,0.19111823],"study_design_scores_gemma":[0.000054948032,0.00006118134,0.0012028721,0.00013534042,0.000038172697,0.00018104314,0.00017451994,0.014491825,0.0027251337,0.014715056,0.9661891,0.000030818937],"about_ca_topic_score_codex":0.16044797,"about_ca_topic_score_gemma":0.2771538,"teacher_disagreement_score":0.16044797,"about_ca_system_score_codex":0.0041986997,"about_ca_system_score_gemma":0.010880697,"threshold_uncertainty_score":0.38575464},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032401541,0.07874256,0.19199003,0.0045340345,0.0041914396,0.00020079612,0.0004755066,0.005771474,0.71085405],"genre_scores_gemma":[0.02462657,0.054197647,0.18100405,0.004674573,0.0022236211,0.0004971146,0.0007827978,0.0038273328,0.7281662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991955,0.00009320917,0.000031451567,0.00016196127,0.00044669778,0.00007116466],"domain_scores_gemma":[0.99927014,0.0003407557,0.000048204307,0.00010417116,0.00017697665,0.000059621125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043007857,0.0013674,0.000717907,0.0014565324,0.0014440626,0.004823371,0.0014903523,0.0012994658,0.021795228],"category_scores_gemma":[0.0021285638,0.0007384556,0.000607071,0.0034463052,0.001998345,0.00542384,0.0015005313,0.0033127186,0.011478776],"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.00004027962,0.000032880947,0.000117918964,0.00076199695,0.000015444093,0.00019576887,0.00085075304,0.0023076,0.0024131099,0.4197464,0.22887395,0.34464395],"study_design_scores_gemma":[0.0000058021774,0.000024676696,0.00014292615,0.00022929866,0.000007343416,0.00038542284,0.00006427207,0.0012958643,0.000520797,0.035996996,0.96130955,0.000017114873],"about_ca_topic_score_codex":0.0028920718,"about_ca_topic_score_gemma":0.003157396,"teacher_disagreement_score":0.021795228,"about_ca_system_score_codex":0.0011329569,"about_ca_system_score_gemma":0.0019315933,"threshold_uncertainty_score":0.072912335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030970667,0.00045148472,0.9938114,0.000059358008,0.00023811594,0.000031246855,0.000029502502,0.0005349578,0.004534217],"genre_scores_gemma":[0.020611435,0.0009165308,0.96032476,0.00026203122,0.00026541014,0.00039739144,0.00016173556,0.0011009156,0.01595972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863166,0.0005431909,0.00004547993,0.000122061414,0.00059666194,0.000060932336],"domain_scores_gemma":[0.9984273,0.00076706405,0.00006629756,0.00029787378,0.0003930929,0.0000484047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014332858,0.0011044719,0.0015216989,0.00093134923,0.00073715486,0.0012009203,0.0017732024,0.0014537382,0.009495763],"category_scores_gemma":[0.005842503,0.00092136295,0.0009214024,0.0015960946,0.0013514137,0.0011101913,0.0011469038,0.0032503742,0.0042023556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007855643,0.000094498406,0.00034823405,0.0004112496,0.00016482027,0.000110649606,0.00014000913,0.24800971,0.0033319306,0.49920994,0.027459273,0.22064115],"study_design_scores_gemma":[0.000049187194,0.000022596103,0.00014408017,0.000077841214,0.000039528335,0.000120969504,0.000013029805,0.7347894,0.003147964,0.19748683,0.06407581,0.00003287729],"about_ca_topic_score_codex":0.0016726785,"about_ca_topic_score_gemma":0.0020400651,"teacher_disagreement_score":0.009495763,"about_ca_system_score_codex":0.0007011303,"about_ca_system_score_gemma":0.0012190529,"threshold_uncertainty_score":0.031766474},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010177294,0.0012599608,0.75463974,0.00049351837,0.00045333378,0.00019183247,0.0016321641,0.21350165,0.017650468],"genre_scores_gemma":[0.14579313,0.001370931,0.7615846,0.0010280969,0.00023686243,0.0007354775,0.008036283,0.059706885,0.021507757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986131,0.00023624107,0.00012483292,0.000275845,0.0005525891,0.00019724717],"domain_scores_gemma":[0.99853396,0.0004597596,0.00017819813,0.0002942564,0.0003925486,0.000141295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009742438,0.0011352602,0.0006533674,0.0007458225,0.0004495845,0.0016558454,0.0027173518,0.0008813572,0.014278592],"category_scores_gemma":[0.0050670705,0.0007456278,0.0009960396,0.0005510962,0.0007443172,0.0019727752,0.0017878695,0.0018013426,0.0074420758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015920268,0.00028346447,0.0050147884,0.0015569002,0.00029983162,0.00087956554,0.0009323801,0.06798587,0.048946004,0.10062697,0.2686399,0.5032422],"study_design_scores_gemma":[0.0002766023,0.00025231673,0.0016771269,0.0003234478,0.00009543007,0.00081058335,0.00007454895,0.41667154,0.08347578,0.02992165,0.4662002,0.00022068585],"about_ca_topic_score_codex":0.002239604,"about_ca_topic_score_gemma":0.0019435671,"teacher_disagreement_score":0.014278592,"about_ca_system_score_codex":0.00081384415,"about_ca_system_score_gemma":0.0019112935,"threshold_uncertainty_score":0.047766626},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010628233,0.0022018251,0.97437006,0.001112734,0.00056316186,0.000049370843,0.000038952516,0.0017003809,0.00933532],"genre_scores_gemma":[0.28551868,0.002259212,0.69968283,0.00064020895,0.00026414287,0.00010981331,0.00009035357,0.0006921091,0.010742653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987919,0.000299836,0.00010939566,0.0001617147,0.0005054626,0.00013170177],"domain_scores_gemma":[0.9989391,0.00025585422,0.00007073708,0.00045088076,0.00020942702,0.000073939635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015718596,0.00032097352,0.0005051466,0.00033647803,0.000594438,0.0018835956,0.00093150197,0.0005680288,0.0020285444],"category_scores_gemma":[0.0014954068,0.00045767834,0.0005679492,0.00035234957,0.0018471974,0.002181836,0.0008558974,0.0027018944,0.0005945264],"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.00020481124,0.00009378962,0.0002920982,0.00022310487,0.000026337399,0.00008954454,0.0005569027,0.038696114,0.02177353,0.8117429,0.005588636,0.12071231],"study_design_scores_gemma":[0.00013591947,0.0002210114,0.0003538778,0.00009715375,0.00003880882,0.00032609634,0.00010135976,0.2122165,0.025566697,0.4667103,0.2941133,0.00011902041],"about_ca_topic_score_codex":0.0009005368,"about_ca_topic_score_gemma":0.0015764545,"teacher_disagreement_score":0.0020285444,"about_ca_system_score_codex":0.00084278284,"about_ca_system_score_gemma":0.0006874085,"threshold_uncertainty_score":0.008312881},"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":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019293093,0.0011388744,0.8418098,0.00024154929,0.00021829718,0.00017664998,0.0012292977,0.13204433,0.02121182],"genre_scores_gemma":[0.046236847,0.0034478263,0.74215406,0.00073347543,0.00054442376,0.00096763973,0.007979847,0.046044927,0.15189095],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990783,0.00011337288,0.000068403475,0.00012510351,0.0005338281,0.0000810748],"domain_scores_gemma":[0.9985146,0.00063351996,0.00015301131,0.00031280582,0.00028840912,0.00009775489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012283846,0.0013851508,0.000964385,0.0017277513,0.0009348352,0.00370921,0.0036297352,0.0015767629,0.026208766],"category_scores_gemma":[0.0034724195,0.0015562181,0.0011280092,0.0018962484,0.00097481115,0.005463556,0.0023016527,0.0023045081,0.024845304],"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.0005101204,0.00016813197,0.0005226909,0.0016997771,0.00009942185,0.00023282827,0.0005820957,0.009756937,0.020897565,0.10753464,0.19741407,0.6605817],"study_design_scores_gemma":[0.00016766762,0.000102104095,0.00037217635,0.00017732705,0.00007866514,0.00045302825,0.00005772359,0.03542777,0.02672089,0.055584557,0.88073915,0.00011888134],"about_ca_topic_score_codex":0.0010247129,"about_ca_topic_score_gemma":0.0010935924,"teacher_disagreement_score":0.026208766,"about_ca_system_score_codex":0.0008366937,"about_ca_system_score_gemma":0.0016695093,"threshold_uncertainty_score":0.087677},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38146886,0.0056018,0.4129418,0.012949663,0.0004187246,0.00030385106,0.009771478,0.0012551063,0.17528883],"genre_scores_gemma":[0.89239305,0.0021173784,0.02290187,0.00016335162,0.00013375774,0.000232816,0.0014780365,0.00007970261,0.08050006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958163,0.000099599216,0.000014114443,0.00009303138,0.00009885551,0.000112728056],"domain_scores_gemma":[0.99928087,0.00035436987,0.00007624205,0.000030307621,0.00017250451,0.00008573842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088791107,0.0008604189,0.0009186915,0.0011460285,0.0009970627,0.0031172615,0.002095541,0.002799059,0.011492613],"category_scores_gemma":[0.0028913897,0.00072841474,0.0008482986,0.0014878709,0.001207429,0.0023440833,0.00076326064,0.0014053414,0.00071180565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005972692,0.000024179268,0.0016246698,0.000039334427,0.000019533518,0.0001156338,0.00006936113,0.8634225,0.00032162527,0.12769502,0.0018180712,0.0047903955],"study_design_scores_gemma":[0.000046517758,0.000015711254,0.00071898854,0.00001500125,0.0000157008,0.000043556258,0.000029124703,0.97943497,0.00010042499,0.015168453,0.004393826,0.000017803863],"about_ca_topic_score_codex":0.5023699,"about_ca_topic_score_gemma":0.25220448,"teacher_disagreement_score":0.5023699,"about_ca_system_score_codex":0.010190232,"about_ca_system_score_gemma":0.006520525,"threshold_uncertainty_score":0.99889153},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31760806,0.09124524,0.28167278,0.03342586,0.001941845,0.000106574495,0.0009419577,0.0015860188,0.27147165],"genre_scores_gemma":[0.9732593,0.009034586,0.008827511,0.0003789931,0.00070533797,0.000050980518,0.000091559596,0.00016918492,0.007482529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994041,0.00014683926,0.000022406046,0.00014347727,0.00020852282,0.00007467578],"domain_scores_gemma":[0.9989467,0.00057650707,0.00014084799,0.0001424827,0.0001348383,0.000058642432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005976768,0.00041501425,0.00055553264,0.0010378294,0.00054553704,0.0021258905,0.00040759466,0.000834914,0.0029816364],"category_scores_gemma":[0.0045730937,0.00020531911,0.00024498542,0.0010353739,0.0020345778,0.0021253494,0.0010322876,0.0014501564,0.0005119579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063145635,0.000030667667,0.0025918784,0.00018363298,0.00004730851,0.00010771572,0.0004983828,0.0664121,0.004315925,0.8693273,0.0058967145,0.050525244],"study_design_scores_gemma":[0.000014312239,0.00005639074,0.0052255904,0.000082738574,0.0000141582905,0.00013942835,0.0001668357,0.12772438,0.0017635912,0.8370982,0.027668169,0.000046235025],"about_ca_topic_score_codex":0.0012606472,"about_ca_topic_score_gemma":0.00060277793,"teacher_disagreement_score":0.0029816364,"about_ca_system_score_codex":0.0014325087,"about_ca_system_score_gemma":0.00050386816,"threshold_uncertainty_score":0.01039362},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8798038,0.0005809193,0.10962444,0.0002664686,0.00003934676,0.0000853192,0.0018198243,0.0013375118,0.00644237],"genre_scores_gemma":[0.84485096,0.000522113,0.15121715,0.0000704497,0.000008059574,0.000041293417,0.0016898643,0.00030265903,0.0012974049],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998889,0.000010236661,0.000003998456,0.000025781223,0.000051018935,0.000019958028],"domain_scores_gemma":[0.9999095,0.000023001598,0.000015158364,0.00001826724,0.000026266269,0.000007900189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023539872,0.00047669263,0.0003127661,0.00030980076,0.00029423024,0.00047539346,0.00033026322,0.00038063966,0.0013012041],"category_scores_gemma":[0.00047668646,0.0002796473,0.00025778363,0.00037082803,0.00019961718,0.0004636859,0.00023216207,0.00055178953,0.00024129974],"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.00017193794,0.000045588567,0.0010625944,0.00016714884,0.00002639838,0.00013106283,0.00009858218,0.042275764,0.9377991,0.0015689518,0.00087481854,0.015778076],"study_design_scores_gemma":[0.000041870684,0.000121515324,0.0033289916,0.000010405057,0.000028684713,0.00010824115,0.00011750789,0.17754169,0.80981576,0.001628208,0.0072094114,0.00004771505],"about_ca_topic_score_codex":0.0037721023,"about_ca_topic_score_gemma":0.011087819,"teacher_disagreement_score":0.0037721023,"about_ca_system_score_codex":0.00039346435,"about_ca_system_score_gemma":0.00041528867,"threshold_uncertainty_score":0.007500291},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030527235,0.00021679963,0.01696726,0.00029059732,0.00052931823,0.000118379765,0.041592572,0.9218055,0.018174384],"genre_scores_gemma":[0.003146352,0.00022395661,0.0134101035,0.0008507648,0.000105266474,0.00036521754,0.089020155,0.8609072,0.031970963],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963988,0.00039925275,0.00028714197,0.0008849894,0.0014756725,0.0005540578],"domain_scores_gemma":[0.99312687,0.0008792798,0.00021822476,0.0024911738,0.0026233802,0.0006610841],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0038495006,0.006087788,0.0027484794,0.0026368657,0.002210039,0.007575366,0.012003832,0.004150633,0.59614676],"category_scores_gemma":[0.022107763,0.006416172,0.0041432185,0.0025266863,0.001213492,0.010749387,0.010158542,0.0075067184,0.7574443],"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.00019817712,0.000027647851,0.00026304903,0.00035005767,0.0000334406,0.000030265395,0.000073309035,0.0002070692,0.00093239016,0.0010024563,0.98629576,0.010586353],"study_design_scores_gemma":[0.00017620623,0.000031138843,0.0005905793,0.00014789158,0.0000329695,0.00010221217,0.000049281753,0.0009960564,0.006994324,0.0026709884,0.9880761,0.00013228551],"about_ca_topic_score_codex":0.010953479,"about_ca_topic_score_gemma":0.008616929,"teacher_disagreement_score":0.59614676,"about_ca_system_score_codex":0.0026550437,"about_ca_system_score_gemma":0.0031669857,"threshold_uncertainty_score":0.5760476},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35608423,0.00092362886,0.365463,0.00064287835,0.0004689684,0.0006742649,0.003529459,0.22887968,0.043333866],"genre_scores_gemma":[0.5413612,0.00029272263,0.4101879,0.00030297585,0.00009975917,0.0004555239,0.005913225,0.019887337,0.0214994],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903154,0.00014661791,0.00005041712,0.00029083635,0.0003083376,0.00017232567],"domain_scores_gemma":[0.9978521,0.0008483674,0.00015962301,0.0005906506,0.00036051145,0.0001887156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014715553,0.000776489,0.00038260783,0.00056834915,0.00072533434,0.0011198043,0.0022192167,0.00049490976,0.008093312],"category_scores_gemma":[0.0038315114,0.0005534326,0.0005665721,0.0006222836,0.00077016326,0.0018051448,0.0021796767,0.0019095704,0.0020999108],"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.0062982626,0.0010573165,0.021089965,0.002616714,0.00036349485,0.001773836,0.0031900909,0.091089174,0.17393689,0.061756305,0.113855466,0.5229724],"study_design_scores_gemma":[0.0010345536,0.0015886191,0.02339366,0.00040861452,0.00016623849,0.0007902539,0.000600542,0.4926932,0.22405684,0.026079932,0.22885033,0.00033735042],"about_ca_topic_score_codex":0.0031892783,"about_ca_topic_score_gemma":0.005114678,"teacher_disagreement_score":0.008093312,"about_ca_system_score_codex":0.000817812,"about_ca_system_score_gemma":0.0015978295,"threshold_uncertainty_score":0.027074873},"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":"software","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016353402,0.0020141704,0.320358,0.019635754,0.05091737,0.0006037016,0.073883966,0.38113156,0.13510212],"genre_scores_gemma":[0.122224055,0.0018819415,0.20544975,0.021155044,0.0048523434,0.0010411465,0.14149068,0.22775963,0.27414542],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9934197,0.0010096764,0.000427964,0.000821047,0.0038946318,0.00042695506],"domain_scores_gemma":[0.9800811,0.0038525225,0.0006450537,0.008911119,0.0058910972,0.0006191815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004556209,0.0016058979,0.0012426529,0.0010302062,0.001361977,0.0039429623,0.0031402523,0.0017761084,0.12073313],"category_scores_gemma":[0.019668542,0.0011508513,0.001682132,0.0023363493,0.0013572753,0.0038290317,0.0031252482,0.005763448,0.074938476],"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.0008074352,0.00012703931,0.0005925165,0.00048821955,0.00007382494,0.00014137391,0.000092058355,0.0027735916,0.011247914,0.012806551,0.9185527,0.052296773],"study_design_scores_gemma":[0.0003588602,0.00020830688,0.0015527301,0.00020694065,0.00008893916,0.00043222288,0.000061160696,0.0126747005,0.0832278,0.012360204,0.8887101,0.00011817217],"about_ca_topic_score_codex":0.00406865,"about_ca_topic_score_gemma":0.0031822808,"teacher_disagreement_score":0.12073313,"about_ca_system_score_codex":0.002029646,"about_ca_system_score_gemma":0.0029266025,"threshold_uncertainty_score":0.40389252},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09489622,0.0002123914,0.89405686,0.00012844369,0.000087257664,0.00009008763,0.00005514241,0.0014596814,0.009013951],"genre_scores_gemma":[0.5743964,0.00015596238,0.4226563,0.00005755225,0.000022676155,0.00009969206,0.00014748854,0.00022010994,0.0022438704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995783,0.00010000014,0.00003365817,0.000050115334,0.00016660675,0.00007134879],"domain_scores_gemma":[0.9994012,0.00020417257,0.0000640139,0.00011999081,0.00015432815,0.000056379635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076210324,0.000603773,0.0004334048,0.0007077971,0.00038256333,0.00095308444,0.0007203567,0.00034613794,0.0020431157],"category_scores_gemma":[0.0017556262,0.000248697,0.0003768013,0.0006510631,0.0006069775,0.0008802711,0.00070606906,0.000553199,0.00031560296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038744754,0.00019694521,0.002803226,0.0001992411,0.00007092882,0.00030517846,0.00030679334,0.48751602,0.04836282,0.18371719,0.0037093882,0.27242488],"study_design_scores_gemma":[0.0000555835,0.00008555511,0.00025706305,0.000011046926,0.000013201659,0.000038820785,0.000036368412,0.9601387,0.010684664,0.025266465,0.0033946147,0.00001786239],"about_ca_topic_score_codex":0.0033101123,"about_ca_topic_score_gemma":0.004799907,"teacher_disagreement_score":0.0033101123,"about_ca_system_score_codex":0.0006683742,"about_ca_system_score_gemma":0.0016326699,"threshold_uncertainty_score":0.006834924},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066515826,0.0034568068,0.9122265,0.0004750565,0.0001962974,0.00034780565,0.00041909417,0.008891735,0.0074708704],"genre_scores_gemma":[0.506154,0.0015879088,0.48220587,0.00041045021,0.00028147455,0.00038751785,0.0010801051,0.0004977361,0.0073949522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999524,0.000044371114,0.000026263555,0.000050405808,0.00030384507,0.000051185376],"domain_scores_gemma":[0.9993229,0.00014422383,0.00005710566,0.00019392894,0.00024404396,0.000037866324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024423163,0.00069295266,0.00045395817,0.0010847336,0.00033493285,0.0009058736,0.0017076293,0.00051171106,0.0023212503],"category_scores_gemma":[0.0013113805,0.00023540501,0.00034979222,0.0012775662,0.0006422244,0.002020848,0.0010915108,0.0007858149,0.0008608621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078276446,0.00027078277,0.0018143582,0.00035087907,0.000080915655,0.0007677591,0.00024314004,0.05294449,0.14134984,0.024616422,0.01484349,0.76193523],"study_design_scores_gemma":[0.00021340697,0.0010208368,0.0014555652,0.000072336996,0.0001136332,0.0021670924,0.00017399357,0.7481067,0.19050479,0.021710617,0.03435236,0.00010872893],"about_ca_topic_score_codex":0.001820923,"about_ca_topic_score_gemma":0.0019841064,"teacher_disagreement_score":0.0023212503,"about_ca_system_score_codex":0.00044797233,"about_ca_system_score_gemma":0.00094819337,"threshold_uncertainty_score":0.0077653527},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9577543,0.00821426,0.005799258,0.010090078,0.0003006354,0.00015339586,0.0045359177,0.00005024946,0.013101914],"genre_scores_gemma":[0.9675539,0.011287421,0.0067533385,0.00090408535,0.00030069574,0.00015212309,0.004140243,0.00004244946,0.008865835],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99954104,0.00014397658,0.000025829708,0.000066462155,0.00013614552,0.00008653507],"domain_scores_gemma":[0.99838984,0.0005154151,0.00032238034,0.00017740247,0.0003197535,0.00027509537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001557413,0.00019622082,0.00040224666,0.000980097,0.0005898142,0.0014716598,0.00033711604,0.0004292381,0.004567423],"category_scores_gemma":[0.00822886,0.00016238067,0.0007633312,0.0011464183,0.00028294115,0.0006377696,0.0012453473,0.0011648119,0.0007168446],"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.00022747437,0.00016795476,0.864723,0.00019318263,0.00025443363,0.000081684855,0.0017275088,0.00153375,0.0003604689,0.0023705952,0.009082351,0.119277634],"study_design_scores_gemma":[0.000014302454,0.0002624954,0.978288,0.00038166821,0.00012256093,0.00018835154,0.002000692,0.0026915248,0.00025266266,0.004646136,0.011128735,0.00002293178],"about_ca_topic_score_codex":0.018500155,"about_ca_topic_score_gemma":0.03208694,"teacher_disagreement_score":0.018500155,"about_ca_system_score_codex":0.0006500045,"about_ca_system_score_gemma":0.0019710907,"threshold_uncertainty_score":0.036784947},"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":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016353402,0.0020141704,0.320358,0.019635754,0.05091737,0.0006037016,0.073883966,0.38113156,0.13510212],"genre_scores_gemma":[0.122224055,0.0018819415,0.20544975,0.021155044,0.0048523434,0.0010411465,0.14149068,0.22775963,0.27414542],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934197,0.0010096764,0.000427964,0.000821047,0.0038946318,0.00042695506],"domain_scores_gemma":[0.9800811,0.0038525225,0.0006450537,0.008911119,0.0058910972,0.0006191815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004556209,0.0016058979,0.0012426529,0.0010302062,0.001361977,0.0039429623,0.0031402523,0.0017761084,0.12073313],"category_scores_gemma":[0.019668542,0.0011508513,0.001682132,0.0023363493,0.0013572753,0.0038290317,0.0031252482,0.005763448,0.074938476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008074352,0.00012703931,0.0005925165,0.00048821955,0.00007382494,0.00014137391,0.000092058355,0.0027735916,0.011247914,0.012806551,0.9185527,0.052296773],"study_design_scores_gemma":[0.0003588602,0.00020830688,0.0015527301,0.00020694065,0.00008893916,0.00043222288,0.000061160696,0.0126747005,0.0832278,0.012360204,0.8887101,0.00011817217],"about_ca_topic_score_codex":0.00406865,"about_ca_topic_score_gemma":0.0031822808,"teacher_disagreement_score":0.12073313,"about_ca_system_score_codex":0.002029646,"about_ca_system_score_gemma":0.0029266025,"threshold_uncertainty_score":0.40389252},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006385338,0.00003864001,0.00006220854,0.00004494699,0.000014050999,0.0000075525404,0.9984242,0.00062397483,0.00072061655],"genre_scores_gemma":[0.0001763821,0.000032320197,0.00023417229,0.000043670207,0.0000029970147,0.000042899454,0.99895895,0.00013419428,0.00037447613],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989235,0.00014535218,0.00013583736,0.00037028204,0.00025515116,0.00016976772],"domain_scores_gemma":[0.9978873,0.000549072,0.0001857629,0.0005972461,0.0005327274,0.0002478624],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009781421,0.0023364483,0.0016818485,0.0046615615,0.0010526077,0.0025120883,0.0032605273,0.002338285,0.1105918],"category_scores_gemma":[0.0055655343,0.0009008616,0.0013336411,0.00918341,0.0004894387,0.002185098,0.0025682077,0.0022331933,0.18007407],"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.000033810014,0.000015237552,0.00037441772,0.00050987984,0.000016472673,0.000017789309,0.000021375427,0.00017249366,0.00012284542,0.00038332547,0.9968727,0.0014596444],"study_design_scores_gemma":[0.00010059607,0.000009918152,0.0019026595,0.00018067312,0.000015740467,0.000050392748,0.00007960378,0.00028208806,0.00025139033,0.00092367415,0.99618405,0.000019154328],"about_ca_topic_score_codex":0.022308188,"about_ca_topic_score_gemma":0.03779531,"teacher_disagreement_score":0.88940823,"about_ca_system_score_codex":0.0017498719,"about_ca_system_score_gemma":0.0023639717,"threshold_uncertainty_score":0.36996645},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015731767,0.00040871327,0.0012236697,0.010544785,0.017294846,0.00033423325,0.006174789,0.0041735093,0.95827234],"genre_scores_gemma":[0.0031171371,0.00018145861,0.0003637022,0.0007280751,0.0005556675,0.00007209759,0.0010968305,0.00085870887,0.9930264],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993506,0.000048523496,0.000015249388,0.000075657255,0.00031553756,0.00019441263],"domain_scores_gemma":[0.99672985,0.00012867016,0.000048628215,0.00013555936,0.0011507149,0.0018065604],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010365759,0.0010065986,0.0005980554,0.0009071027,0.0059689283,0.006692398,0.0011257607,0.0019131884,0.7832294],"category_scores_gemma":[0.002542805,0.00052420696,0.00064759015,0.0011046302,0.00055802555,0.00158455,0.0029082652,0.0037620917,0.5910711],"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.000024958488,0.00001295211,0.000051637177,0.000012882139,4.942327e-7,0.000017375613,0.000038800543,0.000013774188,0.000060243274,0.00038744893,0.9939394,0.005440046],"study_design_scores_gemma":[0.0000069917587,0.000006427929,0.00025436547,0.0000150158585,7.933146e-7,0.000012399757,0.00013450652,0.000026686079,0.00008531901,0.00019997693,0.99925333,0.00000421911],"about_ca_topic_score_codex":0.042912398,"about_ca_topic_score_gemma":0.20491475,"teacher_disagreement_score":0.7832294,"about_ca_system_score_codex":0.0029986382,"about_ca_system_score_gemma":0.003690324,"threshold_uncertainty_score":0.3091969},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9996196,0.00004552927,0.000023352924,0.0000054929064,0.0000013685907,0.0000011501456,0.00016925631,0.0000015231243,0.0001327382],"genre_scores_gemma":[0.9994466,0.000037697544,0.000037319598,0.000004999649,9.111829e-7,0.0000020042937,0.00021819654,9.545282e-7,0.00025129868],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99991906,0.000014315248,0.0000052358782,0.00002459699,0.000014673884,0.000022162672],"domain_scores_gemma":[0.99924517,0.00016187978,0.00022086642,0.00003773127,0.00015184272,0.00018253649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027005732,0.00023482261,0.0001377765,0.00030203207,0.00019036104,0.00032665028,0.00020450183,0.00015849984,0.0007199531],"category_scores_gemma":[0.00096207595,0.00014863808,0.0002212539,0.0002156301,0.00023238065,0.00013638847,0.00019250078,0.00017051569,0.00017079768],"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.00019505277,0.000018988978,0.9941339,0.000009384711,0.000035802776,0.00006716748,0.00008996474,0.00057529483,0.0035439087,0.000015013883,0.00009291547,0.0012225908],"study_design_scores_gemma":[8.244217e-7,0.000019638981,0.9994923,0.0000011761574,0.0000048877173,0.000009889066,0.000029685834,0.0003221877,0.00008605788,0.000002782381,0.000029629155,9.128615e-7],"about_ca_topic_score_codex":0.26037636,"about_ca_topic_score_gemma":0.53355443,"teacher_disagreement_score":0.73962367,"about_ca_system_score_codex":0.0014511794,"about_ca_system_score_gemma":0.0005191044,"threshold_uncertainty_score":0.51772165},"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":"protocol","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"protocol","genre_consensus":"protocol","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013131511,0.0074264933,0.0016085113,0.001444283,0.00030830636,0.9676917,0.01599268,0.00007161673,0.0041432064],"genre_scores_gemma":[0.003048466,0.009285206,0.008421589,0.00071804656,0.000049762275,0.9736815,0.00310226,0.000015765396,0.0016774193],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.9686989,0.008974127,0.011089126,0.0024996318,0.0063581914,0.0023800177],"domain_scores_gemma":[0.9399806,0.012883303,0.006518274,0.0035762799,0.033543393,0.0034980976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.07272869,0.0027461369,0.0067910096,0.0219809,0.010484658,0.008826298,0.0047889743,0.0056904675,0.03436841],"category_scores_gemma":[0.074091695,0.0032791735,0.008443475,0.025070911,0.004962429,0.0037891297,0.00706224,0.004470069,0.0048203343],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","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.0027572042,0.0005128837,0.00462487,0.71653396,0.0014261267,0.0012373376,0.0123088695,0.0034616285,0.0015356444,0.013595633,0.1036334,0.13837247],"study_design_scores_gemma":[0.0041245623,0.0006764501,0.014296306,0.6244027,0.0035562157,0.0003592447,0.008045149,0.00065000984,0.0010429432,0.0051548528,0.33731166,0.0003798651],"about_ca_topic_score_codex":0.43293348,"about_ca_topic_score_gemma":0.71864367,"teacher_disagreement_score":0.56706655,"about_ca_system_score_codex":0.071044095,"about_ca_system_score_gemma":0.39972895,"threshold_uncertainty_score":0.8608271},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003667051,0.0014388054,0.8241814,0.00090660324,0.0009890255,0.00008465583,0.0027668485,0.0064642564,0.15950145],"genre_scores_gemma":[0.17940699,0.0044587245,0.27278543,0.00087090663,0.0012952719,0.0003109963,0.010732571,0.0042039515,0.52593523],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99961096,0.000048252765,0.0000110330875,0.00008823536,0.00019689671,0.000044663426],"domain_scores_gemma":[0.9997371,0.000027590446,0.000021454085,0.000093643444,0.00009710096,0.000023055914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038572497,0.0013593471,0.00066382985,0.000981184,0.00055567775,0.001920493,0.0011991377,0.001174538,0.06222014],"category_scores_gemma":[0.0012722301,0.00026861855,0.00051389646,0.0015593286,0.00044063758,0.0012685288,0.0014038527,0.0011761418,0.075984],"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.00015536904,0.00007085844,0.0004998065,0.00025093628,0.00004318382,0.00011514817,0.00007611395,0.023304049,0.0277929,0.20552573,0.14065173,0.60151416],"study_design_scores_gemma":[0.00006558954,0.00009178038,0.00154538,0.00013743143,0.00004543484,0.0005358981,0.00006764493,0.16283274,0.057070028,0.1067394,0.6707642,0.00010442478],"about_ca_topic_score_codex":0.00086782227,"about_ca_topic_score_gemma":0.0010647587,"teacher_disagreement_score":0.06222014,"about_ca_system_score_codex":0.0005134404,"about_ca_system_score_gemma":0.0008233477,"threshold_uncertainty_score":0.20814711},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042575333,0.00846689,0.84362227,0.0023540263,0.00095755135,0.0018538459,0.018560715,0.0035913978,0.0780179],"genre_scores_gemma":[0.5442784,0.018104801,0.2684702,0.0022553932,0.00022064967,0.0046331803,0.01358057,0.0010835032,0.14737333],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995739,0.00009808854,0.000030024326,0.00011259782,0.00014693929,0.000038442442],"domain_scores_gemma":[0.9997124,0.00008573594,0.00003095724,0.000046810994,0.00010557334,0.00001850093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063447,0.001003144,0.0010461111,0.0006049247,0.0004877188,0.0016081502,0.0018006944,0.001428401,0.007629199],"category_scores_gemma":[0.0009837633,0.0005427946,0.0015931027,0.0006968845,0.00047831915,0.0009905281,0.00059882255,0.0017097115,0.006607066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014071058,0.00076410855,0.0029915331,0.003281182,0.00028828974,0.0008383603,0.0002846521,0.28226945,0.52354425,0.05185006,0.04333209,0.08914894],"study_design_scores_gemma":[0.00022003609,0.0016350547,0.0037431952,0.00023891982,0.0004470234,0.00079905905,0.00011450419,0.6147168,0.21216281,0.019867621,0.14582554,0.00022937548],"about_ca_topic_score_codex":0.0141626345,"about_ca_topic_score_gemma":0.012638723,"teacher_disagreement_score":0.0141626345,"about_ca_system_score_codex":0.0016157636,"about_ca_system_score_gemma":0.00284364,"threshold_uncertainty_score":0.028160393},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015264514,0.0047922735,0.00022267943,0.010871922,0.015292505,0.0000417464,0.0012538781,0.00040087057,0.9655976],"genre_scores_gemma":[0.0027317826,0.000637714,0.000060227365,0.0010294935,0.0006533782,0.0000093185,0.0001901702,0.00011317795,0.9945747],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99975854,0.00003071663,0.0000089572595,0.000042343738,0.00009045821,0.000069040616],"domain_scores_gemma":[0.99971575,0.000021203079,0.000019027608,0.000022056565,0.000084386964,0.00013753984],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035359027,0.0008391956,0.00034145243,0.0006994905,0.0045400113,0.002783109,0.0006728682,0.0015064197,0.5132629],"category_scores_gemma":[0.0010222591,0.00029576136,0.00023794227,0.000905745,0.00071113446,0.0021795656,0.0029936929,0.0020273032,0.21349235],"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.000018157618,0.00000501839,0.00007648092,0.00003260641,6.411023e-7,0.00008923441,0.00023763481,0.0000069429416,0.00012500984,0.003129589,0.9809106,0.01536811],"study_design_scores_gemma":[0.0000011571955,0.0000030478939,0.0002553172,0.000024090867,4.2679136e-7,0.00005247171,0.00018669164,0.000003945047,0.000029955445,0.00012347817,0.9993181,0.000001336005],"about_ca_topic_score_codex":0.019443976,"about_ca_topic_score_gemma":0.0658616,"teacher_disagreement_score":0.5132629,"about_ca_system_score_codex":0.0015856767,"about_ca_system_score_gemma":0.0011744609,"threshold_uncertainty_score":0.6942713},"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":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005919909,0.00029179605,0.00011654741,0.00038007018,0.000030660372,0.000022527716,0.9917114,0.0001040052,0.0014230672],"genre_scores_gemma":[0.02494121,0.00046299395,0.0007787419,0.00015030439,0.000022925533,0.00016669181,0.9685069,0.000057939604,0.004912316],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983687,0.00018704776,0.00021473496,0.00036809032,0.00052701443,0.00033452656],"domain_scores_gemma":[0.9920385,0.0017970878,0.00084632536,0.0005896134,0.004079405,0.0006491434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015645697,0.0008858602,0.0009566338,0.0034032806,0.0009863564,0.0016305652,0.0014488354,0.00095150166,0.011474372],"category_scores_gemma":[0.016349344,0.00042219987,0.001215238,0.009044899,0.00048678386,0.0008817469,0.000989337,0.0017453831,0.0062129577],"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.00033557796,0.00007978409,0.22430609,0.0010805113,0.00025415927,0.00006703313,0.00039722235,0.0020910183,0.00016074587,0.0010703823,0.75698316,0.013174261],"study_design_scores_gemma":[0.00019352428,0.000040451356,0.6353129,0.00067237916,0.00017068215,0.00016649824,0.0017275935,0.0023481357,0.00047010547,0.0009954706,0.35779873,0.00010358865],"about_ca_topic_score_codex":0.8854546,"about_ca_topic_score_gemma":0.91986805,"teacher_disagreement_score":0.114545405,"about_ca_system_score_codex":0.008072065,"about_ca_system_score_gemma":0.017602064,"threshold_uncertainty_score":0.2304399},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051588955,0.0074999793,0.00087156,0.010695852,0.022524985,0.00016718749,0.0012439917,0.0012838132,0.9551967],"genre_scores_gemma":[0.0008060697,0.0014372083,0.00014282532,0.0018438295,0.0014877673,0.00003748295,0.00020664184,0.00018441399,0.9938538],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997396,0.000026126412,0.000011681868,0.000067120985,0.00010281432,0.000052641884],"domain_scores_gemma":[0.9990797,0.00009892948,0.000044611766,0.000049196653,0.00033453212,0.0003929471],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003821252,0.0013156384,0.0005504435,0.00071547314,0.0010845207,0.0027323242,0.00068030535,0.0014892324,0.67481345],"category_scores_gemma":[0.0017968606,0.0003172005,0.00028511562,0.0007684606,0.00039369098,0.002553526,0.0022108415,0.0020964344,0.59165806],"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.00001096787,0.000005694497,0.000035843485,0.000027187969,5.6433294e-7,0.00002533429,0.00000928889,0.000010861221,0.000056670433,0.00025989386,0.9829292,0.016628481],"study_design_scores_gemma":[0.0000019309618,0.0000036762297,0.000143312,0.000036514095,4.0104302e-7,0.00004170196,0.000024025561,0.000015820611,0.000020233654,0.000069786234,0.99964094,0.0000015841861],"about_ca_topic_score_codex":0.0052549313,"about_ca_topic_score_gemma":0.016785152,"teacher_disagreement_score":0.67481345,"about_ca_system_score_codex":0.0006625168,"about_ca_system_score_gemma":0.00070722937,"threshold_uncertainty_score":0.4638391},"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":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010483322,0.0020806056,0.002851747,0.0025373232,0.0013792464,0.0009258272,0.90741646,0.0018739564,0.07045148],"genre_scores_gemma":[0.08121548,0.0055367593,0.017679207,0.0029628058,0.0007143365,0.0010568452,0.7132859,0.0018599987,0.17568856],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9986975,0.00005327625,0.0001298921,0.00013915972,0.0007446463,0.00023544118],"domain_scores_gemma":[0.99042845,0.0018493616,0.0005266804,0.00043682492,0.005634675,0.001123932],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008378409,0.00080224033,0.0006496369,0.0040851333,0.0014486043,0.0013948007,0.0018648746,0.0008402298,0.47684503],"category_scores_gemma":[0.009532737,0.00041986702,0.00053591,0.007847349,0.00038057123,0.00052764337,0.00062937394,0.00078037905,0.049892623],"study_design_candidate":"observational","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.00010347012,0.00011759394,0.009951185,0.00047667624,0.000027699509,0.0003882982,0.000067600035,0.00026036164,0.000142223,0.00034625642,0.942509,0.04560969],"study_design_scores_gemma":[0.00026291187,0.00016046209,0.2068913,0.0014459539,0.00016845898,0.0040950333,0.0012655432,0.0014478202,0.00088332134,0.0016745613,0.7815789,0.00012578203],"about_ca_topic_score_codex":0.78604287,"about_ca_topic_score_gemma":0.8670363,"teacher_disagreement_score":0.47684503,"about_ca_system_score_codex":0.0086006215,"about_ca_system_score_gemma":0.023493115,"threshold_uncertainty_score":0.7462171},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34517586,0.018620728,0.031944685,0.05281142,0.00055543304,0.000090633905,0.00026507388,0.000019836396,0.5505163],"genre_scores_gemma":[0.977439,0.0023049964,0.002080876,0.00034151887,0.00009762901,0.00004512983,0.000036539062,0.00001675048,0.017637586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9995351,0.00020057008,0.000010796973,0.00006396925,0.000084834115,0.00010474646],"domain_scores_gemma":[0.9996462,0.00012664264,0.00006662902,0.000026260603,0.000052683517,0.00008167124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071394944,0.00041094376,0.00027816114,0.0013508571,0.003378076,0.0042948504,0.0007285696,0.0012546995,0.0067558284],"category_scores_gemma":[0.0012102171,0.00017518376,0.0004912501,0.0019278086,0.010769276,0.004723688,0.0030752104,0.00220575,0.00029990528],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032242024,0.000001983458,0.00018504517,0.000005584353,0.000001047758,0.000027941904,0.0016259572,0.00025543905,0.000009916838,0.99602544,0.00078475993,0.0010736963],"study_design_scores_gemma":[0.000012294544,0.000019056679,0.004187127,0.00014018848,0.0000066331872,0.00015868462,0.015549803,0.003167157,0.000076697484,0.8455799,0.13108034,0.000022121676],"about_ca_topic_score_codex":0.026528554,"about_ca_topic_score_gemma":0.033127077,"teacher_disagreement_score":0.026528554,"about_ca_system_score_codex":0.008897879,"about_ca_system_score_gemma":0.0018898527,"threshold_uncertainty_score":0.06455898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047752213,0.00049093436,0.94788104,0.000672615,0.00009303666,0.000064627224,0.00043475025,0.0009334475,0.0016773292],"genre_scores_gemma":[0.88016474,0.00045016466,0.1147988,0.00019381697,0.00018581835,0.00024123283,0.0013692805,0.00024429086,0.0023518647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996869,0.001795927,0.00014848176,0.0006329782,0.0003256979,0.00022785566],"domain_scores_gemma":[0.9331198,0.06174936,0.0013483332,0.0019233034,0.0011303142,0.0007289924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008196212,0.00096460414,0.002873703,0.002464444,0.0011525233,0.0020665752,0.0030215369,0.0021641161,0.005938896],"category_scores_gemma":[0.053834897,0.001913192,0.0021344065,0.0019593327,0.0021560437,0.0029344815,0.0019496982,0.0035424933,0.0005797145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002131721,0.000051716263,0.0013512851,0.000052299038,0.00010953127,0.000034289653,0.00004120169,0.9543399,0.00018739243,0.033909086,0.0005107497,0.009199401],"study_design_scores_gemma":[0.000015958174,0.0000041120497,0.000079473815,0.000003851385,0.0000064552223,0.0000028524712,0.000002056428,0.98368526,0.00006494901,0.016052002,0.00007982262,0.000003138664],"about_ca_topic_score_codex":0.021634286,"about_ca_topic_score_gemma":0.017304456,"teacher_disagreement_score":0.021634286,"about_ca_system_score_codex":0.0025793654,"about_ca_system_score_gemma":0.003565332,"threshold_uncertainty_score":0.043346286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035123498,0.0012269908,0.006319406,0.00062048,0.002509596,0.0004415522,0.010253575,0.0063460334,0.9719312],"genre_scores_gemma":[0.0022650198,0.0016351179,0.0038390786,0.00063022814,0.00043835273,0.00023491698,0.011819784,0.0033860211,0.9757514],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964948,0.00017471287,0.0002128478,0.00028121698,0.002594766,0.00024163481],"domain_scores_gemma":[0.99389875,0.0003321968,0.00017668481,0.0006068315,0.0046623982,0.00032314754],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0021541417,0.002401708,0.001413923,0.006140181,0.0017145796,0.008777288,0.004301203,0.00327817,0.7323119],"category_scores_gemma":[0.007248589,0.0012928108,0.0015094682,0.004605762,0.0011143708,0.006586476,0.0029091656,0.0026043134,0.7600691],"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.00008307554,0.000063139094,0.000073119234,0.0005839623,0.0000062833433,0.000088280765,0.0000570929,0.00023724955,0.0020199192,0.005637727,0.8528426,0.13830744],"study_design_scores_gemma":[0.000008192219,0.000019253563,0.00014376634,0.00009546455,0.0000037140094,0.00006120146,0.000026320715,0.00004893377,0.0007241201,0.0005920885,0.9982681,0.000008760267],"about_ca_topic_score_codex":0.0073359655,"about_ca_topic_score_gemma":0.006362666,"teacher_disagreement_score":0.2676881,"about_ca_system_score_codex":0.0023519157,"about_ca_system_score_gemma":0.003358442,"threshold_uncertainty_score":0.38182455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003155372,0.00087534444,0.0026182688,0.00096873875,0.0025538632,0.00020098449,0.0129070785,0.007591238,0.97196907],"genre_scores_gemma":[0.0010798846,0.00058607163,0.0008586275,0.000517991,0.00034494846,0.000058280853,0.006567448,0.0022367653,0.98775],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989832,0.000058578615,0.00006049438,0.00014334547,0.0006421358,0.000112255715],"domain_scores_gemma":[0.99683964,0.000325939,0.00010799414,0.00039996402,0.0018840792,0.000442394],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00073358894,0.0016696992,0.0012276337,0.003284166,0.0019759566,0.008652624,0.0025423055,0.0021454124,0.91904074],"category_scores_gemma":[0.0046704593,0.0009959034,0.0011334172,0.002976545,0.00078894076,0.0055117724,0.0032729078,0.002338729,0.8921613],"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.000043301938,0.000031780233,0.000046019344,0.00022246235,0.0000032489465,0.00006556137,0.00003760079,0.00008138697,0.0008050743,0.001909848,0.93863636,0.058117393],"study_design_scores_gemma":[0.0000069085127,0.0000116094925,0.00013025329,0.000055354372,0.000002136723,0.000068706446,0.000036867317,0.000042957152,0.00046783843,0.0005600423,0.99860966,0.0000075727553],"about_ca_topic_score_codex":0.0046095066,"about_ca_topic_score_gemma":0.0053524557,"teacher_disagreement_score":0.08095926,"about_ca_system_score_codex":0.0019513977,"about_ca_system_score_gemma":0.0017203711,"threshold_uncertainty_score":0.115478575},"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":"software","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016353402,0.0020141704,0.320358,0.019635754,0.05091737,0.0006037016,0.073883966,0.38113156,0.13510212],"genre_scores_gemma":[0.122224055,0.0018819415,0.20544975,0.021155044,0.0048523434,0.0010411465,0.14149068,0.22775963,0.27414542],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934197,0.0010096764,0.000427964,0.000821047,0.0038946318,0.00042695506],"domain_scores_gemma":[0.9800811,0.0038525225,0.0006450537,0.008911119,0.0058910972,0.0006191815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004556209,0.0016058979,0.0012426529,0.0010302062,0.001361977,0.0039429623,0.0031402523,0.0017761084,0.12073313],"category_scores_gemma":[0.019668542,0.0011508513,0.001682132,0.0023363493,0.0013572753,0.0038290317,0.0031252482,0.005763448,0.074938476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008074352,0.00012703931,0.0005925165,0.00048821955,0.00007382494,0.00014137391,0.000092058355,0.0027735916,0.011247914,0.012806551,0.9185527,0.052296773],"study_design_scores_gemma":[0.0003588602,0.00020830688,0.0015527301,0.00020694065,0.00008893916,0.00043222288,0.000061160696,0.0126747005,0.0832278,0.012360204,0.8887101,0.00011817217],"about_ca_topic_score_codex":0.00406865,"about_ca_topic_score_gemma":0.0031822808,"teacher_disagreement_score":0.12073313,"about_ca_system_score_codex":0.002029646,"about_ca_system_score_gemma":0.0029266025,"threshold_uncertainty_score":0.40389252},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005657565,0.0001992139,0.04173556,0.0004936555,0.00079923205,0.00014034452,0.030763866,0.899859,0.02544342],"genre_scores_gemma":[0.0065719807,0.0002630022,0.02927918,0.0013345659,0.00017964756,0.00043213225,0.065947995,0.8469426,0.049048975],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99727124,0.00025188486,0.00024828833,0.00069779437,0.0010282682,0.0005025622],"domain_scores_gemma":[0.9929482,0.0009543593,0.00023188343,0.0030685193,0.0021622356,0.00063480705],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0029030198,0.0047629983,0.0021700573,0.0020608383,0.001673044,0.0061973175,0.008397438,0.0034797993,0.44917244],"category_scores_gemma":[0.013669676,0.0050308956,0.004240894,0.0017245265,0.0013104441,0.011453853,0.009178907,0.0070127524,0.59791017],"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.0003233907,0.00005367941,0.00049377966,0.0003399587,0.000034594465,0.000066998546,0.00010884651,0.0002997531,0.0022377688,0.0024336406,0.9710053,0.022602318],"study_design_scores_gemma":[0.00019324876,0.000038990496,0.00097159203,0.00017864068,0.000035606296,0.00022361903,0.00006936775,0.002614445,0.012438004,0.0051280377,0.97797275,0.00013567746],"about_ca_topic_score_codex":0.005642251,"about_ca_topic_score_gemma":0.004703133,"teacher_disagreement_score":0.44917244,"about_ca_system_score_codex":0.002288305,"about_ca_system_score_gemma":0.0027708577,"threshold_uncertainty_score":0.78568864},"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":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09460463,0.06930043,0.05589253,0.0060328394,0.02343677,0.0017331638,0.013637858,0.007769929,0.7275919],"genre_scores_gemma":[0.49422568,0.030008886,0.08426307,0.0028855596,0.0043270686,0.0011541599,0.023514725,0.0019575807,0.35766327],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997422,0.00004634535,0.000028213222,0.000082633,0.000055109154,0.000045488367],"domain_scores_gemma":[0.9998518,0.00002170351,0.000018873534,0.000025279916,0.000063873376,0.000018461296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003437911,0.00084774464,0.00042588703,0.0025247135,0.0013443283,0.0010041508,0.0010516063,0.0007365261,0.03476034],"category_scores_gemma":[0.0008023928,0.00020660699,0.0003544901,0.0010599156,0.0012013059,0.0012550462,0.0010600429,0.0008801324,0.013443697],"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.00026149934,0.000049094742,0.005250805,0.0012233761,0.000053102198,0.00065573526,0.00086512003,0.00039807532,0.0053919824,0.011133247,0.122522905,0.8521952],"study_design_scores_gemma":[0.0000114380655,0.000034411216,0.007256346,0.00019910338,0.000029082987,0.0008028987,0.00017196928,0.00018132286,0.00047128304,0.00068170443,0.9901452,0.000015342972],"about_ca_topic_score_codex":0.0058435528,"about_ca_topic_score_gemma":0.012836432,"teacher_disagreement_score":0.03476034,"about_ca_system_score_codex":0.0008642973,"about_ca_system_score_gemma":0.0006145232,"threshold_uncertainty_score":0.11628485},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67618936,0.014990381,0.007614307,0.0016188144,0.0009139557,0.00066977955,0.0043308954,0.0006707415,0.29300168],"genre_scores_gemma":[0.97291946,0.0028071883,0.0029914912,0.0006966379,0.00013776241,0.0001281172,0.0017069917,0.000033997025,0.018578302],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99979824,0.000021345923,0.000014862002,0.00009117296,0.00004844714,0.000025987267],"domain_scores_gemma":[0.99974364,0.000040396524,0.00010005924,0.00002697399,0.000053168635,0.000035714565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023283374,0.0005926029,0.00043780095,0.0011134316,0.0011600428,0.00036140534,0.0004781949,0.000562255,0.008949866],"category_scores_gemma":[0.00045846406,0.00019764712,0.00016668886,0.0006899534,0.00073775684,0.0009230557,0.0015682412,0.0006926351,0.0028002092],"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.0019721459,0.0002700131,0.07107823,0.0024077424,0.00014161786,0.0100167785,0.003163082,0.002661812,0.113917835,0.013183141,0.046673514,0.7345141],"study_design_scores_gemma":[0.0005935111,0.0010851849,0.634735,0.0010744494,0.00021837861,0.018155891,0.0025143556,0.0015975694,0.011619064,0.004152499,0.324165,0.00008910977],"about_ca_topic_score_codex":0.009985295,"about_ca_topic_score_gemma":0.018397521,"teacher_disagreement_score":0.009985295,"about_ca_system_score_codex":0.000682837,"about_ca_system_score_gemma":0.000514265,"threshold_uncertainty_score":0.029940307},"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":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047842372,0.00082775595,0.0041628475,0.0012749392,0.0045489585,0.00041441337,0.9566387,0.0038456714,0.027808325],"genre_scores_gemma":[0.0034091566,0.0012728369,0.00901097,0.0031083308,0.0009309274,0.0010609141,0.91863215,0.003243723,0.05933089],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972832,0.00034481616,0.00031058592,0.00072910095,0.0010652639,0.00026706958],"domain_scores_gemma":[0.98682016,0.0048143095,0.0007248881,0.0019006574,0.0048471666,0.00089283846],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023189366,0.0020165048,0.0018905271,0.0046760268,0.0032645853,0.0046402533,0.003265268,0.002872562,0.860695],"category_scores_gemma":[0.023803517,0.0013066684,0.0016156919,0.006334919,0.0007790401,0.0039463793,0.0022408213,0.0028210043,0.549047],"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.00011966412,0.000036313362,0.00035590323,0.0010047869,0.000030331026,0.0000943347,0.0000250244,0.00030155823,0.0003988918,0.001708026,0.9827874,0.013137734],"study_design_scores_gemma":[0.00012279376,0.00004521683,0.0011496107,0.00038714075,0.000028183615,0.00020173765,0.000060560153,0.00024127871,0.0005455898,0.0046848524,0.99249685,0.00003612934],"about_ca_topic_score_codex":0.0067822444,"about_ca_topic_score_gemma":0.011454307,"teacher_disagreement_score":0.860695,"about_ca_system_score_codex":0.0019944478,"about_ca_system_score_gemma":0.0043259882,"threshold_uncertainty_score":0.19870162},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12697995,0.0030084073,0.006934392,0.0013161045,0.0018352234,0.00048086705,0.024743382,0.0014997325,0.83320194],"genre_scores_gemma":[0.75327796,0.0018382288,0.012358168,0.00041817268,0.00026833537,0.0001121654,0.01738451,0.00023733325,0.21410508],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999684,0.000002985023,0.0000012432635,0.000007875243,0.000012536976,0.0000070012075],"domain_scores_gemma":[0.99996626,0.0000072956154,0.0000074574946,0.0000032628818,0.000007316727,0.000008347363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000019068739,0.0003907599,0.00010156347,0.00071630336,0.00033316694,0.00018594082,0.00021775755,0.00035221744,0.060524117],"category_scores_gemma":[0.00008494856,0.000104756036,0.0001682379,0.00037587047,0.00024082212,0.00022804395,0.00031606,0.00038941207,0.01312796],"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.00082507235,0.00011296815,0.026756307,0.001288467,0.000058457947,0.0060545886,0.001384819,0.0019597725,0.09760272,0.008206406,0.3720569,0.48369342],"study_design_scores_gemma":[0.000051672057,0.00011965026,0.2286589,0.00022116014,0.000029908915,0.009549195,0.0009037858,0.0009672139,0.005847458,0.0010406282,0.7525903,0.000020082653],"about_ca_topic_score_codex":0.0060877735,"about_ca_topic_score_gemma":0.012964484,"teacher_disagreement_score":0.060524117,"about_ca_system_score_codex":0.00021774966,"about_ca_system_score_gemma":0.00010582915,"threshold_uncertainty_score":0.20247334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001249536,0.00011364847,0.00003267038,0.0001248514,0.000031471733,0.000023718483,0.99744356,0.00003077091,0.0020742984],"genre_scores_gemma":[0.000868218,0.00031807547,0.00028919536,0.00012424409,0.000013532595,0.000102383514,0.9952714,0.00002591353,0.0029871494],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99760133,0.00014189187,0.00027245303,0.0003939487,0.0011686403,0.00042178514],"domain_scores_gemma":[0.9920643,0.00023513853,0.0002894367,0.00031796953,0.0065602777,0.0005328549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016251713,0.0016864233,0.0016156211,0.0061073545,0.0026232083,0.0036281645,0.0031240436,0.0011153803,0.044550464],"category_scores_gemma":[0.00833732,0.0007649193,0.0012865859,0.020028649,0.00036207557,0.0015376637,0.0014165525,0.002194049,0.034330565],"study_design_candidate":"observational","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.000020405085,0.000007646945,0.0014863898,0.00017568025,0.000015305177,0.000011016108,0.000013582505,0.000057972553,0.000009920527,0.00070170977,0.9948407,0.002659649],"study_design_scores_gemma":[0.000072328505,0.0000085313295,0.04717629,0.000399193,0.000040867206,0.00004997642,0.00020768076,0.0003590632,0.00009941225,0.00065196614,0.9508883,0.000046358142],"about_ca_topic_score_codex":0.9496061,"about_ca_topic_score_gemma":0.96630144,"teacher_disagreement_score":0.97867835,"about_ca_system_score_codex":0.021321684,"about_ca_system_score_gemma":0.039731555,"threshold_uncertainty_score":0.1547004},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007414007,0.0011770467,0.00029131153,0.0030180404,0.0013477228,0.00076720805,0.96551895,0.00022706587,0.026911333],"genre_scores_gemma":[0.008093717,0.004528814,0.0028698628,0.005603716,0.00035218088,0.0023914636,0.9044255,0.00025609415,0.07147873],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99456125,0.0003034283,0.00049592555,0.0004309679,0.003324805,0.0008836033],"domain_scores_gemma":[0.97658545,0.00037476775,0.00040680694,0.00037604873,0.02117998,0.0010771173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039904052,0.0012502922,0.0013266115,0.004189841,0.0031362306,0.0030298205,0.0037496025,0.0013714156,0.040173944],"category_scores_gemma":[0.018515218,0.0011369425,0.0013698414,0.011427288,0.0006363595,0.0016999034,0.0015588476,0.0036365548,0.023317425],"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.000027664495,0.000011623114,0.0019649663,0.00026505522,0.00001189506,0.000011135843,0.00005378083,0.000060808776,0.0000219985,0.00051142,0.9892386,0.0078210365],"study_design_scores_gemma":[0.00007244363,0.000017953475,0.095837906,0.0008293951,0.00003811822,0.000025565065,0.0004365958,0.0001604381,0.000074153955,0.000351223,0.9021057,0.00005039793],"about_ca_topic_score_codex":0.9892847,"about_ca_topic_score_gemma":0.99210405,"teacher_disagreement_score":0.052473087,"about_ca_system_score_codex":0.052473087,"about_ca_system_score_gemma":0.13269883,"threshold_uncertainty_score":0.38072067},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035559255,0.0001504579,0.0031046125,0.00023226764,0.00012340983,0.000110592,0.9567082,0.028303703,0.010911178],"genre_scores_gemma":[0.00073493714,0.00010895908,0.0030655982,0.00011339465,0.000023231672,0.00017430585,0.9913557,0.0013836987,0.0030402222],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980246,0.00032215822,0.00034212242,0.00035237917,0.00074624387,0.00021258662],"domain_scores_gemma":[0.9956143,0.00046459964,0.00031013775,0.002017471,0.0010858381,0.0005076631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026743985,0.0014824789,0.0014869714,0.0055761007,0.0007874607,0.0037538584,0.0031791092,0.0011329704,0.08930962],"category_scores_gemma":[0.009339989,0.0007826291,0.0007548328,0.007793664,0.00032908996,0.0035999804,0.003247039,0.002611064,0.24069448],"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.000046077374,0.000021478767,0.00028156608,0.00015723504,0.000010039122,0.000010247129,0.0000099885065,0.00010633649,0.00016568841,0.0008695916,0.9896125,0.008709204],"study_design_scores_gemma":[0.00007032358,0.000013891791,0.0009841572,0.00004967105,0.000007437357,0.000040519302,0.000024033188,0.0006316065,0.00097295217,0.0015117973,0.99567336,0.000020262849],"about_ca_topic_score_codex":0.0050985822,"about_ca_topic_score_gemma":0.0059129884,"teacher_disagreement_score":0.08930962,"about_ca_system_score_codex":0.0012958847,"about_ca_system_score_gemma":0.002696221,"threshold_uncertainty_score":0.29877043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036022934,0.00042773073,0.0003838496,0.000927832,0.0010115792,0.000057352176,0.00140139,0.00069886714,0.99473107],"genre_scores_gemma":[0.0017077302,0.00039802497,0.0002217154,0.00030692143,0.00022857131,0.000020682739,0.0005467807,0.00049766037,0.99607193],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932396,0.000066779656,0.000018453256,0.00006948272,0.00040972896,0.00011162092],"domain_scores_gemma":[0.99862814,0.00019240101,0.000054754542,0.00014155285,0.0005422486,0.00044094908],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004889514,0.001021988,0.0007267801,0.0016268224,0.0022832637,0.0048055025,0.00078063854,0.0014340155,0.8846451],"category_scores_gemma":[0.0026984403,0.00044877693,0.00070490997,0.0013363067,0.0008169961,0.0034419158,0.0032165302,0.002109776,0.727444],"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.000028386514,0.000026741356,0.000086712425,0.00013966883,0.0000019116626,0.00009207762,0.00013164479,0.00004025087,0.0004262306,0.0048090424,0.926191,0.06802636],"study_design_scores_gemma":[0.0000032454263,0.000009656857,0.00021013503,0.000036770536,8.092153e-7,0.0000755561,0.00007357057,0.000009555281,0.00017038592,0.00040172364,0.9990048,0.0000037779525],"about_ca_topic_score_codex":0.0023060136,"about_ca_topic_score_gemma":0.006846125,"teacher_disagreement_score":0.115354896,"about_ca_system_score_codex":0.0012928131,"about_ca_system_score_gemma":0.0011907978,"threshold_uncertainty_score":0.1645397},"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":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016444137,0.00080797914,0.0039249314,0.0003303972,0.00029866165,0.000117415126,0.95999485,0.011324714,0.0067568514],"genre_scores_gemma":[0.015471345,0.00016339407,0.0023536524,0.00011899795,0.000048054902,0.00015988344,0.97914666,0.00049675815,0.0020412623],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990445,0.00011437747,0.00007396648,0.00037724973,0.0002600771,0.00012985173],"domain_scores_gemma":[0.9987213,0.00018515447,0.00007337735,0.00041207956,0.0005135039,0.000094648494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049397565,0.0020477693,0.0013187369,0.0017002076,0.0005556195,0.00091313553,0.0015010615,0.0010630949,0.020639122],"category_scores_gemma":[0.002275207,0.00048181412,0.0009095454,0.0031577984,0.0002793992,0.0009283114,0.0007003036,0.0011064075,0.027508328],"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.00058612815,0.00021617611,0.005566654,0.0009026987,0.00013646972,0.000108546956,0.00005449242,0.0070051444,0.0019303588,0.0005647808,0.94827986,0.034648806],"study_design_scores_gemma":[0.00046662183,0.00035781076,0.078828394,0.00034440644,0.00016448961,0.00044561492,0.0002216669,0.034908038,0.01148476,0.0044659283,0.8681331,0.00017922909],"about_ca_topic_score_codex":0.010149852,"about_ca_topic_score_gemma":0.017894864,"teacher_disagreement_score":0.020639122,"about_ca_system_score_codex":0.0007362394,"about_ca_system_score_gemma":0.0007140137,"threshold_uncertainty_score":0.06904477},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004779225,0.005434256,0.000120850746,0.021001661,0.03819468,0.00017218178,0.0040775132,0.0009910464,0.92952996],"genre_scores_gemma":[0.0007062405,0.0008349823,0.000041042396,0.0033887425,0.001875057,0.00003505905,0.00081890775,0.00009753339,0.9922024],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995534,0.000038223992,0.000033999488,0.000058743048,0.00022862856,0.00008705986],"domain_scores_gemma":[0.9989215,0.00012663016,0.000067914756,0.0000859475,0.0005570717,0.00024095814],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004627403,0.00096979627,0.00060434727,0.0013522665,0.0020723548,0.0040218728,0.0011022452,0.002779607,0.578511],"category_scores_gemma":[0.0025410748,0.000509415,0.00046913567,0.0010926297,0.00040897014,0.0015737653,0.001470677,0.0023971938,0.53730875],"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.0000063684224,0.0000044420144,0.000021552707,0.000030291807,4.642266e-7,0.000017775092,0.000004609235,0.000003901078,0.00001990285,0.00021388012,0.99344254,0.0062342077],"study_design_scores_gemma":[0.0000035959483,0.0000048603047,0.00020288433,0.000074061296,7.126958e-7,0.000013850249,0.000028169514,0.00001093237,0.000023461726,0.00006749689,0.99956805,0.000001916411],"about_ca_topic_score_codex":0.013273363,"about_ca_topic_score_gemma":0.028628977,"teacher_disagreement_score":0.578511,"about_ca_system_score_codex":0.00136693,"about_ca_system_score_gemma":0.0018795362,"threshold_uncertainty_score":0.60120285},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040870655,0.000043289052,0.000017626006,0.000118503514,0.000024122655,0.000017087019,0.99865484,0.000054241773,0.0010293736],"genre_scores_gemma":[0.0008576303,0.00036137088,0.00045681867,0.00019331374,0.000020666375,0.0001981515,0.99210733,0.00013945554,0.0056651398],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99220544,0.0003978306,0.00086955697,0.0007405335,0.004040475,0.0017460998],"domain_scores_gemma":[0.92359775,0.0027430444,0.0017850096,0.0016960978,0.06742076,0.0027574543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028411774,0.00267493,0.0033480916,0.012257476,0.004559906,0.0067493585,0.005877936,0.0018449023,0.10763517],"category_scores_gemma":[0.028156016,0.0021761246,0.0024142116,0.06973396,0.0008995137,0.0031187036,0.0027931533,0.0038412444,0.07080738],"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.000019126932,0.000007759675,0.00081458985,0.0002543641,0.0000141335695,0.000005451497,0.000020463918,0.00009398341,0.000007458565,0.00030683717,0.99714607,0.0013097613],"study_design_scores_gemma":[0.00018283431,0.000012394954,0.025744269,0.00091192935,0.000076935125,0.000022103983,0.0006476391,0.0003609708,0.00021277729,0.00062374416,0.97110456,0.0000999636],"about_ca_topic_score_codex":0.9958812,"about_ca_topic_score_gemma":0.9933515,"teacher_disagreement_score":0.913455,"about_ca_system_score_codex":0.08654497,"about_ca_system_score_gemma":0.21653555,"threshold_uncertainty_score":0.62793064},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8596031,0.020576192,0.023012951,0.0012229357,0.00023316234,0.00003793019,0.04371938,0.00032951633,0.051264822],"genre_scores_gemma":[0.96532035,0.0083173,0.008969946,0.00016784023,0.00009495199,0.000029956684,0.01415695,0.000037411482,0.0029052675],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99974555,0.000037409805,0.00001640081,0.00007362701,0.00009590372,0.000030979143],"domain_scores_gemma":[0.99929786,0.00023980936,0.00017004478,0.00006853122,0.00014990008,0.000073919226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024707615,0.00022312686,0.00024583758,0.0018578104,0.000214703,0.0008774612,0.00025880735,0.00023307673,0.0040508504],"category_scores_gemma":[0.001794915,0.000101411344,0.00025940101,0.0028700994,0.00029638858,0.0014922105,0.00054522906,0.0003475404,0.0012817351],"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.00012075174,0.00003577901,0.71859586,0.00095480005,0.00045871176,0.00024966072,0.0010475772,0.010769453,0.01180976,0.025814053,0.022061933,0.20808169],"study_design_scores_gemma":[0.000007963525,0.000058029025,0.8288805,0.0002248811,0.00012574365,0.0013704277,0.0014634473,0.0070419125,0.0018827026,0.017889237,0.14101353,0.000041574152],"about_ca_topic_score_codex":0.0035261097,"about_ca_topic_score_gemma":0.003514343,"teacher_disagreement_score":0.0040508504,"about_ca_system_score_codex":0.00020189001,"about_ca_system_score_gemma":0.0001556451,"threshold_uncertainty_score":0.013551474},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056991614,0.00029768946,0.906425,0.00027348672,0.00015866691,0.00006113777,0.00017043982,0.025859224,0.009762719],"genre_scores_gemma":[0.42842394,0.0002188675,0.55872893,0.00029277446,0.00008605173,0.00020690857,0.0009019576,0.0043700114,0.0067705205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922943,0.00009038999,0.00006378913,0.0001377413,0.00033252922,0.0001460688],"domain_scores_gemma":[0.9986474,0.00028377114,0.00012404587,0.00059222843,0.00027814347,0.00007452466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005736784,0.0007898253,0.0006181882,0.00073186634,0.0006068899,0.0017443267,0.0013930638,0.00040451635,0.003380665],"category_scores_gemma":[0.002486862,0.00058397243,0.0007518568,0.0008476082,0.0009214894,0.0019563893,0.0024500848,0.0013566978,0.0025448038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007704485,0.00036359552,0.004761771,0.00047693378,0.00011265866,0.00053935806,0.0010528704,0.1392065,0.17725894,0.12991355,0.027450094,0.5180933],"study_design_scores_gemma":[0.000119851116,0.00026770736,0.0011116944,0.00006672641,0.000047251084,0.00027366122,0.00010583635,0.7761956,0.13132575,0.05183041,0.038563613,0.00009190128],"about_ca_topic_score_codex":0.0015865919,"about_ca_topic_score_gemma":0.002319366,"teacher_disagreement_score":0.003380665,"about_ca_system_score_codex":0.0007206389,"about_ca_system_score_gemma":0.0016508404,"threshold_uncertainty_score":0.011309445},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9839087,0.001994448,0.0071691405,0.0004135064,0.00011489242,0.000023224395,0.00041844655,0.00025316488,0.005704424],"genre_scores_gemma":[0.99669087,0.00028024925,0.0018849896,0.00017430384,0.000038571387,0.000019577361,0.00014512362,0.000018150462,0.00074812706],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99992764,0.000006320531,0.0000021855985,0.000027167614,0.00002649036,0.000010225613],"domain_scores_gemma":[0.99979883,0.000077315206,0.00005537876,0.000021177275,0.000026836584,0.00002041238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013893786,0.00015372648,0.00012941963,0.00046786378,0.0005018165,0.00023756867,0.00034216832,0.00063082157,0.0018040962],"category_scores_gemma":[0.0003285711,0.00016447064,0.000112882706,0.00033847874,0.0005465814,0.00036414858,0.000400617,0.00075759174,0.0003548441],"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.00035316168,0.000072733856,0.015231566,0.00016199093,0.00002571707,0.0016916643,0.000750528,0.00021721752,0.9645748,0.0030430104,0.0012699964,0.012607569],"study_design_scores_gemma":[0.00012027994,0.0012651047,0.14676677,0.00011485426,0.000054514134,0.0067414497,0.00082982,0.0048745866,0.8092716,0.0061532785,0.023725746,0.00008199549],"about_ca_topic_score_codex":0.00024703282,"about_ca_topic_score_gemma":0.0004178769,"teacher_disagreement_score":0.0018040962,"about_ca_system_score_codex":0.00015373323,"about_ca_system_score_gemma":0.00008302799,"threshold_uncertainty_score":0.0060352683},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042180854,0.000017158041,0.001011675,0.0000986134,0.000032109503,0.000052532905,0.996488,0.0006371233,0.0012410501],"genre_scores_gemma":[0.025859566,0.0001733544,0.0139288865,0.00051492645,0.0001037743,0.0016925033,0.9431798,0.0034988525,0.011048387],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996119,0.00008782543,0.00004227487,0.000106286,0.00008459761,0.000067107554],"domain_scores_gemma":[0.98508435,0.012670729,0.00034217085,0.0007352074,0.0009776824,0.00018981457],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012015852,0.0010819456,0.0011006633,0.001132918,0.0006620668,0.0013991912,0.0019310585,0.001372904,0.8590072],"category_scores_gemma":[0.022266448,0.0005935545,0.00086802815,0.002259416,0.0002305177,0.0015314594,0.00070169143,0.0011295371,0.17942607],"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.0003105885,0.00010362566,0.0025746666,0.0016195026,0.00005508185,0.00008289823,0.0000575529,0.004499871,0.0001625916,0.0017794805,0.9785432,0.010210933],"study_design_scores_gemma":[0.007840051,0.0004277434,0.026683886,0.0030866945,0.0003174747,0.00065736193,0.00079850666,0.047723778,0.0022854626,0.04981535,0.8600761,0.0002875093],"about_ca_topic_score_codex":0.01116839,"about_ca_topic_score_gemma":0.018550644,"teacher_disagreement_score":0.8590072,"about_ca_system_score_codex":0.0008473029,"about_ca_system_score_gemma":0.0012745793,"threshold_uncertainty_score":0.20110917},"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":"empirical","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9693452,0.00029914558,0.029176105,0.000050338764,0.000010438866,0.000048678274,0.00025548413,0.000079635836,0.00073489104],"genre_scores_gemma":[0.9932609,0.00018469688,0.0058565876,0.000024487677,0.0000136820845,0.00004513816,0.00025633283,0.000016629441,0.00034144789],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998179,0.000059616494,0.000019560468,0.000040303777,0.000042724274,0.000019940062],"domain_scores_gemma":[0.9996253,0.00017925822,0.000046567595,0.000054563574,0.00007122325,0.000022951528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003239185,0.00037275048,0.00049473287,0.00045635112,0.00019014627,0.00037550178,0.0003305297,0.0005155936,0.0013086051],"category_scores_gemma":[0.001033274,0.00031444605,0.00046009073,0.00032339577,0.00031271717,0.00027375718,0.00039659656,0.00016273068,0.00034217516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029221426,0.0013099756,0.050618485,0.0012496163,0.0005150498,0.0009209344,0.0007258322,0.115868114,0.7481467,0.00042969058,0.0007693928,0.076524004],"study_design_scores_gemma":[0.00017347652,0.007796106,0.33215728,0.000113426664,0.00040002147,0.0030488137,0.0006255774,0.5574319,0.0952079,0.0009673949,0.0019712632,0.00010680344],"about_ca_topic_score_codex":0.0018319556,"about_ca_topic_score_gemma":0.0027827185,"teacher_disagreement_score":0.0018319556,"about_ca_system_score_codex":0.00013338655,"about_ca_system_score_gemma":0.00019749606,"threshold_uncertainty_score":0.004377663},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016465794,0.00010538967,0.00019083769,0.00014620091,0.00009630962,0.000032313932,0.99356407,0.00069950026,0.0035187479],"genre_scores_gemma":[0.0017227047,0.0000611597,0.00026529923,0.000030661857,0.0000096119065,0.000045406658,0.99578935,0.00005528665,0.0020205106],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993411,0.000041639978,0.000041417476,0.00014785986,0.00025741712,0.00017048341],"domain_scores_gemma":[0.99840325,0.000087832406,0.000064512365,0.00026684807,0.0009961001,0.00018148705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006334586,0.0021036102,0.0010597687,0.0030817122,0.0013559161,0.0014999676,0.0022881222,0.0010533736,0.013314507],"category_scores_gemma":[0.002656491,0.00034679193,0.00043389533,0.004930936,0.0005691618,0.0008517121,0.0012551293,0.0014114981,0.026555302],"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.00006170826,0.000020804258,0.0011883503,0.000081390615,0.000012147034,0.000036020796,0.000019267804,0.0004044539,0.00009220224,0.00024949558,0.99508333,0.002750917],"study_design_scores_gemma":[0.00013139994,0.000017016508,0.01546074,0.00019945521,0.00001944594,0.0000709189,0.00025232817,0.0023087452,0.0007956473,0.0009354712,0.9797632,0.00004568347],"about_ca_topic_score_codex":0.52882004,"about_ca_topic_score_gemma":0.75784117,"teacher_disagreement_score":0.47117996,"about_ca_system_score_codex":0.004493565,"about_ca_system_score_gemma":0.006032933,"threshold_uncertainty_score":0.94790965},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056991614,0.00029768946,0.906425,0.00027348672,0.00015866691,0.00006113777,0.00017043982,0.025859224,0.009762719],"genre_scores_gemma":[0.42842394,0.0002188675,0.55872893,0.00029277446,0.00008605173,0.00020690857,0.0009019576,0.0043700114,0.0067705205],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99922943,0.00009038999,0.00006378913,0.0001377413,0.00033252922,0.0001460688],"domain_scores_gemma":[0.9986474,0.00028377114,0.00012404587,0.00059222843,0.00027814347,0.00007452466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005736784,0.0007898253,0.0006181882,0.00073186634,0.0006068899,0.0017443267,0.0013930638,0.00040451635,0.003380665],"category_scores_gemma":[0.002486862,0.00058397243,0.0007518568,0.0008476082,0.0009214894,0.0019563893,0.0024500848,0.0013566978,0.0025448038],"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.0007704485,0.00036359552,0.004761771,0.00047693378,0.00011265866,0.00053935806,0.0010528704,0.1392065,0.17725894,0.12991355,0.027450094,0.5180933],"study_design_scores_gemma":[0.000119851116,0.00026770736,0.0011116944,0.00006672641,0.000047251084,0.00027366122,0.00010583635,0.7761956,0.13132575,0.05183041,0.038563613,0.00009190128],"about_ca_topic_score_codex":0.0015865919,"about_ca_topic_score_gemma":0.002319366,"teacher_disagreement_score":0.003380665,"about_ca_system_score_codex":0.0007206389,"about_ca_system_score_gemma":0.0016508404,"threshold_uncertainty_score":0.011309445},"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":"empirical","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9956815,0.0002933344,0.000049030958,0.0005659026,0.0000101614605,0.000026449208,0.0004123133,0.0000033543472,0.0029579129],"genre_scores_gemma":[0.99641055,0.00058685284,0.00017192685,0.0003782887,0.000007768252,0.000016413927,0.00026207438,0.0000039549186,0.0021621438],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9995807,0.000044276152,0.00001161348,0.000035150337,0.0001425288,0.00018582259],"domain_scores_gemma":[0.9990453,0.00007179811,0.00019168544,0.000019199142,0.00032801914,0.00034396144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058167486,0.00023071977,0.00017840037,0.00069515157,0.0042705107,0.0015066005,0.00054725935,0.0003673037,0.0039441925],"category_scores_gemma":[0.0010928706,0.00022098889,0.0003864191,0.001225951,0.00088593364,0.00048256997,0.0008246888,0.0006605623,0.00029937478],"study_design_candidate":"observational","study_design_consensus":"observational","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.00008877416,0.00009128512,0.9315609,0.000107418695,0.00002462444,0.0003922473,0.044669565,0.00004348294,0.0010645601,0.00021363756,0.0032751167,0.0184684],"study_design_scores_gemma":[0.0000037289833,0.000059493053,0.9200663,0.0000621297,0.000012879337,0.00014397575,0.07418319,0.000079338555,0.00008300167,0.000021340533,0.0052598463,0.000024890243],"about_ca_topic_score_codex":0.984493,"about_ca_topic_score_gemma":0.99385285,"teacher_disagreement_score":0.015506983,"about_ca_system_score_codex":0.010474042,"about_ca_system_score_gemma":0.012087272,"threshold_uncertainty_score":0.07599485},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24390197,0.004584001,0.024996154,0.22363985,0.00081280834,0.0004620826,0.00012143347,0.00022726691,0.5012544],"genre_scores_gemma":[0.9610715,0.001601738,0.008856692,0.005023329,0.00006423116,0.00014418448,0.000050985775,0.000063983854,0.023123283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.98891884,0.007026887,0.00016876223,0.00070318003,0.0010283906,0.0021539473],"domain_scores_gemma":[0.9872196,0.0027970294,0.0005969614,0.00096245366,0.0022138346,0.0062100897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0123760775,0.00046352833,0.00035239596,0.0017014204,0.02414722,0.01584281,0.0027322709,0.0030751342,0.010329878],"category_scores_gemma":[0.014165586,0.0002667201,0.00038232122,0.0019450568,0.015564997,0.0073122177,0.01830005,0.003893115,0.000980927],"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.00008274318,0.00034126034,0.027607787,0.0005156306,0.00011888549,0.0023723643,0.24153452,0.0024087783,0.0011040161,0.45766792,0.062367737,0.20387837],"study_design_scores_gemma":[0.00005527832,0.0001163332,0.013196515,0.0011102245,0.00006618789,0.00031471823,0.30155066,0.0021824066,0.0005308999,0.14930263,0.53150517,0.00006904264],"about_ca_topic_score_codex":0.3208491,"about_ca_topic_score_gemma":0.534785,"teacher_disagreement_score":0.67915094,"about_ca_system_score_codex":0.027126918,"about_ca_system_score_gemma":0.08933035,"threshold_uncertainty_score":0.63796306},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6510679,0.0006875036,0.3390024,0.00027660525,0.00004723582,0.0001058608,0.00006268057,0.00038884822,0.008361004],"genre_scores_gemma":[0.93848795,0.00027351078,0.060198408,0.000029067229,0.000013037212,0.000050494727,0.000089717905,0.000048181577,0.0008094931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995074,0.00017555538,0.000018648738,0.000056756744,0.00018167667,0.000059838778],"domain_scores_gemma":[0.9988556,0.00068078644,0.00012312016,0.00013251576,0.00015969429,0.000048354355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007769716,0.0004346715,0.00041033403,0.0005202269,0.00038799157,0.00071721285,0.0005883634,0.00040461143,0.000731042],"category_scores_gemma":[0.003006446,0.00018506087,0.0003452012,0.00059634045,0.00047564387,0.0009147431,0.00042036077,0.00047847393,0.00012110101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081210164,0.00008117648,0.002596524,0.000063042455,0.000026948514,0.0000645454,0.00004737837,0.95537704,0.007311791,0.008195747,0.00033496847,0.025819542],"study_design_scores_gemma":[0.0000025553811,0.00003167585,0.00037347784,0.000002213361,0.0000027708418,0.000008147103,0.000012209799,0.9962446,0.0018422325,0.0012987128,0.00017931202,0.0000020990904],"about_ca_topic_score_codex":0.0017310551,"about_ca_topic_score_gemma":0.0015560774,"teacher_disagreement_score":0.0017310551,"about_ca_system_score_codex":0.000573006,"about_ca_system_score_gemma":0.0004773649,"threshold_uncertainty_score":0.0041574836},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026976772,0.0019078447,0.9564198,0.0009951604,0.0003484694,0.00017648145,0.00011155795,0.0053886976,0.0076752263],"genre_scores_gemma":[0.32058007,0.0011474318,0.6588356,0.0007996576,0.00043937907,0.00050823635,0.00032478385,0.0017819095,0.015582851],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973182,0.00078045024,0.000210467,0.00055801665,0.000755465,0.00037745974],"domain_scores_gemma":[0.993056,0.0015417207,0.0005025653,0.0036458035,0.0009262554,0.0003277564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030460649,0.0008487486,0.0012317273,0.001565838,0.002104211,0.003452091,0.006375947,0.001280626,0.0051224874],"category_scores_gemma":[0.0070090936,0.00083840237,0.00097500667,0.0020686788,0.0026380785,0.008672824,0.004136906,0.0026656864,0.0023214999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019813108,0.00044993733,0.0039319717,0.0005750194,0.0001750058,0.0003705763,0.0027612806,0.04286119,0.05704958,0.3899503,0.024473282,0.4754206],"study_design_scores_gemma":[0.000668459,0.0011708593,0.0011143644,0.00032543213,0.000297628,0.001019168,0.0006272062,0.4957625,0.077659585,0.20824799,0.21267787,0.00042888543],"about_ca_topic_score_codex":0.0028263922,"about_ca_topic_score_gemma":0.002560838,"teacher_disagreement_score":0.006375947,"about_ca_system_score_codex":0.0019361824,"about_ca_system_score_gemma":0.0021927226,"threshold_uncertainty_score":0.017136395},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046562225,0.06365268,0.5759267,0.02383544,0.0073557333,0.00009658016,0.0006025316,0.0031538107,0.2788143],"genre_scores_gemma":[0.6319149,0.024804324,0.21449722,0.007809248,0.0051177973,0.00055527134,0.00089442875,0.0040443586,0.11036241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989862,0.000289118,0.00004604194,0.00013026177,0.0003435926,0.00020474885],"domain_scores_gemma":[0.9969085,0.0020136824,0.00010251134,0.00050582824,0.0003132754,0.00015615573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016492655,0.0012613288,0.0014500963,0.0011048275,0.0009889388,0.0021397308,0.0017902256,0.0015209791,0.018736525],"category_scores_gemma":[0.009109099,0.0007074141,0.0007495018,0.0012973469,0.002496349,0.008689711,0.0033978845,0.0072856345,0.004664906],"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.00020431327,0.000045703157,0.00020899651,0.000318254,0.000016147249,0.000077824916,0.00012797384,0.01339971,0.0016555414,0.885506,0.040042296,0.05839734],"study_design_scores_gemma":[0.000022325734,0.000020560214,0.00009969049,0.00006179826,0.000009993698,0.00006570233,0.00003276745,0.05707791,0.00093420455,0.9213238,0.020341674,0.000009678412],"about_ca_topic_score_codex":0.0011541354,"about_ca_topic_score_gemma":0.001243622,"teacher_disagreement_score":0.018736525,"about_ca_system_score_codex":0.0014401808,"about_ca_system_score_gemma":0.0010120205,"threshold_uncertainty_score":0.06267989},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026175654,0.00032553592,0.9558358,0.00018242418,0.000058216086,0.00019758003,0.0002798714,0.0031551663,0.013789805],"genre_scores_gemma":[0.32435468,0.0007421425,0.6568686,0.00018212185,0.000042546893,0.00068316376,0.00097012415,0.0008326437,0.01532398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997987,0.000041281983,0.000011823528,0.000036236488,0.00008916254,0.000022883247],"domain_scores_gemma":[0.99984205,0.000033443335,0.000015603611,0.00003676312,0.000060033577,0.000012027791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025436244,0.0005351423,0.00039174454,0.00057092647,0.00046320967,0.0010668895,0.0013427223,0.000705876,0.004028843],"category_scores_gemma":[0.00047515676,0.0004604097,0.00068439014,0.00039815786,0.0004407052,0.00063725194,0.0004801441,0.00077106943,0.0013527786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002365135,0.00007261916,0.0014019572,0.00043611904,0.00004811217,0.00049005495,0.00040267405,0.73043275,0.05415874,0.14363872,0.0040450655,0.0646366],"study_design_scores_gemma":[0.0000306906,0.000073524345,0.00024257912,0.000031212905,0.000030018939,0.00014172013,0.000041432297,0.950452,0.009854929,0.0082934685,0.03078846,0.000019858495],"about_ca_topic_score_codex":0.004811773,"about_ca_topic_score_gemma":0.00401391,"teacher_disagreement_score":0.004811773,"about_ca_system_score_codex":0.0007329772,"about_ca_system_score_gemma":0.0014846256,"threshold_uncertainty_score":0.013477862},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044655997,0.000619902,0.86568207,0.0001677688,0.00028697983,0.00019933244,0.0010644024,0.072315,0.015008641],"genre_scores_gemma":[0.23096775,0.0006838375,0.73828125,0.00019691778,0.00013299621,0.0004508733,0.00375988,0.016342746,0.009183748],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855644,0.00020495414,0.00010939126,0.00024969227,0.0006877932,0.00019172287],"domain_scores_gemma":[0.9959078,0.0016599117,0.00030131073,0.00081952807,0.0011851902,0.00012631652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001085191,0.0011570161,0.00082971295,0.0010014576,0.00054505316,0.0012330584,0.0015693449,0.00040080128,0.0073382333],"category_scores_gemma":[0.0065059313,0.00061728625,0.0010036075,0.00061844103,0.00056716724,0.0009836392,0.0011440989,0.0010026362,0.0037432169],"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.0007046497,0.00026598715,0.008106126,0.0018808623,0.00022853957,0.0011973436,0.001129301,0.2635615,0.112684585,0.037384663,0.041646488,0.53120995],"study_design_scores_gemma":[0.00019032648,0.00046303822,0.0037236072,0.0003121195,0.000116105395,0.0007615499,0.00017569266,0.67006725,0.204873,0.018685939,0.10051156,0.000119822726],"about_ca_topic_score_codex":0.0011379811,"about_ca_topic_score_gemma":0.0014943329,"teacher_disagreement_score":0.0073382333,"about_ca_system_score_codex":0.00059559493,"about_ca_system_score_gemma":0.0016521622,"threshold_uncertainty_score":0.024548829},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037045542,0.000301042,0.939366,0.00031171503,0.00013776228,0.00012977485,0.00030734306,0.011249461,0.011151341],"genre_scores_gemma":[0.13501033,0.00025830703,0.8566103,0.00010604085,0.000026765596,0.0001326359,0.0009727965,0.00088912237,0.00599378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954814,0.00008020907,0.000026211143,0.00005688641,0.00023685498,0.000051605835],"domain_scores_gemma":[0.99925655,0.00020828197,0.000047486203,0.00019403354,0.00024798294,0.00004557162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047288617,0.00097453076,0.00063043146,0.0005331051,0.0005535534,0.0010261441,0.0012574261,0.0005112742,0.011311765],"category_scores_gemma":[0.0019339131,0.0003598831,0.00048821187,0.00093092833,0.0004362508,0.0011877691,0.0009538625,0.0012529965,0.0030758535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074553234,0.00034006595,0.0039872546,0.00057846174,0.0001194868,0.0005680507,0.00064146833,0.23410964,0.14786169,0.05063161,0.045803104,0.5146136],"study_design_scores_gemma":[0.00006418322,0.00007232552,0.00031057541,0.000026383406,0.000008334917,0.000067755194,0.00005589129,0.9525137,0.02858727,0.0042987126,0.013977495,0.000017358938],"about_ca_topic_score_codex":0.007451472,"about_ca_topic_score_gemma":0.016009402,"teacher_disagreement_score":0.011311765,"about_ca_system_score_codex":0.0007899032,"about_ca_system_score_gemma":0.0016338838,"threshold_uncertainty_score":0.037841618},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9097664,0.0015338139,0.07054094,0.00042202175,0.000055549604,0.000055513854,0.0003606925,0.0026771666,0.014587909],"genre_scores_gemma":[0.97418773,0.00046592936,0.02160733,0.00012389166,0.000017216697,0.000027505068,0.0002350125,0.00016239037,0.0031729657],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998186,0.000015096728,0.00000914244,0.000036350946,0.00006366862,0.000057135352],"domain_scores_gemma":[0.9996402,0.00010939663,0.000086459426,0.00005305434,0.0000937137,0.000017184451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012714059,0.00043610818,0.0002858832,0.0003847059,0.00030295175,0.0004957483,0.0011245452,0.0003075407,0.002391228],"category_scores_gemma":[0.00055002334,0.0001926951,0.00028724052,0.0006652882,0.00016547991,0.0011975556,0.00023768128,0.00027913108,0.00051204284],"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.0005916288,0.00029026286,0.009385934,0.00047696923,0.000098561744,0.00042860492,0.00021618366,0.14449486,0.65586007,0.0050885864,0.0049507944,0.17811748],"study_design_scores_gemma":[0.000105252846,0.0013309777,0.006561149,0.000044677457,0.00018087417,0.00041358746,0.00011140658,0.30516237,0.67368704,0.001231412,0.011117399,0.000053855954],"about_ca_topic_score_codex":0.001782646,"about_ca_topic_score_gemma":0.0041552293,"teacher_disagreement_score":0.002391228,"about_ca_system_score_codex":0.0005929543,"about_ca_system_score_gemma":0.00054394174,"threshold_uncertainty_score":0.00799942},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022265526,0.21049768,0.15449242,0.07473624,0.0032884416,0.00067799404,0.00023479544,0.00020874418,0.5335981],"genre_scores_gemma":[0.43756932,0.30925906,0.19266503,0.009056369,0.0018685901,0.004191693,0.00041195794,0.00072459213,0.044253364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9466241,0.045940064,0.0018877491,0.0012279542,0.0031263328,0.0011939175],"domain_scores_gemma":[0.9270422,0.06265693,0.0019332281,0.0037964033,0.0031520885,0.001419232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.056859095,0.0015137272,0.0016818239,0.009924848,0.007024985,0.025689958,0.0028260145,0.0036306283,0.0046837092],"category_scores_gemma":[0.03223257,0.0010974063,0.0010127235,0.020818181,0.031181067,0.02303705,0.0143444585,0.00698018,0.000643673],"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.000021718679,0.00006497872,0.0023331048,0.0016029065,0.00007430915,0.00043290792,0.18652691,0.00045626183,0.00028016663,0.69683355,0.009733628,0.101639636],"study_design_scores_gemma":[0.000013170717,0.000047954298,0.0026610834,0.006679345,0.000051921423,0.0012841371,0.34849802,0.0005873254,0.00036208628,0.19410144,0.44568166,0.00003188303],"about_ca_topic_score_codex":0.0038521837,"about_ca_topic_score_gemma":0.0059398753,"teacher_disagreement_score":0.056859095,"about_ca_system_score_codex":0.0092103975,"about_ca_system_score_gemma":0.008819812,"threshold_uncertainty_score":0.30070323},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017434449,0.00024843874,0.9666004,0.00039021324,0.0004313757,0.0001682785,0.00086202676,0.016638923,0.012916852],"genre_scores_gemma":[0.046301194,0.00044785664,0.92211455,0.00022054317,0.00034282685,0.00051117816,0.002279224,0.0046029673,0.023179708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984804,0.0002979982,0.00007817752,0.00020265914,0.00077077985,0.0001699979],"domain_scores_gemma":[0.99813396,0.0004012891,0.000076603465,0.00072716747,0.00049907237,0.00016192475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021272767,0.0014077867,0.0015389008,0.0021805386,0.0017493956,0.0029957017,0.00466309,0.0015638191,0.03802092],"category_scores_gemma":[0.006577727,0.0009309674,0.0016984418,0.0018463728,0.0010189596,0.0029586004,0.0030218328,0.0023388937,0.013446809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044322317,0.00018761361,0.0011741668,0.000809814,0.00011638206,0.0003844489,0.00022782634,0.059327133,0.009524362,0.28829965,0.20261122,0.43689424],"study_design_scores_gemma":[0.00020022142,0.00006214833,0.00035665117,0.000079506055,0.000044531487,0.00029643739,0.00003983696,0.47635427,0.013646387,0.2452297,0.2636197,0.000070614406],"about_ca_topic_score_codex":0.0019603905,"about_ca_topic_score_gemma":0.0030760758,"teacher_disagreement_score":0.03802092,"about_ca_system_score_codex":0.0008783249,"about_ca_system_score_gemma":0.0016940281,"threshold_uncertainty_score":0.12719262},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9444321,0.0008755304,0.0011862206,0.007863315,0.00008617999,0.00007652854,0.00009591042,0.000020286245,0.045364056],"genre_scores_gemma":[0.9962835,0.00035835154,0.00034327008,0.0004664056,0.000006113069,0.000010760393,0.000035505353,0.000010221934,0.0024860215],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9926081,0.002590626,0.00020357574,0.0006293126,0.0022370492,0.001731498],"domain_scores_gemma":[0.98317736,0.007365248,0.0013911655,0.0009859866,0.004625274,0.0024549984],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.013318386,0.0005452806,0.0004538573,0.005147099,0.036008827,0.01269481,0.0020032017,0.0020655056,0.004236364],"category_scores_gemma":[0.023161864,0.0005623732,0.00053323293,0.004483819,0.026267324,0.004132922,0.008192194,0.004567386,0.00022795484],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","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.00004735405,0.000021125954,0.0151073225,0.000049920916,0.0000078888415,0.00043614296,0.9629597,0.000058932954,0.00050039316,0.009975717,0.0016564883,0.009179025],"study_design_scores_gemma":[0.000006159027,0.000024668647,0.010934027,0.00011477431,0.000012845871,0.00011592087,0.96050215,0.0002084223,0.00020020068,0.0013792536,0.026447633,0.000053967266],"about_ca_topic_score_codex":0.9386473,"about_ca_topic_score_gemma":0.94351566,"teacher_disagreement_score":0.96399117,"about_ca_system_score_codex":0.0717442,"about_ca_system_score_gemma":0.07536706,"threshold_uncertainty_score":0.5205431},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022586541,0.0011081381,0.93335027,0.0007370104,0.0006761159,0.00008756714,0.00029173214,0.003912025,0.037250597],"genre_scores_gemma":[0.2791355,0.0016274675,0.6888987,0.0008429834,0.0006361352,0.00035061207,0.00079247024,0.00087586587,0.026840258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931264,0.00012410354,0.00006955426,0.00009991428,0.0003119418,0.00008178442],"domain_scores_gemma":[0.99892753,0.00030022243,0.00009506304,0.00024418923,0.0003759581,0.000057055855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043371998,0.0008455857,0.00037464596,0.00064783276,0.00049817533,0.0013837906,0.001082905,0.00036340105,0.016669542],"category_scores_gemma":[0.0032526986,0.00030215448,0.00052011554,0.001135927,0.0006535362,0.0023484274,0.0011278463,0.0013769554,0.004765133],"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.00066022284,0.0001651702,0.0012336447,0.0005316476,0.0000545628,0.00023676241,0.00024889322,0.054075606,0.05381034,0.43141258,0.032878827,0.42469183],"study_design_scores_gemma":[0.00020939343,0.001048411,0.0007771397,0.00022111525,0.00009059203,0.0007021314,0.00019711198,0.38762426,0.08404277,0.30759653,0.217404,0.000086529384],"about_ca_topic_score_codex":0.0007095149,"about_ca_topic_score_gemma":0.0018971259,"teacher_disagreement_score":0.016669542,"about_ca_system_score_codex":0.00074027485,"about_ca_system_score_gemma":0.00091902906,"threshold_uncertainty_score":0.055765152},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15681784,0.0020845628,0.6889113,0.0005193868,0.00049360987,0.00083036086,0.0014451771,0.03218308,0.11671464],"genre_scores_gemma":[0.61564463,0.00053671515,0.33927906,0.0003783185,0.00006901009,0.00038462997,0.0014543982,0.0006260511,0.041627243],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99976236,0.000020816822,0.000016415263,0.000040214156,0.00012151571,0.000038630486],"domain_scores_gemma":[0.9998702,0.000015435118,0.000012396529,0.000029382612,0.000060828213,0.0000118241705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016226908,0.00038072473,0.00023316141,0.00040706736,0.00025055077,0.0005393167,0.0010713561,0.00026861034,0.009348862],"category_scores_gemma":[0.0003127619,0.00016818527,0.00014143523,0.00036020714,0.00013085961,0.00046971426,0.00024796327,0.00038876836,0.0020659291],"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.0006417077,0.00030367344,0.003341654,0.0007987933,0.00009905092,0.0006666916,0.0002279413,0.08339098,0.31049666,0.03913075,0.05660351,0.5042986],"study_design_scores_gemma":[0.00027693837,0.0009744085,0.0025108075,0.00009512261,0.00007927224,0.00076500844,0.00008067087,0.33663577,0.40684667,0.0034861767,0.24817427,0.00007489208],"about_ca_topic_score_codex":0.0016701197,"about_ca_topic_score_gemma":0.0023939598,"teacher_disagreement_score":0.009348862,"about_ca_system_score_codex":0.0006935582,"about_ca_system_score_gemma":0.0006888565,"threshold_uncertainty_score":0.031275094},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94424593,0.00040356725,0.03594327,0.00034434503,0.0002779552,0.00012938044,0.0009066842,0.0011183587,0.016630562],"genre_scores_gemma":[0.98972553,0.0001417977,0.007797807,0.00007134029,0.000026084183,0.000025786634,0.00021674274,0.000026746486,0.0019681142],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997271,0.000013330847,0.000012986694,0.000049256334,0.0001320396,0.00006528722],"domain_scores_gemma":[0.99960715,0.00010138332,0.000051875002,0.000040306313,0.000107874024,0.00009148674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025656476,0.00031603384,0.00021460539,0.0015922566,0.0006734957,0.0011961415,0.00039947694,0.0007352322,0.002493968],"category_scores_gemma":[0.000853525,0.0002172211,0.0002798004,0.0007040439,0.0005856823,0.0006604984,0.00058319763,0.0005552997,0.00032929485],"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.0013033221,0.00041395775,0.020647246,0.00036559734,0.000043030574,0.0005508851,0.00087530946,0.019876573,0.8294101,0.0048427526,0.0042749923,0.11739623],"study_design_scores_gemma":[0.00029619882,0.0011113925,0.2219402,0.00014166565,0.00009796119,0.00067761936,0.0014602182,0.30702722,0.4496194,0.0042939447,0.013088869,0.00024526642],"about_ca_topic_score_codex":0.0047767498,"about_ca_topic_score_gemma":0.0041710604,"teacher_disagreement_score":0.0047767498,"about_ca_system_score_codex":0.0006575568,"about_ca_system_score_gemma":0.00041860147,"threshold_uncertainty_score":0.009497881},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80760354,0.0037646964,0.0013650265,0.03531304,0.00023626165,0.00005823776,0.000062809,0.000029488645,0.15156688],"genre_scores_gemma":[0.98380405,0.0014926142,0.00034262924,0.0007448306,0.000018425355,0.000019760848,0.000015800253,0.0000076004453,0.013554333],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991654,0.00037494165,0.000019165629,0.000060325652,0.00008234867,0.00029781155],"domain_scores_gemma":[0.99907255,0.00032764068,0.00011264712,0.000048278267,0.00014714038,0.00029173002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016286334,0.00018230993,0.00020808062,0.000528756,0.0056043253,0.005387628,0.00072533434,0.0010649565,0.005271273],"category_scores_gemma":[0.00216225,0.00016578281,0.00017899775,0.0009093627,0.0060332874,0.0023972655,0.0053892657,0.001549326,0.00025462863],"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.000034274977,0.0000645945,0.024230162,0.0003221515,0.000012733953,0.0010822347,0.78275436,0.00015962566,0.0012444785,0.12896515,0.00363245,0.057497706],"study_design_scores_gemma":[0.0000057990237,0.000043204123,0.017128712,0.0003878923,0.000023202423,0.00017537632,0.7709208,0.00013500743,0.00028759203,0.006763485,0.20411666,0.000012215406],"about_ca_topic_score_codex":0.07254921,"about_ca_topic_score_gemma":0.255495,"teacher_disagreement_score":0.07254921,"about_ca_system_score_codex":0.0049236626,"about_ca_system_score_gemma":0.010629981,"threshold_uncertainty_score":0.14425391},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9885301,0.00019215948,0.0013287904,0.00044392076,0.000009774833,0.00016765244,0.00026369694,0.000014968815,0.009049012],"genre_scores_gemma":[0.99791986,0.00013151276,0.0013098905,0.00002595611,0.000007684275,0.000037884853,0.00016070403,0.000002189342,0.00040423978],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.993277,0.0031663538,0.000805161,0.00036577307,0.001968361,0.00041727745],"domain_scores_gemma":[0.8873758,0.07560302,0.019772299,0.0045104767,0.010863865,0.0018745887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00988348,0.00031408295,0.00031772954,0.0036937864,0.001262618,0.004099873,0.00085982593,0.0007729878,0.0065170634],"category_scores_gemma":[0.073830545,0.0002159663,0.0004160215,0.0054141595,0.001394466,0.0045117326,0.0016646866,0.0014753592,0.0005998405],"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.00023071274,0.0017003169,0.8906366,0.0003424943,0.00007615838,0.0004559895,0.0059818747,0.0038032464,0.00034875813,0.013954716,0.001814218,0.08065491],"study_design_scores_gemma":[0.00003067032,0.00056170666,0.90263474,0.00053043617,0.00023113152,0.0005095371,0.03268125,0.043734144,0.0019413738,0.0066449014,0.010416895,0.00008329087],"about_ca_topic_score_codex":0.012030684,"about_ca_topic_score_gemma":0.0116964765,"teacher_disagreement_score":0.012030684,"about_ca_system_score_codex":0.0030528537,"about_ca_system_score_gemma":0.0042861397,"threshold_uncertainty_score":0.05226946},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22858329,0.016856914,0.0037470486,0.1758398,0.009890402,0.00010752406,0.0004605936,0.00029601634,0.56421846],"genre_scores_gemma":[0.66299415,0.004437844,0.00057792274,0.025376916,0.0009504204,0.000058149275,0.00019110159,0.00029013617,0.30512345],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981749,0.00077501236,0.000021706488,0.000118051306,0.0002951726,0.0006151104],"domain_scores_gemma":[0.99891186,0.00017120072,0.00006634138,0.00004708631,0.00017477908,0.00062872755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008518013,0.0010635098,0.00036908226,0.00050357985,0.035241287,0.009610541,0.0010604913,0.0027617654,0.010751958],"category_scores_gemma":[0.0025264372,0.0003617221,0.00027789766,0.0005779656,0.01597373,0.005043167,0.0063938224,0.009281,0.002570225],"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.00009019526,0.00004173489,0.0014689035,0.00006641062,0.000016061058,0.0020771765,0.6727271,0.00007935359,0.0005213054,0.03711194,0.27107024,0.014729619],"study_design_scores_gemma":[0.000005140126,0.000018435345,0.0010073568,0.00013483067,0.000008271345,0.0006690225,0.37843457,0.000046161847,0.00024992513,0.0012321831,0.6181706,0.000023533157],"about_ca_topic_score_codex":0.17274022,"about_ca_topic_score_gemma":0.31103885,"teacher_disagreement_score":0.17274022,"about_ca_system_score_codex":0.0076220613,"about_ca_system_score_gemma":0.0052883527,"threshold_uncertainty_score":0.3434695},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004414365,0.0012302543,0.0013770076,0.0067291292,0.0015554295,0.00014948714,0.019305704,0.0030691337,0.96216947],"genre_scores_gemma":[0.006892744,0.00047321751,0.00079331594,0.0003758221,0.000054270928,0.000015631325,0.0043148855,0.00041729488,0.9866629],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99902534,0.00002438867,0.00000997941,0.00006801043,0.0006477545,0.00022451907],"domain_scores_gemma":[0.99840707,0.000038617174,0.000026605387,0.00008345168,0.0009977972,0.00044654476],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005901468,0.0011034076,0.00066425896,0.0018886809,0.0032503852,0.0041088676,0.0013607654,0.0018492346,0.40303764],"category_scores_gemma":[0.0015006899,0.0005011707,0.0007211348,0.0020144158,0.0009686895,0.0010383046,0.0015985577,0.0018509905,0.14281577],"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.000072503964,0.000044793855,0.00036445446,0.00004772676,0.0000077145805,0.00003456809,0.000014965165,0.00024072756,0.00029768725,0.0041382494,0.9581987,0.036537945],"study_design_scores_gemma":[0.000030514655,0.000015990723,0.001345017,0.000028932936,0.0000052955565,0.000029362845,0.000081124,0.00057018595,0.0003704742,0.0009794423,0.9965339,0.000009784316],"about_ca_topic_score_codex":0.839703,"about_ca_topic_score_gemma":0.9321817,"teacher_disagreement_score":0.40303764,"about_ca_system_score_codex":0.01325277,"about_ca_system_score_gemma":0.033084664,"threshold_uncertainty_score":0.8514944},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99883634,0.00014478639,0.00022246901,0.000007642725,0.0000015791641,0.000016545688,0.0005155822,0.0000038686258,0.00025126597],"genre_scores_gemma":[0.9983637,0.00009639592,0.00034080542,0.000004772915,0.000002915455,0.0000184248,0.0010152601,0.0000017643728,0.00015599385],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99918324,0.00018308184,0.00015078395,0.00022677443,0.000117960684,0.00013813273],"domain_scores_gemma":[0.99842155,0.00036731252,0.0008310246,0.00007376276,0.00018738834,0.00011906426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008267085,0.00019358678,0.00031255712,0.0016801385,0.0001870631,0.00050939486,0.00035339178,0.00029226145,0.0007172795],"category_scores_gemma":[0.0017786117,0.00017334239,0.00030164758,0.0016899703,0.00020579773,0.00038948166,0.0005387777,0.00018341746,0.00018026281],"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.00013239801,0.00001788333,0.9963134,0.00001966452,0.000020521904,0.00008745501,0.00022864221,0.00006250163,0.00042395454,0.0000068437957,0.000040645114,0.002646163],"study_design_scores_gemma":[0.0000012983168,0.00007448947,0.9988292,0.000005064153,0.000009135449,0.0001707898,0.00049366633,0.00018874876,0.00009329236,0.0000066308153,0.00012446783,0.0000033267922],"about_ca_topic_score_codex":0.004221958,"about_ca_topic_score_gemma":0.008624113,"teacher_disagreement_score":0.004221958,"about_ca_system_score_codex":0.00034341737,"about_ca_system_score_gemma":0.00030131533,"threshold_uncertainty_score":0.008394718},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039030515,0.0013465204,0.89549196,0.0017932806,0.00040435506,0.00031962295,0.0013345098,0.019278118,0.041001126],"genre_scores_gemma":[0.51495975,0.0013132704,0.40725383,0.000550053,0.00021465473,0.0004797963,0.0035577468,0.0022906836,0.069380134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954222,0.0010213517,0.00023591776,0.000927332,0.001750453,0.0006428083],"domain_scores_gemma":[0.9920223,0.0018788889,0.00053531275,0.0037870137,0.0014290977,0.00034730902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024322753,0.0009745149,0.0008350461,0.0035849104,0.0020079566,0.0052565597,0.0021367276,0.0012721684,0.0076726894],"category_scores_gemma":[0.010517994,0.0007375347,0.0007423886,0.0034584615,0.0012713918,0.006123524,0.0040310286,0.0016676068,0.0038119687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060302793,0.0002570925,0.011195618,0.0003022419,0.00009225861,0.00046083116,0.0015971132,0.026475731,0.023623668,0.16375399,0.0230889,0.7485495],"study_design_scores_gemma":[0.000070122296,0.00029615054,0.0066358275,0.0002707009,0.00015682963,0.0014716561,0.0011126015,0.38013273,0.11359632,0.18163368,0.31443456,0.0001888862],"about_ca_topic_score_codex":0.0071140924,"about_ca_topic_score_gemma":0.008878103,"teacher_disagreement_score":0.0076726894,"about_ca_system_score_codex":0.002302428,"about_ca_system_score_gemma":0.0031205276,"threshold_uncertainty_score":0.025667727},"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":"dataset","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006205239,0.001230943,0.00078227266,0.0154482145,0.002327595,0.00053556886,0.50626564,0.0017387286,0.46546572],"genre_scores_gemma":[0.019052396,0.0020300862,0.0014194795,0.005612025,0.0010099772,0.0012493123,0.15647502,0.000514248,0.8126374],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896955,0.000074507756,0.00006647365,0.00008095781,0.0005581195,0.00025042478],"domain_scores_gemma":[0.99622154,0.00030120424,0.00034725099,0.00015251455,0.00209311,0.0008843152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014622019,0.0005306423,0.00032717732,0.00234151,0.0015822923,0.0017282163,0.001153804,0.0015021826,0.2542823],"category_scores_gemma":[0.006867449,0.0005466708,0.000291504,0.0025556085,0.00020650259,0.00126222,0.0015269723,0.0012199339,0.105558805],"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.000011348848,0.000014508254,0.0005673244,0.000017871704,7.3935985e-7,0.0000050088715,0.000013478336,0.000018615241,0.000013102967,0.0002873154,0.99308527,0.00596537],"study_design_scores_gemma":[0.000034532794,0.000024854233,0.02870373,0.00011444479,0.0000041712597,0.000024381694,0.00017191605,0.000081610175,0.00010415985,0.0002517268,0.97047496,0.000009513361],"about_ca_topic_score_codex":0.14488797,"about_ca_topic_score_gemma":0.3193094,"teacher_disagreement_score":0.2542823,"about_ca_system_score_codex":0.0029913296,"about_ca_system_score_gemma":0.007087762,"threshold_uncertainty_score":0.850659},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8060326,0.019022163,0.00038690958,0.023950944,0.00041271865,0.000079060825,0.0020468063,0.00003824488,0.14803062],"genre_scores_gemma":[0.94733554,0.004318743,0.00026774913,0.0019446653,0.000053196472,0.000049601305,0.00037515428,0.0000143209545,0.045641042],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935323,0.000094356605,0.000015324787,0.00007024028,0.00018193782,0.0002848478],"domain_scores_gemma":[0.99909437,0.00016490447,0.00010778271,0.000027007036,0.00031029392,0.0002956666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062085415,0.00015866011,0.00022184219,0.0012909761,0.012882944,0.0030715666,0.0010628094,0.0008988197,0.006302098],"category_scores_gemma":[0.0013361883,0.00015120361,0.00016096121,0.0035985368,0.0053535067,0.0013362227,0.0012634143,0.0014020649,0.00019851289],"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.00016082727,0.00028118945,0.20796865,0.0004686073,0.00011361579,0.002439174,0.33884838,0.0018494969,0.0012998293,0.11599285,0.112315,0.2182624],"study_design_scores_gemma":[0.000012911006,0.000048734553,0.36397278,0.00031602633,0.000019658568,0.00025825313,0.09899459,0.0003384149,0.00017352986,0.0020117878,0.53379065,0.000062735584],"about_ca_topic_score_codex":0.9956234,"about_ca_topic_score_gemma":0.998722,"teacher_disagreement_score":0.11750685,"about_ca_system_score_codex":0.11750685,"about_ca_system_score_gemma":0.05779499,"threshold_uncertainty_score":0.85257584},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019295369,0.0040790094,0.005417936,0.0076692337,0.0047925264,0.00017748699,0.015101668,0.007863865,0.9529687],"genre_scores_gemma":[0.004536707,0.0010984235,0.0015379898,0.0006551678,0.0003322183,0.000048559185,0.0065467316,0.001719201,0.9835249],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988739,0.000096793105,0.000038906994,0.00017119436,0.0005701363,0.00024903976],"domain_scores_gemma":[0.99613154,0.00024310201,0.00013229811,0.00051058206,0.001782312,0.0012001648],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016278109,0.0008635148,0.00048951077,0.0025563256,0.00290499,0.009647752,0.0012932597,0.0019926822,0.39754236],"category_scores_gemma":[0.0045272647,0.00040173563,0.0005031792,0.0024848222,0.001173022,0.004323489,0.0033122983,0.0022526958,0.26285774],"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.00006243481,0.000024769168,0.00043126472,0.0001403799,0.0000060865236,0.00007936337,0.00020190795,0.00009937485,0.0009416324,0.018415311,0.8906105,0.0889869],"study_design_scores_gemma":[0.000002170659,0.0000029683881,0.00029849468,0.00003466512,9.067277e-7,0.000018991206,0.000043064534,0.000052079522,0.00016250448,0.0004095276,0.9989705,0.0000041246512],"about_ca_topic_score_codex":0.19593045,"about_ca_topic_score_gemma":0.34167236,"teacher_disagreement_score":0.60245764,"about_ca_system_score_codex":0.00610405,"about_ca_system_score_gemma":0.008506905,"threshold_uncertainty_score":0.8593327},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06801413,0.032259904,0.009001372,0.48765483,0.026495054,0.0005530692,0.0022037823,0.00043136484,0.3733865],"genre_scores_gemma":[0.20606111,0.010171694,0.0049630203,0.032956928,0.00065704715,0.00023975645,0.0005140649,0.00023620106,0.74420017],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9886614,0.002649379,0.00033255274,0.0014882318,0.0029904465,0.0038780333],"domain_scores_gemma":[0.9788255,0.002475598,0.00092003884,0.0008954798,0.006688314,0.010195081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008695594,0.0011221728,0.0009047549,0.001570425,0.019522123,0.0135926185,0.0023968962,0.006505339,0.03944469],"category_scores_gemma":[0.011407595,0.0012572124,0.0012463115,0.0017529491,0.012077299,0.0053411378,0.008142531,0.010837928,0.0068591316],"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.0004070013,0.00016635314,0.017392064,0.0010006293,0.00011357127,0.0009818117,0.05651917,0.0006415489,0.0032923808,0.2479312,0.58516264,0.08639164],"study_design_scores_gemma":[0.00001869939,0.00006135651,0.010473629,0.00043639372,0.00003232749,0.0001099283,0.013031361,0.0000727214,0.0008101362,0.0017517359,0.97310793,0.00009375294],"about_ca_topic_score_codex":0.8029513,"about_ca_topic_score_gemma":0.9331315,"teacher_disagreement_score":0.8029513,"about_ca_system_score_codex":0.0589925,"about_ca_system_score_gemma":0.1673423,"threshold_uncertainty_score":0.42802256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005218375,0.0077264076,0.00076053594,0.06704006,0.0025677537,0.00010352124,0.0010475196,0.00017091857,0.915365],"genre_scores_gemma":[0.019366266,0.0012184791,0.0004520609,0.011417143,0.0001437767,0.00003911065,0.00013290325,0.00004878627,0.9671815],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99834096,0.00016070239,0.000031560245,0.00015781628,0.00067180133,0.0006371069],"domain_scores_gemma":[0.9984149,0.00015985462,0.00004280039,0.00013770648,0.0006436411,0.0006010574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011372106,0.0005050665,0.000428403,0.000864904,0.014894464,0.006954809,0.00095430843,0.0076346844,0.11696685],"category_scores_gemma":[0.004248404,0.00038158626,0.00045924375,0.0013070368,0.002606378,0.0021341252,0.002411223,0.006710449,0.0147112],"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.000018334295,0.000038558323,0.0013639965,0.00003282811,0.000004049123,0.00014861682,0.0008876745,0.00007598767,0.00009328628,0.097598,0.8591462,0.040592525],"study_design_scores_gemma":[0.0000111076015,0.000008130023,0.0032032558,0.00010004835,0.0000057532025,0.00007276056,0.0008958186,0.000055000597,0.00009463006,0.0031419734,0.9923969,0.000014701702],"about_ca_topic_score_codex":0.9080804,"about_ca_topic_score_gemma":0.9750021,"teacher_disagreement_score":0.11696685,"about_ca_system_score_codex":0.016144896,"about_ca_system_score_gemma":0.043665476,"threshold_uncertainty_score":0.39129305},"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":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07742614,0.46242395,0.017411407,0.10949852,0.011354745,0.0034956122,0.019793129,0.00089487276,0.29770163],"genre_scores_gemma":[0.55844784,0.28938752,0.048056416,0.021857295,0.004267078,0.004590609,0.013259661,0.00033586414,0.059797738],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98627627,0.0062626866,0.0019607157,0.0010230021,0.0035418244,0.00093550904],"domain_scores_gemma":[0.9582278,0.0151076075,0.0061701224,0.0025424138,0.012749889,0.0052022496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017577337,0.00077946595,0.001376423,0.009806927,0.003060238,0.0043121916,0.001326674,0.0019726108,0.024251627],"category_scores_gemma":[0.037389684,0.00048645452,0.0013602582,0.011652714,0.0020953843,0.0024685066,0.0030257124,0.0019172098,0.0029503217],"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.000690042,0.00041614278,0.074647486,0.028174318,0.0006651589,0.0016961801,0.007622416,0.00065944495,0.001635732,0.0805504,0.1426158,0.6606269],"study_design_scores_gemma":[0.00019724501,0.00045408058,0.12992495,0.017425817,0.00062696415,0.00332347,0.00519415,0.00038928457,0.0008656421,0.012033838,0.8293923,0.00017232753],"about_ca_topic_score_codex":0.048269134,"about_ca_topic_score_gemma":0.06532135,"teacher_disagreement_score":0.048269134,"about_ca_system_score_codex":0.0047910046,"about_ca_system_score_gemma":0.032209743,"threshold_uncertainty_score":0.09597635},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024842046,0.9845449,0.00019248508,0.0033170967,0.004831784,0.0000042189445,0.000025161436,0.0000100550915,0.0068259626],"genre_scores_gemma":[0.0040509123,0.9744106,0.0002868185,0.0027441555,0.006957776,0.000011335349,0.00007715517,0.000029669442,0.011431508],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99957603,0.00009496196,0.000038116013,0.00007485834,0.00017675316,0.00003931376],"domain_scores_gemma":[0.9982572,0.00074524997,0.00013487828,0.00006278671,0.00067682733,0.00012298248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007192625,0.0005771137,0.0007899605,0.0022026529,0.00094839,0.002587493,0.00072288804,0.0011973873,0.006068283],"category_scores_gemma":[0.0026623167,0.00038187118,0.00028783182,0.004755938,0.0018375288,0.0015992031,0.00066435325,0.0018995997,0.0028156424],"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.000035585777,0.00002240804,0.00021539461,0.0059093144,0.000030202611,0.00019764145,0.00053925044,0.00039696423,0.00036067783,0.013535572,0.5815775,0.3971795],"study_design_scores_gemma":[0.000001150921,0.000008471525,0.00040822764,0.0013248619,0.000005097792,0.00019245443,0.000109890694,0.000023413551,0.00005383969,0.0003454588,0.99752134,0.0000057679013],"about_ca_topic_score_codex":0.016520366,"about_ca_topic_score_gemma":0.026043767,"teacher_disagreement_score":0.016520366,"about_ca_system_score_codex":0.0023498468,"about_ca_system_score_gemma":0.0031724263,"threshold_uncertainty_score":0.032848418},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006956415,0.99550843,0.00021341379,0.0007798881,0.00029701344,0.00050855643,0.0003013836,0.000007901625,0.0016878091],"genre_scores_gemma":[0.0050106994,0.99308383,0.00045924672,0.0005129694,0.00009226407,0.000442797,0.00019198975,0.000004988167,0.00020121426],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.9846726,0.004567165,0.0057697003,0.0007075386,0.0037944624,0.00048853626],"domain_scores_gemma":[0.91081303,0.06451961,0.0094978735,0.0013501833,0.013015934,0.00080336456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015373568,0.0014790172,0.0039744307,0.022675566,0.0019919635,0.0051120673,0.0022744634,0.0031073682,0.006679522],"category_scores_gemma":[0.09080762,0.0012373786,0.0038000783,0.029231112,0.0021901077,0.0029651173,0.0026213476,0.0016903317,0.0007501249],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007788954,0.000028767372,0.0006607866,0.8816907,0.0013988472,0.00024681678,0.001306372,0.00015114264,0.00015965033,0.0011089281,0.0071104486,0.10605962],"study_design_scores_gemma":[0.000015717977,0.000031706644,0.0010442081,0.9645129,0.0024539372,0.00016821014,0.00073747616,0.000023534596,0.00007304831,0.00027080602,0.030655468,0.000013047397],"about_ca_topic_score_codex":0.03791248,"about_ca_topic_score_gemma":0.09845773,"teacher_disagreement_score":0.03791248,"about_ca_system_score_codex":0.0094382195,"about_ca_system_score_gemma":0.044120796,"threshold_uncertainty_score":0.08130419},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98024195,0.000518669,0.015645213,0.000035486024,0.000055252032,0.00007825363,0.00014939591,0.00034664903,0.0029291601],"genre_scores_gemma":[0.97747487,0.0003099371,0.01768726,0.000050320978,0.000011520042,0.000030566043,0.00026296047,0.00008936461,0.004083199],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998921,0.0000035607711,0.000007432419,0.000028465138,0.000046930898,0.00002149155],"domain_scores_gemma":[0.999877,0.00001958234,0.000032764114,0.000020471645,0.00003447391,0.00001571242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008740726,0.000287758,0.00033587712,0.00032838478,0.00008634117,0.00031836992,0.00024874776,0.00020437824,0.0012577807],"category_scores_gemma":[0.00017310883,0.00025423735,0.00030538358,0.0003880866,0.0001939918,0.00022159252,0.00019108335,0.00038822298,0.00047564728],"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.00002454061,0.000015841691,0.000102849226,0.000028963403,0.0000041287863,0.000039226106,0.000013533483,0.00020514335,0.99673116,0.000058046448,0.000042150183,0.0027343943],"study_design_scores_gemma":[0.000013598846,0.0001984667,0.0014964774,0.0000034707346,0.000009789232,0.000060424532,0.000012602487,0.0024843854,0.9948367,0.00002918205,0.00085246225,0.0000023541006],"about_ca_topic_score_codex":0.0005075841,"about_ca_topic_score_gemma":0.0014994714,"teacher_disagreement_score":0.0012577807,"about_ca_system_score_codex":0.00023020581,"about_ca_system_score_gemma":0.00013934239,"threshold_uncertainty_score":0.0042076707},"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":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009643529,0.9168329,0.004495841,0.02760947,0.0056675663,0.000013469995,0.00019848265,0.00019658527,0.044021256],"genre_scores_gemma":[0.034572683,0.7867563,0.0071239755,0.008329078,0.009153103,0.000074550546,0.00033606455,0.0004957187,0.1531586],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984774,0.00056556525,0.00006108437,0.00026810076,0.0005214263,0.000106456144],"domain_scores_gemma":[0.9987244,0.0007455663,0.00010280449,0.00006545322,0.00025953897,0.000102319056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016835002,0.0013014935,0.0009998807,0.002586548,0.0019334264,0.0033332712,0.0011796908,0.0017845673,0.02297645],"category_scores_gemma":[0.003204126,0.0005511259,0.0004402601,0.0024239467,0.0035844164,0.007304869,0.0012218859,0.0032220061,0.013051436],"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.00010097101,0.000025540185,0.00037275342,0.00086246594,0.000020585641,0.0002214284,0.0035472782,0.00028736488,0.00029977123,0.10656023,0.7495062,0.13819534],"study_design_scores_gemma":[0.0000036469482,0.00000556816,0.0003700395,0.00029419252,0.00000416884,0.00022798244,0.00046366965,0.00006290521,0.00016988652,0.012460294,0.9859265,0.000011219408],"about_ca_topic_score_codex":0.027570399,"about_ca_topic_score_gemma":0.050290663,"teacher_disagreement_score":0.027570399,"about_ca_system_score_codex":0.0034923358,"about_ca_system_score_gemma":0.003152335,"threshold_uncertainty_score":0.076863885},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99623495,0.001233101,0.000113142545,0.000014897581,0.000008568637,0.000012946588,0.0016322192,0.0000046210494,0.0007457427],"genre_scores_gemma":[0.99666506,0.0008497726,0.000112536756,0.00002717368,0.000007343372,0.00001016031,0.001992183,0.0000042092893,0.00033142985],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99928004,0.000044880537,0.00017528693,0.0002600633,0.00010906391,0.00013071441],"domain_scores_gemma":[0.99917346,0.000109553475,0.00040333517,0.00006702185,0.00011513319,0.00013145462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030558105,0.00025338045,0.00046755862,0.0016680752,0.0006390708,0.000852325,0.0005360939,0.00044363967,0.0015178778],"category_scores_gemma":[0.0009813224,0.00054177584,0.0006124796,0.0020691345,0.00044981085,0.00046366864,0.0009172785,0.00023679234,0.00037781312],"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.000057128906,0.00001005253,0.99613225,0.00005873089,0.000051527026,0.0015931685,0.00028977724,0.000056196397,0.0003425055,0.00003361989,0.00018727525,0.0011878135],"study_design_scores_gemma":[0.000004022228,0.000046334273,0.9902187,0.000078085926,0.00008360676,0.005644178,0.0017642085,0.000063367996,0.00016662301,0.000023615363,0.0018963845,0.000010939118],"about_ca_topic_score_codex":0.026541408,"about_ca_topic_score_gemma":0.04120087,"teacher_disagreement_score":0.026541408,"about_ca_system_score_codex":0.00078685273,"about_ca_system_score_gemma":0.001254619,"threshold_uncertainty_score":0.052773833},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52989554,0.009336497,0.00069514714,0.0058087343,0.001549156,0.000105599385,0.0048600533,0.000061641236,0.44768763],"genre_scores_gemma":[0.57097757,0.0044999155,0.00086318067,0.0010939102,0.00022094758,0.00008025095,0.0037993882,0.000058877704,0.41840592],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99982256,0.000016782233,0.0000057741986,0.000023878716,0.000050755487,0.00008033063],"domain_scores_gemma":[0.9998901,0.000013156817,0.000018465895,0.0000063748535,0.000041564672,0.000030233088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023385335,0.00024249767,0.00015721095,0.00059853354,0.0038238536,0.0011210083,0.00024049377,0.000632283,0.017437093],"category_scores_gemma":[0.00042577373,0.00017931071,0.00013386973,0.001092626,0.0008095487,0.00063769275,0.0012674249,0.0011776597,0.0026101437],"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.001366119,0.0002861544,0.17167191,0.0014021393,0.00006767618,0.0076525756,0.1826972,0.00031178226,0.0072885007,0.082506135,0.25209662,0.2926532],"study_design_scores_gemma":[0.000009998349,0.000052486776,0.20176408,0.00018090167,0.000007534572,0.00029759642,0.028955434,0.000020759267,0.0011505254,0.0004507581,0.7670972,0.000012739188],"about_ca_topic_score_codex":0.13397834,"about_ca_topic_score_gemma":0.44112659,"teacher_disagreement_score":0.13397834,"about_ca_system_score_codex":0.0030040944,"about_ca_system_score_gemma":0.0019843783,"threshold_uncertainty_score":0.266397},"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":"dataset","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073669055,0.0060194894,0.25531802,0.0018947215,0.0034925286,0.0018981813,0.40831882,0.049593583,0.26609778],"genre_scores_gemma":[0.035654526,0.004427422,0.25522932,0.0012248048,0.0008175428,0.002378525,0.5175278,0.038655546,0.14408456],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906904,0.00015341635,0.00022414871,0.0001633361,0.00034001222,0.000050071416],"domain_scores_gemma":[0.99812764,0.0005438903,0.000116920164,0.00037030823,0.0007083466,0.0001328703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012349678,0.0010641427,0.00089976355,0.006236585,0.0011784631,0.005295117,0.0014446849,0.0013095757,0.12792388],"category_scores_gemma":[0.0057840375,0.0007687459,0.0009605469,0.0059809447,0.0007804976,0.0042441594,0.0029458855,0.0017398769,0.06939465],"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.00035269785,0.00007875023,0.000689636,0.0034503678,0.000073014475,0.00051937,0.0015941996,0.0009806744,0.0067706103,0.044688374,0.66162056,0.27918166],"study_design_scores_gemma":[0.00002313814,0.00001115861,0.0006220693,0.00019204752,0.000009392308,0.0004030073,0.00012477406,0.00033504062,0.0010446557,0.0025493277,0.9946568,0.000028704522],"about_ca_topic_score_codex":0.010547781,"about_ca_topic_score_gemma":0.008479224,"teacher_disagreement_score":0.12792388,"about_ca_system_score_codex":0.0011419469,"about_ca_system_score_gemma":0.0024072232,"threshold_uncertainty_score":0.427948},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4638315,0.0051692002,0.0009977177,0.46082142,0.0015407441,0.000173811,0.003315208,0.00019218514,0.063958295],"genre_scores_gemma":[0.9251088,0.0064334767,0.0016995979,0.039971296,0.0005441288,0.000064817956,0.001831372,0.0000767826,0.02426969],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9985933,0.0001784085,0.000025087142,0.00003996668,0.00034704834,0.00081625034],"domain_scores_gemma":[0.9975673,0.00018876378,0.00017868524,0.000027228461,0.0006511562,0.0013867439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013912985,0.00024302029,0.00018655277,0.0010010283,0.0032343976,0.003510119,0.0014861553,0.0020319326,0.0060726935],"category_scores_gemma":[0.003175157,0.00016813108,0.00026173028,0.0016520238,0.001671047,0.0008996954,0.0019831134,0.002550626,0.0004587714],"study_design_candidate":"observational","study_design_consensus":"observational","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.00046249828,0.0005765097,0.38799888,0.00064549403,0.00015193882,0.0017493031,0.010848634,0.0064646336,0.0025443377,0.02990363,0.3699708,0.18868333],"study_design_scores_gemma":[0.0001051947,0.000210584,0.7547827,0.0006455132,0.000084616404,0.0002236336,0.0717319,0.0056881905,0.00056405476,0.0066989325,0.15916574,0.00009897161],"about_ca_topic_score_codex":0.95719683,"about_ca_topic_score_gemma":0.9822534,"teacher_disagreement_score":0.04280317,"about_ca_system_score_codex":0.031639375,"about_ca_system_score_gemma":0.07310048,"threshold_uncertainty_score":0.22956079},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99815947,0.00011599241,0.000079688565,0.00006458524,0.000003963323,0.000005196357,0.0005095637,0.0000114387085,0.0010501972],"genre_scores_gemma":[0.9982253,0.00014124672,0.00022022687,0.000029202862,0.000008204181,0.000011258889,0.0008063411,0.0000027409294,0.00055547064],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99981314,0.000015007989,0.000017752842,0.000048796464,0.000057860758,0.000047521215],"domain_scores_gemma":[0.99919754,0.000095741525,0.00037913446,0.000032726675,0.00019092188,0.00010386749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022466171,0.00012998174,0.00012488656,0.0013089497,0.0003510276,0.00048760843,0.00018312564,0.00026450856,0.0015109227],"category_scores_gemma":[0.0006990763,0.000110054614,0.00019894037,0.0010578069,0.00036400175,0.00037384516,0.00047551494,0.00024028818,0.0002469862],"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.00011738818,0.00003239731,0.9829033,0.000045166027,0.000043442455,0.00014663507,0.0011463477,0.0004097946,0.0055664657,0.00009898868,0.0005938689,0.008896187],"study_design_scores_gemma":[0.0000011477265,0.000018868688,0.9986755,0.000005052068,0.000004576153,0.000032177995,0.0006100941,0.0001761564,0.00013478563,0.000012822163,0.00032448952,0.0000041599687],"about_ca_topic_score_codex":0.073532246,"about_ca_topic_score_gemma":0.1174595,"teacher_disagreement_score":0.9264678,"about_ca_system_score_codex":0.00049854536,"about_ca_system_score_gemma":0.00036180348,"threshold_uncertainty_score":0.14620852},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05840283,0.00030683342,0.93531996,0.000058032634,0.000025254849,0.00008749732,0.0004787113,0.0032561496,0.002064739],"genre_scores_gemma":[0.44620705,0.0007586938,0.54767144,0.000055029588,0.000018651892,0.000121362005,0.0014836744,0.00044142292,0.0032426722],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993293,0.000039562754,0.000026147887,0.00012805307,0.00040594288,0.00007104751],"domain_scores_gemma":[0.9995253,0.000069105125,0.00007263597,0.000119570344,0.00019467485,0.000018686369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003636575,0.0010070701,0.0007915681,0.002203133,0.0002448439,0.0012221122,0.0008696201,0.0011544775,0.0027429147],"category_scores_gemma":[0.0009172737,0.0007355658,0.0013272939,0.00088671566,0.00029114625,0.00081976416,0.0008335059,0.00071841164,0.0018635083],"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.00021926188,0.00011835524,0.0063154167,0.0004415187,0.00013456168,0.00061998755,0.00020516642,0.11816149,0.48574987,0.003846219,0.0048676888,0.37932038],"study_design_scores_gemma":[0.000014682526,0.00009294026,0.00860501,0.000023987832,0.00004328484,0.00058478356,0.000118923985,0.8972431,0.087101735,0.0017120932,0.004389126,0.00007038337],"about_ca_topic_score_codex":0.003203948,"about_ca_topic_score_gemma":0.0042091315,"teacher_disagreement_score":0.003203948,"about_ca_system_score_codex":0.0005119924,"about_ca_system_score_gemma":0.0007861771,"threshold_uncertainty_score":0.009175956},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93769175,0.0023442758,0.001958981,0.008223507,0.00035649745,0.00013761187,0.0002705745,0.000025582065,0.048991125],"genre_scores_gemma":[0.97542125,0.00295983,0.0014055497,0.000914275,0.00008699634,0.000065688706,0.00009655522,0.000044507306,0.019005412],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9973284,0.001811967,0.00004099785,0.00012633119,0.00023990782,0.00045232518],"domain_scores_gemma":[0.9974247,0.0014262187,0.00022347418,0.00009551298,0.0001677962,0.00066237466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024214296,0.00061257184,0.00051841687,0.0015472001,0.019969832,0.0047320235,0.0021940742,0.0031798705,0.004336434],"category_scores_gemma":[0.0043898476,0.0004953022,0.000508976,0.0030297674,0.008850705,0.0024629226,0.0056094755,0.0034043787,0.00053864595],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013539717,0.00021889569,0.008096377,0.0003413217,0.000027051428,0.055755757,0.8967662,0.0007708252,0.00054245704,0.015304499,0.0089865085,0.013054752],"study_design_scores_gemma":[0.000004326989,0.0000351131,0.003158368,0.00012194548,0.0000071971886,0.0026177787,0.9577703,0.00019732112,0.00014509294,0.0009012175,0.035025008,0.000016333499],"about_ca_topic_score_codex":0.14399455,"about_ca_topic_score_gemma":0.40280423,"teacher_disagreement_score":0.14399455,"about_ca_system_score_codex":0.008001185,"about_ca_system_score_gemma":0.004926609,"threshold_uncertainty_score":0.28631288},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4976934,0.017448017,0.033658005,0.05335319,0.0048680706,0.0003345597,0.007927333,0.001948798,0.38276857],"genre_scores_gemma":[0.44808412,0.0037833967,0.011508568,0.0012749135,0.00049465906,0.00010023307,0.0022276978,0.00056293764,0.5319634],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99787676,0.00018559927,0.000052158764,0.00030842412,0.0011031323,0.0004740632],"domain_scores_gemma":[0.9978721,0.00025238036,0.00014292546,0.0001677492,0.0011036101,0.0004612089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012271655,0.0009372646,0.00067188265,0.0016748188,0.0059725256,0.0049927644,0.0009626288,0.0019160879,0.029460512],"category_scores_gemma":[0.0031342593,0.0006195233,0.0011546974,0.0015652828,0.0020077445,0.0018587301,0.0021214604,0.0027429028,0.0038899397],"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.0027083044,0.00030187352,0.13751154,0.0008698688,0.00070488953,0.0034074013,0.014823926,0.0179783,0.030935442,0.11593842,0.25634804,0.41847193],"study_design_scores_gemma":[0.000105442516,0.00011781206,0.14511526,0.00016552533,0.00007557876,0.00041249633,0.0044767833,0.004158928,0.006094478,0.0038826244,0.8352511,0.00014398765],"about_ca_topic_score_codex":0.9174674,"about_ca_topic_score_gemma":0.9526787,"teacher_disagreement_score":0.082532585,"about_ca_system_score_codex":0.02834295,"about_ca_system_score_gemma":0.026992196,"threshold_uncertainty_score":0.20564342},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028283568,0.0030720427,0.0040655187,0.03767152,0.0052488158,0.00026578846,0.025445309,0.0030031863,0.9183995],"genre_scores_gemma":[0.013947361,0.0023226377,0.003173094,0.0037693712,0.00033769096,0.000051455718,0.008460684,0.0006552782,0.9672824],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99857163,0.000040792365,0.000012380784,0.00005635169,0.0009732123,0.00034555796],"domain_scores_gemma":[0.9977775,0.000100879,0.00003792745,0.00011130947,0.0012484927,0.0007238968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010963916,0.0011600367,0.0007136328,0.0013876203,0.0054448806,0.005129118,0.0017676533,0.0035266813,0.18092507],"category_scores_gemma":[0.0024968546,0.0004355201,0.0006485073,0.0022174993,0.0013305378,0.0012012469,0.002274535,0.003426315,0.046649467],"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.000037529077,0.000029431132,0.00037249792,0.000032067062,0.0000065897652,0.000046953064,0.000021573713,0.00024841414,0.00027492954,0.0066014747,0.9770856,0.015243007],"study_design_scores_gemma":[0.00001801943,0.000010973095,0.0015213692,0.000027802562,0.000005069654,0.000013891945,0.00009457781,0.0008041659,0.00041662465,0.0022098152,0.9948643,0.000013405417],"about_ca_topic_score_codex":0.8505092,"about_ca_topic_score_gemma":0.95434546,"teacher_disagreement_score":0.18092507,"about_ca_system_score_codex":0.013640402,"about_ca_system_score_gemma":0.044168863,"threshold_uncertainty_score":0.60525465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015366367,0.0046676593,0.0012728474,0.25483835,0.072211586,0.00018499978,0.008935851,0.0019761191,0.6543759],"genre_scores_gemma":[0.004627844,0.002308109,0.0006002117,0.020015053,0.003078722,0.000021589854,0.0022716091,0.00029453472,0.96678233],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99846184,0.00003735657,0.000021203563,0.00008082412,0.0011004015,0.0002984508],"domain_scores_gemma":[0.9954776,0.0001545453,0.00006035107,0.000104132494,0.0029587473,0.0012445645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013097803,0.0006460367,0.0005169119,0.0008314918,0.004431219,0.0045362716,0.00084863894,0.0034999445,0.1547791],"category_scores_gemma":[0.0030357866,0.00032758803,0.0006940968,0.0011070037,0.0009990113,0.0011995672,0.0009933207,0.0046554236,0.069378085],"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.000009258804,0.0000034998775,0.00006779525,0.0000068955305,9.157435e-7,0.000024397912,0.0000053127637,0.000011318622,0.000040551637,0.00047215627,0.9954573,0.0039007245],"study_design_scores_gemma":[0.0000052467894,0.0000058721926,0.0005766091,0.00001283487,0.0000016012916,0.000020325373,0.00006175832,0.000045697565,0.00008752391,0.00022731222,0.9989496,0.0000056889303],"about_ca_topic_score_codex":0.49828795,"about_ca_topic_score_gemma":0.8381911,"teacher_disagreement_score":0.49828795,"about_ca_system_score_codex":0.0078165615,"about_ca_system_score_gemma":0.019939767,"threshold_uncertainty_score":0.99077517},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050464934,0.0022389365,0.0006505091,0.05737067,0.0010390353,0.00007123136,0.0009150506,0.00008854055,0.9325795],"genre_scores_gemma":[0.15572204,0.001861438,0.0011213446,0.033293955,0.00072862086,0.0001433313,0.00045150882,0.00013370538,0.8065441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98874,0.0010553208,0.0002569149,0.0013791689,0.0053426386,0.0032258097],"domain_scores_gemma":[0.9942836,0.0010192677,0.0001075849,0.0006220661,0.003252892,0.0007145492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004400633,0.0007973254,0.0010931835,0.0030007288,0.019426987,0.011895625,0.0029520697,0.01144407,0.07205463],"category_scores_gemma":[0.016072797,0.00089574157,0.0011182827,0.003820166,0.006253963,0.0036192378,0.0027548503,0.011906985,0.005518465],"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.000015406644,0.000018682586,0.0002124073,0.000023634168,0.000007316694,0.000039785355,0.00029382625,0.00012233465,0.000046859695,0.80799466,0.18506974,0.006155357],"study_design_scores_gemma":[0.00003856357,0.000011854826,0.0015150816,0.0001289974,0.000026701737,0.000044773962,0.00049836835,0.00050189433,0.00020801373,0.07602675,0.920947,0.00005214825],"about_ca_topic_score_codex":0.93339235,"about_ca_topic_score_gemma":0.9594483,"teacher_disagreement_score":0.082079396,"about_ca_system_score_codex":0.082079396,"about_ca_system_score_gemma":0.09754581,"threshold_uncertainty_score":0.5955305},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048949844,0.0076746,0.042830814,0.38712984,0.008856967,0.0015099045,0.00083939126,0.00060859334,0.54565495],"genre_scores_gemma":[0.15982018,0.012481979,0.22490606,0.421027,0.007862066,0.0053007156,0.0038025645,0.000846982,0.16395243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9717452,0.010390781,0.0020118968,0.0020181497,0.010067912,0.0037660988],"domain_scores_gemma":[0.97813934,0.004120734,0.0016389585,0.0016985827,0.008282681,0.0061196606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.038480442,0.001017629,0.00076771295,0.003348235,0.0053294646,0.0135516925,0.0028396065,0.009671189,0.008727095],"category_scores_gemma":[0.04212952,0.0005844463,0.0012405815,0.0016749437,0.004892792,0.009924416,0.013710644,0.012255108,0.006865299],"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.000010803801,0.00005718771,0.0011264778,0.00011370694,0.000007675288,0.00007055385,0.0013651926,0.00027375764,0.0002621861,0.77942437,0.18279338,0.0344948],"study_design_scores_gemma":[0.000015429721,0.000058933416,0.0016404425,0.00062016846,0.000009633277,0.000095460535,0.0011240386,0.00025203032,0.0002512667,0.11972226,0.8761707,0.00003952571],"about_ca_topic_score_codex":0.013821838,"about_ca_topic_score_gemma":0.017598627,"teacher_disagreement_score":0.038480442,"about_ca_system_score_codex":0.01004549,"about_ca_system_score_gemma":0.048671324,"threshold_uncertainty_score":0.20350647},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010882045,0.00027878216,0.9852439,0.00010040734,0.00003823297,0.000042004922,0.000019189281,0.0002553603,0.0031401245],"genre_scores_gemma":[0.14101508,0.0005903156,0.8546831,0.000060271897,0.00004858944,0.00021982848,0.0001264077,0.000368456,0.002887967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966025,0.0001272164,0.000012325784,0.000024581646,0.00014686893,0.000028886907],"domain_scores_gemma":[0.9992939,0.00044176454,0.00004169388,0.000080158556,0.00011332469,0.000029099636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007685994,0.0006965725,0.0005520094,0.00073494046,0.0004985024,0.000666634,0.00054633117,0.00069024996,0.0020830026],"category_scores_gemma":[0.0019917702,0.0002886345,0.0005837838,0.0008153497,0.0008733041,0.0007444233,0.00087430025,0.0010691258,0.00057952385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014378081,0.0000587962,0.00048606706,0.00023925069,0.000029119472,0.00013347369,0.00033108873,0.5855688,0.020826189,0.16011757,0.0039812136,0.2280848],"study_design_scores_gemma":[0.000013618315,0.000020972693,0.00007576161,0.00001294094,0.0000027557714,0.00004682482,0.000016558584,0.9703672,0.0032170813,0.020088164,0.0061279656,0.000010199267],"about_ca_topic_score_codex":0.0023245444,"about_ca_topic_score_gemma":0.0012738736,"teacher_disagreement_score":0.0023245444,"about_ca_system_score_codex":0.0004562846,"about_ca_system_score_gemma":0.000845743,"threshold_uncertainty_score":0.0069683194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07402986,0.003875256,0.8159603,0.024323596,0.0023418218,0.00052361254,0.0012455191,0.000672402,0.07702756],"genre_scores_gemma":[0.7579168,0.0035961454,0.19177529,0.0015550957,0.0015397512,0.0002884949,0.001386455,0.00018689405,0.041755177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99414515,0.001954843,0.00042384217,0.00050256477,0.0027678865,0.00020577603],"domain_scores_gemma":[0.9874046,0.0059162453,0.00076110545,0.0014334454,0.004096319,0.00038831314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006283521,0.00027010706,0.00086497,0.0017034042,0.0013317689,0.004864603,0.0012078581,0.0016220547,0.011807839],"category_scores_gemma":[0.03134515,0.00040329236,0.0007628396,0.001742428,0.002113725,0.006309675,0.0015242428,0.0016003463,0.002288622],"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.0003667076,0.00007933274,0.0018643142,0.00080872676,0.000108376684,0.001096406,0.0011025259,0.01827466,0.0039046805,0.70829153,0.02763885,0.23646384],"study_design_scores_gemma":[0.00008600885,0.000065839384,0.0011046025,0.00033724442,0.000065919616,0.0005958151,0.00046688828,0.087891616,0.004667977,0.83998287,0.06462755,0.00010766333],"about_ca_topic_score_codex":0.0011913492,"about_ca_topic_score_gemma":0.0012445368,"teacher_disagreement_score":0.011807839,"about_ca_system_score_codex":0.0013760194,"about_ca_system_score_gemma":0.0017961013,"threshold_uncertainty_score":0.03950113},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059302716,0.029675806,0.0009299616,0.011654748,0.0013337749,0.000028330449,0.0002744139,0.000109020526,0.9554009],"genre_scores_gemma":[0.015911615,0.018144308,0.00088141277,0.003244425,0.00042912405,0.000027213191,0.00033297986,0.00021575944,0.96081305],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99892175,0.000077635115,0.000019985271,0.00006900414,0.00076660234,0.0001450112],"domain_scores_gemma":[0.99930894,0.00014167433,0.000031899825,0.000067152636,0.00032565728,0.00012462944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006469914,0.0006066212,0.0003446396,0.0015498955,0.0032108554,0.0057988223,0.00067651237,0.0016319458,0.021933714],"category_scores_gemma":[0.0018435234,0.00031496512,0.00021777228,0.0040399497,0.004270912,0.002560307,0.0010873175,0.00250188,0.0062450073],"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.0000039367214,0.000005416958,0.00008993272,0.00007012134,0.0000012600614,0.0000134870725,0.0006193604,0.00019124194,0.000057052308,0.15244296,0.80352914,0.042976033],"study_design_scores_gemma":[8.254218e-7,0.000001631652,0.00047666405,0.000099748126,0.0000011487729,0.000023969862,0.0001709906,0.000056936973,0.000043162876,0.0076391627,0.9914808,0.0000048726997],"about_ca_topic_score_codex":0.64933264,"about_ca_topic_score_gemma":0.8403418,"teacher_disagreement_score":0.35066736,"about_ca_system_score_codex":0.022665597,"about_ca_system_score_gemma":0.028477252,"threshold_uncertainty_score":0.70546496},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99662834,0.0009363531,0.000050130675,0.000040412528,0.0000040810264,0.000018653047,0.0021375467,0.0000014180471,0.00018305029],"genre_scores_gemma":[0.996929,0.00041287084,0.000065638196,0.000025549221,0.000009001859,0.00002659155,0.0024681946,0.000001535385,0.000061556326],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99865746,0.0003393989,0.00032669972,0.00021010124,0.00030025633,0.00016612928],"domain_scores_gemma":[0.9975731,0.00043471044,0.0014964857,0.00013730698,0.0001792871,0.00017908939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009791198,0.00032897576,0.0005683646,0.0016638824,0.00032198525,0.0010821414,0.00064637087,0.0005112764,0.0010249335],"category_scores_gemma":[0.003947684,0.00041232756,0.001543553,0.0031172584,0.0003408889,0.00069513277,0.00074049964,0.0005723321,0.00015700886],"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.0004962175,0.000052880896,0.99740845,0.000060378516,0.00040777994,0.00003956047,0.000068385205,0.00015260004,0.00005699327,0.000044173783,0.00017411356,0.0010385237],"study_design_scores_gemma":[0.000042784526,0.00011973737,0.99821895,0.000043029264,0.00019477133,0.00015695022,0.00025706753,0.00065117213,0.000040343148,0.000036417357,0.00022741951,0.000011415328],"about_ca_topic_score_codex":0.02588064,"about_ca_topic_score_gemma":0.01930207,"teacher_disagreement_score":0.02588064,"about_ca_system_score_codex":0.001409722,"about_ca_system_score_gemma":0.000674132,"threshold_uncertainty_score":0.051459968},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27073404,0.0017892466,0.06728426,0.008831295,0.00418563,0.002083376,0.01907806,0.007714401,0.6182997],"genre_scores_gemma":[0.29479352,0.00031925467,0.01565364,0.00032411446,0.00012664737,0.0001416318,0.004619312,0.0012116275,0.68281025],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986957,0.00014049212,0.000016609498,0.00014891764,0.0007455218,0.00025275032],"domain_scores_gemma":[0.99758434,0.0001238518,0.000039680966,0.00017736555,0.0017406582,0.0003340859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016952916,0.00060867023,0.0006289677,0.0010712348,0.0034597553,0.0019614962,0.00080650544,0.0008113261,0.045913227],"category_scores_gemma":[0.0020255328,0.00036068028,0.0004727429,0.0005805585,0.0006152986,0.0005694472,0.00081221224,0.0010017453,0.008642004],"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.00125632,0.0004043666,0.035843458,0.0003047404,0.000201969,0.0026527587,0.0015235335,0.044665165,0.040849183,0.018017216,0.55707663,0.29720464],"study_design_scores_gemma":[0.00011903143,0.00026034532,0.05886953,0.00007856355,0.000038527378,0.00017926424,0.0008910439,0.024816344,0.008773643,0.001540384,0.9043732,0.00006017756],"about_ca_topic_score_codex":0.76460445,"about_ca_topic_score_gemma":0.8948428,"teacher_disagreement_score":0.23539555,"about_ca_system_score_codex":0.009206525,"about_ca_system_score_gemma":0.016399471,"threshold_uncertainty_score":0.47356367},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6173213,0.010923174,0.049471997,0.059236422,0.0018808157,0.0000881078,0.00013569421,0.00039482885,0.26054767],"genre_scores_gemma":[0.9460953,0.0020018388,0.004941379,0.001754378,0.00015688385,0.00004513961,0.000048006983,0.00011235886,0.04484467],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9985812,0.0007076918,0.000027340953,0.000222437,0.00026409203,0.00019723258],"domain_scores_gemma":[0.9983398,0.0005594596,0.00020849095,0.00025787164,0.00027619535,0.00035812656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002506487,0.00050225557,0.0003930752,0.00047939867,0.0022161398,0.0051079225,0.0010190678,0.0015408649,0.013130735],"category_scores_gemma":[0.005821113,0.00016753082,0.00037952274,0.0007395152,0.0074867858,0.0027361366,0.0030402204,0.002126615,0.0014599117],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004014427,0.0004688987,0.026829416,0.00018641508,0.000072585506,0.000808134,0.07237118,0.0017243052,0.009142171,0.35335636,0.01826249,0.5163766],"study_design_scores_gemma":[0.00009018143,0.000521063,0.19116025,0.0004049483,0.000077698634,0.0024970078,0.07323909,0.00634335,0.007203486,0.3324707,0.38582802,0.00016425381],"about_ca_topic_score_codex":0.024171418,"about_ca_topic_score_gemma":0.025756903,"teacher_disagreement_score":0.024171418,"about_ca_system_score_codex":0.003805333,"about_ca_system_score_gemma":0.004216267,"threshold_uncertainty_score":0.04806143},"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":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014846775,0.0053600376,0.0041900105,0.29787153,0.018631188,0.000038951355,0.00032423064,0.0005043729,0.67159516],"genre_scores_gemma":[0.01799571,0.0026062138,0.0017397574,0.04659048,0.002216776,0.000024895384,0.00016667928,0.0002820531,0.92837745],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998181,0.00033654887,0.00005210565,0.00019242859,0.0009802396,0.000257735],"domain_scores_gemma":[0.99740607,0.0008952672,0.000091998445,0.00026958942,0.0009045285,0.0004325709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021064228,0.0004256311,0.00040592114,0.0009154337,0.0053883307,0.005515242,0.0013708207,0.003652608,0.07591473],"category_scores_gemma":[0.00879588,0.000323862,0.00030481725,0.0012711218,0.0024600541,0.004238014,0.0024697045,0.0072721625,0.0162423],"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.0000048364063,0.0000056458985,0.000062659085,0.00000822116,0.0000010807515,0.000025306734,0.000084883475,0.0000330399,0.00003468858,0.035046976,0.9549662,0.009726515],"study_design_scores_gemma":[0.000001997749,0.0000028003535,0.000108852786,0.000015830534,0.0000014779896,0.000029582749,0.000122065576,0.000080072256,0.00011065009,0.0067004785,0.99282175,0.0000044612957],"about_ca_topic_score_codex":0.045097712,"about_ca_topic_score_gemma":0.117090955,"teacher_disagreement_score":0.9549023,"about_ca_system_score_codex":0.0033512549,"about_ca_system_score_gemma":0.0045308354,"threshold_uncertainty_score":0.25396013},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050956517,0.048444513,0.0047203237,0.030555902,0.0020078956,0.00006746858,0.0013392009,0.00013055599,0.8617777],"genre_scores_gemma":[0.24155177,0.009798622,0.0019652185,0.0016272636,0.00021681312,0.00007683339,0.00040932815,0.00023134815,0.74412274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9987525,0.00021176942,0.00003742272,0.00021632259,0.0003906818,0.00039143846],"domain_scores_gemma":[0.9992561,0.00016804402,0.00006284707,0.00006670726,0.0003319326,0.000114249706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092135504,0.0005531961,0.00035726954,0.0023475036,0.0118942745,0.008642854,0.0008160597,0.0016717329,0.024963513],"category_scores_gemma":[0.0025916116,0.00045101947,0.00028749282,0.0069185426,0.009798198,0.0029420867,0.0025311245,0.003879474,0.0018671172],"study_design_candidate":"observational","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.00007663019,0.000009416254,0.0021323692,0.00013899218,0.000007796059,0.00020102334,0.032095328,0.00018790869,0.00033150462,0.83723605,0.077105485,0.050477516],"study_design_scores_gemma":[0.0000064635715,0.0000076409315,0.0051387567,0.00011702929,0.0000049188584,0.000080827595,0.0054554525,0.000056153727,0.00023014136,0.0070350794,0.9818533,0.000014366918],"about_ca_topic_score_codex":0.88803154,"about_ca_topic_score_gemma":0.9467333,"teacher_disagreement_score":0.11196846,"about_ca_system_score_codex":0.04424216,"about_ca_system_score_gemma":0.032685254,"threshold_uncertainty_score":0.3210008},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93947196,0.0013336086,0.00009038345,0.0007350873,0.000012756513,0.000033526147,0.00031622918,0.0000056942918,0.058000688],"genre_scores_gemma":[0.9875339,0.0010495267,0.00007541424,0.00019607638,0.0000018807827,0.000018842073,0.00025709142,0.000009022567,0.010858331],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99787605,0.00031951643,0.00010821721,0.00016301135,0.0008621228,0.00067110953],"domain_scores_gemma":[0.99673223,0.00052220834,0.00045200656,0.000113128226,0.001486659,0.0006937258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007646759,0.00020660776,0.00044926192,0.0037160902,0.0053641484,0.0048891646,0.0010079113,0.00055176794,0.008083382],"category_scores_gemma":[0.0037560954,0.00025056585,0.00027648563,0.013194252,0.0029634333,0.0016009932,0.0026304366,0.001198706,0.00055461546],"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.0004899947,0.00028636988,0.59622806,0.0007891008,0.00029113542,0.008496589,0.2171536,0.0014830732,0.0036388927,0.048128586,0.018635504,0.10437909],"study_design_scores_gemma":[0.00001185749,0.00005900823,0.72224265,0.0002865598,0.000056556837,0.00043210026,0.2285649,0.0005770806,0.0002986375,0.0006434537,0.04677216,0.000055091332],"about_ca_topic_score_codex":0.9522106,"about_ca_topic_score_gemma":0.9928377,"teacher_disagreement_score":0.047789395,"about_ca_system_score_codex":0.036875032,"about_ca_system_score_gemma":0.022907188,"threshold_uncertainty_score":0.26754832},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22202349,0.027876483,0.005325665,0.4643182,0.0046513313,0.00026363175,0.0100084655,0.00071145175,0.26482138],"genre_scores_gemma":[0.53907096,0.008940249,0.004263039,0.012064572,0.00058593904,0.00009506835,0.0020754167,0.00023659025,0.43266818],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969047,0.00025407612,0.000068059264,0.00025917255,0.001014946,0.0014991056],"domain_scores_gemma":[0.9927914,0.0004258161,0.00030510064,0.00016832988,0.002851569,0.0034577856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002278295,0.0004700159,0.00045766958,0.0016412492,0.010518103,0.0070533617,0.0015652514,0.0023096907,0.025182797],"category_scores_gemma":[0.006242655,0.00035449144,0.00048170253,0.0032108326,0.0023571644,0.0022405535,0.0026989793,0.0037128506,0.0015303917],"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.00040053795,0.00025933518,0.07614667,0.00036035164,0.00007716364,0.00083559006,0.0052172486,0.0024970362,0.0008167873,0.1368004,0.4878975,0.28869143],"study_design_scores_gemma":[0.00009490355,0.000068259855,0.16150741,0.000649917,0.000070230606,0.0002834594,0.0141743645,0.0030841776,0.0009821202,0.007318836,0.8116364,0.00012992565],"about_ca_topic_score_codex":0.99547595,"about_ca_topic_score_gemma":0.99729735,"teacher_disagreement_score":0.87832093,"about_ca_system_score_codex":0.12167909,"about_ca_system_score_gemma":0.30281094,"threshold_uncertainty_score":0.8828477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97957957,0.00030680466,0.015985044,0.000051643052,0.000014269843,0.000016540083,0.0009878958,0.00033263335,0.0027256978],"genre_scores_gemma":[0.9871952,0.00016788028,0.010267334,0.0000209317,0.000012860522,0.000017623403,0.001639965,0.00005858617,0.0006196646],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995459,0.000110093766,0.000021222859,0.00010123701,0.00018070563,0.0000407675],"domain_scores_gemma":[0.99966216,0.00016007356,0.000066525885,0.000041674575,0.000039149938,0.000030338246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050313625,0.00038028078,0.0003290115,0.0006684659,0.00036012832,0.00072781666,0.0003973417,0.00024282317,0.00072953705],"category_scores_gemma":[0.0007378556,0.00025228894,0.00022120264,0.0010741082,0.00027449417,0.00033031488,0.00034381862,0.00034254903,0.00034776048],"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.0024753674,0.0005842599,0.17354695,0.00033117837,0.00036107813,0.0016316023,0.0002532396,0.044062186,0.7091138,0.0073541976,0.002423468,0.057862762],"study_design_scores_gemma":[0.00014024589,0.00090667803,0.15306064,0.000013347222,0.00011246141,0.0013844636,0.00010268027,0.12067955,0.71668595,0.00249026,0.0043245456,0.000099160934],"about_ca_topic_score_codex":0.0008369604,"about_ca_topic_score_gemma":0.0010893921,"teacher_disagreement_score":0.0008369604,"about_ca_system_score_codex":0.00034274292,"about_ca_system_score_gemma":0.0002891424,"threshold_uncertainty_score":0.0026608706},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.619613,0.0003581217,0.35016012,0.000715195,0.00012921306,0.00014223038,0.00037489316,0.00096758816,0.027539676],"genre_scores_gemma":[0.82083285,0.00035292617,0.17414144,0.000106021034,0.000031792446,0.00019900758,0.00032412715,0.00014772073,0.0038640797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998522,0.000041872223,0.000006033957,0.00001722214,0.000060997147,0.000021647456],"domain_scores_gemma":[0.9997578,0.00010646039,0.000023920886,0.000043602264,0.000045272296,0.000022891478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027485166,0.00029560798,0.00035316224,0.00026126954,0.0004648487,0.00059531315,0.00071169715,0.00043098064,0.0012405715],"category_scores_gemma":[0.00070905115,0.00025033517,0.0004114731,0.0003943006,0.00039642493,0.0006795404,0.00054241496,0.00053358474,0.00024588846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006934566,0.00007375067,0.00087808736,0.000042130243,0.000025046591,0.000039993207,0.00006795629,0.95703334,0.008514234,0.02227634,0.00059508864,0.010384688],"study_design_scores_gemma":[0.00000877465,0.0000066770835,0.0000707501,0.0000012432052,0.0000010843274,0.0000020327786,0.0000047791514,0.9975672,0.00090912095,0.0010239063,0.00040219878,0.0000023328982],"about_ca_topic_score_codex":0.0069290968,"about_ca_topic_score_gemma":0.0052902466,"teacher_disagreement_score":0.0069290968,"about_ca_system_score_codex":0.00063077465,"about_ca_system_score_gemma":0.0011275997,"threshold_uncertainty_score":0.013777554},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11371416,0.009860252,0.34480208,0.028421437,0.0032105865,0.00004616283,0.0016813369,0.0021703765,0.49609357],"genre_scores_gemma":[0.889752,0.004020457,0.020225037,0.002194219,0.002462549,0.00006805316,0.0005596883,0.0013097808,0.079408295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995272,0.0001411795,0.000013798464,0.000101368634,0.00015553474,0.00006098448],"domain_scores_gemma":[0.99723345,0.0013661835,0.0003712188,0.00051152136,0.00038633018,0.00013118288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014106298,0.0004764532,0.0004542949,0.0013207921,0.001171986,0.0016952349,0.0009954557,0.0010626728,0.027381524],"category_scores_gemma":[0.014152939,0.00020260409,0.00026396313,0.0008059815,0.0023929167,0.0036736047,0.0012306577,0.002250274,0.0023854044],"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.000021947893,0.000009137349,0.0005032127,0.000043102653,0.0000032760338,0.000090029534,0.00006293321,0.0024901133,0.00035496737,0.9700023,0.011521895,0.014897044],"study_design_scores_gemma":[0.000010648072,0.000021321985,0.0010152956,0.00007942374,0.000007601826,0.00028370484,0.000031917614,0.04141611,0.0011742541,0.92464757,0.031286705,0.000025551219],"about_ca_topic_score_codex":0.0025325948,"about_ca_topic_score_gemma":0.0012803387,"teacher_disagreement_score":0.027381524,"about_ca_system_score_codex":0.0010836822,"about_ca_system_score_gemma":0.0005438907,"threshold_uncertainty_score":0.0916003},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17137258,0.0010797946,0.7529277,0.0009730686,0.0012853928,0.00018139092,0.0009933447,0.026019199,0.045167513],"genre_scores_gemma":[0.77960575,0.00026758938,0.1963695,0.0003295442,0.00030385243,0.00013146845,0.0013117128,0.004316508,0.017364036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866617,0.00026952772,0.00010380779,0.00021385137,0.00040897378,0.00033771322],"domain_scores_gemma":[0.9961106,0.0009345441,0.00022906813,0.0017836519,0.0008077645,0.0001343901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084669795,0.0007448302,0.00053439045,0.00048425669,0.0005884876,0.00184814,0.0010438274,0.0006160238,0.00988426],"category_scores_gemma":[0.0053891814,0.00053260685,0.0004700838,0.0004977593,0.0007764539,0.0032796112,0.0014481009,0.0012763062,0.004346724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027628436,0.000509915,0.0034030257,0.00052740047,0.00007325859,0.0007221901,0.0008225895,0.043064516,0.111051105,0.28349403,0.058033064,0.49553606],"study_design_scores_gemma":[0.0004040003,0.0005450471,0.002687401,0.0001350939,0.000100746875,0.0006241099,0.00025432202,0.46009922,0.23020908,0.23482512,0.06997825,0.00013763271],"about_ca_topic_score_codex":0.00081262673,"about_ca_topic_score_gemma":0.001442208,"teacher_disagreement_score":0.00988426,"about_ca_system_score_codex":0.0005535582,"about_ca_system_score_gemma":0.0010892386,"threshold_uncertainty_score":0.033066154},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79472095,0.022178732,0.00083334127,0.003260254,0.000074136056,0.000024045808,0.0019866847,0.000019945133,0.17690182],"genre_scores_gemma":[0.97675234,0.0075132237,0.00037452736,0.00006520561,0.000049561222,0.000020120044,0.0012800929,0.000015692476,0.013929289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994649,0.00014369581,0.000029678256,0.00006244162,0.00017046065,0.00012874999],"domain_scores_gemma":[0.99906856,0.0003724297,0.00028170197,0.0000359499,0.00015829229,0.00008311053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008312378,0.00038051468,0.00023237488,0.0056980327,0.0019802097,0.0044303187,0.00039045475,0.00032962312,0.007399539],"category_scores_gemma":[0.0023716502,0.00017839528,0.00021582014,0.011631359,0.0038517192,0.0015167812,0.0013540083,0.0009906287,0.0006131124],"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.00028416349,0.0000643276,0.24800368,0.0004050646,0.00013027054,0.00089360937,0.06386264,0.0030522451,0.00041058505,0.48167947,0.029023107,0.1721907],"study_design_scores_gemma":[0.000023537701,0.000030553438,0.613836,0.00036764808,0.000041707986,0.0004943068,0.044302292,0.001425133,0.0006527631,0.019027973,0.31976885,0.0000292004],"about_ca_topic_score_codex":0.13791193,"about_ca_topic_score_gemma":0.18552639,"teacher_disagreement_score":0.13791193,"about_ca_system_score_codex":0.008728543,"about_ca_system_score_gemma":0.002655867,"threshold_uncertainty_score":0.27421838},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068545006,0.050197903,0.7509543,0.03422075,0.0044140886,0.0001904025,0.0006240629,0.0027698805,0.08808366],"genre_scores_gemma":[0.42533565,0.022507237,0.27920315,0.002328304,0.0024902788,0.00028297555,0.0016669839,0.0010316053,0.26515388],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99959356,0.00013888544,0.000014260615,0.00010698911,0.00011031753,0.000035962206],"domain_scores_gemma":[0.9984913,0.0010316814,0.00004152434,0.00013524732,0.00023204391,0.000068237445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093079486,0.00030432155,0.0005762522,0.00090465136,0.0004828608,0.0012853207,0.00058172917,0.0005868845,0.011095789],"category_scores_gemma":[0.0038742921,0.000285947,0.00034175706,0.0013982522,0.00061303354,0.0016058733,0.00053475454,0.0014049513,0.0029823382],"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.000065866974,0.000153415,0.0013261278,0.00021050453,0.000032343025,0.00005729339,0.00016098085,0.04278528,0.0013281833,0.060691122,0.091837175,0.80135167],"study_design_scores_gemma":[0.000028892526,0.00009373855,0.00425318,0.0002607862,0.00003719811,0.00016571017,0.00022829641,0.5720285,0.0081383,0.20067358,0.21405125,0.000040593648],"about_ca_topic_score_codex":0.005755977,"about_ca_topic_score_gemma":0.005178133,"teacher_disagreement_score":0.011095789,"about_ca_system_score_codex":0.00065124215,"about_ca_system_score_gemma":0.00054980326,"threshold_uncertainty_score":0.03711915},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083585784,0.022603905,0.042070493,0.018776614,0.0016748137,0.00021480846,0.00035670013,0.0007869831,0.82993],"genre_scores_gemma":[0.49874687,0.017982606,0.06052631,0.003274616,0.0011278726,0.000458062,0.00037841074,0.0007117743,0.4167935],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99870074,0.00042166404,0.000033549564,0.00025256848,0.0004368789,0.00015448894],"domain_scores_gemma":[0.9980988,0.0009873208,0.0001614663,0.00026919585,0.00029000174,0.00019327768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013120914,0.00058140827,0.0004777564,0.0010428161,0.0015566894,0.00660865,0.001162101,0.0017418416,0.030633038],"category_scores_gemma":[0.0042240196,0.00031597115,0.00044037073,0.0013803383,0.0030494202,0.004788402,0.0031696695,0.0015920989,0.0055477303],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014212685,0.00022849717,0.008365647,0.0013225259,0.000040022856,0.00046130372,0.027706578,0.00050383486,0.016395634,0.3265042,0.087664604,0.53066504],"study_design_scores_gemma":[0.000019155048,0.00016243791,0.016623162,0.0006967927,0.00005274558,0.0013361492,0.012199727,0.0009726665,0.005490361,0.064814955,0.89755535,0.00007661449],"about_ca_topic_score_codex":0.002826482,"about_ca_topic_score_gemma":0.0064383983,"teacher_disagreement_score":0.030633038,"about_ca_system_score_codex":0.0014573275,"about_ca_system_score_gemma":0.0015169638,"threshold_uncertainty_score":0.10247773},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3162435,0.03052128,0.0006071641,0.039729163,0.00059067813,0.00016096886,0.010848352,0.00007162732,0.6012273],"genre_scores_gemma":[0.57913136,0.010317561,0.00030122814,0.000912984,0.00017355432,0.000054729535,0.00094454247,0.00003471755,0.40812927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993266,0.000047116235,0.000023184466,0.00006572727,0.0002460232,0.000291354],"domain_scores_gemma":[0.9993918,0.000098657154,0.00011698387,0.000022801405,0.00017479871,0.00019496838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000354895,0.00028952444,0.0002125069,0.0017137399,0.009484575,0.002540235,0.00052781333,0.0011542729,0.016625687],"category_scores_gemma":[0.0016255962,0.00045893434,0.00015046952,0.006144361,0.0038340003,0.0015448609,0.0012717558,0.0013110072,0.0010525971],"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.00031366892,0.000096603915,0.0690341,0.0005515823,0.00007193715,0.0016251076,0.15838934,0.00093391084,0.0006540156,0.34039807,0.2917054,0.13622625],"study_design_scores_gemma":[0.000008942711,0.00000896681,0.07750357,0.000105374864,0.000010603198,0.00011576156,0.009511422,0.00008381587,0.00011223538,0.002797092,0.9097173,0.000024944204],"about_ca_topic_score_codex":0.9732612,"about_ca_topic_score_gemma":0.99571097,"teacher_disagreement_score":0.07809973,"about_ca_system_score_codex":0.07809973,"about_ca_system_score_gemma":0.043191217,"threshold_uncertainty_score":0.5666559},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03413011,0.030970663,0.0071299947,0.82441646,0.009905027,0.000018068464,0.0006200817,0.00009386136,0.09271576],"genre_scores_gemma":[0.77956396,0.032123055,0.0052731684,0.1359022,0.0058168327,0.000064664484,0.00035372627,0.00031623864,0.040586133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982803,0.00081747986,0.00005214275,0.0001923804,0.00036137644,0.00029629786],"domain_scores_gemma":[0.9899188,0.005102409,0.001225811,0.00048222608,0.0019431266,0.0013275695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030875467,0.0002927188,0.0006716573,0.0005537571,0.0012442333,0.00384495,0.000676204,0.002654699,0.023232248],"category_scores_gemma":[0.03466948,0.00021327296,0.0004382741,0.0010457509,0.00411826,0.009889599,0.0007490262,0.0063421694,0.0036866285],"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.0011738914,0.00035628077,0.018209694,0.00067871105,0.00031357328,0.0002092466,0.0015127686,0.001555726,0.0006126395,0.36716858,0.34032586,0.26788303],"study_design_scores_gemma":[0.00015435932,0.00018750082,0.012017016,0.0014123822,0.00020316661,0.00070301775,0.006876582,0.0017764322,0.0009298984,0.59404296,0.38157767,0.00011902081],"about_ca_topic_score_codex":0.006352704,"about_ca_topic_score_gemma":0.0081739,"teacher_disagreement_score":0.023232248,"about_ca_system_score_codex":0.0020608096,"about_ca_system_score_gemma":0.0026556181,"threshold_uncertainty_score":0.07771963},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18125495,0.0018493071,0.7325412,0.00054589094,0.0010089615,0.00032906194,0.0007461668,0.05541123,0.026313107],"genre_scores_gemma":[0.7066187,0.0003374907,0.27449375,0.00036969827,0.00018314541,0.00025544275,0.0009893535,0.0019026453,0.014849831],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994795,0.000089060144,0.000036632704,0.00009120624,0.000169159,0.00013456288],"domain_scores_gemma":[0.99908864,0.00015032073,0.000062343686,0.00036044134,0.0001812839,0.00015706016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068902655,0.00072192185,0.00069744466,0.0005934875,0.0006056995,0.0013455304,0.002534516,0.0004913496,0.011803789],"category_scores_gemma":[0.0013053798,0.0005474315,0.00046053348,0.0006960711,0.0005343665,0.0014263028,0.0018307964,0.0011769241,0.0020534475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00721863,0.00085255824,0.0058711222,0.00081051816,0.00032732502,0.00057033607,0.0005445258,0.059609868,0.13929601,0.065429576,0.077374294,0.64209527],"study_design_scores_gemma":[0.0012337114,0.0016449791,0.0023559227,0.00007102505,0.00025679657,0.0004954687,0.0001694409,0.81073266,0.083840646,0.044935476,0.054153383,0.000110499306],"about_ca_topic_score_codex":0.0013370807,"about_ca_topic_score_gemma":0.002607485,"teacher_disagreement_score":0.011803789,"about_ca_system_score_codex":0.0005371056,"about_ca_system_score_gemma":0.0015479259,"threshold_uncertainty_score":0.03948754},"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":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057443447,0.00012772868,0.00021768262,0.00012278862,0.000085426735,0.000041663334,0.9961326,0.0016827483,0.0010149383],"genre_scores_gemma":[0.00090626,0.00005183388,0.00061191485,0.00004196182,0.000013887274,0.000115078015,0.9972556,0.00023290445,0.0007705612],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99859744,0.00023893318,0.00017035054,0.00036041517,0.00040805893,0.00022476711],"domain_scores_gemma":[0.996253,0.00069534936,0.00021766097,0.0014878345,0.0010365966,0.00030956164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016075049,0.0024854676,0.0019463291,0.0021321063,0.0013047241,0.0024414617,0.0047080503,0.0025307538,0.07192435],"category_scores_gemma":[0.0068010995,0.00079677545,0.002109198,0.0043630307,0.000633289,0.0018390863,0.0019543718,0.002198258,0.1272238],"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.00019010466,0.000050675604,0.0005288653,0.0008142277,0.000042271415,0.000020619762,0.000018575056,0.000472213,0.00027823038,0.00030670848,0.99405754,0.0032199088],"study_design_scores_gemma":[0.0012496127,0.000106927386,0.008319339,0.00049450743,0.00008451396,0.00014578142,0.00016697672,0.0017763159,0.0025072917,0.00246723,0.98260605,0.000075424985],"about_ca_topic_score_codex":0.0136983795,"about_ca_topic_score_gemma":0.0203328,"teacher_disagreement_score":0.07192435,"about_ca_system_score_codex":0.001236498,"about_ca_system_score_gemma":0.0021822534,"threshold_uncertainty_score":0.24061096},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34515035,0.08789741,0.007754366,0.032007497,0.0013479058,0.000111474,0.0065361424,0.00049521966,0.5186996],"genre_scores_gemma":[0.8370844,0.013891335,0.0036952808,0.0010884639,0.00020160584,0.00005393454,0.0013119074,0.00018087383,0.14249225],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944335,0.00018581956,0.000025702262,0.00007154642,0.00016315593,0.00011042525],"domain_scores_gemma":[0.99920744,0.0001657421,0.0001484983,0.00005593292,0.00038003238,0.00004242348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000954377,0.00030505328,0.00023438284,0.0029718704,0.0025338263,0.0025856823,0.00040968813,0.00051472936,0.010874637],"category_scores_gemma":[0.00208273,0.00024316771,0.00017254063,0.0041320096,0.002244842,0.0013421861,0.00091384543,0.0010282843,0.00115184],"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.00022273828,0.00006583748,0.082810566,0.0009874969,0.00012796531,0.001333611,0.10596293,0.0023223655,0.0037867043,0.2675248,0.07952944,0.45532554],"study_design_scores_gemma":[0.000008864842,0.00002814099,0.14010221,0.00028198928,0.000018039662,0.0003417783,0.007803346,0.00024621663,0.00030754003,0.0028309093,0.84800595,0.000025081206],"about_ca_topic_score_codex":0.6660569,"about_ca_topic_score_gemma":0.7247486,"teacher_disagreement_score":0.6660569,"about_ca_system_score_codex":0.009351476,"about_ca_system_score_gemma":0.005936692,"threshold_uncertainty_score":0.67181957},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020980113,0.035928972,0.0030999873,0.26663807,0.048454423,0.00010877294,0.0010685622,0.0009461115,0.64165705],"genre_scores_gemma":[0.011397986,0.012935098,0.0010240055,0.03591226,0.003456093,0.00006347607,0.0003968727,0.00021859653,0.93459564],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99869543,0.00012590448,0.00004896116,0.00032739274,0.0006182837,0.00018416386],"domain_scores_gemma":[0.9976357,0.00023669982,0.00014660266,0.00010352806,0.0010052439,0.0008721475],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010588953,0.0006301387,0.00047331644,0.0009114367,0.0025830374,0.003972132,0.0010081447,0.0023823641,0.18839428],"category_scores_gemma":[0.004803537,0.0002805034,0.00029680028,0.00054800604,0.00070771616,0.0023763268,0.0022494488,0.0038121936,0.12036878],"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.000009779243,0.000011929944,0.00014729386,0.00003692985,0.0000013584418,0.00006409345,0.00007114743,0.000025892094,0.00006547524,0.0057977377,0.96333206,0.030436207],"study_design_scores_gemma":[0.0000019683523,0.000004891551,0.00014008516,0.000046820154,9.043068e-7,0.0001805671,0.00008460346,0.000026029758,0.00005964337,0.0006272457,0.99882346,0.0000036835295],"about_ca_topic_score_codex":0.0042032436,"about_ca_topic_score_gemma":0.006629933,"teacher_disagreement_score":0.8116057,"about_ca_system_score_codex":0.0021285294,"about_ca_system_score_gemma":0.0042220764,"threshold_uncertainty_score":0.63024163},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99967337,0.000055587894,0.000022561575,0.0000028267982,4.485664e-7,8.011117e-7,0.00007279001,9.846693e-7,0.00017061022],"genre_scores_gemma":[0.99969494,0.000051766234,0.000057565856,0.000003517687,8.7564075e-7,0.0000014891486,0.00010170067,6.860141e-7,0.0000875908],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999453,0.0000067053825,0.0000033540712,0.000020322228,0.000009255015,0.000015017647],"domain_scores_gemma":[0.9998578,0.000010924209,0.000045464087,0.0000052350683,0.00003923797,0.00004142498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008200053,0.00010364428,0.0000898221,0.00057959324,0.00056274584,0.00043885998,0.00011775189,0.00011570874,0.00041660687],"category_scores_gemma":[0.00013961624,0.000086440115,0.00007180142,0.00062624045,0.0003354924,0.00019060896,0.00020610858,0.000099728124,0.000049499715],"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.00008770309,0.000022505787,0.983412,0.000012690729,0.000021365739,0.000069413865,0.00058707874,0.00020764854,0.013075477,0.000052639796,0.000044424105,0.0024069706],"study_design_scores_gemma":[3.041968e-7,0.000005551323,0.9995505,8.912111e-7,0.0000018243107,0.00001078511,0.00020243086,0.000050477283,0.00011365461,0.0000066320486,0.000056287103,6.4783825e-7],"about_ca_topic_score_codex":0.14674856,"about_ca_topic_score_gemma":0.30484933,"teacher_disagreement_score":0.14674856,"about_ca_system_score_codex":0.00087960664,"about_ca_system_score_gemma":0.0004561137,"threshold_uncertainty_score":0.29178876},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048841976,0.0034614136,0.67057407,0.0025640244,0.00058411655,0.0004568412,0.0054581473,0.064817786,0.20324165],"genre_scores_gemma":[0.2440785,0.0027330997,0.5034084,0.0002645705,0.0002416317,0.00033486108,0.008420343,0.008897432,0.23162115],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993326,0.00007051515,0.000028222163,0.00015979812,0.00030657125,0.00010235091],"domain_scores_gemma":[0.99885213,0.0001566211,0.000050890703,0.00018023902,0.0006562333,0.00010396396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006952755,0.00068381376,0.00037841685,0.0009853687,0.00079911324,0.0010553856,0.001170675,0.00038699328,0.04959673],"category_scores_gemma":[0.0014969668,0.00047002418,0.00043166234,0.0016324181,0.0006844231,0.000576908,0.0007069454,0.00067885686,0.014244532],"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.00034293745,0.00009790956,0.003910523,0.00052778143,0.00003734172,0.00040636215,0.0010192374,0.040838733,0.030715613,0.09791487,0.21486756,0.60932106],"study_design_scores_gemma":[0.0001661269,0.00017492165,0.0054378863,0.00016986484,0.000038238057,0.0003570849,0.00019903692,0.15141524,0.063387126,0.015716044,0.7628437,0.00009460715],"about_ca_topic_score_codex":0.102952845,"about_ca_topic_score_gemma":0.11653873,"teacher_disagreement_score":0.102952845,"about_ca_system_score_codex":0.005560127,"about_ca_system_score_gemma":0.0049905926,"threshold_uncertainty_score":0.20470715},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5613596,0.10333148,0.004449221,0.02258849,0.00031244702,0.00003728364,0.00066194957,0.00004289402,0.30721658],"genre_scores_gemma":[0.9455558,0.039751258,0.0006236497,0.00089592976,0.0003146287,0.000011741751,0.0001500445,0.000007125944,0.01268976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997003,0.000063389794,0.000018773188,0.00006662201,0.000082238425,0.000068675356],"domain_scores_gemma":[0.9981792,0.0006962411,0.0007168769,0.00009045582,0.0002102477,0.00010692549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000508757,0.00013773788,0.00017139413,0.0014119477,0.00040913335,0.0014050872,0.00019001612,0.00060709496,0.010817387],"category_scores_gemma":[0.002784189,0.00006583651,0.00019813943,0.001787131,0.0012159802,0.0014331199,0.00058970717,0.00045185065,0.00078539306],"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.00030812662,0.0002553148,0.16966623,0.00092835195,0.0002796452,0.0019133331,0.0014659769,0.008994361,0.004025031,0.45459938,0.009216814,0.34834746],"study_design_scores_gemma":[0.00003660651,0.00030303848,0.45177594,0.00039604472,0.000114723945,0.0021099544,0.0025504837,0.0032181598,0.0019387197,0.2766226,0.26088282,0.00005093452],"about_ca_topic_score_codex":0.0032852977,"about_ca_topic_score_gemma":0.0048726886,"teacher_disagreement_score":0.010817387,"about_ca_system_score_codex":0.00089814083,"about_ca_system_score_gemma":0.0005271967,"threshold_uncertainty_score":0.03618771},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98786175,0.0004464025,0.0010114685,0.00045034583,0.000039639788,0.000040851937,0.0018479804,0.00009383422,0.008207558],"genre_scores_gemma":[0.9953387,0.00021747572,0.00047213287,0.00004580485,0.000009495008,0.000007460256,0.0010738507,0.000020494555,0.0028146002],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9998067,0.000005011639,0.0000042985494,0.000030277768,0.00007263121,0.000081100334],"domain_scores_gemma":[0.999762,0.00003168064,0.000015425649,0.000009274125,0.00013563837,0.000046056477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024882294,0.00050331303,0.0002856631,0.000743991,0.002236433,0.001130129,0.00079772546,0.00051083264,0.0032774175],"category_scores_gemma":[0.00071207335,0.00028121003,0.0006245527,0.00079893693,0.0005558337,0.00059598533,0.000576712,0.0006974011,0.00018756227],"study_design_candidate":"observational","study_design_consensus":"observational","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.0019431732,0.0010146203,0.6550042,0.00024796638,0.00045126927,0.0008602237,0.0013046943,0.16503164,0.0845519,0.008806817,0.015945816,0.06483771],"study_design_scores_gemma":[0.000077908866,0.000054690463,0.8928491,0.000014536961,0.000093797586,0.000070204,0.0005948606,0.08904141,0.011192098,0.0008354828,0.0050965114,0.000079487014],"about_ca_topic_score_codex":0.97534174,"about_ca_topic_score_gemma":0.9767641,"teacher_disagreement_score":0.024658263,"about_ca_system_score_codex":0.012911512,"about_ca_system_score_gemma":0.008724364,"threshold_uncertainty_score":0.093680024},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.580322,0.00095811085,0.3656147,0.00031092283,0.00015471621,0.00018642093,0.0001635114,0.04816926,0.0041203625],"genre_scores_gemma":[0.7987871,0.00019816299,0.19480114,0.00020820154,0.00011281946,0.00014630363,0.0003341457,0.0030744,0.002337735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869174,0.00034816712,0.000108026325,0.0002065378,0.00044949973,0.00019603358],"domain_scores_gemma":[0.9950858,0.0019738062,0.000706651,0.0016535958,0.00040390078,0.00017630635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012121473,0.0006550377,0.0007789005,0.0008082881,0.0006002949,0.0009967311,0.002445212,0.0005658978,0.0015916016],"category_scores_gemma":[0.004016049,0.0008054836,0.00042136858,0.00071860483,0.00065447326,0.0017913756,0.0019512548,0.0013080649,0.00034013396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003664278,0.0008377363,0.020646097,0.0006679029,0.00026330943,0.001617015,0.00084871455,0.11261769,0.30859673,0.015520305,0.01639226,0.51832795],"study_design_scores_gemma":[0.00026029136,0.0007297211,0.00805515,0.00005613172,0.00016654437,0.0006488572,0.00012729324,0.7388784,0.23225302,0.004596771,0.0141101135,0.00011768255],"about_ca_topic_score_codex":0.0006696105,"about_ca_topic_score_gemma":0.0015197268,"teacher_disagreement_score":0.002445212,"about_ca_system_score_codex":0.00048869447,"about_ca_system_score_gemma":0.00086333015,"threshold_uncertainty_score":0.006410539},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06003993,0.042380955,0.74547714,0.0077328947,0.0016863863,0.0003696573,0.0015570938,0.012075466,0.1286806],"genre_scores_gemma":[0.39832467,0.025028545,0.5004817,0.0010005534,0.0012646322,0.00032262117,0.0055442243,0.0044362866,0.06359677],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977029,0.0005793922,0.00013590266,0.00031362462,0.0010622243,0.00020589399],"domain_scores_gemma":[0.9921963,0.004279793,0.00023506467,0.0008190562,0.0022490742,0.00022077629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019138622,0.0009016963,0.0009522875,0.002545058,0.0008098832,0.001849129,0.00096911786,0.0006995625,0.0139350435],"category_scores_gemma":[0.011376749,0.0006681007,0.00072093593,0.0038544498,0.0013343424,0.0026103137,0.0008754644,0.001270614,0.0021018432],"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.00025059344,0.000102987025,0.003081529,0.00080113235,0.000044285636,0.00014731377,0.00021288042,0.037938826,0.003357141,0.07138071,0.054927856,0.8277547],"study_design_scores_gemma":[0.00017081891,0.0003386181,0.0067863525,0.0011461487,0.0001646877,0.0008261685,0.00033363706,0.39431292,0.026407177,0.20558254,0.36378297,0.0001479789],"about_ca_topic_score_codex":0.03331557,"about_ca_topic_score_gemma":0.022756638,"teacher_disagreement_score":0.03331557,"about_ca_system_score_codex":0.0038739995,"about_ca_system_score_gemma":0.004180064,"threshold_uncertainty_score":0.06624329},"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":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22830068,0.24623112,0.16649233,0.19325367,0.004667953,0.000103516155,0.00057488924,0.0049478714,0.155428],"genre_scores_gemma":[0.84941846,0.038582854,0.041111633,0.0015395441,0.0016191577,0.000039330098,0.0002336454,0.00050768873,0.0669477],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951816,0.00009545583,0.000031971256,0.000068621215,0.00018375114,0.00010211172],"domain_scores_gemma":[0.9972114,0.0007562152,0.000111691086,0.00030361075,0.0011271077,0.00048999407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028498254,0.00030287434,0.00029035678,0.00055055437,0.0007609704,0.002825684,0.0008795727,0.0008355623,0.0057904576],"category_scores_gemma":[0.0040479777,0.00038936883,0.00018557896,0.00061027205,0.0012956749,0.0054289303,0.0011418185,0.0013222112,0.0011899758],"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.0004844396,0.00012926986,0.009920703,0.00028179688,0.000029016079,0.00019391827,0.0010969363,0.0077306,0.014293017,0.10277126,0.1493255,0.71374357],"study_design_scores_gemma":[0.000075389886,0.0005040289,0.033659782,0.00054399035,0.00009265654,0.0006097599,0.0030653432,0.11027899,0.0148146935,0.14855441,0.6876411,0.00015998137],"about_ca_topic_score_codex":0.02848881,"about_ca_topic_score_gemma":0.036915645,"teacher_disagreement_score":0.02848881,"about_ca_system_score_codex":0.003090579,"about_ca_system_score_gemma":0.0027683552,"threshold_uncertainty_score":0.05664599},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003259618,0.015531591,0.0023695417,0.012623414,0.003509853,0.000089653484,0.0071954145,0.0011700263,0.95425093],"genre_scores_gemma":[0.011347768,0.009245907,0.0015869617,0.0009662497,0.00022614203,0.000041530562,0.0026168146,0.0002662171,0.97370243],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990042,0.00006961406,0.000049379254,0.00031997927,0.00040709617,0.00014980658],"domain_scores_gemma":[0.9980252,0.00021764386,0.0000949903,0.0001701708,0.0010225337,0.00046946426],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004575407,0.0012643286,0.00094523304,0.0012067651,0.0031483967,0.0048879352,0.0010735113,0.0018474567,0.56257546],"category_scores_gemma":[0.0021977404,0.0005030996,0.0005359575,0.0016396341,0.0010000021,0.001824612,0.0017915767,0.0015915645,0.28042424],"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.00022084241,0.00006822816,0.0023046725,0.00082023174,0.000029590177,0.0011753346,0.0006914343,0.0005978649,0.0013947246,0.026216647,0.76499426,0.20148623],"study_design_scores_gemma":[0.000014697004,0.000023318786,0.0012387697,0.00021296028,0.000011460719,0.00020112185,0.00028919594,0.00016509867,0.0003363782,0.0021633743,0.9953246,0.000019095962],"about_ca_topic_score_codex":0.1061539,"about_ca_topic_score_gemma":0.26380748,"teacher_disagreement_score":0.43742454,"about_ca_system_score_codex":0.006469111,"about_ca_system_score_gemma":0.0070101027,"threshold_uncertainty_score":0.623933},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047091222,0.019317523,0.0038461299,0.0028944032,0.0012370045,0.000071375034,0.004713979,0.0007103506,0.9625001],"genre_scores_gemma":[0.0057827123,0.0076815537,0.0027276424,0.00036304767,0.000045062916,0.000016644255,0.0015200854,0.00017452623,0.98168874],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943334,0.000037736903,0.000018934814,0.00016463103,0.0002571207,0.000088220695],"domain_scores_gemma":[0.99901426,0.00014609266,0.000038159134,0.000106580854,0.00048492115,0.00021005166],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005278016,0.0017543396,0.0009005676,0.0018450394,0.003006952,0.004019633,0.0018235762,0.0019610547,0.565298],"category_scores_gemma":[0.001136222,0.0006727201,0.0005759477,0.0029057816,0.0010284553,0.0018012192,0.0015304441,0.0018288107,0.229703],"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.00049706775,0.00016226745,0.0028950386,0.00095211377,0.000060275554,0.0023691535,0.00088478794,0.002626704,0.007046752,0.033472054,0.3970675,0.5519662],"study_design_scores_gemma":[0.000024906105,0.000024739946,0.002724665,0.00030665068,0.00001764301,0.00029471697,0.00040909968,0.00042721405,0.000841878,0.002999854,0.99190444,0.000024101571],"about_ca_topic_score_codex":0.27650708,"about_ca_topic_score_gemma":0.6047822,"teacher_disagreement_score":0.7234929,"about_ca_system_score_codex":0.005111042,"about_ca_system_score_gemma":0.0061980374,"threshold_uncertainty_score":0.6200496},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25591585,0.0031434207,0.10719163,0.0028279712,0.0011236498,0.00046188832,0.02895352,0.05019611,0.5501859],"genre_scores_gemma":[0.8423401,0.0008896231,0.02989124,0.0004630882,0.00021719665,0.00036587517,0.030547148,0.0030709326,0.0922149],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980247,0.0003377225,0.00005929108,0.00029150126,0.00094578014,0.0003411828],"domain_scores_gemma":[0.9973857,0.00065743376,0.00011330327,0.00049422804,0.0012356095,0.00011376733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009995131,0.00086436525,0.0006320857,0.0017908982,0.00085069943,0.001669142,0.0011975128,0.0006093256,0.07421867],"category_scores_gemma":[0.0045068013,0.00017996518,0.00067723845,0.002062883,0.0003094657,0.0012679434,0.0007394453,0.0008156453,0.033922255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025530055,0.0008553985,0.016089294,0.001101766,0.00024272245,0.00036053965,0.00028167432,0.2377987,0.03676518,0.03497316,0.21485889,0.45411968],"study_design_scores_gemma":[0.00022668361,0.0010743131,0.021926912,0.00021940189,0.000119842036,0.00049278757,0.0004424734,0.6906679,0.08329636,0.012311216,0.18910281,0.00011930847],"about_ca_topic_score_codex":0.0045741745,"about_ca_topic_score_gemma":0.0032859738,"teacher_disagreement_score":0.07421867,"about_ca_system_score_codex":0.0019175877,"about_ca_system_score_gemma":0.0010101242,"threshold_uncertainty_score":0.24828613},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10707756,0.0047943783,0.19669752,0.003103958,0.0038927977,0.0005953612,0.0092813885,0.06525239,0.60930467],"genre_scores_gemma":[0.34702915,0.0025688512,0.19031394,0.0007528197,0.00027930862,0.000103295315,0.008530824,0.0040135817,0.44640824],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99989736,0.000007001031,0.00000413718,0.000018157352,0.000049928127,0.000023347142],"domain_scores_gemma":[0.9997706,0.000011259855,0.0000052486075,0.000016154398,0.00016709059,0.00002964159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010248292,0.00033776893,0.000214161,0.0006066218,0.0010441302,0.0008554168,0.00074784976,0.00027789103,0.05772207],"category_scores_gemma":[0.00040608871,0.00024268453,0.0001627046,0.00077800784,0.00016869328,0.00033371785,0.00032020424,0.00035853437,0.012048551],"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.00072702783,0.0001214573,0.0036077532,0.00035682082,0.00003406313,0.00047028044,0.0002221081,0.032458514,0.05493079,0.039375708,0.34459916,0.5230963],"study_design_scores_gemma":[0.00013038264,0.00017072537,0.0041052867,0.0001410769,0.000074007,0.00015437571,0.00019607595,0.15258813,0.061909884,0.010385146,0.77008057,0.000064261],"about_ca_topic_score_codex":0.2751198,"about_ca_topic_score_gemma":0.46245345,"teacher_disagreement_score":0.2751198,"about_ca_system_score_codex":0.003254104,"about_ca_system_score_gemma":0.004993461,"threshold_uncertainty_score":0.5470369},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004438153,0.025205286,0.021060076,0.06638151,0.07826974,0.0003560491,0.006851474,0.0033791568,0.79405844],"genre_scores_gemma":[0.022500696,0.0069102193,0.002738103,0.010125164,0.0049300194,0.0001126931,0.0016344801,0.0005700798,0.95047843],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991748,0.00011199288,0.000042482254,0.00021448288,0.00038564342,0.00007052251],"domain_scores_gemma":[0.9961152,0.0005040515,0.00018487027,0.00031727948,0.0023327563,0.00054582424],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00075850775,0.0010233086,0.0007088448,0.0013558891,0.0016047003,0.0021815007,0.000973867,0.001257764,0.36638612],"category_scores_gemma":[0.00701716,0.00023812769,0.000307134,0.00089960935,0.00065854745,0.0021545107,0.0016333362,0.0022011392,0.250415],"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.000049147886,0.000022586464,0.00042185502,0.0001604157,0.000005237903,0.00021032461,0.00035252888,0.00012453538,0.00058147917,0.009017586,0.9059462,0.08310813],"study_design_scores_gemma":[0.0000024781668,0.000011808892,0.00021383479,0.000061648236,0.0000028030422,0.00036640326,0.00014628356,0.00006889508,0.00017889822,0.0010038947,0.9979366,0.000006518897],"about_ca_topic_score_codex":0.0033447025,"about_ca_topic_score_gemma":0.0038230978,"teacher_disagreement_score":0.6336139,"about_ca_system_score_codex":0.0014017939,"about_ca_system_score_gemma":0.0016307529,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009768772,0.055624068,0.5025008,0.008204386,0.08713114,0.0024364342,0.011111646,0.09193887,0.23128389],"genre_scores_gemma":[0.018403364,0.047217753,0.104009934,0.0047325133,0.007212314,0.0014944539,0.029104471,0.02001822,0.76780695],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99777716,0.00029342523,0.00035898652,0.0003447684,0.00095597457,0.0002696738],"domain_scores_gemma":[0.9964477,0.0006359538,0.0001674251,0.0008087768,0.0013876435,0.00055259216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004654076,0.0037578284,0.0025757528,0.002140186,0.0012233625,0.006193049,0.002859226,0.002569323,0.2583356],"category_scores_gemma":[0.0070728413,0.001925564,0.0010681313,0.0018932916,0.0013115123,0.0050719194,0.0034989717,0.0066708014,0.25347924],"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.00024294564,0.00022682112,0.00083515834,0.00049411115,0.00008305017,0.00021884352,0.00014750175,0.0008479959,0.0044775405,0.0044416646,0.75210696,0.23587738],"study_design_scores_gemma":[0.000062404644,0.00010057983,0.0012660971,0.000413435,0.00004617334,0.00045045212,0.00008830209,0.005559473,0.0017245798,0.004004072,0.98621863,0.00006576501],"about_ca_topic_score_codex":0.00367025,"about_ca_topic_score_gemma":0.006393086,"teacher_disagreement_score":0.2583356,"about_ca_system_score_codex":0.0018126674,"about_ca_system_score_gemma":0.002393772,"threshold_uncertainty_score":0.86421865},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9939824,0.005483943,0.000057497437,0.00003497381,0.000012037438,0.000013733871,0.000033465883,0.000002889445,0.00037892148],"genre_scores_gemma":[0.99878067,0.00074961525,0.00011606515,0.000031314215,0.000017547263,0.0000094840125,0.000051636092,4.6897958e-7,0.00024329657],"study_design_codex":"observational","study_design_gemma":"nonrandomized_trial","domain_scores_codex":[0.9998252,0.00008068547,0.000017016024,0.000013184486,0.00003282199,0.000031135307],"domain_scores_gemma":[0.99969995,0.000087730696,0.000086277854,0.000014891953,0.0000384386,0.000072679024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003986567,0.00017977001,0.00043016757,0.00020646086,0.00013823365,0.00014733226,0.00012210169,0.00021051764,0.00091472],"category_scores_gemma":[0.0006151962,0.00008483741,0.0003129492,0.00010981477,0.0001305748,0.00009083426,0.00016149083,0.00024520274,0.00009753908],"study_design_candidate":"nonrandomized_trial","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.09353846,0.009462474,0.46459338,0.0018116514,0.0013170672,0.0017758927,0.00047271833,0.00043952698,0.19782422,0.00012765506,0.00082700566,0.22780994],"study_design_scores_gemma":[0.0012188845,0.070273705,0.91787314,0.00007052572,0.00048592765,0.0012757109,0.00023665045,0.00030015208,0.006844407,0.00005275256,0.0013573811,0.000010732766],"about_ca_topic_score_codex":0.0004008168,"about_ca_topic_score_gemma":0.0008484133,"teacher_disagreement_score":0.00091472,"about_ca_system_score_codex":0.00009183928,"about_ca_system_score_gemma":0.00011324701,"threshold_uncertainty_score":0.0030600429},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9493798,0.0013241274,0.00026423088,0.0014366176,0.000039397688,0.00033167476,0.0058389935,0.00003539563,0.041349784],"genre_scores_gemma":[0.98359007,0.0008763306,0.00043397894,0.00055100326,0.000012190139,0.000095787,0.002402959,0.000021850998,0.012015912],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9948597,0.00038634276,0.00021962506,0.00051555835,0.0021628402,0.0018559669],"domain_scores_gemma":[0.9852056,0.0012332797,0.0018931536,0.00056436204,0.008888565,0.0022151198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026255345,0.00032333072,0.0005170292,0.008439292,0.0099896565,0.0034912806,0.0019640923,0.00078620063,0.011162931],"category_scores_gemma":[0.011385772,0.0004393206,0.00037724627,0.0227344,0.0023747832,0.001145993,0.0022719402,0.00076684315,0.0009209417],"study_design_candidate":"observational","study_design_consensus":"observational","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.00024694548,0.00025057988,0.8755692,0.00049650937,0.000074556105,0.0016833666,0.033868782,0.0003402236,0.00072336686,0.008043789,0.022338571,0.056364108],"study_design_scores_gemma":[0.000019308269,0.00006680537,0.91837007,0.00020085939,0.00004152766,0.00032449368,0.04940799,0.00021607756,0.00021296994,0.00018758165,0.030919649,0.00003275189],"about_ca_topic_score_codex":0.9885726,"about_ca_topic_score_gemma":0.9958801,"teacher_disagreement_score":0.0584519,"about_ca_system_score_codex":0.0584519,"about_ca_system_score_gemma":0.1022263,"threshold_uncertainty_score":0.42410022},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048973184,0.15315339,0.00026548695,0.82628244,0.015203942,0.00001225405,0.000017137114,0.000013005091,0.0045625856],"genre_scores_gemma":[0.01859723,0.31179488,0.0010476635,0.6308698,0.030950237,0.000099516066,0.000023317127,0.00004341072,0.0065739853],"study_design_codex":"not_applicable","study_design_gemma":"qualitative","domain_scores_codex":[0.98778754,0.006027183,0.0010192451,0.0010555506,0.0028850755,0.0012254176],"domain_scores_gemma":[0.95214784,0.026183095,0.001859385,0.0010041853,0.010145995,0.008659447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01913515,0.0009627183,0.0022556763,0.003891716,0.00758597,0.011134711,0.003828046,0.025956066,0.013865905],"category_scores_gemma":[0.038093388,0.00085274177,0.00090692384,0.005182524,0.012943967,0.016292434,0.009988002,0.02835297,0.0030925735],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066161294,0.00017671994,0.0013746683,0.0039774184,0.00003048054,0.002036373,0.01255345,0.00013862457,0.00016069463,0.04027449,0.7831237,0.15608713],"study_design_scores_gemma":[0.000025002008,0.000088388006,0.00095002505,0.0092867995,0.000017819562,0.0023337284,0.015936378,0.000055150253,0.000026788011,0.015707176,0.9555429,0.000029886636],"about_ca_topic_score_codex":0.011506078,"about_ca_topic_score_gemma":0.020026365,"teacher_disagreement_score":0.025956066,"about_ca_system_score_codex":0.011087678,"about_ca_system_score_gemma":0.024656206,"threshold_uncertainty_score":0.10119754},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062365223,0.0008730046,0.90473264,0.00031799058,0.0002866366,0.00020461077,0.00025342288,0.0036325518,0.027333794],"genre_scores_gemma":[0.53169775,0.00028652413,0.44876856,0.00022446296,0.00014461589,0.00024472768,0.00052223104,0.0009248878,0.01718616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933225,0.00023349341,0.000022721384,0.00008773624,0.00021994837,0.00010382672],"domain_scores_gemma":[0.9988681,0.0005458497,0.0001324181,0.00015504622,0.00025295577,0.0000456623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009557433,0.0013314297,0.0011462376,0.0019447597,0.0010551322,0.0016454253,0.0019944515,0.0013764638,0.024252078],"category_scores_gemma":[0.003334307,0.00065741304,0.00062769273,0.0027236016,0.00051766087,0.0013174458,0.00077046384,0.00091020524,0.0036846464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055912195,0.00016157939,0.0004801,0.0001592864,0.000056483106,0.00008800675,0.00006600887,0.7439039,0.0053889393,0.0063817725,0.0071089854,0.23564598],"study_design_scores_gemma":[0.00005327492,0.00009373592,0.00017714464,0.00001245011,0.000015345136,0.000028400775,0.00002023064,0.9903832,0.0016428685,0.005248408,0.0023165287,0.000008459194],"about_ca_topic_score_codex":0.007732281,"about_ca_topic_score_gemma":0.0077082785,"teacher_disagreement_score":0.024252078,"about_ca_system_score_codex":0.0009609968,"about_ca_system_score_gemma":0.0010740934,"threshold_uncertainty_score":0.08113134},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008694376,0.05238513,0.008624359,0.0069285487,0.007509673,0.00030345368,0.009749132,0.0015339461,0.90427136],"genre_scores_gemma":[0.04005343,0.027792778,0.008991266,0.0009763784,0.0005676891,0.00026352052,0.00848442,0.0004204226,0.9124501],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99822015,0.00011580415,0.000075032214,0.0005030879,0.00081188185,0.000273963],"domain_scores_gemma":[0.9990351,0.000104666906,0.000058155158,0.00013126456,0.00048508713,0.00018572844],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006859273,0.0015769235,0.0013837717,0.0016717487,0.0031867733,0.0031538203,0.0015832915,0.0015491896,0.37659517],"category_scores_gemma":[0.0011968903,0.0006399314,0.00073861715,0.0017134356,0.0010697978,0.0011907172,0.0026374313,0.002126446,0.17185766],"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.00068825914,0.00017217772,0.0032025892,0.0045705405,0.00011451715,0.0018248091,0.0007849997,0.0027722379,0.02941772,0.0835635,0.52294207,0.34994668],"study_design_scores_gemma":[0.000034023513,0.00007636792,0.0010836285,0.00020314383,0.000018387476,0.00023370098,0.00013674743,0.0006050347,0.0033850172,0.003078844,0.9911117,0.00003342586],"about_ca_topic_score_codex":0.04104643,"about_ca_topic_score_gemma":0.06975279,"teacher_disagreement_score":0.62340486,"about_ca_system_score_codex":0.006384075,"about_ca_system_score_gemma":0.0058776406,"threshold_uncertainty_score":0.8892113},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042960927,0.00032566467,0.9121329,0.00043460177,0.00019698498,0.00014521893,0.00039297875,0.030099249,0.01331149],"genre_scores_gemma":[0.36790204,0.00019602977,0.6108128,0.00043214267,0.000035298806,0.00020683695,0.0009817749,0.00086110306,0.01857198],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990535,0.000015131536,0.000004204674,0.000017560826,0.00004071932,0.000017020438],"domain_scores_gemma":[0.999811,0.000047887435,0.000015586676,0.00003319268,0.00005891075,0.000033441625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002428827,0.00042477605,0.00027913027,0.0002117353,0.00028626586,0.00066134817,0.0014539271,0.000467404,0.010918233],"category_scores_gemma":[0.00064093823,0.0002719567,0.00026087524,0.00027744577,0.00027195955,0.0009335877,0.00059865025,0.0010553995,0.0022906547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002117752,0.0005470332,0.004860185,0.0005340137,0.00014785363,0.00053615595,0.0004059584,0.13231571,0.22203915,0.07334251,0.102624334,0.4605294],"study_design_scores_gemma":[0.00010549695,0.00033271915,0.0004747433,0.000014677052,0.000017976492,0.00011622018,0.000045104458,0.9077545,0.048867777,0.0076019657,0.034639258,0.00002955772],"about_ca_topic_score_codex":0.0015783318,"about_ca_topic_score_gemma":0.0028643203,"teacher_disagreement_score":0.010918233,"about_ca_system_score_codex":0.0005049497,"about_ca_system_score_gemma":0.00077403896,"threshold_uncertainty_score":0.03652513},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22754663,0.00026394275,0.75924027,0.00018707226,0.00006363648,0.00008708616,0.00014560897,0.0006017823,0.011863982],"genre_scores_gemma":[0.93507934,0.00013688198,0.060200293,0.00008315545,0.00006789857,0.00005832544,0.00013754044,0.00021245223,0.0040242346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993179,0.00011697656,0.000035186364,0.00017871599,0.00027265024,0.000078653524],"domain_scores_gemma":[0.99801046,0.00047261824,0.0005089063,0.0004348529,0.00031703786,0.00025605824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008276319,0.00041750577,0.00050752383,0.0017469724,0.00061698945,0.0016429964,0.00070443953,0.00064208184,0.0031781225],"category_scores_gemma":[0.003933903,0.00028645343,0.00058266753,0.0007414324,0.0025840385,0.0030511213,0.0017175857,0.0010332873,0.0004394936],"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.00019239224,0.00009374955,0.0049650846,0.00012392644,0.00005831166,0.00044231967,0.00071699056,0.04476017,0.04846527,0.8247595,0.0018402316,0.07358204],"study_design_scores_gemma":[0.000022766177,0.00035404591,0.0100927185,0.000041966596,0.00003056086,0.0010529333,0.0002889411,0.51676154,0.020035192,0.44304034,0.008173975,0.00010497349],"about_ca_topic_score_codex":0.00075657666,"about_ca_topic_score_gemma":0.00054471224,"teacher_disagreement_score":0.0031781225,"about_ca_system_score_codex":0.00081994926,"about_ca_system_score_gemma":0.00042798888,"threshold_uncertainty_score":0.010631859},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008694186,0.000107713175,0.98365766,0.00012749217,0.000027805567,0.000034840425,0.000037762842,0.0006026635,0.006709874],"genre_scores_gemma":[0.5859119,0.00036803875,0.40200827,0.00016107698,0.000121047204,0.00027146548,0.0002066353,0.00064674614,0.010304803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993082,0.00017583954,0.00004007318,0.00012127174,0.00025460855,0.000100018704],"domain_scores_gemma":[0.9994742,0.0001655514,0.000054688055,0.00017682671,0.00006968861,0.00005898916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008689247,0.00052446907,0.00047467963,0.0006903704,0.0009676108,0.002128097,0.0015588016,0.0006326344,0.0037199832],"category_scores_gemma":[0.0016860402,0.00038864088,0.0007549842,0.0005547754,0.0037425747,0.002757145,0.0026142683,0.0019057448,0.00083631545],"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.000021473035,0.000014427373,0.00014720608,0.000022662598,0.000005509864,0.00007079668,0.00023099211,0.03278783,0.0024516266,0.953299,0.0005203671,0.010428037],"study_design_scores_gemma":[0.000020642972,0.000040007108,0.0000884045,0.000021758417,0.000009979757,0.00008459035,0.00006261743,0.33488953,0.0040545464,0.6413075,0.019395998,0.000024518815],"about_ca_topic_score_codex":0.0019815464,"about_ca_topic_score_gemma":0.0019617334,"teacher_disagreement_score":0.0037199832,"about_ca_system_score_codex":0.0012651995,"about_ca_system_score_gemma":0.0012600427,"threshold_uncertainty_score":0.012444615},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008694186,0.000107713175,0.98365766,0.00012749217,0.000027805567,0.000034840425,0.000037762842,0.0006026635,0.006709874],"genre_scores_gemma":[0.5859119,0.00036803875,0.40200827,0.00016107698,0.000121047204,0.00027146548,0.0002066353,0.00064674614,0.010304803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993082,0.00017583954,0.00004007318,0.00012127174,0.00025460855,0.000100018704],"domain_scores_gemma":[0.9994742,0.0001655514,0.000054688055,0.00017682671,0.00006968861,0.00005898916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008689247,0.00052446907,0.00047467963,0.0006903704,0.0009676108,0.002128097,0.0015588016,0.0006326344,0.0037199832],"category_scores_gemma":[0.0016860402,0.00038864088,0.0007549842,0.0005547754,0.0037425747,0.002757145,0.0026142683,0.0019057448,0.00083631545],"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.000021473035,0.000014427373,0.00014720608,0.000022662598,0.000005509864,0.00007079668,0.00023099211,0.03278783,0.0024516266,0.953299,0.0005203671,0.010428037],"study_design_scores_gemma":[0.000020642972,0.000040007108,0.0000884045,0.000021758417,0.000009979757,0.00008459035,0.00006261743,0.33488953,0.0040545464,0.6413075,0.019395998,0.000024518815],"about_ca_topic_score_codex":0.0019815464,"about_ca_topic_score_gemma":0.0019617334,"teacher_disagreement_score":0.0037199832,"about_ca_system_score_codex":0.0012651995,"about_ca_system_score_gemma":0.0012600427,"threshold_uncertainty_score":0.012444615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22754663,0.00026394275,0.75924027,0.00018707226,0.00006363648,0.00008708616,0.00014560897,0.0006017823,0.011863982],"genre_scores_gemma":[0.93507934,0.00013688198,0.060200293,0.00008315545,0.00006789857,0.00005832544,0.00013754044,0.00021245223,0.0040242346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993179,0.00011697656,0.000035186364,0.00017871599,0.00027265024,0.000078653524],"domain_scores_gemma":[0.99801046,0.00047261824,0.0005089063,0.0004348529,0.00031703786,0.00025605824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008276319,0.00041750577,0.00050752383,0.0017469724,0.00061698945,0.0016429964,0.00070443953,0.00064208184,0.0031781225],"category_scores_gemma":[0.003933903,0.00028645343,0.00058266753,0.0007414324,0.0025840385,0.0030511213,0.0017175857,0.0010332873,0.0004394936],"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.00019239224,0.00009374955,0.0049650846,0.00012392644,0.00005831166,0.00044231967,0.00071699056,0.04476017,0.04846527,0.8247595,0.0018402316,0.07358204],"study_design_scores_gemma":[0.000022766177,0.00035404591,0.0100927185,0.000041966596,0.00003056086,0.0010529333,0.0002889411,0.51676154,0.020035192,0.44304034,0.008173975,0.00010497349],"about_ca_topic_score_codex":0.00075657666,"about_ca_topic_score_gemma":0.00054471224,"teacher_disagreement_score":0.0031781225,"about_ca_system_score_codex":0.00081994926,"about_ca_system_score_gemma":0.00042798888,"threshold_uncertainty_score":0.010631859},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03377652,0.0012455301,0.875306,0.0004821665,0.00075286336,0.00025125153,0.0017638372,0.04969259,0.036729198],"genre_scores_gemma":[0.4961572,0.0007677457,0.46493927,0.0006720554,0.0004592847,0.000647783,0.005577742,0.0050758105,0.025703216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997879,0.00034710584,0.00022985767,0.00032944122,0.0008295748,0.0003850522],"domain_scores_gemma":[0.99486744,0.0009362484,0.00030819036,0.0025253117,0.0010249175,0.00033779498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016367447,0.0013160857,0.00086708047,0.0015167651,0.001296105,0.0038094274,0.00360153,0.00075369177,0.023802575],"category_scores_gemma":[0.0064084553,0.00061388686,0.00063773803,0.0018693828,0.0008401201,0.0068842303,0.006035301,0.0014998649,0.006497174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033428858,0.00044642953,0.0022871748,0.00077306444,0.00011808995,0.00049877627,0.000518082,0.040045165,0.050667875,0.17640166,0.11021674,0.61468405],"study_design_scores_gemma":[0.00050348486,0.00072485267,0.0006559077,0.00025181903,0.000140333,0.0005269823,0.00027332833,0.43741384,0.119871095,0.229113,0.21030886,0.00021648494],"about_ca_topic_score_codex":0.0015150403,"about_ca_topic_score_gemma":0.0022709991,"teacher_disagreement_score":0.023802575,"about_ca_system_score_codex":0.0010924939,"about_ca_system_score_gemma":0.0015946636,"threshold_uncertainty_score":0.07962757},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0720001,0.0008172097,0.72887117,0.00076910993,0.00046655908,0.00026211806,0.00078400405,0.18432914,0.011700666],"genre_scores_gemma":[0.48575988,0.00038008514,0.47377166,0.0009832092,0.000091468886,0.000525756,0.0031555125,0.020280864,0.015051384],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994332,0.000098239485,0.000037436726,0.00015925935,0.0001555845,0.00011620225],"domain_scores_gemma":[0.9980252,0.0007078552,0.000075747965,0.0007170247,0.0002567697,0.00021742542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009862473,0.0013279642,0.00058273197,0.00045106953,0.000584255,0.0012423978,0.003038416,0.00088286377,0.011391087],"category_scores_gemma":[0.004532294,0.0008955708,0.00085829804,0.0003957142,0.0010439397,0.0041182167,0.0033575373,0.0019947942,0.0035883188],"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.0021367334,0.00072044885,0.010446462,0.0012844221,0.00028234176,0.0008015624,0.0020844792,0.11675523,0.17482412,0.034033686,0.1603232,0.4963073],"study_design_scores_gemma":[0.0003033579,0.000463174,0.0018336655,0.00008084441,0.000059118272,0.00024400959,0.00024407358,0.7675527,0.11827696,0.026875624,0.083925195,0.00014132026],"about_ca_topic_score_codex":0.0029646452,"about_ca_topic_score_gemma":0.0046703974,"teacher_disagreement_score":0.011391087,"about_ca_system_score_codex":0.0007596658,"about_ca_system_score_gemma":0.0015017692,"threshold_uncertainty_score":0.03810692},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030581128,0.0003933417,0.6451389,0.0011027239,0.0005598879,0.00091541506,0.014693124,0.20261754,0.1039979],"genre_scores_gemma":[0.15947974,0.0005472777,0.7089968,0.00043480998,0.00023254687,0.0009977571,0.021829646,0.065731004,0.04175045],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983834,0.00028491326,0.000061168146,0.00017301654,0.00094527274,0.00015221913],"domain_scores_gemma":[0.99523216,0.0006800392,0.00014857251,0.00065167993,0.0028532208,0.00043431533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033856798,0.00091568835,0.0006870044,0.000997455,0.0009988786,0.0014291906,0.002612722,0.0005916071,0.04976612],"category_scores_gemma":[0.0063886656,0.00068294536,0.0008956493,0.0014768814,0.00060450105,0.001195134,0.0013394252,0.0020390016,0.023732752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012877398,0.00033476288,0.0069364645,0.0006184052,0.00014865046,0.00035725598,0.00082999014,0.16674717,0.025952084,0.05882654,0.40651807,0.33144295],"study_design_scores_gemma":[0.00051519205,0.00023275033,0.0029877059,0.00012735873,0.000041346335,0.00014102207,0.00019612726,0.65587246,0.051308185,0.012378483,0.27608323,0.000116222174],"about_ca_topic_score_codex":0.019987866,"about_ca_topic_score_gemma":0.021380747,"teacher_disagreement_score":0.04976612,"about_ca_system_score_codex":0.0020217772,"about_ca_system_score_gemma":0.005083446,"threshold_uncertainty_score":0.1664843},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15596844,0.0008207217,0.69851625,0.00055875425,0.00045133856,0.0006213726,0.0067397766,0.10210936,0.03421404],"genre_scores_gemma":[0.6405496,0.00050590874,0.33284575,0.00034726888,0.00005016872,0.0007802697,0.014493632,0.0052853473,0.005142145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999421,0.00015560024,0.0000391778,0.0000743881,0.00021660679,0.000093227274],"domain_scores_gemma":[0.9992424,0.00022175205,0.000052368454,0.00015944563,0.00024169733,0.00008233248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014446815,0.0012526005,0.0006498134,0.0007630687,0.00044992063,0.0006598246,0.0023121599,0.0007297825,0.0076167434],"category_scores_gemma":[0.0021986344,0.00058301946,0.0010035187,0.00074939826,0.00037965318,0.00093262043,0.0010713872,0.0012780342,0.0012724664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005199782,0.00033006276,0.005913959,0.00038911524,0.00023304639,0.00021830885,0.0001939758,0.885174,0.016942494,0.012591972,0.027897114,0.04959603],"study_design_scores_gemma":[0.000061140374,0.000082570885,0.00048669343,0.000012256317,0.00001604281,0.000023641978,0.000015342415,0.9859013,0.00516901,0.0015675814,0.006646727,0.000017664166],"about_ca_topic_score_codex":0.010029224,"about_ca_topic_score_gemma":0.013098211,"teacher_disagreement_score":0.010029224,"about_ca_system_score_codex":0.0012301028,"about_ca_system_score_gemma":0.002291845,"threshold_uncertainty_score":0.025480509},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011722574,0.0012180181,0.8155792,0.0019943023,0.002603397,0.0013916055,0.028377702,0.036761697,0.10035152],"genre_scores_gemma":[0.04293448,0.0009631043,0.82208663,0.0010240799,0.0005749478,0.001578918,0.05705241,0.018284023,0.05550139],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964097,0.00091895193,0.00019929434,0.00044844628,0.0016596757,0.00036381127],"domain_scores_gemma":[0.99148023,0.0023564026,0.00022546008,0.0018149645,0.003537123,0.0005856562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005128897,0.0020261295,0.0012255698,0.0017353625,0.0008797395,0.0023492968,0.0025635394,0.0015464688,0.07020686],"category_scores_gemma":[0.011675995,0.00071972434,0.0015395896,0.0017723603,0.0005367131,0.0016890102,0.0016290069,0.0021449612,0.050305635],"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.0017890099,0.00076768483,0.0025163833,0.0012256436,0.0003226495,0.00018241245,0.00016683788,0.066141374,0.025332151,0.03550222,0.5001163,0.36593735],"study_design_scores_gemma":[0.0013257941,0.0012895449,0.0029686638,0.00020931468,0.00018674252,0.0002845754,0.000111557434,0.24759391,0.10399627,0.023036191,0.6188382,0.00015936066],"about_ca_topic_score_codex":0.0051312135,"about_ca_topic_score_gemma":0.0041024024,"teacher_disagreement_score":0.07020686,"about_ca_system_score_codex":0.0013361108,"about_ca_system_score_gemma":0.0038278585,"threshold_uncertainty_score":0.23486531},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011722574,0.0012180181,0.8155792,0.0019943023,0.002603397,0.0013916055,0.028377702,0.036761697,0.10035152],"genre_scores_gemma":[0.04293448,0.0009631043,0.82208663,0.0010240799,0.0005749478,0.001578918,0.05705241,0.018284023,0.05550139],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964097,0.00091895193,0.00019929434,0.00044844628,0.0016596757,0.00036381127],"domain_scores_gemma":[0.99148023,0.0023564026,0.00022546008,0.0018149645,0.003537123,0.0005856562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005128897,0.0020261295,0.0012255698,0.0017353625,0.0008797395,0.0023492968,0.0025635394,0.0015464688,0.07020686],"category_scores_gemma":[0.011675995,0.00071972434,0.0015395896,0.0017723603,0.0005367131,0.0016890102,0.0016290069,0.0021449612,0.050305635],"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.0017890099,0.00076768483,0.0025163833,0.0012256436,0.0003226495,0.00018241245,0.00016683788,0.066141374,0.025332151,0.03550222,0.5001163,0.36593735],"study_design_scores_gemma":[0.0013257941,0.0012895449,0.0029686638,0.00020931468,0.00018674252,0.0002845754,0.000111557434,0.24759391,0.10399627,0.023036191,0.6188382,0.00015936066],"about_ca_topic_score_codex":0.0051312135,"about_ca_topic_score_gemma":0.0041024024,"teacher_disagreement_score":0.07020686,"about_ca_system_score_codex":0.0013361108,"about_ca_system_score_gemma":0.0038278585,"threshold_uncertainty_score":0.23486531},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09005329,0.000268645,0.90668523,0.00008225456,0.00002549197,0.00003229643,0.000039250197,0.00064138015,0.0021721928],"genre_scores_gemma":[0.8979689,0.00021281032,0.10034176,0.000059923586,0.0000310088,0.000048873513,0.000066236185,0.00019493462,0.0010756338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996319,0.00008935645,0.000018895891,0.000046153673,0.000155176,0.000058534533],"domain_scores_gemma":[0.99860007,0.0007394278,0.00020511053,0.00023165437,0.00017392886,0.000049853457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010299732,0.0007230572,0.0004189642,0.0008134619,0.00031789741,0.0006574835,0.0009919901,0.0003825263,0.00070601894],"category_scores_gemma":[0.0039233975,0.0003046258,0.00042970607,0.0004684091,0.00039658466,0.0012367312,0.00080898654,0.00086693745,0.00014116091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010949332,0.00008307861,0.0041894056,0.000058164776,0.000041148433,0.00013698876,0.00012359343,0.91250545,0.01815532,0.0319656,0.00038334535,0.032248408],"study_design_scores_gemma":[0.0000019501283,0.000009595198,0.00015280773,0.0000024751346,0.0000030692997,0.0000097865095,0.0000043856558,0.9937674,0.001811995,0.004052042,0.00018189127,0.0000025858421],"about_ca_topic_score_codex":0.0021438408,"about_ca_topic_score_gemma":0.0020180063,"teacher_disagreement_score":0.0021438408,"about_ca_system_score_codex":0.0006724115,"about_ca_system_score_gemma":0.0007493661,"threshold_uncertainty_score":0.00544703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028405832,0.007405661,0.015568407,0.001691835,0.0024459034,0.0005406476,0.024254233,0.022124527,0.9231282],"genre_scores_gemma":[0.004783254,0.00304032,0.0027165413,0.0007747918,0.00018072137,0.00022916414,0.011468643,0.0028430368,0.97396356],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992797,0.000048067002,0.000058505375,0.00020090607,0.0002647793,0.00014800836],"domain_scores_gemma":[0.99852186,0.00031589888,0.00007207922,0.00051968114,0.00034212662,0.00022829353],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016652334,0.0034805785,0.0026178504,0.0029654556,0.0025643788,0.0044855154,0.0028456512,0.0045070364,0.9359433],"category_scores_gemma":[0.0032478124,0.0017783061,0.0013970488,0.010254442,0.0015262194,0.009835663,0.0057962774,0.0029581445,0.9558459],"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.00028728522,0.00015842626,0.00045563822,0.00056908303,0.000045880406,0.0002043873,0.0000820765,0.00088456157,0.001261671,0.006927253,0.6755436,0.3135801],"study_design_scores_gemma":[0.000043143846,0.00003666613,0.00079844863,0.0002555283,0.00004771573,0.00017307133,0.00006032938,0.0010849305,0.00070530584,0.0020742165,0.99468637,0.00003429197],"about_ca_topic_score_codex":0.019778468,"about_ca_topic_score_gemma":0.014070532,"teacher_disagreement_score":0.064056695,"about_ca_system_score_codex":0.0025982044,"about_ca_system_score_gemma":0.0011584586,"threshold_uncertainty_score":0.09136909},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003030495,0.007726067,0.015791921,0.0016832632,0.002419047,0.0005525506,0.02433666,0.022422232,0.92203784],"genre_scores_gemma":[0.004821011,0.0031559605,0.0027547784,0.000801084,0.00018091183,0.0002388822,0.011482323,0.002744099,0.973821],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99930954,0.000046798912,0.000055994675,0.00019898027,0.0002462845,0.00014251364],"domain_scores_gemma":[0.99856526,0.00031387954,0.000073337695,0.00049655826,0.00032040162,0.00023059513],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016588721,0.0035082411,0.002663009,0.0028677231,0.0023660746,0.0043572797,0.0027956923,0.0044837995,0.93770045],"category_scores_gemma":[0.0030593302,0.0017766986,0.0013399624,0.009998677,0.0014587346,0.009265667,0.0056472854,0.0029161118,0.95715415],"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.00029790364,0.00016782686,0.00046617258,0.0005632972,0.00004684982,0.00019275017,0.00008063932,0.0009167795,0.0012677753,0.006365444,0.6718407,0.31779376],"study_design_scores_gemma":[0.000046734047,0.00003952798,0.0008395535,0.00026362683,0.00005054303,0.00017375716,0.000063290834,0.0011478794,0.0007131745,0.0019884603,0.994638,0.000035364526],"about_ca_topic_score_codex":0.017812597,"about_ca_topic_score_gemma":0.012840577,"teacher_disagreement_score":0.06229955,"about_ca_system_score_codex":0.0024371059,"about_ca_system_score_gemma":0.0010726204,"threshold_uncertainty_score":0.08886278},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002843302,0.00771975,0.016073322,0.0016975906,0.0024992547,0.00058568525,0.02587723,0.024066763,0.9186371],"genre_scores_gemma":[0.004715717,0.003108272,0.0028022393,0.0008009943,0.00017841127,0.00024405845,0.012268099,0.0029491603,0.9729331],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928916,0.000047394824,0.00005879404,0.0002003105,0.00025580917,0.00014845748],"domain_scores_gemma":[0.998519,0.00031851046,0.0000754622,0.00051802996,0.00033170957,0.00023726028],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017059855,0.0036285438,0.0027199103,0.0030250698,0.0025011946,0.004529739,0.002978942,0.004735005,0.9396097],"category_scores_gemma":[0.00321666,0.0019247623,0.0014334584,0.010396322,0.0015515914,0.009962468,0.005904866,0.0030410383,0.9586222],"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.0002953872,0.00017225677,0.00045241677,0.0006022969,0.000048246166,0.00020221475,0.00008023229,0.0009202297,0.0012567571,0.006623071,0.6858976,0.30344933],"study_design_scores_gemma":[0.000046673802,0.0000392282,0.00083269115,0.00027561942,0.000050510473,0.00017433135,0.00006380434,0.0011192978,0.0007082652,0.002009389,0.9946431,0.00003704536],"about_ca_topic_score_codex":0.020216238,"about_ca_topic_score_gemma":0.0143092545,"teacher_disagreement_score":0.060390294,"about_ca_system_score_codex":0.0026517601,"about_ca_system_score_gemma":0.0011631437,"threshold_uncertainty_score":0.08613944},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.603128,0.0012546192,0.37141904,0.0016392105,0.00013443691,0.0005265539,0.009193911,0.00540233,0.007301844],"genre_scores_gemma":[0.8141228,0.00042159524,0.17118056,0.00025403476,0.00005357836,0.0008252419,0.010551256,0.0010286819,0.0015622794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994416,0.0014343116,0.00027961118,0.0010285178,0.002518682,0.0003228785],"domain_scores_gemma":[0.9737467,0.013793269,0.0016864019,0.0053106383,0.0051365276,0.00032640834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003810276,0.00089604285,0.0006940227,0.0023208328,0.0008429403,0.0017380054,0.0017130882,0.00080448407,0.0012930145],"category_scores_gemma":[0.02730283,0.0006970233,0.0012405885,0.0024371848,0.0015617633,0.002275863,0.00088216877,0.0022428553,0.0005387199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056981243,0.0006983372,0.048611417,0.00068645435,0.00028082757,0.00031570758,0.0004772685,0.7051148,0.034235157,0.056440104,0.011022488,0.14154772],"study_design_scores_gemma":[0.000023686203,0.00012487723,0.00694427,0.00002365884,0.000030098972,0.00008019804,0.000065964894,0.96186197,0.011507127,0.015194102,0.004114638,0.000029337029],"about_ca_topic_score_codex":0.0038139902,"about_ca_topic_score_gemma":0.0058201943,"teacher_disagreement_score":0.0038139902,"about_ca_system_score_codex":0.001604795,"about_ca_system_score_gemma":0.002886799,"threshold_uncertainty_score":0.0201509},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028987285,0.0077281776,0.01549099,0.001697177,0.0024857246,0.00056543684,0.024459535,0.022954823,0.9217195],"genre_scores_gemma":[0.0046281624,0.003117813,0.002806907,0.00078361895,0.0001784741,0.00024142757,0.011282665,0.0028048763,0.9741561],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928635,0.000047396992,0.00005840781,0.0002007563,0.00025759605,0.0001495739],"domain_scores_gemma":[0.99851793,0.00032348398,0.00007362256,0.0005226901,0.0003259502,0.00023626068],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001722518,0.0036888078,0.0027117971,0.003068416,0.0025396007,0.0045280945,0.0029841724,0.004697186,0.93855566],"category_scores_gemma":[0.0031747222,0.00188258,0.0014618441,0.010374827,0.0015516061,0.010060149,0.005836568,0.0030535737,0.95764136],"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.00029532178,0.00017322025,0.00044653585,0.00059235474,0.000047003305,0.0002100197,0.000084434665,0.00089492043,0.0012423964,0.0064714174,0.667443,0.32209948],"study_design_scores_gemma":[0.00004588895,0.000038563518,0.00082407985,0.00026852172,0.000048078877,0.00017796033,0.000063595835,0.0010773498,0.0006966591,0.001989971,0.9947338,0.000035686382],"about_ca_topic_score_codex":0.02044708,"about_ca_topic_score_gemma":0.0141483825,"teacher_disagreement_score":0.061444342,"about_ca_system_score_codex":0.002623584,"about_ca_system_score_gemma":0.0011545754,"threshold_uncertainty_score":0.08764291},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025336852,0.007906166,0.01550719,0.0016049809,0.002387872,0.00060195534,0.020920431,0.024503987,0.9240337],"genre_scores_gemma":[0.0042731697,0.0032596865,0.002999405,0.0009365746,0.00017930601,0.0002914107,0.011176146,0.0030030669,0.97388136],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918073,0.000053476262,0.000067379886,0.00024625837,0.00027688735,0.00017516875],"domain_scores_gemma":[0.9983936,0.00035200268,0.00008253537,0.00057080534,0.00033041742,0.00027071367],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0019205085,0.0044317995,0.0032263142,0.003255608,0.0027073591,0.005180575,0.0033791936,0.0057385876,0.9503015],"category_scores_gemma":[0.00327095,0.0022701446,0.0016924709,0.011362106,0.0017441788,0.010992546,0.006712964,0.0034162076,0.967187],"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.00032671067,0.00020654933,0.00044888974,0.00070887775,0.000058515892,0.0002194818,0.000089797344,0.00092839793,0.0013253436,0.0065907016,0.67450833,0.31458828],"study_design_scores_gemma":[0.00006205463,0.000049747778,0.00083550194,0.0003279717,0.00006054382,0.00018705291,0.00007760173,0.0011776978,0.00066577474,0.0022189887,0.99429226,0.00004475996],"about_ca_topic_score_codex":0.020256616,"about_ca_topic_score_gemma":0.012950018,"teacher_disagreement_score":0.049698472,"about_ca_system_score_codex":0.0028470368,"about_ca_system_score_gemma":0.001224869,"threshold_uncertainty_score":0.07088876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024115518,0.0069117495,0.014536377,0.0015382326,0.0022110017,0.00056804286,0.020504363,0.02292514,0.9283935],"genre_scores_gemma":[0.004183944,0.0029360561,0.0027803085,0.00092133833,0.0001733282,0.00026432038,0.011112116,0.0028905643,0.974738],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992481,0.00004894389,0.000061126266,0.0002279138,0.00025802234,0.00015590245],"domain_scores_gemma":[0.99848324,0.00033035604,0.00007777929,0.00052734086,0.0003286171,0.00025268694],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017559663,0.0040529557,0.0029858737,0.0029753197,0.0025098715,0.005038152,0.003135022,0.0053474624,0.9510713],"category_scores_gemma":[0.0031143497,0.0020771637,0.0015658529,0.010554596,0.0015897736,0.010080623,0.006182466,0.0032414356,0.9667974],"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.0002942535,0.00018703872,0.00042457046,0.00062301906,0.000052152805,0.00019551064,0.00008022241,0.00083791727,0.0012431775,0.0063065463,0.6843685,0.3053871],"study_design_scores_gemma":[0.000057227127,0.00004413726,0.0008057995,0.00029415177,0.000053566466,0.00017007274,0.00006783172,0.001061666,0.00062672835,0.0020749017,0.9947029,0.000040910283],"about_ca_topic_score_codex":0.018007774,"about_ca_topic_score_gemma":0.011963471,"teacher_disagreement_score":0.048928678,"about_ca_system_score_codex":0.0026731458,"about_ca_system_score_gemma":0.0011523679,"threshold_uncertainty_score":0.06979084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023942206,0.0063810423,0.013997146,0.001429317,0.002049768,0.00055723044,0.0185257,0.021946374,0.93271923],"genre_scores_gemma":[0.0038411603,0.0026426218,0.0026063304,0.0008292508,0.00016067666,0.0002525924,0.009269117,0.0026497836,0.9777484],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99922574,0.000051723284,0.00006237008,0.00023514082,0.0002591129,0.00016593713],"domain_scores_gemma":[0.99834454,0.00036558617,0.00008711053,0.00057960284,0.0003426166,0.0002804854],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0019711638,0.004184745,0.0030423673,0.003020421,0.002686471,0.005118358,0.0033258796,0.0056778225,0.9533793],"category_scores_gemma":[0.0031765036,0.0022000272,0.0016461742,0.011008347,0.0017242578,0.010531233,0.0061668814,0.0033549455,0.96862954],"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.00034254845,0.00020653203,0.00046771285,0.0006761296,0.000056193097,0.00022027928,0.000087666594,0.0008799259,0.0014470763,0.0068425424,0.6652643,0.32350904],"study_design_scores_gemma":[0.00006118818,0.000049502953,0.0008260468,0.0003000664,0.0000558412,0.00017776074,0.00007258692,0.0011078623,0.0006786605,0.002044157,0.9945833,0.000043067193],"about_ca_topic_score_codex":0.01954038,"about_ca_topic_score_gemma":0.01278955,"teacher_disagreement_score":0.046620727,"about_ca_system_score_codex":0.0028076235,"about_ca_system_score_gemma":0.001163966,"threshold_uncertainty_score":0.0664987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024336164,0.0064259158,0.013553736,0.0014989102,0.0021483498,0.0005646676,0.01847651,0.021015672,0.9338826],"genre_scores_gemma":[0.004114955,0.0026819126,0.0026141645,0.00088253344,0.00016365429,0.0002600609,0.009337796,0.0025524995,0.9773924],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924433,0.000048212027,0.00006065521,0.0002335261,0.00025218257,0.00016117042],"domain_scores_gemma":[0.99849546,0.000330803,0.00007891158,0.0005160606,0.00032166965,0.00025717085],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017924672,0.004059006,0.002980585,0.0029892526,0.0026485943,0.0049791955,0.0031477683,0.0055480753,0.9537064],"category_scores_gemma":[0.0032021042,0.0020711569,0.0015363027,0.010426635,0.0016488605,0.010230384,0.0061383075,0.0032233666,0.96858233],"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.0003122302,0.00019358768,0.00045411766,0.00065356033,0.00005210357,0.00021179991,0.00008812099,0.0008722232,0.0013280627,0.0065613342,0.67584574,0.31342715],"study_design_scores_gemma":[0.00005922855,0.00004814838,0.0008524776,0.000307589,0.0000554891,0.00018515057,0.000075160424,0.0011187828,0.00065317424,0.0021004172,0.99450123,0.000043102016],"about_ca_topic_score_codex":0.018560097,"about_ca_topic_score_gemma":0.012154365,"teacher_disagreement_score":0.046293616,"about_ca_system_score_codex":0.002708285,"about_ca_system_score_gemma":0.0011360894,"threshold_uncertainty_score":0.06603217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13378622,0.005307358,0.8020532,0.010578568,0.0006614449,0.00013008318,0.00042630345,0.0014423324,0.04561444],"genre_scores_gemma":[0.87255013,0.002598243,0.11412499,0.0024863405,0.0005887887,0.00014166802,0.00023946419,0.00087240146,0.0063979737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982375,0.00035117802,0.00007515146,0.00032988313,0.0006505272,0.0003557075],"domain_scores_gemma":[0.99575305,0.0017969824,0.00053885876,0.001009607,0.00066906377,0.00023246995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015487779,0.0010727401,0.00085243303,0.00094592,0.0009813411,0.004144069,0.0017401701,0.0018308242,0.0044149146],"category_scores_gemma":[0.009636259,0.000981349,0.00061528245,0.00083824777,0.002405623,0.006768395,0.0029582165,0.004571238,0.0008731301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022612869,0.00027093562,0.017028758,0.0005782198,0.00016685255,0.000585669,0.0018241459,0.2824632,0.050981995,0.5457168,0.012530219,0.087627046],"study_design_scores_gemma":[0.000028628108,0.00012578446,0.0066229096,0.00020251265,0.00005482495,0.00037347403,0.0005447049,0.6314571,0.01082756,0.31822652,0.031451687,0.00008427262],"about_ca_topic_score_codex":0.0055475463,"about_ca_topic_score_gemma":0.0035558902,"teacher_disagreement_score":0.0055475463,"about_ca_system_score_codex":0.001788032,"about_ca_system_score_gemma":0.0016657615,"threshold_uncertainty_score":0.014769375},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055810075,0.001156796,0.86625785,0.00056653423,0.00026187097,0.0001255455,0.0010553295,0.063698694,0.011067291],"genre_scores_gemma":[0.5290786,0.00030111862,0.4548153,0.0005802824,0.00006252675,0.00021645492,0.0036529962,0.0056781275,0.005614633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922276,0.0002131071,0.000046082983,0.00015180976,0.00022523047,0.0001409471],"domain_scores_gemma":[0.9989477,0.00033564513,0.00010181312,0.0003716793,0.00016121188,0.00008193485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010558834,0.0016992172,0.0008816162,0.00062694843,0.00055086386,0.001298452,0.0028528043,0.00095977844,0.007159622],"category_scores_gemma":[0.0047113965,0.0007181536,0.0013099294,0.00052373525,0.00073950493,0.002372772,0.0023540335,0.0017694893,0.0021131549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008088215,0.00048595422,0.011238935,0.00064959144,0.0003402605,0.00065523223,0.00045492218,0.62103724,0.02887574,0.025725137,0.045296717,0.2644314],"study_design_scores_gemma":[0.000037794627,0.00004175958,0.00021671498,0.000016837595,0.00001765334,0.000046134195,0.000050925206,0.98620516,0.0034293118,0.005862535,0.0040612346,0.000013965395],"about_ca_topic_score_codex":0.007613067,"about_ca_topic_score_gemma":0.020656593,"teacher_disagreement_score":0.007613067,"about_ca_system_score_codex":0.00089265895,"about_ca_system_score_gemma":0.0022638503,"threshold_uncertainty_score":0.023951292},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09046364,0.0013409492,0.88272417,0.00035798323,0.00025955465,0.0003656785,0.00017842503,0.0059248987,0.018384714],"genre_scores_gemma":[0.6266908,0.00049925124,0.3609698,0.00042926616,0.000102047925,0.00042609923,0.00042071418,0.00066867535,0.009793308],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995427,0.00006494131,0.000028699982,0.00009165331,0.00019240796,0.00007953187],"domain_scores_gemma":[0.9995468,0.00008052474,0.00006770027,0.000099154764,0.00016470076,0.000041100568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042921113,0.000810799,0.00031488374,0.00040520317,0.00023286305,0.00089276186,0.001694025,0.0002726148,0.0037560523],"category_scores_gemma":[0.0006203339,0.00028245494,0.00035031617,0.00025310472,0.00031775833,0.0007724671,0.00072879496,0.0007437411,0.00095627026],"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.0007291261,0.00048413727,0.0042811413,0.0007337641,0.0002880892,0.00052351016,0.00031964414,0.19587055,0.354721,0.01889612,0.017530592,0.40562233],"study_design_scores_gemma":[0.00014795065,0.001015607,0.0012843509,0.000051258245,0.00017667295,0.00031141893,0.000096158066,0.7725842,0.17809758,0.005837129,0.040356163,0.00004160852],"about_ca_topic_score_codex":0.0007881371,"about_ca_topic_score_gemma":0.0024641284,"teacher_disagreement_score":0.0037560523,"about_ca_system_score_codex":0.00042883793,"about_ca_system_score_gemma":0.0010319665,"threshold_uncertainty_score":0.012565255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05035402,0.00045583365,0.9353792,0.00046741104,0.00029103353,0.00015526732,0.00013583594,0.0050308607,0.007730468],"genre_scores_gemma":[0.78067404,0.00016025538,0.21216252,0.00035434516,0.00008271345,0.00020856959,0.00024021717,0.0003074388,0.005809836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995103,0.000110372115,0.000021387614,0.00011865458,0.00012912805,0.00011004],"domain_scores_gemma":[0.9992675,0.00022678383,0.00007240978,0.00013492533,0.0001601612,0.00013808311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008112871,0.00059319765,0.00071467855,0.000274908,0.0004673425,0.00075854425,0.0019519327,0.00063353765,0.0041504474],"category_scores_gemma":[0.002637603,0.0003728996,0.00036221056,0.0003591202,0.0005689923,0.0008617559,0.0011523267,0.0014156348,0.0009069726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029201753,0.00022866964,0.0016330241,0.000097709664,0.000038701957,0.000102979684,0.000062756786,0.8662123,0.0040994165,0.0085803885,0.007160662,0.11149145],"study_design_scores_gemma":[0.000012756732,0.000018860637,0.00003866285,0.00000172056,0.0000018902026,0.0000047791377,0.0000037111643,0.9977679,0.00045459578,0.0011794923,0.0005134445,0.0000022300637],"about_ca_topic_score_codex":0.0068414835,"about_ca_topic_score_gemma":0.008711216,"teacher_disagreement_score":0.0068414835,"about_ca_system_score_codex":0.0010688341,"about_ca_system_score_gemma":0.002920159,"threshold_uncertainty_score":0.013884664},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007853767,0.00341361,0.9547417,0.00068974314,0.0002954219,0.0003084469,0.000093365634,0.0007430456,0.03186087],"genre_scores_gemma":[0.30820364,0.0059749023,0.6723815,0.0005907329,0.00024789857,0.00087643863,0.00017777238,0.0005398307,0.01100718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99919087,0.00015120415,0.000042449,0.00010560604,0.0004378656,0.00007202915],"domain_scores_gemma":[0.9993327,0.00014136378,0.00007440559,0.00012267068,0.00029922635,0.000029526582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008283443,0.0010046996,0.0005362626,0.00092829455,0.0005884655,0.0015727982,0.0017079879,0.0006011729,0.0040268553],"category_scores_gemma":[0.0023495303,0.00072718813,0.0005345329,0.00085488387,0.00075354095,0.0010431897,0.001078806,0.0016318425,0.0015690813],"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.00014379327,0.0002338574,0.0011953936,0.0013327468,0.00010478857,0.00017393164,0.00041252325,0.2625928,0.0721008,0.32612672,0.010407324,0.32517537],"study_design_scores_gemma":[0.000069030575,0.0004082542,0.0004889004,0.0003626027,0.0000734744,0.00031103022,0.0001241327,0.7557042,0.034253437,0.09947148,0.10866508,0.000068355694],"about_ca_topic_score_codex":0.0009760825,"about_ca_topic_score_gemma":0.001989793,"teacher_disagreement_score":0.0040268553,"about_ca_system_score_codex":0.0010441203,"about_ca_system_score_gemma":0.0012717963,"threshold_uncertainty_score":0.013471186},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7462207,0.0012580361,0.24418621,0.00028933823,0.00006859587,0.000088776935,0.00020527144,0.0034716248,0.004211354],"genre_scores_gemma":[0.89105797,0.00022399226,0.107196495,0.000029057894,0.000014533361,0.000059215097,0.00018049713,0.00016287253,0.0010752801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994174,0.0001575462,0.000036231926,0.00009996803,0.00022447527,0.00006435423],"domain_scores_gemma":[0.99739444,0.0011064121,0.0003444512,0.0004542216,0.0005658194,0.00013466075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010552533,0.00054287014,0.00070424995,0.000876925,0.00060610805,0.001084198,0.0011345396,0.0005580112,0.00070958113],"category_scores_gemma":[0.0074212956,0.0005868708,0.00024510434,0.0010484707,0.00059160654,0.0010262546,0.0004502424,0.0006137812,0.00030978926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003111888,0.000058345147,0.008964295,0.00005960483,0.000028112667,0.000096044096,0.000109375884,0.9174362,0.012723571,0.0025837745,0.0010686794,0.056560896],"study_design_scores_gemma":[0.000005607417,0.000014177168,0.00065698137,0.0000025331315,0.0000026871344,0.000009002597,0.0000064706014,0.99597675,0.0026629667,0.00051494845,0.00014376969,0.000004070059],"about_ca_topic_score_codex":0.010857186,"about_ca_topic_score_gemma":0.011860763,"teacher_disagreement_score":0.010857186,"about_ca_system_score_codex":0.0016351583,"about_ca_system_score_gemma":0.0017630293,"threshold_uncertainty_score":0.021587968},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18192333,0.0049265614,0.7729091,0.0017787955,0.0006373654,0.00041214516,0.0005825825,0.019577231,0.017252907],"genre_scores_gemma":[0.67802,0.00201445,0.3116663,0.00041148328,0.0002093038,0.0002557465,0.0009024966,0.00072114886,0.005798969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980234,0.00040652548,0.00012726002,0.00038985338,0.00076162996,0.0002912819],"domain_scores_gemma":[0.9955159,0.001750693,0.0004091232,0.0010326714,0.0010491489,0.00024249112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025675334,0.0011924976,0.001069867,0.0008416657,0.0007061414,0.002433605,0.0020510813,0.000833592,0.0035427592],"category_scores_gemma":[0.008468355,0.00064524537,0.0008743156,0.0010478348,0.0005744562,0.0024131243,0.001287601,0.0021937338,0.0018500182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050039677,0.00045526854,0.007878941,0.0006213852,0.00021570433,0.00026656693,0.00026504573,0.43291873,0.04175685,0.015562516,0.024160542,0.47539806],"study_design_scores_gemma":[0.00002926172,0.00015629374,0.0010773089,0.000027493928,0.000025740126,0.000045726847,0.00003405956,0.9763914,0.008558843,0.0073230946,0.006309544,0.000021123149],"about_ca_topic_score_codex":0.004094283,"about_ca_topic_score_gemma":0.0049764556,"teacher_disagreement_score":0.004094283,"about_ca_system_score_codex":0.0012303254,"about_ca_system_score_gemma":0.0022574456,"threshold_uncertainty_score":0.013578534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019494882,0.00012439974,0.9727286,0.00022207128,0.000032464086,0.00014410228,0.00007127453,0.0013982971,0.0057839253],"genre_scores_gemma":[0.10306633,0.00021517448,0.89406013,0.00008892571,0.00001660305,0.0001887159,0.00017535119,0.00030399137,0.0018847331],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989152,0.00029815527,0.000073677074,0.00018643582,0.00043142572,0.00009507673],"domain_scores_gemma":[0.99789006,0.0014775512,0.00014818885,0.00020081371,0.00025553798,0.000027889782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001567679,0.0007625613,0.0005198068,0.0007394063,0.0007077806,0.0011641202,0.0010875501,0.0007294884,0.0029747325],"category_scores_gemma":[0.0050609275,0.00044853362,0.0009462549,0.00052592985,0.001721472,0.0011623834,0.0009255648,0.0011030582,0.000500515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017866952,0.00024457436,0.0021808904,0.001212212,0.000093519004,0.00040411155,0.0010262554,0.37667954,0.04581665,0.29100043,0.0034348464,0.27772832],"study_design_scores_gemma":[0.00010469067,0.00013836747,0.00026936643,0.00013435101,0.00007628082,0.00013006185,0.00021399243,0.8343208,0.0636067,0.08084773,0.020131098,0.000026602936],"about_ca_topic_score_codex":0.0019254239,"about_ca_topic_score_gemma":0.003951838,"teacher_disagreement_score":0.0029747325,"about_ca_system_score_codex":0.000893203,"about_ca_system_score_gemma":0.001737911,"threshold_uncertainty_score":0.009951413},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.558149,0.0012436893,0.34856674,0.00059593254,0.0005854526,0.00020035754,0.0009858032,0.021354618,0.06831842],"genre_scores_gemma":[0.8132387,0.00034029502,0.16928655,0.00015324993,0.000040723688,0.00008989934,0.00096254813,0.00032441478,0.0155636445],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99978393,0.000021559903,0.0000098358205,0.00003732137,0.00009731114,0.000050049504],"domain_scores_gemma":[0.9996728,0.00009416202,0.000026703367,0.00006207836,0.00011082771,0.000033492244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019812846,0.00062086654,0.00027308537,0.00046452996,0.00025771654,0.0005553021,0.0006487438,0.00027443582,0.01057441],"category_scores_gemma":[0.0006693173,0.00014612275,0.00022766701,0.0005633088,0.00016693413,0.0005402922,0.0004128227,0.00046921484,0.0018108366],"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.0016622212,0.00042152574,0.0072260224,0.0005408045,0.0001240106,0.0012551233,0.00032906284,0.23239787,0.15488532,0.022079738,0.044790123,0.53428817],"study_design_scores_gemma":[0.00012994825,0.00068403117,0.003109897,0.00003636134,0.000028499164,0.00034448935,0.000087976456,0.8732872,0.086175136,0.003437551,0.03264736,0.000031590254],"about_ca_topic_score_codex":0.0026181953,"about_ca_topic_score_gemma":0.0046175034,"teacher_disagreement_score":0.01057441,"about_ca_system_score_codex":0.00042437422,"about_ca_system_score_gemma":0.0006098415,"threshold_uncertainty_score":0.03537488},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95609117,0.005886184,0.02032173,0.0034767326,0.00013603782,0.00002739952,0.0002011314,0.0007545115,0.013105076],"genre_scores_gemma":[0.98825246,0.0018058807,0.0054559037,0.00044001878,0.000069146445,0.000022245971,0.00026912123,0.000330731,0.0033544546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989881,0.0000877056,0.000027759892,0.00011965935,0.0005785926,0.00019808409],"domain_scores_gemma":[0.99678624,0.0008170001,0.0005767918,0.0005938256,0.0009952515,0.00023088828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007494986,0.00063185615,0.00045914654,0.0005450875,0.00060245977,0.0015191103,0.0011779245,0.0005370288,0.0023366984],"category_scores_gemma":[0.0052491515,0.00030681206,0.0003087222,0.0011655831,0.0007642945,0.0033984256,0.0010030488,0.0011862195,0.0009173908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012652478,0.0003841853,0.07885121,0.00085563405,0.00019216108,0.00076711155,0.0010243676,0.06999481,0.14133275,0.02431189,0.025265273,0.6557554],"study_design_scores_gemma":[0.00009278599,0.004040008,0.3118321,0.0004209508,0.0005428501,0.0041592303,0.0033879504,0.23006184,0.28634772,0.07096239,0.087892175,0.0002600523],"about_ca_topic_score_codex":0.0013700221,"about_ca_topic_score_gemma":0.002063578,"teacher_disagreement_score":0.0023366984,"about_ca_system_score_codex":0.001085158,"about_ca_system_score_gemma":0.0006050345,"threshold_uncertainty_score":0.007873416},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012279988,0.00086229335,0.9627853,0.0009165423,0.00010624039,0.00045668156,0.0006715804,0.0005888124,0.021332545],"genre_scores_gemma":[0.26067382,0.00085655815,0.7320089,0.00027009845,0.00016786011,0.001800647,0.00081776315,0.00031588762,0.0030885465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9848925,0.0063857646,0.00069670315,0.00077968923,0.0067938357,0.00045157218],"domain_scores_gemma":[0.96568066,0.023098547,0.0025973395,0.0037646391,0.0045268517,0.0003319576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018673198,0.0026975847,0.0011136082,0.0117296735,0.0012594782,0.0058476175,0.002426682,0.0014549001,0.0066682138],"category_scores_gemma":[0.044130433,0.00083730096,0.0019955738,0.005919652,0.0036262015,0.006237693,0.0021377963,0.0024449818,0.00072519056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007833422,0.00013390042,0.0035009005,0.000366285,0.00020734277,0.000055336634,0.00022542848,0.2811626,0.0027933316,0.63138723,0.0037529282,0.076336324],"study_design_scores_gemma":[0.000040424133,0.00045183595,0.00352141,0.00030864487,0.00011024211,0.000120975696,0.00060313,0.61545825,0.0034561348,0.35143766,0.024364585,0.00012665287],"about_ca_topic_score_codex":0.0053585386,"about_ca_topic_score_gemma":0.004490507,"teacher_disagreement_score":0.018673198,"about_ca_system_score_codex":0.006124757,"about_ca_system_score_gemma":0.003969169,"threshold_uncertainty_score":0.098754466},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3381778,0.00203414,0.60491973,0.0014040525,0.0001625391,0.00010198273,0.00020369081,0.019453814,0.03354218],"genre_scores_gemma":[0.91228604,0.0001672796,0.084408104,0.00011450925,0.000064140695,0.00005868204,0.00012260434,0.0009807874,0.0017978104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986468,0.00027061606,0.000074017815,0.0001777047,0.00058080826,0.00025007044],"domain_scores_gemma":[0.99625057,0.0013491021,0.0004910464,0.0012209133,0.0005213531,0.00016694401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010047776,0.0006860407,0.000400257,0.00078480167,0.0005004413,0.0012984236,0.0010333493,0.00033165183,0.0033457775],"category_scores_gemma":[0.006077545,0.0003231782,0.00028625006,0.00075947517,0.000938839,0.001797971,0.0009645646,0.001379151,0.0010109113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010270921,0.0003871087,0.011321576,0.00036115787,0.000046887508,0.000270639,0.00040633653,0.18833663,0.20285042,0.057869826,0.013845221,0.5232771],"study_design_scores_gemma":[0.000046453635,0.0002997315,0.0033381376,0.00003354464,0.000041343992,0.00023942736,0.000046163528,0.8324499,0.14327483,0.013458231,0.006720851,0.00005133726],"about_ca_topic_score_codex":0.0014116956,"about_ca_topic_score_gemma":0.0020572736,"teacher_disagreement_score":0.0033457775,"about_ca_system_score_codex":0.0014383231,"about_ca_system_score_gemma":0.001605087,"threshold_uncertainty_score":0.011192799},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03645472,0.0005747204,0.9209341,0.0018945823,0.00042068955,0.00034421138,0.0002755446,0.0089094695,0.03019203],"genre_scores_gemma":[0.21336572,0.00061257737,0.76276976,0.00076362374,0.00012583334,0.0002686086,0.000793981,0.0014038862,0.019895948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916935,0.000126696,0.00005755129,0.00015476452,0.00032932687,0.00016232383],"domain_scores_gemma":[0.99916625,0.00006818771,0.00005491031,0.0003901755,0.00017614015,0.00014437141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010449721,0.00057594985,0.00036302983,0.0005245003,0.0007749921,0.0026831846,0.0016020752,0.00068335223,0.006050544],"category_scores_gemma":[0.0015541887,0.00049034925,0.00063751044,0.0005616934,0.0005967939,0.003338852,0.0023627665,0.0023677836,0.0033310081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005138128,0.00046640457,0.0048302235,0.00048183894,0.00021275195,0.001000519,0.0010014179,0.110480994,0.13015567,0.20094879,0.04939407,0.5005135],"study_design_scores_gemma":[0.00012124855,0.0005928015,0.004459852,0.0002631685,0.00016075329,0.0007528731,0.0006656871,0.3145597,0.06612754,0.07212809,0.5399721,0.00019626276],"about_ca_topic_score_codex":0.0030193399,"about_ca_topic_score_gemma":0.003921905,"teacher_disagreement_score":0.006050544,"about_ca_system_score_codex":0.0011494806,"about_ca_system_score_gemma":0.0020138207,"threshold_uncertainty_score":0.020241141},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12240937,0.003398958,0.85869545,0.00032166528,0.000182054,0.00015153382,0.00034790128,0.0067210537,0.0077720205],"genre_scores_gemma":[0.62944615,0.0013278291,0.3547427,0.0003174759,0.00015607491,0.00015745992,0.0010483937,0.0004278302,0.012376141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957734,0.000042247168,0.000027137465,0.000059545226,0.00022321104,0.00007048475],"domain_scores_gemma":[0.9993303,0.00013671812,0.00008747206,0.00016635683,0.00023487317,0.000044298766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044490764,0.00044530732,0.0004199116,0.0005349712,0.0005580133,0.0012614802,0.0022640377,0.0005176851,0.0025699965],"category_scores_gemma":[0.0009882819,0.00025178143,0.00042094383,0.00081696734,0.0003136631,0.002142293,0.00040468958,0.00047127274,0.00083651906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010727078,0.00041062915,0.0057645943,0.0005524313,0.00018936061,0.00021072807,0.00024143166,0.101305656,0.14864983,0.03337704,0.02188068,0.68634486],"study_design_scores_gemma":[0.00039231175,0.0013528238,0.0032414943,0.00007793461,0.00040673985,0.00053834147,0.00009575084,0.7206936,0.18166599,0.016991781,0.07442088,0.00012231391],"about_ca_topic_score_codex":0.0025168303,"about_ca_topic_score_gemma":0.0062771086,"teacher_disagreement_score":0.0025699965,"about_ca_system_score_codex":0.0010568671,"about_ca_system_score_gemma":0.0014955928,"threshold_uncertainty_score":0.008597493},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04443584,0.00038631752,0.9331988,0.00022502906,0.00007842927,0.00010959126,0.00018777959,0.013569883,0.007808351],"genre_scores_gemma":[0.51747334,0.00021097901,0.4753405,0.00018019955,0.00004143273,0.00026038222,0.0007164121,0.0010564959,0.004720267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996965,0.00005729637,0.000016402977,0.00008042397,0.00009300792,0.000056446384],"domain_scores_gemma":[0.9994955,0.00020150849,0.000047355403,0.00012286371,0.000087960536,0.00004486385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044363082,0.0009810751,0.00043241523,0.0003553378,0.00041799658,0.0005336417,0.0015482154,0.00044801828,0.0051322556],"category_scores_gemma":[0.0014329931,0.00032698867,0.0004065202,0.0005284187,0.00048917567,0.0010754521,0.00091881753,0.0011218291,0.000921802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035805165,0.00026910915,0.0019180382,0.00023531188,0.000074908115,0.00011177809,0.00014767604,0.6641849,0.025342232,0.0095362635,0.013271325,0.28455034],"study_design_scores_gemma":[0.000033355773,0.00005995233,0.00016754215,0.000005741584,0.000008242325,0.000016545642,0.000018575021,0.9908963,0.0045232824,0.0022283792,0.0020364518,0.00000572387],"about_ca_topic_score_codex":0.004898572,"about_ca_topic_score_gemma":0.009368295,"teacher_disagreement_score":0.0051322556,"about_ca_system_score_codex":0.00061041367,"about_ca_system_score_gemma":0.0018892697,"threshold_uncertainty_score":0.017169118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04190556,0.00029120513,0.95085907,0.000104405226,0.000080523685,0.00010718929,0.000036268535,0.0005860925,0.006029752],"genre_scores_gemma":[0.9350441,0.00017288385,0.061948486,0.000047126312,0.00003925718,0.00007780085,0.000032518816,0.000028310636,0.0026095489],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998627,0.000014281524,0.000006297366,0.000033439115,0.00006781906,0.000015401094],"domain_scores_gemma":[0.9998914,0.00001619969,0.0000224115,0.00000869156,0.000054552496,0.000006683806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024639678,0.00034864727,0.0003310087,0.00017711731,0.00028274296,0.0004844462,0.0006270207,0.00022488995,0.0013160349],"category_scores_gemma":[0.00024604064,0.0001630651,0.0001618449,0.00015594607,0.00022783749,0.00026927062,0.00021394691,0.0003248475,0.00022848816],"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.0004436884,0.00017915199,0.0013092667,0.00057357614,0.00007439965,0.00040718244,0.0003731488,0.15797448,0.46271423,0.016995972,0.0040267315,0.35492817],"study_design_scores_gemma":[0.00011453577,0.0006071071,0.0013578252,0.00002019786,0.000029247356,0.00021876332,0.00004060322,0.9152051,0.0678112,0.002190418,0.01238395,0.000021020805],"about_ca_topic_score_codex":0.0010115929,"about_ca_topic_score_gemma":0.0012878132,"teacher_disagreement_score":0.0013160349,"about_ca_system_score_codex":0.00033382984,"about_ca_system_score_gemma":0.0003250693,"threshold_uncertainty_score":0.004402578},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15310772,0.0007452967,0.7743094,0.00068723725,0.0003124969,0.00014397406,0.0017437842,0.045908455,0.023041645],"genre_scores_gemma":[0.53757006,0.00030148588,0.44379452,0.00026045597,0.000101008955,0.00011334096,0.003506376,0.004263673,0.010089096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995228,0.00004523438,0.000014090964,0.00006277501,0.00029295014,0.00006217735],"domain_scores_gemma":[0.99946517,0.00013053967,0.0000392094,0.00013312297,0.00017405562,0.00005788289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028406692,0.0008102402,0.0005244011,0.00086786353,0.0005408979,0.0010892977,0.0008689021,0.00048742667,0.0078312345],"category_scores_gemma":[0.0019133367,0.00030517488,0.0004124221,0.0012900142,0.000348889,0.00091660226,0.0008672382,0.00094432617,0.002391591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018361321,0.000469567,0.00625254,0.00031668373,0.00016587922,0.0007959864,0.00034072937,0.09076814,0.18165736,0.022580635,0.08723102,0.6075853],"study_design_scores_gemma":[0.00008505508,0.000084138344,0.0016127109,0.000013167263,0.000019984875,0.00019456772,0.00006115914,0.923732,0.059343316,0.0051692696,0.009652228,0.000032393025],"about_ca_topic_score_codex":0.0035796734,"about_ca_topic_score_gemma":0.009020356,"teacher_disagreement_score":0.0078312345,"about_ca_system_score_codex":0.00047438737,"about_ca_system_score_gemma":0.0012780805,"threshold_uncertainty_score":0.026198149},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012418021,0.12625043,0.37266633,0.0064950464,0.0023634168,0.00009826925,0.00035595873,0.0021784292,0.47717416],"genre_scores_gemma":[0.20248744,0.09185813,0.24557537,0.0028960642,0.0022638561,0.00048782467,0.0007304375,0.0019349915,0.4517659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992731,0.00016998724,0.000040377665,0.00016778569,0.00024856167,0.00010007453],"domain_scores_gemma":[0.99954337,0.00019629451,0.00003711953,0.00012374923,0.00007340658,0.000025985473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006690354,0.00096431654,0.0004847056,0.0010663124,0.0012120894,0.0033647318,0.0014485581,0.0014391498,0.015640227],"category_scores_gemma":[0.0023176705,0.0006013168,0.0005094519,0.0025306214,0.003413684,0.0061103655,0.0028842224,0.0024225542,0.004877417],"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.000021560643,0.00001036897,0.0000812104,0.00010284496,0.000006636906,0.00005487592,0.00026794488,0.0031198745,0.00045257242,0.89716166,0.013906686,0.08481376],"study_design_scores_gemma":[0.000009490905,0.000011130999,0.000113669994,0.00010839859,0.000008330955,0.00020173435,0.00007357117,0.003142869,0.0006546177,0.73433095,0.26132572,0.000019509856],"about_ca_topic_score_codex":0.0023884657,"about_ca_topic_score_gemma":0.0027531635,"teacher_disagreement_score":0.015640227,"about_ca_system_score_codex":0.0019497678,"about_ca_system_score_gemma":0.001416164,"threshold_uncertainty_score":0.05232179},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062328603,0.00015267172,0.9287126,0.00014144908,0.000037028043,0.00013502818,0.00023544593,0.0057408656,0.0025161868],"genre_scores_gemma":[0.21802917,0.00006680585,0.7787444,0.00006403344,0.000007857773,0.0001805417,0.00064574083,0.0006629747,0.0015984448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967456,0.00007620236,0.000022303835,0.00006991589,0.00011476822,0.000042244952],"domain_scores_gemma":[0.9991597,0.00036186088,0.00007428211,0.00018627562,0.000188594,0.00002925488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036419422,0.0004952571,0.00029241978,0.0005179301,0.00044790722,0.00047839395,0.00065364107,0.00037233994,0.0017479389],"category_scores_gemma":[0.0017050001,0.0003054893,0.0004540386,0.00039795408,0.00039650695,0.00055565464,0.0004949926,0.00082353316,0.0005346705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065770885,0.00018115391,0.0042632646,0.00067149824,0.000047761732,0.00034741123,0.0006618686,0.2297312,0.15138458,0.034073256,0.012629003,0.5653513],"study_design_scores_gemma":[0.0000611275,0.00010368382,0.00064374733,0.000027453023,0.000018547164,0.00013024102,0.000056265737,0.9003854,0.07046462,0.013738286,0.0143514145,0.000019238658],"about_ca_topic_score_codex":0.002212624,"about_ca_topic_score_gemma":0.0036511405,"teacher_disagreement_score":0.002212624,"about_ca_system_score_codex":0.00057598914,"about_ca_system_score_gemma":0.0019821443,"threshold_uncertainty_score":0.005847454},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8428855,0.0007149107,0.10265029,0.0018173476,0.00010284297,0.00044484253,0.00095336826,0.002295274,0.04813552],"genre_scores_gemma":[0.8888267,0.00045454936,0.0858583,0.00025585914,0.00004563521,0.00011044212,0.00061272434,0.00037512984,0.023460643],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99841464,0.0004646653,0.00010128874,0.00018991731,0.00064763834,0.00018191816],"domain_scores_gemma":[0.9916277,0.005704216,0.00044110196,0.0011441292,0.00087233144,0.00021069331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014386723,0.00060199137,0.00037614346,0.0007987197,0.0009899805,0.0017485189,0.0019988338,0.003002464,0.008350414],"category_scores_gemma":[0.0080286935,0.0004056219,0.0005802656,0.0018467052,0.0011506567,0.0026870088,0.0010228285,0.00089326344,0.0013159165],"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.0036029376,0.0049016704,0.05682801,0.0019250682,0.00031013534,0.087764576,0.009522152,0.14286004,0.063496254,0.0866003,0.034593247,0.50759566],"study_design_scores_gemma":[0.0005586586,0.0024568755,0.01406582,0.00026318966,0.00045241028,0.06498126,0.009593433,0.5498535,0.20995899,0.048931617,0.09861018,0.00027405677],"about_ca_topic_score_codex":0.0033321797,"about_ca_topic_score_gemma":0.0040836614,"teacher_disagreement_score":0.008350414,"about_ca_system_score_codex":0.000639079,"about_ca_system_score_gemma":0.00064419035,"threshold_uncertainty_score":0.02793485},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086061165,0.0024287992,0.85666853,0.00083050353,0.0006800996,0.000096891956,0.00019990678,0.008525769,0.04450828],"genre_scores_gemma":[0.73440105,0.001111262,0.22940852,0.00048549336,0.00037448283,0.00021464744,0.0004889518,0.0023239034,0.031191709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991254,0.00015302155,0.00006241726,0.00012286684,0.00037287775,0.00016331291],"domain_scores_gemma":[0.99787474,0.0005002919,0.00014551452,0.0010505281,0.00035331264,0.000075683114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008828452,0.0005998462,0.0006087001,0.0007001271,0.00065891753,0.0016446694,0.0015244612,0.00069378136,0.0054567643],"category_scores_gemma":[0.0036477246,0.00073218264,0.00091640407,0.0010612685,0.0012476203,0.0030001611,0.0022757452,0.0023915772,0.0014774561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005244882,0.00013643746,0.0024879796,0.00039504195,0.00010406663,0.00035597698,0.0007239573,0.037320998,0.045400713,0.66800684,0.015573016,0.2289706],"study_design_scores_gemma":[0.00007540039,0.00019050857,0.0011195465,0.00009282387,0.0001559815,0.0005001722,0.00011691591,0.35004118,0.04561485,0.56269675,0.03931226,0.000083726256],"about_ca_topic_score_codex":0.0007427138,"about_ca_topic_score_gemma":0.001449364,"teacher_disagreement_score":0.0054567643,"about_ca_system_score_codex":0.00067934353,"about_ca_system_score_gemma":0.0014057449,"threshold_uncertainty_score":0.018254757},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6936221,0.0015927978,0.19039714,0.0033481172,0.0002866958,0.00018006496,0.00031168698,0.005836278,0.10442515],"genre_scores_gemma":[0.98423713,0.00024156216,0.01034191,0.000065784334,0.00008464335,0.000023472396,0.00010999911,0.00032431178,0.004571214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972715,0.0008075337,0.000081795035,0.00020547959,0.0009308405,0.00070283026],"domain_scores_gemma":[0.9877679,0.006744993,0.0008270785,0.0021269927,0.0018329225,0.00070014235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027612494,0.0007821416,0.00056380965,0.0009921693,0.0013609099,0.0047216597,0.0025149144,0.0008534367,0.0064598834],"category_scores_gemma":[0.019903347,0.00048221226,0.00029782866,0.0019247284,0.0009834105,0.0054664663,0.0018772234,0.0019710436,0.0014018273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019156231,0.0009189121,0.01713709,0.00022050546,0.000099473335,0.000703069,0.0010045253,0.35320452,0.035821263,0.12307884,0.020117939,0.44577822],"study_design_scores_gemma":[0.00010757758,0.00044020405,0.008657252,0.000038625534,0.00014005603,0.00025808197,0.0008980698,0.85720265,0.03323627,0.07945786,0.019498177,0.000065210035],"about_ca_topic_score_codex":0.0023679773,"about_ca_topic_score_gemma":0.0025399064,"teacher_disagreement_score":0.0064598834,"about_ca_system_score_codex":0.0015629445,"about_ca_system_score_gemma":0.0016425358,"threshold_uncertainty_score":0.021610498},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.547052,0.0015458027,0.42819023,0.00060200255,0.00020007332,0.000083813524,0.00014534891,0.00070666865,0.021474084],"genre_scores_gemma":[0.96549547,0.00038846504,0.030152049,0.000040606228,0.00008791312,0.00009810916,0.000118688426,0.000098976285,0.0035197877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755955,0.0007686478,0.00011215936,0.0002703266,0.0007282733,0.0005610782],"domain_scores_gemma":[0.99303234,0.003922241,0.00036167522,0.001329869,0.00087992585,0.00047401554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014797152,0.00047660654,0.0010706808,0.0008739512,0.001528467,0.00240093,0.0021437511,0.0008403527,0.003845142],"category_scores_gemma":[0.011521452,0.00051645783,0.00047176558,0.0018579218,0.0015339631,0.0033903278,0.003587545,0.0007640375,0.0004840407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031269554,0.00033135977,0.009169552,0.0003491549,0.00015761926,0.0005830523,0.0012850456,0.42805704,0.019193128,0.41984034,0.00591821,0.11198843],"study_design_scores_gemma":[0.000056006233,0.000095100244,0.001529668,0.000020833195,0.000050609095,0.000112832815,0.00026806342,0.8543859,0.0068458505,0.13213597,0.0044801184,0.000018964478],"about_ca_topic_score_codex":0.0018593639,"about_ca_topic_score_gemma":0.0020882108,"teacher_disagreement_score":0.003845142,"about_ca_system_score_codex":0.0010338736,"about_ca_system_score_gemma":0.0014222946,"threshold_uncertainty_score":0.012863338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9360887,0.00016659088,0.027278425,0.00029476252,0.00018298207,0.0016975852,0.0025000274,0.008810846,0.022980088],"genre_scores_gemma":[0.8849225,0.00014959186,0.06175859,0.00039786298,0.00003951651,0.0012607828,0.0021268933,0.0028092552,0.046534985],"study_design_codex":"design_other","study_design_gemma":"nonrandomized_trial","domain_scores_codex":[0.99934214,0.00024812625,0.000029860186,0.000109106586,0.00019495182,0.000075784],"domain_scores_gemma":[0.9937396,0.0037185478,0.0001247073,0.0009884469,0.0011139957,0.0003146559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002325417,0.00044728813,0.000387013,0.00040210594,0.0006243203,0.0006645705,0.0016653262,0.00084126,0.03525048],"category_scores_gemma":[0.00725943,0.0003428238,0.0001526814,0.00043186816,0.00045556293,0.0012331695,0.00060333515,0.0006783375,0.0047306563],"study_design_candidate":"nonrandomized_trial","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.11047711,0.025604177,0.015110914,0.0008452336,0.00015690473,0.0005199091,0.003118048,0.02186279,0.1993038,0.008235863,0.059012786,0.5557526],"study_design_scores_gemma":[0.014090566,0.058630448,0.04769366,0.00019738925,0.00046922418,0.00043666942,0.0024153786,0.2439093,0.52929735,0.005123256,0.09738875,0.00034795768],"about_ca_topic_score_codex":0.0070824516,"about_ca_topic_score_gemma":0.0045389878,"teacher_disagreement_score":0.03525048,"about_ca_system_score_codex":0.0003154712,"about_ca_system_score_gemma":0.000642017,"threshold_uncertainty_score":0.11792463},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005978972,0.0010495174,0.97473645,0.000444382,0.00014381864,0.00015958796,0.000049387007,0.0010300687,0.016407808],"genre_scores_gemma":[0.2925242,0.003434112,0.68798876,0.00034474736,0.00027323203,0.00074097136,0.00034672138,0.0004129814,0.013934279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966767,0.0011164541,0.00029235287,0.00052432035,0.0011786417,0.00021153879],"domain_scores_gemma":[0.9977946,0.00076254003,0.00017719985,0.00072675425,0.0004782795,0.000060562248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00210354,0.0009499586,0.00067441154,0.0007982107,0.0008367506,0.002259358,0.00090021204,0.0005457152,0.0050577973],"category_scores_gemma":[0.0041061114,0.0005752035,0.0009292826,0.00097458874,0.0019727799,0.0018771914,0.0016569085,0.001593749,0.0015163067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015363455,0.00010480964,0.0006254547,0.0009167349,0.000114326765,0.00028211728,0.00065452704,0.1657777,0.011994615,0.5254463,0.0069712326,0.28695855],"study_design_scores_gemma":[0.00014715735,0.00017108851,0.0002874935,0.0001796054,0.00007819777,0.00023447801,0.00010609015,0.25970584,0.012460242,0.6058964,0.12069303,0.000040436982],"about_ca_topic_score_codex":0.0012831063,"about_ca_topic_score_gemma":0.0015764341,"teacher_disagreement_score":0.0050577973,"about_ca_system_score_codex":0.0012097256,"about_ca_system_score_gemma":0.0019307174,"threshold_uncertainty_score":0.01692009},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059796277,0.00016897688,0.89743996,0.00036250372,0.00014604135,0.00017632355,0.000608349,0.03829263,0.003009083],"genre_scores_gemma":[0.5146852,0.00020767818,0.4788597,0.00015558234,0.00004647199,0.00036691182,0.0009536766,0.00074109033,0.003983791],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999548,0.00015500725,0.00004691931,0.00009764268,0.00010846005,0.000043947504],"domain_scores_gemma":[0.9986725,0.0007918428,0.000086736865,0.00017422687,0.00016986222,0.000104810584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010492532,0.00053375517,0.00053331326,0.0005642578,0.0003054686,0.0014844545,0.0010838644,0.0007057815,0.0043089436],"category_scores_gemma":[0.0050191656,0.0003536314,0.00046864248,0.00043195466,0.0002985055,0.0012773789,0.0007359543,0.0006405834,0.0013177559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027789131,0.0006748346,0.009145196,0.00028285623,0.00017188326,0.0006501151,0.0004583528,0.38960037,0.013035402,0.015051673,0.020481063,0.54766935],"study_design_scores_gemma":[0.0000699898,0.000067103436,0.00043416192,0.000009055094,0.000014569685,0.00007096105,0.000017774097,0.9878885,0.0025465623,0.0048610703,0.0040040244,0.000016137355],"about_ca_topic_score_codex":0.0032889692,"about_ca_topic_score_gemma":0.0020584615,"teacher_disagreement_score":0.0043089436,"about_ca_system_score_codex":0.0003789304,"about_ca_system_score_gemma":0.0007073019,"threshold_uncertainty_score":0.014414847},"labels":[],"label_agreement":null}]}