{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Partha Pratim Pande","is_ca":true},{"name":"Cristian Grecu","is_ca":true},{"name":"M. Jones","is_ca":true},{"name":"A. Ivanov","is_ca":true},{"name":"R. Saleh","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005871976,0.001543723,0.000580537,0.002318168,0.0004698262,0.001105871,0.0007724907,0.0007359154,0.001111893],"category_scores_gemma":[0.02430204,0.0003010072,0.0004421175,0.002118757,0.0005500275,0.001676023,0.000612785,0.0004952897,0.0001853994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00178759,"about_ca_system_score_gemma":0.0005067156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008022762,"about_ca_topic_score_gemma":0.001131159,"domain_scores_codex":[0.9926826,0.004087089,0.0004088297,0.0003583902,0.00210902,0.0003540679],"domain_scores_gemma":[0.9791895,0.01518516,0.002123488,0.001213468,0.002087654,0.0002006057],"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.001248983,0.000344554,0.01272383,0.000508929,0.0001645412,0.0002125982,0.0001491122,0.747689,0.03476133,0.008640142,0.001119111,0.1924378],"study_design_scores_gemma":[0.00003671837,0.001225625,0.005829109,0.00004555781,0.00008933202,0.000247589,0.00009714597,0.9520871,0.03417151,0.004566844,0.001567312,0.000036164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7465881,0.007266995,0.2293376,0.0005745259,0.00007868697,0.0002698219,0.0003105172,0.0006574898,0.01491636],"genre_scores_gemma":[0.9560529,0.0007761894,0.04194636,0.00004353507,0.00003142737,0.000101219,0.0001875871,0.0001018532,0.0007589154],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005871976,"threshold_uncertainty_score":0.03105438,"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","authors":[{"name":"Bryce Brown","is_ca":true},{"name":"H.C. Card","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000492381,0.0005236634,0.0005317443,0.0004988814,0.0003904397,0.001523014,0.0007010865,0.001118743,0.003424738],"category_scores_gemma":[0.001883562,0.0003058465,0.0004980711,0.001147541,0.001884882,0.001777022,0.0008505693,0.001427482,0.001256392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009537026,"about_ca_system_score_gemma":0.0006114379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001269609,"about_ca_topic_score_gemma":0.001007193,"domain_scores_codex":[0.9994906,0.0001338819,0.00003323227,0.00008078974,0.0002288127,0.00003263995],"domain_scores_gemma":[0.9996082,0.000190355,0.0000460209,0.00006177065,0.00007760213,0.0000160904],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002755988,0.00001879139,0.0004923487,0.0002537697,0.00003147073,0.00005736253,0.00005702077,0.08782567,0.002746806,0.8442457,0.003231205,0.06101225],"study_design_scores_gemma":[0.0000104938,0.00005246922,0.0003540919,0.0001160036,0.00001739609,0.000179518,0.0000287124,0.3973673,0.002391028,0.5449467,0.0545103,0.00002598621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007188477,0.01399118,0.9317604,0.0014936,0.0004793796,0.00006565487,0.0001869727,0.0004475054,0.04438691],"genre_scores_gemma":[0.5572103,0.02460973,0.3758884,0.001384534,0.001356608,0.0004642845,0.0004842463,0.0002151442,0.03838672],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003424738,"threshold_uncertainty_score":0.01145685,"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","authors":[{"name":"Weiqiang Liu","is_ca":false},{"name":"Liangyu Qian","is_ca":false},{"name":"Chenghua Wang","is_ca":false},{"name":"Honglan Jiang","is_ca":true},{"name":"Jie Han","is_ca":true},{"name":"Fabrizio Lombardi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002507295,0.0003559257,0.0002732703,0.0004136543,0.0002681861,0.0004022008,0.0004977157,0.0002724955,0.001389002],"category_scores_gemma":[0.0008826489,0.0001891075,0.0001725691,0.0003646346,0.0001728187,0.0005710805,0.0002458116,0.0002599122,0.0003178838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002500499,"about_ca_system_score_gemma":0.0004098077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002149361,"about_ca_topic_score_gemma":0.0004784345,"domain_scores_codex":[0.9998412,0.00003627945,0.00001300114,0.00002103422,0.00006887422,0.00001951337],"domain_scores_gemma":[0.9997215,0.00006176162,0.00007123411,0.00004832432,0.00008822223,0.000008962515],"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.0005638254,0.00009531595,0.002684457,0.0004243456,0.0001310281,0.0004442597,0.0002705087,0.1484178,0.316038,0.05300783,0.002425376,0.4754973],"study_design_scores_gemma":[0.00009065957,0.00106393,0.001413855,0.0000665083,0.00006548218,0.001058006,0.00008991435,0.7405753,0.2161713,0.01345914,0.02589873,0.00004714809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1397518,0.0007198034,0.8547353,0.0001466975,0.00007303654,0.0001237602,0.00005939579,0.0005892725,0.003801015],"genre_scores_gemma":[0.5914535,0.0003351732,0.4051226,0.00007138577,0.00003515807,0.0001031909,0.00008885222,0.00003225129,0.002757868],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001389002,"threshold_uncertainty_score":0.004646659,"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","authors":[{"name":"Arash Reyhani-Masoleh","is_ca":true},{"name":"M.A. Hasan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002094597,0.0004536062,0.0003109761,0.0003429454,0.0003874778,0.0006478432,0.0007305058,0.0002688097,0.003892644],"category_scores_gemma":[0.000565421,0.0001724127,0.0004242023,0.0006135932,0.0003538246,0.001219435,0.0003219131,0.0006222934,0.0009497562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005895006,"about_ca_system_score_gemma":0.0006638862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005197584,"about_ca_topic_score_gemma":0.002421245,"domain_scores_codex":[0.9997961,0.00004792116,0.00001602718,0.00003398845,0.00007810589,0.00002798556],"domain_scores_gemma":[0.999779,0.00005598958,0.00004438066,0.00006896661,0.00004390119,0.000007830081],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004351528,0.0001986801,0.001052302,0.000594519,0.000104781,0.0005020892,0.0002727285,0.1787711,0.1739723,0.3449748,0.005703275,0.2934182],"study_design_scores_gemma":[0.0001267705,0.0007078957,0.0009346969,0.00006136007,0.0001112488,0.0008404683,0.00009545808,0.7385496,0.1086085,0.123298,0.02661194,0.00005397977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1054379,0.0005521302,0.8814443,0.0002211715,0.00007465675,0.0001435246,0.000108585,0.0008135666,0.01120416],"genre_scores_gemma":[0.4825441,0.0006268579,0.507748,0.0001128938,0.0000742545,0.0001584245,0.0002796905,0.00007874623,0.008377079],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003892644,"threshold_uncertainty_score":0.01302212,"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","authors":[{"name":"Honglan Jiang","is_ca":true},{"name":"Jie Han","is_ca":true},{"name":"Fei Qiao","is_ca":false},{"name":"Fabrizio Lombardi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002732026,0.000724467,0.0003781929,0.0006240386,0.0003609312,0.0008562343,0.0006691582,0.0004425618,0.009723749],"category_scores_gemma":[0.001180125,0.0002455991,0.0002582043,0.0007712594,0.0002754663,0.001147292,0.0004160373,0.0006969075,0.00391874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003874519,"about_ca_system_score_gemma":0.0007472496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002441099,"about_ca_topic_score_gemma":0.00062311,"domain_scores_codex":[0.9997718,0.00003229524,0.00001887413,0.0000353619,0.0001134908,0.00002825105],"domain_scores_gemma":[0.9997718,0.00005553645,0.00004802069,0.00004346935,0.00007020058,0.00001094282],"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.0007196898,0.0001538179,0.0008963126,0.001250093,0.00008402354,0.0006825058,0.0003211293,0.05377191,0.2704882,0.146323,0.02431422,0.5009951],"study_design_scores_gemma":[0.0001216819,0.0007693469,0.0007910298,0.0001993697,0.00009157089,0.002097396,0.0001108726,0.3167719,0.3869163,0.04191674,0.2501025,0.0001112868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07625023,0.004972056,0.873288,0.0005701784,0.000481296,0.0002413898,0.0005298398,0.004884808,0.03878218],"genre_scores_gemma":[0.4599959,0.00292398,0.5105045,0.000485176,0.0003094596,0.0003490235,0.001133841,0.0005716422,0.02372639],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009723749,"threshold_uncertainty_score":0.03252918,"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","authors":[{"name":"Mehran Mozaffari Kermani","is_ca":true},{"name":"Arash Reyhani-Masoleh","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001565547,0.0005328671,0.0004561221,0.000897156,0.000581964,0.0009251332,0.001188474,0.0006011151,0.00107769],"category_scores_gemma":[0.004752301,0.0002284638,0.0005169267,0.0004864932,0.000770077,0.001999433,0.001061952,0.001011834,0.0002292445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009826467,"about_ca_system_score_gemma":0.001093337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005569753,"about_ca_topic_score_gemma":0.0007617652,"domain_scores_codex":[0.998429,0.0003418831,0.0001304358,0.0002243117,0.0007367118,0.0001375528],"domain_scores_gemma":[0.9960068,0.001275044,0.0006037541,0.001049835,0.0009845634,0.00008012088],"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.001915358,0.0003127496,0.004766892,0.0005094479,0.0001232395,0.0004483488,0.0007121384,0.1640343,0.2001022,0.1844087,0.001967999,0.4406986],"study_design_scores_gemma":[0.0001442967,0.0007274674,0.0007905256,0.00006146233,0.0001222357,0.0005814685,0.00005761531,0.783179,0.1749792,0.03347453,0.005816934,0.0000652646],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08116268,0.0004618178,0.915902,0.0001728662,0.00006277605,0.0001362168,0.00002611231,0.0005765978,0.001498908],"genre_scores_gemma":[0.8206903,0.0002098942,0.1775669,0.00006447325,0.00003990922,0.00008019144,0.0000381617,0.00002668057,0.00128352],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001565547,"threshold_uncertainty_score":0.008279502,"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","authors":[{"name":"Tiago Koketsu Rodrigues","is_ca":false},{"name":"Katsuya Suto","is_ca":true},{"name":"Hiroki Nishiyama","is_ca":false},{"name":"Nei Kato","is_ca":false},{"name":"Katsuhiro Temma","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002859868,0.0003775546,0.0004555362,0.0002762727,0.0005842221,0.0005457202,0.0009879509,0.00043758,0.0009625853],"category_scores_gemma":[0.0005550026,0.0001261423,0.0002660953,0.0003786937,0.0003067038,0.0006437678,0.0005653347,0.0005080483,0.000201293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005378031,"about_ca_system_score_gemma":0.0005553291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001555995,"about_ca_topic_score_gemma":0.002103612,"domain_scores_codex":[0.9997811,0.00004916401,0.0000136745,0.0000447838,0.00005572962,0.00005550345],"domain_scores_gemma":[0.9997975,0.0000487253,0.00002733252,0.00004027886,0.00005162915,0.00003459374],"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.0009195751,0.0003763378,0.002064047,0.0001718741,0.00008236228,0.0007100056,0.0002650434,0.5723735,0.08344284,0.06360108,0.009018647,0.2669747],"study_design_scores_gemma":[0.00002068409,0.00008476675,0.0002080043,0.000003467164,0.000009133105,0.00007945236,0.00001807732,0.990681,0.005182998,0.002295987,0.001408898,0.000007557369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08651752,0.000374271,0.9071504,0.0002814341,0.0001680007,0.0001580953,0.00004058072,0.0005793347,0.004730255],"genre_scores_gemma":[0.9291107,0.0001120614,0.06863105,0.00007193351,0.00003018072,0.00006294811,0.00003251106,0.00002163262,0.001926928],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001555995,"threshold_uncertainty_score":0.003902018,"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","authors":[{"name":"Huapeng Wu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005342143,0.000536641,0.0005795358,0.0005405886,0.0005137302,0.0009433366,0.0005275563,0.0004201528,0.003927936],"category_scores_gemma":[0.001230967,0.0002444404,0.0005797863,0.0005160816,0.0005702535,0.001900661,0.0005782808,0.0007547227,0.001365223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005553452,"about_ca_system_score_gemma":0.0009290206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005222888,"about_ca_topic_score_gemma":0.00121836,"domain_scores_codex":[0.99943,0.00009427175,0.00003131217,0.00008583532,0.0002712884,0.00008729278],"domain_scores_gemma":[0.9995197,0.0001658069,0.00006004365,0.0001306748,0.0001032264,0.00002060219],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000994405,0.0002576933,0.0009612667,0.0004384737,0.00007902359,0.0005265856,0.0002737517,0.1164934,0.1633309,0.4672796,0.004321107,0.2450439],"study_design_scores_gemma":[0.000170081,0.0009583982,0.0006962368,0.00006076292,0.000087671,0.001432645,0.0001096351,0.6102065,0.1644278,0.2014828,0.02027786,0.00008960843],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2114729,0.0006886522,0.7650288,0.0003406783,0.00008572263,0.0001443405,0.00006868695,0.001046852,0.02112351],"genre_scores_gemma":[0.7439644,0.0006691816,0.2396892,0.00009797074,0.00009932411,0.0001002927,0.0002210061,0.00009659913,0.01506196],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003927936,"threshold_uncertainty_score":0.01314026,"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","authors":[{"name":"Min Soo Kim","is_ca":false},{"name":"Alberto A. Del Barrio","is_ca":false},{"name":"Leonardo Tavares Oliveira","is_ca":false},{"name":"R. Hermida","is_ca":false},{"name":"Nader Bagherzadeh","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004306663,0.0007997748,0.000407347,0.0005643783,0.0003874071,0.0008869426,0.001315466,0.0004373467,0.004167704],"category_scores_gemma":[0.002049202,0.0003089062,0.0003104998,0.0005618671,0.0004387987,0.001998954,0.0007882584,0.0008472747,0.0009065653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006441533,"about_ca_system_score_gemma":0.0009064202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001234801,"about_ca_topic_score_gemma":0.004193637,"domain_scores_codex":[0.9996505,0.0000698389,0.0000299942,0.00006024637,0.0001469972,0.00004239435],"domain_scores_gemma":[0.9996213,0.0001400891,0.00004763232,0.0000878167,0.00008770882,0.00001538673],"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.0005622496,0.0001425092,0.001075426,0.0002932817,0.00006687046,0.0003034634,0.0001460014,0.1498849,0.06491503,0.09102756,0.008868449,0.6827143],"study_design_scores_gemma":[0.00005657852,0.0004019908,0.0003696043,0.00005948408,0.00004180421,0.0003865581,0.00006152409,0.8892009,0.05088615,0.03953429,0.01896089,0.00004023118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03734715,0.0009477268,0.9544476,0.0001990118,0.0001277974,0.00006782118,0.00009091659,0.001404295,0.005367666],"genre_scores_gemma":[0.4091834,0.0006008327,0.5810432,0.0002015161,0.00008794054,0.000152483,0.0002476775,0.0001779853,0.008304972],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004167704,"threshold_uncertainty_score":0.01394236,"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","authors":[{"name":"S. Venkatachalam","is_ca":true},{"name":"Elizabeth Adams","is_ca":true},{"name":"Hyuk-Jae Lee","is_ca":false},{"name":"Seok‐Bum Ko","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002211653,0.0003695597,0.0003139006,0.0003290225,0.0002434013,0.000595698,0.0004818086,0.0002638398,0.001921182],"category_scores_gemma":[0.0009892187,0.0002184367,0.0002186278,0.0003980653,0.0002201221,0.0006031553,0.000207708,0.0002193768,0.000292018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005796683,"about_ca_system_score_gemma":0.0007210479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007773156,"about_ca_topic_score_gemma":0.001261886,"domain_scores_codex":[0.9997678,0.00004521691,0.000009538098,0.00002861848,0.0001207394,0.00002804165],"domain_scores_gemma":[0.9997029,0.0001040695,0.00007022607,0.00003759232,0.00007672197,0.00000854665],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0005062905,0.00008353271,0.003168609,0.0004030529,0.00009461922,0.0002927978,0.0002125429,0.5482244,0.1314053,0.07324499,0.003217759,0.239146],"study_design_scores_gemma":[0.00004685173,0.0005536479,0.0007505991,0.00002204661,0.00002869645,0.0002561146,0.00004032302,0.9589774,0.02576901,0.005728899,0.007813289,0.00001305319],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.288409,0.001871792,0.6925512,0.0003345642,0.00006636726,0.0001687504,0.0001383479,0.0006057374,0.01585425],"genre_scores_gemma":[0.854843,0.000527646,0.1395743,0.00005660888,0.0000322509,0.0001170585,0.00008883891,0.00002627561,0.004733988],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001921182,"threshold_uncertainty_score":0.00642699,"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","authors":[{"name":"Haining Fan","is_ca":true},{"name":"M.A. Hasan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004564932,0.0009351341,0.0004761724,0.0009960172,0.0007157152,0.001221195,0.001233893,0.0003867324,0.008535557],"category_scores_gemma":[0.001095328,0.0003624586,0.0005601734,0.001286363,0.0005598139,0.002036393,0.001018876,0.001161825,0.002452543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008109821,"about_ca_system_score_gemma":0.001085307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005356963,"about_ca_topic_score_gemma":0.00132427,"domain_scores_codex":[0.9995473,0.00009910783,0.00004510212,0.00008517677,0.0001748908,0.00004830646],"domain_scores_gemma":[0.9995627,0.0001042756,0.00005366717,0.0001263413,0.0001297909,0.00002326468],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004063247,0.0001828625,0.0003105525,0.0003348473,0.00006068091,0.0001548216,0.0002127113,0.02704395,0.08186843,0.4021382,0.008117145,0.4791693],"study_design_scores_gemma":[0.0002881013,0.00134325,0.0003939867,0.0001031723,0.0001398705,0.001104158,0.000103992,0.4922515,0.1655496,0.2228166,0.115778,0.0001277278],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01009848,0.0002901093,0.9795101,0.0001378689,0.0001120351,0.000110862,0.00005524692,0.000651601,0.009033665],"genre_scores_gemma":[0.1235944,0.0005314335,0.8643678,0.0001864523,0.0001565819,0.0002861182,0.0001845495,0.0001151635,0.0105775],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008535557,"threshold_uncertainty_score":0.02855432,"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","authors":[{"name":"Arash Reyhani-Masoleh","is_ca":true},{"name":"M.A. Hasan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001922918,0.0005263471,0.0005038792,0.0006525205,0.0006557444,0.0005409394,0.0007706566,0.0004654905,0.002737639],"category_scores_gemma":[0.0005040524,0.0003062124,0.0005204934,0.0007516351,0.0004087809,0.001156011,0.000608943,0.0007011945,0.0009576278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003873873,"about_ca_system_score_gemma":0.0006537237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000288514,"about_ca_topic_score_gemma":0.000647328,"domain_scores_codex":[0.9998382,0.00002693919,0.000011952,0.00004240256,0.00005395409,0.00002646974],"domain_scores_gemma":[0.999782,0.00002713958,0.00003840687,0.00005229475,0.00007434397,0.0000257468],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008985879,0.0001976484,0.001809009,0.0005978401,0.0001604113,0.001356336,0.0003682894,0.01352892,0.2813693,0.1832736,0.01066572,0.5057743],"study_design_scores_gemma":[0.0005205871,0.00312271,0.004848768,0.0001853709,0.0005432949,0.01041185,0.0002294869,0.2184448,0.4077792,0.1303418,0.2232815,0.0002905952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1353233,0.001422526,0.8315578,0.0007552153,0.0006965442,0.0002985184,0.0002453116,0.001726932,0.02797378],"genre_scores_gemma":[0.3959662,0.0009791126,0.5863901,0.000307217,0.0002992408,0.0002526764,0.0004120017,0.00007560539,0.01531787],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002737639,"threshold_uncertainty_score":0.009158313,"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","authors":[{"name":"Alhassan Khedr","is_ca":true},{"name":"Glenn Gulak","is_ca":true},{"name":"Vinod Vaikuntanathan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009569697,0.0004423072,0.0004697951,0.0004667573,0.0003438217,0.0011646,0.001403601,0.0006082637,0.009389476],"category_scores_gemma":[0.002708829,0.0002835801,0.0004545214,0.0004094181,0.0006128387,0.002588164,0.001427403,0.001195993,0.003869016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006491316,"about_ca_system_score_gemma":0.001011714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005730816,"about_ca_topic_score_gemma":0.0006843028,"domain_scores_codex":[0.9989442,0.000174387,0.00007808431,0.0001550302,0.0004901193,0.000158067],"domain_scores_gemma":[0.9988237,0.0002772156,0.000078583,0.0005787789,0.0001880999,0.00005359181],"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.001837458,0.0005365637,0.004032235,0.000542584,0.0001918009,0.0007044874,0.0005058119,0.07615487,0.1361196,0.1532027,0.04564687,0.580525],"study_design_scores_gemma":[0.0002143566,0.0003428676,0.001002402,0.00005547706,0.00004831214,0.0005812735,0.00008235041,0.6633407,0.243258,0.04855927,0.04244424,0.0000708417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05147741,0.0004638745,0.9082275,0.0003172414,0.0001503742,0.0002230308,0.0005751242,0.02739745,0.01116805],"genre_scores_gemma":[0.6003352,0.0002746164,0.3830487,0.0003536332,0.00009430618,0.0002444311,0.001416708,0.001500649,0.01273167],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009389476,"threshold_uncertainty_score":0.03141099,"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","authors":[{"name":"Yidong Liu","is_ca":true},{"name":"Siting Liu","is_ca":true},{"name":"Yanzhi Wang","is_ca":false},{"name":"Fabrizio Lombardi","is_ca":false},{"name":"Jie Han","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008019357,0.0005833007,0.0005630326,0.0004621545,0.0002823502,0.0006588955,0.001324393,0.0007261369,0.001649775],"category_scores_gemma":[0.001056538,0.0004262408,0.0006920182,0.0005955838,0.0004403388,0.0008379502,0.000468839,0.0008949469,0.0004244685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005862687,"about_ca_system_score_gemma":0.0008977639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002129906,"about_ca_topic_score_gemma":0.003661753,"domain_scores_codex":[0.9996086,0.0000818347,0.00003143536,0.00007497503,0.0001611984,0.00004193122],"domain_scores_gemma":[0.9996694,0.0001121822,0.00004762081,0.00005079555,0.0001029371,0.0000169285],"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.0002130413,0.000119011,0.001394879,0.0002853958,0.0001983219,0.0001927978,0.0000628683,0.583914,0.04685203,0.02800625,0.002970055,0.3357913],"study_design_scores_gemma":[0.000007534462,0.00004524348,0.0001459383,0.00000518928,0.00001309238,0.00003004283,0.000001486355,0.9926214,0.004829647,0.001017834,0.0012756,0.000006965985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01128436,0.0002795922,0.9857574,0.0001082299,0.00007451623,0.00003399065,0.00004968762,0.0009287825,0.001483526],"genre_scores_gemma":[0.4988501,0.0005047806,0.4950573,0.0002483915,0.00006040047,0.0001356535,0.0002147508,0.00007032679,0.004858166],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002129906,"threshold_uncertainty_score":0.005519032,"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","authors":[{"name":"Mohammad Saeed Ansari","is_ca":true},{"name":"B.F. Cockburn","is_ca":true},{"name":"Jie Han","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002722956,0.0004804286,0.000286187,0.0005278481,0.0003462379,0.0006979623,0.001143168,0.0003528551,0.007596489],"category_scores_gemma":[0.0007924152,0.0001746174,0.0002369963,0.000602041,0.0002431872,0.001282295,0.0005061154,0.0005517737,0.001471918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005166624,"about_ca_system_score_gemma":0.0005867727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005700793,"about_ca_topic_score_gemma":0.001674885,"domain_scores_codex":[0.9997942,0.00002687385,0.00001873801,0.00004569583,0.00008702713,0.0000275369],"domain_scores_gemma":[0.9997836,0.00005481601,0.00002588325,0.00003472939,0.0000888951,0.00001207656],"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.0007243244,0.000158774,0.001049463,0.0006030816,0.00005870529,0.0004400773,0.0001183771,0.04582941,0.2034584,0.03472829,0.01185101,0.7009801],"study_design_scores_gemma":[0.0001065629,0.001124538,0.001044435,0.0001557039,0.0001008213,0.001202757,0.00007159793,0.6800799,0.2156907,0.0156905,0.08465046,0.00008211092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06414272,0.003757349,0.9031959,0.0006736545,0.0004827555,0.0001359702,0.0003474754,0.003691058,0.0235732],"genre_scores_gemma":[0.6268178,0.001387636,0.3513745,0.0005655634,0.0001846883,0.0001319976,0.000449632,0.0001319675,0.0189562],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007596489,"threshold_uncertainty_score":0.0254128,"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","authors":[{"name":"Oleg Golubitsky","is_ca":true},{"name":"Dmitri Maslov","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007184333,0.0003205026,0.0004517372,0.0005611685,0.0004730302,0.0007642902,0.0005192791,0.0005848606,0.003461316],"category_scores_gemma":[0.004659045,0.00029168,0.0003289403,0.0006463816,0.0009827263,0.001602185,0.0003045869,0.0006197583,0.0002498421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001541969,"about_ca_system_score_gemma":0.001199151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009183659,"about_ca_topic_score_gemma":0.001204162,"domain_scores_codex":[0.9993865,0.0001466457,0.00003809651,0.000100078,0.0002434685,0.00008509659],"domain_scores_gemma":[0.997893,0.001570781,0.0001983724,0.0001691139,0.0001355807,0.00003301905],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001894832,0.0001092173,0.00118919,0.000468109,0.00002998183,0.000146541,0.0001560544,0.5313836,0.04683251,0.3094364,0.001188125,0.1088707],"study_design_scores_gemma":[0.00007156534,0.0002148352,0.0005471844,0.00005436207,0.00002535362,0.0001594388,0.0001082908,0.8075438,0.07338116,0.1112092,0.006658079,0.00002679928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4881913,0.001590618,0.472983,0.0009909773,0.00004723375,0.0001540035,0.0003356445,0.0006459658,0.03506117],"genre_scores_gemma":[0.7972512,0.0006931755,0.1984555,0.0001122877,0.00001944763,0.0001263742,0.0002092619,0.0001342452,0.002998479],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003461316,"threshold_uncertainty_score":0.01157922,"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","authors":[{"name":"Robert M. Hierons","is_ca":false},{"name":"Hasan Ural","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001816112,0.001244268,0.0009740067,0.001257092,0.000626492,0.001231808,0.001626878,0.0009370499,0.003306209],"category_scores_gemma":[0.01124379,0.0007815522,0.0006866411,0.001228095,0.000739606,0.002092422,0.0009561805,0.001148615,0.0009924689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001362737,"about_ca_system_score_gemma":0.002501872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001687552,"about_ca_topic_score_gemma":0.003061296,"domain_scores_codex":[0.9974689,0.0006963806,0.0002697932,0.0006208033,0.0006153698,0.0003287031],"domain_scores_gemma":[0.9915406,0.004781183,0.001207061,0.0007517575,0.001331235,0.0003882332],"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.001706514,0.0005095878,0.008256962,0.0006332221,0.0001401059,0.0003555253,0.0003478143,0.6055328,0.07574732,0.01024674,0.003039558,0.2934838],"study_design_scores_gemma":[0.0001446665,0.0009740488,0.002371745,0.00008764779,0.0001511088,0.0003784322,0.0002414409,0.9167105,0.06069639,0.01290304,0.005295115,0.00004583855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2878277,0.001356049,0.6954608,0.0005557786,0.0001356595,0.0005271719,0.0005282341,0.003715159,0.009893345],"genre_scores_gemma":[0.6097521,0.0004035428,0.3842092,0.0001502993,0.0000416667,0.0003018725,0.0008898994,0.0007792449,0.003472139],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003306209,"threshold_uncertainty_score":0.01106036,"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","authors":[{"name":"B. John Oommen","is_ca":true},{"name":"Timothy Roberts","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006357527,0.0008268504,0.0009328924,0.0006240812,0.00064758,0.001415648,0.00162583,0.001583259,0.005158228],"category_scores_gemma":[0.003282793,0.0004324033,0.0008410921,0.0007365015,0.001427187,0.001111341,0.001292607,0.001753554,0.000604961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001081865,"about_ca_system_score_gemma":0.001453167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002743382,"about_ca_topic_score_gemma":0.003428462,"domain_scores_codex":[0.999455,0.000170682,0.00003688547,0.0001456108,0.0001151138,0.00007669652],"domain_scores_gemma":[0.9976739,0.001685198,0.0001218884,0.0001963469,0.0002178365,0.0001047667],"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.00009576975,0.00008697104,0.0003384099,0.0001786158,0.00004099736,0.000113794,0.0001816772,0.8169832,0.001683957,0.1275315,0.001979537,0.05078562],"study_design_scores_gemma":[0.00002009637,0.00002135753,0.0000332042,0.000007401703,0.000005552043,0.00001529967,0.00001763766,0.9511563,0.0004162782,0.04734706,0.0009529743,0.000006767744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02541015,0.0005079554,0.963569,0.0003917578,0.00009394094,0.0000609647,0.0001164503,0.0004838906,0.009365875],"genre_scores_gemma":[0.5970802,0.0007009833,0.3916563,0.0001569226,0.0001218163,0.000400493,0.0003626301,0.0001306701,0.009389971],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005158228,"threshold_uncertainty_score":0.01725596,"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)","authors":[{"name":"Huawei Huang","is_ca":false},{"name":"Song Guo","is_ca":false},{"name":"Peng Li","is_ca":false},{"name":"Baoliu Ye","is_ca":false},{"name":"Ivan Stojmenović","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001536734,0.001577454,0.001534653,0.0005842115,0.000509024,0.001375258,0.001295092,0.001217991,0.001568909],"category_scores_gemma":[0.00354719,0.000664447,0.0006710993,0.001105298,0.0007003006,0.001543185,0.0009895123,0.001079082,0.0002279568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001154235,"about_ca_system_score_gemma":0.001754123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002415812,"about_ca_topic_score_gemma":0.002721385,"domain_scores_codex":[0.9989206,0.0004017495,0.00004947123,0.0001792853,0.0002416363,0.000207435],"domain_scores_gemma":[0.9979702,0.001399248,0.0001937061,0.0001128175,0.0001896996,0.0001343597],"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.00004620317,0.00007348692,0.0002627108,0.00006630827,0.00001957188,0.00005652148,0.00001971585,0.9698915,0.001775414,0.004230663,0.0004831124,0.02307466],"study_design_scores_gemma":[0.000007341876,0.00003581878,0.00005809223,0.000003088989,0.000008217063,0.00001585671,0.00001014047,0.9972053,0.0006316213,0.001799737,0.0002214252,0.000003356061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0665561,0.0009868722,0.9277809,0.0002957828,0.00009855701,0.0001287563,0.00006233247,0.0002114209,0.003879252],"genre_scores_gemma":[0.8090471,0.0009110997,0.1868614,0.0001064137,0.0000785071,0.0001725297,0.0001096479,0.0001066654,0.002606658],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002415812,"threshold_uncertainty_score":0.008374572,"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","authors":[{"name":"Patrick Longa","is_ca":true},{"name":"Ali Miri","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005455209,0.000441574,0.0003965391,0.0007422662,0.0004328235,0.0007736621,0.0009175452,0.0003086698,0.002736304],"category_scores_gemma":[0.00159781,0.0002992986,0.0003913243,0.0007904152,0.0007512132,0.001807361,0.0009738309,0.0009170334,0.0009227449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003338824,"about_ca_system_score_gemma":0.000746663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003095082,"about_ca_topic_score_gemma":0.0005390325,"domain_scores_codex":[0.9994704,0.00006420677,0.00003712581,0.00006474034,0.0003025825,0.00006084229],"domain_scores_gemma":[0.9989939,0.0001656744,0.0001145007,0.0005095126,0.0001829091,0.00003352566],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004448717,0.0001921524,0.002213364,0.0002451961,0.00005570753,0.0004211227,0.000333739,0.03659771,0.186519,0.2353884,0.004281995,0.5333067],"study_design_scores_gemma":[0.0002834945,0.001360462,0.001656402,0.0001045084,0.0001293309,0.00177117,0.0001234851,0.4574528,0.3585407,0.1161295,0.06235344,0.0000947704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07674944,0.0003046785,0.9125775,0.0001544764,0.00007704587,0.00009933633,0.00003302893,0.0020183,0.007986135],"genre_scores_gemma":[0.4447327,0.0003418299,0.5498755,0.00006540302,0.00009458396,0.00009058056,0.0001113273,0.0001626194,0.004525512],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002736304,"threshold_uncertainty_score":0.009153843,"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","authors":[{"name":"Arash Hariri","is_ca":true},{"name":"Arash Reyhani-Masoleh","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002267083,0.0004858488,0.0002730047,0.0005206492,0.0003764206,0.0006515628,0.0003517946,0.0003506889,0.004322414],"category_scores_gemma":[0.0009801049,0.0001716254,0.0004180434,0.0005347662,0.0004974609,0.001348077,0.0004468978,0.0004456991,0.001229452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002837851,"about_ca_system_score_gemma":0.0004015622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002210226,"about_ca_topic_score_gemma":0.0006771546,"domain_scores_codex":[0.9998436,0.00002366033,0.00001394561,0.00003671272,0.00005414892,0.00002793711],"domain_scores_gemma":[0.9997303,0.00006755377,0.00006605626,0.00007275043,0.0000460016,0.00001731962],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006067932,0.0002057149,0.00254994,0.0004210912,0.00006688268,0.0006851602,0.0003578501,0.03076221,0.1471895,0.3043801,0.002409819,0.5103651],"study_design_scores_gemma":[0.0001887988,0.002157576,0.004292361,0.0001939809,0.0001566829,0.006439457,0.000386654,0.2399347,0.4169302,0.2378485,0.09132409,0.0001470055],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2902211,0.001516659,0.6609023,0.0003674858,0.0001586617,0.0001883928,0.0001113756,0.0007518203,0.045782],"genre_scores_gemma":[0.7361231,0.001263514,0.2437452,0.0001536546,0.0001203211,0.00009373853,0.0002378186,0.00007773703,0.01818494],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004322414,"threshold_uncertainty_score":0.01445991,"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","authors":[{"name":"Hao Zhang","is_ca":true},{"name":"Dongdong Chen","is_ca":false},{"name":"Seok‐Bum Ko","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003428161,0.0008410689,0.0007773097,0.001036528,0.0006551772,0.001153234,0.001838607,0.0005193828,0.004635712],"category_scores_gemma":[0.0009717937,0.0004236036,0.0005417577,0.0009243649,0.0003036981,0.002081818,0.0009874188,0.0006924658,0.001904417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005019782,"about_ca_system_score_gemma":0.0008038125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008179835,"about_ca_topic_score_gemma":0.00203368,"domain_scores_codex":[0.9993941,0.00005181707,0.00005129174,0.00009366866,0.0003372468,0.00007177182],"domain_scores_gemma":[0.9994869,0.00007566419,0.0000500576,0.0001040455,0.0002569323,0.00002643282],"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.001399663,0.0002120013,0.001549341,0.0007105466,0.0001833169,0.0008094903,0.0001953113,0.02148014,0.2174437,0.03381619,0.01282718,0.7093731],"study_design_scores_gemma":[0.0001912857,0.001282829,0.001275324,0.0001314172,0.000259393,0.002195031,0.00009941124,0.4990501,0.3971296,0.01197084,0.08624139,0.0001734596],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0872734,0.002379604,0.8897644,0.0003465154,0.0004789977,0.0001925907,0.0003200309,0.006042463,0.01320197],"genre_scores_gemma":[0.5018618,0.0005552689,0.4885871,0.0002647853,0.0001897634,0.0001663971,0.0006145546,0.0001242202,0.007636085],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004635712,"threshold_uncertainty_score":0.01550806,"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","authors":[{"name":"Shaoqiang Bi","is_ca":false},{"name":"Warren J. Gross","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001729671,0.0007491466,0.0008013407,0.001661258,0.0004366702,0.001520487,0.0009662718,0.0007699875,0.002322328],"category_scores_gemma":[0.005616289,0.0003472377,0.0006778082,0.002061132,0.001373258,0.002282914,0.0008360508,0.00115146,0.0009379748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007813546,"about_ca_system_score_gemma":0.000738808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005033299,"about_ca_topic_score_gemma":0.0004396409,"domain_scores_codex":[0.9983437,0.0003634951,0.0001757456,0.0002849114,0.0007579726,0.0000740598],"domain_scores_gemma":[0.9981839,0.000894386,0.0002116023,0.000287177,0.0003934299,0.00002957702],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003604712,0.0000325205,0.0006921354,0.0004956219,0.0000699328,0.0005402537,0.0002271775,0.04589698,0.02576135,0.4834809,0.003183606,0.4392589],"study_design_scores_gemma":[0.0001510323,0.0007685772,0.001342503,0.0002346963,0.0001353213,0.004275906,0.00009005184,0.4936421,0.09838284,0.2875708,0.1131883,0.0002178908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00843509,0.007282693,0.970426,0.0003067259,0.0003870927,0.00005993205,0.00004989154,0.0004485655,0.01260405],"genre_scores_gemma":[0.249767,0.008035736,0.7342513,0.0003262682,0.0007278493,0.0001252849,0.0001279659,0.0001478147,0.006490716],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002322328,"threshold_uncertainty_score":0.009147465,"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","authors":[{"name":"M.A. Hasan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002123885,0.001714691,0.0008260403,0.00340055,0.0008948044,0.002699553,0.001764853,0.001836364,0.002961084],"category_scores_gemma":[0.01038005,0.0005868893,0.001001464,0.001485485,0.003715545,0.004673486,0.002046277,0.002312852,0.0006965306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009421513,"about_ca_system_score_gemma":0.001002408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001369089,"about_ca_topic_score_gemma":0.0001849034,"domain_scores_codex":[0.9959149,0.001078836,0.0002907957,0.0004536912,0.002020626,0.0002411936],"domain_scores_gemma":[0.9932708,0.003478581,0.001044355,0.001429153,0.000666175,0.0001109736],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004052054,0.0002217761,0.00108414,0.0006634556,0.000171217,0.0003697878,0.0003281168,0.1066036,0.02277677,0.6028388,0.002133877,0.2624032],"study_design_scores_gemma":[0.0001498835,0.0005772892,0.0007653114,0.0002956066,0.0001520372,0.001691133,0.0001550514,0.4966477,0.04958121,0.4311788,0.01866615,0.0001398593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01937513,0.003005296,0.9637799,0.0009383984,0.0002180216,0.0002160701,0.00002474615,0.0004394328,0.01200304],"genre_scores_gemma":[0.6577705,0.005635173,0.3278779,0.0005700734,0.001007892,0.0004877254,0.00008478365,0.0001374907,0.006428414],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00340055,"threshold_uncertainty_score":0,"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","authors":[{"name":"Jun Feng","is_ca":false},{"name":"Laurence T. Yang","is_ca":true},{"name":"Bocheng Ren","is_ca":false},{"name":"Deqing Zou","is_ca":false},{"name":"Mianxiong Dong","is_ca":false},{"name":"Shunli Zhang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002869278,0.00101527,0.001015874,0.0004005267,0.0006562552,0.00117767,0.001707364,0.001378383,0.001564958],"category_scores_gemma":[0.008696499,0.0004303417,0.0008995231,0.0007494501,0.001512336,0.00357917,0.002198085,0.002307521,0.000460326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001729606,"about_ca_system_score_gemma":0.001851271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003633738,"about_ca_topic_score_gemma":0.003685825,"domain_scores_codex":[0.9975119,0.0007534035,0.0001773472,0.000544298,0.0007514933,0.0002616185],"domain_scores_gemma":[0.9968091,0.001231943,0.0003902121,0.0008581483,0.0005895045,0.0001210998],"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.000448216,0.0001001518,0.002048949,0.0001373248,0.00009576072,0.0003402024,0.0001986325,0.7423438,0.0112125,0.1091761,0.00385532,0.130043],"study_design_scores_gemma":[0.000005745316,0.00002967389,0.00006957082,0.000003936451,0.000006938546,0.00003781926,0.0000060619,0.9849037,0.001826762,0.01272169,0.0003804008,0.000007704039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01974966,0.0002351011,0.9775179,0.0004162332,0.00005560546,0.00003259485,0.0001163225,0.0004760968,0.001400512],"genre_scores_gemma":[0.8751972,0.0004429311,0.1181392,0.0003776651,0.00008782681,0.0001097524,0.0003374538,0.00009874379,0.005209147],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003633738,"threshold_uncertainty_score":0.01517439,"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","authors":[{"name":"Alan Messer","is_ca":false},{"name":"Philippe Bernadat","is_ca":false},{"name":"Guangrui Fu","is_ca":false},{"name":"D. Chen","is_ca":false},{"name":"Ž. Dimitrijević","is_ca":false},{"name":"David Lie","is_ca":true},{"name":"Durga Devi Mannaru","is_ca":false},{"name":"A. Riska","is_ca":false},{"name":"Dejan Milojičić","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001113159,0.0004059616,0.0005245671,0.001490093,0.0006124052,0.000863178,0.0007689488,0.0005046014,0.002031941],"category_scores_gemma":[0.02113089,0.0003316537,0.0003913665,0.001882457,0.0008926428,0.001035928,0.00112394,0.0006675721,0.0003244881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006887302,"about_ca_system_score_gemma":0.0005510408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002563667,"about_ca_topic_score_gemma":0.001750314,"domain_scores_codex":[0.9970977,0.0004077007,0.0002384538,0.0004931429,0.001422477,0.0003405127],"domain_scores_gemma":[0.9786636,0.008328371,0.004460709,0.005261695,0.002840924,0.0004447549],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.004636239,0.0003798731,0.2448981,0.001797433,0.0004826273,0.003818104,0.004194141,0.2359433,0.2531622,0.00717795,0.003781848,0.2397283],"study_design_scores_gemma":[0.0001226933,0.004678606,0.3123189,0.0001837462,0.0004495624,0.005794036,0.003866826,0.3075236,0.3354112,0.01463362,0.01478971,0.0002274275],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.992188,0.0004079234,0.005444719,0.00007104207,0.00002960399,0.00004064311,0.000109053,0.0005145275,0.001194611],"genre_scores_gemma":[0.9960604,0.0001757519,0.002905102,0.00003198011,0.000007408599,0.00001593661,0.0001635566,0.0000792721,0.0005605636],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002563667,"threshold_uncertainty_score":0.006797552,"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","authors":[{"name":"Jigang Wu","is_ca":false},{"name":"Thambipillai Srikanthan","is_ca":false},{"name":"Guang Chen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001097966,0.001169974,0.001108753,0.001404729,0.0009863761,0.002036083,0.001552293,0.001666942,0.006168612],"category_scores_gemma":[0.003900023,0.0009835637,0.00119031,0.002005807,0.001231599,0.002526495,0.001891395,0.001546422,0.001508806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0014209,"about_ca_system_score_gemma":0.001555741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004253997,"about_ca_topic_score_gemma":0.005866031,"domain_scores_codex":[0.9989439,0.0003521749,0.00006256119,0.000216606,0.0003223965,0.0001025166],"domain_scores_gemma":[0.998698,0.0008612726,0.0001073867,0.000162024,0.0001367375,0.00003446349],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001115617,0.00008947396,0.0009250854,0.0004222466,0.00005884321,0.00009064536,0.0002110086,0.6487283,0.004081752,0.08825774,0.00652174,0.2505016],"study_design_scores_gemma":[0.00004128035,0.0000429459,0.0002691407,0.00004174007,0.00001879396,0.0001167044,0.00005241478,0.934523,0.001198231,0.05668029,0.006995653,0.00001978988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006842067,0.0008802983,0.9842233,0.0003877624,0.00005288998,0.00007560939,0.00008535061,0.000417357,0.007035492],"genre_scores_gemma":[0.1103548,0.001302453,0.8827479,0.0002549652,0.00008812101,0.0003371401,0.0004823465,0.0002655245,0.004166652],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006168612,"threshold_uncertainty_score":0.02063602,"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","authors":[{"name":"Arash Ardakani","is_ca":true},{"name":"Carlo Condo","is_ca":false},{"name":"Warren J. Gross","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001818072,0.0005660194,0.000252513,0.000355068,0.0002456857,0.0004540209,0.00102293,0.0003208613,0.005884644],"category_scores_gemma":[0.0005035091,0.0001890891,0.0002560943,0.0003625156,0.0001969828,0.0007602202,0.0005280036,0.0006854031,0.001225003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005431905,"about_ca_system_score_gemma":0.0009544916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002285309,"about_ca_topic_score_gemma":0.004961085,"domain_scores_codex":[0.9998493,0.0000111859,0.000008805056,0.00002376923,0.00006738138,0.00003954018],"domain_scores_gemma":[0.9998391,0.00003434548,0.0000182063,0.00002706792,0.00006276507,0.00001844541],"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.00133667,0.0004077838,0.004737131,0.0006575713,0.00016659,0.0007463218,0.0001682887,0.1628744,0.1834105,0.0505789,0.07037918,0.5245367],"study_design_scores_gemma":[0.0000784678,0.0002731145,0.0009306666,0.00003868755,0.00004801785,0.0002470132,0.00003060242,0.8870023,0.07238813,0.006957862,0.03197329,0.00003188698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1853805,0.002233456,0.7683994,0.0008050255,0.0005951985,0.0001700395,0.0007288228,0.01172457,0.029963],"genre_scores_gemma":[0.7679323,0.0007283912,0.2082647,0.000474379,0.00007205948,0.0001495158,0.001299194,0.0002760832,0.02080346],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005884644,"threshold_uncertainty_score":0.0196861,"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","authors":[{"name":"Hao Zhang","is_ca":true},{"name":"Dongdong Chen","is_ca":false},{"name":"Seok‐Bum Ko","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006635711,0.001314767,0.0006790535,0.001378965,0.0007811505,0.001353899,0.00295911,0.000694119,0.01010667],"category_scores_gemma":[0.002159658,0.0005077791,0.0005002946,0.001179582,0.0005012574,0.002507249,0.001221508,0.001287824,0.002615752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009733676,"about_ca_system_score_gemma":0.001528963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003082427,"about_ca_topic_score_gemma":0.005545321,"domain_scores_codex":[0.9992029,0.00007259219,0.00009337,0.0001732134,0.0003591126,0.00009877387],"domain_scores_gemma":[0.9991645,0.0001358984,0.00008442856,0.0001767955,0.0003899174,0.00004841001],"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.001166476,0.0001750265,0.001738099,0.0006287102,0.0001668972,0.0004738838,0.0002214686,0.02600223,0.09192011,0.03033528,0.02075784,0.8264139],"study_design_scores_gemma":[0.0001912763,0.0009008697,0.001289677,0.0001722626,0.0002395057,0.001023847,0.00008421862,0.658649,0.2418276,0.01197,0.08350144,0.000150273],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02279138,0.001693279,0.957388,0.0003103605,0.0005273453,0.0002490908,0.0003415542,0.008555706,0.008143212],"genre_scores_gemma":[0.3884953,0.001007031,0.5929577,0.0006098801,0.0002948088,0.0004564414,0.0009963888,0.0003556597,0.01482676],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01010667,"threshold_uncertainty_score":0.0338102,"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","authors":[{"name":"Reza Azarderakhsh","is_ca":true},{"name":"Arash Reyhani-Masoleh","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002105748,0.0003007654,0.0002474767,0.0004503744,0.0002689166,0.0005742854,0.0006208183,0.0002701323,0.002712564],"category_scores_gemma":[0.0004529436,0.000142835,0.0002298823,0.0005276888,0.0002433386,0.0008145533,0.0003693908,0.0003933719,0.0008760889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004204868,"about_ca_system_score_gemma":0.0004232544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003483239,"about_ca_topic_score_gemma":0.0007944139,"domain_scores_codex":[0.9998301,0.00002789661,0.00001373703,0.00003083841,0.00007177062,0.00002562008],"domain_scores_gemma":[0.9997804,0.00004435516,0.00002968457,0.00005047815,0.00007761046,0.00001759856],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001188372,0.0002318874,0.001985061,0.0003951352,0.00007751647,0.0004797014,0.0002489765,0.03475417,0.4675456,0.107067,0.00337608,0.3826505],"study_design_scores_gemma":[0.0002674512,0.002185407,0.003315414,0.00008734643,0.0001063948,0.001881909,0.0001322205,0.4333954,0.4809865,0.03718032,0.04034709,0.0001144822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4094509,0.001091616,0.5733317,0.0002087769,0.0001720964,0.000138977,0.0001441042,0.001433078,0.01402879],"genre_scores_gemma":[0.7775819,0.0003301883,0.2147249,0.00006325531,0.00004123964,0.00006912962,0.0001750272,0.00003563147,0.006978739],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002712564,"threshold_uncertainty_score":0.00907445,"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","authors":[{"name":"Dongxiao Liu","is_ca":true},{"name":"Cheng Huang","is_ca":true},{"name":"Jianbing Ni","is_ca":true},{"name":"Xiaodong Lin","is_ca":true},{"name":"Xuemin Shen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004457979,0.0003763385,0.000673556,0.0005437282,0.002001875,0.002424608,0.001350005,0.001387562,0.003042525],"category_scores_gemma":[0.006958202,0.0002501023,0.0005057399,0.001026961,0.002218646,0.004780192,0.003399648,0.001360952,0.0005378341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002004586,"about_ca_system_score_gemma":0.005074711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003818988,"about_ca_topic_score_gemma":0.003200505,"domain_scores_codex":[0.9960003,0.001380743,0.0002024342,0.0006614464,0.001102005,0.0006530879],"domain_scores_gemma":[0.9943645,0.001519731,0.0006969818,0.001874796,0.001000205,0.0005437602],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001031272,0.0004515243,0.00489536,0.0001785073,0.00007383881,0.0006182896,0.000842288,0.1951553,0.02063555,0.6462455,0.004990934,0.1248816],"study_design_scores_gemma":[0.0002064089,0.0002034615,0.0005986582,0.00003051385,0.00002565054,0.0002657133,0.0001418772,0.8169835,0.0135696,0.1579585,0.009957428,0.00005857188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1318151,0.0002934988,0.8520355,0.001176679,0.00009981728,0.0005534471,0.0001579566,0.0005592179,0.01330881],"genre_scores_gemma":[0.9361717,0.0001361363,0.05847771,0.0001402587,0.0000381096,0.0001830289,0.00009358733,0.00004344278,0.004715967],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004457979,"threshold_uncertainty_score":0.02357632,"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","authors":[{"name":"Liang Xue","is_ca":true},{"name":"Jianbing Ni","is_ca":true},{"name":"Dongxiao Liu","is_ca":true},{"name":"Xiaodong Lin","is_ca":true},{"name":"Xuemin Shen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003952083,0.0006174604,0.001479123,0.0009214692,0.002178285,0.002342886,0.002839215,0.001750462,0.004601886],"category_scores_gemma":[0.007670424,0.0004746068,0.0007935794,0.001987228,0.002305644,0.006345159,0.004117697,0.001695341,0.001189207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001727377,"about_ca_system_score_gemma":0.004333804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003156062,"about_ca_topic_score_gemma":0.002804335,"domain_scores_codex":[0.9947685,0.001223654,0.000353221,0.0009626773,0.001945641,0.0007462694],"domain_scores_gemma":[0.9936616,0.001959511,0.0006797143,0.002085557,0.001019074,0.0005944958],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001348442,0.0003856352,0.0030428,0.000390079,0.0001560507,0.001107499,0.001237522,0.3604589,0.02289767,0.4495929,0.005788221,0.1535943],"study_design_scores_gemma":[0.0002458691,0.0001877676,0.0003222135,0.00003699024,0.00004714666,0.0004285666,0.00009926025,0.7356025,0.009037456,0.2427496,0.01116502,0.00007760031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03803951,0.0003047106,0.955328,0.0005201857,0.0001041059,0.0003295586,0.0002400617,0.0005856849,0.00454817],"genre_scores_gemma":[0.8629111,0.0003242711,0.1285392,0.000182163,0.00007888329,0.0002817303,0.000282579,0.00007357045,0.007326461],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004601886,"threshold_uncertainty_score":0.02090091,"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","authors":[{"name":"Radu Mureşan","is_ca":true},{"name":"Stefano Gregori","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002401151,0.0004740287,0.0003871303,0.0005202425,0.0003511752,0.0005295171,0.0008004549,0.000587211,0.003378237],"category_scores_gemma":[0.001198401,0.0001898712,0.0002682139,0.0003127774,0.0004246619,0.001139368,0.0004218591,0.0004448523,0.0007585446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004722979,"about_ca_system_score_gemma":0.0002587701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000225697,"about_ca_topic_score_gemma":0.0002141408,"domain_scores_codex":[0.999579,0.00006218334,0.00003421638,0.00009317624,0.000153387,0.00007808342],"domain_scores_gemma":[0.998845,0.0003345243,0.0001900387,0.0004220324,0.000175238,0.00003308117],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001282342,0.0001614426,0.003215888,0.0004973571,0.0001159565,0.0007239482,0.0003033827,0.0134669,0.6883499,0.01210063,0.002618075,0.2771642],"study_design_scores_gemma":[0.0001063535,0.001726999,0.002922615,0.0000727521,0.0001855895,0.002009968,0.00006380509,0.09229115,0.8813927,0.004109077,0.0150632,0.0000559602],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5221838,0.001754586,0.4619237,0.0003679339,0.0001997866,0.0002245177,0.0001753654,0.004572967,0.008597257],"genre_scores_gemma":[0.9753227,0.0001608249,0.02239573,0.0001551077,0.00002520161,0.00002697829,0.00006185813,0.00004742023,0.001804219],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003378237,"threshold_uncertainty_score":0.01130134,"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","authors":[{"name":"Siavash Bayat-Sarmadi","is_ca":true},{"name":"M.A. Hasan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006537857,0.000413403,0.0003238447,0.0005334706,0.0003077401,0.0005128642,0.0006248698,0.0002642575,0.0008448705],"category_scores_gemma":[0.002347595,0.0002080328,0.0002550329,0.0004617165,0.0005119808,0.001445823,0.0004697519,0.0002828672,0.0001201867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004055458,"about_ca_system_score_gemma":0.0006969008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007614825,"about_ca_topic_score_gemma":0.001493691,"domain_scores_codex":[0.9994368,0.00009987525,0.00004186409,0.00007983141,0.0002723449,0.00006933393],"domain_scores_gemma":[0.9986703,0.000519799,0.0002768238,0.0002352734,0.0002612478,0.00003663714],"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.001890936,0.0002889996,0.01007511,0.0003056359,0.00009040943,0.00108676,0.000476809,0.2568471,0.2841811,0.04667143,0.0008789955,0.3972066],"study_design_scores_gemma":[0.0000600998,0.000649013,0.001315147,0.00002281579,0.00004636669,0.0004268849,0.00009334984,0.8110377,0.1756129,0.008925482,0.001775293,0.00003488785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.642643,0.0003499489,0.3539119,0.0001155883,0.00005495317,0.00004944815,0.0000270844,0.0007562502,0.002091881],"genre_scores_gemma":[0.9327222,0.00009919026,0.0660383,0.00001855096,0.00001701298,0.00001528265,0.00002268145,0.00002351203,0.00104319],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0008448705,"threshold_uncertainty_score":0.003457606,"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","authors":[{"name":"Bang Wang","is_ca":false},{"name":"Jiaoyan Chen","is_ca":false},{"name":"Wenyu Liu","is_ca":false},{"name":"Laurence T. Yang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003376681,0.0007777046,0.0006573444,0.0006033847,0.0003531877,0.0004590639,0.000769252,0.0006698183,0.001911633],"category_scores_gemma":[0.002045668,0.0003352539,0.000384953,0.0006532718,0.0003663017,0.001081872,0.000829422,0.0005256695,0.0004713909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003640141,"about_ca_system_score_gemma":0.0004148354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006276338,"about_ca_topic_score_gemma":0.0007027099,"domain_scores_codex":[0.9996288,0.0001179624,0.00002109185,0.0000698607,0.0001160452,0.00004619444],"domain_scores_gemma":[0.9992804,0.0002970184,0.0001658587,0.00008896584,0.00009849434,0.00006934841],"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.0005987408,0.0001831994,0.002429249,0.0004108094,0.00005078543,0.0007875202,0.0002708763,0.7445822,0.08857545,0.02320099,0.003730817,0.1351795],"study_design_scores_gemma":[0.00003911337,0.0002625288,0.0006746532,0.00001628068,0.00001271093,0.0002530206,0.00008051823,0.9798728,0.01129112,0.005565751,0.001916763,0.00001482809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06831937,0.0002778571,0.9285824,0.00018153,0.00002886881,0.00007620323,0.00008143446,0.0004011699,0.002051153],"genre_scores_gemma":[0.6313036,0.0003279968,0.3662704,0.00007112708,0.00002292563,0.0001703091,0.0002292409,0.00008401591,0.001520455],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001911633,"threshold_uncertainty_score":0.006395102,"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","authors":[{"name":"Seok‐Bum Ko","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001787711,0.0003908311,0.0002566553,0.0004684062,0.0002320976,0.0004425423,0.0004777309,0.0001715055,0.002318721],"category_scores_gemma":[0.00051773,0.0001847802,0.0002284823,0.0005403591,0.0001732908,0.0005780639,0.0002594923,0.0002210884,0.0006532307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002466756,"about_ca_system_score_gemma":0.0003849642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004287184,"about_ca_topic_score_gemma":0.0009048812,"domain_scores_codex":[0.9998568,0.00002344931,0.00001214438,0.00002926167,0.00005990081,0.00001835407],"domain_scores_gemma":[0.9997727,0.00006178694,0.00003337917,0.00006421725,0.00006120236,0.000006618502],"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.0007033073,0.0001623505,0.001922611,0.0004230005,0.00008479104,0.0007430704,0.0002272862,0.08093324,0.3668958,0.0417396,0.004624607,0.5015404],"study_design_scores_gemma":[0.0001311294,0.0006280869,0.001377943,0.00005099018,0.0001144656,0.001428983,0.00006492763,0.5444551,0.4140514,0.01179617,0.0258533,0.00004746956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3221468,0.0008357544,0.652557,0.0001942466,0.0001602691,0.00008974077,0.0002581971,0.00400514,0.01975293],"genre_scores_gemma":[0.6914211,0.0003441673,0.2994781,0.00006598277,0.00004177526,0.00006082474,0.000410727,0.00009777118,0.008079715],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002318721,"threshold_uncertainty_score":0.007756829,"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","authors":[{"name":"Arash Reyhani-Masoleh","is_ca":true},{"name":"M.A. Hasan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005722468,0.0004789899,0.0005687141,0.0005666215,0.0004824497,0.001274612,0.0005504481,0.0003900204,0.00354999],"category_scores_gemma":[0.001885098,0.0002143032,0.0002834866,0.0008218329,0.0006865587,0.002644187,0.001207961,0.0007627332,0.001541293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003754717,"about_ca_system_score_gemma":0.0006958628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002187268,"about_ca_topic_score_gemma":0.00040952,"domain_scores_codex":[0.9993918,0.0001302649,0.00004923155,0.0001000572,0.0002346944,0.00009393466],"domain_scores_gemma":[0.9992961,0.0002397161,0.00006385918,0.0002029284,0.0001637583,0.00003365871],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007373163,0.0001332612,0.0007688447,0.0002381218,0.00002564671,0.0002122903,0.0002308775,0.03050747,0.06344748,0.4458403,0.007501408,0.450357],"study_design_scores_gemma":[0.0001194576,0.0006107677,0.0003692328,0.00007798822,0.00002487014,0.000846603,0.000129502,0.3506756,0.08540086,0.5144703,0.04722327,0.00005151704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1019728,0.001164282,0.8708408,0.0003682517,0.0002487743,0.00009888859,0.0001048038,0.001315845,0.02388548],"genre_scores_gemma":[0.5635933,0.0007711024,0.4250753,0.0001266367,0.0001548735,0.00007918386,0.0002791845,0.0001095595,0.009810916],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00354999,"threshold_uncertainty_score":0.01187593,"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","authors":[{"name":"Jean‐Pierre David","is_ca":true},{"name":"Kassem Kalach","is_ca":false},{"name":"Nicolas Tittley","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00106869,0.0006476278,0.0006050466,0.0009190737,0.0005959251,0.002373146,0.001200009,0.0006243754,0.006860954],"category_scores_gemma":[0.007964941,0.0004279207,0.0006116186,0.00117871,0.0007229831,0.004157229,0.001056867,0.0008536942,0.001927568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001200467,"about_ca_system_score_gemma":0.001974375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009629647,"about_ca_topic_score_gemma":0.00123933,"domain_scores_codex":[0.9969187,0.0005222443,0.0002597124,0.0003298205,0.001644179,0.0003253729],"domain_scores_gemma":[0.9955757,0.002754296,0.000323557,0.0006699055,0.0006080659,0.00006861951],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001521689,0.000164806,0.004190105,0.001303207,0.0001406168,0.0007985555,0.0003912555,0.1461462,0.04964951,0.1945129,0.0116084,0.5895729],"study_design_scores_gemma":[0.0003543644,0.000646144,0.003294537,0.000222048,0.0001775212,0.002227042,0.0002662656,0.6978216,0.06942012,0.183944,0.04149171,0.0001346685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2406887,0.008641018,0.6922384,0.00236862,0.0004662141,0.0002572127,0.000625157,0.002585767,0.05212901],"genre_scores_gemma":[0.7700889,0.003055141,0.213248,0.0002566142,0.000328671,0.0002298832,0.0007262701,0.0002406999,0.01182583],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006860954,"threshold_uncertainty_score":0.02295214,"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","authors":[{"name":"Hannes Frey","is_ca":false},{"name":"Ivan Stojmenović","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0111974,0.003798349,0.002213433,0.003410679,0.002188886,0.005577129,0.00485313,0.0022946,0.004846539],"category_scores_gemma":[0.06626832,0.001247803,0.001496025,0.003463412,0.003722966,0.0138858,0.004307931,0.004339497,0.001311377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004897568,"about_ca_system_score_gemma":0.002276671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002318951,"about_ca_topic_score_gemma":0.001390759,"domain_scores_codex":[0.990696,0.002289064,0.0004771444,0.001528218,0.003321182,0.001688473],"domain_scores_gemma":[0.9243001,0.06159274,0.003509581,0.005590171,0.003881724,0.001125643],"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.001242645,0.0002975521,0.002624325,0.000973725,0.0002362464,0.000332842,0.0005946449,0.6659629,0.01230539,0.1995341,0.006622047,0.1092736],"study_design_scores_gemma":[0.00003750856,0.0004082214,0.0007400927,0.0001640281,0.0001678148,0.000427776,0.0001873819,0.8514506,0.008041208,0.1343582,0.003952442,0.00006462463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04876773,0.007993815,0.9243033,0.001531396,0.0002174721,0.0001796361,0.0004336004,0.001064979,0.015508],"genre_scores_gemma":[0.7812403,0.01013493,0.1997768,0.0009790825,0.0008638305,0.0007459012,0.0009929059,0.0009014725,0.004364763],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0111974,"threshold_uncertainty_score":0.05921823,"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","authors":[{"name":"Jinwen Liang","is_ca":true},{"name":"Zheng Qin","is_ca":false},{"name":"Jianbing Ni","is_ca":true},{"name":"Xiaodong Lin","is_ca":true},{"name":"Xuemin Shen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001639993,0.0005875399,0.0008022434,0.0004030533,0.0008680124,0.001914083,0.001052625,0.0009615614,0.004136804],"category_scores_gemma":[0.006851668,0.0002464781,0.0006151393,0.0006432992,0.0006979802,0.002541041,0.002273144,0.001738288,0.001560391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001382675,"about_ca_system_score_gemma":0.002355862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001540582,"about_ca_topic_score_gemma":0.001161859,"domain_scores_codex":[0.997068,0.0007136961,0.0003215703,0.0004285261,0.001003304,0.0004649881],"domain_scores_gemma":[0.9970782,0.0009152534,0.0003818729,0.0009846571,0.0004878317,0.0001522093],"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.00275209,0.0006188615,0.01255244,0.0005930586,0.0002057521,0.001584952,0.000563418,0.2593829,0.03945487,0.1488858,0.03117068,0.5022352],"study_design_scores_gemma":[0.00006461638,0.00009543118,0.0007662661,0.00003278452,0.00002195015,0.0003944528,0.0000672574,0.9557847,0.01216964,0.02546065,0.005120205,0.00002199565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06163758,0.0008294686,0.9267633,0.002214301,0.0002306365,0.0002941096,0.0004792517,0.001971492,0.0055799],"genre_scores_gemma":[0.8928571,0.0004438974,0.1031029,0.0003863931,0.0001203115,0.0001908054,0.0005397933,0.0001023491,0.00225645],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004136804,"threshold_uncertainty_score":0.01383901,"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","authors":[{"name":"Arash Reyhani-Masoleh","is_ca":true},{"name":"M.A. Hasan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004275031,0.0006004388,0.0004612318,0.0005446505,0.000379706,0.000841622,0.0007720539,0.0004157182,0.003309389],"category_scores_gemma":[0.00151165,0.0001932819,0.0003158079,0.0008104182,0.0004405741,0.001538357,0.0007218132,0.0007308933,0.00141292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003955141,"about_ca_system_score_gemma":0.0007306716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004370585,"about_ca_topic_score_gemma":0.0007189487,"domain_scores_codex":[0.9996179,0.00009317177,0.00002229196,0.0000554276,0.0001686275,0.00004256048],"domain_scores_gemma":[0.9994344,0.0001689558,0.00004256488,0.0001292245,0.000198564,0.00002622271],"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.0008670391,0.0001608058,0.001310891,0.0002805201,0.00004750029,0.0002945891,0.0002182385,0.03830644,0.09581166,0.13835,0.008262698,0.7160897],"study_design_scores_gemma":[0.0002033173,0.0009991758,0.0009233801,0.00008033011,0.00006159135,0.0009804922,0.0001093892,0.6637055,0.1771033,0.1013615,0.05440027,0.0000716649],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06111009,0.0005392669,0.9223202,0.0001532137,0.0001438764,0.0000969763,0.00004068157,0.00324259,0.01235309],"genre_scores_gemma":[0.3217932,0.0005172465,0.6690454,0.00007831948,0.00006615358,0.0001021041,0.0001931414,0.0001423166,0.008062047],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003309389,"threshold_uncertainty_score":0.01107103,"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","authors":[{"name":"Mehran Mozaffari Kermani","is_ca":true},{"name":"Arash Reyhani-Masoleh","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003839925,0.0002958028,0.0003174298,0.0004857639,0.0003753538,0.0004608051,0.0008296098,0.0003877666,0.002046949],"category_scores_gemma":[0.0007775753,0.0001509976,0.0003051638,0.000270708,0.0004754775,0.0009407001,0.0004053652,0.0005922396,0.0003148177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003992207,"about_ca_system_score_gemma":0.0005669862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004235996,"about_ca_topic_score_gemma":0.0006555411,"domain_scores_codex":[0.9997312,0.00004935924,0.00001630624,0.0000483124,0.000125631,0.00002911787],"domain_scores_gemma":[0.9993845,0.000172985,0.0001097713,0.0001600022,0.0001413041,0.00003141219],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.002288971,0.000420468,0.003992545,0.0005209154,0.0001116326,0.000605835,0.0003662358,0.06274293,0.5107331,0.08635214,0.003188879,0.3286762],"study_design_scores_gemma":[0.0002314835,0.001965917,0.001495994,0.00004411114,0.0001002927,0.001152244,0.00005886044,0.6232533,0.3506409,0.009546958,0.01143359,0.00007621416],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2396645,0.000340607,0.7535105,0.0002573627,0.0000955516,0.0001779825,0.00004820213,0.001413632,0.004491727],"genre_scores_gemma":[0.8017876,0.00008877433,0.1956102,0.00006872639,0.00002604595,0.00005050795,0.00003261094,0.00001844387,0.002317062],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002046949,"threshold_uncertainty_score":0.00684768,"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","authors":[{"name":"Jithra Adikari","is_ca":true},{"name":"Vassil S. Dimitrov","is_ca":true},{"name":"Laurent Imbert","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004331864,0.0003843914,0.0004650629,0.000801333,0.000735062,0.001244154,0.0005818073,0.0003970138,0.004683543],"category_scores_gemma":[0.001234894,0.0001435739,0.0002214352,0.001119791,0.000489876,0.001695216,0.001037256,0.0004374094,0.001629404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006514936,"about_ca_system_score_gemma":0.0006418857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002956131,"about_ca_topic_score_gemma":0.0004607471,"domain_scores_codex":[0.9995358,0.0000918924,0.00006087901,0.0000757,0.0001918031,0.00004395384],"domain_scores_gemma":[0.9995516,0.0001059458,0.00006114542,0.0001593637,0.00008829932,0.00003364594],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0014632,0.0001306551,0.001688044,0.0004988516,0.00005708555,0.0003601912,0.0003412154,0.03826461,0.09647854,0.3394685,0.008875258,0.5123739],"study_design_scores_gemma":[0.000378169,0.0008067409,0.001452764,0.0001338609,0.00009310066,0.002366856,0.0002110486,0.5317115,0.1903053,0.1946515,0.07773189,0.0001572512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1314026,0.001520818,0.8523473,0.0002883646,0.0002298091,0.0002388828,0.0002578273,0.003014526,0.01069996],"genre_scores_gemma":[0.5239708,0.0004882558,0.4694645,0.00007005928,0.00007481935,0.0001456384,0.0003520134,0.0001169493,0.005317016],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004683543,"threshold_uncertainty_score":0.01566803,"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","authors":[{"name":"Haining Fan","is_ca":false},{"name":"M. Anwar Hasan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005022822,0.001253286,0.0007298124,0.001109611,0.00400885,0.002120034,0.00393934,0.007738558,0.03508864],"category_scores_gemma":[0.02275746,0.0006375588,0.001397877,0.001174881,0.004457133,0.006463805,0.002409219,0.01242519,0.01375067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003998666,"about_ca_system_score_gemma":0.002009348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008650783,"about_ca_topic_score_gemma":0.005660786,"domain_scores_codex":[0.9949651,0.001163357,0.0005179427,0.0006388996,0.002213835,0.0005007368],"domain_scores_gemma":[0.9853881,0.007089582,0.0008647725,0.0009795381,0.005255187,0.0004228426],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001119589,0.00001642507,0.0001647552,0.0002183805,0.00001191999,0.0004829451,0.0005039204,0.000267052,0.0006942938,0.06512462,0.9236212,0.008782513],"study_design_scores_gemma":[0.00001922538,0.00003668282,0.0003995253,0.0001854624,0.00001246101,0.0003208928,0.0002554531,0.0004180125,0.001382437,0.02608347,0.9708351,0.00005119723],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"commentary","genre_gemma":"commentary","genre_scores_codex":[0.00337143,0.004662329,0.01281207,0.757304,0.1587971,0.000117683,0.0008653447,0.001193763,0.06087627],"genre_scores_gemma":[0.06917281,0.00782351,0.01145913,0.652553,0.1039842,0.0003403024,0.0006316504,0.00101926,0.1530161],"genre_candidate":"commentary","genre_consensus":"commentary","teacher_disagreement_score":0.03508864,"threshold_uncertainty_score":0.1173832,"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","authors":[{"name":"Ziying Ni","is_ca":false},{"name":"Ayesha Khalid","is_ca":false},{"name":"Dur‐e‐Shahwar Kundi","is_ca":false},{"name":"Máire O׳Neill","is_ca":false},{"name":"Weiqiang Liu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002166029,0.0003406883,0.0002453084,0.0002632082,0.0002811915,0.0005859187,0.0008995326,0.0003552433,0.007444134],"category_scores_gemma":[0.0003522477,0.0001897818,0.0001782252,0.0003251707,0.0002197331,0.0008429976,0.0005121173,0.0006573958,0.001668482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004555349,"about_ca_system_score_gemma":0.000896159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006163116,"about_ca_topic_score_gemma":0.001307356,"domain_scores_codex":[0.9998552,0.0000203856,0.000006590181,0.00002367925,0.00006229633,0.00003181758],"domain_scores_gemma":[0.9998413,0.0000319229,0.00003118802,0.00002679696,0.00003971241,0.00002896718],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.003528389,0.0006364319,0.00678757,0.001018662,0.0002210833,0.001027461,0.0004446106,0.05486076,0.4552514,0.0785374,0.05644385,0.3412424],"study_design_scores_gemma":[0.0006751579,0.003233321,0.003877471,0.0001126507,0.0001370771,0.001531897,0.0001375838,0.4632043,0.3419517,0.01231512,0.1726818,0.0001418702],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3266075,0.002906953,0.5965335,0.001006996,0.0005240833,0.0003523382,0.0008078131,0.01513994,0.05612075],"genre_scores_gemma":[0.7803014,0.0004463626,0.1924627,0.0003490064,0.00006903052,0.0001607212,0.0008368249,0.0002360669,0.02513789],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007444134,"threshold_uncertainty_score":0.02490312,"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","authors":[{"name":"Osman Hasan","is_ca":true},{"name":"Sofiène Tahar","is_ca":true},{"name":"Naeem Abbasi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009812902,0.001481841,0.000923123,0.002440994,0.0009599308,0.003044241,0.002721859,0.001074855,0.005016435],"category_scores_gemma":[0.0184385,0.0006793467,0.002900562,0.001569178,0.004491819,0.003457438,0.002605685,0.003426216,0.001384462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00175068,"about_ca_system_score_gemma":0.002558835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001533377,"about_ca_topic_score_gemma":0.0007592884,"domain_scores_codex":[0.9929957,0.002665469,0.0006137066,0.00073563,0.002474614,0.0005149808],"domain_scores_gemma":[0.9846859,0.01171131,0.000761256,0.001564362,0.001162513,0.0001146212],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003515345,0.0000839167,0.0003674974,0.0006023109,0.00007437225,0.000377344,0.0003692447,0.0598423,0.003291639,0.879589,0.002635126,0.05273214],"study_design_scores_gemma":[0.00005577727,0.0000506068,0.000136826,0.0001533687,0.00005025767,0.0002095612,0.00004990457,0.117942,0.004772114,0.8600991,0.01644456,0.00003591271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001211138,0.0003205615,0.9952188,0.0002077323,0.00004217108,0.00005447189,0.00006646146,0.0003643693,0.002514323],"genre_scores_gemma":[0.1483316,0.002715855,0.8440773,0.0004484825,0.0004538937,0.0007219534,0.0005029975,0.0002721943,0.002475655],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009812902,"threshold_uncertainty_score":0.05189621,"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","authors":[{"name":"Abdallah Jarray","is_ca":true},{"name":"Ahmed Karmouch","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000511916,0.0007509348,0.0006969131,0.0006978738,0.0005769119,0.001037453,0.001386895,0.0005395678,0.004972146],"category_scores_gemma":[0.002506201,0.0003099517,0.0003485346,0.0007254011,0.0004569177,0.001585733,0.001156215,0.0005769622,0.0004637765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001212834,"about_ca_system_score_gemma":0.0008924064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002375902,"about_ca_topic_score_gemma":0.002235653,"domain_scores_codex":[0.9995195,0.0001570867,0.00002001679,0.00007075463,0.0001237017,0.0001089508],"domain_scores_gemma":[0.9992669,0.0003313009,0.00007937621,0.0001555846,0.0001000022,0.00006690576],"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.000109565,0.00005890156,0.0004109359,0.00009387593,0.00001669401,0.00008665808,0.00007022973,0.8672482,0.003144561,0.03749607,0.00312896,0.08813544],"study_design_scores_gemma":[0.000006411051,0.0000286777,0.0001165349,0.000005425672,0.00000477649,0.00004202075,0.00002277871,0.9758647,0.0009476203,0.02154102,0.001415035,0.000005023686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07538509,0.0005283452,0.9141756,0.0003819036,0.00009920328,0.000118451,0.000220098,0.0008526901,0.008238518],"genre_scores_gemma":[0.8864002,0.0002959605,0.1081998,0.00006093527,0.00003725055,0.0001105416,0.0002639391,0.0001322473,0.004499127],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004972146,"threshold_uncertainty_score":0.01663351,"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","authors":[{"name":"Danyao Wang","is_ca":true},{"name":"Charles Lo","is_ca":true},{"name":"Jasmina Vasiljevic","is_ca":true},{"name":"Natalie Enright Jerger","is_ca":true},{"name":"J. Gregory Steffan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005156693,0.0008481543,0.0003922789,0.0005670137,0.0003871898,0.0006035411,0.001826885,0.0005328407,0.008175272],"category_scores_gemma":[0.001381815,0.0004432996,0.0005604257,0.0003383486,0.0003696517,0.000511955,0.0005809189,0.0008680608,0.0009452254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005835963,"about_ca_system_score_gemma":0.0007984012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003750333,"about_ca_topic_score_gemma":0.003573323,"domain_scores_codex":[0.9997175,0.00008060972,0.00002080349,0.00003418237,0.0001129308,0.00003387925],"domain_scores_gemma":[0.9996353,0.0001673541,0.0000310889,0.00005871823,0.00007730249,0.00003017751],"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.0002742304,0.00009359112,0.002381157,0.0003457501,0.0001292712,0.0003093912,0.0001423451,0.8799539,0.01331373,0.01614094,0.01180996,0.07510582],"study_design_scores_gemma":[0.00005951966,0.00005907793,0.0001815014,0.00001821273,0.00001152257,0.00004139412,0.000009783833,0.9857604,0.005060532,0.001784328,0.007001195,0.00001252572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04044125,0.0003933999,0.9206373,0.0001756781,0.0001535945,0.0003516336,0.0009862951,0.02607772,0.01078309],"genre_scores_gemma":[0.3325514,0.0005743363,0.6579831,0.0001752106,0.00004039236,0.0008820185,0.00179403,0.001628129,0.004371333],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008175272,"threshold_uncertainty_score":0.02734905,"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","authors":[{"name":"Hratch Mangassarian","is_ca":true},{"name":"Andreas Veneris","is_ca":true},{"name":"Marco Benedetti","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001362378,0.0007165624,0.0004354452,0.0008667289,0.0004115843,0.001016724,0.0008713453,0.000757026,0.004572436],"category_scores_gemma":[0.007810063,0.0003086036,0.0007825728,0.001080766,0.0009324445,0.002028114,0.0006951189,0.001188456,0.0006307155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001443163,"about_ca_system_score_gemma":0.001079475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001640681,"about_ca_topic_score_gemma":0.002016601,"domain_scores_codex":[0.9986764,0.0004659494,0.000118904,0.0001491248,0.0004967661,0.00009285863],"domain_scores_gemma":[0.9964544,0.002165693,0.0004098558,0.0005871216,0.0003375999,0.00004545579],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004766442,0.0001454608,0.0006863843,0.000461144,0.00003496933,0.0003969916,0.0003387176,0.2916494,0.02255533,0.4107401,0.004895759,0.2676191],"study_design_scores_gemma":[0.0001133685,0.0002047223,0.0002044209,0.0001385855,0.00003971881,0.0002766545,0.00007225388,0.6721976,0.02468634,0.2878903,0.01413686,0.00003915642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01246743,0.0002125014,0.9838658,0.0003054789,0.00003753266,0.0001150966,0.0003119391,0.0008265274,0.001857692],"genre_scores_gemma":[0.3039309,0.0005576316,0.6905686,0.0002009049,0.00005298818,0.0005071574,0.00114957,0.0003155687,0.002716633],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004572436,"threshold_uncertainty_score":0.01529628,"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","authors":[{"name":"Majid Khabbazian","is_ca":true},{"name":"Vijay K. Bhargava","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002118991,0.0008834823,0.001844346,0.001146305,0.0009616704,0.00129042,0.002311823,0.00121801,0.001425671],"category_scores_gemma":[0.01018557,0.0006419381,0.0006682118,0.001681785,0.001174969,0.002271231,0.0017853,0.001215413,0.0007420756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001350752,"about_ca_system_score_gemma":0.001405267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001819353,"about_ca_topic_score_gemma":0.001407277,"domain_scores_codex":[0.9978244,0.0007333733,0.00009816969,0.0003036317,0.0007805627,0.0002599431],"domain_scores_gemma":[0.9927413,0.003826344,0.0009521162,0.001739357,0.0006130644,0.0001278851],"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.000968971,0.0001748691,0.0009577255,0.0007288438,0.0001642847,0.0004171491,0.0006883031,0.6121888,0.03282171,0.125313,0.008368649,0.2172078],"study_design_scores_gemma":[0.0001452946,0.000334119,0.0003014084,0.00005086727,0.00006979479,0.0004603715,0.00009973073,0.9358139,0.01121229,0.04687515,0.004601975,0.00003514791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01673302,0.0005250935,0.9796825,0.0002292885,0.00002100584,0.00007773538,0.0000491503,0.0008754718,0.001806687],"genre_scores_gemma":[0.606142,0.0007529216,0.3890521,0.0001852431,0.000130219,0.0003800372,0.0002006567,0.0001678973,0.002988896],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002311823,"threshold_uncertainty_score":0.01120645,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}