{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":135,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":135,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"7bbe9875c94b","filters":{"venue":"IEEE Transactions on Computers"}},"results":[{"id":"W2098156582","doi":"10.1109/tc.2005.134","title":"Performance Evaluation and Design Trade-Offs for Network-on-Chip Interconnect Architectures","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":846,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Interconnection; Multiprocessing; Computer architecture; Network on a chip; Modularity (biology); Embedded system; System on a chip; Network topology; Modular design; Throughput; Design flow; Chip; Integrated circuit design; Latency (audio); Distributed computing; Parallel computing; Computer network; Telecommunications; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.0368473896670903,"gpt":0.2626955284532059,"spread":0.2258481387861156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008600354,0.0002468726,0.0002315102,0.0002100835,0.0004145619,0.0001844451,0.0003824207,0.00009463642,0.00001013876],"category_scores_gemma":[0.00000394209,0.0002232944,0.000138424,0.0002395412,0.00004238827,0.0002318548,0.000003035395,0.0002360695,0.00001444499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001104104,"about_ca_system_score_gemma":0.0000442424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004762092,"about_ca_topic_score_gemma":0.00002275012,"domain_scores_codex":[0.9982338,0.0002418125,0.0003388419,0.0005216134,0.0002914343,0.0003725307],"domain_scores_gemma":[0.9986986,0.0006596182,0.00009298431,0.0003772286,0.0000612173,0.0001103778],"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.00005260001,0.00003624706,0.000001517609,0.000006418762,0.00003043766,2.903832e-7,0.0003960696,0.5876987,0.00002872819,0.000182392,0.0009783471,0.4105882],"study_design_scores_gemma":[0.0008646614,0.0008330259,0.00009445986,0.0001349961,0.00002048249,0.00004778324,0.0000108062,0.99358,0.00223185,0.0001530938,0.001778121,0.0002507227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02224501,0.00005618616,0.972496,0.001155601,0.002803613,0.0008876744,0.000002873046,0.0001949592,0.000158109],"genre_scores_gemma":[0.9571049,0.00001715021,0.04095842,0.001165629,0.000505017,0.0001834099,0.00000106981,0.00001968065,0.00004472306],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9348599,"threshold_uncertainty_score":0.9105681,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2151770284","doi":"10.1109/12.954505","title":"Stochastic neural computation. I. Computational elements","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":560,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Exponentiation; Computer science; Stochastic computing; Artificial neural network; Multiplication (music); Sigmoid function; Computation; Stochastic neural network; Noise (video); Binary number; Algorithm; Artificial intelligence; Time delay neural network; Arithmetic; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02110761093511192,"gpt":0.2626727902763933,"spread":0.2415651793412814,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008924396,0.0002229225,0.000174144,0.0001941521,0.0004411669,0.0002039241,0.0006139827,0.00004989659,0.00002798561],"category_scores_gemma":[8.361026e-7,0.0002294924,0.0001292506,0.0007250247,0.00005820952,0.0003914141,0.000006717341,0.0002403057,0.0002199337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000660336,"about_ca_system_score_gemma":0.00003755612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000100973,"about_ca_topic_score_gemma":0.000005384175,"domain_scores_codex":[0.9983364,0.00005922876,0.0003664922,0.0005037381,0.000382144,0.0003519591],"domain_scores_gemma":[0.9990382,0.0002497827,0.0001026235,0.0003353638,0.00009874546,0.0001752821],"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.000006829933,0.0001482583,0.000005025927,0.000001651487,0.00002212613,0.000008158617,0.00004643566,0.8509004,0.00002486203,0.0008517024,0.001256338,0.1467282],"study_design_scores_gemma":[0.0005360257,0.0001089782,0.0001441987,0.00001652176,0.000009543648,0.00007677597,0.000006066009,0.9972323,0.00004220995,0.001202581,0.00039177,0.0002330291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01050669,0.00001022223,0.9856167,0.001797205,0.001195458,0.0003000839,0.00001043422,0.0004255249,0.0001377115],"genre_scores_gemma":[0.9171664,0.000004867813,0.08127531,0.00127511,0.00007648014,0.00004815956,0.000009751653,0.00001646612,0.0001274438],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9066597,"threshold_uncertainty_score":0.9358428,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2589986623","doi":"10.1109/tc.2017.2672976","title":"Design of Approximate Radix-4 Booth Multipliers for Error-Tolerant Computing","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":292,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; National Science Foundation","keywords":"Booth's multiplication algorithm; Encoder; Computer science; Multiplier (economics); Algorithm; Radix (gastropod); Approximation error; Arithmetic; Error detection and correction; Adder; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03194913396190989,"gpt":0.2487956558079305,"spread":0.2168465218460206,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000251268,0.0002911234,0.0003745019,0.0002090528,0.0004864626,0.00009362058,0.0005297945,0.0001133065,0.000007453583],"category_scores_gemma":[0.00000254772,0.0003044799,0.0001612417,0.00008557871,0.0001246182,0.0002907139,0.000002332174,0.0002226796,0.00001550291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001003292,"about_ca_system_score_gemma":0.00002927115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001381891,"about_ca_topic_score_gemma":0.000002359568,"domain_scores_codex":[0.9986792,0.00002752875,0.0003826856,0.0002900117,0.0001946903,0.0004259147],"domain_scores_gemma":[0.9988526,0.000212323,0.0001232851,0.0006470141,0.00005553773,0.0001092166],"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.00006400849,0.00005885749,0.000006462565,0.000132702,0.0001329099,0.000002780972,0.0006502371,0.9634677,0.004762629,0.00001205608,0.0003997026,0.03030992],"study_design_scores_gemma":[0.001444901,0.00013655,0.00006164639,0.0001430706,0.00004311279,0.000006496173,0.00002702949,0.9362714,0.06141091,0.00001464798,0.0001384917,0.0003017645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02296892,0.00002454403,0.9729056,0.00003843832,0.002817429,0.0007423077,0.00002593902,0.0003877966,0.00008897649],"genre_scores_gemma":[0.8810953,0.00001637258,0.1186627,0.00002823684,0.00006382357,0.00003813706,0.000001933395,0.00007001279,0.00002342305],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8581264,"threshold_uncertainty_score":0.9999408,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149204794","doi":"10.1109/tc.2004.47","title":"Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m)","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":242,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Trinomial; Polynomial basis; Multiplier (economics); Multiplication (music); Irreducible polynomial; GF(2); Mathematics; Finite field arithmetic; Primitive polynomial; Arithmetic; Polynomial; Matrix multiplication; Discrete mathematics; Computer science; Matrix polynomial; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.02133126280777332,"gpt":0.2522161742658325,"spread":0.2308849114580592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001118113,0.0002432002,0.0002169571,0.0003503959,0.0004556835,0.000139736,0.0006864045,0.0001003035,0.000007645794],"category_scores_gemma":[0.00000225631,0.0002311176,0.0003470175,0.0004759012,0.0001590751,0.0001202021,0.000005923181,0.0002272635,0.00001910243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008121479,"about_ca_system_score_gemma":0.00006851986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001819998,"about_ca_topic_score_gemma":0.0001585506,"domain_scores_codex":[0.9984819,0.00004993699,0.0002762181,0.0005683577,0.0002501192,0.0003735234],"domain_scores_gemma":[0.9988847,0.0002259498,0.00008332726,0.0005945611,0.00005617458,0.0001553338],"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.0001212031,0.0007048628,0.0000203069,0.00004395243,0.00009976063,0.000004598626,0.0008388769,0.8638676,0.0009770012,0.002075817,0.0003674298,0.1308786],"study_design_scores_gemma":[0.01243186,0.001475459,0.01764209,0.0002783984,0.0001252487,0.0001014912,0.00004460104,0.8355883,0.1094717,0.01931191,0.001711769,0.001817185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06233222,0.00001814767,0.9340206,0.001645454,0.001075225,0.0005410055,0.0000351101,0.000303785,0.00002848106],"genre_scores_gemma":[0.7646026,0.000006126675,0.2345812,0.0006243513,0.00008136847,0.00007725094,0.000002973822,0.00001446323,0.00000969774],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7022704,"threshold_uncertainty_score":0.9424703,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2461274627","doi":"10.1109/tc.2015.2493547","title":"Approximate Radix-8 Booth Multipliers for Low-Power and High-Performance Operation","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":221,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adder; Arithmetic; Multiplier (economics); Notation; Mathematics; Binary number; Carry-save adder; Multiplication (music); Discrete mathematics; Computer science; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01258042604090034,"gpt":0.2015053349789125,"spread":0.1889249089380122,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001782831,0.0002827989,0.0002429921,0.0002175895,0.0001680837,0.00009580483,0.0001644447,0.000117353,0.000009143695],"category_scores_gemma":[0.00000139256,0.0002851623,0.00005451112,0.0001738373,0.00006639437,0.0005560637,0.000001479861,0.0002025334,0.0000491446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001680438,"about_ca_system_score_gemma":0.00003374692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007391779,"about_ca_topic_score_gemma":0.000003665339,"domain_scores_codex":[0.9988396,0.00001823153,0.0002756379,0.0003010285,0.0001985175,0.0003670036],"domain_scores_gemma":[0.9993687,0.00006552469,0.00002980227,0.000280604,0.0000579504,0.0001973975],"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.00008056244,0.0000528209,0.00001168993,0.00008595295,0.00006933916,0.00000150477,0.0008018778,0.9724347,0.001790224,0.0000269729,0.001686097,0.02295826],"study_design_scores_gemma":[0.002059251,0.0002807669,0.00007547508,0.00006170924,0.000026714,0.00001116975,0.00004609894,0.9390372,0.05706799,0.00001055675,0.0009559009,0.0003671813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2994923,0.00003288333,0.6971866,0.00004442516,0.002278147,0.0004493233,0.00002000368,0.0004106347,0.00008567513],"genre_scores_gemma":[0.9765074,0.00007035591,0.02295115,0.0001099586,0.00007570132,0.0001400445,0.000008463431,0.00007162429,0.00006535022],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.677015,"threshold_uncertainty_score":0.9999601,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149767240","doi":"10.1109/tc.2010.33","title":"Concurrent Structure-Independent Fault Detection Schemes for the Advanced Encryption Standard","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":183,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Advanced Encryption Standard; Computer science; AES implementations; Encryption; Cryptography; Virtex; Field-programmable gate array; Algorithm; Inverse; Lookup table; Fault detection and isolation; Computer engineering; Embedded system; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01188713086536695,"gpt":0.2762625963288175,"spread":0.2643754654634505,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001919865,0.0001829249,0.0001364331,0.0001677811,0.0007334031,0.0002267431,0.0005069165,0.00007467368,0.00003144576],"category_scores_gemma":[0.000003945656,0.0001447153,0.0001753003,0.0003403928,0.00007158236,0.0003609252,0.000004539332,0.0003930586,0.0000036464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005441557,"about_ca_system_score_gemma":0.00005372434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000207056,"about_ca_topic_score_gemma":0.0005590139,"domain_scores_codex":[0.9987008,0.00003633432,0.0002615035,0.0003881722,0.0003418028,0.000271416],"domain_scores_gemma":[0.998915,0.0002821776,0.00009873231,0.0004610413,0.0001602602,0.00008284719],"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.00002495661,0.00005272474,0.000003465525,0.000008210656,0.00004930239,4.869995e-7,0.0004423056,0.006938478,0.01301021,0.004176485,0.00005777806,0.9752356],"study_design_scores_gemma":[0.003351734,0.0006628874,0.0004102871,0.00002509817,0.0000717879,0.00004446262,0.0002456398,0.7306473,0.2214883,0.002225198,0.04025351,0.0005737625],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06200809,0.00001399785,0.9298062,0.000451353,0.006837851,0.0006397559,0.00007008525,0.0001670655,0.000005645419],"genre_scores_gemma":[0.9729315,0.00001923398,0.02666637,0.0001734431,0.00008105026,0.0001083279,0.000003933838,0.00001080416,0.000005304907],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9746618,"threshold_uncertainty_score":0.5901318,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2791851645","doi":"10.1109/tc.2018.2818144","title":"Cloudlets Activation Scheme for Scalable Mobile Edge Computing with Transmission Power Control and Virtual Machine Migration","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":178,"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":"National Institute of Information and Communications Technology; Ministerio de Economía y Competitividad","keywords":"Computer science; Scalability; Scheme (mathematics); Mobile edge computing; Enhanced Data Rates for GSM Evolution; Transmission (telecommunications); Mobile computing; Distributed computing; Power control; Power (physics); Computer network; Computer architecture; Operating system; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.00834257827932496,"gpt":0.2281554552691704,"spread":0.2198128769898454,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002945212,0.0002912848,0.0002728011,0.0002299517,0.0007770033,0.0002387393,0.0003351318,0.0001127613,0.000003112264],"category_scores_gemma":[0.000002394539,0.0002579151,0.00009320866,0.00039843,0.0001142067,0.0005498697,0.000005254293,0.0002256536,0.0000110759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007512587,"about_ca_system_score_gemma":0.00006691131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003056327,"about_ca_topic_score_gemma":0.000004912579,"domain_scores_codex":[0.998303,0.00006660448,0.0003191146,0.0006191024,0.000271207,0.0004209701],"domain_scores_gemma":[0.9988397,0.0003441888,0.0001259685,0.0003273791,0.0002030956,0.0001596252],"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.000811702,0.0006700448,0.0001035405,0.00007855509,0.0002319772,0.00000587256,0.00648095,0.03428686,0.03434829,0.0003076924,0.003281578,0.9193929],"study_design_scores_gemma":[0.002437388,0.002029208,0.0001823786,0.0001743346,0.00002045596,0.0000260479,0.0000267618,0.9617834,0.02911941,0.00004122365,0.003798809,0.000360584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1349355,0.00001838067,0.8608317,0.0004318498,0.002838024,0.0006187276,0.000002033167,0.000282179,0.00004161783],"genre_scores_gemma":[0.9092549,0.000003379868,0.08967322,0.0005275127,0.0004454412,0.00001977047,0.000003875254,0.00002684526,0.00004503299],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9274966,"threshold_uncertainty_score":0.9999873,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111459803","doi":"10.1109/tc.2002.1017695","title":"Bit-parallel finite field multiplier and squarer using polynomial basis","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":160,"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":"Trinomial; Finite field; Mathematics; Polynomial basis; Irreducible polynomial; Multiplier (economics); Primitive polynomial; Polynomial; Multiplication (music); Basis (linear algebra); Normal basis; Inverse; Discrete mathematics; Modulo; Arithmetic; Matrix polynomial; Combinatorics; Galois theory; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02397500966732785,"gpt":0.225899180900632,"spread":0.2019241712333042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000648405,0.0001845747,0.0001664838,0.0003291793,0.0003294556,0.0001606482,0.0003338596,0.00009746928,0.00004752124],"category_scores_gemma":[0.000001984656,0.0001774602,0.0001460389,0.0004336226,0.00006785679,0.0002927828,0.000006266126,0.0002342821,0.00002766672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002057985,"about_ca_system_score_gemma":0.00001062369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007721198,"about_ca_topic_score_gemma":0.00001514168,"domain_scores_codex":[0.9988735,0.00005488522,0.0001980444,0.0004090538,0.000180725,0.0002837365],"domain_scores_gemma":[0.999056,0.0003562881,0.00004353872,0.0003811611,0.00002727383,0.0001356963],"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.00005417009,0.0006328535,0.0001966993,0.00003945599,0.0002121667,0.00007711178,0.003152088,0.3150009,0.0009826857,0.0003229177,0.002741497,0.6765874],"study_design_scores_gemma":[0.0008188303,0.0001784138,0.0002094521,0.00004355343,0.000022825,0.0000422051,0.00001792481,0.9946799,0.002683732,0.00004820543,0.0009667879,0.0002882071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02420429,0.00008713514,0.9731923,0.0008968933,0.001193076,0.0001340865,0.000004082758,0.0001484047,0.0001397286],"genre_scores_gemma":[0.875339,0.00006274605,0.123539,0.0009319498,0.00005585836,0.000006956778,1.739364e-7,0.00001095967,0.00005329697],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8511348,"threshold_uncertainty_score":0.7236618,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2900613774","doi":"10.1109/tc.2018.2880742","title":"Efficient Mitchell’s Approximate Log Multipliers for Convolutional Neural Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":130,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Erzincan Üniversitesi; University of Toronto","keywords":"Convolutional neural network; Computer science; Algorithm; Parallel computing; Arithmetic; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0253079684981974,"gpt":0.2708273379042991,"spread":0.2455193694061017,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003973451,0.0002325637,0.0002177369,0.0001859009,0.0005391367,0.0001696683,0.0006516474,0.0001021561,0.000009765144],"category_scores_gemma":[0.000004710762,0.0002265059,0.000224964,0.0003694537,0.0002103591,0.000132026,0.000006588418,0.0002192297,0.00002775401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008602358,"about_ca_system_score_gemma":0.0000484213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001032841,"about_ca_topic_score_gemma":0.00000199244,"domain_scores_codex":[0.9983019,0.0001010796,0.0002840024,0.0005586741,0.0002570846,0.0004973147],"domain_scores_gemma":[0.9986726,0.0004519097,0.00007951323,0.0004580575,0.0001846028,0.0001533105],"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.0001163603,0.0001601282,0.000001319282,0.000009735472,0.0000468801,0.000005227647,0.0003012757,0.8859658,0.0006220561,0.0006959289,0.0009307953,0.1111446],"study_design_scores_gemma":[0.001282817,0.0002885701,0.00002920802,0.00002143974,0.00001725805,0.00002627731,0.000007384154,0.992027,0.005544738,0.0001813845,0.0003196528,0.0002543019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002785749,0.0000258283,0.9906004,0.0003770034,0.00543057,0.0003854026,0.000009451645,0.0002955323,0.0000900496],"genre_scores_gemma":[0.6487516,0.000001281189,0.3499131,0.0009659402,0.0002254756,0.00003580255,0.000001647365,0.00001646074,0.00008866336],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6459659,"threshold_uncertainty_score":0.9236643,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2954748826","doi":"10.1109/tc.2019.2926275","title":"Design and Analysis of Area and Power Efficient Approximate Booth Multipliers","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":129,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"University of Saskatchewan","keywords":"Multiplier (economics); Booth's multiplication algorithm; Computer science; Arithmetic; Algorithm; Approximation error; Adder; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.008221479260659581,"gpt":0.1870785827645566,"spread":0.178857103503897,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001227954,0.0001773793,0.0002941754,0.0005178252,0.00004730579,0.00002774003,0.00008699534,0.00006492878,0.00002765839],"category_scores_gemma":[3.591478e-7,0.0001714642,0.00007257333,0.0004881277,0.00005480072,0.00008303618,0.000001281606,0.0001252943,0.000008455374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004267567,"about_ca_system_score_gemma":0.000007678445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004660987,"about_ca_topic_score_gemma":8.665332e-7,"domain_scores_codex":[0.9991993,0.00002334617,0.0002012144,0.0002292745,0.0001475299,0.0001993544],"domain_scores_gemma":[0.9994926,0.0001342187,0.00003052475,0.0002392913,0.0000217295,0.00008162251],"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.00002643521,0.00003701988,0.00009520788,0.000034691,0.000489976,0.000001190046,0.0007707506,0.9908687,0.004406624,0.000005498495,0.00002754214,0.003236291],"study_design_scores_gemma":[0.0005102535,0.00009309311,0.0008077063,0.00003030701,0.0002084577,0.000002602069,0.00004089161,0.9844226,0.01368354,0.000001229118,0.00001998904,0.0001793487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.415854,0.00003152223,0.5835116,0.000005046718,0.0002812005,0.0001767605,0.000007570905,0.00009140751,0.00004083626],"genre_scores_gemma":[0.9854185,0.00004329214,0.01446243,0.00002186944,0.000002675229,0.00001020352,0.000001360762,0.00002384737,0.00001580154],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5695645,"threshold_uncertainty_score":0.6992106,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150782829","doi":"10.1109/tc.2007.19","title":"A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":124,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computational complexity theory; Polynomial basis; Multiplier (economics); Mathematics; Discrete mathematics; Matrix multiplication; Toeplitz matrix; Polynomial; Time complexity; Computer science; Algorithm; Combinatorics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04373998678267655,"gpt":0.2750253196515641,"spread":0.2312853328688875,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004612218,0.0002508438,0.0002463534,0.0003948949,0.0003781806,0.0001338026,0.0008747869,0.0001043011,0.00001064763],"category_scores_gemma":[0.000003807218,0.0002587196,0.0002815729,0.0007663849,0.0000621244,0.0002320857,0.000008217944,0.0002363804,0.00003350631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005811463,"about_ca_system_score_gemma":0.00005952968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003738487,"about_ca_topic_score_gemma":0.00003495178,"domain_scores_codex":[0.9983097,0.00006125647,0.0002788559,0.0006175807,0.0002391118,0.0004935325],"domain_scores_gemma":[0.9983891,0.0004439926,0.00005933218,0.0006852931,0.00005230432,0.0003700406],"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.001102617,0.001559082,0.000009620414,0.00009952225,0.0002808274,0.00002191486,0.007334784,0.3392284,0.0009034115,0.1794799,0.01361182,0.4563682],"study_design_scores_gemma":[0.004579772,0.001998162,0.000897723,0.0001354938,0.0000858431,0.00007113809,0.0003861075,0.9436241,0.006543038,0.03409523,0.00597942,0.001603977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002146294,0.000009058229,0.9936925,0.0009750921,0.001372261,0.0006646953,0.000005223062,0.0003835887,0.0007512775],"genre_scores_gemma":[0.4715307,0.000001343925,0.5274986,0.0007259171,0.00005119765,0.0000269349,0.000001243624,0.00001134067,0.000152723],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6043957,"threshold_uncertainty_score":0.9999865,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114353618","doi":"10.1109/tc.2002.1004590","title":"A new construction of Massey-Omura parallel multiplier over GF(2/sup m/)","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":121,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Multiplier (economics); GF(2); Mathematics; Very-large-scale integration; Primitive polynomial; Redundancy (engineering); Irreducible polynomial; Normal basis; Discrete mathematics; Arithmetic; Computer science; Polynomial; Galois theory; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01364235175092877,"gpt":0.2101195772906375,"spread":0.1964772255397088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006860971,0.0002055771,0.0002315357,0.000375774,0.0001620639,0.00008002317,0.0005106534,0.0001056451,0.0001587494],"category_scores_gemma":[0.000001149071,0.0001979691,0.0002583278,0.0007339425,0.0001104911,0.0003569159,0.000003792935,0.0002428623,0.00005626782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003048075,"about_ca_system_score_gemma":0.00002725444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008023509,"about_ca_topic_score_gemma":0.000009832575,"domain_scores_codex":[0.9985993,0.00006002623,0.0003238378,0.0004137661,0.00032153,0.0002815259],"domain_scores_gemma":[0.9989808,0.000155904,0.0001008931,0.0005489879,0.00005000114,0.0001633713],"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.00004401739,0.0005355663,0.0001828292,0.00004104555,0.0002657357,0.00002719984,0.001997962,0.1684688,0.001005701,0.007456385,0.004616653,0.8153582],"study_design_scores_gemma":[0.003373045,0.0004851545,0.001688801,0.0001558189,0.00007103776,0.0001650015,0.00007171794,0.9780891,0.009962717,0.002032985,0.003180914,0.0007237162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008817822,0.00006503244,0.9884586,0.0004984614,0.001366241,0.0001856161,0.000005336224,0.0001946793,0.0004082005],"genre_scores_gemma":[0.6722986,0.00007169209,0.3272614,0.0001729337,0.00004743138,0.000007608084,4.05132e-7,0.0000117001,0.0001282963],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8146344,"threshold_uncertainty_score":0.8072947,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2295445672","doi":"10.1109/tc.2015.2500576","title":"SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":112,"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":"Speedup; Homomorphic encryption; Computer science; IBM; Encryption; Theoretical computer science; Parallel computing; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.06959331102854904,"gpt":0.3037236892231882,"spread":0.2341303781946391,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003751792,0.0001606968,0.0001981672,0.0002997695,0.0001181442,0.0001022313,0.001353374,0.00006691597,0.00002984473],"category_scores_gemma":[0.000002465572,0.0001648491,0.00008121057,0.0008429846,0.0000919153,0.001079556,0.00001874798,0.0001881741,0.00003703152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004074266,"about_ca_system_score_gemma":0.0001618404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003538,"about_ca_topic_score_gemma":0.000151122,"domain_scores_codex":[0.9984257,0.00009896077,0.0003283706,0.0004838054,0.0004066822,0.0002565225],"domain_scores_gemma":[0.9982064,0.0001150037,0.0001145565,0.001268723,0.00009775915,0.0001975932],"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.0002032159,0.001814942,0.0005319358,0.0001245557,0.0006230751,0.00006314099,0.008894189,0.0292716,0.002012803,0.04532223,0.06430594,0.8468324],"study_design_scores_gemma":[0.009716361,0.002418239,0.001452765,0.0002190127,0.0002508123,0.0001332407,0.002961091,0.8683733,0.07750753,0.009447302,0.02553073,0.001989552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01160602,0.00002532831,0.9857593,0.000409841,0.001495909,0.0001903881,0.0001479788,0.0002449431,0.0001203365],"genre_scores_gemma":[0.9202713,0.00002027783,0.07939257,0.0002322225,0.00002991696,0.000009772021,0.00002983495,0.00001106236,0.000003065069],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9086652,"threshold_uncertainty_score":0.6722351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2791777778","doi":"10.1109/tc.2018.2817237","title":"A Stochastic Computational Multi-Layer Perceptron with Backward Propagation","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Stochastic computing; Computer science; Perceptron; Artificial neural network; Algorithm; Multilayer perceptron; Computation; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02673366689472249,"gpt":0.2602225842534681,"spread":0.2334889173587456,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007097286,0.0001946874,0.0001398133,0.0001347197,0.0004272848,0.0001546903,0.0004401649,0.000049587,0.00002585491],"category_scores_gemma":[5.36332e-7,0.0001652513,0.00006727396,0.0005053316,0.0001416944,0.0003478467,0.000004220969,0.0001911593,0.0002404858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006503904,"about_ca_system_score_gemma":0.00006487146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001329962,"about_ca_topic_score_gemma":0.00002792777,"domain_scores_codex":[0.9986936,0.00004655085,0.000200751,0.0004910088,0.0002973446,0.0002707651],"domain_scores_gemma":[0.9991497,0.0001002007,0.00007214727,0.0003803158,0.0001710599,0.0001265581],"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.00002930112,0.0002651019,0.000002801135,0.000004760667,0.0000352054,0.000002748189,0.0004449296,0.9080983,0.0003273333,0.001277296,0.0006422303,0.08887],"study_design_scores_gemma":[0.0006293285,0.0004011777,0.0003563176,0.00004091028,0.00001260722,0.00003822459,0.00001184181,0.9973962,0.0005815824,0.0001565904,0.0001524167,0.0002227579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008993441,0.000002921287,0.9887859,0.0009375539,0.0005231375,0.0003833155,0.000005829645,0.0003136866,0.00005426247],"genre_scores_gemma":[0.7786792,8.077611e-7,0.220525,0.0005343584,0.00009744294,0.00005492259,0.000002767079,0.00001420361,0.00009128131],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7696857,"threshold_uncertainty_score":0.6738752,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3023146441","doi":"10.1109/tc.2020.2992113","title":"An Improved Logarithmic Multiplier for Energy-Efficient Neural Computing","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Ferroelectric and Negative Capacitance Devices","field":"Engineering","cited_by":111,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adder; Computer science; Multiplier (economics); Logarithm; Benchmark (surveying); Arithmetic; Energy consumption; Multiplication (music); Artificial neural network; Approximation error; Algorithm; Mathematics; Artificial intelligence; Electrical engineering; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01584172770231131,"gpt":0.2190967090769517,"spread":0.2032549813746404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003506671,0.000186895,0.0001755492,0.00007377854,0.0001366876,0.00004101061,0.0001641691,0.00006004055,0.000006215032],"category_scores_gemma":[0.000001167071,0.0001947962,0.0001082089,0.0002194246,0.00002985174,0.00008317797,4.80888e-7,0.0001728618,0.000005073288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000556403,"about_ca_system_score_gemma":0.000009122514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005800874,"about_ca_topic_score_gemma":0.000005454263,"domain_scores_codex":[0.9991776,0.0000204986,0.000181128,0.0002617673,0.00008704027,0.0002719313],"domain_scores_gemma":[0.9995481,0.0001281329,0.00002453035,0.0001219469,0.00003218948,0.0001450759],"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.00003421384,0.00003752314,6.41797e-7,0.00002081247,0.00003895037,0.000001327089,0.0004577174,0.9242509,0.008740656,0.00001163484,0.000150388,0.06625524],"study_design_scores_gemma":[0.0006201137,0.0002578581,0.00001263492,0.00001235654,0.00001644117,0.000002260471,0.00006155599,0.9713885,0.02711723,0.000003415837,0.0002995937,0.0002080107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06717589,0.00003340521,0.9309976,0.0001171828,0.0009198291,0.0001944831,0.00002413728,0.0005047625,0.0000327179],"genre_scores_gemma":[0.9895288,0.000005038921,0.009528968,0.0007290571,0.0001376714,0.00002261031,0.000005195312,0.00003833008,0.000004337052],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9223529,"threshold_uncertainty_score":0.794356,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152747729","doi":"10.1109/tc.2011.144","title":"A Study of Optimal 4-Bit Reversible Toffoli Circuits and Their Synthesis","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Google (Canada)","funders":"","keywords":"Toffoli gate; Computer science; Reversible computing; Benchmark (surveying); Electronic circuit; Heuristics; Function (biology); Algorithm; Quantum computer; Quantum gate; Quantum","retraction":null,"screen_n_in":null,"score":{"opus":0.02843785834086029,"gpt":0.2187627636778454,"spread":0.1903249053369851,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001697932,0.0002086845,0.000273509,0.0002522088,0.000202764,0.00004767416,0.0006061679,0.00005215587,0.000008000492],"category_scores_gemma":[0.000002581925,0.0001761829,0.0000963902,0.0003888059,0.00006182439,0.0001648836,0.00001368387,0.0002024309,0.000005373568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001734128,"about_ca_system_score_gemma":0.00003114767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009809306,"about_ca_topic_score_gemma":0.000009687823,"domain_scores_codex":[0.9987722,0.000108791,0.0002450921,0.0004536399,0.0001729904,0.0002473017],"domain_scores_gemma":[0.9989436,0.0002974187,0.0000873402,0.0005129413,0.000048263,0.0001103959],"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.0000287503,0.001817249,0.00005323633,0.00003409913,0.0002687362,0.00005049608,0.036119,0.07183989,0.0003808909,0.000188059,0.00009552218,0.8891241],"study_design_scores_gemma":[0.001481734,0.002757873,0.001944056,0.0002322859,0.00006920856,0.0001914268,0.001426669,0.9477973,0.0429984,0.0002850664,0.00009375124,0.0007222288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3701888,0.00001235409,0.6290033,0.00003854325,0.0004096434,0.00014533,0.000003661632,0.0001106181,0.00008766903],"genre_scores_gemma":[0.9701143,0.000006739731,0.02975664,0.0000624812,0.00002111976,0.00001173887,6.882019e-8,0.00001249716,0.00001442707],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8884019,"threshold_uncertainty_score":0.718453,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160197556","doi":"10.1109/tc.2006.80","title":"Optimizing the length of checking sequences","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Leverhulme Trust","keywords":"Sequence (biology); State (computer science); Set (abstract data type); Algorithm; Finite-state machine; Mathematics; Computer science; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.02136507433847591,"gpt":0.2432458928702451,"spread":0.2218808185317692,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002332699,0.0001209377,0.0001278822,0.0001235352,0.0002223661,0.00008805269,0.0007217317,0.00004024867,0.000001945252],"category_scores_gemma":[0.00000342837,0.00009124092,0.00009819723,0.0003848692,0.00009115342,0.0001823127,0.000004340002,0.0001654071,0.000004210985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003251772,"about_ca_system_score_gemma":0.00003605157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003169932,"about_ca_topic_score_gemma":0.000008777031,"domain_scores_codex":[0.9990833,0.00005721845,0.0002159092,0.0002372578,0.0002218553,0.0001844964],"domain_scores_gemma":[0.9989073,0.0004717497,0.0000916722,0.0004495221,0.00005392726,0.00002581921],"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.00001072086,0.0002736437,0.0001267535,0.00003093435,0.00006268505,0.00001960825,0.001607505,0.6442675,0.001232777,0.004339761,0.005367792,0.3426603],"study_design_scores_gemma":[0.0003225889,0.00024368,0.0003081401,0.0002583339,0.00002374824,0.00007464711,0.00001722564,0.9018099,0.0851272,0.01099886,0.0004234641,0.0003922301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00400988,0.00003941211,0.991817,0.0004519572,0.0005847838,0.00009260842,0.000001339382,0.00269092,0.000312097],"genre_scores_gemma":[0.7150267,0.000003952051,0.2847749,0.0001342676,0.00002735963,0.000008387994,1.636106e-7,0.000005925484,0.00001839591],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7110168,"threshold_uncertainty_score":0.3720697,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152005431","doi":"10.1109/12.862220","title":"Continuous learning automata solutions to the capacity assignment problem","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"semigroups and automata theory","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Network packet; Computer science; Heuristic; Simulated annealing; Automaton; Learning automata; Set (abstract data type); Mathematical optimization; Class (philosophy); Assignment problem; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01753760132844699,"gpt":0.2125178869210948,"spread":0.1949802855926479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004251467,0.0002069486,0.0001792841,0.0001115769,0.0008608213,0.0002822262,0.001035566,0.00005796775,0.0001156383],"category_scores_gemma":[0.000002028346,0.0001624002,0.0001222692,0.0005881494,0.00006335358,0.0002971379,0.000008626394,0.0003687377,0.0006707277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001062514,"about_ca_system_score_gemma":0.00004418847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008757124,"about_ca_topic_score_gemma":0.00001691074,"domain_scores_codex":[0.9982569,0.000209657,0.0002563249,0.0004628752,0.0003446393,0.0004696067],"domain_scores_gemma":[0.998853,0.0002075046,0.00004819894,0.0006879341,0.00004383659,0.0001595853],"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.000007547553,0.0001648149,0.000001566177,0.000003580487,0.00003847592,0.000005360863,0.001303542,0.4656299,0.0002379421,0.001541073,0.003076217,0.52799],"study_design_scores_gemma":[0.0006023038,0.0004555811,0.0002243889,0.0001054606,0.00002569651,0.0001102332,0.00008130094,0.9340823,0.001915858,0.0006573726,0.06125674,0.0004827111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00683424,0.00001155686,0.9854761,0.004696338,0.0008038623,0.0003636419,0.00000868964,0.0008025006,0.001003078],"genre_scores_gemma":[0.9526874,0.00001625624,0.04443141,0.00172113,0.0000681624,0.00008620055,0.000001077452,0.00001774272,0.0009706391],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9458531,"threshold_uncertainty_score":0.8621072,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078474261","doi":"10.1109/tc.2015.2401031","title":"Joint Optimization of Rule Placement and Traffic Engineering for QoS Provisioning in Software Defined Network","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"National Natural Science Foundation of China","keywords":"Computer science; Forwarding plane; Software-defined networking; Computer network; Distributed computing; Unicast; Quality of service; Network packet; Routing (electronic design automation); Provisioning; Node (physics)","retraction":null,"screen_n_in":null,"score":{"opus":0.02283188212661872,"gpt":0.2177743438413438,"spread":0.1949424617147251,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002688293,0.0001531833,0.000219419,0.0001771524,0.00007089433,0.00006072328,0.0001818515,0.00006590973,0.000001081891],"category_scores_gemma":[0.00001070643,0.0001572393,0.00006058778,0.0003786914,0.00001660026,0.0002010798,0.000005871594,0.0001154098,7.324361e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007044864,"about_ca_system_score_gemma":0.00005989854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007485108,"about_ca_topic_score_gemma":0.000005332149,"domain_scores_codex":[0.9989359,0.00002717745,0.000306796,0.0003042594,0.0001669036,0.0002589754],"domain_scores_gemma":[0.9992878,0.000250544,0.00007668202,0.0002131511,0.00006706834,0.0001047563],"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.00002761241,0.00006041086,0.00001554282,0.00002313434,0.00001424297,0.000001297153,0.0003675704,0.9670842,0.000004485038,0.00006265014,0.0002555987,0.03208325],"study_design_scores_gemma":[0.001149051,0.0002707193,0.00005015305,0.0001676719,0.000008717441,0.000005912634,0.0000147596,0.9979114,0.0001701141,0.00003155938,0.00006284058,0.0001570892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009539411,0.00008787648,0.9884636,0.0001080856,0.001221431,0.00039128,0.000003338143,0.0001823132,0.000002663402],"genre_scores_gemma":[0.3400716,0.00001319448,0.6597135,0.00007051381,0.00005387074,0.00005355631,0.000002666505,0.00001538743,0.000005714179],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3305322,"threshold_uncertainty_score":0.6412031,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2122183684","doi":"10.1109/tc.2007.70815","title":"Fast and Flexible Elliptic Curve Point Arithmetic over Prime Fields","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"SIMD; Atomicity; Multiplication (music); Computer science; Elliptic curve cryptography; Elliptic curve; Parallel computing; Elliptic curve point multiplication; Curve25519; Multiprocessing; Prime (order theory); Arithmetic; Mathematics; Public-key cryptography; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01401900193872338,"gpt":0.2205330533353361,"spread":0.2065140513966127,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001077315,0.0002214062,0.0002168943,0.0003431721,0.0003977106,0.0001094113,0.0004281889,0.0001044643,0.00002226457],"category_scores_gemma":[0.000001373749,0.0002074804,0.0001617183,0.0005724892,0.0001697584,0.0003519643,0.000008555277,0.0003281901,0.0000410618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003015612,"about_ca_system_score_gemma":0.00005131015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007657188,"about_ca_topic_score_gemma":0.00001154175,"domain_scores_codex":[0.9985848,0.00007109103,0.000238919,0.0004927798,0.0002770405,0.0003353525],"domain_scores_gemma":[0.9990138,0.000196751,0.00005229076,0.0005186184,0.00004199295,0.0001764841],"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.000169417,0.002920095,0.001084978,0.0001894083,0.0008256142,0.0007503737,0.01348934,0.2092548,0.002337751,0.01186695,0.005050764,0.7520605],"study_design_scores_gemma":[0.003976698,0.001800874,0.01755149,0.000290598,0.0001125874,0.001656269,0.00008783935,0.9171302,0.05000574,0.003275654,0.002237507,0.001874553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03512949,0.0001175426,0.9623333,0.0006035345,0.001106798,0.0001813454,0.000003476936,0.0002830198,0.000241441],"genre_scores_gemma":[0.9507229,0.0001592399,0.04826424,0.0006054985,0.00004476375,0.00001407209,5.422785e-7,0.00001381432,0.0001748883],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9155934,"threshold_uncertainty_score":0.8460805,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136484227","doi":"10.1109/tc.2009.70","title":"Bit-Serial and Bit-Parallel Montgomery Multiplication and Squaring over GF(2^m)","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Trinomial; Finite field; Multiplication (music); Arithmetic; Cryptosystem; Mathematics; GF(2); Binary number; Cryptography; XOR gate; Normal basis; Computer science; Discrete mathematics; Galois theory; Algorithm; Logic gate; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.009825076464437171,"gpt":0.224169664099868,"spread":0.2143445876354309,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009690155,0.000174049,0.0001610294,0.0002898718,0.0002772493,0.0002001116,0.0002379209,0.00008160526,0.000002391921],"category_scores_gemma":[0.000001021425,0.0001680439,0.00007643861,0.0003625466,0.00007034235,0.0004059741,0.000004601361,0.0001765889,0.000004933606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001853472,"about_ca_system_score_gemma":0.00001516576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005973,"about_ca_topic_score_gemma":0.00001915471,"domain_scores_codex":[0.9989145,0.00004245723,0.0001937493,0.0004527473,0.0001673574,0.0002291912],"domain_scores_gemma":[0.9993458,0.0001063449,0.00005059902,0.0003383773,0.0000259814,0.0001329361],"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.0001034391,0.000458136,0.000223312,0.00002959869,0.00009188295,0.00002003619,0.001793112,0.04473786,0.007501842,0.004065007,0.0002728239,0.940703],"study_design_scores_gemma":[0.00392195,0.0009306147,0.07525023,0.0001473079,0.00006399894,0.0001303574,0.00004890977,0.9072695,0.006853373,0.003494589,0.0009383372,0.0009508816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.171288,0.0001014745,0.8270371,0.0006837252,0.0005121563,0.0001673141,0.000002078332,0.0001638017,0.00004434826],"genre_scores_gemma":[0.9423974,0.0001416334,0.05694732,0.0004288719,0.00005244473,0.000009759497,6.349875e-7,0.000007162519,0.00001480729],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.939752,"threshold_uncertainty_score":0.685263,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2914973130","doi":"10.1109/tc.2019.2895031","title":"Efficient Multiple-Precision Floating-Point Fused Multiply-Add with Mixed-Precision Support","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Double-precision floating-point format; Single-precision floating-point format; Accuracy and precision; Computer science; Multiplication (music); Floating point; Floating-point unit; Dot product; Algorithm; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01378502794709515,"gpt":0.24885029591215,"spread":0.2350652679650549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005896186,0.0004264177,0.0004769541,0.0003419548,0.0002944301,0.000231397,0.001078669,0.0001308909,0.00009289229],"category_scores_gemma":[0.00001485315,0.0003345581,0.0002604279,0.000880371,0.00007394645,0.0002717947,0.00002335883,0.0004966351,0.0005157667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001336378,"about_ca_system_score_gemma":0.00007912268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004688244,"about_ca_topic_score_gemma":0.000008204964,"domain_scores_codex":[0.9966431,0.0002762485,0.0005332823,0.001093506,0.0008513989,0.0006024667],"domain_scores_gemma":[0.9967592,0.001371287,0.0001784518,0.001204111,0.0001612397,0.0003256476],"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.0001053571,0.0004312198,0.00003673873,0.00001294457,0.0000383661,0.00002307866,0.0004094313,0.4098108,0.002423518,0.0000434616,0.0001729057,0.5864922],"study_design_scores_gemma":[0.002240218,0.001234676,0.0003779868,0.0001561181,0.00001517105,0.00004426095,0.00004958332,0.972793,0.02144901,0.0000629079,0.001071787,0.0005052591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06665099,0.000008043329,0.9274907,0.0002693936,0.004331341,0.0006546446,0.00001310745,0.0004323085,0.0001494346],"genre_scores_gemma":[0.5219852,0.000003006056,0.4775546,0.0002625531,0.00004246573,0.00001544416,0.000001383945,0.0000269779,0.0001083574],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5859869,"threshold_uncertainty_score":0.9999107,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144693841","doi":"10.1109/tc.2008.126","title":"The Mixed-Radix Chinese Remainder Theorem and Its Applications to Residue Comparison","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Modulo; Chinese remainder theorem; Residue number system; Binary number; Mathematics; Modulo operation; Moduli; Arithmetic; Comparator; Adder; Residue (chemistry); Remainder; Discrete mathematics; Algorithm; Computer science; Voltage; Physics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01577423187320397,"gpt":0.2544011287992291,"spread":0.2386268969260251,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0002023892,0.0002076758,0.0001895473,0.0002172309,0.001447318,0.0001414908,0.000779069,0.00006679283,0.00000226943],"category_scores_gemma":[0.000003905722,0.0001471833,0.000117895,0.0009656218,0.0001422981,0.0001784573,0.00001120445,0.0002765599,0.00005485378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002695848,"about_ca_system_score_gemma":0.00004141412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001781994,"about_ca_topic_score_gemma":0.00009986531,"domain_scores_codex":[0.9985382,0.0001176629,0.0002730541,0.0004628387,0.0002875032,0.000320716],"domain_scores_gemma":[0.9983271,0.0006796889,0.00005785491,0.0006508562,0.00007309889,0.0002114099],"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.0002015991,0.001560871,0.0008648889,0.00007434026,0.0005551898,0.00007897415,0.0128713,0.2087567,0.001852778,0.1019437,0.01237382,0.6588658],"study_design_scores_gemma":[0.00437021,0.001733208,0.05677591,0.0002670938,0.0001416399,0.001444182,0.0005114465,0.8163079,0.03294253,0.0179865,0.06433866,0.003180737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03440955,0.0002614853,0.9609904,0.002763771,0.0006787626,0.0004851999,0.000004944045,0.0002112592,0.0001946629],"genre_scores_gemma":[0.9815542,0.000172591,0.0175548,0.0004515785,0.00005982356,0.0001109814,5.39695e-7,0.00001387746,0.00008159296],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9471447,"threshold_uncertainty_score":0.9998527,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106876320","doi":"10.1109/12.956092","title":"Power analysis attacks and algorithmic approaches to their countermeasures for Koblitz curve cryptosystems","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":65,"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":"Scalar multiplication; Power analysis; Elliptic curve cryptography; Cryptosystem; Elliptic curve point multiplication; Computer science; Elliptic Curve Digital Signature Algorithm; Elliptic curve; Arithmetic; Cryptography; Side channel attack; Key (lock); Hessian form of an elliptic curve; Scalar (mathematics); Public-key cryptography; Key size; Mathematics; Algorithm; Computer security; Encryption; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05501079801963862,"gpt":0.241829707477477,"spread":0.1868189094578384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003300833,0.0002712455,0.0003622684,0.0008527586,0.0003553784,0.0003251796,0.0005822828,0.00009475082,0.000005593145],"category_scores_gemma":[0.000001840384,0.0002319991,0.0003694346,0.001620719,0.00007421437,0.0002757807,0.000006701783,0.0001566094,0.000007630946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004233377,"about_ca_system_score_gemma":0.00002980962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004349976,"about_ca_topic_score_gemma":0.00007746677,"domain_scores_codex":[0.9982739,0.00009910093,0.000299323,0.000672146,0.0002647562,0.000390754],"domain_scores_gemma":[0.998743,0.0002975801,0.00006834188,0.0005923056,0.00008050449,0.0002182581],"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.0003318913,0.001584766,0.001930753,0.0001558861,0.005935135,0.00005132638,0.01326232,0.4720022,0.0006528298,0.005631271,0.001983091,0.4964785],"study_design_scores_gemma":[0.001470552,0.0008513908,0.004981503,0.0001038487,0.0002941434,0.0001008857,0.0003307505,0.9809247,0.001980666,0.0007196923,0.007299498,0.0009423781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02671224,0.0001050996,0.9705374,0.0009445567,0.0008225497,0.0005561969,0.00003488706,0.0001926999,0.00009440832],"genre_scores_gemma":[0.9597234,0.00002740697,0.03969638,0.0003392329,0.00004687327,0.0001116521,0.000002070377,0.00001608856,0.00003690589],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9330112,"threshold_uncertainty_score":0.9460651,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4360994195","doi":"10.1109/tc.2023.3236868","title":"Tensor Recurrent Neural Network With Differential Privacy","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"Science and Technology Program of Guizhou Province; National Natural Science Foundation of China","keywords":"Differential privacy; Recurrent neural network; Computer science; Deep learning; Artificial intelligence; Tensor (intrinsic definition); Machine learning; Artificial neural network; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.03349375374757956,"gpt":0.2605833325612889,"spread":0.2270895788137093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0001337417,0.0002918036,0.0002511382,0.000307119,0.0003470129,0.0002391132,0.01223727,0.0001055031,0.00001495273],"category_scores_gemma":[0.00005675564,0.0002488023,0.000112915,0.001582214,0.0001198709,0.0004716568,0.0008711928,0.0005232192,0.0001663493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008225233,"about_ca_system_score_gemma":0.00004269672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001192992,"about_ca_topic_score_gemma":0.000008006093,"domain_scores_codex":[0.997764,0.00008898682,0.0002671166,0.0007578065,0.0004563786,0.0006657249],"domain_scores_gemma":[0.9945964,0.0002755429,0.00008764963,0.004863019,0.00005339612,0.0001239877],"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.0000927097,0.0002961257,0.000136348,0.00003701662,0.0002001326,0.0001658023,0.0002036678,0.1607985,0.0001487743,0.0003560169,0.2650058,0.5725591],"study_design_scores_gemma":[0.0006047466,0.0003609694,0.001034538,0.00009840231,0.00001762351,0.00003769441,0.000007184661,0.9930733,0.0009839281,0.002160682,0.001244505,0.0003764422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03718934,0.000008846132,0.9444128,0.01075189,0.003745649,0.000279773,0.00001781795,0.003558842,0.00003505805],"genre_scores_gemma":[0.840581,0.00004879737,0.1588011,0.0002753575,0.000128893,0.00006539759,0.000009500842,0.00003415515,0.00005579715],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8322748,"threshold_uncertainty_score":0.9999964,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140631135","doi":"10.1109/tc.2004.119","title":"Susceptibility of commodity systems and software to memory soft errors","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Radiation Effects in Electronics","field":"Engineering","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; Downtime; Operating system; Soft error; Software; Embedded system; Commodity; Transient (computer programming); Microprocessor; Real-time computing; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.008619772076645379,"gpt":0.2147903985425233,"spread":0.2061706264658779,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001291556,0.0001425973,0.0001983382,0.0001306468,0.00006766727,0.00001731267,0.0001196099,0.00007192078,0.000003728556],"category_scores_gemma":[0.00000381495,0.0001602887,0.00005569383,0.0001956227,0.00004569182,0.00008951634,8.880743e-7,0.0001952706,0.00001079697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002551331,"about_ca_system_score_gemma":0.00002884908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009455114,"about_ca_topic_score_gemma":0.0002024096,"domain_scores_codex":[0.9992408,0.0000339891,0.000206082,0.0001764667,0.0001470842,0.0001955405],"domain_scores_gemma":[0.9994106,0.0001463629,0.00002345148,0.0002820173,0.00003278897,0.0001047657],"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.000008851017,0.00004353898,0.00001103758,0.0001012675,0.00003970624,9.382732e-7,0.000327344,0.9849416,0.0003976197,0.00001530135,0.0001063026,0.0140065],"study_design_scores_gemma":[0.001557652,0.0006127302,0.001370257,0.0002333758,0.00006702462,0.00003224103,0.0001142136,0.9637818,0.03114571,0.0001341329,0.0003440692,0.0006068411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3379031,0.00004486626,0.6605575,0.0000288422,0.0009766273,0.0002179219,0.00002364353,0.000234831,0.00001265131],"genre_scores_gemma":[0.9952248,0.000007288333,0.004651763,0.00004226965,0.00002444248,0.00001769762,0.000001483637,0.00002443802,0.000005797348],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6573217,"threshold_uncertainty_score":0.6536383,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104193487","doi":"10.1109/tc.2009.173","title":"Algorithmic Aspects of Hardware/Software Partitioning: 1D Search Algorithms","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Algorithm; Computer science; Knapsack problem; Heuristic; Software; Combinatorics; Theoretical computer science; Mathematics; Artificial intelligence; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02679554778028945,"gpt":0.2722061593095307,"spread":0.2454106115292413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003703973,0.0002753487,0.0003683768,0.0004704974,0.0002094563,0.0001399987,0.001088911,0.0001376314,0.00001783724],"category_scores_gemma":[0.000004266273,0.0002895473,0.0002239627,0.0008251172,0.00007934032,0.0005557096,0.000005472777,0.0003774355,0.0000467212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000154281,"about_ca_system_score_gemma":0.0001691676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005454565,"about_ca_topic_score_gemma":0.000004029444,"domain_scores_codex":[0.9976293,0.0001826604,0.0004963772,0.0006039384,0.0006421968,0.000445481],"domain_scores_gemma":[0.9983299,0.0002119916,0.0001281448,0.0009286634,0.0002188514,0.0001824573],"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.00002787156,0.0008721768,0.00001340363,0.00006255433,0.0001422328,0.000138228,0.001687578,0.05288728,0.004639076,0.01000733,0.002903145,0.9266191],"study_design_scores_gemma":[0.001155098,0.002273122,0.0003838942,0.0005873772,0.00003592018,0.0002444225,0.00004636123,0.413239,0.5736904,0.006519727,0.00087807,0.0009465761],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006089894,0.00004283023,0.9957002,0.000435496,0.0009233996,0.0004294899,0.00001231728,0.001135585,0.000711715],"genre_scores_gemma":[0.6844225,0.00001406379,0.3151174,0.000260689,0.00006068894,0.00002312017,0.000001549023,0.00001551035,0.0000844315],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9256725,"threshold_uncertainty_score":0.9999557,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2973613048","doi":"10.1109/tc.2019.2941875","title":"Fast and Efficient Convolutional Accelerator for Edge Computing","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Convolutional neural network; Bandwidth (computing); Throughput; Edge device; Memory bandwidth; Computer engineering; Dataflow; Parallel computing; Efficient energy use; Computer hardware; Artificial intelligence; Wireless; Cloud computing","retraction":null,"screen_n_in":null,"score":{"opus":0.0169980314743467,"gpt":0.2521783771278744,"spread":0.2351803456535277,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008588249,0.0001699391,0.0001675412,0.000115212,0.0003087403,0.00007267208,0.0004081733,0.00005102219,0.00000558559],"category_scores_gemma":[8.809097e-7,0.000176303,0.00008453114,0.0003073992,0.00005514387,0.000166229,0.000008826803,0.0001585299,0.00005912824],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006501337,"about_ca_system_score_gemma":0.00003574157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001792693,"about_ca_topic_score_gemma":0.000001085785,"domain_scores_codex":[0.9987708,0.00002603745,0.0002124602,0.0005289722,0.0001678501,0.0002938681],"domain_scores_gemma":[0.9989334,0.0004245438,0.0000720225,0.0003749643,0.00007852589,0.0001165366],"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.00001610577,0.0001205118,0.00001631035,0.00001722738,0.00002509121,6.833618e-7,0.00020565,0.8987205,0.001156823,0.008105385,0.0003038752,0.09131182],"study_design_scores_gemma":[0.0006657093,0.0001130066,0.0002543694,0.00002682973,0.000005950691,0.00001724536,0.00001165979,0.9950153,0.002473416,0.0001657592,0.001047604,0.0002031613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03781657,0.00002103413,0.9593658,0.0005142062,0.001324938,0.0006353052,0.00001517105,0.0002410446,0.00006598097],"genre_scores_gemma":[0.8675968,0.000003660926,0.1316599,0.0005515096,0.00006316445,0.00003873245,0.000002013464,0.00001359737,0.00007058033],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8297802,"threshold_uncertainty_score":0.7189426,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2971946864","doi":"10.1109/tc.2019.2936192","title":"New Flexible Multiple-Precision Multiply-Accumulate Unit for Deep Neural Network Training and Inference","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Floating-point unit; Computer science; Floating point; IEEE floating point; Binary number; Unit (ring theory); Artificial neural network; 16-bit; Single-precision floating-point format; Algorithm; Computer hardware; Overhead (engineering); Exponent; Arithmetic; Control unit; Parallel computing; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.05346103363208157,"gpt":0.3028072657203022,"spread":0.2493462320882206,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001312148,0.0002939641,0.0003006039,0.0001456115,0.0003660649,0.0001799607,0.0007314142,0.00009937916,0.00001045098],"category_scores_gemma":[0.000006775736,0.0003020143,0.0001234043,0.0006328118,0.00004238851,0.0006853032,0.00001748393,0.0002988908,0.00003842933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004304483,"about_ca_system_score_gemma":0.00005131188,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001998776,"about_ca_topic_score_gemma":0.00003335709,"domain_scores_codex":[0.998109,0.00005686476,0.0003476756,0.0007431018,0.0002130585,0.0005302517],"domain_scores_gemma":[0.9970868,0.001770568,0.0001211755,0.0006867619,0.0000744654,0.0002601878],"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.00002726454,0.00001829259,0.00003823456,0.000004803059,0.00001273602,6.278415e-7,0.0002263541,0.6157026,0.0002696801,0.0004688373,0.00005370522,0.3831768],"study_design_scores_gemma":[0.001304941,0.0002368727,0.0003343974,0.00005207208,0.00001137076,0.00001379032,0.00001617815,0.993104,0.0009420931,0.00145479,0.002201666,0.0003277777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01320452,0.00004725929,0.9832313,0.0004406256,0.001607877,0.0009581172,0.000006284915,0.0004678474,0.00003616955],"genre_scores_gemma":[0.6293538,0.0000186615,0.3699071,0.000413451,0.00009087643,0.00004920349,0.000002862153,0.00002271529,0.0001412891],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6161493,"threshold_uncertainty_score":0.9999432,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1963863611","doi":"10.1109/tc.2012.22","title":"Low-Complexity Multiplier Architectures for Single and Hybrid-Double Multiplications in Gaussian Normal Bases","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"CMC Microsystems","keywords":"Exponentiation; Modular exponentiation; Computer science; Multiplier (economics); Multiplication algorithm; Cryptography; Cryptosystem; Multiplication (music); Arithmetic; Finite field; Parallel computing; Public-key cryptography; Algorithm; Encryption; Mathematics; Discrete mathematics; Binary number","retraction":null,"screen_n_in":null,"score":{"opus":0.03090075671251214,"gpt":0.254870268879105,"spread":0.2239695121665928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001465972,0.0001900665,0.0001747217,0.0003837781,0.0003349849,0.00009288094,0.0003372329,0.00005118069,0.000005009094],"category_scores_gemma":[0.000002314948,0.0001807274,0.000125746,0.0003513169,0.0001443401,0.000210441,0.000007265189,0.0001945809,0.000005939242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003499186,"about_ca_system_score_gemma":0.00002075037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000948438,"about_ca_topic_score_gemma":0.0001357743,"domain_scores_codex":[0.9987791,0.00004704317,0.0002325091,0.0003615264,0.0001412943,0.0004384966],"domain_scores_gemma":[0.9990137,0.000331797,0.00005143718,0.0003880772,0.00003005893,0.000184968],"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.0004915926,0.007895916,0.002920093,0.0003400206,0.0002222308,0.00001874035,0.0105987,0.2405853,0.0136175,0.008225444,0.0004388334,0.7146457],"study_design_scores_gemma":[0.009299259,0.0007434479,0.03863967,0.0002901357,0.00008104941,0.0002912184,0.0001811381,0.6384623,0.3062581,0.002457527,0.001609972,0.001686239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1773042,0.00004612957,0.8210903,0.000419118,0.0005201676,0.0004034174,0.00002085688,0.0001214351,0.00007434441],"genre_scores_gemma":[0.8896251,0.000004067584,0.1099556,0.0002380177,0.00005464347,0.00009768484,0.000002218127,0.00001217449,0.0000104497],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7129594,"threshold_uncertainty_score":0.7369849,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4212962064","doi":"10.1109/tc.2022.3150724","title":"Blockchain-Cloud Transparent Data Marketing: Consortium Management and Fairness","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph; Queen's University; University of Waterloo","funders":"","keywords":"Computer science; Credential; Cloud computing; Computer security; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02831752511895388,"gpt":0.2462722961404713,"spread":0.2179547710215174,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000605354,0.0002011701,0.0001971258,0.0002627575,0.0008792346,0.00007739091,0.002055721,0.00005477869,0.00003865686],"category_scores_gemma":[8.179425e-7,0.0002274827,0.00005532914,0.0005937815,0.0001261424,0.00008250654,0.00009270202,0.000433346,0.000007713711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006645432,"about_ca_system_score_gemma":0.00002728704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001751376,"about_ca_topic_score_gemma":0.00001120256,"domain_scores_codex":[0.9980074,0.0001816095,0.0002875538,0.0008833999,0.0003251956,0.0003148156],"domain_scores_gemma":[0.9979653,0.0001796947,0.00007719148,0.001652602,0.00002350178,0.0001017323],"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.000150464,0.002111302,0.0000940864,0.0001447695,0.0005460175,0.0001806569,0.001726365,0.091649,0.0001224451,0.05125508,0.009032918,0.8429869],"study_design_scores_gemma":[0.001076133,0.0001574694,0.0004051055,0.00002388295,0.00005949372,0.0001572993,0.0002828288,0.9685236,0.000368115,0.001315562,0.0271288,0.0005017127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01062982,0.0001059739,0.9839269,0.00306517,0.00109987,0.0004241178,0.00007431467,0.0005007361,0.0001730748],"genre_scores_gemma":[0.9721575,0.00005462258,0.02684704,0.0005714341,0.0000200907,0.000197107,0.000007357632,0.00001435094,0.0001305397],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9615276,"threshold_uncertainty_score":0.9276475,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4323022585","doi":"10.1109/tc.2023.3251846","title":"Blockchain-Based Fair and Fine-Grained Data Trading With Privacy Preservation","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph; Queen's University; University of Waterloo","funders":"","keywords":"Computer science; Merkle tree; Blockchain; Upload; Public-key cryptography; Ciphertext; Encryption; Computer security; Scheme (mathematics); Hash function; Zero-knowledge proof; Key (lock); Information privacy; Cryptography; Tree (set theory); Hash chain","retraction":null,"screen_n_in":null,"score":{"opus":0.03553868531691629,"gpt":0.254171627796285,"spread":0.2186329424793687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002584477,0.0001785582,0.0001626915,0.0003619927,0.0003700326,0.00009678351,0.001285393,0.00009760451,0.000003426254],"category_scores_gemma":[0.000004480082,0.0001658594,0.00003193436,0.001277233,0.0001067458,0.0001635301,0.00002131836,0.0002579044,0.00001242725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002900082,"about_ca_system_score_gemma":0.00006997034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002953345,"about_ca_topic_score_gemma":0.00005144387,"domain_scores_codex":[0.9986041,0.00004528422,0.0001955564,0.0006669517,0.0002143055,0.0002738692],"domain_scores_gemma":[0.9980818,0.0002852105,0.00006586425,0.001432047,0.0000480877,0.00008700989],"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.0001306234,0.0009995325,0.0003578482,0.0001715002,0.0003478875,0.00009291508,0.003268512,0.2942581,0.001791519,0.02126105,0.009763949,0.6675566],"study_design_scores_gemma":[0.0006274889,0.0001392771,0.0003369013,0.0000342576,0.0000131436,0.00001193505,0.00001359656,0.9947194,0.001960569,0.0008602638,0.001089586,0.0001935533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1005814,0.00001019567,0.8907554,0.006985049,0.0001524186,0.0003091163,0.0000230161,0.001161866,0.00002151457],"genre_scores_gemma":[0.9445943,0.000004356466,0.05496848,0.000279192,0.00001907708,0.00006914246,0.00001267865,0.00001463508,0.00003811862],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8440129,"threshold_uncertainty_score":0.6763548,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2132451830","doi":"10.1109/tc.2008.107","title":"Protection Circuit against Differential Power Analysis Attacks for Smart Cards","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Power analysis; Smart card; Microcontroller; Computer science; CMOS; Embedded system; Advanced Encryption Standard; Overhead (engineering); Transistor; Power (physics); Electrical engineering; Computer hardware; Encryption; Engineering; Cryptography; Voltage; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.03693312533703984,"gpt":0.2647202868880352,"spread":0.2277871615509953,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001149146,0.0002042805,0.000261066,0.000702637,0.000728216,0.0001186425,0.0004027383,0.00007779298,0.00003189873],"category_scores_gemma":[0.000001300027,0.0002105927,0.0005569228,0.001346261,0.00006460789,0.0002916643,0.000003631563,0.0001805813,0.000008843189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008120628,"about_ca_system_score_gemma":0.00005734929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008464354,"about_ca_topic_score_gemma":0.00009965655,"domain_scores_codex":[0.9984532,0.00006839837,0.0003199705,0.0005081504,0.0003242393,0.0003260708],"domain_scores_gemma":[0.9990657,0.00008296525,0.00008605501,0.0005133583,0.0001330957,0.0001188052],"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.0003601643,0.004990178,0.001498801,0.0001488949,0.01064216,0.00009524673,0.02348095,0.3002732,0.008595368,0.01095501,0.006802029,0.632158],"study_design_scores_gemma":[0.003623607,0.001035549,0.01239188,0.00003176651,0.0005247583,0.00005519,0.0001268349,0.967221,0.008134481,0.0005684361,0.005083366,0.00120318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1213585,0.000004481665,0.8762146,0.0001929191,0.001398716,0.0005132588,0.00004330041,0.0002144777,0.000059794],"genre_scores_gemma":[0.9901597,0.00001363064,0.009332636,0.0002228102,0.00004043986,0.000170495,0.00001249596,0.00001238282,0.00003541568],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8688012,"threshold_uncertainty_score":0.8587723,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149110203","doi":"10.1109/tc.2009.62","title":"Concurrent Error Detection in Finite-Field Arithmetic Operations Using Pipelined and Systolic Architectures","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Finite field; Finite field arithmetic; Arithmetic; Field (mathematics); Algorithm; Mathematics; Cryptography; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0182988739172879,"gpt":0.2632636006046212,"spread":0.2449647266873333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119274,0.0001857212,0.0001907103,0.000657808,0.0002670601,0.0001577962,0.0002586846,0.00008338489,0.000002276665],"category_scores_gemma":[0.000006491963,0.0001780675,0.00009459082,0.0007224067,0.00004737969,0.000153037,0.000003218148,0.000334382,0.000002944887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004162648,"about_ca_system_score_gemma":0.00003899715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001312811,"about_ca_topic_score_gemma":0.0002937818,"domain_scores_codex":[0.9987857,0.0001095115,0.0002758252,0.0003958883,0.0001762024,0.0002569004],"domain_scores_gemma":[0.9993069,0.0002391853,0.00003459274,0.0002782343,0.00003631765,0.0001047825],"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.000009064168,0.0001652995,0.00000912088,0.00001031079,0.00001422052,0.00001322947,0.0006277355,0.5875343,0.001292977,0.0002197515,0.000003228951,0.4101008],"study_design_scores_gemma":[0.0005950738,0.0003554713,0.0006609581,0.0000964847,0.00001650829,0.00007258834,0.00002193542,0.9866518,0.01100245,0.0002892864,0.00002113152,0.0002163393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1432562,0.00007776359,0.8549391,0.0006161013,0.00075981,0.0002201066,0.000002196282,0.0001160559,0.00001269455],"genre_scores_gemma":[0.9768327,0.00001940919,0.02250886,0.0005850157,0.00003333877,0.00001022782,3.531176e-7,0.000006414165,0.00000365642],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8335766,"threshold_uncertainty_score":0.7261383,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997419346","doi":"10.1109/tc.2015.2423679","title":"Minimum Cost Placement of Bistatic Radar Sensors for Belt Barrier Coverage","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Software deployment; Bistatic radar; Radar; Transmitter; Real-time computing; Algorithm; Telecommunications; Radar imaging","retraction":null,"screen_n_in":null,"score":{"opus":0.02557881749893496,"gpt":0.2512152714362126,"spread":0.2256364539372777,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002776129,0.0002515948,0.000317082,0.0002512678,0.0001436722,0.00007471273,0.0006199172,0.000091082,0.000005612459],"category_scores_gemma":[0.000006123812,0.0002574176,0.0001816185,0.0004304573,0.00009210724,0.000202152,0.000006377947,0.0001622472,0.00001310297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001591104,"about_ca_system_score_gemma":0.000127515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002909813,"about_ca_topic_score_gemma":0.00002040448,"domain_scores_codex":[0.998089,0.0001106598,0.0004289067,0.0004837484,0.0004795137,0.0004081861],"domain_scores_gemma":[0.998216,0.0005221703,0.0001561733,0.0006392497,0.0001921373,0.000274282],"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.00008339248,0.0002208821,0.000002444798,0.00002010788,0.00006594494,0.00000795263,0.000665537,0.9814925,0.0002673215,0.0004396763,0.001747892,0.01498632],"study_design_scores_gemma":[0.002097498,0.0005273194,0.000004540498,0.00007155601,0.0000279998,0.00001339333,0.00006295753,0.9706559,0.02163467,0.00005149082,0.004541759,0.0003108795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01555658,0.00002833057,0.9802136,0.0002761058,0.002985908,0.0005529317,0.00005306794,0.0001683521,0.0001651402],"genre_scores_gemma":[0.8981403,0.00001355653,0.100997,0.0003770232,0.00004691785,0.0000525597,0.000007529032,0.00002950032,0.00033555],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8825837,"threshold_uncertainty_score":0.9999878,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042528220","doi":"10.1109/tc.2012.35","title":"High-Speed Parallel Decimal Multiplication with Redundant Internal Encodings","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Arithmetic; Decimal; Multiplication (music); Multiplication algorithm; Adder; Multiplier (economics); Computer science; Critical path method; Reduction (mathematics); Mathematics; Numerical digit; Parallel computing; Algorithm; Binary number; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02156385517594522,"gpt":0.2647108640006778,"spread":0.2431470088247326,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000218942,0.0002050635,0.0002043287,0.0001375643,0.000192969,0.0001300763,0.0005823356,0.00005493802,0.00001357776],"category_scores_gemma":[0.000002213175,0.000163661,0.00009694399,0.0003724771,0.00007148997,0.0006453858,0.000006138491,0.0002646919,0.00007290785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008426711,"about_ca_system_score_gemma":0.00002459074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008786775,"about_ca_topic_score_gemma":0.000001907266,"domain_scores_codex":[0.9985749,0.00009220748,0.0002378582,0.0003789641,0.0003048766,0.0004111957],"domain_scores_gemma":[0.9989538,0.0002100888,0.00009616046,0.00043082,0.00005902102,0.0002501319],"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.00009015227,0.0006007232,0.00008162421,0.000008930127,0.00008957153,0.000009270411,0.0008903157,0.02851354,0.00275056,0.003098275,0.0002080046,0.963659],"study_design_scores_gemma":[0.00325378,0.001346187,0.004868554,0.0002107531,0.00006526672,0.0003178657,0.00007273668,0.9209399,0.062143,0.0008682715,0.004639155,0.001274573],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01070131,0.00001730877,0.9863118,0.0007099857,0.001774357,0.0001711198,0.000003139342,0.0002464369,0.00006453969],"genre_scores_gemma":[0.4812476,0.00000831974,0.5183318,0.0002617977,0.0000868995,0.00001184658,4.092147e-7,0.000009673626,0.00004165203],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9623845,"threshold_uncertainty_score":0.66739,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164336166","doi":"10.1109/tc.2003.1190584","title":"Efficient multiplication beyond optimal normal bases","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Iran University of Science and Technology; University of Tehran","keywords":"Multiplication (music); Finite field; Cryptography; Computer science; Normal basis; Multiplication algorithm; Arithmetic; Basis (linear algebra); Class (philosophy); Field (mathematics); Mathematics; Theoretical computer science; Algorithm; Discrete mathematics; Combinatorics; Galois theory; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.009442735712164141,"gpt":0.2186352816508348,"spread":0.2091925459386707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001558293,0.0001740176,0.000130975,0.0002868061,0.0003331722,0.00011223,0.0004201418,0.00006295284,0.00002097595],"category_scores_gemma":[0.000002255684,0.0001673403,0.000171199,0.0006481221,0.00007226667,0.0001290128,0.000002481261,0.0001885463,0.00007430429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003607816,"about_ca_system_score_gemma":0.00004536842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001404627,"about_ca_topic_score_gemma":0.000004151615,"domain_scores_codex":[0.9987028,0.00009568743,0.0002112639,0.0004259247,0.0002650251,0.0002992621],"domain_scores_gemma":[0.9990519,0.0001846688,0.00005200728,0.000517266,0.00005772362,0.0001364009],"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.000009584865,0.0004360114,0.00001313355,0.000007276834,0.00003431438,0.000009370495,0.0003791684,0.9382094,0.0005836452,0.005249977,0.000167022,0.05490112],"study_design_scores_gemma":[0.0009477673,0.0002410576,0.0004254511,0.00003084301,0.00002278989,0.00007732134,0.0000379559,0.9501572,0.04572592,0.0001266661,0.001803422,0.000403548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03546693,0.00003059268,0.961948,0.0002566215,0.00132988,0.0001894499,0.000004497661,0.0002406898,0.0005333232],"genre_scores_gemma":[0.8468238,0.00000708653,0.1527676,0.0003169882,0.00001775287,0.00002444616,6.121732e-7,0.000009090732,0.00003265658],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8113568,"threshold_uncertainty_score":0.682394,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168839239","doi":"10.1109/tc.2007.1084","title":"Hardware Complexity of Modular Multiplication and Exponentiation","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Modular exponentiation; Modular arithmetic; Exponentiation; Multiplication (music); Cryptosystem; Computer science; Multiplication algorithm; Arithmetic; Public-key cryptography; Fast Fourier transform; Cryptography; Modular design; Parallel computing; Mathematics; Algorithm; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.0246899663490851,"gpt":0.2433090217056675,"spread":0.2186190553565824,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002005197,0.00009790804,0.0001155074,0.0002558667,0.0001416041,0.00003369645,0.000230783,0.00005010232,0.000002562685],"category_scores_gemma":[0.000001115581,0.00009871084,0.00007766412,0.0003649378,0.0001181969,0.0002182194,0.000003217858,0.00009982989,0.000003439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001752693,"about_ca_system_score_gemma":0.00001000457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004435663,"about_ca_topic_score_gemma":0.00002239015,"domain_scores_codex":[0.9991657,0.00003356926,0.0002133123,0.0002572915,0.0001833755,0.0001467574],"domain_scores_gemma":[0.9993649,0.0001049822,0.00007474278,0.0003176322,0.00006531983,0.00007239815],"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.00009079167,0.0009750244,0.000500412,0.0001139974,0.0001813854,0.00001210359,0.003493832,0.0505137,0.03760679,0.02446936,0.00009733161,0.8819453],"study_design_scores_gemma":[0.001564608,0.0003457297,0.08278539,0.0001103916,0.00003841296,0.0000406881,0.00009326124,0.6770464,0.2334336,0.003811128,0.0002768933,0.0004534931],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1008065,0.00003006197,0.8982918,0.0002066207,0.000389742,0.0001394523,0.000003841932,0.00009462625,0.00003736698],"genre_scores_gemma":[0.8908278,0.00001688382,0.1090611,0.00006774141,0.00001259486,0.000003656317,0.000001207942,0.000004575983,0.000004456295],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8814918,"threshold_uncertainty_score":0.4025311,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101126543","doi":"10.1109/tc.2010.107","title":"On Delivery Guarantees and Worst-Case Forwarding Bounds of Elementary Face Routing Components in Ad Hoc and Sensor Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Routing (electronic design automation); Static routing; Computer network; Equal-cost multi-path routing; Greedy algorithm; Face (sociological concept); Routing protocol; Distributed computing; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01313667641229026,"gpt":0.2241575904699583,"spread":0.211020914057668,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003205731,0.0002491135,0.0003065588,0.0002549864,0.0002390465,0.0001306797,0.0002976733,0.0001145115,0.000004315596],"category_scores_gemma":[0.000001844968,0.000262802,0.00007621527,0.0003310306,0.0001151149,0.0003576027,0.00001880591,0.0006058642,0.000001524939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000442974,"about_ca_system_score_gemma":0.00001678672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001122303,"about_ca_topic_score_gemma":0.0003452075,"domain_scores_codex":[0.9983884,0.00008748085,0.0003963604,0.0005348081,0.0002141611,0.0003787879],"domain_scores_gemma":[0.9987437,0.0005591716,0.0001206823,0.0004173775,0.00003405402,0.0001249837],"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.0001519569,0.0003085872,0.0004882147,0.00003830448,0.0001187195,0.0003864404,0.001680844,0.5652854,0.00166365,0.0003852167,0.00009464798,0.4293981],"study_design_scores_gemma":[0.001130278,0.0002364862,0.0006884463,0.0001826135,0.00001782459,0.000326522,0.0001006682,0.996276,0.0006861249,0.00005517291,0.00004168006,0.0002582278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4840427,0.00004677532,0.5149177,0.00006762113,0.0006875752,0.0001782226,0.000003886673,0.00004695398,0.000008580116],"genre_scores_gemma":[0.9679305,0.0001091986,0.03163378,0.0002536539,0.00003391897,0.0000137636,0.000001479572,0.00001771046,0.000005975026],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4838878,"threshold_uncertainty_score":0.9999824,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3082110198","doi":"10.1109/tc.2020.3020545","title":"Practical and Secure SVM Classification for Cloud-Based Remote Clinical Decision Services","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph; Queen's University; University of Waterloo","funders":"National Key Research and Development Program of China; China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Notation; Support vector machine; Cloud computing; Computer science; Leverage (statistics); Machine learning; Clinical decision support system; Classifier (UML); Artificial intelligence; Algorithm; Decision support system; Data mining; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1004054206705346,"gpt":0.3646781160977232,"spread":0.2642726954271887,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004423223,0.0002117842,0.000261872,0.0001176856,0.0002332801,0.0002320467,0.005251172,0.0002440435,0.000003659373],"category_scores_gemma":[0.0005637123,0.0002070842,0.0001321029,0.000438774,0.0001198791,0.0005528044,0.0003311453,0.000491509,0.00002814625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004649892,"about_ca_system_score_gemma":0.0001143087,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007547421,"about_ca_topic_score_gemma":0.000009842233,"domain_scores_codex":[0.9979241,0.0001209538,0.0004660163,0.0008954619,0.0003127307,0.0002807125],"domain_scores_gemma":[0.9950283,0.001879342,0.0001594496,0.002622138,0.0001053096,0.0002054376],"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.0004125919,0.0003364653,0.00005462284,0.0001489339,0.00009729412,0.00002265472,0.0001448936,0.003126774,0.0003123366,0.001184846,0.08011165,0.9140469],"study_design_scores_gemma":[0.0009417264,0.0004457026,0.0001423051,0.00007473154,0.00002381881,0.000009976702,0.00001939623,0.9853621,0.001379551,0.006718158,0.004669281,0.000213276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00320978,0.0000137415,0.8949921,0.0991182,0.001394969,0.0003912298,0.00003274528,0.000835581,0.00001162635],"genre_scores_gemma":[0.2788406,0.00004133285,0.7181951,0.002805255,0.00008494126,0.00001128275,0.000005332971,0.00001483978,0.000001224783],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9822353,"threshold_uncertainty_score":0.9758072,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128504838","doi":"10.1109/tc.2003.1244936","title":"Fast normal basis multiplication using general purpose processors","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":40,"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":"Normal basis; Computer science; Multiplication (music); Basis (linear algebra); Finite field; Software; Parallel computing; Multiplication algorithm; Cryptography; Flexibility (engineering); Binary number; Arithmetic; Algorithm; Computer hardware; Galois theory; Mathematics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01719488378731872,"gpt":0.2390718775301977,"spread":0.2218769937428789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001373405,0.0001936649,0.0001500045,0.00033294,0.0003899015,0.0001525836,0.0004528216,0.00008011189,0.0000116784],"category_scores_gemma":[0.000001824962,0.0001911244,0.0001626677,0.0009001385,0.00006488684,0.0004597761,0.000002636692,0.000201293,0.0000246763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005300965,"about_ca_system_score_gemma":0.0000683225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003755079,"about_ca_topic_score_gemma":0.00001239206,"domain_scores_codex":[0.9986306,0.00009919355,0.000235982,0.000451438,0.0002589747,0.0003237468],"domain_scores_gemma":[0.9991853,0.00006866155,0.00007066441,0.0004594897,0.00007896905,0.000136956],"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.00001993071,0.0006561098,0.0001474176,0.00003750972,0.0001018725,0.00001831522,0.001469272,0.7516319,0.006329118,0.003303528,0.00009566364,0.2361894],"study_design_scores_gemma":[0.0009367748,0.0001524727,0.0004630838,0.00005093157,0.00003617663,0.0001218411,0.00004441597,0.8845976,0.1120064,0.0002913589,0.0007983195,0.0005006318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07881231,0.00002559923,0.9194635,0.0001259081,0.0009957638,0.0002161799,0.000003547315,0.0002022194,0.0001549657],"genre_scores_gemma":[0.7710677,0.0000133497,0.228591,0.0002264755,0.00002898597,0.0000218775,5.873083e-7,0.0000124276,0.00003760687],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6922554,"threshold_uncertainty_score":0.7793826,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168048374","doi":"10.1109/tc.2011.85","title":"A Low-Power High-Performance Concurrent Fault Detection Approach for the Composite Field S-Box and Inverse S-Box","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Advanced Encryption Standard; S-box; Encryption; Application-specific integrated circuit; Fault detection and isolation; Critical path method; Embedded system; Computer engineering; Fault coverage; Algorithm; Parallel computing; Block cipher; Engineering; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.02385932636325061,"gpt":0.2450125041940351,"spread":0.2211531778307845,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001671968,0.0001769629,0.0001420188,0.0001600486,0.0005794093,0.0001155824,0.0003917431,0.00006141705,0.000012576],"category_scores_gemma":[8.553371e-7,0.0001423058,0.00009982682,0.0003265972,0.00008700627,0.0003414936,0.00000797559,0.0002110628,0.000003528623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002776368,"about_ca_system_score_gemma":0.00001941173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001262737,"about_ca_topic_score_gemma":0.00006646025,"domain_scores_codex":[0.9989387,0.00004308946,0.0002338809,0.0003619298,0.0001702707,0.00025215],"domain_scores_gemma":[0.9992078,0.0002134621,0.00007375167,0.0003501948,0.00007242757,0.00008238857],"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.0001545196,0.0007573702,0.00007356862,0.00009381214,0.0002598393,0.000002457253,0.009016979,0.012512,0.001160646,0.003315762,0.0005132602,0.9721398],"study_design_scores_gemma":[0.001765978,0.001047453,0.00108036,0.0000347424,0.00006429759,0.00003368219,0.0002461375,0.9158918,0.07837049,0.0001554981,0.000903488,0.0004060614],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09569234,0.00001490413,0.90223,0.0001356477,0.00126693,0.0004935915,0.00001184197,0.0001121981,0.00004257961],"genre_scores_gemma":[0.9464377,0.00005111597,0.05277998,0.0005600979,0.00002489414,0.000127908,0.000001916566,0.000008977962,0.000007379135],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9717337,"threshold_uncertainty_score":0.5803062,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964973855","doi":"10.1109/tc.2010.138","title":"Hybrid Binary-Ternary Number System for Elliptic Curve Cryptosystems","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Bulgarian Academy of Sciences; Centre National de la Recherche Scientifique; Nanyang Technological University","keywords":"Scalar multiplication; Elliptic curve cryptography; Binary number; Hessian form of an elliptic curve; Elliptic curve; Ternary operation; Mathematics; Cryptosystem; Arithmetic; Integer (computer science); Scalar (mathematics); Elliptic curve point multiplication; Algorithm; Schoof's algorithm; Computer science; Discrete mathematics; Cryptography; Public-key cryptography; Pure mathematics; Encryption; Quarter period; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01000196216892474,"gpt":0.2300537332523566,"spread":0.2200517710834319,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002686103,0.0002960176,0.000301486,0.0002822554,0.000450114,0.0002591244,0.001011964,0.0001124156,0.00001338298],"category_scores_gemma":[0.000001562065,0.0002761309,0.0003938501,0.0003960728,0.00008908191,0.0003841073,0.000006494102,0.0004234756,0.0001874298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000476387,"about_ca_system_score_gemma":0.00006101192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005593464,"about_ca_topic_score_gemma":0.00001316631,"domain_scores_codex":[0.9980995,0.00008352481,0.0003865193,0.0006385813,0.0003224953,0.0004694015],"domain_scores_gemma":[0.9983134,0.0003705667,0.0001134142,0.0008701867,0.000113764,0.00021872],"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.0006637137,0.005574008,0.001014264,0.003087617,0.002459868,0.001120718,0.004460077,0.2529502,0.0617912,0.1553349,0.0193006,0.4922429],"study_design_scores_gemma":[0.001986972,0.0004908345,0.0002282699,0.0003061942,0.000079458,0.0008943542,0.00005963718,0.9484392,0.03919654,0.00058295,0.006824876,0.0009107435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07327434,0.00001670188,0.9136802,0.0002649896,0.01138263,0.0005430621,0.00002815956,0.0005836633,0.000226244],"genre_scores_gemma":[0.93224,0.000006305527,0.06720634,0.0001190106,0.0002058417,0.0001197853,0.000002303693,0.00002966891,0.00007072292],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8589657,"threshold_uncertainty_score":0.9999691,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2132902317","doi":"10.1109/tc.2007.1024","title":"Comments on \"Five, Six, and Seven-Term Karatsuba-Like Formulae","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":38,"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":"Modulo; Term (time); Multiplication (music); Arithmetic; Remainder; Chinese remainder theorem; Mathematics; Discrete mathematics; Computer science; Algebra over a field; Combinatorics; Pure mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01394277407386862,"gpt":0.2435503478042002,"spread":0.2296075737303316,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000340806,0.0002316173,0.0001823406,0.0003628872,0.0003954845,0.0001457477,0.000545966,0.00008084105,0.000009220879],"category_scores_gemma":[7.820655e-7,0.0002282096,0.0001409702,0.0004433206,0.00007888241,0.0003202352,0.000007983513,0.000281755,0.00004040516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004778851,"about_ca_system_score_gemma":0.00001496898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008085588,"about_ca_topic_score_gemma":0.00001845929,"domain_scores_codex":[0.9985981,0.00006454291,0.0002380484,0.0004565843,0.0002596569,0.00038307],"domain_scores_gemma":[0.9988373,0.0003541615,0.00006225117,0.00052022,0.00003409869,0.0001919576],"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.0003233514,0.000996636,0.0001555309,0.00003717421,0.0002093459,0.0001108028,0.003283285,0.006588525,0.0008294546,0.02000104,0.001975232,0.9654896],"study_design_scores_gemma":[0.0351631,0.02229776,0.0459675,0.002997641,0.0006044637,0.001536708,0.001229637,0.5226148,0.2085667,0.04963123,0.09686261,0.01252783],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1113544,0.00001231767,0.8855962,0.0003156275,0.001729856,0.0001680478,0.000005221441,0.0002543899,0.0005639952],"genre_scores_gemma":[0.98584,0.00001546102,0.01154199,0.002447664,0.00004316823,0.000007746807,0.000001025676,0.00001403099,0.00008886871],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9529618,"threshold_uncertainty_score":0.9306119,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385237357","doi":"10.1109/tc.2023.3296899","title":"HPKA: A High-Performance CRYSTALS-Kyber Accelerator Exploring Efficient Pipelining","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; Engineering and Physical Sciences Research Council; Queen's University; National Natural Science Foundation of China; Queen's University Belfast","keywords":"Computer science; NIST; Post-quantum cryptography; Cryptography; Parallel computing; Field-programmable gate array; Embedded system; Public-key cryptography; Encryption; Algorithm; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.05966546207419866,"gpt":0.2679069968707073,"spread":0.2082415347965086,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002995556,0.0002229481,0.0001980129,0.0006277563,0.0006115414,0.0002532914,0.000604027,0.00004857029,0.00003361525],"category_scores_gemma":[0.000001547818,0.0002284206,0.0001265738,0.001941785,0.00004562531,0.0005162045,0.00001335182,0.0002563446,0.0001804576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006841527,"about_ca_system_score_gemma":0.00005466503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004112618,"about_ca_topic_score_gemma":0.00001056343,"domain_scores_codex":[0.9981291,0.00005699899,0.0003633072,0.0005316738,0.0004216157,0.000497257],"domain_scores_gemma":[0.9989693,0.0001824431,0.00007084306,0.0005581063,0.00007787076,0.0001414183],"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.00002106887,0.0002578721,0.00004733634,0.000038683,0.0000883384,0.00003281528,0.005324085,0.7526916,0.001015938,0.001840553,0.001063413,0.2375783],"study_design_scores_gemma":[0.001036155,0.000209572,0.001784176,0.00008758215,0.0000167141,0.00001481971,0.0002476069,0.9814105,0.01304801,0.00008506652,0.001593759,0.0004660641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.440128,0.000003414162,0.557019,0.0002457123,0.001931802,0.0001304425,0.000007501916,0.0005041081,0.0000300573],"genre_scores_gemma":[0.9856839,0.00006073248,0.01373743,0.0002700077,0.00007222802,0.0001267985,0.000003980138,0.00002003393,0.00002486515],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5455559,"threshold_uncertainty_score":0.931472,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058949335","doi":"10.1109/tc.2009.165","title":"Formal Reliability Analysis Using Theorem Proving","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Computer science; Reliability (semiconductor); Automated theorem proving; Reliability engineering; Probabilistic logic; Reliability theory; Formal methods; Computer engineering; Theoretical computer science; Programming language; Failure rate; Power (physics); Artificial intelligence; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02671225330995575,"gpt":0.2919145740459249,"spread":0.2652023207359691,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007184122,0.0001776944,0.0002244421,0.0004270762,0.0003388696,0.0001600164,0.0007328701,0.00007892358,0.000007694131],"category_scores_gemma":[0.000006876763,0.0001723315,0.000259159,0.001604935,0.00005305539,0.001232851,0.000003653051,0.0002442141,0.00001227895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001735523,"about_ca_system_score_gemma":0.00005104296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001856068,"about_ca_topic_score_gemma":0.000001848585,"domain_scores_codex":[0.998345,0.0001828014,0.0003373425,0.0004754746,0.0003127216,0.000346613],"domain_scores_gemma":[0.9986838,0.000106445,0.0001134489,0.0009028707,0.00008932773,0.0001040962],"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.00001821617,0.0001473578,0.00001148482,0.000005083694,0.00006722813,0.000002209124,0.0004960466,0.7093714,0.0004620905,0.005549098,0.000007235553,0.2838626],"study_design_scores_gemma":[0.0001579026,0.0001464717,0.0008766453,0.00001240764,0.00008050614,0.000009361,0.00001253467,0.9869298,0.01068594,0.0008591705,0.00003591566,0.0001933693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02760608,0.000004626705,0.9706182,0.0001599116,0.0008246241,0.000199449,0.000002453664,0.0003391012,0.0002455135],"genre_scores_gemma":[0.5216944,0.000001452398,0.4780701,0.0002016095,0.00001711379,0.000003032071,3.590441e-7,0.000003527589,0.00000840155],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4940884,"threshold_uncertainty_score":0.7027473,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010472188","doi":"10.1109/tc.2013.2295612","title":"Cost-Efficient Mapping for Fault-Tolerant Virtual Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Backup; Network virtualization; Virtualization; Provisioning; Distributed computing; Network topology; Fault tolerance; Virtual machine; Node (physics); Computer network; Operating system; Cloud computing","retraction":null,"screen_n_in":null,"score":{"opus":0.02985099868980862,"gpt":0.2448836148336467,"spread":0.2150326161438381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003452137,0.0002772099,0.0002923229,0.0001993139,0.0004592872,0.0002242716,0.0007733267,0.0001265857,0.000006370588],"category_scores_gemma":[0.000004129944,0.000269391,0.0002521508,0.0004884201,0.00005577447,0.000154348,0.000007344392,0.0002826107,0.00003510579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008050232,"about_ca_system_score_gemma":0.00003433134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001204488,"about_ca_topic_score_gemma":0.000006138959,"domain_scores_codex":[0.9981052,0.0000711371,0.0003515949,0.0006272838,0.0002744875,0.0005702956],"domain_scores_gemma":[0.9981798,0.0007976318,0.00009603112,0.0006348502,0.00009369634,0.0001980011],"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.00001366432,0.00008698469,0.000001104666,0.000003904607,0.00002292554,0.000001306737,0.000184337,0.6879103,0.000007285206,0.001314769,0.001029955,0.3094235],"study_design_scores_gemma":[0.0009514735,0.0002829448,0.00003723994,0.00007397874,0.00001216184,0.00001357025,0.00001460648,0.9872696,0.0001893057,0.00008408719,0.01075102,0.0003200546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00153286,0.00002490053,0.9908822,0.0005418585,0.005763457,0.0005992142,0.000006753835,0.0005882612,0.0000605063],"genre_scores_gemma":[0.8984178,0.00001109897,0.09904219,0.001959454,0.0003072548,0.0001594264,0.000003629011,0.00003162587,0.00006755498],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8968849,"threshold_uncertainty_score":0.9999758,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135218079","doi":"10.1109/tc.2012.121","title":"DART: A Programmable Architecture for NoC Simulation on FPGAs","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":37,"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; Field-programmable gate array; Virtex; Embedded system; Network on a chip; Computer architecture; Routing (electronic design automation); Network packet; Parallel computing; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.02808219492267447,"gpt":0.2711044798407434,"spread":0.243022284918069,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002636507,0.0001933969,0.0001781299,0.0001922251,0.000313991,0.0001660062,0.0003283022,0.00009343892,0.000007979108],"category_scores_gemma":[0.00000231105,0.0001730426,0.0001973187,0.0002871384,0.00002393039,0.000338059,0.000002109264,0.0002048273,0.00006429738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008162081,"about_ca_system_score_gemma":0.00002066895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001225387,"about_ca_topic_score_gemma":0.00001186488,"domain_scores_codex":[0.9986783,0.00008097638,0.0002452101,0.0003334566,0.0002207424,0.0004412906],"domain_scores_gemma":[0.9989221,0.0003616365,0.00007704401,0.0004216984,0.00007145671,0.0001460843],"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.00003655156,0.0001667056,0.000003287031,0.00001197058,0.00003218283,5.516436e-7,0.0005616411,0.8351038,0.00003138477,0.001432182,0.0007995877,0.1618201],"study_design_scores_gemma":[0.0005346225,0.0004725366,0.00001856994,0.00006463742,0.00001057529,0.00001605991,0.00001273944,0.9576018,0.001263428,0.0001979598,0.03958125,0.0002257411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002423754,0.00001429675,0.9901294,0.0005026128,0.005705921,0.0006197736,0.000006173736,0.0003226787,0.000275451],"genre_scores_gemma":[0.9691613,0.000001229823,0.02934545,0.0006496878,0.0004314786,0.0001204028,0.000002095068,0.00001891393,0.0002693885],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9667376,"threshold_uncertainty_score":0.7056472,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154269166","doi":"10.1109/tc.2010.74","title":"Robust QBF Encodings for Sequential Circuits with Applications to Verification, Debug, and Test","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":35,"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; Very-large-scale integration; Encoding (memory); Satisfiability; Computability; Algorithm; Sequential logic; Theoretical computer science; True quantified Boolean formula; Computer engineering; Logic gate; Embedded system; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04050528070217042,"gpt":0.2750413686958254,"spread":0.2345360879936549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003005367,0.0001796158,0.0001429363,0.000218031,0.0004105082,0.0002145263,0.0006198596,0.00008633821,0.000004398969],"category_scores_gemma":[0.00001566142,0.0001783507,0.00004821809,0.0005259128,0.00009210737,0.0004464276,0.000004340036,0.0002303189,0.00002357028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000465882,"about_ca_system_score_gemma":0.0000733396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001353192,"about_ca_topic_score_gemma":0.00002665436,"domain_scores_codex":[0.9987053,0.00002935549,0.0002362272,0.0005751036,0.000199211,0.0002548059],"domain_scores_gemma":[0.9984858,0.0003561964,0.00008626651,0.0006849802,0.0001948654,0.0001918683],"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.00004392268,0.0005489401,0.00008464091,0.00008358625,0.00007279938,0.000001653598,0.001669668,0.05896666,0.06729872,0.05003764,0.0006881975,0.8205036],"study_design_scores_gemma":[0.001851898,0.001261877,0.001814206,0.00008706018,0.00009390889,0.0002070167,0.00006020061,0.7568718,0.2043911,0.0009885285,0.03111355,0.001258896],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003459343,0.000003205667,0.9936746,0.0006887506,0.0007880555,0.0009895649,0.00002246085,0.0002859402,0.00008812325],"genre_scores_gemma":[0.3812484,0.000003464357,0.6178738,0.0002700725,0.0000606199,0.0004818891,0.000002242004,0.00001488333,0.0000446019],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8192447,"threshold_uncertainty_score":0.727293,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102436827","doi":"10.1109/tc.2008.51","title":"Localized Broadcasting with Guaranteed Delivery and Bounded Transmission Redundancy","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":35,"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; Broadcasting (networking); Upper and lower bounds; Approximation algorithm; Bounded function; Redundancy (engineering); Bandwidth (computing); Node (physics); Constant (computer programming); Algorithm; Computer network; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02071676956508932,"gpt":0.2091507970209899,"spread":0.1884340274559006,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001150079,0.0002737791,0.0002977837,0.0001699302,0.0006818037,0.0001191713,0.0003510757,0.0001009156,0.00001246694],"category_scores_gemma":[2.331153e-7,0.0002362296,0.00009265599,0.0003974393,0.0002068398,0.0003490561,0.000003750991,0.0003104994,0.00001126249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004004716,"about_ca_system_score_gemma":0.0001378511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004985377,"about_ca_topic_score_gemma":0.000004223526,"domain_scores_codex":[0.9983181,0.00008016364,0.0003107857,0.0005612558,0.0003482744,0.0003813575],"domain_scores_gemma":[0.9990319,0.000190905,0.00008143548,0.000384939,0.00006694946,0.0002438744],"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.0003527504,0.0002782391,0.00003506166,0.00003379113,0.0001073474,0.0005508638,0.001864172,0.0153774,0.0001712217,0.0002826207,0.0005964476,0.9803501],"study_design_scores_gemma":[0.001862284,0.0004288925,0.00003837589,0.000203304,0.00002752297,0.001067617,0.00002333734,0.9933961,0.0005795137,0.0001188224,0.001890495,0.0003637524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02998212,0.0001096274,0.9681892,0.000247635,0.0005224326,0.0002085374,0.000003627323,0.0003424578,0.0003943625],"genre_scores_gemma":[0.8689536,0.0001298594,0.1301149,0.0005982564,0.00003860676,0.000009606269,0.000001481449,0.00001981949,0.0001338601],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9799863,"threshold_uncertainty_score":0.9633165,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}