{"meta":{"query_hash":"f642e8154779","filters":{"venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems"},"cohort_total":13,"direct_labels_cover":0,"predictions_cover":13,"exported":13,"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/f642e8154779","api":"https://metacan.xera.ac/api/v1/cohort?venue=IACR+Transactions+on+Cryptographic+Hardware+and+Embedded+Systems"},"results":[{"id":"W2979200095","doi":"10.46586/tches.v2019.i4.126-153","title":"On-Device Power Analysis Across Hardware Security Domains.","year":2019,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Power analysis; Computer science; Side channel attack; Embedded system; Hardware security module; Microcontroller; Advanced Encryption Standard; Cryptography; Encryption; Computer hardware; Sample (material); Chip; Power (physics); Computer security; Telecommunications","score_opus":0.0115316641484082,"score_gpt":0.27604561776222114,"score_spread":0.2645139536138129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979200095","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.3950554,0.00028692363,0.59983534,0.0002830392,0.0012662937,0.0008965821,0.00041304185,0.00042549075,0.0015378749],"genre_scores_gemma":[0.99780655,0.00015406252,0.0011925419,0.0004689808,0.000040771218,0.00018117703,0.00004027939,0.00003576909,0.000079888654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99562144,0.00039388845,0.0008161491,0.0013161551,0.00095883146,0.0008935484],"domain_scores_gemma":[0.9969194,0.00044441308,0.0002491504,0.0016784114,0.0003007814,0.00040784714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010153942,0.00057485397,0.0008357246,0.0012874324,0.00092694635,0.0009043424,0.0008393356,0.00028431637,0.00034285145],"category_scores_gemma":[0.000012995209,0.00053097506,0.0008139091,0.004596879,0.00014042621,0.0007367788,0.000034873676,0.00062415894,0.00014743267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071779056,0.0045896834,0.03114305,0.0013395761,0.016041107,0.0002747523,0.08806602,0.025887856,0.0009452638,0.8063056,0.0044937753,0.020195557],"study_design_scores_gemma":[0.038407505,0.012376092,0.094854355,0.0027548687,0.0063073495,0.00088452466,0.12777391,0.35394993,0.00228187,0.071058266,0.26921344,0.020137897],"about_ca_topic_score_codex":0.00039059538,"about_ca_topic_score_gemma":0.00035200943,"teacher_disagreement_score":0.7352473,"about_ca_system_score_codex":0.000060095106,"about_ca_system_score_gemma":0.00006536679,"threshold_uncertainty_score":0.9997142},"labels":[],"label_agreement":null},{"id":"W3099913548","doi":"10.46586/tches.v2022.i1.1-27","title":"Quantum Period Finding against Symmetric Primitives in Practice","year":2021,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Clarendon Fund; University of Oxford","keywords":"Block cipher; Cryptanalysis; Computer science; Qubit; NIST; Symmetric-key algorithm; Linear cryptanalysis; Collision attack; Key (lock); Theoretical computer science; Cryptography; Quantum; Algorithm; Public-key cryptography; Computer security; Cryptographic hash function; Encryption; Quantum mechanics; Physics","score_opus":0.015204854378747086,"score_gpt":0.2564273949056573,"score_spread":0.24122254052691022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099913548","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.06754048,0.0025970158,0.92491996,0.001108782,0.0013960117,0.00032179963,0.00002158436,0.00030125878,0.0017931017],"genre_scores_gemma":[0.98370296,0.00058886164,0.015210762,0.00027712013,0.00008785492,0.000053550724,0.00000560135,0.00002626589,0.00004705407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970934,0.00057158177,0.0005073852,0.0008321138,0.00046957037,0.0005259792],"domain_scores_gemma":[0.9982187,0.0006452,0.00014632306,0.0005954049,0.0001976561,0.00019669576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006988372,0.0003204696,0.00043088043,0.0009593135,0.0004931375,0.0006061615,0.00037164724,0.00017070725,0.0000048703596],"category_scores_gemma":[0.000108186505,0.00030621994,0.00019142941,0.002947959,0.000071863076,0.0005065224,0.000025524596,0.0006617269,0.000012414734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016288043,0.003129488,0.0013408529,0.0011865672,0.0012310898,0.004272743,0.0406268,0.17106146,0.0037244307,0.21982944,0.00033035103,0.5531039],"study_design_scores_gemma":[0.0021264076,0.00044668457,0.002506009,0.0014195255,0.00009069002,0.0014521601,0.011454146,0.9591479,0.00066340907,0.0011089545,0.01823318,0.001350936],"about_ca_topic_score_codex":0.00005752207,"about_ca_topic_score_gemma":0.000019676865,"teacher_disagreement_score":0.91616243,"about_ca_system_score_codex":0.000042932294,"about_ca_system_score_gemma":0.00015205888,"threshold_uncertainty_score":0.99993896},"labels":[],"label_agreement":null},{"id":"W4235846187","doi":"10.46586/tches.v2018.i1.142-174","title":"Practical CCA2-Secure and Masked Ring-LWE Implementation","year":2018,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Cryptographic Implementations and Security","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":"Infineon Technologies (Canada)","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Encryption; Ciphertext; Learning with errors; Computer security","score_opus":0.029949300054314617,"score_gpt":0.32955850391566927,"score_spread":0.29960920386135464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235846187","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.056792405,0.00017390074,0.93964714,0.001071571,0.0008268279,0.0006625791,0.00008226909,0.0002792591,0.00046402594],"genre_scores_gemma":[0.9815319,0.00032233834,0.017536761,0.00023367099,0.00015083487,0.00016592098,0.00001586399,0.00002444087,0.000018268165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99741536,0.00027174255,0.0005634882,0.0007541788,0.00047778257,0.00051744987],"domain_scores_gemma":[0.9985151,0.00020551139,0.000164556,0.0005803975,0.00023554538,0.00029886924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006870823,0.0003316492,0.00033343286,0.00064263714,0.0009692749,0.0006539173,0.0002471555,0.00015860674,0.00010984265],"category_scores_gemma":[0.000011750432,0.00031236254,0.00013544413,0.0010754098,0.00025924653,0.000837624,0.000024155059,0.00031408604,0.00002089626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023746741,0.0010291709,0.005179109,0.00056348916,0.0011607338,0.000098140314,0.026816724,0.00005457015,0.0024803774,0.8217279,0.0069073457,0.13374501],"study_design_scores_gemma":[0.031420268,0.013762998,0.056147046,0.0015925196,0.0018353042,0.0047617955,0.12878148,0.20803772,0.009555233,0.059870064,0.47372755,0.010508023],"about_ca_topic_score_codex":0.00028504673,"about_ca_topic_score_gemma":0.0004486095,"teacher_disagreement_score":0.9247395,"about_ca_system_score_codex":0.000025983614,"about_ca_system_score_gemma":0.000074077936,"threshold_uncertainty_score":0.9999328},"labels":[],"label_agreement":null},{"id":"W4237491555","doi":"10.46586/tches.v2018.i2.298-336","title":"Smashing the Implementation Records of AES S-box","year":2018,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Advancements in Semiconductor Devices and Circuit Design","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"S-box; Heuristics; Computer science; White box; Block (permutation group theory); Box model; Logic gate; Minification; Black box; Algorithm; Computer engineering; Mathematics; Block cipher; Programming language; Cryptography; Operating system; Software engineering; Artificial intelligence","score_opus":0.017342701531045994,"score_gpt":0.2665342913171062,"score_spread":0.2491915897860602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237491555","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.23984042,0.0014517815,0.7528251,0.00003073161,0.0024882064,0.00061150535,0.00010833506,0.0002584134,0.0023855288],"genre_scores_gemma":[0.99894553,0.00040649078,0.00031317753,0.000031457406,0.00015043902,0.000083966035,0.000006663383,0.00003105556,0.00003123108],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989245,0.0000694353,0.00037863103,0.00019219723,0.00020534774,0.00022987988],"domain_scores_gemma":[0.9994115,0.00008506756,0.000071186405,0.0002866757,0.000086355714,0.000059185375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002771051,0.00017751998,0.00020886821,0.00016206622,0.00024965862,0.00006369392,0.00014076063,0.00007548649,0.00015932224],"category_scores_gemma":[0.0000021207209,0.00013857367,0.00008738523,0.00036999202,0.000114221606,0.00020475732,0.000001725338,0.00015616826,0.000008782468],"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.00023520266,0.0004324417,0.008027357,0.003058422,0.004235125,0.00001650623,0.052852243,0.033364378,0.1436276,0.022903634,0.007237602,0.72400945],"study_design_scores_gemma":[0.009920471,0.0044399877,0.007338128,0.0035981475,0.0021141244,0.00037376457,0.2974058,0.07195528,0.20390375,0.008719572,0.38438618,0.0058447933],"about_ca_topic_score_codex":0.0000960189,"about_ca_topic_score_gemma":0.00012069576,"teacher_disagreement_score":0.7591051,"about_ca_system_score_codex":0.0000205108,"about_ca_system_score_gemma":0.000010573485,"threshold_uncertainty_score":0.565087},"labels":[],"label_agreement":null},{"id":"W4239728551","doi":"10.46586/tches.v2020.i3.97-120","title":"Splitting the Interpose PUF: A Novel Modeling Attack Strategy","year":2020,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Physical Unclonable Functions (PUFs) and Hardware Security","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Freie Universität Berlin; Technische Universität Berlin; Banting and Best Diabetes Centre, University of Toronto; Bundesministerium für Bildung und Forschung","keywords":"Arbiter; Reliability (semiconductor); Engineering; Exclusive or; Computer science; Embedded system; Artificial intelligence; Computer hardware; Algorithm; Logic gate","score_opus":0.058979309676875515,"score_gpt":0.25652113504255497,"score_spread":0.19754182536567946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239728551","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.014465033,0.00041142135,0.9806946,0.0017245129,0.00069141586,0.00052646996,0.00005851293,0.0004888595,0.0009392031],"genre_scores_gemma":[0.99694115,0.00010853856,0.0017392887,0.0007107756,0.00028696653,0.0001333185,0.0000064988685,0.000031363834,0.000042083146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729556,0.00019875853,0.0005803925,0.00085873646,0.0005160804,0.00055046595],"domain_scores_gemma":[0.9983207,0.0002317166,0.00012734189,0.0007187774,0.00021257455,0.000388902],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044138165,0.00039963325,0.00045067942,0.00020090242,0.00092557113,0.0007589606,0.0008123048,0.00015914465,0.000020769095],"category_scores_gemma":[0.000027104672,0.0003033945,0.00034003652,0.0013623086,0.000113006434,0.0007521417,0.00003857126,0.0007602904,0.000053893902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037259073,0.0015760915,0.00012089747,0.0010728212,0.0014717558,0.000085730884,0.024983905,0.6652526,0.0058066673,0.21453741,0.0017792755,0.082940206],"study_design_scores_gemma":[0.0006357647,0.00030670076,0.000023835133,0.00015713742,0.00006682699,0.000047460657,0.002001463,0.98912024,0.00009015437,0.0008012654,0.0063036857,0.00044547569],"about_ca_topic_score_codex":0.00018811428,"about_ca_topic_score_gemma":0.000039121962,"teacher_disagreement_score":0.9824761,"about_ca_system_score_codex":0.00003136207,"about_ca_system_score_gemma":0.0001004086,"threshold_uncertainty_score":0.9999418},"labels":[],"label_agreement":null},{"id":"W4251236654","doi":"10.46586/tches.v2018.i3.547-572","title":"SIFA: Exploiting Ineffective Fault Inductions on Symmetric Cryptography","year":2018,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Infineon Technologies (Canada)","funders":"Bundesministerium für Verkehr, Innovation und Technologie; Österreichische Forschungsförderungsgesellschaft; Bundesministerium für Wissenschaft, Forschung und Wirtschaft; Austrian Science Fund; European Commission","keywords":"Fault (geology); Computer science; Exploit; Byte; Fault model; Fault coverage; Computer security; Stuck-at fault; Fault indicator; Cryptography; Fault detection and isolation; Engineering; Artificial intelligence; Computer hardware; Seismology","score_opus":0.02469502833058283,"score_gpt":0.2745805529607446,"score_spread":0.24988552463016175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251236654","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.09980541,0.00024070923,0.8928243,0.00032715744,0.0021765826,0.0009702657,0.00009681149,0.00067270285,0.0028860595],"genre_scores_gemma":[0.9921808,0.00023551476,0.0063510295,0.00032053064,0.00033896067,0.00049377757,0.000015059076,0.000046771253,0.00001751721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99599713,0.00047955566,0.0007663821,0.0011734014,0.0007864216,0.0007971072],"domain_scores_gemma":[0.99722433,0.0005703703,0.00025074315,0.0010582819,0.00049961236,0.00039668608],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00085903367,0.0005691283,0.0005536755,0.0032684412,0.0019086316,0.00069293083,0.0006178742,0.00027017517,0.00006629732],"category_scores_gemma":[0.000047453195,0.00053290377,0.00043173254,0.0062690694,0.00037112765,0.00084847445,0.000026794072,0.00067910395,0.000074481184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023552577,0.0020929023,0.0016694979,0.00031923584,0.0015215186,0.00005702762,0.015372842,0.0009953753,0.0018432904,0.8190723,0.0023135573,0.15450689],"study_design_scores_gemma":[0.04318347,0.04752032,0.054149788,0.0074275765,0.0027983158,0.002965703,0.13114485,0.2375403,0.027018473,0.15634051,0.26627287,0.023637814],"about_ca_topic_score_codex":0.00032701777,"about_ca_topic_score_gemma":0.00013328988,"teacher_disagreement_score":0.8923754,"about_ca_system_score_codex":0.000060326143,"about_ca_system_score_gemma":0.000070355185,"threshold_uncertainty_score":0.9997122},"labels":[],"label_agreement":null},{"id":"W4255021787","doi":"10.46586/tches.v2020.i3.269-306","title":"Parameterized Hardware Accelerators for Lattice-Based Cryptography and Their Application to the HW/SW Co-Design of qTESLA","year":2020,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Speedup; Computer science; Parameterized complexity; Field-programmable gate array; Cryptography; Software; Parallel computing; Computer hardware; Embedded system; Algorithm; Operating system","score_opus":0.03786901518055814,"score_gpt":0.26109118965989436,"score_spread":0.22322217447933623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255021787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006228196,0.0005752914,0.9876985,0.0015241775,0.0002274182,0.0027077016,0.0007372113,0.00027643194,0.000025047513],"genre_scores_gemma":[0.958218,0.00014668489,0.03931738,0.0009925248,0.000077568075,0.0011680492,0.000042971642,0.000036372177,4.4965202e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719906,0.00039496247,0.0006651172,0.00092449173,0.00036687683,0.00044948887],"domain_scores_gemma":[0.9972921,0.0008930123,0.00024500597,0.00091039366,0.00024811478,0.00041139976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007824144,0.00045626008,0.00063652603,0.00050040404,0.0006323031,0.00043467968,0.0008010481,0.00020168947,0.000006605703],"category_scores_gemma":[0.00003812415,0.00033902057,0.00035896664,0.0019563844,0.00020328817,0.00039137475,0.000019640385,0.0002951606,0.0000044437747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00873596,0.0039195106,0.0032496967,0.00834122,0.005553644,0.00002290539,0.080051236,0.0689282,0.10285004,0.39498743,0.014198721,0.30916142],"study_design_scores_gemma":[0.01082598,0.0061667715,0.0017833748,0.0008074595,0.0005957274,0.0000524422,0.009253496,0.8249976,0.028331855,0.0109448945,0.10270795,0.003532433],"about_ca_topic_score_codex":0.000048359856,"about_ca_topic_score_gemma":0.000015224931,"teacher_disagreement_score":0.9519898,"about_ca_system_score_codex":0.000010142136,"about_ca_system_score_gemma":0.0000641145,"threshold_uncertainty_score":0.9999062},"labels":[],"label_agreement":null},{"id":"W4323310115","doi":"10.46586/tches.v2023.i2.358-380","title":"Speeding Up Multi-Scalar Multiplication over Fixed Points Towards Efficient zkSNARKs","year":2023,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Precomputation; Scalar multiplication; Computer science; Scalar (mathematics); Fixed point; Computation; Elliptic curve; Speedup; Context (archaeology); Arithmetic; Parallel computing; Mathematics; Algorithm; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.029257156896974387,"score_gpt":0.2748435390671737,"score_spread":0.2455863821701993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323310115","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.06744315,0.00047774837,0.926961,0.0005984965,0.0023553781,0.0007937841,0.000057872647,0.0010924406,0.00022010687],"genre_scores_gemma":[0.99211955,0.00046111704,0.006793235,0.00010254675,0.00009358951,0.00023190967,0.000017939732,0.000043152646,0.00013695534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676955,0.00025056067,0.0006078706,0.0009921045,0.000689393,0.00069050654],"domain_scores_gemma":[0.99816906,0.0002539956,0.00015765104,0.0008873913,0.000185553,0.00034635788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008968023,0.00042476555,0.0004512957,0.0013743155,0.0008059452,0.0004688401,0.00060602097,0.00028780606,0.000035205358],"category_scores_gemma":[0.00002914667,0.000383335,0.00040291564,0.002983925,0.0001506235,0.00028071293,0.000033619064,0.00045396818,0.00013732686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067050423,0.005138143,0.006510585,0.0034141669,0.0038957212,0.0005751112,0.059201453,0.17547035,0.039353047,0.090320185,0.012994161,0.60245657],"study_design_scores_gemma":[0.0043317955,0.00037216212,0.038810097,0.0007551266,0.00016890773,0.00014833114,0.0029174678,0.93417025,0.0026853024,0.0006265953,0.013428179,0.0015858111],"about_ca_topic_score_codex":0.00018842804,"about_ca_topic_score_gemma":0.000023220371,"teacher_disagreement_score":0.9246764,"about_ca_system_score_codex":0.000038991075,"about_ca_system_score_gemma":0.000044985267,"threshold_uncertainty_score":0.99986184},"labels":[],"label_agreement":null},{"id":"W4380077763","doi":"10.46586/tches.v2023.i3.246-269","title":"Vectorized and Parallel Computation of Large Smooth-Degree Isogenies using Precedence-Constrained Scheduling","year":2023,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science; Impact Fund","keywords":"Parallel computing; Isogeny; Computer science; Computation; Multi-core processor; Concurrency; Scheduling (production processes); Synchronization (alternating current); Parallelism (grammar); Implementation; Distributed computing; Algorithm; Programming language; Mathematics; Elliptic curve; Mathematical optimization","score_opus":0.046063533060430074,"score_gpt":0.2983112433225207,"score_spread":0.2522477102620906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380077763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071512684,0.0004121079,0.926432,0.00007343862,0.00036117702,0.0003556415,0.000024317871,0.00071599544,0.00011264241],"genre_scores_gemma":[0.9062497,0.00036876881,0.09326459,0.000018437357,0.000029913734,0.000033903634,0.0000067299256,0.000017333407,0.0000106219695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815166,0.00023991555,0.0004955459,0.00046976088,0.00030908873,0.00033402702],"domain_scores_gemma":[0.999002,0.00020946446,0.00019550575,0.00028856515,0.000181559,0.00012293311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007034187,0.00023678243,0.00039318873,0.0007098511,0.00045056886,0.00019507312,0.00022816421,0.00015326067,0.00000251623],"category_scores_gemma":[0.00002156154,0.00023334331,0.00011879556,0.0012747841,0.00011884017,0.00038435645,0.000019740517,0.00018867878,0.000002466395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013986812,0.00032807796,0.0015616908,0.0010328684,0.00053637667,0.00002789256,0.009000825,0.9339325,0.0069487602,0.02418593,0.00011325517,0.022191973],"study_design_scores_gemma":[0.000834413,0.0001465128,0.00048348593,0.00038751945,0.000034842185,0.000032340635,0.00068579265,0.99573356,0.00036411142,0.0009263528,0.00007564425,0.00029541095],"about_ca_topic_score_codex":0.00007470371,"about_ca_topic_score_gemma":0.000009637335,"teacher_disagreement_score":0.834737,"about_ca_system_score_codex":0.000015692705,"about_ca_system_score_gemma":0.00005844749,"threshold_uncertainty_score":0.9515464},"labels":[],"label_agreement":null},{"id":"W4402271882","doi":"10.46586/tches.v2024.i4.382-424","title":"Phase Modulation Side Channels: Jittery JTAG for On-Chip Voltage Measurements","year":2024,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Semiconductor materials and devices","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Chip; Materials science; Voltage; Modulation (music); Phase (matter); Optoelectronics; Electrical engineering; Chemistry; Engineering; Physics; Acoustics","score_opus":0.05146759419165013,"score_gpt":0.280753786283362,"score_spread":0.22928619209171186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402271882","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53688,0.0023756404,0.44901943,0.00004616741,0.008516318,0.0010523673,0.0004619818,0.0011154391,0.00053264963],"genre_scores_gemma":[0.9986556,0.00016146182,0.00010583598,0.00004780315,0.00042363367,0.00042422593,0.000051126444,0.000082915,0.000047404417],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985657,0.000047598238,0.00040224768,0.00039237042,0.00026834995,0.00032375558],"domain_scores_gemma":[0.9993872,0.00013178536,0.000031941043,0.00025520913,0.00006153639,0.0001322981],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034374848,0.0003163004,0.00033145788,0.00047470297,0.00019146572,0.00039524224,0.000092290466,0.0001687243,0.00004494365],"category_scores_gemma":[0.000006169122,0.00028877056,0.00018694148,0.0003007508,0.000028290371,0.0002782131,0.0000013181526,0.0001643495,0.00003146485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004420781,0.0007098783,0.00004057509,0.008235842,0.0023700325,0.00003978461,0.0048863334,0.18979895,0.7371362,0.0021096955,0.0046590744,0.049571592],"study_design_scores_gemma":[0.00807441,0.0022313178,0.00012549046,0.0057107825,0.00083425787,0.00011970714,0.003639634,0.7843267,0.11109659,0.002836979,0.07800071,0.003003473],"about_ca_topic_score_codex":0.000035201458,"about_ca_topic_score_gemma":0.000012511691,"teacher_disagreement_score":0.62603956,"about_ca_system_score_codex":0.000039530125,"about_ca_system_score_gemma":0.000014560233,"threshold_uncertainty_score":0.9999564},"labels":[],"label_agreement":null},{"id":"W4402272061","doi":"10.46586/tches.v2024.i4.737-762","title":"Faster Complete Addition Laws for Montgomery Curves","year":2024,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Law; Mathematics; Political science","score_opus":0.022917982116735486,"score_gpt":0.25090124132263025,"score_spread":0.22798325920589477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402272061","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.0007076782,0.01001832,0.9835662,0.001263888,0.0020011463,0.00085270323,0.00040488242,0.0006430301,0.0005421087],"genre_scores_gemma":[0.9894163,0.0025228825,0.0062081097,0.00042809822,0.00021408769,0.0008866816,0.000057716108,0.000050478346,0.00021565004],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99787146,0.00015575706,0.00044252034,0.0007337729,0.00036099658,0.00043552404],"domain_scores_gemma":[0.9986461,0.00045867436,0.00006057474,0.00052812655,0.0001116548,0.00019489335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044746912,0.00031976931,0.00037014764,0.0007329602,0.00046733717,0.0006241981,0.00035175786,0.00015598298,0.00004573422],"category_scores_gemma":[0.000006825224,0.00027356864,0.00042899756,0.0010491653,0.00012417418,0.000507163,0.000008942487,0.00029235496,0.00004374272],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026639487,0.0012362429,0.0001106686,0.01766985,0.0034797145,0.00026720343,0.0071542854,0.0035053268,0.0047609387,0.37605974,0.0835006,0.501989],"study_design_scores_gemma":[0.0023927558,0.0016271033,0.0007760172,0.009788672,0.00062977313,0.0006344432,0.0017122492,0.26416913,0.00071531435,0.014419604,0.70069295,0.002441974],"about_ca_topic_score_codex":0.000053626012,"about_ca_topic_score_gemma":0.000030361309,"teacher_disagreement_score":0.9887086,"about_ca_system_score_codex":0.000017393832,"about_ca_system_score_gemma":0.000038618335,"threshold_uncertainty_score":0.9999716},"labels":[],"label_agreement":null},{"id":"W4404621259","doi":"10.46586/tches.v2024.i4.763-794","title":"Know-Thy-Basis: Decomposing F26 for Lightweight S-box Implementation","year":2024,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Engineering and Physical Sciences Research Council","keywords":"Extension (predicate logic); Field (mathematics); Computer science; Basis (linear algebra); Tower; S-box; Normal basis; Field extension; Affine transformation; Process (computing); Elegance; Arithmetic; Discrete mathematics; Theoretical computer science; Algebra over a field; Mathematics; Cryptography; Algorithm; Pure mathematics; Programming language; Block cipher; Geometry; Galois module; Structural engineering","score_opus":0.0177697006325679,"score_gpt":0.3087615992298445,"score_spread":0.2909918985972766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404621259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009062321,0.0030746004,0.98221236,0.00090141606,0.0024076095,0.0012072008,0.00025183198,0.0006630867,0.0002195522],"genre_scores_gemma":[0.9774186,0.0007963928,0.020373214,0.00015814783,0.00020169225,0.00088542013,0.000072356,0.00004936279,0.000044794284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99719185,0.0001735691,0.0007307111,0.0008874,0.00043037508,0.00058607705],"domain_scores_gemma":[0.99854076,0.00038634666,0.000104783976,0.0005499231,0.0001846701,0.000233546],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00074818276,0.00038981656,0.00038061003,0.0011666834,0.0009265238,0.0013873158,0.00039206698,0.00015438201,0.000065447],"category_scores_gemma":[0.000004358596,0.00036173663,0.00040753736,0.0015308546,0.0000769765,0.00089503574,0.000012953911,0.00027010223,0.000018590092],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087613706,0.00044841596,0.00029172187,0.0015116244,0.0012987928,0.000046847093,0.013928122,0.0005926385,0.0030255222,0.54585195,0.0062779607,0.4266388],"study_design_scores_gemma":[0.0059687537,0.0023934508,0.0007965823,0.0021470773,0.0009773336,0.00053010066,0.018387428,0.19117455,0.010898005,0.031098565,0.73206866,0.003559498],"about_ca_topic_score_codex":0.00017207509,"about_ca_topic_score_gemma":0.00023342478,"teacher_disagreement_score":0.9683563,"about_ca_system_score_codex":0.00005760637,"about_ca_system_score_gemma":0.00011593569,"threshold_uncertainty_score":0.9998835},"labels":[],"label_agreement":null},{"id":"W4411157337","doi":"10.46586/tches.v2025.i3.493-515","title":"Accelerating EdDSA Signature Verification with Faster Scalar Size Halving","year":2025,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":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":"Signature (topology); Scalar (mathematics); Computer science; Mathematics; Physics; Algorithm; Geometry","score_opus":0.009931151980072331,"score_gpt":0.24352553186925682,"score_spread":0.2335943798891845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411157337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00356594,0.002377187,0.9910565,0.0005671858,0.00039490216,0.00046017102,0.000008500894,0.00083751243,0.0007320996],"genre_scores_gemma":[0.88791126,0.00005711526,0.11136512,0.00028607447,0.000038802064,0.00014607298,0.0000030924114,0.000018161762,0.00017432717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998193,0.00016089743,0.0003434869,0.00064250967,0.0003343075,0.0003257466],"domain_scores_gemma":[0.9987012,0.00024187649,0.00012303035,0.0006153861,0.0002228343,0.0000956733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036860042,0.00028945645,0.00030183577,0.00042909503,0.0005747592,0.0007796426,0.00050519296,0.00022935877,0.00000927333],"category_scores_gemma":[0.000026492275,0.00023109435,0.00009492092,0.0013309151,0.000076527795,0.00073636055,0.000013919425,0.0005389654,0.0000033203446],"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.0005039974,0.0010889053,0.0018546395,0.003916429,0.0015505196,0.00020896936,0.014325777,0.0049385424,0.08344149,0.292783,0.0030188456,0.5923689],"study_design_scores_gemma":[0.0149453385,0.004234025,0.0063907267,0.034688313,0.0016667707,0.0014564196,0.02090773,0.5606565,0.23011236,0.066076025,0.046070833,0.012794993],"about_ca_topic_score_codex":0.000050096936,"about_ca_topic_score_gemma":0.000021250653,"teacher_disagreement_score":0.8843453,"about_ca_system_score_codex":0.000038449423,"about_ca_system_score_gemma":0.00007347659,"threshold_uncertainty_score":0.9423754},"labels":[],"label_agreement":null}]}