{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":16,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":16,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"03dc0d8aea75","filters":{"venue":"IEEE Computer Architecture Letters"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009121959770687846,"gpt":0.204740974859805,"spread":0.1956190150891172,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002150146,0.0004730667,0.000573066,0.0003808373,0.0004274754,0.0002026862,0.001624392,0.0001166189,0.00000363403],"category_scores_gemma":[0.000005994841,0.0003648568,0.0001783811,0.0004523167,0.0002017914,0.0002037507,0.0002357315,0.000414205,0.000009184623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006458573,"about_ca_system_score_gemma":0.00007055413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000108348,"about_ca_topic_score_gemma":0.00001889338,"domain_scores_codex":[0.9969527,0.0003254384,0.000434593,0.0009681659,0.0006846731,0.0006344906],"domain_scores_gemma":[0.99809,0.0001628497,0.0002230616,0.001138172,0.0001176449,0.000268257],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000107198,0.0001835679,0.0001134404,0.000007444143,0.0000657796,0.0002415464,0.001846791,0.9804749,0.00101345,0.0001950548,0.001381236,0.01436962],"study_design_scores_gemma":[0.003533554,0.0003298554,0.0005915744,0.00004019174,0.0000127905,0.0005175134,0.000002797659,0.9909315,0.00304355,0.00008887638,0.0003327841,0.0005750858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2088931,0.00002894105,0.7879685,0.001119925,0.0004852848,0.0003104491,0.000001467692,0.001068354,0.000124065],"genre_scores_gemma":[0.6555597,0.000002889267,0.3372761,0.006723953,0.0003175557,0.00003640155,0.000007448465,0.00003220372,0.00004377345],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4506923,"threshold_uncertainty_score":0.9998803,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2483966489","doi":"10.1109/lca.2016.2597140","title":"Stripes: Bit-Serial Deep Neural Network Computing","year":2016,"lang":"en","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computation; Acceleration; Artificial neural network; Overhead (engineering); Representation (politics); Set (abstract data type); Computer engineering; Energy (signal processing); Algorithm; Deep neural networks; State (computer science); Power (physics); Hardware acceleration; Efficient energy use; Artificial intelligence; Parallel computing; Computer hardware; Statistics; Mathematics; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01009401555245308,"gpt":0.2262456919325462,"spread":0.2161516763800932,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001788189,0.0004507345,0.0003754403,0.0001504057,0.0003801905,0.0002029035,0.002146612,0.0000948781,0.000007739402],"category_scores_gemma":[0.00001042601,0.0003264326,0.00020431,0.000765675,0.0001782995,0.0003732167,0.0005665246,0.0003976383,0.00008524889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007950114,"about_ca_system_score_gemma":0.00002039132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004069589,"about_ca_topic_score_gemma":0.00001140857,"domain_scores_codex":[0.9967431,0.0002177038,0.0004978196,0.00106137,0.0004097235,0.001070278],"domain_scores_gemma":[0.9974842,0.0007329269,0.0002358051,0.001233474,0.00005334855,0.0002602189],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000166819,0.00002359778,0.0002355599,0.00000741612,0.00003252955,0.00004749564,0.0002033964,0.4955583,0.01062096,0.001879409,0.007524256,0.4838504],"study_design_scores_gemma":[0.003769438,0.0004254811,0.007271097,0.0002654347,0.0000426849,0.0007222998,0.000002825875,0.9187754,0.004420516,0.01983995,0.04179258,0.002672336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06153609,0.00004560837,0.9143134,0.01974646,0.003063656,0.0003978105,0.000002873447,0.0008585252,0.000035522],"genre_scores_gemma":[0.5604418,0.000004006747,0.4169244,0.0165182,0.006020705,0.0000254775,0.000003570433,0.00004743829,0.00001436033],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4989057,"threshold_uncertainty_score":0.9999188,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03033169631142827,"gpt":0.2712169439750601,"spread":0.2408852476636319,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003920973,0.0002568013,0.000262446,0.0001616699,0.001029929,0.0006934769,0.00282633,0.0000686016,3.58403e-7],"category_scores_gemma":[0.00005725427,0.0001840515,0.0001692519,0.0001407525,0.0003121944,0.0003101416,0.000508905,0.0003077831,0.000001589654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002313558,"about_ca_system_score_gemma":0.00005667314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005099496,"about_ca_topic_score_gemma":0.00002384722,"domain_scores_codex":[0.9981201,0.0001639975,0.0004119058,0.0004900103,0.0004112139,0.0004028309],"domain_scores_gemma":[0.9974899,0.0003020111,0.0004036546,0.001607734,0.00009340113,0.0001033417],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009971684,0.00001752509,0.00006342174,0.000009445463,0.00003113928,0.000006886949,0.0005520608,0.8797836,0.0006187754,0.01293168,0.002130113,0.1038454],"study_design_scores_gemma":[0.0001763982,0.00005078069,0.0002545064,0.00004570809,0.000007251563,0.00001771804,7.088102e-7,0.981276,0.002975249,0.013842,0.001134494,0.0002191627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006335345,0.00002850114,0.9793391,0.01277576,0.0004474199,0.0001163307,0.000001527113,0.0003475207,0.000608518],"genre_scores_gemma":[0.5639917,0.000007113473,0.4336997,0.001877034,0.0003140821,0.00001262881,0.000001675906,0.00001788857,0.00007816723],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5576564,"threshold_uncertainty_score":0.7921486,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Locality; Parallel computing; Cache; Locality of reference; CPU cache; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.03353139430427328,"gpt":0.26647081695305,"spread":0.2329394226487768,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005088419,0.0003493421,0.0003348841,0.000282168,0.0001470269,0.0002768293,0.001808296,0.000109191,0.000002595154],"category_scores_gemma":[0.00001723782,0.0003192446,0.0001592272,0.0004900006,0.0001165711,0.0002594091,0.0005334256,0.0005429756,0.00005157882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001037699,"about_ca_system_score_gemma":0.00008419397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004107691,"about_ca_topic_score_gemma":0.000004579255,"domain_scores_codex":[0.9976763,0.0002048337,0.0003988632,0.0007605635,0.0004397732,0.0005196325],"domain_scores_gemma":[0.9982421,0.0001180676,0.000153825,0.001034329,0.0001393039,0.0003123161],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002007519,0.00008088396,0.0004104025,0.00004153203,0.00005756754,0.0001232736,0.003468133,0.8125532,0.0005201937,0.0004042434,0.04492346,0.137397],"study_design_scores_gemma":[0.0005768603,0.0001198007,0.00009415457,0.00009612525,0.000007426598,0.0001495414,0.000009455778,0.9893755,0.002313855,0.002533949,0.004164353,0.0005589791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02540368,0.00004308032,0.9644361,0.006377452,0.001643196,0.0002147402,0.000001786023,0.001654623,0.0002254107],"genre_scores_gemma":[0.3476219,0.000001068019,0.6379795,0.01367827,0.0006535602,0.00001102666,0.00000599054,0.00002351232,0.00002523547],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3264565,"threshold_uncertainty_score":0.999926,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01591867929609619,"gpt":0.2353659487278141,"spread":0.2194472694317179,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002133237,0.0003901412,0.0004461906,0.0001827823,0.0002238214,0.0003714656,0.001755928,0.000107047,0.000008175741],"category_scores_gemma":[0.00001819689,0.0003559394,0.0001823663,0.0005124177,0.0001015591,0.0003670134,0.0002989236,0.0004864126,0.00005791626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003054036,"about_ca_system_score_gemma":0.00004372688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001215694,"about_ca_topic_score_gemma":9.866213e-7,"domain_scores_codex":[0.9973558,0.0002729857,0.000407812,0.0009576814,0.0004267156,0.0005789956],"domain_scores_gemma":[0.9984306,0.000167709,0.0001514799,0.0007398174,0.00009712324,0.0004133123],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002796617,0.00004777453,0.00003113808,0.00001824664,0.00004163419,0.00006318474,0.002146071,0.9255565,0.005583346,0.0002394097,0.02339686,0.04284782],"study_design_scores_gemma":[0.0008652141,0.0002481051,0.0001373134,0.00002058769,0.000009279689,0.00003488721,0.000002316996,0.9884819,0.002985766,0.0004170057,0.006314964,0.0004825965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01838514,0.00004443844,0.958737,0.01956303,0.0005926912,0.0003601747,0.000002689056,0.002179859,0.00013497],"genre_scores_gemma":[0.4855284,0.000001746376,0.4224537,0.09094241,0.001011779,0.00001031954,0.000004654525,0.00003278257,0.00001416194],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5362833,"threshold_uncertainty_score":0.9998893,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997480558","doi":"10.1109/l-ca.2013.25","title":"Soft Failures in Large Datacenters","year":2013,"lang":"en","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Downtime; Computer science; Reliability (semiconductor); Server; Software deployment; Reliability engineering; Service (business); Process (computing); Failure rate; Distributed computing; Computer network; Operating system; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.006245073071234186,"gpt":0.2008537937629733,"spread":0.1946087206917391,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000247999,0.0003193132,0.0002793906,0.0004017149,0.0001324302,0.0004187901,0.001979448,0.00005972223,0.00001591854],"category_scores_gemma":[0.000006192293,0.0002728564,0.0001319846,0.0004908778,0.0000576647,0.00008605952,0.0008508764,0.0004637863,0.0002156088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005929998,"about_ca_system_score_gemma":0.00001273788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001574308,"about_ca_topic_score_gemma":0.00003803354,"domain_scores_codex":[0.9974944,0.0001720512,0.0003522969,0.0007801907,0.0003850164,0.0008160576],"domain_scores_gemma":[0.9985883,0.0001349902,0.00009336699,0.001012725,0.0000226659,0.0001479187],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001106631,0.0003572238,0.005772143,0.0001211132,0.0001350939,0.0003761817,0.006447309,0.4360482,0.003370164,0.001554387,0.1606453,0.3851618],"study_design_scores_gemma":[0.001805503,0.0001120382,0.02648257,0.0001801122,0.000008409997,0.0000850576,0.00002587195,0.8922675,0.0002732553,0.001027509,0.07677314,0.000959006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2672974,0.00002555181,0.7047032,0.0263631,0.0008839956,0.0003106841,0.000001327287,0.0002989624,0.0001158041],"genre_scores_gemma":[0.8899791,7.433042e-7,0.08136098,0.0279584,0.0005613277,0.00003513254,0.000004848471,0.00002691276,0.00007259526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6233422,"threshold_uncertainty_score":0.9999723,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4392114198","doi":"10.1109/lca.2024.3365149","title":"Improving Energy-Efficiency of Capsule Networks on Modern GPUs","year":2024,"lang":"en","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Computer architecture; Efficient energy use; Parallel computing; Energy (signal processing); Embedded system; Electrical engineering; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.006455408577077102,"gpt":0.1883589122110158,"spread":0.1819035036339387,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001824139,0.0002768163,0.0002539104,0.0003311426,0.0001030721,0.000260121,0.001054145,0.00007392275,0.000001567244],"category_scores_gemma":[0.000003722936,0.000233911,0.0002418537,0.0004054368,0.00006895306,0.0001466533,0.0002065234,0.0004519762,0.000008301633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004968937,"about_ca_system_score_gemma":0.0000382305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001173575,"about_ca_topic_score_gemma":0.0000055868,"domain_scores_codex":[0.9980735,0.0001062334,0.0002990101,0.0007028904,0.0003751115,0.0004433151],"domain_scores_gemma":[0.9989295,0.0001704208,0.00007106673,0.0006999816,0.00002842481,0.0001005997],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007563319,0.00004099182,0.000004667814,0.00004256559,0.00004567863,0.0001575674,0.0006791466,0.4988951,0.04622314,0.00178382,0.003374927,0.4487448],"study_design_scores_gemma":[0.0001606734,0.0001354931,0.00002505921,0.0001502685,0.00001052238,0.00006756703,7.672759e-7,0.9948534,0.003309416,0.0004451038,0.0005787236,0.0002630291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07290875,0.0004651901,0.9205872,0.002183369,0.003230074,0.00008494854,0.00000319719,0.0004389154,0.00009834118],"genre_scores_gemma":[0.984622,0.000005009849,0.008207035,0.00628909,0.0007966595,0.000008338311,0.000002750016,0.00002613889,0.0000429659],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9123802,"threshold_uncertainty_score":0.9538612,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008231002039466353,"gpt":0.2201527003385618,"spread":0.2119216982990954,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002687045,0.0002343763,0.0002175153,0.0005185517,0.0001125999,0.000160742,0.001017334,0.0000919787,0.000003152161],"category_scores_gemma":[0.0000121328,0.0002318459,0.00008671614,0.001339214,0.00004587427,0.0001967994,0.0002248647,0.0003721044,0.00008185476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005533142,"about_ca_system_score_gemma":0.00002312489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002298154,"about_ca_topic_score_gemma":0.000004576434,"domain_scores_codex":[0.9981089,0.0001489474,0.0003207151,0.0006187937,0.0003219255,0.0004807368],"domain_scores_gemma":[0.9990714,0.0001631558,0.00007808677,0.0005651385,0.0000296304,0.00009257068],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006519191,0.00004095479,0.002860197,0.00002900008,0.00001718601,0.00004823465,0.001677191,0.6163255,0.003563793,0.00004861841,0.2682404,0.1071424],"study_design_scores_gemma":[0.0009858474,0.0001429173,0.01286315,0.0001533315,0.0000047756,0.00007713968,0.000001628549,0.9569707,0.004205043,0.002214042,0.02169272,0.0006887108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04752234,0.00002445496,0.9432625,0.005172083,0.0009147428,0.0002134888,0.000007859612,0.002823914,0.0000586162],"genre_scores_gemma":[0.3833652,0.00002166499,0.5988173,0.01660679,0.0007383162,0.0000746076,0.00008266717,0.00006346428,0.0002299779],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3444452,"threshold_uncertainty_score":0.9454401,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401508180","doi":"10.1109/lca.2024.3441941","title":"Octopus: A Cycle-Accurate Cache System Simulator","year":2024,"lang":"en","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; octopus (software); Cache; Computer architecture; Parallel computing; Embedded system; Operating system; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.007108834151895123,"gpt":0.2028916147405062,"spread":0.1957827805886111,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001018523,0.0003036917,0.0002422315,0.0001733232,0.00005889669,0.0002207008,0.0003208045,0.00008979168,0.00001803436],"category_scores_gemma":[0.000001589115,0.0002547619,0.0001528651,0.0002281859,0.00003764062,0.0000777618,0.00003665798,0.0004875692,0.000216694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009366446,"about_ca_system_score_gemma":0.00001032243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001549549,"about_ca_topic_score_gemma":0.000003828488,"domain_scores_codex":[0.9986758,0.00004172934,0.0002718612,0.0003696441,0.0002296868,0.0004113038],"domain_scores_gemma":[0.99939,0.00009139092,0.00001476789,0.0003720041,0.00001401611,0.000117825],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002585091,0.000003383612,0.000009036183,0.0004390981,0.00009782862,0.0003008398,0.0007590198,0.9536951,0.007072042,0.0001296047,0.005379159,0.03211235],"study_design_scores_gemma":[0.00007480798,0.00001885922,0.00005764879,0.0002766818,0.0000207252,0.0001611306,0.000004986034,0.9756212,0.003000784,0.00004120108,0.02037447,0.0003475182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1788196,0.0004306283,0.8145123,0.0005887387,0.00383581,0.0001756895,0.00001161324,0.001489087,0.0001365232],"genre_scores_gemma":[0.9918021,0.000005335319,0.005595471,0.0010753,0.001399649,0.00001637404,0.000006010822,0.00008020483,0.0000195363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8129825,"threshold_uncertainty_score":0.9999905,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385152117","doi":"10.1109/lca.2023.3297875","title":"The Mirage of Breaking MIRAGE: Analyzing the Modeling Pitfalls in Emerging “Attacks” on MIRAGE","year":2023,"lang":"en","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Set (abstract data type); Vulnerability (computing); Computer security; Initialization; Work (physics); Cache; Programming language; Parallel computing; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01986649166833357,"gpt":0.264111562793635,"spread":0.2442450711253014,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001464041,0.0003233465,0.0003098183,0.0004648235,0.0006743745,0.0003700344,0.002632977,0.00007791496,0.000001554595],"category_scores_gemma":[0.00004518344,0.0002228964,0.0002280793,0.001839401,0.0001249558,0.0001717865,0.0004766606,0.0008668107,0.00002282844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001291529,"about_ca_system_score_gemma":0.00006168028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001035965,"about_ca_topic_score_gemma":0.00004322168,"domain_scores_codex":[0.9968833,0.0004497195,0.0006867441,0.0007024228,0.0005572963,0.0007204822],"domain_scores_gemma":[0.9969316,0.001439153,0.0002605567,0.001240918,0.00005710976,0.00007062492],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009954242,0.00001152857,0.0001420581,0.0000306358,0.00003566765,0.00003590242,0.006786406,0.9504722,0.002531064,0.001186275,0.00110322,0.0376551],"study_design_scores_gemma":[0.0002796038,0.00003178026,0.001033445,0.0001893447,0.000006243148,0.00001908138,0.00004063719,0.9947914,0.0006902985,0.001085885,0.001561863,0.0002704206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3574989,0.00007255517,0.629658,0.01123611,0.001065448,0.0002187744,0.000001351566,0.0002006537,0.00004816222],"genre_scores_gemma":[0.9819368,0.00001914045,0.01262186,0.004894216,0.0004651946,0.00002049702,0.000003093491,0.00003034774,0.000008923316],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6244377,"threshold_uncertainty_score":0.908945,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4415968362","doi":"10.1109/lca.2025.3630094","title":"Disaggregated Speculative Decoding for Carbon-Efficient LLM Serving","year":2025,"lang":"","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Security token; Cache; Workload; Overhead (engineering); Latency (audio); Sequential decoding; Decoupling (probability)","retraction":null,"screen_n_in":null,"score":{"opus":0.01334071655782341,"gpt":0.2646251550038536,"spread":0.2512844384460302,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003256435,0.0009737437,0.0008508142,0.0006591117,0.0009130759,0.0005405751,0.002729105,0.0002147425,0.000004352948],"category_scores_gemma":[0.00003825117,0.001003805,0.0005297991,0.002508561,0.0003787023,0.0001707819,0.001077318,0.0009875259,0.00001170852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000425249,"about_ca_system_score_gemma":0.0001496006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002180874,"about_ca_topic_score_gemma":0.00002039828,"domain_scores_codex":[0.9942797,0.000292977,0.001056442,0.002277028,0.0005200438,0.001573749],"domain_scores_gemma":[0.9955929,0.001462626,0.0005019396,0.00191757,0.0002204009,0.0003045757],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005737631,0.0001577683,0.00007069314,0.0001743907,0.0002168099,0.00002922348,0.002036323,0.8132828,0.008588914,0.002791042,0.002269236,0.1703254],"study_design_scores_gemma":[0.001216183,0.0001211632,0.0003846023,0.0007193409,0.0001047835,0.00003353719,0.000009434117,0.9831555,0.006383066,0.003040999,0.003915871,0.0009155268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08774961,0.0003428769,0.8686327,0.03499763,0.005130251,0.002500387,0.00002728332,0.0004390187,0.0001802187],"genre_scores_gemma":[0.6152608,0.00001061357,0.3662602,0.01629758,0.001669883,0.0002824985,0.00001724598,0.00008310779,0.0001180618],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5275112,"threshold_uncertainty_score":0.9992412,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4416749786","doi":"10.1109/lca.2025.3638260","title":"Another Mirage of Breaking MIRAGE: Debunking Occupancy-Based Side-Channel Attacks on Fully Associative Randomized Caches","year":2025,"lang":"","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Cache; Randomized algorithm; Encryption; Timing attack; Cache algorithms; CPU cache","retraction":null,"screen_n_in":null,"score":{"opus":0.01681514997980252,"gpt":0.26429327359365,"spread":0.2474781236138475,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00257628,0.001269914,0.002356113,0.001440071,0.00084044,0.0007120662,0.003028032,0.000513381,0.00002143048],"category_scores_gemma":[0.0003041815,0.001250521,0.001459464,0.002001174,0.0008568791,0.0002888431,0.0005632288,0.001879286,0.00002680078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006708528,"about_ca_system_score_gemma":0.0006922849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002363265,"about_ca_topic_score_gemma":0.00003140993,"domain_scores_codex":[0.9900039,0.003008855,0.002146793,0.002159265,0.001262524,0.001418626],"domain_scores_gemma":[0.9884693,0.007254956,0.00182825,0.001856705,0.0004028753,0.000187939],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.01103289,0.000654042,0.0004186093,0.001345001,0.002340422,0.0002028939,0.03536386,0.8268615,0.007230693,0.003296119,0.007675996,0.103578],"study_design_scores_gemma":[0.04504921,0.0002460445,0.0009741277,0.003683475,0.0002859663,0.0000192211,0.0000341768,0.9256391,0.01913152,0.002433721,0.001094041,0.001409381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06830788,0.000387507,0.9059826,0.01644535,0.006265181,0.001666869,0.00003858519,0.0003408373,0.0005652194],"genre_scores_gemma":[0.8920857,0.00000856418,0.06074968,0.04600333,0.0009346666,0.0000699029,0.00001419371,0.00007882128,0.00005516354],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8452329,"threshold_uncertainty_score":0.9989945,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4416513626","doi":"10.1109/lca.2025.3630669","title":"A Performance Model for Disintegrated Manycores","year":2025,"lang":"","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Interconnection; Focus (optics); Yield (engineering); Data modeling; Context model; Integrated circuit packaging; Work (physics); Key (lock); Semiconductor device modeling","retraction":null,"screen_n_in":null,"score":{"opus":0.01355409747271662,"gpt":0.23434494159957,"spread":0.2207908441268534,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005612874,0.0008577805,0.0008693014,0.0007334278,0.0007546743,0.0009493339,0.002273372,0.0003000614,0.000007348011],"category_scores_gemma":[0.0000136431,0.0007593901,0.0006692618,0.001014411,0.0002401601,0.000376524,0.0003573884,0.0008834648,0.00002777447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002194124,"about_ca_system_score_gemma":0.0002140435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002986857,"about_ca_topic_score_gemma":0.00004277937,"domain_scores_codex":[0.9953412,0.0002547232,0.001099073,0.001593417,0.000431625,0.001279899],"domain_scores_gemma":[0.9974006,0.0003921803,0.0003162231,0.001401441,0.0002854537,0.0002040822],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001506715,0.00008201435,0.0001248193,0.0004056529,0.000251578,0.00001158951,0.002190253,0.7581951,0.001089236,0.002617348,0.08526317,0.1496186],"study_design_scores_gemma":[0.001227304,0.0002398393,0.0002442989,0.001119585,0.00006759339,0.00005724212,0.000005430385,0.9860513,0.0005423877,0.0007548023,0.008952518,0.0007377079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0476578,0.0002133351,0.919802,0.0153372,0.01486537,0.001422867,0.00003004187,0.0003172094,0.0003541996],"genre_scores_gemma":[0.9017304,0.00002070679,0.0684862,0.02566328,0.001892157,0.0001863026,0.00001306608,0.00005490116,0.001953035],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8540726,"threshold_uncertainty_score":0.9994857,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01489042866387479,"gpt":0.2646361284728493,"spread":0.2497456998089745,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001260516,0.0003039972,0.0002528449,0.0006161144,0.0003153844,0.0002530563,0.001887875,0.00009075419,8.090188e-7],"category_scores_gemma":[0.00003484382,0.0002378621,0.0001719539,0.0008304382,0.00009704621,0.0001150303,0.0001350159,0.0004957559,0.00000423391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006161904,"about_ca_system_score_gemma":0.00003454518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000994029,"about_ca_topic_score_gemma":0.00001238883,"domain_scores_codex":[0.9977068,0.0002299715,0.0004321058,0.0006250883,0.000370905,0.0006351389],"domain_scores_gemma":[0.9977671,0.001156631,0.0001352317,0.0007929663,0.00005447023,0.00009361673],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002216993,0.00008431123,0.00001986783,0.00001522733,0.00001928332,0.00003773873,0.002570736,0.9318531,0.0008038544,0.003823255,0.0147296,0.04602092],"study_design_scores_gemma":[0.001182215,0.0002959535,0.0003988608,0.0001226918,0.00001070847,0.0001517396,0.00001204959,0.9784274,0.003271727,0.003738661,0.01173442,0.0006536491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01012783,0.00001996989,0.9734275,0.01415295,0.0006831253,0.0007558709,0.000003332793,0.0004820707,0.000347293],"genre_scores_gemma":[0.1081091,0.000001604058,0.8633505,0.02791303,0.0005225175,0.00005095068,0.000004937123,0.00002550182,0.00002189732],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1100771,"threshold_uncertainty_score":0.9699734,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4416707459","doi":"10.1109/lca.2025.3637718","title":"Fusing Adds and Shifts for Efficient Dot Products","year":2025,"lang":"en","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adder; Dot product; Multiplier (economics); Multiplication (music); Tree (set theory); Product (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.01139978271491447,"gpt":0.2591586618781034,"spread":0.2477588791631889,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002928119,0.0002286614,0.0002638035,0.0002066492,0.0002002329,0.0002438729,0.0006160596,0.00004576505,4.728891e-7],"category_scores_gemma":[0.0000285098,0.0001868511,0.00008147027,0.0005167843,0.00009511842,0.00006421331,0.0002617429,0.0002198468,0.000001758817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002675277,"about_ca_system_score_gemma":0.00003239694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005610535,"about_ca_topic_score_gemma":4.739582e-7,"domain_scores_codex":[0.9983318,0.0001153776,0.0002241137,0.0007265516,0.0001734174,0.000428778],"domain_scores_gemma":[0.9989426,0.0003624582,0.00006175633,0.0004948182,0.00004888072,0.0000895192],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001412068,0.00004914075,0.00002514539,0.0001227177,0.0000414481,0.00001493614,0.0006201881,0.01193285,0.02233488,0.002575484,0.003656458,0.9586126],"study_design_scores_gemma":[0.002333746,0.0003760628,0.005044646,0.000406258,0.00005676433,0.00008077274,0.000005524886,0.8530424,0.02725794,0.01571835,0.09441369,0.001263871],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02807998,0.0001101599,0.9329775,0.03590503,0.002281965,0.000429815,0.000002912072,0.00017675,0.00003591182],"genre_scores_gemma":[0.03720326,0.000001231417,0.9461175,0.0160567,0.0005552862,0.00003009332,0.000001117354,0.00001238311,0.00002246168],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9573488,"threshold_uncertainty_score":0.7619566,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4408164120","doi":"10.1109/lca.2025.3547262","title":"DPWatch: A Framework for Hardware-Based Differential Privacy Guarantees","year":2025,"lang":"en","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Differential privacy; Computer security; Embedded system; Computer hardware; Computer network; Computer architecture; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.0166352827419804,"gpt":0.2697845368191373,"spread":0.2531492540771569,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001801688,0.0003384162,0.0003441059,0.000361992,0.000392187,0.0004843332,0.002135648,0.000141947,0.000006063939],"category_scores_gemma":[0.00004697132,0.0003219206,0.0003085848,0.0005637045,0.0001055075,0.0001270939,0.0002507334,0.0004884094,0.00001055993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008519127,"about_ca_system_score_gemma":0.00009105656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000071579,"about_ca_topic_score_gemma":0.000001485768,"domain_scores_codex":[0.9977481,0.000142987,0.0004160431,0.0008455899,0.0002949532,0.0005522726],"domain_scores_gemma":[0.99749,0.001109354,0.0001445802,0.001097058,0.00007003437,0.00008900836],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003033008,0.0006418211,0.000719866,0.000946846,0.0005422161,0.00005408664,0.008768341,0.143827,0.01330937,0.4790466,0.07955778,0.2722827],"study_design_scores_gemma":[0.001776673,0.0001338538,0.001414119,0.0005313011,0.00003880628,0.00001441595,0.000004714888,0.8521911,0.01061386,0.09229077,0.04020945,0.0007809352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01542886,0.00003479268,0.9382545,0.04073865,0.004388866,0.0005516007,0.00000765233,0.000568442,0.00002667529],"genre_scores_gemma":[0.4215686,6.933453e-7,0.5540757,0.0234902,0.0007609689,0.00006858917,0.000008185882,0.00001640163,0.00001068877],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7083641,"threshold_uncertainty_score":0.9999233,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}