{"meta":{"query_hash":"03dc0d8aea75","filters":{"venue":"IEEE Computer Architecture Letters"},"cohort_total":16,"direct_labels_cover":0,"predictions_cover":16,"exported":16,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/03dc0d8aea75","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Computer+Architecture+Letters"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006245073071234186,"score_gpt":0.2008537937629733,"score_spread":0.19460872069173912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997480558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26729736,0.000025551812,0.7047032,0.026363105,0.0008839956,0.00031068406,0.0000013272869,0.00029896238,0.00011580413],"genre_scores_gemma":[0.88997906,7.433042e-7,0.08136098,0.0279584,0.0005613277,0.00003513254,0.0000048484712,0.000026912761,0.000072595256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974944,0.0001720512,0.0003522969,0.00078019075,0.00038501638,0.00081605755],"domain_scores_gemma":[0.9985883,0.00013499024,0.000093366994,0.0010127254,0.000022665901,0.00014791866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024799898,0.00031931317,0.00027939057,0.0004017149,0.00013243023,0.00041879006,0.0019794484,0.000059722228,0.000015918538],"category_scores_gemma":[0.000006192293,0.0002728564,0.00013198465,0.0004908778,0.000057664696,0.000086059525,0.0008508764,0.0004637863,0.00021560877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011066307,0.00035722382,0.0057721427,0.00012111317,0.00013509388,0.00037618174,0.006447309,0.4360482,0.003370164,0.0015543873,0.16064534,0.3851618],"study_design_scores_gemma":[0.0018055027,0.00011203819,0.026482567,0.00018011217,0.000008409997,0.0000850576,0.000025871954,0.8922675,0.0002732553,0.0010275086,0.076773144,0.000959006],"about_ca_topic_score_codex":0.00015743084,"about_ca_topic_score_gemma":0.00003803354,"teacher_disagreement_score":0.6233422,"about_ca_system_score_codex":0.000059299982,"about_ca_system_score_gemma":0.000012737879,"threshold_uncertainty_score":0.99997234},"labels":[],"label_agreement":null},{"id":"W2114562199","doi":"10.1109/l-ca.2007.9","title":"A Building Block for Coarse-Grain Optimizations in the On-Chip Memory Hierarchy","year":2007,"lang":"en","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Memory hierarchy; Block (permutation group theory); Exploit; Parallel computing; Chip; Hierarchy; CPU cache; Block size; Multiprocessing; Reduction (mathematics); System on a chip; Embedded system; Operating system; Key (lock); Telecommunications","score_opus":0.01489042866387479,"score_gpt":0.2646361284728493,"score_spread":0.2497456998089745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114562199","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010127832,0.00001996989,0.97342753,0.014152945,0.00068312534,0.00075587095,0.0000033327933,0.00048207073,0.000347293],"genre_scores_gemma":[0.10810907,0.0000016040584,0.8633505,0.027913032,0.00052251754,0.00005095068,0.000004937123,0.000025501817,0.000021897322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977068,0.00022997154,0.00043210582,0.0006250883,0.00037090504,0.0006351389],"domain_scores_gemma":[0.9977671,0.0011566306,0.00013523169,0.0007929663,0.00005447023,0.00009361673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012605165,0.00030399716,0.0002528449,0.0006161144,0.0003153844,0.00025305632,0.0018878746,0.00009075419,8.090188e-7],"category_scores_gemma":[0.000034843815,0.0002378621,0.00017195394,0.00083043816,0.00009704621,0.000115030314,0.00013501587,0.0004957559,0.00000423391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002216993,0.00008431123,0.000019867826,0.000015227327,0.000019283318,0.000037738726,0.0025707355,0.93185306,0.0008038544,0.0038232552,0.014729601,0.046020918],"study_design_scores_gemma":[0.0011822146,0.0002959535,0.0003988608,0.00012269184,0.000010708474,0.00015173957,0.000012049593,0.97842735,0.0032717274,0.0037386606,0.01173442,0.0006536491],"about_ca_topic_score_codex":0.00000994029,"about_ca_topic_score_gemma":0.0000123888285,"teacher_disagreement_score":0.11007707,"about_ca_system_score_codex":0.000061619045,"about_ca_system_score_gemma":0.000034545177,"threshold_uncertainty_score":0.96997344},"labels":[],"label_agreement":null},{"id":"W2156403661","doi":"10.1109/l-ca.2008.13","title":"Multicore DIMM: an Energy Efficient Memory Module with Independently Controlled DRAMs","year":2008,"lang":"en","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hewlett-Packard (Canada)","funders":"","keywords":"Computer science; Registered memory; Embedded system; Interleaved memory; Dram; Multi-core processor; Virtual memory; Memory management; Semiconductor memory; Memory bandwidth; Memory controller; Memory map; Computer hardware; Operating system","score_opus":0.009121959770687846,"score_gpt":0.204740974859805,"score_spread":0.19561901508911717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156403661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20889306,0.000028941055,0.78796846,0.0011199252,0.00048528484,0.00031044913,0.0000014676922,0.0010683539,0.00012406496],"genre_scores_gemma":[0.65555966,0.0000028892673,0.33727613,0.006723953,0.00031755574,0.000036401554,0.000007448465,0.000032203716,0.000043773445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695265,0.00032543836,0.00043459298,0.0009681659,0.0006846731,0.0006344906],"domain_scores_gemma":[0.99809,0.00016284971,0.00022306155,0.001138172,0.00011764487,0.00026825702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002150146,0.00047306667,0.000573066,0.00038083727,0.00042747537,0.00020268625,0.0016243921,0.00011661887,0.00000363403],"category_scores_gemma":[0.000005994841,0.00036485677,0.00017838115,0.0004523167,0.00020179135,0.00020375071,0.0002357315,0.00041420502,0.000009184623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107198,0.00018356788,0.000113440394,0.000007444143,0.0000657796,0.0002415464,0.0018467905,0.9804749,0.0010134503,0.00019505483,0.0013812362,0.01436962],"study_design_scores_gemma":[0.0035335536,0.00032985536,0.00059157435,0.000040191742,0.000012790503,0.0005175134,0.0000027976587,0.99093145,0.0030435498,0.00008887638,0.00033278405,0.00057508575],"about_ca_topic_score_codex":0.00010834804,"about_ca_topic_score_gemma":0.000018893375,"teacher_disagreement_score":0.45069233,"about_ca_system_score_codex":0.00006458573,"about_ca_system_score_gemma":0.00007055413,"threshold_uncertainty_score":0.9998803},"labels":[],"label_agreement":null},{"id":"W2441593292","doi":"10.1109/lca.2015.2435709","title":"Inter-Core Locality Aware Memory Scheduling","year":2015,"lang":"en","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Locality; Parallel computing; Cache; Locality of reference; CPU cache; Operating system","score_opus":0.03353139430427328,"score_gpt":0.26647081695305,"score_spread":0.23293942264877676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2441593292","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025403684,0.000043080323,0.96443605,0.0063774516,0.0016431955,0.00021474021,0.0000017860226,0.0016546234,0.00022541074],"genre_scores_gemma":[0.34762186,0.0000010680192,0.6379795,0.013678266,0.00065356016,0.000011026656,0.0000059905396,0.000023512315,0.00002523547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976763,0.00020483368,0.0003988632,0.0007605635,0.00043977317,0.0005196325],"domain_scores_gemma":[0.99824214,0.00011806762,0.000153825,0.0010343294,0.00013930387,0.00031231606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050884194,0.00034934212,0.00033488413,0.00028216804,0.00014702688,0.0002768293,0.0018082957,0.00010919104,0.0000025951538],"category_scores_gemma":[0.000017237819,0.0003192446,0.00015922716,0.00049000065,0.000116571086,0.00025940913,0.0005334256,0.00054297555,0.00005157882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020075186,0.00008088396,0.00041040246,0.00004153203,0.00005756754,0.00012327361,0.003468133,0.8125532,0.0005201937,0.00040424336,0.04492346,0.13739702],"study_design_scores_gemma":[0.00057686033,0.00011980065,0.000094154566,0.00009612525,0.0000074265977,0.00014954142,0.000009455778,0.9893755,0.002313855,0.0025339487,0.0041643525,0.0005589791],"about_ca_topic_score_codex":0.000041076906,"about_ca_topic_score_gemma":0.000004579255,"teacher_disagreement_score":0.32645655,"about_ca_system_score_codex":0.00010376993,"about_ca_system_score_gemma":0.00008419397,"threshold_uncertainty_score":0.999926},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010094015552453076,"score_gpt":0.22624569193254623,"score_spread":0.21615167638009317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2483966489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06153609,0.000045608373,0.91431344,0.01974646,0.0030636562,0.00039781045,0.0000028734466,0.00085852516,0.000035522004],"genre_scores_gemma":[0.5604418,0.0000040067466,0.41692445,0.0165182,0.006020705,0.000025477495,0.0000035704331,0.000047438294,0.00001436033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967431,0.00021770381,0.00049781956,0.0010613695,0.0004097235,0.0010702783],"domain_scores_gemma":[0.9974842,0.00073292694,0.0002358051,0.0012334742,0.000053348555,0.00026021892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001788189,0.00045073451,0.00037544026,0.00015040566,0.0003801905,0.00020290354,0.0021466117,0.0000948781,0.0000077394025],"category_scores_gemma":[0.000010426007,0.00032643258,0.00020431004,0.000765675,0.00017829948,0.0003732167,0.0005665246,0.00039763833,0.00008524889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016681905,0.000023597782,0.00023555986,0.0000074161203,0.00003252955,0.000047495643,0.0002033964,0.49555826,0.010620956,0.0018794086,0.007524256,0.48385045],"study_design_scores_gemma":[0.0037694375,0.00042548112,0.0072710966,0.00026543473,0.0000426849,0.0007222998,0.0000028258753,0.9187754,0.004420516,0.019839948,0.041792583,0.0026723358],"about_ca_topic_score_codex":0.0000040695886,"about_ca_topic_score_gemma":0.00001140857,"teacher_disagreement_score":0.4989057,"about_ca_system_score_codex":0.00007950114,"about_ca_system_score_gemma":0.000020391322,"threshold_uncertainty_score":0.99991876},"labels":[],"label_agreement":null},{"id":"W2769715556","doi":"10.1109/lca.2017.2777834","title":"The EH Model: Analytical Exploration of Energy-Harvesting Architectures","year":2017,"lang":"en","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Energy harvesting; Computation; Focus (optics); Work (physics); Energy (signal processing); Distributed computing; Industrial engineering; Embedded system; Engineering","score_opus":0.030331696311428267,"score_gpt":0.27121694397506013,"score_spread":0.24088524766363187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769715556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006335345,0.000028501143,0.97933906,0.012775764,0.00044741985,0.00011633071,0.000001527113,0.00034752072,0.000608518],"genre_scores_gemma":[0.5639917,0.000007113473,0.43369967,0.0018770341,0.00031408208,0.000012628805,0.0000016759055,0.00001788857,0.00007816723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812007,0.00016399754,0.00041190584,0.0004900103,0.00041121393,0.00040283092],"domain_scores_gemma":[0.99748987,0.00030201106,0.00040365456,0.0016077335,0.00009340113,0.00010334167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039209728,0.00025680126,0.00026244603,0.00016166994,0.0010299291,0.00069347693,0.0028263298,0.0000686016,3.5840304e-7],"category_scores_gemma":[0.00005725427,0.00018405152,0.00016925191,0.00014075251,0.00031219443,0.0003101416,0.000508905,0.0003077831,0.0000015896537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000099716835,0.000017525092,0.000063421736,0.000009445463,0.000031139283,0.0000068869485,0.0005520608,0.8797836,0.00061877543,0.012931683,0.0021301128,0.10384541],"study_design_scores_gemma":[0.00017639823,0.000050780687,0.00025450642,0.00004570809,0.0000072515627,0.00001771804,7.088102e-7,0.98127604,0.0029752487,0.013841995,0.0011344944,0.0002191627],"about_ca_topic_score_codex":0.000050994964,"about_ca_topic_score_gemma":0.00002384722,"teacher_disagreement_score":0.5576564,"about_ca_system_score_codex":0.00002313558,"about_ca_system_score_gemma":0.00005667314,"threshold_uncertainty_score":0.79214865},"labels":[],"label_agreement":null},{"id":"W3041919703","doi":"10.1109/lca.2020.3008288","title":"MCsim: An Extensible DRAM Memory Controller Simulator","year":2020,"lang":"en","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Computer science; Extensibility; Dram; Embedded system; Computer architecture simulator; Memory controller; CAS latency; Scheduling (production processes); Interface (matter); Computer architecture; Operating system; Computer hardware","score_opus":0.015918679296096194,"score_gpt":0.23536594872781405,"score_spread":0.21944726943171786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041919703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018385137,0.000044438442,0.958737,0.019563029,0.0005926912,0.00036017474,0.000002689056,0.0021798587,0.00013496999],"genre_scores_gemma":[0.48552844,0.0000017463757,0.4224537,0.09094241,0.0010117787,0.000010319539,0.0000046545247,0.000032782566,0.000014161944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973558,0.00027298572,0.00040781195,0.0009576814,0.00042671556,0.00057899556],"domain_scores_gemma":[0.99843055,0.00016770902,0.00015147991,0.0007398174,0.00009712324,0.00041331234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021332371,0.00039014118,0.0004461906,0.00018278231,0.00022382141,0.00037146558,0.0017559277,0.00010704695,0.000008175741],"category_scores_gemma":[0.000018196894,0.0003559394,0.00018236629,0.0005124177,0.0001015591,0.00036701336,0.0002989236,0.0004864126,0.00005791626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027966165,0.000047774527,0.00003113808,0.000018246641,0.000041634194,0.000063184736,0.002146071,0.92555654,0.005583346,0.0002394097,0.023396855,0.042847823],"study_design_scores_gemma":[0.0008652141,0.0002481051,0.00013731344,0.000020587686,0.000009279689,0.000034887213,0.000002316996,0.98848194,0.002985766,0.0004170057,0.0063149636,0.00048259646],"about_ca_topic_score_codex":0.0000121569365,"about_ca_topic_score_gemma":9.866213e-7,"teacher_disagreement_score":0.5362833,"about_ca_system_score_codex":0.000030540363,"about_ca_system_score_gemma":0.00004372688,"threshold_uncertainty_score":0.99988925},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01986649166833357,"score_gpt":0.264111562793635,"score_spread":0.24424507112530144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385152117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35749894,0.00007255517,0.629658,0.011236107,0.0010654483,0.0002187744,0.0000013515663,0.00020065373,0.000048162223],"genre_scores_gemma":[0.98193675,0.000019140454,0.012621859,0.0048942156,0.00046519458,0.000020497018,0.0000030934907,0.000030347745,0.000008923316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688333,0.0004497195,0.0006867441,0.0007024228,0.00055729627,0.0007204822],"domain_scores_gemma":[0.9969316,0.0014391531,0.00026055667,0.0012409178,0.000057109755,0.00007062492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014640413,0.00032334647,0.00030981834,0.00046482348,0.0006743745,0.0003700344,0.002632977,0.00007791496,0.0000015545951],"category_scores_gemma":[0.000045183442,0.00022289637,0.00022807925,0.0018394014,0.00012495575,0.00017178654,0.00047666056,0.0008668107,0.000022828435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009954242,0.000011528568,0.00014205814,0.0000306358,0.000035667646,0.000035902416,0.0067864056,0.9504722,0.0025310644,0.0011862754,0.00110322,0.0376551],"study_design_scores_gemma":[0.00027960382,0.000031780255,0.0010334452,0.00018934466,0.000006243148,0.000019081375,0.000040637195,0.9947914,0.0006902985,0.0010858845,0.0015618632,0.00027042057],"about_ca_topic_score_codex":0.00010359653,"about_ca_topic_score_gemma":0.00004322168,"teacher_disagreement_score":0.62443775,"about_ca_system_score_codex":0.00012915293,"about_ca_system_score_gemma":0.00006168028,"threshold_uncertainty_score":0.908945},"labels":[],"label_agreement":null},{"id":"W4385757678","doi":"10.1109/lca.2023.3304613","title":"By-Software Branch Prediction in Loops","year":2023,"lang":"en","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Branch predictor; Loop unrolling; Parallel computing; Spec#; Speedup; Overhead (engineering); Compiler; Software; Call graph; Instruction set; Theoretical computer science; Programming language","score_opus":0.008231002039466353,"score_gpt":0.22015270033856177,"score_spread":0.2119216982990954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385757678","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047522344,0.000024454961,0.9432625,0.0051720827,0.0009147428,0.00021348876,0.000007859612,0.0028239137,0.0000586162],"genre_scores_gemma":[0.38336518,0.000021664988,0.59881735,0.01660679,0.00073831616,0.0000746076,0.000082667175,0.00006346428,0.00022997787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810886,0.00014894735,0.00032071507,0.00061879365,0.0003219255,0.00048073675],"domain_scores_gemma":[0.9990714,0.00016315578,0.00007808677,0.0005651385,0.000029630399,0.000092570685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002687045,0.00023437633,0.00021751529,0.0005185517,0.000112599875,0.00016074204,0.0010173343,0.0000919787,0.0000031521613],"category_scores_gemma":[0.000012132801,0.00023184587,0.000086716136,0.001339214,0.000045874272,0.00019679945,0.00022486474,0.00037210443,0.00008185476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006519191,0.00004095479,0.0028601973,0.000029000084,0.000017186008,0.000048234648,0.0016771912,0.6163255,0.0035637931,0.000048618414,0.26824042,0.10714236],"study_design_scores_gemma":[0.0009858474,0.00014291726,0.012863153,0.00015333146,0.0000047756002,0.00007713968,0.0000016285493,0.9569707,0.004205043,0.002214042,0.021692723,0.0006887108],"about_ca_topic_score_codex":0.000022981538,"about_ca_topic_score_gemma":0.000004576434,"teacher_disagreement_score":0.34444517,"about_ca_system_score_codex":0.00005533142,"about_ca_system_score_gemma":0.000023124889,"threshold_uncertainty_score":0.94544005},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006455408577077102,"score_gpt":0.18835891221101583,"score_spread":0.18190350363393873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392114198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07290875,0.00046519013,0.92058724,0.002183369,0.0032300742,0.000084948544,0.0000031971904,0.0004389154,0.00009834118],"genre_scores_gemma":[0.984622,0.000005009849,0.008207035,0.0062890896,0.0007966595,0.000008338311,0.0000027500157,0.000026138889,0.000042965905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807346,0.00010623342,0.00029901008,0.0007028904,0.00037511153,0.00044331508],"domain_scores_gemma":[0.9989295,0.00017042075,0.00007106673,0.00069998164,0.000028424809,0.00010059966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018241392,0.00027681634,0.0002539104,0.00033114263,0.000103072096,0.00026012096,0.0010541454,0.000073922754,0.0000015672439],"category_scores_gemma":[0.000003722936,0.00023391096,0.00024185375,0.00040543676,0.000068953064,0.00014665328,0.00020652344,0.0004519762,0.000008301633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075633193,0.00004099182,0.000004667814,0.00004256559,0.00004567863,0.00015756741,0.0006791466,0.4988951,0.04622314,0.0017838203,0.0033749267,0.44874483],"study_design_scores_gemma":[0.00016067336,0.00013549313,0.000025059211,0.00015026846,0.000010522378,0.00006756703,7.672759e-7,0.9948534,0.003309416,0.00044510377,0.0005787236,0.0002630291],"about_ca_topic_score_codex":0.00011735753,"about_ca_topic_score_gemma":0.0000055868004,"teacher_disagreement_score":0.91238016,"about_ca_system_score_codex":0.000049689366,"about_ca_system_score_gemma":0.000038230497,"threshold_uncertainty_score":0.95386124},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; octopus (software); Cache; Computer architecture; Parallel computing; Embedded system; Operating system; Programming language","score_opus":0.007108834151895123,"score_gpt":0.20289161474050618,"score_spread":0.19578278058861107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401508180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1788196,0.0004306283,0.8145123,0.00058873865,0.0038358099,0.0001756895,0.00001161324,0.0014890871,0.00013652319],"genre_scores_gemma":[0.9918021,0.0000053353187,0.005595471,0.0010753002,0.0013996486,0.000016374037,0.000006010822,0.00008020483,0.000019536299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867576,0.000041729338,0.00027186118,0.00036964405,0.00022968685,0.0004113038],"domain_scores_gemma":[0.99939,0.00009139092,0.000014767891,0.00037200408,0.000014016114,0.000117824995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010185226,0.00030369172,0.00024223154,0.00017332322,0.000058896687,0.00022070076,0.00032080454,0.00008979168,0.000018034361],"category_scores_gemma":[0.0000015891151,0.0002547619,0.00015286508,0.00022818586,0.00003764062,0.0000777618,0.000036657977,0.0004875692,0.00021669402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002585091,0.0000033836122,0.000009036183,0.00043909813,0.00009782862,0.00030083978,0.0007590198,0.95369506,0.0070720417,0.00012960467,0.005379159,0.032112345],"study_design_scores_gemma":[0.000074807984,0.00001885922,0.00005764879,0.00027668182,0.000020725203,0.00016113056,0.000004986034,0.97562116,0.0030007835,0.000041201078,0.020374468,0.0003475182],"about_ca_topic_score_codex":0.000015495492,"about_ca_topic_score_gemma":0.0000038284884,"teacher_disagreement_score":0.8129825,"about_ca_system_score_codex":0.000093664465,"about_ca_system_score_gemma":0.0000103224265,"threshold_uncertainty_score":0.99999046},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0166352827419804,"score_gpt":0.26978453681913733,"score_spread":0.25314925407715694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408164120","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015428863,0.000034792676,0.9382545,0.040738646,0.004388866,0.0005516007,0.00000765233,0.000568442,0.000026675292],"genre_scores_gemma":[0.42156863,6.933453e-7,0.55407566,0.0234902,0.0007609689,0.00006858917,0.000008185882,0.000016401631,0.000010688767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774814,0.000142987,0.00041604313,0.0008455899,0.00029495324,0.0005522726],"domain_scores_gemma":[0.99749,0.0011093542,0.0001445802,0.0010970578,0.00007003437,0.00008900836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018016879,0.00033841617,0.00034410588,0.000361992,0.00039218695,0.00048433317,0.002135648,0.00014194705,0.000006063939],"category_scores_gemma":[0.000046971323,0.00032192055,0.00030858483,0.00056370447,0.0001055075,0.00012709392,0.00025073337,0.0004884094,0.000010559934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030330083,0.0006418211,0.00071986596,0.00094684603,0.0005422161,0.000054086642,0.008768341,0.14382704,0.013309372,0.47904664,0.079557784,0.27228266],"study_design_scores_gemma":[0.0017766728,0.00013385384,0.0014141188,0.00053130114,0.000038806276,0.000014415949,0.000004714888,0.8521911,0.010613864,0.09229077,0.04020945,0.00078093517],"about_ca_topic_score_codex":0.0000071578997,"about_ca_topic_score_gemma":0.0000014857682,"teacher_disagreement_score":0.70836407,"about_ca_system_score_codex":0.00008519127,"about_ca_system_score_gemma":0.000091056565,"threshold_uncertainty_score":0.9999233},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Security token; Cache; Workload; Overhead (engineering); Latency (audio); Sequential decoding; Decoupling (probability)","score_opus":0.013340716557823408,"score_gpt":0.26462515500385364,"score_spread":0.2512844384460302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415968362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08774961,0.0003428769,0.86863273,0.034997627,0.0051302514,0.0025003867,0.00002728332,0.00043901874,0.00018021873],"genre_scores_gemma":[0.6152608,0.00001061357,0.36626023,0.016297584,0.0016698831,0.00028249854,0.000017245982,0.00008310779,0.000118061784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99427974,0.000292977,0.0010564422,0.0022770276,0.00052004383,0.0015737495],"domain_scores_gemma":[0.9955929,0.0014626256,0.0005019396,0.0019175702,0.00022040094,0.00030457575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032564352,0.0009737437,0.00085081416,0.00065911165,0.00091307587,0.00054057507,0.0027291046,0.00021474248,0.0000043529476],"category_scores_gemma":[0.00003825117,0.001003805,0.00052979914,0.0025085614,0.0003787023,0.00017078186,0.0010773183,0.0009875259,0.0000117085165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057376306,0.00015776834,0.00007069314,0.00017439072,0.00021680989,0.000029223476,0.002036323,0.81328285,0.008588914,0.0027910415,0.0022692364,0.17032535],"study_design_scores_gemma":[0.0012161828,0.00012116317,0.00038460235,0.00071934087,0.00010478353,0.000033537188,0.000009434117,0.9831555,0.006383066,0.003040999,0.0039158715,0.00091552676],"about_ca_topic_score_codex":0.000021808737,"about_ca_topic_score_gemma":0.000020398282,"teacher_disagreement_score":0.5275112,"about_ca_system_score_codex":0.00042524905,"about_ca_system_score_gemma":0.00014960059,"threshold_uncertainty_score":0.99924123},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Interconnection; Focus (optics); Yield (engineering); Data modeling; Context model; Integrated circuit packaging; Work (physics); Key (lock); Semiconductor device modeling","score_opus":0.013554097472716624,"score_gpt":0.23434494159957,"score_spread":0.22079084412685338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416513626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0476578,0.00021333511,0.91980195,0.015337204,0.014865373,0.001422867,0.00003004187,0.00031720943,0.00035419958],"genre_scores_gemma":[0.90173036,0.000020706791,0.0684862,0.025663277,0.0018921567,0.00018630261,0.000013066078,0.000054901157,0.0019530347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99534124,0.00025472319,0.0010990734,0.0015934168,0.00043162497,0.0012798994],"domain_scores_gemma":[0.99740064,0.00039218029,0.00031622313,0.0014014406,0.00028545366,0.00020408216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005612874,0.00085778045,0.00086930144,0.00073342776,0.00075467426,0.0009493339,0.0022733721,0.00030006137,0.000007348011],"category_scores_gemma":[0.0000136431,0.0007593901,0.00066926185,0.0010144109,0.00024016011,0.00037652403,0.00035738837,0.0008834648,0.000027774473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015067155,0.000082014354,0.00012481933,0.00040565286,0.00025157796,0.000011589508,0.0021902525,0.7581951,0.0010892355,0.0026173475,0.08526317,0.1496186],"study_design_scores_gemma":[0.0012273041,0.00023983928,0.00024429892,0.0011195848,0.00006759339,0.00005724212,0.0000054303855,0.98605126,0.00054238766,0.00075480225,0.008952518,0.00073770795],"about_ca_topic_score_codex":0.000029868574,"about_ca_topic_score_gemma":0.00004277937,"teacher_disagreement_score":0.8540726,"about_ca_system_score_codex":0.00021941235,"about_ca_system_score_gemma":0.00021404348,"threshold_uncertainty_score":0.99948573},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adder; Dot product; Multiplier (economics); Multiplication (music); Tree (set theory); Product (mathematics)","score_opus":0.011399782714914467,"score_gpt":0.2591586618781034,"score_spread":0.24775887916318892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416707459","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028079983,0.00011015994,0.9329775,0.035905033,0.0022819655,0.00042981503,0.0000029120717,0.00017674996,0.000035911824],"genre_scores_gemma":[0.037203256,0.0000012314174,0.94611746,0.016056696,0.00055528624,0.00003009332,0.0000011173545,0.000012383109,0.000022461683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983318,0.000115377574,0.00022411367,0.0007265516,0.0001734174,0.000428778],"domain_scores_gemma":[0.99894255,0.00036245823,0.000061756335,0.0004948182,0.00004888072,0.0000895192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002928119,0.00022866143,0.00026380352,0.0002066492,0.00020023285,0.00024387286,0.00061605964,0.000045765046,4.7288913e-7],"category_scores_gemma":[0.000028509798,0.00018685107,0.00008147027,0.0005167843,0.00009511842,0.00006421331,0.0002617429,0.00021984684,0.0000017588173],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014120684,0.00004914075,0.000025145386,0.0001227177,0.000041448104,0.0000149361385,0.00062018813,0.011932847,0.022334883,0.0025754843,0.0036564583,0.9586126],"study_design_scores_gemma":[0.0023337458,0.00037606276,0.0050446456,0.000406258,0.000056764326,0.00008077274,0.0000055248856,0.85304236,0.02725794,0.015718346,0.09441369,0.001263871],"about_ca_topic_score_codex":0.0000056105355,"about_ca_topic_score_gemma":4.7395815e-7,"teacher_disagreement_score":0.95734876,"about_ca_system_score_codex":0.00002675277,"about_ca_system_score_gemma":0.000032396936,"threshold_uncertainty_score":0.7619566},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cache; Randomized algorithm; Encryption; Timing attack; Cache algorithms; CPU cache","score_opus":0.01681514997980252,"score_gpt":0.26429327359365,"score_spread":0.2474781236138475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416749786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068307884,0.000387507,0.90598255,0.016445348,0.0062651807,0.0016668692,0.000038585193,0.00034083732,0.0005652194],"genre_scores_gemma":[0.8920857,0.0000085641805,0.06074968,0.046003327,0.0009346666,0.0000699029,0.0000141937135,0.00007882128,0.000055163542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99000394,0.0030088546,0.002146793,0.0021592653,0.0012625236,0.0014186262],"domain_scores_gemma":[0.9884693,0.0072549563,0.0018282498,0.0018567054,0.00040287533,0.000187939],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025762804,0.0012699135,0.0023561132,0.0014400712,0.00084044004,0.0007120662,0.0030280324,0.00051338103,0.000021430482],"category_scores_gemma":[0.00030418154,0.0012505208,0.0014594642,0.0020011736,0.00085687905,0.00028884312,0.0005632288,0.0018792861,0.000026800783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011032893,0.000654042,0.00041860933,0.0013450007,0.0023404222,0.00020289389,0.035363857,0.8268615,0.007230693,0.0032961192,0.007675996,0.10357798],"study_design_scores_gemma":[0.04504921,0.00024604454,0.0009741277,0.0036834746,0.00028596632,0.000019221103,0.000034176803,0.9256391,0.019131517,0.0024337214,0.0010940407,0.0014093809],"about_ca_topic_score_codex":0.00023632646,"about_ca_topic_score_gemma":0.000031409927,"teacher_disagreement_score":0.8452329,"about_ca_system_score_codex":0.00067085284,"about_ca_system_score_gemma":0.0006922849,"threshold_uncertainty_score":0.99899447},"labels":[],"label_agreement":null}]}