{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Jung Ho Ahn","is_ca":true},{"name":"Jacob Leverich","is_ca":false},{"name":"Robert Schreiber","is_ca":false},{"name":"Norman P. Jouppi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000139264,0.0002604088,0.0002846419,0.000292008,0.0002591496,0.000388136,0.001955937,0.0002379035,0.002245794],"category_scores_gemma":[0.0001707666,0.0001632803,0.0002117573,0.0003255029,0.00016964,0.0006249279,0.000831745,0.0002371265,0.0004104032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002932428,"about_ca_system_score_gemma":0.0003494103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004917294,"about_ca_topic_score_gemma":0.001247107,"domain_scores_codex":[0.9998535,0.00001523765,0.00001009409,0.00003827666,0.00004837207,0.00003443827],"domain_scores_gemma":[0.9998817,0.00001128119,0.00002124267,0.00004084429,0.00002552494,0.00001939883],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001182472,0.0004881182,0.008362298,0.0008374911,0.0001782022,0.0006030948,0.0001739782,0.01847184,0.5399698,0.01169506,0.02138799,0.3966497],"study_design_scores_gemma":[0.0003232403,0.002917394,0.01112251,0.00005922513,0.000217835,0.002065894,0.0001144581,0.2858357,0.5505963,0.003841535,0.1427776,0.0001281886],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6774657,0.004449519,0.2862975,0.0004263208,0.0003600879,0.000285505,0.001069577,0.008514064,0.02113163],"genre_scores_gemma":[0.8606194,0.0003867042,0.1291761,0.0002869475,0.00006229067,0.0001231842,0.0006742235,0.0001000233,0.008571104],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002245794,"threshold_uncertainty_score":0.007512867,"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","authors":[{"name":"Patrick Judd","is_ca":true},{"name":"Jorge Albericio","is_ca":true},{"name":"Andreas Moshovos","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004400176,0.0006851635,0.0003536373,0.0005314967,0.0002715603,0.0007478305,0.001675236,0.0003080005,0.0135256],"category_scores_gemma":[0.001288465,0.0003242689,0.0003336215,0.001054197,0.0003640512,0.001528145,0.0008741911,0.0008322186,0.002295147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005966034,"about_ca_system_score_gemma":0.0008823785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002614708,"about_ca_topic_score_gemma":0.00551173,"domain_scores_codex":[0.9996973,0.00004223967,0.00002281952,0.0000543386,0.0001389559,0.00004445073],"domain_scores_gemma":[0.9994919,0.0001221581,0.0000467032,0.0001670523,0.0001330156,0.00003910715],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.002338076,0.0004591981,0.004561705,0.0006634295,0.0002458417,0.0003887208,0.0001625046,0.1098555,0.07303731,0.03527853,0.1174778,0.6555313],"study_design_scores_gemma":[0.0002566907,0.000580762,0.001443462,0.00006544848,0.00006203065,0.0002097771,0.00006512639,0.8662632,0.06349184,0.02580036,0.04170858,0.00005278836],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1948178,0.002693683,0.706332,0.001290436,0.001183809,0.0003200187,0.002456341,0.04659558,0.04431044],"genre_scores_gemma":[0.6754478,0.00108439,0.2892934,0.0007073107,0.0001438183,0.0003012562,0.004273794,0.0009369901,0.02781129],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0135256,"threshold_uncertainty_score":0.04524767,"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","authors":[{"name":"Joshua San Miguel","is_ca":true},{"name":"Karthik Ganesan","is_ca":true},{"name":"Mario Badr","is_ca":true},{"name":"Natalie Enright Jerger","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007910882,0.0005662973,0.0006080145,0.0006162102,0.0005422751,0.001219254,0.001779745,0.001333413,0.007322636],"category_scores_gemma":[0.003592121,0.0004239712,0.0005001361,0.0005920544,0.00127732,0.002705332,0.001259761,0.001158489,0.0006479841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001212836,"about_ca_system_score_gemma":0.0009963395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0048685,"about_ca_topic_score_gemma":0.004257367,"domain_scores_codex":[0.9997029,0.00008524993,0.000007863968,0.00003333806,0.00007920081,0.00009142607],"domain_scores_gemma":[0.9990674,0.0005357667,0.00008898065,0.00009777179,0.0001377569,0.00007235917],"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.00005059033,0.0000574036,0.0005348474,0.00008934482,0.00001733861,0.0001275549,0.0001287269,0.773592,0.001934027,0.2146546,0.002511575,0.006302022],"study_design_scores_gemma":[0.000004798108,0.000006352333,0.00006737167,0.000006408453,0.000002581428,0.00001166057,0.00002336212,0.9671288,0.0001085708,0.03203005,0.0006059782,0.000004140308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1542323,0.003315785,0.7104531,0.005305256,0.0002300257,0.0001483422,0.0004289416,0.0005900074,0.1252963],"genre_scores_gemma":[0.9530576,0.001214932,0.02333221,0.0004010995,0.00009099056,0.0001203462,0.00008868582,0.0001512874,0.0215428],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007322636,"threshold_uncertainty_score":0.02449667,"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","authors":[{"name":"Dongdong Li","is_ca":true},{"name":"Tor M. Aamodt","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005758436,0.0006565927,0.0005890044,0.0006629609,0.000850509,0.0009066772,0.002245567,0.0004029701,0.003034022],"category_scores_gemma":[0.00175808,0.0003674226,0.0003928738,0.0009723929,0.0003616323,0.001179578,0.00111985,0.0006823348,0.0006590817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001117608,"about_ca_system_score_gemma":0.001979734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003191222,"about_ca_topic_score_gemma":0.01103116,"domain_scores_codex":[0.9988853,0.000199289,0.00005802479,0.0001941873,0.0003319829,0.0003311845],"domain_scores_gemma":[0.9985369,0.0002955375,0.0001605458,0.0004245321,0.0004761763,0.0001062621],"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.001847112,0.0008913125,0.01279453,0.0004487551,0.0002748711,0.0004389016,0.0004807865,0.3614967,0.1014563,0.02772,0.02272469,0.4694261],"study_design_scores_gemma":[0.00005547326,0.0002771307,0.002621199,0.00001592215,0.00006500274,0.0001612904,0.0001218716,0.9311206,0.04855918,0.007615055,0.009352196,0.00003505722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3920355,0.003363089,0.5575574,0.0006117207,0.0003029462,0.0002212733,0.0003402244,0.007406651,0.03816115],"genre_scores_gemma":[0.9409128,0.0003025381,0.05206154,0.0001706324,0.00005326641,0.00006488945,0.0003067124,0.0003191781,0.005808338],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003191222,"threshold_uncertainty_score":0.01014984,"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","authors":[{"name":"Reza Mirosanlou","is_ca":true},{"name":"Danlu Guo","is_ca":true},{"name":"Mohamed Hassan","is_ca":true},{"name":"Rodolfo Pellizzoni","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002551329,0.0005126966,0.0004104661,0.0004587929,0.0002205273,0.0004065909,0.002295831,0.0006208728,0.005534519],"category_scores_gemma":[0.0009737738,0.0003161369,0.0004977598,0.0003920881,0.000213891,0.0005368968,0.0007113568,0.0007968514,0.0007453884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003597625,"about_ca_system_score_gemma":0.0009421966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004102288,"about_ca_topic_score_gemma":0.004379988,"domain_scores_codex":[0.9998572,0.00002383736,0.00001111376,0.00001781433,0.00006600935,0.00002403433],"domain_scores_gemma":[0.9997626,0.00007355872,0.00002488572,0.00005332895,0.00006562307,0.00001995402],"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.0001503355,0.00007337968,0.002192047,0.0002321313,0.00008711385,0.0002048274,0.0001011251,0.9092875,0.01830967,0.01735686,0.009616003,0.04238903],"study_design_scores_gemma":[0.00002962092,0.00003808015,0.0001674314,0.000008177323,0.00001694289,0.00004352736,0.000008812921,0.9769582,0.005772403,0.001423928,0.01552237,0.00001052395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08900074,0.001057122,0.8448024,0.0003930009,0.0003422454,0.0005442878,0.005230306,0.02726786,0.03136207],"genre_scores_gemma":[0.5686085,0.001138312,0.4050359,0.0002872834,0.00007705672,0.0009003506,0.005930159,0.00189181,0.01613071],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005534519,"threshold_uncertainty_score":0.01851487,"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","authors":[{"name":"Sriram Sankar","is_ca":false},{"name":"Sudhanva Gurumurthi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001054175,0.0006685772,0.0007375586,0.001164445,0.0009558644,0.001126202,0.0007882471,0.00058442,0.001078368],"category_scores_gemma":[0.005071871,0.0004344665,0.0002382714,0.001107638,0.001241582,0.001560268,0.001031307,0.0008444429,0.0002570873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001084522,"about_ca_system_score_gemma":0.0005930705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005393365,"about_ca_topic_score_gemma":0.003166823,"domain_scores_codex":[0.9992061,0.0001672648,0.000044507,0.0001652037,0.0002714978,0.0001454126],"domain_scores_gemma":[0.9955128,0.001770602,0.001143764,0.0004299829,0.0006830062,0.0004598557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0006752956,0.0001908879,0.04711757,0.0004213059,0.00009477471,0.001697272,0.000666702,0.8390173,0.03405951,0.0140065,0.006640506,0.05541245],"study_design_scores_gemma":[0.0000566504,0.0002684415,0.03282205,0.00004860163,0.00004177971,0.0007881727,0.0008113871,0.9222363,0.008046741,0.03224151,0.002580143,0.00005816648],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8424905,0.001776042,0.1487105,0.0009585918,0.0001185206,0.00009179048,0.0003050393,0.001227006,0.004321895],"genre_scores_gemma":[0.9954952,0.0002013991,0.003700175,0.00005226066,0.00003204367,0.00001893059,0.00005330976,0.00003585084,0.0004108726],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005393365,"threshold_uncertainty_score":0.01072395,"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","authors":[{"name":"Mohammad Hafezan","is_ca":true},{"name":"Ehsan Atoofian","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005538284,0.00100491,0.0005705443,0.0006645283,0.000410531,0.001076889,0.001964746,0.0004036306,0.003887829],"category_scores_gemma":[0.002147851,0.0002308104,0.0003366502,0.001153785,0.0004101694,0.002530351,0.001019985,0.0007271164,0.0009584926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001244829,"about_ca_system_score_gemma":0.001111092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006113749,"about_ca_topic_score_gemma":0.0108845,"domain_scores_codex":[0.9995199,0.00009221075,0.00003150478,0.00007324787,0.000158148,0.0001250155],"domain_scores_gemma":[0.9993309,0.0001744122,0.00004998452,0.0002075054,0.0001836829,0.00005348822],"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.002123453,0.00051462,0.008128852,0.0006630495,0.0002377324,0.0006786748,0.0002695086,0.2654885,0.08577271,0.02213597,0.06328087,0.5507061],"study_design_scores_gemma":[0.00009124651,0.0003029193,0.001390433,0.00003709748,0.00006669177,0.0001562597,0.00009944876,0.942892,0.03492513,0.005891891,0.01412126,0.00002575654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.611632,0.005214441,0.3272113,0.001523326,0.0005156391,0.0001787975,0.0007570169,0.0165142,0.03645325],"genre_scores_gemma":[0.9167715,0.0006421662,0.07568448,0.000286288,0.00003437516,0.00006910248,0.0008509637,0.0004107938,0.005250141],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006113749,"threshold_uncertainty_score":0.01300609,"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","authors":[{"name":"Maziar Goudarzi","is_ca":true},{"name":"Reza Azimi","is_ca":true},{"name":"Julian Humecki","is_ca":true},{"name":"Faizaan Rehman","is_ca":true},{"name":"Richard Zhang","is_ca":true},{"name":"Chirag Sethi","is_ca":true},{"name":"Tanishq Bomman","is_ca":true},{"name":"Yuqi Yang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003536287,0.0008666422,0.0004573142,0.0007861299,0.0003517875,0.0007659033,0.000801598,0.0003577408,0.002944646],"category_scores_gemma":[0.001944259,0.0003882291,0.0004232593,0.0006949476,0.0003636036,0.0009445952,0.0005425143,0.0005550917,0.001073996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005072731,"about_ca_system_score_gemma":0.001561647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004047247,"about_ca_topic_score_gemma":0.006364788,"domain_scores_codex":[0.9995219,0.0000914048,0.00002873841,0.0001100635,0.0001757475,0.00007218672],"domain_scores_gemma":[0.9986663,0.0004407313,0.0001953858,0.000365345,0.0002853331,0.00004695694],"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.0008260662,0.0001846423,0.01916576,0.0003163595,0.00008932932,0.0001792624,0.0001776773,0.2160089,0.08682159,0.006788371,0.007469673,0.6619724],"study_design_scores_gemma":[0.00002719685,0.0001638107,0.002134978,0.0000233652,0.00002871075,0.00007961098,0.00002134958,0.9250904,0.06268063,0.005450509,0.004278731,0.00002062821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2076073,0.0008496006,0.7527831,0.0002549621,0.0001027935,0.00009606412,0.0005032718,0.03253579,0.005267153],"genre_scores_gemma":[0.7825369,0.0003120621,0.2107224,0.0001019463,0.00005642026,0.00010168,0.0009131061,0.001009741,0.004245714],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004047247,"threshold_uncertainty_score":0.0098508,"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","authors":[{"name":"Mohamed Hossam","is_ca":true},{"name":"Salah Hessien","is_ca":true},{"name":"Mohamed Hassan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002305804,0.0004999071,0.0004441512,0.0004694191,0.0003911305,0.0006406032,0.001582349,0.0007592606,0.006448402],"category_scores_gemma":[0.001155303,0.0003877885,0.0004506035,0.0005594704,0.000258317,0.0008631603,0.0006459093,0.0007652719,0.0007251411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007059671,"about_ca_system_score_gemma":0.001632757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009722606,"about_ca_topic_score_gemma":0.01098848,"domain_scores_codex":[0.9998387,0.00003344615,0.00001036253,0.00002011064,0.00007079106,0.0000265221],"domain_scores_gemma":[0.9996768,0.0001168254,0.00003049533,0.00005423989,0.00009160687,0.00003001937],"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.00009473184,0.00005112847,0.001422205,0.0001345065,0.00004993827,0.00007860101,0.00007920564,0.954327,0.005303591,0.01204071,0.008517264,0.01790107],"study_design_scores_gemma":[0.00002067157,0.00002899402,0.0001483436,0.000007674557,0.000008814394,0.00002208175,0.0000101496,0.987311,0.001936415,0.0015378,0.00895839,0.00000959683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1631656,0.001267475,0.7294077,0.0005489219,0.0003473893,0.0005999408,0.008185663,0.02201531,0.07446202],"genre_scores_gemma":[0.7295058,0.0009218434,0.2360488,0.0002834971,0.00004954579,0.0009599959,0.007897434,0.002400061,0.02193308],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009722606,"threshold_uncertainty_score":0.02157199,"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","authors":[{"name":"Gururaj Saileshwar","is_ca":true},{"name":"Moinuddin K. Qureshi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005815484,0.000803691,0.0007954047,0.001146163,0.001235554,0.002460547,0.00146846,0.001913605,0.001954057],"category_scores_gemma":[0.04435883,0.0008556597,0.00129869,0.0005938352,0.003280941,0.006971724,0.003084589,0.004175604,0.0003106816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001704334,"about_ca_system_score_gemma":0.001556709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002522648,"about_ca_topic_score_gemma":0.002207017,"domain_scores_codex":[0.9942386,0.002609499,0.0002710493,0.0006441089,0.001680663,0.0005560966],"domain_scores_gemma":[0.958831,0.02597293,0.0041375,0.008282943,0.002427318,0.0003484095],"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.0002975921,0.0001182161,0.01621305,0.000238851,0.000131099,0.001064965,0.003157199,0.3419687,0.005765026,0.5868427,0.002658432,0.04154411],"study_design_scores_gemma":[0.00002412768,0.0001231431,0.001195609,0.0001164119,0.00005890833,0.0003920687,0.0004253832,0.8043904,0.006964461,0.1772345,0.009026942,0.00004819371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1719132,0.0004801318,0.8127924,0.00292754,0.0001071761,0.0001278553,0.0001190659,0.001223943,0.01030877],"genre_scores_gemma":[0.8583416,0.0002519053,0.138493,0.0004878568,0.00005901855,0.0001277772,0.00009533721,0.0003866536,0.001756766],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005815484,"threshold_uncertainty_score":0.03075564,"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)","authors":[{"name":"Yanran Wu","is_ca":false},{"name":"Sihang Liu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007375073,0.001261411,0.0008409615,0.0004870872,0.000775762,0.00171322,0.002037428,0.0009096006,0.00341321],"category_scores_gemma":[0.004516592,0.0004567496,0.0006099473,0.0007513296,0.0008887046,0.002838444,0.002484303,0.00166623,0.001583228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001250673,"about_ca_system_score_gemma":0.003178133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009407122,"about_ca_topic_score_gemma":0.02451561,"domain_scores_codex":[0.9991989,0.000196726,0.0000500571,0.0001459237,0.0002402789,0.0001681881],"domain_scores_gemma":[0.9984806,0.0005870783,0.00006840879,0.0005096513,0.0002599048,0.00009426343],"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.001001408,0.0004639119,0.009387128,0.0003775053,0.0001438348,0.0007477215,0.001063033,0.5356972,0.0654344,0.0311012,0.03906949,0.3155133],"study_design_scores_gemma":[0.00002237984,0.0000501338,0.0001414079,0.00000715231,0.00001290329,0.00004392819,0.00008483206,0.9791686,0.007638505,0.009165198,0.003649513,0.00001536709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2303946,0.002001385,0.7121049,0.001610632,0.0003876315,0.0001930523,0.001490683,0.03748498,0.01433215],"genre_scores_gemma":[0.8006071,0.0003441078,0.1891828,0.0006223932,0.00006769568,0.0001453662,0.001919797,0.00227628,0.004834522],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009407122,"threshold_uncertainty_score":0.01870477,"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","authors":[{"name":"Gururaj Saileshwar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003393921,0.000590624,0.000777629,0.0005834569,0.000622606,0.001302721,0.001263263,0.00116352,0.001308557],"category_scores_gemma":[0.01771782,0.0005241663,0.0008510031,0.0005123551,0.001981093,0.004672198,0.001847835,0.001684323,0.0003368762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001063041,"about_ca_system_score_gemma":0.001039986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005659916,"about_ca_topic_score_gemma":0.0006778351,"domain_scores_codex":[0.9947993,0.00244304,0.0003143489,0.0004579241,0.0014526,0.000532812],"domain_scores_gemma":[0.9804391,0.007345956,0.00198755,0.008963493,0.001075322,0.0001886809],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00176015,0.0003350876,0.01224745,0.000335907,0.0004274282,0.000657102,0.0009241224,0.5239976,0.0731404,0.2723773,0.004536957,0.1092605],"study_design_scores_gemma":[0.00006817393,0.0005686931,0.0005463063,0.00005362798,0.00008318177,0.0003704112,0.0000801049,0.8833578,0.06605648,0.04541936,0.003332598,0.00006328733],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3921022,0.0007403046,0.5985532,0.001112437,0.0001227387,0.0001115016,0.0001281916,0.00284717,0.004282176],"genre_scores_gemma":[0.9687146,0.0001121724,0.02990442,0.0002494332,0.00002435741,0.00004390627,0.00002842011,0.00007937725,0.0008433426],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003393921,"threshold_uncertainty_score":0.01794899,"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","authors":[{"name":"Mark C. Jeffrey","is_ca":true},{"name":"Natalie Enright Jerger","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008322991,0.001164396,0.0007404502,0.0009419956,0.0007220274,0.001356444,0.002933384,0.001865442,0.009165001],"category_scores_gemma":[0.002875143,0.000534859,0.0007315762,0.0007498512,0.0009822779,0.003067892,0.001103297,0.001600053,0.002724609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002402431,"about_ca_system_score_gemma":0.001283221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01088078,"about_ca_topic_score_gemma":0.004853812,"domain_scores_codex":[0.9991918,0.0001323853,0.00002905923,0.0001324898,0.0002975668,0.0002167352],"domain_scores_gemma":[0.9988384,0.0003637168,0.0001287826,0.0001451603,0.000444068,0.00007990347],"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.0000574931,0.00003522872,0.000316092,0.00005289113,0.00001442646,0.0001226177,0.00007813135,0.9334509,0.003229862,0.05505644,0.002279103,0.005306814],"study_design_scores_gemma":[0.000005210577,0.00001976721,0.0000849487,0.000006075072,0.000004926175,0.00003012197,0.000008834931,0.9923521,0.0003729023,0.005956721,0.00115337,0.000005168065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1596384,0.002546418,0.7422647,0.002763757,0.0002341982,0.0002449631,0.001147299,0.002294738,0.0888655],"genre_scores_gemma":[0.9192116,0.001286182,0.03281226,0.000634941,0.0001066913,0.0003556021,0.0005992731,0.0006075248,0.04438597],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01088078,"threshold_uncertainty_score":0.03065991,"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","authors":[{"name":"Jason Zebchuk","is_ca":true},{"name":"Andreas Moshovos","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002548475,0.0002492439,0.0003351481,0.0002929963,0.0004364253,0.0006403268,0.0009405297,0.0004109894,0.001417944],"category_scores_gemma":[0.001015348,0.0003019296,0.0002808759,0.0004676469,0.0004037609,0.001035944,0.0004848019,0.001004416,0.0004284461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004875349,"about_ca_system_score_gemma":0.001067212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001784282,"about_ca_topic_score_gemma":0.004165134,"domain_scores_codex":[0.9998106,0.0000317671,0.00001074331,0.00003203996,0.00008131975,0.00003359591],"domain_scores_gemma":[0.9996327,0.00007650069,0.00003592926,0.000174863,0.00006143376,0.00001846956],"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.0002873472,0.0003383044,0.003393237,0.0003842112,0.0001162382,0.0001958598,0.0003785897,0.3381698,0.3000535,0.06564735,0.007722237,0.2833133],"study_design_scores_gemma":[0.0001162091,0.0006442079,0.003146143,0.00005901819,0.0001197487,0.000227575,0.0001259541,0.8004177,0.1169576,0.03818705,0.03994203,0.00005672422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1591151,0.001240232,0.8209546,0.0006319766,0.0001082793,0.0001624599,0.0001464654,0.003889007,0.01375176],"genre_scores_gemma":[0.7144369,0.0004042106,0.280785,0.0003055358,0.00004555968,0.0001550447,0.0002008928,0.0003354796,0.003331281],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001784282,"threshold_uncertainty_score":0.004743457,"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)","authors":[{"name":"Pavel Golikov","is_ca":true},{"name":"Karthik Ganesan","is_ca":true},{"name":"Gennady Pekhimenko","is_ca":true},{"name":"Mark C. Jeffrey","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004262686,0.001138441,0.0007467655,0.001259283,0.0009009299,0.001123448,0.001098664,0.0005731824,0.01441678],"category_scores_gemma":[0.00179715,0.0005444083,0.0005379738,0.001235264,0.000523167,0.002268413,0.001233981,0.0006462492,0.004446364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005124552,"about_ca_system_score_gemma":0.001174835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008241181,"about_ca_topic_score_gemma":0.002695599,"domain_scores_codex":[0.9992713,0.00006561973,0.0001006148,0.0001506219,0.0003038859,0.0001079479],"domain_scores_gemma":[0.9992043,0.0001984844,0.00009063495,0.0002389544,0.0002253606,0.00004221051],"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.0007024721,0.0002102183,0.0008186003,0.0003432887,0.00006378036,0.0004983254,0.0002605438,0.0190676,0.1191259,0.06143478,0.01003918,0.7874353],"study_design_scores_gemma":[0.0002718009,0.001800015,0.001081919,0.000139711,0.0002114029,0.001896534,0.0002618849,0.2501518,0.4652818,0.1255551,0.1531775,0.0001706293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1081307,0.001030692,0.8630902,0.0004341969,0.0004993674,0.0002771651,0.0002805384,0.00786435,0.01839289],"genre_scores_gemma":[0.3380896,0.0005276745,0.6455953,0.0003806508,0.000237737,0.0001901176,0.0005069604,0.0004054152,0.01406641],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01441678,"threshold_uncertainty_score":0.04822892,"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","authors":[{"name":"Pawan Kumar Sanjaya","is_ca":true},{"name":"Christina Giannoula","is_ca":true},{"name":"Ian Colbert","is_ca":false},{"name":"Ihab Amer","is_ca":false},{"name":"Mehdi Saeedi","is_ca":false},{"name":"Gabor Sines","is_ca":false},{"name":"Nandita Vijaykumar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063798,0.001246846,0.001321132,0.001162188,0.001266167,0.00383134,0.005314277,0.002166205,0.005643278],"category_scores_gemma":[0.01666401,0.001200057,0.001446535,0.001383384,0.003138328,0.007801979,0.00717995,0.005047315,0.00145267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001933751,"about_ca_system_score_gemma":0.003473707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001999649,"about_ca_topic_score_gemma":0.002078462,"domain_scores_codex":[0.9920031,0.002113477,0.0005929322,0.001116059,0.003404554,0.0007698231],"domain_scores_gemma":[0.9914066,0.003068012,0.0006471524,0.003831179,0.000765047,0.0002820693],"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.00102347,0.0002720962,0.002056923,0.0003987536,0.0002187588,0.0004230912,0.0003728316,0.2905214,0.01314057,0.4226096,0.02121953,0.2477429],"study_design_scores_gemma":[0.00008606151,0.0001458862,0.0001692879,0.00003609067,0.00003125636,0.0001515884,0.00003315797,0.8242759,0.01268316,0.1483237,0.01401344,0.00005046963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002458553,0.0001482395,0.9915401,0.0002622739,0.00004638372,0.00006899037,0.00008844197,0.004287384,0.001099562],"genre_scores_gemma":[0.3845344,0.0004844923,0.6065466,0.0007598829,0.0002035316,0.0005535252,0.0005446469,0.0009108491,0.00546197],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0063798,"threshold_uncertainty_score":0.03373998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}