{"meta":{"query_hash":"7bbe9875c94b","filters":{"venue":"IEEE Transactions on Computers"},"cohort_total":135,"direct_labels_cover":0,"predictions_cover":135,"exported":135,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/7bbe9875c94b","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Transactions+on+Computers"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03090075671251214,"score_gpt":0.25487026887910497,"score_spread":0.22396951216659283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963863611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1773042,0.000046129568,0.82109034,0.00041911798,0.0005201676,0.0004034174,0.00002085688,0.000121435056,0.00007434441],"genre_scores_gemma":[0.88962513,0.000004067584,0.10995561,0.00023801767,0.000054643468,0.00009768484,0.0000022181268,0.000012174486,0.000010449697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987791,0.000047043166,0.00023250909,0.00036152644,0.00014129432,0.00043849656],"domain_scores_gemma":[0.99901366,0.000331797,0.00005143718,0.00038807717,0.000030058925,0.00018496803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014659716,0.00019006648,0.00017472173,0.00038377807,0.00033498486,0.00009288094,0.00033723286,0.00005118069,0.0000050090944],"category_scores_gemma":[0.0000023149485,0.0001807274,0.00012574602,0.00035131688,0.00014434007,0.00021044095,0.0000072651887,0.00019458093,0.000005939242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049159257,0.007895916,0.0029200935,0.00034002063,0.00022223078,0.000018740355,0.0105987,0.24058528,0.013617499,0.008225444,0.00043883338,0.7146457],"study_design_scores_gemma":[0.009299259,0.00074344786,0.03863967,0.0002901357,0.00008104941,0.0002912184,0.00018113811,0.6384623,0.30625805,0.0024575274,0.0016099721,0.0016862391],"about_ca_topic_score_codex":0.000094843796,"about_ca_topic_score_gemma":0.0001357743,"teacher_disagreement_score":0.7129594,"about_ca_system_score_codex":0.000034991863,"about_ca_system_score_gemma":0.00002075037,"threshold_uncertainty_score":0.7369849},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010001962168924737,"score_gpt":0.23005373325235662,"score_spread":0.22005177108343188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964973855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073274344,0.000016701877,0.9136802,0.00026498965,0.011382635,0.0005430621,0.000028159557,0.0005836633,0.000226244],"genre_scores_gemma":[0.93224,0.0000063055268,0.06720634,0.00011901062,0.00020584169,0.00011978529,0.0000023036926,0.00002966891,0.00007072292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980995,0.00008352481,0.00038651927,0.00063858135,0.00032249527,0.0004694015],"domain_scores_gemma":[0.99831337,0.00037056667,0.000113414244,0.0008701867,0.00011376401,0.00021872],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026861028,0.00029601762,0.000301486,0.0002822554,0.00045011402,0.00025912438,0.0010119643,0.00011241555,0.00001338298],"category_scores_gemma":[0.0000015620652,0.0002761309,0.0003938501,0.00039607278,0.000089081914,0.00038410732,0.0000064941023,0.00042347563,0.00018742985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006637137,0.0055740084,0.0010142637,0.0030876165,0.0024598676,0.0011207177,0.0044600773,0.25295016,0.061791196,0.15533486,0.019300597,0.4922429],"study_design_scores_gemma":[0.0019869716,0.0004908345,0.00022826986,0.00030619424,0.000079458,0.0008943542,0.00005963718,0.9484392,0.039196536,0.00058295,0.006824876,0.00091074355],"about_ca_topic_score_codex":0.000055934637,"about_ca_topic_score_gemma":0.000013166306,"teacher_disagreement_score":0.8589657,"about_ca_system_score_codex":0.000047638696,"about_ca_system_score_gemma":0.000061011924,"threshold_uncertainty_score":0.99996907},"labels":[],"label_agreement":null},{"id":"W1974455942","doi":"10.1109/tc.2011.40","title":"Modeling Energy-Time Trade-Offs in VLSI Computation","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia Hospital","funders":"","keywords":"Uniprocessor system; Computer science; Computation; Parallel computing; Energy consumption; Very-large-scale integration; Energy (signal processing); Efficient energy use; Upper and lower bounds; Algorithm; Computer engineering; Embedded system; Multiprocessing; Mathematics","score_opus":0.029382911710500677,"score_gpt":0.23722288576616574,"score_spread":0.20783997405566507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974455942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017762413,0.000017087217,0.99537194,0.00016007727,0.00058843277,0.00012547866,0.0000016334424,0.00095386937,0.0010052603],"genre_scores_gemma":[0.71023536,0.000015827452,0.28928486,0.0003824078,0.000017693019,0.0000140485945,0.0000016764093,0.000015292304,0.00003284958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983577,0.00013826769,0.0004085821,0.0005175505,0.000247528,0.0003303814],"domain_scores_gemma":[0.99932957,0.00007745204,0.00006775985,0.00037138432,0.00004302399,0.00011079625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020526432,0.00023337513,0.00023754466,0.0005269952,0.00016440803,0.00008912598,0.000653532,0.00011155937,0.000009988406],"category_scores_gemma":[0.0000012100991,0.00025572156,0.00012102084,0.0006669125,0.00003339147,0.00044549775,0.0000064598316,0.00022972899,0.000030000467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011617324,0.00019428304,0.0000023946004,0.0000035419398,0.000013798426,0.00001082141,0.00085100625,0.92305106,0.00004547357,0.00065028423,0.00015708483,0.07500862],"study_design_scores_gemma":[0.00038133917,0.00012886374,0.00002175635,0.000057633628,0.000004845104,0.000016194159,0.0000072957405,0.99503314,0.0029235499,0.0011242263,0.000027549671,0.00027361626],"about_ca_topic_score_codex":0.00015724947,"about_ca_topic_score_gemma":0.000014830917,"teacher_disagreement_score":0.7084591,"about_ca_system_score_codex":0.000094634444,"about_ca_system_score_gemma":0.000052286327,"threshold_uncertainty_score":0.9999895},"labels":[],"label_agreement":null},{"id":"W1975335181","doi":"10.1109/tc.2014.2346184","title":"Methodology for Cycle-Accurate DRAM Performance Analysis","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Qualcomm (Canada)","funders":"","keywords":"Dram; Computer science; CAS latency; Root cause; Embedded system; Parallel computing; Reliability engineering; Computer hardware; Memory controller; Engineering; Semiconductor memory","score_opus":0.04258236473655359,"score_gpt":0.30096010901168657,"score_spread":0.258377744275133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975335181","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023962844,0.0000060376506,0.995105,0.00039410006,0.00088677456,0.000192598,0.000003207906,0.00080506253,0.00021093391],"genre_scores_gemma":[0.48738882,0.000010903289,0.511992,0.00047732392,0.00002777987,0.000030600946,0.0000017546508,0.000007671723,0.00006314794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851334,0.00022851031,0.0002992422,0.0004928037,0.00015528899,0.00031083325],"domain_scores_gemma":[0.9983777,0.0007016451,0.000118075484,0.00059304445,0.00011303436,0.00009650268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006251728,0.00018868531,0.00032010194,0.0005070128,0.00032262976,0.00012318947,0.00075349235,0.000090375506,0.0000053671083],"category_scores_gemma":[0.000007860181,0.00018723424,0.0002633004,0.000950598,0.000045576988,0.00025259244,0.000005241742,0.00015319945,0.000015952857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001151724,0.000045028974,0.0000069871326,0.0000073751576,0.00012240157,2.3964304e-7,0.00012920737,0.85269386,0.000029201048,0.0007206746,0.00020035211,0.14603317],"study_design_scores_gemma":[0.00029104904,0.00025489324,0.00010478055,0.000010502383,0.00007160742,0.0000042894235,0.0000019757308,0.99126124,0.0061475863,0.00039550356,0.0012412413,0.00021531577],"about_ca_topic_score_codex":0.000011110253,"about_ca_topic_score_gemma":0.0000046926707,"teacher_disagreement_score":0.48499253,"about_ca_system_score_codex":0.000039928567,"about_ca_system_score_gemma":0.000026957829,"threshold_uncertainty_score":0.76351905},"labels":[],"label_agreement":null},{"id":"W1988099508","doi":"10.1109/tc.2011.215","title":"Preserving Temporal Relationships of Events for Wireless Sensor Actor Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Network Time Synchronization Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Synchronization (alternating current); Wireless sensor network; Distributed computing; Overhead (engineering); Network topology; Wireless; Topology (electrical circuits); Data synchronization; Real-time computing; Computer network; Algorithm; Channel (broadcasting); Mathematics; Telecommunications","score_opus":0.051072238969424304,"score_gpt":0.23519206761002143,"score_spread":0.18411982864059712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988099508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007095852,0.000018682933,0.9905041,0.00014338891,0.001156842,0.00046298373,0.0000083282,0.0005463433,0.00006350277],"genre_scores_gemma":[0.76495373,0.000009157287,0.2348372,0.000032292202,0.000026915943,0.000042941385,0.0000019308495,0.00001758756,0.00007823703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868155,0.000082307575,0.00037621637,0.0003780899,0.0001916767,0.00029018344],"domain_scores_gemma":[0.99856436,0.0003307321,0.00019451506,0.0006817936,0.00015783106,0.00007074439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022475814,0.00018319255,0.00021962592,0.00024349772,0.0002575878,0.000028902214,0.00094252574,0.00015516816,0.000016836148],"category_scores_gemma":[0.000007641683,0.00018897069,0.0001350682,0.00059951615,0.00006885583,0.00044024552,0.000011681761,0.00025988673,0.00000906441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017048829,0.0010483486,0.0032818995,0.00015238926,0.0004475569,0.000008530873,0.0030506437,0.6903679,0.00032012365,0.014954406,0.0034515227,0.2827462],"study_design_scores_gemma":[0.0005420502,0.00022473051,0.00082451105,0.00009746121,0.000019685202,0.0000058048886,0.000039497336,0.9868774,0.009895417,0.0010944409,0.00012417245,0.00025487275],"about_ca_topic_score_codex":0.000021747666,"about_ca_topic_score_gemma":0.00001434269,"teacher_disagreement_score":0.75785786,"about_ca_system_score_codex":0.000069388094,"about_ca_system_score_gemma":0.000054950866,"threshold_uncertainty_score":0.77060014},"labels":[],"label_agreement":null},{"id":"W1989578025","doi":"10.1109/tc.2012.163","title":"Post-silicon code coverage for multiprocessor system-on-chip designs","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Semiconductor Research Corporation","keywords":"Computer science; Silicon; Silicon chip; Multiprocessing; Measure (data warehouse); Chip; Correctness; Embedded system; Code (set theory); Booting; Reliability engineering; Parallel computing; Set (abstract data type); Engineering; Materials science; Optoelectronics; Telecommunications; Algorithm","score_opus":0.04303599528037141,"score_gpt":0.26149946436767824,"score_spread":0.21846346908730682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989578025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016929299,0.000029751167,0.9789193,0.00020926759,0.0025348412,0.00044290753,0.000056400433,0.00061333127,0.0002648892],"genre_scores_gemma":[0.98978966,0.0000025338986,0.008795248,0.001023521,0.00019297299,0.00008508475,0.0000029631371,0.000028426477,0.00007957723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830514,0.0000800358,0.00030156152,0.00045200737,0.0002691093,0.00059216155],"domain_scores_gemma":[0.99829495,0.0007581499,0.000107713415,0.00047581602,0.000116852054,0.00024653412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031244342,0.00026542065,0.00025610795,0.00021793816,0.00047712555,0.00015994404,0.0006415017,0.0000955867,0.0000031167783],"category_scores_gemma":[0.000010301109,0.00025651066,0.00020142103,0.00028776628,0.000033337823,0.00056582375,0.0000031047039,0.00021943793,0.00010285826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029123325,0.0012501755,0.00018092277,0.00041321627,0.0002081369,0.000021078029,0.0033460956,0.16748047,0.012994325,0.005678879,0.0006548758,0.8077427],"study_design_scores_gemma":[0.0024828268,0.0010434883,0.0005437295,0.0004937396,0.0000730622,0.00016278113,0.0001445486,0.9359899,0.057043158,0.00007882167,0.0009262429,0.0010177084],"about_ca_topic_score_codex":0.000022755385,"about_ca_topic_score_gemma":0.0000063382918,"teacher_disagreement_score":0.9728604,"about_ca_system_score_codex":0.00013525254,"about_ca_system_score_gemma":0.000061819745,"threshold_uncertainty_score":0.99998873},"labels":[],"label_agreement":null},{"id":"W1994618033","doi":"10.1109/tc.2015.2425887","title":"A Deadlock-Free and Connectivity-Guaranteed Methodology for Achieving Fault-Tolerance in On-Chip Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Chinese Academy of Engineering; China Postdoctoral Science Foundation; University of British Columbia; National Natural Science Foundation of China","keywords":"Computer science; Router; Fault tolerance; Distributed computing; Robustness (evolution); Network on a chip; Deadlock; Parallel computing; Computer network","score_opus":0.07252094743277537,"score_gpt":0.29135962714120506,"score_spread":0.21883867970842968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994618033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046826355,0.000077224286,0.9466472,0.0007502865,0.0048606684,0.00051403674,0.000006033984,0.00018118923,0.0001369915],"genre_scores_gemma":[0.9441834,0.000010683629,0.05414355,0.001304578,0.00018354584,0.000110905225,5.9476866e-7,0.000021322077,0.00004141582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978619,0.00044209498,0.00040502046,0.00065534667,0.00018845119,0.00044715678],"domain_scores_gemma":[0.9971198,0.0019098624,0.00011363443,0.0005994369,0.00009388026,0.00016338675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011659977,0.00026745655,0.00045474642,0.0003160065,0.00020437424,0.00015564433,0.0006298142,0.00017075487,0.0000011803032],"category_scores_gemma":[0.000031522322,0.0002610488,0.00013647153,0.0004205991,0.00006311285,0.00027038326,0.0000102386875,0.00040984913,0.0000048529587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021135404,0.00012897883,0.000040088467,0.000016350074,0.00004459656,0.000011788359,0.0012457551,0.93943256,0.00004174477,0.005068638,0.0006679356,0.05309019],"study_design_scores_gemma":[0.0023739184,0.00066677615,0.00009328474,0.00015800809,0.000008983874,0.0000933011,0.0000946784,0.99411356,0.0002851459,0.0010228088,0.0007965842,0.000292956],"about_ca_topic_score_codex":0.00013976313,"about_ca_topic_score_gemma":0.0003946531,"teacher_disagreement_score":0.89735705,"about_ca_system_score_codex":0.00011778436,"about_ca_system_score_gemma":0.000048286987,"threshold_uncertainty_score":0.99998415},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025578817498934963,"score_gpt":0.25121527143621264,"score_spread":0.2256364539372777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997419346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015556582,0.000028330569,0.9802136,0.0002761058,0.0029859084,0.0005529317,0.000053067935,0.00016835214,0.00016514017],"genre_scores_gemma":[0.8981403,0.000013556525,0.10099704,0.00037702324,0.00004691785,0.000052559695,0.0000075290322,0.000029500316,0.00033555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808896,0.000110659836,0.00042890667,0.00048374844,0.00047951366,0.0004081861],"domain_scores_gemma":[0.998216,0.00052217033,0.0001561733,0.0006392497,0.00019213733,0.000274282],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027761288,0.00025159476,0.00031708204,0.0002512678,0.0001436722,0.000074712734,0.0006199172,0.000091082,0.000005612459],"category_scores_gemma":[0.0000061238115,0.00025741765,0.00018161852,0.00043045726,0.00009210724,0.00020215196,0.000006377947,0.00016224719,0.000013102975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008339248,0.0002208821,0.0000024447982,0.000020107882,0.000065944936,0.00000795263,0.000665537,0.9814925,0.0002673215,0.0004396763,0.0017478918,0.014986319],"study_design_scores_gemma":[0.002097498,0.0005273194,0.0000045404977,0.00007155601,0.000027999804,0.000013393325,0.00006295753,0.9706559,0.021634672,0.000051490817,0.004541759,0.0003108795],"about_ca_topic_score_codex":0.000029098132,"about_ca_topic_score_gemma":0.000020404475,"teacher_disagreement_score":0.88258374,"about_ca_system_score_codex":0.0001591104,"about_ca_system_score_gemma":0.00012751498,"threshold_uncertainty_score":0.9999878},"labels":[],"label_agreement":null},{"id":"W1998755931","doi":"10.1109/tc.2013.140","title":"A Decision Support System for the Design and Evaluation of Sustainable Wastewater Solutions","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Water Quality Monitoring Technologies","field":"Environmental Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Australian National University","keywords":"Computer science; Context (archaeology); Sustainability; Decision support system; Modular design; Component (thermodynamics); Scalability; Brainstorming; Relation (database); Risk analysis (engineering); Systems engineering; Process management; Management science; Engineering; Artificial intelligence; Business","score_opus":0.05615901720524843,"score_gpt":0.270272907409917,"score_spread":0.21411389020466856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998755931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16860774,0.000005539313,0.8295446,0.00023969563,0.00040030872,0.001112404,0.0000021413487,0.00007445994,0.000013130303],"genre_scores_gemma":[0.9654364,0.0000030272645,0.034074113,0.000009186402,0.000009986708,0.0003822715,3.2475805e-7,0.000007904283,0.00007680829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905956,0.00008587012,0.0001755704,0.00018106928,0.00028952994,0.00020842525],"domain_scores_gemma":[0.9991674,0.0004147729,0.000047026275,0.00027004594,0.000071820345,0.00002897382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093610963,0.00008778436,0.00009103272,0.000056856756,0.00029037875,0.000041419436,0.0001878102,0.000051670126,0.000042135795],"category_scores_gemma":[0.000011551725,0.000060811064,0.000043780867,0.00012221436,0.00014032707,0.00019505215,0.000008161868,0.000062129635,0.000033774653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003236989,0.00007584909,0.000026750231,0.00002887487,0.00003822272,3.8434362e-7,0.00053154206,0.9077446,0.0030637793,0.00008904375,0.0038014234,0.084567174],"study_design_scores_gemma":[0.0011532687,0.00046914374,0.0015887682,0.000064983964,0.00018067613,0.000010675617,0.0028719842,0.82846737,0.16225676,0.002149554,0.0005518608,0.00023496803],"about_ca_topic_score_codex":0.0003135396,"about_ca_topic_score_gemma":0.0000042333645,"teacher_disagreement_score":0.7968286,"about_ca_system_score_codex":0.00022112207,"about_ca_system_score_gemma":0.000012580126,"threshold_uncertainty_score":0.24798033},"labels":[],"label_agreement":null},{"id":"W2002871885","doi":"10.1109/tc.2010.218","title":"High-Speed Architectures for Multiplication Using Reordered Normal Basis","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of Waterloo","funders":"","keywords":"Normal basis; Basis (linear algebra); Multiplication (music); Permutation (music); Elliptic curve cryptography; Binary number; Mathematics; Cryptography; Polynomial basis; Computer science; Multiplication algorithm; Arithmetic; Finite field; Algorithm; Basis function; Discrete mathematics; Encryption; Combinatorics; Galois theory","score_opus":0.014609132770273623,"score_gpt":0.24505338279394429,"score_spread":0.23044425002367067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002871885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25290006,0.0000039314546,0.74429226,0.00046162005,0.0018466196,0.00028645762,0.000011763389,0.00018698654,0.000010266572],"genre_scores_gemma":[0.6507419,0.0000012336394,0.34898293,0.00017109163,0.00006811047,0.000016095966,0.0000010979127,0.000010439142,0.0000071450986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885136,0.00003904588,0.00021847758,0.00042231704,0.00018306324,0.00028574397],"domain_scores_gemma":[0.9989018,0.00027974605,0.00007287717,0.000552067,0.000082511426,0.00011100951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001363593,0.00017580103,0.00015592501,0.00034494902,0.0004155214,0.00012528441,0.0005621189,0.00009948135,0.000007854628],"category_scores_gemma":[0.0000034631792,0.00016765393,0.00020329028,0.00044979516,0.00008115624,0.00011192015,0.000003794856,0.00029629396,0.000006439121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007829375,0.00037566587,0.000029664669,0.000031150477,0.00011113377,0.0000035951282,0.0008915921,0.5039308,0.059029236,0.0018429222,0.000102309146,0.43357366],"study_design_scores_gemma":[0.0010850008,0.00015586104,0.0008266727,0.00002290498,0.000030441202,0.000036979094,0.000010088051,0.88311845,0.11302979,0.0010676736,0.0003000317,0.0003161092],"about_ca_topic_score_codex":0.00011208018,"about_ca_topic_score_gemma":0.00009659112,"teacher_disagreement_score":0.43325755,"about_ca_system_score_codex":0.000017725542,"about_ca_system_score_gemma":0.000043966305,"threshold_uncertainty_score":0.68367285},"labels":[],"label_agreement":null},{"id":"W2007053448","doi":"10.1109/tc.2012.52","title":"Designing a Physical Locality Aware Coherence Protocol for Chip-Multiprocessors","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; University of Cambridge; Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Computer science; Cache coherence; MESI protocol; Efficient energy use; Exploit; Locality; Latency (audio); Cache; Multiprocessing; Energy consumption; Chip; Multi-core processor; Protocol (science); Bus sniffing; Parallel computing; CPU cache; Cache algorithms; Telecommunications","score_opus":0.04833595714627392,"score_gpt":0.32956462324425945,"score_spread":0.2812286660979855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007053448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016460061,0.0000012001624,0.97571695,0.00011847669,0.00032889258,0.02257797,0.000004287913,0.0010021282,0.00008551146],"genre_scores_gemma":[0.49069065,2.1781759e-7,0.46005857,0.00029682514,0.00011209605,0.048784878,8.978114e-7,0.000018843875,0.000037036465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848,0.00010736974,0.0002578168,0.00042203206,0.00025865494,0.0004741119],"domain_scores_gemma":[0.99882257,0.000310559,0.0001199512,0.0004276767,0.0001303284,0.00018893369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002937879,0.00024410036,0.00023196699,0.00013332348,0.00037387482,0.00013676276,0.0006833527,0.00008065002,0.0000038038177],"category_scores_gemma":[0.0000045027296,0.00023053135,0.0001596158,0.0003998972,0.00005905255,0.0005607512,0.0000070354004,0.00022139764,0.000019077408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017613925,0.0026340138,0.00011800213,0.0002808504,0.00011347114,0.0000028612474,0.0038815124,0.6786698,0.0007345967,0.0012447085,0.0045681396,0.30757588],"study_design_scores_gemma":[0.0007655494,0.00023341468,0.000025150945,0.000098069286,0.000007744343,0.00000758952,0.000013831818,0.931065,0.066526875,0.00027563053,0.0006629171,0.0003181867],"about_ca_topic_score_codex":0.000010030459,"about_ca_topic_score_gemma":7.798792e-7,"teacher_disagreement_score":0.5156584,"about_ca_system_score_codex":0.00006329325,"about_ca_system_score_gemma":0.000069715585,"threshold_uncertainty_score":0.94007957},"labels":[],"label_agreement":null},{"id":"W2009601525","doi":"10.1109/tc.2013.29","title":"FLOTT—A Fast, Low Memory T-TransformAlgorithm for Measuring String Complexity","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; String (physics); Algorithm; Suffix; Time complexity; Compressed suffix array; Computational complexity theory; Suffix tree; Theoretical computer science; Measure (data warehouse); Generalized suffix tree; Data structure; Mathematics; Data mining; Programming language","score_opus":0.0322719717284187,"score_gpt":0.23951572188006498,"score_spread":0.20724375015164628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009601525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001553692,0.000017079581,0.9938372,0.00027421064,0.0030881478,0.00043640425,0.000046858666,0.00054417434,0.0002022462],"genre_scores_gemma":[0.5754748,0.0000136362905,0.42364025,0.00043211086,0.00025936036,0.0000685587,0.000008989996,0.00003370325,0.00006858129],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786705,0.00009405587,0.00038972823,0.0006680293,0.00043854563,0.00054258935],"domain_scores_gemma":[0.99846673,0.0002916168,0.00009196887,0.0007947293,0.000118580705,0.00023637392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041999502,0.00031541512,0.00032751187,0.00019689034,0.0006650862,0.00025895846,0.0010905231,0.00010103272,0.000010061981],"category_scores_gemma":[0.0000031689133,0.00030960984,0.0002446684,0.00031037212,0.00007841433,0.00089077646,0.000012304927,0.0003104095,0.00003416993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031744097,0.0002013798,0.0000010795607,0.000060810922,0.000048411006,0.0000033159545,0.00031322747,0.11216999,0.00043360508,0.001763092,0.00037731038,0.88459605],"study_design_scores_gemma":[0.0012541214,0.00024282839,0.00005364411,0.00013258432,0.000015534637,0.000024281462,0.00001790023,0.9747879,0.020433336,0.0006184488,0.0020251565,0.0003942838],"about_ca_topic_score_codex":0.000047307072,"about_ca_topic_score_gemma":0.000017622016,"teacher_disagreement_score":0.88420177,"about_ca_system_score_codex":0.00009069068,"about_ca_system_score_gemma":0.000051989242,"threshold_uncertainty_score":0.9999356},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029850998689808617,"score_gpt":0.24488361483364668,"score_spread":0.21503261614383806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010472188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015328602,0.000024900528,0.9908822,0.00054185855,0.0057634567,0.00059921417,0.0000067538354,0.00058826123,0.0000605063],"genre_scores_gemma":[0.8984178,0.0000110989695,0.09904219,0.0019594536,0.00030725478,0.00015942639,0.0000036290107,0.00003162587,0.00006755498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981052,0.000071137096,0.00035159494,0.00062728376,0.0002744875,0.0005702956],"domain_scores_gemma":[0.9981798,0.0007976318,0.00009603112,0.00063485024,0.00009369634,0.00019800114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034521372,0.00027720994,0.00029232295,0.00019931387,0.0004592872,0.00022427159,0.00077332667,0.00012658567,0.000006370588],"category_scores_gemma":[0.0000041299436,0.00026939096,0.0002521508,0.0004884201,0.00005577447,0.00015434796,0.0000073443916,0.00028261065,0.00003510579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013664317,0.00008698469,0.000001104666,0.000003904607,0.000022925544,0.0000013067373,0.00018433704,0.68791026,0.0000072852063,0.0013147686,0.0010299546,0.3094235],"study_design_scores_gemma":[0.0009514735,0.00028294476,0.000037239937,0.000073978736,0.0000121618405,0.000013570246,0.000014606478,0.9872696,0.00018930572,0.00008408719,0.010751016,0.00032005462],"about_ca_topic_score_codex":0.0000120448785,"about_ca_topic_score_gemma":0.000006138959,"teacher_disagreement_score":0.8968849,"about_ca_system_score_codex":0.00008050232,"about_ca_system_score_gemma":0.000034331337,"threshold_uncertainty_score":0.9999758},"labels":[],"label_agreement":null},{"id":"W2010574338","doi":"10.1109/tc.2013.107","title":"On a New Mechanism of Trigger Generation for Post-Silicon Debugging","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Observability; Debugging; Computer science; Controllability; Embedded system; Root cause; TRACE (psycholinguistics); Overhead (engineering); Reduction (mathematics); Computer hardware; Real-time computing; Reliability engineering; Engineering; Operating system","score_opus":0.028583165224706386,"score_gpt":0.23440041982760146,"score_spread":0.20581725460289507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010574338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02000186,0.000007908194,0.97746104,0.0008626584,0.0010397539,0.00036353958,0.0000039155248,0.000189237,0.00007009349],"genre_scores_gemma":[0.9812049,0.0000018944843,0.017644247,0.0008605762,0.000088560446,0.00003607407,0.0000018137885,0.000013258964,0.00014864966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989703,0.000034234687,0.00025068803,0.0003385358,0.00018027054,0.00022593781],"domain_scores_gemma":[0.99911684,0.00025876297,0.00008786931,0.00031462076,0.00011655612,0.000105346095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105123014,0.00014748168,0.00016910581,0.0002210078,0.00017015461,0.00009666189,0.00034605793,0.000059244117,0.000017883456],"category_scores_gemma":[0.000006563999,0.00014234701,0.00014631434,0.00021895097,0.000013599117,0.00035089444,0.0000017388826,0.000108162334,0.0000372229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018803486,0.00014721876,7.170318e-7,0.000017631844,0.00004705579,0.000001346943,0.0005299572,0.04696018,0.07823108,0.00934001,0.0014175066,0.8633054],"study_design_scores_gemma":[0.0005896474,0.00045179744,0.000014841581,0.00005924456,0.000013572973,0.000008609095,0.00000793056,0.90474945,0.09150153,0.0023918569,0.0000346641,0.0001768776],"about_ca_topic_score_codex":0.00015044733,"about_ca_topic_score_gemma":0.000013083865,"teacher_disagreement_score":0.96120304,"about_ca_system_score_codex":0.000042491283,"about_ca_system_score_gemma":0.00008338502,"threshold_uncertainty_score":0.58047426},"labels":[],"label_agreement":null},{"id":"W2017533742","doi":"10.1109/tc.2012.95","title":"Multiway Splitting Method for Toeplitz Matrix Vector Product","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Toeplitz matrix; Mathematics; Generalization; Matrix (chemical analysis); Matrix multiplication; Levinson recursion; Product (mathematics); Integer (computer science); Combinatorics; Computational complexity theory; Discrete mathematics; Algebra over a field; Algorithm; Pure mathematics; Computer science; Mathematical analysis","score_opus":0.024640510700493345,"score_gpt":0.2999153595971561,"score_spread":0.27527484889666276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017533742","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024017973,0.00006815972,0.9918887,0.0005486827,0.004097054,0.00043369233,0.000010223506,0.0004670819,0.000084617335],"genre_scores_gemma":[0.49841243,0.0000021509024,0.5010155,0.0002189022,0.00020061055,0.00006145324,6.5563546e-7,0.0000147812025,0.00007355259],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984363,0.0001493875,0.0002520873,0.00046047638,0.00018798784,0.00051380164],"domain_scores_gemma":[0.9983999,0.0006489093,0.0000788468,0.00063618086,0.00006352497,0.00017264739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081389677,0.00021643595,0.00020864348,0.00023074515,0.00037137626,0.000121208366,0.00061544654,0.00005563328,0.000011578504],"category_scores_gemma":[0.000006772193,0.00021096479,0.00028854996,0.0005007857,0.000033572906,0.00053961365,0.000005492815,0.00019599372,0.000037304075],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010435751,0.0007034525,0.000034897574,0.00008936977,0.00018723996,0.000001960749,0.0029648547,0.019185623,0.006289359,0.047892738,0.0010445787,0.9215016],"study_design_scores_gemma":[0.0028214504,0.0008974645,0.0006433499,0.00021516939,0.0001748552,0.00012824785,0.00013974872,0.7279465,0.22042653,0.0046437485,0.04013353,0.0018293957],"about_ca_topic_score_codex":0.000009949658,"about_ca_topic_score_gemma":0.0000014367643,"teacher_disagreement_score":0.9196722,"about_ca_system_score_codex":0.000046987832,"about_ca_system_score_gemma":0.000025921125,"threshold_uncertainty_score":0.86028945},"labels":[],"label_agreement":null},{"id":"W2025482144","doi":"10.1109/tc.2011.87","title":"A Fast Hardware Architecture for Integer to \\tauNAF Conversion for Koblitz Curves","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Elliptic curve cryptography; Computer science; Integer (computer science); Cryptography; Elliptic curve; Cryptosystem; Parallel computing; Discrete mathematics; Arithmetic; Algorithm; Mathematics; Theoretical computer science; Public-key cryptography; Encryption; Operating system; Pure mathematics","score_opus":0.02585099325267172,"score_gpt":0.23782888346254275,"score_spread":0.211977890209871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025482144","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064583874,0.00004936751,0.99420357,0.0017188255,0.0019799606,0.0010324541,0.00006155898,0.00024157428,0.000066869674],"genre_scores_gemma":[0.42092842,0.000035766818,0.5739316,0.004409524,0.00008642129,0.00040024714,0.000005931064,0.000036261332,0.00016584147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987208,0.000039047976,0.00021307408,0.0005083649,0.0001695303,0.0003491728],"domain_scores_gemma":[0.9989164,0.00025556624,0.00004990503,0.0004632029,0.00012747165,0.00018745806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014391981,0.00021159751,0.00021232902,0.00038464047,0.00027101033,0.000064925254,0.0007132049,0.00007625766,0.000014341013],"category_scores_gemma":[0.0000039064607,0.00018815031,0.0003472486,0.0004616392,0.000054968106,0.00018462243,0.0000062870326,0.00015911441,0.000018651772],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007169672,0.0013993733,0.000030447272,0.0010669702,0.0005555843,0.000019414307,0.015117241,0.036588624,0.0011982393,0.0056301234,0.04182429,0.89585274],"study_design_scores_gemma":[0.014304803,0.014839919,0.0014319957,0.0051516397,0.0006407731,0.0002803318,0.0009005176,0.45915753,0.31444967,0.016833799,0.16652334,0.005485683],"about_ca_topic_score_codex":0.000031430573,"about_ca_topic_score_gemma":0.000026886739,"teacher_disagreement_score":0.89036703,"about_ca_system_score_codex":0.000028702852,"about_ca_system_score_gemma":0.000041272906,"threshold_uncertainty_score":0.7672547},"labels":[],"label_agreement":null},{"id":"W2037762867","doi":"10.1109/tc.2012.147","title":"Analysis of Error Masking and Restoring Properties of Sequential Circuits","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Radiation Effects in Electronics","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Sequential logic; Masking (illustration); Computer science; Binary decision diagram; Electronic circuit; Algorithm; Finite-state machine; Benchmark (surveying); Scalability; Sequence (biology); Binary number; Decoding methods; Logic gate; Electronic engineering; Mathematics; Arithmetic","score_opus":0.029406987003784787,"score_gpt":0.23766749881388505,"score_spread":0.20826051181010025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037762867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4837643,0.00015439538,0.51553655,0.0000026897253,0.00041915465,0.000045420238,0.000002749722,0.000043673655,0.000031047955],"genre_scores_gemma":[0.9993995,0.000020466941,0.00052508886,0.000004475733,0.000024686959,0.0000054764323,4.9231295e-7,0.00001418389,0.0000056740946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945176,0.000025967503,0.0001729426,0.000074536314,0.00011933293,0.00015547058],"domain_scores_gemma":[0.99972725,0.000045855155,0.000034610817,0.00013280613,0.0000192642,0.00004023628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000106918786,0.00008334198,0.0001781643,0.00034162358,0.000031552747,0.0000060990646,0.000059183687,0.000040529147,0.000004475996],"category_scores_gemma":[0.0000012766805,0.00008805892,0.00007573582,0.00038538547,0.000030847314,0.00013547928,4.95173e-7,0.00009716607,6.365795e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031246568,0.000022604036,0.00010300038,0.00005999429,0.00052730687,1.2054011e-7,0.0008104187,0.96874654,0.01666921,0.000014401697,0.000003294621,0.013039981],"study_design_scores_gemma":[0.00013128403,0.000030201425,0.0010675869,0.000042244967,0.0003359189,0.0000018270155,0.000022196129,0.87757754,0.120669425,9.658706e-7,0.000026731172,0.000094104435],"about_ca_topic_score_codex":0.000019850442,"about_ca_topic_score_gemma":0.00001065962,"teacher_disagreement_score":0.51563513,"about_ca_system_score_codex":0.00007218655,"about_ca_system_score_gemma":0.000008421278,"threshold_uncertainty_score":0.35909384},"labels":[],"label_agreement":null},{"id":"W2042428442","doi":"10.1109/tc.2011.192","title":"Mapping Trigger Conditions onto Trigger Units during Post-silicon Validation and Debugging","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Debugging; Computer science; Embedded system; Chip; Computer hardware; Computer architecture; Real-time computing; Operating system; Telecommunications","score_opus":0.03934467965454598,"score_gpt":0.22356990706725777,"score_spread":0.1842252274127118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042428442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28430796,0.000021789674,0.71399796,0.00017312603,0.00055337546,0.00015160425,0.0000074260465,0.00041159755,0.00037518505],"genre_scores_gemma":[0.9971012,0.000013160044,0.0023919635,0.0002704482,0.000042500993,0.000021468333,0.0000037138554,0.000018088122,0.0001374597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853826,0.00009454508,0.00032279384,0.0004857314,0.00020401315,0.0003546633],"domain_scores_gemma":[0.99904484,0.000182669,0.0001048864,0.00035594392,0.0001473599,0.00016427803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000173778,0.00022210108,0.00020549819,0.00047886316,0.00062420126,0.00016583886,0.00035974305,0.000079105506,0.000022757737],"category_scores_gemma":[0.000008095773,0.00023560354,0.000083189654,0.00069318205,0.000058365476,0.0008531122,0.000006542057,0.00025063034,0.000032698084],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002323288,0.0010463513,0.0011316601,0.000292506,0.00063541596,0.0002158201,0.040170316,0.02254944,0.1006758,0.0029261739,0.0005292858,0.829804],"study_design_scores_gemma":[0.009383689,0.0012445475,0.06013186,0.0021720016,0.0003018951,0.0017019932,0.0018466732,0.5354606,0.3797539,0.00291507,0.000666264,0.0044215224],"about_ca_topic_score_codex":0.00013945778,"about_ca_topic_score_gemma":0.000020083071,"teacher_disagreement_score":0.8253825,"about_ca_system_score_codex":0.00007366422,"about_ca_system_score_gemma":0.0000723717,"threshold_uncertainty_score":0.96076334},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02156385517594522,"score_gpt":0.2647108640006778,"score_spread":0.24314700882473256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042528220","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010701314,0.000017308768,0.9863118,0.00070998573,0.0017743566,0.00017111981,0.0000031393424,0.0002464369,0.00006453969],"genre_scores_gemma":[0.48124763,0.00000831974,0.51833177,0.0002617977,0.0000868995,0.00001184658,4.0921472e-7,0.000009673626,0.00004165203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985749,0.000092207476,0.00023785823,0.0003789641,0.00030487662,0.0004111957],"domain_scores_gemma":[0.99895376,0.00021008878,0.00009616046,0.00043082,0.00005902102,0.00025013194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021894202,0.00020506354,0.00020432874,0.0001375643,0.00019296905,0.00013007633,0.00058233563,0.000054938017,0.000013577761],"category_scores_gemma":[0.0000022131753,0.00016366097,0.00009694399,0.00037247708,0.000071489965,0.00064538576,0.000006138491,0.0002646919,0.000072907846],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009015227,0.0006007232,0.00008162421,0.0000089301275,0.00008957153,0.000009270411,0.0008903157,0.02851354,0.00275056,0.0030982748,0.0002080046,0.96365905],"study_design_scores_gemma":[0.0032537798,0.0013461873,0.004868554,0.00021075312,0.00006526672,0.00031786566,0.00007273668,0.92093986,0.062143,0.00086827145,0.0046391548,0.0012745728],"about_ca_topic_score_codex":0.000087867746,"about_ca_topic_score_gemma":0.0000019072662,"teacher_disagreement_score":0.96238446,"about_ca_system_score_codex":0.00008426711,"about_ca_system_score_gemma":0.000024590743,"threshold_uncertainty_score":0.66739005},"labels":[],"label_agreement":null},{"id":"W2044614936","doi":"10.1109/tc.2012.177","title":"Evaluation of Communication Architectures for Switched Real-Time Ethernet","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Network Time Synchronization Technologies","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Foreign Affairs and International Trade Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Carrier Ethernet; Jitter; Ethernet; Embedded system; Connection-oriented Ethernet; Synchronous Ethernet; ATA over Ethernet; Ethernet flow control; Fieldbus; Computer network; Ethernet over SDH; Distributed computing; Control system; Engineering","score_opus":0.03222623126492509,"score_gpt":0.2850025339319094,"score_spread":0.2527763026669843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044614936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024106191,0.00009727208,0.9738256,0.00035593705,0.00037276055,0.0005578479,0.000005984063,0.00040820465,0.00027023643],"genre_scores_gemma":[0.8494577,0.000014925997,0.15032285,0.00004336881,0.000024838608,0.000089614754,0.0000030124227,0.000013252308,0.00003044188],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985784,0.00024575976,0.00026944478,0.00020635534,0.00046116207,0.00023884668],"domain_scores_gemma":[0.9982542,0.0004217467,0.00016250221,0.00081499823,0.00029537152,0.000051218423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012580536,0.00013904917,0.00016868269,0.000221064,0.0001454972,0.00003131454,0.00073817,0.00009668595,0.000026024458],"category_scores_gemma":[0.000015150861,0.00013788606,0.00009518015,0.0004079935,0.0000774731,0.00015532771,0.000007125074,0.000122024685,0.000025934834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000113717015,0.00018586317,0.0000114527365,0.000009619692,0.00008100558,2.901133e-8,0.00104251,0.43442464,0.0017280645,0.0009043334,0.0005798094,0.5610213],"study_design_scores_gemma":[0.00063172635,0.0001215515,0.00020355626,0.000041848758,0.0000639044,0.0000036363924,0.00002205348,0.9353266,0.060633767,0.0026697307,0.000109692235,0.00017197884],"about_ca_topic_score_codex":0.00002267622,"about_ca_topic_score_gemma":0.000005918246,"teacher_disagreement_score":0.8253515,"about_ca_system_score_codex":0.00013194286,"about_ca_system_score_gemma":0.00007782929,"threshold_uncertainty_score":0.56228304},"labels":[],"label_agreement":null},{"id":"W2046200107","doi":"10.1109/tc.2014.2360542","title":"Survivable Cloud Network Mapping for Disaster Recovery Support","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Network virtualization; Cloud computing; Scalability; Distributed computing; Survivability; Reliability (semiconductor); Heuristic; Computer network; Disjoint sets; Disaster recovery; Scheme (mathematics); Virtualization; Database","score_opus":0.019531718154020744,"score_gpt":0.2189789741605482,"score_spread":0.19944725600652746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046200107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011253752,0.000013697322,0.987602,0.0005394817,0.009541363,0.00030093786,0.00000825843,0.00045133577,0.0004175339],"genre_scores_gemma":[0.6142018,0.00003586502,0.3777985,0.005019707,0.001642112,0.00013712332,0.000011804099,0.00006986215,0.0010832275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981575,0.000098616474,0.00034013123,0.00057694956,0.00022409229,0.00060268084],"domain_scores_gemma":[0.99808353,0.00090492686,0.00009710185,0.00069080957,0.00006550324,0.00015815036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005013802,0.00025017792,0.00029728544,0.000121505786,0.00037790686,0.00023392988,0.0007009856,0.00011152931,0.000022955346],"category_scores_gemma":[0.0000040541804,0.00024986218,0.0002588721,0.00044862545,0.000037826845,0.00037132823,0.000007777538,0.00020578966,0.00008485643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044699387,0.00011002919,0.000038576476,0.000025891137,0.000082651786,0.0000027020574,0.00023620152,0.6776988,0.000012279351,0.0016923584,0.037845455,0.28221038],"study_design_scores_gemma":[0.0012530937,0.00072996714,0.00015087427,0.00014387116,0.000027765329,0.000026108959,0.000015185802,0.9010844,0.0002557032,0.0040853806,0.09155737,0.0006702512],"about_ca_topic_score_codex":0.000017323076,"about_ca_topic_score_gemma":0.000015640015,"teacher_disagreement_score":0.61307645,"about_ca_system_score_codex":0.00005697498,"about_ca_system_score_gemma":0.000042704858,"threshold_uncertainty_score":0.99999535},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.026712253309955747,"score_gpt":0.29191457404592486,"score_spread":0.2652023207359691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058949335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027606077,0.000004626705,0.97061825,0.00015991156,0.00082462415,0.00019944897,0.0000024536641,0.0003391012,0.00024551345],"genre_scores_gemma":[0.5216944,0.0000014523984,0.47807005,0.00020160947,0.00001711379,0.000003032071,3.5904407e-7,0.0000035275887,0.00000840155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998345,0.0001828014,0.00033734253,0.0004754746,0.00031272162,0.000346613],"domain_scores_gemma":[0.9986838,0.00010644501,0.00011344893,0.00090287067,0.00008932773,0.00010409622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071841216,0.0001776944,0.00022444209,0.00042707616,0.0003388696,0.0001600164,0.00073287013,0.00007892358,0.000007694131],"category_scores_gemma":[0.000006876763,0.00017233146,0.00025915905,0.0016049347,0.000053055388,0.0012328511,0.0000036530507,0.00024421405,0.000012278945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018216166,0.00014735782,0.000011484815,0.0000050836943,0.00006722813,0.0000022091237,0.0004960466,0.7093714,0.0004620905,0.005549098,0.000007235553,0.2838626],"study_design_scores_gemma":[0.00015790257,0.00014647175,0.00087664527,0.000012407635,0.000080506135,0.000009361,0.000012534669,0.9869298,0.010685943,0.0008591705,0.00003591566,0.00019336933],"about_ca_topic_score_codex":0.000018560675,"about_ca_topic_score_gemma":0.0000018485849,"teacher_disagreement_score":0.49408835,"about_ca_system_score_codex":0.00017355234,"about_ca_system_score_gemma":0.000051042956,"threshold_uncertainty_score":0.7027473},"labels":[],"label_agreement":null},{"id":"W2065523940","doi":"10.1109/tc.2011.250","title":"NoC-Based FPGA Acceleration for Monte Carlo Simulations with Applications to SPECT Imaging","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Medical Imaging Techniques and Applications","field":"Medicine","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; McMaster University","keywords":"Monte Carlo method; Computer science; Field-programmable gate array; Embarrassingly parallel; Parallel computing; Computational science; Scalability; Acceleration; Massively parallel; Computer hardware; Physics","score_opus":0.05079942842188097,"score_gpt":0.30862486035925063,"score_spread":0.2578254319373697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065523940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047852695,0.000003881882,0.9882672,0.0038995482,0.0000888525,0.002223314,0.00006739196,0.00042551925,0.00023901489],"genre_scores_gemma":[0.70992565,0.0000013703725,0.28717846,0.0017732405,0.00006018982,0.0009159677,0.000014556901,0.000029772205,0.000100793724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989464,0.000014061175,0.00024748972,0.00037329254,0.00018990063,0.00022884621],"domain_scores_gemma":[0.9989425,0.000116268726,0.000055673947,0.00046435904,0.00017530663,0.00024591276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007326115,0.00017492656,0.00019329428,0.0002390882,0.00027178752,0.000032520402,0.00013350534,0.000037340607,0.00006551123],"category_scores_gemma":[0.0000029477014,0.00015693753,0.00010639337,0.00039253428,0.00006599665,0.00008565827,0.0000011713481,0.00017048119,0.000020769712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018686141,0.0062537463,0.0010627946,0.00041293263,0.0005489517,0.00003614465,0.0022399875,0.36516875,0.023308,0.002309014,0.024021253,0.5727698],"study_design_scores_gemma":[0.002759731,0.0008609311,0.0006728774,0.00028518072,0.00041533564,0.000044645447,0.000075556534,0.8696413,0.10429076,0.00018489605,0.020211788,0.00055698655],"about_ca_topic_score_codex":0.00007661148,"about_ca_topic_score_gemma":0.00003243958,"teacher_disagreement_score":0.70514035,"about_ca_system_score_codex":0.000097767406,"about_ca_system_score_gemma":0.0000954119,"threshold_uncertainty_score":0.6399727},"labels":[],"label_agreement":null},{"id":"W2067628956","doi":"10.1109/tc.2013.213","title":"New Regular Radix-8 Scheme for Elliptic Curve Scalar Multiplication without Pre-Computation","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Scalar multiplication; Elliptic curve point multiplication; Elliptic curve; Hessian form of an elliptic curve; Mathematics; Scalar (mathematics); Edwards curve; Elliptic curve cryptography; Arithmetic; Computation; Tripling-oriented Doche–Icart–Kohel curve; Finite field; Complex multiplication; Schoof's algorithm; Elliptic Curve Digital Signature Algorithm; Computer science; Multiplication (music); Algorithm; Discrete mathematics; Pure mathematics; Public-key cryptography; Geometry; Combinatorics; Encryption","score_opus":0.011926601736346616,"score_gpt":0.24268761861042998,"score_spread":0.23076101687408337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067628956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011572937,0.000056934543,0.9839339,0.0011467424,0.0016501608,0.0011919019,0.0000029700839,0.0004156353,0.000028786635],"genre_scores_gemma":[0.5070856,0.000013492843,0.49231035,0.00018549974,0.00008130075,0.00013520487,0.0000044416465,0.000020160118,0.00016393009],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982765,0.000075092874,0.0003526023,0.00062994956,0.00029657767,0.0003692865],"domain_scores_gemma":[0.99862343,0.00027958112,0.00012274383,0.00058737915,0.00015724458,0.00022959262],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015115093,0.00025602872,0.00022885321,0.00033630122,0.00032031653,0.00029300782,0.00061227696,0.00012380538,0.000012805485],"category_scores_gemma":[0.000003771372,0.00025075988,0.00024671687,0.0006055648,0.00005938685,0.0007044871,0.0000046239675,0.00020555734,0.000100360216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043145174,0.0003690983,0.000095513,0.00005696535,0.00018348303,0.0000014714454,0.0010602353,0.2275336,0.004755391,0.0016039379,0.0067739002,0.7575233],"study_design_scores_gemma":[0.0011442325,0.00023891912,0.0018419467,0.00007048254,0.000026698304,0.000015588832,0.000010713744,0.9811154,0.012397502,0.0021073727,0.00069818087,0.00033294322],"about_ca_topic_score_codex":0.00014035842,"about_ca_topic_score_gemma":0.000009273536,"teacher_disagreement_score":0.75719035,"about_ca_system_score_codex":0.00006163366,"about_ca_system_score_gemma":0.00007499865,"threshold_uncertainty_score":0.99999446},"labels":[],"label_agreement":null},{"id":"W2068816273","doi":"10.1109/tc.2014.2329689","title":"Robot Coordination for Energy-Balanced Matching and Sequence Dispatch of Robots to Events","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Schedule; Computer science; Pairwise comparison; Event (particle physics); Matching (statistics); Sequence (biology); Set (abstract data type); Energy (signal processing); Real-time computing; Algorithm; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.015565555340444178,"score_gpt":0.23631987200712798,"score_spread":0.2207543166666838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068816273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04808719,0.0000071189156,0.95090216,0.00010047119,0.0006636583,0.00013273468,0.000010798586,0.000079485806,0.000016382295],"genre_scores_gemma":[0.9642928,0.000014254273,0.035523437,0.000060726787,0.000023531493,0.0000311634,0.0000022881086,0.000018971605,0.000032777018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942654,0.000014891988,0.00016415042,0.00015924852,0.000093713,0.00014144016],"domain_scores_gemma":[0.99965805,0.00008274714,0.000021720838,0.0001353007,0.00003451472,0.00006766886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007377645,0.00011289529,0.00014733196,0.00008958137,0.00005982113,0.0000141099335,0.00009821196,0.0000408163,0.0000030135845],"category_scores_gemma":[0.0000013432501,0.00011781002,0.000045796907,0.0001004945,0.000011937243,0.00007576911,9.1896607e-7,0.00005598222,0.000001896823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008330566,0.0000147958235,0.0000054027446,0.000037966587,0.000017392336,1.2776363e-7,0.00012989185,0.8788348,0.013246893,0.00024840605,0.000030649964,0.10742534],"study_design_scores_gemma":[0.00024083823,0.0001342605,0.00020310398,0.00012997059,0.000014426483,0.0000032486982,0.000011640213,0.91162986,0.08670443,0.0005912709,0.00014709891,0.00018984475],"about_ca_topic_score_codex":0.000049021222,"about_ca_topic_score_gemma":0.00002785298,"teacher_disagreement_score":0.91620564,"about_ca_system_score_codex":0.000032409094,"about_ca_system_score_gemma":0.0000041905314,"threshold_uncertainty_score":0.4804153},"labels":[],"label_agreement":null},{"id":"W2073770015","doi":"10.1109/tc.2012.275","title":"A Novel Algorithmic Approach to Aid Post-Silicon Delay Measurement and Clock Tuning","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Exploit; Silicon; Static timing analysis; Electronic engineering; Digital clock manager; Pruning; Clock signal; Embedded system; Clock skew; Engineering; Materials science; Optoelectronics; Telecommunications","score_opus":0.04477556713293868,"score_gpt":0.23278331155864446,"score_spread":0.18800774442570578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073770015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009241035,0.00007796025,0.9886984,0.0002553601,0.0009145162,0.00024392725,0.000004428363,0.00026001883,0.00030430482],"genre_scores_gemma":[0.9038671,0.0000027132905,0.095002204,0.0009670154,0.00010349419,0.000026922287,5.8292596e-7,0.000015718577,0.0000142227955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983744,0.00005207854,0.00024113692,0.0004305712,0.00041025766,0.00049153913],"domain_scores_gemma":[0.9990487,0.00007796482,0.000054007294,0.00036264327,0.000113173555,0.000343475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045369452,0.00021961646,0.00020064457,0.00024798105,0.00031622782,0.0001495178,0.00042623468,0.00006071359,0.0000013304534],"category_scores_gemma":[0.000005536063,0.00021872592,0.00008442025,0.00040433448,0.000028659506,0.00048467796,0.000008837671,0.00023695204,0.000026039454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026565674,0.0007057047,0.00007957824,0.000036122845,0.00009462191,0.000003675252,0.004017987,0.039450713,0.023242578,0.00075270067,0.00012208582,0.93149155],"study_design_scores_gemma":[0.0012815843,0.00038754652,0.0016799,0.00019294363,0.00005138533,0.0005380666,0.00017726605,0.98761016,0.006176106,0.000021262786,0.0010247802,0.0008589864],"about_ca_topic_score_codex":0.000088959205,"about_ca_topic_score_gemma":0.0000060505627,"teacher_disagreement_score":0.94815946,"about_ca_system_score_codex":0.000117298354,"about_ca_system_score_gemma":0.000047717665,"threshold_uncertainty_score":0.89193845},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.022831882126618724,"score_gpt":0.2177743438413438,"score_spread":0.1949424617147251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078474261","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009539411,0.00008787648,0.9884636,0.00010808556,0.0012214313,0.00039127996,0.0000033381432,0.00018231325,0.000002663402],"genre_scores_gemma":[0.34007162,0.0000131944835,0.6597135,0.00007051381,0.00005387074,0.000053556312,0.0000026665055,0.00001538743,0.0000057141788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989359,0.000027177448,0.00030679596,0.00030425945,0.00016690358,0.0002589754],"domain_scores_gemma":[0.9992878,0.00025054402,0.000076682016,0.0002131511,0.00006706834,0.000104756335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002688293,0.00015318333,0.000219419,0.00017715235,0.00007089433,0.000060723283,0.00018185146,0.000065909735,0.000001081891],"category_scores_gemma":[0.000010706426,0.00015723926,0.00006058778,0.0003786914,0.000016600265,0.00020107985,0.0000058715937,0.000115409784,7.3243615e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027612406,0.000060410857,0.000015542822,0.00002313434,0.000014242971,0.0000012971528,0.0003675704,0.9670842,0.000004485038,0.00006265014,0.00025559874,0.032083254],"study_design_scores_gemma":[0.001149051,0.00027071935,0.000050153052,0.00016767194,0.000008717441,0.000005912634,0.000014759599,0.9979114,0.0001701141,0.000031559382,0.00006284058,0.00015708922],"about_ca_topic_score_codex":0.0000074851077,"about_ca_topic_score_gemma":0.0000053321487,"teacher_disagreement_score":0.3305322,"about_ca_system_score_codex":0.00007044864,"about_ca_system_score_gemma":0.00005989854,"threshold_uncertainty_score":0.6412031},"labels":[],"label_agreement":null},{"id":"W2083488767","doi":"10.1109/tc.2014.2315633","title":"Accurate and Efficient Estimation of Logic Circuits Reliability Bounds","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Advancements in Semiconductor Devices and Circuit Design","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"United Arab Emirates University","keywords":"Reliability (semiconductor); Computer science; Heuristic; Electronic circuit; Algorithm; Logic gate; Range (aeronautics); Circuit reliability; Criticality; Computer engineering; Reliability engineering; Combinational logic; Power (physics); Engineering; Artificial intelligence; Electrical engineering","score_opus":0.01555136879958166,"score_gpt":0.2360664803390563,"score_spread":0.22051511153947465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083488767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19062778,0.000022668539,0.8081829,0.000008779253,0.00073298014,0.0000986965,0.0000054902107,0.00008949129,0.00023119002],"genre_scores_gemma":[0.99746513,0.000018154497,0.002430433,0.000042851374,0.00001348592,0.0000066512753,0.0000011095309,0.0000126176565,0.000009557589],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999393,0.000024699219,0.00019492957,0.00015668997,0.00010644339,0.00012426142],"domain_scores_gemma":[0.9995963,0.00011182223,0.000032165797,0.00018955569,0.000024107841,0.000046069086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011227014,0.00011116112,0.00013739322,0.00006406869,0.000057145196,0.000017708782,0.00007701337,0.00004418707,0.000016116548],"category_scores_gemma":[0.000002095355,0.00011167341,0.000036242167,0.000111993715,0.000050579125,0.000077211764,4.833763e-7,0.00009924394,0.000008094194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017124482,0.000027781583,0.0000029925918,0.000051891104,0.000012781484,1.5766145e-7,0.00010656458,0.9117968,0.0013724114,0.00010646591,0.000014945305,0.086505495],"study_design_scores_gemma":[0.00024529969,0.00007108532,0.00015247746,0.00004191083,0.000017126042,0.0000031354891,0.000013663946,0.9903885,0.008579115,0.00024770282,0.00012129776,0.00011866392],"about_ca_topic_score_codex":0.0000031521215,"about_ca_topic_score_gemma":8.949637e-7,"teacher_disagreement_score":0.8068374,"about_ca_system_score_codex":0.000043485703,"about_ca_system_score_gemma":0.000006128678,"threshold_uncertainty_score":0.45539096},"labels":[],"label_agreement":null},{"id":"W2089777270","doi":"10.1109/12.980020","title":"Comment on \"Generic universal switch blocks\"","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Block (permutation group theory); Mathematics; Physics; Discrete mathematics; Arithmetic; Computer science","score_opus":0.026282994847269463,"score_gpt":0.21298827424665834,"score_spread":0.18670527939938888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089777270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015312199,0.0000145906715,0.98323375,0.006543364,0.005992462,0.00016847921,0.0000030194276,0.00032004807,0.0021930812],"genre_scores_gemma":[0.9882712,0.000022993818,0.0040826565,0.006624853,0.00013900893,0.000014839281,4.4423442e-7,0.000014507293,0.00082950795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861056,0.00010582541,0.00024475783,0.0004336203,0.0002939113,0.00031132164],"domain_scores_gemma":[0.9990298,0.00014873782,0.00006620571,0.00056551344,0.000051141862,0.00013858828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011195459,0.00020759452,0.00019017067,0.00022700935,0.00031342104,0.00014787847,0.0005964878,0.000079018,0.00012424831],"category_scores_gemma":[4.7398277e-7,0.00019916621,0.00016733288,0.00043987404,0.000028996905,0.00019894182,0.0000037964237,0.00026471604,0.0003260092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027538445,0.000824659,0.000004868648,0.000010631287,0.00016121475,0.00006976219,0.0016126876,0.64342606,0.00010531765,0.0067613455,0.1730323,0.17396362],"study_design_scores_gemma":[0.00057613605,0.0004738329,0.000005459981,0.00005872633,0.000007982099,0.000038770388,0.000034731427,0.93688536,0.001257938,0.000033822704,0.06036772,0.00025954883],"about_ca_topic_score_codex":0.000043637527,"about_ca_topic_score_gemma":0.0000102846925,"teacher_disagreement_score":0.98674,"about_ca_system_score_codex":0.00016806138,"about_ca_system_score_gemma":0.000010649376,"threshold_uncertainty_score":0.8121763},"labels":[],"label_agreement":null},{"id":"W2095622662","doi":"10.1109/12.902749","title":"Hierarchical ring network configuration and performance modeling","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"University of California, Riverside","keywords":"Computer science; Queueing theory; Network packet; Transmission delay; Processing delay; Parallel computing; Ring (chemistry); Interconnection; CPU cache; Ring network; Cache; Memory hierarchy; Packet switching; Hierarchy; Computer network; Network topology","score_opus":0.022286469883376337,"score_gpt":0.226043798084867,"score_spread":0.20375732820149065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095622662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08397562,0.00002228257,0.91245794,0.00026710235,0.0022311066,0.00011546282,2.9175135e-7,0.00016814267,0.0007620594],"genre_scores_gemma":[0.9907072,0.00007540044,0.008495363,0.00036955913,0.00022336666,0.0000140299735,4.367487e-7,0.000008336542,0.000106288324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989472,0.00006076123,0.00024224137,0.00032186293,0.00016325238,0.00026469748],"domain_scores_gemma":[0.99949026,0.00008165521,0.00003932017,0.0002463622,0.000046774763,0.00009560413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019677452,0.00013599088,0.0001427804,0.00009945748,0.00038653272,0.00019108185,0.0002228474,0.00006558752,0.0000099905055],"category_scores_gemma":[5.369505e-7,0.00013237829,0.000057013713,0.00025415551,0.000023896995,0.00033841538,0.0000029847333,0.0002371502,0.000018562481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001697699,0.000015351625,0.000026937267,0.0000042432034,0.000014826874,0.00000414323,0.0002016756,0.906016,0.000018344945,0.0013691711,0.00007893575,0.0922334],"study_design_scores_gemma":[0.00025043782,0.00013411611,0.00005293531,0.00008025537,0.000003914459,0.00011080906,0.000008890426,0.9986774,0.00009713121,0.00013153076,0.0003045374,0.00014804298],"about_ca_topic_score_codex":0.000021224123,"about_ca_topic_score_gemma":0.000014385872,"teacher_disagreement_score":0.9067316,"about_ca_system_score_codex":0.00003851121,"about_ca_system_score_gemma":0.00001716323,"threshold_uncertainty_score":0.539823},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0368473896670903,"score_gpt":0.2626955284532059,"score_spread":0.22584813878611557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098156582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022245008,0.00005618616,0.972496,0.0011556013,0.0028036134,0.0008876744,0.0000028730456,0.00019495918,0.00015810899],"genre_scores_gemma":[0.9571049,0.00001715021,0.040958416,0.001165629,0.000505017,0.00018340994,0.0000010698099,0.000019680652,0.00004472306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982338,0.00024181251,0.00033884187,0.0005216134,0.00029143426,0.0003725307],"domain_scores_gemma":[0.9986986,0.00065961824,0.00009298431,0.0003772286,0.000061217295,0.000110377805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008600354,0.0002468726,0.00023151025,0.00021008347,0.00041456195,0.00018444512,0.00038242072,0.00009463642,0.000010138756],"category_scores_gemma":[0.00000394209,0.0002232944,0.00013842397,0.0002395412,0.000042388267,0.00023185482,0.0000030353954,0.00023606948,0.0000144449905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005260001,0.00003624706,0.000001517609,0.000006418762,0.000030437664,2.9038324e-7,0.0003960696,0.5876987,0.000028728191,0.00018239199,0.0009783471,0.41058823],"study_design_scores_gemma":[0.0008646614,0.0008330259,0.00009445986,0.00013499612,0.000020482486,0.000047783236,0.000010806202,0.99358,0.0022318496,0.00015309383,0.0017781208,0.00025072272],"about_ca_topic_score_codex":0.000004762092,"about_ca_topic_score_gemma":0.000022750117,"teacher_disagreement_score":0.9348599,"about_ca_system_score_codex":0.00011041035,"about_ca_system_score_gemma":0.0000442424,"threshold_uncertainty_score":0.9105681},"labels":[],"label_agreement":null},{"id":"W2099063269","doi":"10.1109/tc.2008.223","title":"An Optimized Cell BE Special Function Library Generated by Coconut","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"McMaster University","keywords":"Computer science; Digital subscriber line; Haskell; Programming language; Compiler; Domain-specific language; Functional programming; Parallel computing","score_opus":0.011188650917468863,"score_gpt":0.22342114674334304,"score_spread":0.21223249582587417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099063269","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013094923,0.000024703902,0.99184805,0.0010870757,0.0015461273,0.00025605728,0.000012863314,0.002141579,0.0017740565],"genre_scores_gemma":[0.44095358,0.00008228171,0.550811,0.0067743226,0.00046375443,0.000017507708,0.000045207846,0.0000331623,0.0008191943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824977,0.00018129981,0.0003389557,0.00061769213,0.00027720016,0.00033509993],"domain_scores_gemma":[0.9989371,0.00006460065,0.00010993799,0.0006138253,0.000060129238,0.00021440684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000117570475,0.00027994,0.00024443242,0.00027319262,0.00035263956,0.00044029567,0.0008249035,0.00014425787,0.00007376666],"category_scores_gemma":[5.5933435e-7,0.0002954164,0.00013050057,0.0006163957,0.000037191854,0.0011350625,0.0000034567038,0.0002896232,0.000030726438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009376098,0.00066171074,9.68306e-7,0.0000033049268,0.000021105898,0.000008744553,0.00020464206,0.8092146,0.0020977007,0.0003257614,0.09970864,0.08765907],"study_design_scores_gemma":[0.0010125155,0.00088387873,0.000013882389,0.000015616513,0.000013624724,0.000008377252,0.0000053695408,0.92973316,0.061776616,0.00022394446,0.0059143994,0.00039859404],"about_ca_topic_score_codex":0.000006023598,"about_ca_topic_score_gemma":3.7608345e-7,"teacher_disagreement_score":0.44103706,"about_ca_system_score_codex":0.000044813572,"about_ca_system_score_gemma":0.00007255529,"threshold_uncertainty_score":0.9999498},"labels":[],"label_agreement":null},{"id":"W2101078743","doi":"10.1109/tc.2013.133","title":"Self-Adaptive Context Data Management in Large-Scale Mobile Systems","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Exploit; Scalability; Distributed computing; Overhead (engineering); Computer network; Mobile computing; Data management; Context (archaeology); Bandwidth (computing); Computer security; Database; Operating system","score_opus":0.025335800103610907,"score_gpt":0.23749723980613252,"score_spread":0.2121614397025216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101078743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075290346,0.00009189727,0.9935512,0.00013559664,0.002652375,0.0009708569,0.000030253392,0.00031410562,0.0015008231],"genre_scores_gemma":[0.93672633,0.00008224025,0.06212275,0.0004754167,0.00005294547,0.00019161418,0.00000827237,0.00001658865,0.00032381993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803114,0.000109115754,0.00038372405,0.00070567615,0.00031520703,0.00045516333],"domain_scores_gemma":[0.998237,0.00013911653,0.00008028132,0.0013156008,0.00005513237,0.00017287699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002563016,0.0002278951,0.0002728364,0.000209213,0.00015693724,0.00025381197,0.0014143613,0.00008808237,0.000026595391],"category_scores_gemma":[7.532401e-8,0.00022311056,0.00006328796,0.00041238838,0.000033003947,0.0007440384,0.00003224086,0.00027161726,0.0003240038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027218732,0.0013605423,0.000017773764,0.00007232681,0.00027527768,0.00017277185,0.001952106,0.078067586,0.0000029053745,0.0025012142,0.01589471,0.8996556],"study_design_scores_gemma":[0.0007411996,0.000121905796,0.000027283446,0.000074110016,0.000016889653,0.000018726332,0.00043808183,0.99333054,0.000008122181,0.00005363806,0.004924423,0.00024507145],"about_ca_topic_score_codex":0.00013877127,"about_ca_topic_score_gemma":0.000041748917,"teacher_disagreement_score":0.93597347,"about_ca_system_score_codex":0.00009828866,"about_ca_system_score_gemma":0.00003983332,"threshold_uncertainty_score":0.9098185},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013136676412290257,"score_gpt":0.22415759046995826,"score_spread":0.21102091405766799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101126543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4840427,0.000046775323,0.5149177,0.00006762113,0.0006875752,0.00017822265,0.000003886673,0.000046953985,0.000008580116],"genre_scores_gemma":[0.9679305,0.00010919859,0.031633783,0.00025365388,0.000033918972,0.0000137636025,0.0000014795716,0.000017710465,0.000005975026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983884,0.00008748085,0.0003963604,0.00053480815,0.0002141611,0.00037878793],"domain_scores_gemma":[0.9987437,0.0005591716,0.00012068233,0.00041737754,0.000034054017,0.00012498372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032057308,0.00024911354,0.00030655882,0.00025498637,0.00023904645,0.00013067966,0.0002976733,0.00011451146,0.000004315596],"category_scores_gemma":[0.0000018449683,0.000262802,0.00007621527,0.0003310306,0.00011511492,0.00035760272,0.000018805911,0.0006058642,0.0000015249387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015195688,0.0003085872,0.00048821475,0.000038304475,0.000118719465,0.0003864404,0.0016808443,0.5652854,0.0016636497,0.0003852167,0.00009464798,0.42939806],"study_design_scores_gemma":[0.0011302783,0.0002364862,0.00068844634,0.00018261347,0.000017824588,0.00032652204,0.000100668185,0.99627596,0.0006861249,0.000055172906,0.000041680065,0.00025822778],"about_ca_topic_score_codex":0.000112230315,"about_ca_topic_score_gemma":0.00034520755,"teacher_disagreement_score":0.48388782,"about_ca_system_score_codex":0.000044297398,"about_ca_system_score_gemma":0.000016786718,"threshold_uncertainty_score":0.9999824},"labels":[],"label_agreement":null},{"id":"W2102282062","doi":"10.1109/tc.2010.45","title":"A Karatsuba-Based Algorithm for Polynomial Multiplication in Chebyshev Form","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Multiplication (music); Computer science; Algorithm; Polynomial; Arithmetic; Mathematics; Parallel computing; Combinatorics","score_opus":0.017022166178700227,"score_gpt":0.28066250431296863,"score_spread":0.2636403381342684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102282062","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014459004,0.0000039928655,0.9941031,0.0010149315,0.0027153625,0.0004884978,0.00001633059,0.00018515639,0.000026724083],"genre_scores_gemma":[0.10966452,0.000001804475,0.88940674,0.0005796376,0.00011646314,0.00018969543,0.0000017902039,0.00001561793,0.000023728995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998656,0.000044695535,0.00028497717,0.0004939394,0.00017699222,0.00034342104],"domain_scores_gemma":[0.9988117,0.0004355886,0.00007188638,0.00047996524,0.000061979415,0.00013883272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028678615,0.0001884557,0.0002095457,0.00024926197,0.00015642855,0.00011293271,0.00059928437,0.000115152856,0.000005964726],"category_scores_gemma":[0.000004386626,0.00018266031,0.00016734637,0.0004763235,0.0000512127,0.0002771669,0.0000028682207,0.00036054823,0.000016299025],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001146085,0.00023482226,0.0000022278034,0.0000046028695,0.0000070608985,0.0000016716621,0.00008484051,0.0019521303,0.0026754525,0.00009246808,0.000073541814,0.9948597],"study_design_scores_gemma":[0.0012202734,0.00018233224,0.00013236453,0.000013318284,0.0000047326776,0.000004803714,0.0000037878285,0.9601874,0.035554778,0.00032752394,0.0021472748,0.00022145912],"about_ca_topic_score_codex":0.000056388602,"about_ca_topic_score_gemma":0.000031797677,"teacher_disagreement_score":0.99463826,"about_ca_system_score_codex":0.000060008322,"about_ca_system_score_gemma":0.00008024903,"threshold_uncertainty_score":0.74486715},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Broadcasting (networking); Upper and lower bounds; Approximation algorithm; Bounded function; Redundancy (engineering); Bandwidth (computing); Node (physics); Constant (computer programming); Algorithm; Computer network; Mathematics","score_opus":0.020716769565089322,"score_gpt":0.2091507970209899,"score_spread":0.18843402745590057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102436827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029982118,0.00010962738,0.9681892,0.00024763503,0.00052243256,0.00020853744,0.000003627323,0.00034245785,0.00039436246],"genre_scores_gemma":[0.8689536,0.00012985939,0.1301149,0.00059825636,0.00003860676,0.0000096062695,0.000001481449,0.000019819494,0.00013386013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831814,0.00008016364,0.00031078572,0.00056125585,0.0003482744,0.00038135747],"domain_scores_gemma":[0.9990319,0.00019090498,0.00008143548,0.00038493902,0.00006694946,0.00024387441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000115007926,0.00027377906,0.0002977837,0.00016993021,0.0006818037,0.000119171345,0.00035107572,0.00010091558,0.000012466935],"category_scores_gemma":[2.3311529e-7,0.00023622964,0.00009265599,0.00039743926,0.0002068398,0.00034905606,0.0000037509913,0.00031049942,0.000011262487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035275036,0.00027823908,0.00003506166,0.000033791133,0.00010734736,0.0005508638,0.0018641718,0.015377402,0.00017122168,0.00028262066,0.00059644756,0.9803501],"study_design_scores_gemma":[0.0018622841,0.00042889253,0.000038375892,0.00020330402,0.000027522967,0.0010676166,0.000023337343,0.9933961,0.0005795137,0.00011882242,0.0018904951,0.00036375245],"about_ca_topic_score_codex":0.000049853767,"about_ca_topic_score_gemma":0.0000042235256,"teacher_disagreement_score":0.9799863,"about_ca_system_score_codex":0.000040047158,"about_ca_system_score_gemma":0.00013785108,"threshold_uncertainty_score":0.9633165},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.026795547780289454,"score_gpt":0.27220615930953074,"score_spread":0.2454106115292413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104193487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060898945,0.000042830226,0.9957002,0.00043549595,0.0009233996,0.0004294899,0.000012317276,0.0011355848,0.000711715],"genre_scores_gemma":[0.6844225,0.000014063793,0.31511745,0.00026068903,0.00006068894,0.000023120174,0.0000015490233,0.000015510353,0.0000844315],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99762934,0.00018266037,0.0004963772,0.0006039384,0.0006421968,0.000445481],"domain_scores_gemma":[0.9983299,0.00021199159,0.00012814476,0.0009286634,0.00021885143,0.00018245733],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037039732,0.0002753487,0.00036837676,0.00047049744,0.00020945632,0.00013999868,0.001088911,0.00013763136,0.000017837237],"category_scores_gemma":[0.000004266273,0.00028954732,0.00022396272,0.0008251172,0.000079340316,0.00055570964,0.0000054727766,0.0003774355,0.0000467212],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002787156,0.00087217684,0.00001340363,0.00006255433,0.0001422328,0.00013822796,0.0016875782,0.052887276,0.004639076,0.010007334,0.0029031448,0.9266191],"study_design_scores_gemma":[0.0011550979,0.002273122,0.00038389422,0.0005873772,0.000035920177,0.0002444225,0.00004636123,0.413239,0.5736904,0.006519727,0.00087806996,0.00094657607],"about_ca_topic_score_codex":0.00005454565,"about_ca_topic_score_gemma":0.0000040294444,"teacher_disagreement_score":0.92567253,"about_ca_system_score_codex":0.00015428105,"about_ca_system_score_gemma":0.00016916764,"threshold_uncertainty_score":0.99995565},"labels":[],"label_agreement":null},{"id":"W2106641903","doi":"10.1109/tc.2007.1047","title":"Comb Architectures for Finite Field Multiplication in F(2^m)","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Normal basis; Finite field; Basis (linear algebra); Critical path method; Multiplier (economics); Binary number; Field-programmable gate array; Computer science; Adder; Polynomial basis; Algorithm; Multiplication (music); Field (mathematics); Path (computing); Representation (politics); Mathematics; Arithmetic; Parallel computing; Discrete mathematics; Computer hardware; Latency (audio); Combinatorics; Galois theory","score_opus":0.01617108888284695,"score_gpt":0.2593328631153665,"score_spread":0.24316177423251956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106641903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026968634,0.000008771366,0.97114307,0.00055759674,0.0007532777,0.00025992392,0.0000028362228,0.0001641768,0.00014172349],"genre_scores_gemma":[0.93336475,0.0000018219431,0.06554913,0.0010029355,0.000030681473,0.00002978003,5.6491666e-7,0.0000065727295,0.000013767845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999133,0.000034033954,0.00019637073,0.0002905735,0.00010668933,0.00023935424],"domain_scores_gemma":[0.9980695,0.0014546786,0.000039505365,0.0003466842,0.000027128455,0.00006249953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033742,0.00011530395,0.000107556756,0.00038379157,0.0001303957,0.00004678686,0.00044054323,0.00006063619,0.0000034706243],"category_scores_gemma":[0.000005273519,0.00011835144,0.00012481624,0.00043891274,0.000025970947,0.00005785439,0.0000022419767,0.00017225352,0.000006571444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016026315,0.00025409175,0.000070212765,0.000015532361,0.000022354292,0.00000446114,0.0010880533,0.11872598,0.0005548747,0.0063197957,0.00011843673,0.87266594],"study_design_scores_gemma":[0.003100363,0.0013211975,0.0029469267,0.00016825047,0.000018933923,0.000020383564,0.00006148369,0.8451104,0.11601057,0.026592866,0.0038542799,0.0007943281],"about_ca_topic_score_codex":0.00001511818,"about_ca_topic_score_gemma":0.00008378431,"teacher_disagreement_score":0.9063961,"about_ca_system_score_codex":0.000023423136,"about_ca_system_score_gemma":0.000013070348,"threshold_uncertainty_score":0.48262316},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.055010798019638624,"score_gpt":0.24182970747747698,"score_spread":0.18681890945783836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106876320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026712235,0.00010509956,0.97053736,0.00094455667,0.00082254974,0.0005561969,0.00003488706,0.00019269994,0.00009440832],"genre_scores_gemma":[0.9597234,0.00002740697,0.039696384,0.00033923285,0.000046873265,0.0001116521,0.0000020703774,0.000016088563,0.000036905894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982739,0.00009910093,0.00029932303,0.00067214604,0.0002647562,0.00039075396],"domain_scores_gemma":[0.998743,0.00029758006,0.000068341884,0.00059230556,0.00008050449,0.0002182581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033008333,0.0002712455,0.00036226842,0.0008527586,0.00035537838,0.00032517957,0.0005822828,0.00009475082,0.000005593145],"category_scores_gemma":[0.0000018403837,0.00023199915,0.0003694346,0.0016207191,0.00007421437,0.00027578068,0.0000067017827,0.00015660936,0.000007630946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033189126,0.001584766,0.001930753,0.00015588614,0.005935135,0.000051326377,0.013262319,0.4720022,0.00065282977,0.0056312713,0.0019830912,0.49647853],"study_design_scores_gemma":[0.0014705524,0.0008513908,0.004981503,0.00010384873,0.00029414336,0.00010088571,0.00033075054,0.98092467,0.0019806663,0.00071969227,0.0072994977,0.0009423781],"about_ca_topic_score_codex":0.000043499756,"about_ca_topic_score_gemma":0.00007746677,"teacher_disagreement_score":0.9330112,"about_ca_system_score_codex":0.000042333773,"about_ca_system_score_gemma":0.000029809618,"threshold_uncertainty_score":0.94606507},"labels":[],"label_agreement":null},{"id":"W2108063157","doi":"10.1109/tc.2006.83","title":"An efficient dynamic algorithm for maintaining all-pairs shortest paths in stochastic networks","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Government of Ontario","keywords":"Shortest path problem; Shortest Path Faster Algorithm; Algorithm; Floyd–Warshall algorithm; K shortest path routing; Computer science; Graph; Mathematics; Theoretical computer science","score_opus":0.007588173983234923,"score_gpt":0.2548482205699203,"score_spread":0.24726004658668538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108063157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016121205,0.000009122922,0.9828012,0.00003269263,0.000305518,0.00046507007,0.0000370113,0.00018166055,0.00004654649],"genre_scores_gemma":[0.9539057,4.6416733e-7,0.045603797,0.000044287885,0.00016144199,0.00015517966,0.00007955712,0.00003770354,0.00001184573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985821,0.000049592603,0.00035964092,0.00043201147,0.00014145121,0.0004351493],"domain_scores_gemma":[0.99927974,0.00020027344,0.00008007109,0.00031493837,0.000042875166,0.00008212573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018675548,0.00024633878,0.00028157476,0.00025019297,0.00016413387,0.00007572138,0.00022512939,0.000052961834,0.000030375137],"category_scores_gemma":[1.2673748e-7,0.00027285534,0.0002186912,0.00033108675,0.00004561519,0.00006825804,0.0000019730405,0.000252146,0.0000036626361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008980839,0.0003661017,0.000023771934,5.4458087e-7,0.000042702613,0.0000015285167,0.0000412185,0.8510122,0.000018337847,0.00021852013,0.00006154006,0.1482046],"study_design_scores_gemma":[0.00045878862,0.00014775115,0.00017349307,0.000044321016,0.00006140521,0.0000011239705,0.00006818308,0.99814373,0.0000533143,0.0005480319,0.000031186493,0.00026869454],"about_ca_topic_score_codex":0.000342485,"about_ca_topic_score_gemma":0.00015971986,"teacher_disagreement_score":0.9377845,"about_ca_system_score_codex":0.00013494141,"about_ca_system_score_gemma":0.000025986568,"threshold_uncertainty_score":0.99997234},"labels":[],"label_agreement":null},{"id":"W2108119746","doi":"10.1109/tc.2010.78","title":"High-Radix Multiplier-Dividers: Theory, Design, and Hardware","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Cairo University; University of Utah","keywords":"Rounding; Arithmetic; Multiplier (economics); Division (mathematics); Radix (gastropod); Multiplication (music); Shift register; Computer science; Quotient; Numerical digit; Mathematics; Division algorithm; Computer hardware; Telecommunications","score_opus":0.019991996110876847,"score_gpt":0.25543929078501293,"score_spread":0.23544729467413608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108119746","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017810228,0.000014309053,0.9929093,0.00090158725,0.0038244715,0.00022474171,0.0000050426843,0.0003160047,0.000023531178],"genre_scores_gemma":[0.2281131,0.000010645028,0.77118444,0.000514857,0.00007399106,0.000021115984,2.439237e-7,0.000014566681,0.0000670231],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852735,0.00021230907,0.0002024061,0.00052802265,0.00021738913,0.00031251195],"domain_scores_gemma":[0.998226,0.00091080996,0.00005522483,0.0005333933,0.00004639216,0.00022816425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042695348,0.00021973507,0.00022282287,0.00014892542,0.00029098324,0.00023797437,0.0005947341,0.00009452612,0.000026229218],"category_scores_gemma":[0.000007984112,0.00019254295,0.0000944991,0.00029541051,0.0001295519,0.00035897974,0.0000075655935,0.00047227243,0.0000434245],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015657024,0.00013514092,0.00000168038,0.0000060589027,0.000041615152,0.000015765976,0.00029360858,0.008811402,0.0031437916,0.00443567,0.00018431533,0.9829153],"study_design_scores_gemma":[0.0017054637,0.0006874113,0.00025689608,0.00006488509,0.000043685868,0.00012547986,0.000038441958,0.8992239,0.06900058,0.024011116,0.0039428254,0.0008992948],"about_ca_topic_score_codex":0.000027421149,"about_ca_topic_score_gemma":0.0000026242524,"teacher_disagreement_score":0.982016,"about_ca_system_score_codex":0.000017078059,"about_ca_system_score_gemma":0.00003139576,"threshold_uncertainty_score":0.7851674},"labels":[],"label_agreement":null},{"id":"W2109539366","doi":"10.1109/tc.2007.70845","title":"Low Complexity Normal Elements over Finite Fields of Characteristic Two","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conjecture; Computation; Computational complexity theory; Constructive; Finite field; Binary number; Degree (music); Algorithm; Extension (predicate logic); Distribution (mathematics); Discrete mathematics; Computer science; Arithmetic","score_opus":0.02901359929829447,"score_gpt":0.24706651915260894,"score_spread":0.21805291985431446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109539366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20387316,0.0000029305372,0.7945857,0.00006764082,0.0010720636,0.000091473,0.000016141405,0.000114773844,0.00017612703],"genre_scores_gemma":[0.98367184,0.000012275432,0.015736388,0.0004885489,0.000038755337,0.000008370734,0.0000020789996,0.00000780971,0.000033946057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987886,0.0000859904,0.00031569527,0.00029961288,0.00025656965,0.00025351514],"domain_scores_gemma":[0.9990405,0.00020829328,0.00010736344,0.000496086,0.00005155578,0.00009623394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012942783,0.0001679355,0.00020695428,0.00022245929,0.00025563952,0.000032208416,0.000612017,0.000047829115,0.00009332555],"category_scores_gemma":[0.000001584591,0.0001755525,0.0001948132,0.00041988096,0.00014722142,0.0002852025,0.000007636938,0.00021457183,0.000028308747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011344441,0.008092133,0.0040385653,0.00044556195,0.0011057969,0.0004601079,0.014222434,0.211875,0.0067770695,0.05190763,0.0034636313,0.6964776],"study_design_scores_gemma":[0.0067362036,0.0025173335,0.031046972,0.00041915735,0.00009877441,0.00020444678,0.0000342422,0.87519836,0.0733877,0.0069445525,0.0015695937,0.0018426743],"about_ca_topic_score_codex":0.000024620926,"about_ca_topic_score_gemma":0.00001126327,"teacher_disagreement_score":0.7797987,"about_ca_system_score_codex":0.000020254116,"about_ca_system_score_gemma":0.000033846405,"threshold_uncertainty_score":0.71588236},"labels":[],"label_agreement":null},{"id":"W2110692871","doi":"10.1109/tc.2006.136","title":"Arithmetic Operations in Finite Fields of Medium Prime Characteristic Using the Lagrange Representation","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Representation (politics); Prime (order theory); Finite field; Mathematics; Set (abstract data type); Field (mathematics); Arithmetic; Elliptic curve; Discrete mathematics; Elliptic curve cryptography; Algorithm; Computer science; Algebra over a field; Combinatorics; Pure mathematics; Public-key cryptography","score_opus":0.020109500927512666,"score_gpt":0.2534701662797203,"score_spread":0.23336066535220762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110692871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113941856,0.000025789728,0.8842965,0.00071611995,0.0007258301,0.00020777498,0.000005524003,0.000045235553,0.000035385885],"genre_scores_gemma":[0.9798421,0.0000124922535,0.01992826,0.00013201627,0.00004261709,0.000016815055,0.0000021440817,0.0000066123207,0.000016888805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988821,0.00012928352,0.00033001637,0.00025793235,0.00022204155,0.00017859523],"domain_scores_gemma":[0.99909246,0.0003371316,0.00006176171,0.00042011263,0.000057341982,0.00003118462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001522582,0.000120624216,0.00015647215,0.0003240832,0.0001766959,0.00008531339,0.0004060593,0.00006404292,0.000007103564],"category_scores_gemma":[0.000003478126,0.00009721274,0.00011192733,0.0008954855,0.00008977225,0.0002350239,0.0000044784897,0.00020730127,0.00000346154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015565469,0.0004043101,0.00030950995,0.000019140422,0.000035452016,0.000022070733,0.0012859459,0.97902125,0.0030948531,0.0011051208,0.000029292287,0.014657474],"study_design_scores_gemma":[0.0005394269,0.00009214515,0.01573379,0.00007967954,0.000028190763,0.000022553882,0.00004177525,0.9650842,0.017652323,0.00052383624,0.00002476622,0.00017731143],"about_ca_topic_score_codex":0.001071505,"about_ca_topic_score_gemma":0.00049635884,"teacher_disagreement_score":0.8659003,"about_ca_system_score_codex":0.000025926794,"about_ca_system_score_gemma":0.000047522728,"threshold_uncertainty_score":0.39642203},"labels":[],"label_agreement":null},{"id":"W2110711133","doi":"10.1109/tc.2005.35","title":"A class of unidirectional bit serial systolic architectures for multiplicative inversion and division over GF(2/sup m/)","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Mathematics; Multiplicative inverse; GF(2); Division (mathematics); Cryptography; Multiplicative function; Discrete mathematics; Galois theory; Dimension (graph theory); Polynomial; Finite field arithmetic; Arithmetic; Polynomial basis; Inversion (geology); Primitive polynomial; Inverse; Algorithm; Combinatorics; Mathematical analysis","score_opus":0.011705015567760393,"score_gpt":0.236284639021819,"score_spread":0.22457962345405863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110711133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26465186,0.000015144247,0.73429453,0.00031702747,0.00036898474,0.00021297317,0.000019863885,0.00009749034,0.000022137141],"genre_scores_gemma":[0.9601701,0.000005863717,0.039509617,0.00019965056,0.00006338092,0.000027084114,0.0000010902247,0.000008700052,0.000014530961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990197,0.000083970896,0.00019309996,0.00035660778,0.00017364621,0.0001729749],"domain_scores_gemma":[0.99906313,0.0004478739,0.00007922345,0.00026824238,0.0000552291,0.00008631598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014966742,0.00015232884,0.00017212832,0.00031562557,0.0002382556,0.000042280964,0.0002977556,0.00006742063,0.000005372757],"category_scores_gemma":[0.0000029704775,0.00014421393,0.00015531818,0.0003258615,0.000105171974,0.0001167541,0.0000078411485,0.00013269056,0.0000023683515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047847923,0.00047897868,0.000062789455,0.00007429966,0.0001780425,0.000001045883,0.0025746906,0.24424843,0.0045483583,0.00923687,0.0006505109,0.7374675],"study_design_scores_gemma":[0.0016013416,0.00052284246,0.00040668517,0.00011339786,0.000025815541,0.000012189614,0.000023810799,0.9639474,0.028226,0.0015889494,0.0032670521,0.0002644778],"about_ca_topic_score_codex":0.000011633866,"about_ca_topic_score_gemma":0.000016190967,"teacher_disagreement_score":0.737203,"about_ca_system_score_codex":0.000036313475,"about_ca_system_score_gemma":0.000024837103,"threshold_uncertainty_score":0.5880873},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023975009667327848,"score_gpt":0.22589918090063205,"score_spread":0.2019241712333042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111459803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024204286,0.000087135144,0.97319233,0.0008968933,0.001193076,0.00013408648,0.0000040827576,0.00014840474,0.00013972857],"genre_scores_gemma":[0.87533903,0.00006274605,0.12353901,0.00093194976,0.000055858363,0.0000069567777,1.7393639e-7,0.000010959667,0.000053296968],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887353,0.00005488522,0.00019804444,0.0004090538,0.00018072498,0.00028373653],"domain_scores_gemma":[0.99905604,0.0003562881,0.000043538723,0.00038116108,0.000027273833,0.00013569629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000064840504,0.00018457475,0.0001664838,0.00032917934,0.0003294556,0.00016064817,0.00033385959,0.00009746928,0.00004752124],"category_scores_gemma":[0.0000019846564,0.00017746023,0.00014603895,0.00043362263,0.00006785679,0.00029278276,0.0000062661256,0.00023428208,0.000027666722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054170087,0.0006328535,0.00019669927,0.000039455987,0.0002121667,0.000077111785,0.0031520885,0.31500092,0.0009826857,0.00032291774,0.0027414975,0.6765874],"study_design_scores_gemma":[0.00081883033,0.00017841377,0.00020945212,0.000043553435,0.000022824996,0.000042205098,0.000017924813,0.99467987,0.0026837317,0.00004820543,0.0009667879,0.00028820705],"about_ca_topic_score_codex":0.00007721198,"about_ca_topic_score_gemma":0.000015141678,"teacher_disagreement_score":0.8511348,"about_ca_system_score_codex":0.000020579848,"about_ca_system_score_gemma":0.000010623695,"threshold_uncertainty_score":0.72366184},"labels":[],"label_agreement":null},{"id":"W2113840705","doi":"10.1109/tc.2008.171","title":"On Spatial Orders and Location Codes","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Algorithm; Base (topology); Rendering (computer graphics); Matrix multiplication; Cartesian coordinate system; Encryption; Theoretical computer science; Mathematics; Computer graphics (images); Geometry","score_opus":0.01643944536887114,"score_gpt":0.2349374601688255,"score_spread":0.21849801479995434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113840705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066673453,0.000011248193,0.99128085,0.00044236446,0.00055820966,0.00013404658,0.0000013589804,0.0006483641,0.00025622567],"genre_scores_gemma":[0.8950011,0.000045767232,0.1041222,0.00072942383,0.000021591255,0.000009883584,0.0000010173936,0.000009000977,0.000060027956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990335,0.00006588858,0.00016825744,0.00035713424,0.00020216052,0.00017304497],"domain_scores_gemma":[0.99928373,0.00016487231,0.000053177097,0.00031982697,0.00009414383,0.000084264415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008576477,0.00015030864,0.00013323821,0.00021514863,0.00036668888,0.00006510019,0.00029958488,0.000060946626,0.000003990743],"category_scores_gemma":[0.0000039125657,0.00015193822,0.00003879284,0.0003969692,0.00007977613,0.00017885587,0.0000033221247,0.00015949701,0.000024739515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024572935,0.0001876133,0.000014204949,0.000008326985,0.000025783022,0.000012356386,0.0005623693,0.8951662,0.00003578318,0.0021872886,0.0025123227,0.09926316],"study_design_scores_gemma":[0.00040856062,0.00032429057,0.00024318547,0.000044077362,0.0000041294547,0.000049417526,0.0000032153914,0.9939374,0.0041797888,0.0003259929,0.0002603416,0.0002196471],"about_ca_topic_score_codex":0.000085360174,"about_ca_topic_score_gemma":0.000008210609,"teacher_disagreement_score":0.88833374,"about_ca_system_score_codex":0.000039991344,"about_ca_system_score_gemma":0.000052246167,"threshold_uncertainty_score":0.6195861},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.01364235175092877,"score_gpt":0.21011957729063752,"score_spread":0.19647722553970876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114353618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008817822,0.000065032444,0.98845863,0.0004984614,0.0013662413,0.00018561614,0.0000053362237,0.00019467926,0.00040820046],"genre_scores_gemma":[0.67229855,0.00007169209,0.3272614,0.00017293374,0.000047431382,0.0000076080837,4.0513197e-7,0.0000117000955,0.00012829626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985993,0.00006002623,0.00032383777,0.00041376607,0.00032152998,0.00028152592],"domain_scores_gemma":[0.9989808,0.00015590397,0.000100893114,0.00054898794,0.00005000114,0.00016337127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006860971,0.00020557713,0.00023153567,0.00037577402,0.0001620639,0.00008002317,0.0005106534,0.00010564508,0.00015874938],"category_scores_gemma":[0.000001149071,0.00019796912,0.00025832784,0.0007339425,0.00011049112,0.00035691593,0.000003792935,0.00024286233,0.00005626782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004401739,0.0005355663,0.00018282919,0.000041045554,0.0002657357,0.00002719984,0.0019979617,0.16846877,0.0010057009,0.007456385,0.004616653,0.81535816],"study_design_scores_gemma":[0.0033730448,0.00048515448,0.0016888008,0.0001558189,0.00007103776,0.00016500147,0.000071717935,0.9780891,0.009962717,0.002032985,0.0031809139,0.00072371616],"about_ca_topic_score_codex":0.00008023509,"about_ca_topic_score_gemma":0.0000098325745,"teacher_disagreement_score":0.81463444,"about_ca_system_score_codex":0.000030480749,"about_ca_system_score_gemma":0.000027254438,"threshold_uncertainty_score":0.80729467},"labels":[],"label_agreement":null},{"id":"W2116596428","doi":"10.1109/tc.2010.227","title":"Target Association Rules: A New Behavioral Patterns for Point of Coverage Wireless Sensor Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Wireless sensor network; Schedule; Association (psychology); Association rule learning; Energy consumption; Data mining; Wireless; Node (physics); Process (computing); Set (abstract data type); Real-time computing; Computer network; Engineering","score_opus":0.010693886022354764,"score_gpt":0.2339315281932521,"score_spread":0.22323764217089734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116596428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13802516,0.000004634109,0.8556544,0.0002974947,0.0053403415,0.00035918417,0.000047145208,0.00024509893,0.000026538677],"genre_scores_gemma":[0.87102026,0.00001315198,0.1282124,0.00026093738,0.00023518618,0.00002853582,0.000013768343,0.000036882546,0.0001788438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997887,0.00007296842,0.0004940739,0.0005709771,0.00043382196,0.00054116],"domain_scores_gemma":[0.9980594,0.0005316368,0.00032797974,0.00068062375,0.00018358837,0.00021679884],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002834488,0.00029974154,0.00038620268,0.0002160317,0.0002001704,0.00014903209,0.0007496308,0.0002862673,0.000020094369],"category_scores_gemma":[0.0000035271573,0.0003222285,0.00032913813,0.00033517342,0.000036617457,0.00032786975,0.000008143285,0.00056169584,0.000007532685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034034125,0.00040643854,0.00018352654,0.0000128996535,0.000064623615,0.0000056351487,0.0003563638,0.95275366,0.0011436513,0.00068167254,0.00079231657,0.04356515],"study_design_scores_gemma":[0.0012160542,0.00029366757,0.00027126353,0.000066947054,0.00003740642,0.000011087409,0.000012675212,0.9852192,0.012002698,0.00006311345,0.0004329274,0.0003729558],"about_ca_topic_score_codex":0.00015672948,"about_ca_topic_score_gemma":0.00012724793,"teacher_disagreement_score":0.7329951,"about_ca_system_score_codex":0.00014394359,"about_ca_system_score_gemma":0.000089478366,"threshold_uncertainty_score":0.999923},"labels":[],"label_agreement":null},{"id":"W2116936848","doi":"10.1109/tc.2010.258","title":"Concurrent Error Detection in Montgomery Multiplication over Binary Extension Fields","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scalar multiplication; Multiplication (music); Error detection and correction; Elliptic curve cryptography; Finite field; Arithmetic; Cryptography; Finite field arithmetic; Elliptic Curve Digital Signature Algorithm; Binary number; Elliptic curve; Parallel computing; Algorithm; Mathematics; Public-key cryptography; Discrete mathematics; Encryption","score_opus":0.013944739712713568,"score_gpt":0.2519873307034088,"score_spread":0.23804259099069522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116936848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3253727,0.000013271091,0.67107505,0.0002742764,0.0029490069,0.00016449035,0.0000013295577,0.0001319655,0.000017919707],"genre_scores_gemma":[0.99296004,0.000022919612,0.006701223,0.00021282274,0.000043115964,0.000038604252,8.4698434e-7,0.000009197138,0.00001122387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883175,0.000057602752,0.00023749545,0.0004445588,0.00020217286,0.00022641452],"domain_scores_gemma":[0.9991556,0.0001515628,0.000059726917,0.00049714313,0.00004472016,0.0000912934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014109623,0.00015785357,0.00013747158,0.00046274666,0.00016956082,0.000067463334,0.0003457425,0.00014194369,0.0000109123575],"category_scores_gemma":[0.0000024484093,0.00015329504,0.00013053117,0.0006412815,0.000056563586,0.00033640486,0.0000050420263,0.0005449918,0.000023687004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019553574,0.00051849755,0.00007459267,0.000014278372,0.00001911043,0.000017232756,0.0005299566,0.03789384,0.04042378,0.00023200364,0.00009224191,0.9201649],"study_design_scores_gemma":[0.0009638314,0.00022940931,0.026546331,0.000050671926,0.000010302389,0.000029791327,0.000016548418,0.93574166,0.035473213,0.00019930035,0.00043255533,0.00030639287],"about_ca_topic_score_codex":0.00013105308,"about_ca_topic_score_gemma":0.00044778053,"teacher_disagreement_score":0.9198585,"about_ca_system_score_codex":0.000029885607,"about_ca_system_score_gemma":0.000023593018,"threshold_uncertainty_score":0.62511903},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.014019001938723376,"score_gpt":0.22053305333533613,"score_spread":0.20651405139661275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122183684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035129495,0.000117542564,0.9623333,0.00060353446,0.0011067983,0.00018134544,0.0000034769364,0.00028301982,0.00024144095],"genre_scores_gemma":[0.95072293,0.00015923992,0.048264235,0.0006054985,0.000044763747,0.00001407209,5.4227854e-7,0.00001381432,0.00017488831],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985848,0.00007109103,0.000238919,0.0004927798,0.00027704047,0.0003353525],"domain_scores_gemma":[0.99901384,0.00019675096,0.000052290758,0.00051861844,0.00004199295,0.00017648411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010773152,0.00022140623,0.0002168943,0.00034317208,0.00039771062,0.000109411296,0.00042818894,0.000104464285,0.000022264567],"category_scores_gemma":[0.0000013737485,0.00020748038,0.00016171832,0.0005724892,0.00016975842,0.00035196432,0.0000085552765,0.0003281901,0.0000410618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016941698,0.0029200953,0.0010849785,0.0001894083,0.0008256142,0.0007503737,0.013489343,0.20925483,0.0023377505,0.01186695,0.005050764,0.7520605],"study_design_scores_gemma":[0.0039766976,0.0018008745,0.017551485,0.00029059802,0.00011258738,0.0016562688,0.000087839355,0.9171302,0.050005738,0.0032756543,0.0022375071,0.0018745534],"about_ca_topic_score_codex":0.00007657188,"about_ca_topic_score_gemma":0.000011541746,"teacher_disagreement_score":0.91559345,"about_ca_system_score_codex":0.000030156116,"about_ca_system_score_gemma":0.00005131015,"threshold_uncertainty_score":0.8460805},"labels":[],"label_agreement":null},{"id":"W2124752818","doi":"10.1109/tc.2003.1159751","title":"General models and a reduction design technique for FPGA switch box designs","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Routing (electronic design automation); Reduction (mathematics); Field-programmable gate array; Set (abstract data type); Topology (electrical circuits); Embedded system; Mathematics; Combinatorics","score_opus":0.04322566978115681,"score_gpt":0.24254347381377225,"score_spread":0.19931780403261545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124752818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062147266,0.000059985516,0.9968259,0.000020327692,0.00048235717,0.0010182144,0.00000882249,0.0007984095,0.00016456532],"genre_scores_gemma":[0.5955901,0.00009187353,0.40372235,0.000028499822,0.000029508414,0.00045031382,9.475912e-7,0.000043388274,0.000042980468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991543,0.00005421,0.00019868443,0.00024721533,0.000091423,0.00025414856],"domain_scores_gemma":[0.9995928,0.000069618836,0.000020611958,0.00019169445,0.000037353035,0.00008795088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020395467,0.00021185545,0.00018057867,0.00020860488,0.00014045453,0.000046357214,0.00008630566,0.00014664908,0.0000055102055],"category_scores_gemma":[9.083511e-7,0.00022977647,0.00008443723,0.00016305558,0.000031945747,0.00020678135,3.5296068e-7,0.0001742342,0.0000019311462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025315181,0.000053333704,1.0008504e-7,0.000033580363,0.00005703897,0.0000019492422,0.00018150064,0.8357038,0.12998451,0.00033559318,0.0020795113,0.031543773],"study_design_scores_gemma":[0.00027026076,0.00018924089,3.515603e-7,0.000034509067,0.000027412701,0.000068776186,0.00001102993,0.3072862,0.6887971,0.0028482755,0.000226985,0.00023983723],"about_ca_topic_score_codex":0.0000058899977,"about_ca_topic_score_gemma":7.349277e-7,"teacher_disagreement_score":0.5949687,"about_ca_system_score_codex":0.000087844805,"about_ca_system_score_gemma":0.000021246788,"threshold_uncertainty_score":0.9370013},"labels":[],"label_agreement":null},{"id":"W2127977400","doi":"10.1109/tc.2006.152","title":"Relationship between GF(2^m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Trinomial; GF(2); Polynomial basis; Mathematics; Multiplier (economics); Multiplication algorithm; Multiplication (music); Matrix multiplication; Primitive polynomial; Arithmetic; Algorithm; Finite field; Basis (linear algebra); Discrete mathematics; Combinatorics; Binary number","score_opus":0.01905342482322375,"score_gpt":0.23340013779788626,"score_spread":0.2143467129746625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127977400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113354154,0.00005889687,0.88454944,0.0009521523,0.0004934742,0.00020730522,0.000014876953,0.0002830796,0.00008659762],"genre_scores_gemma":[0.9158638,0.0000063924176,0.083827764,0.00009447579,0.000117544936,0.000026182694,0.0000056919907,0.000013315328,0.00004480159],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99859554,0.00009619833,0.00030566595,0.00049495354,0.00023842136,0.000269227],"domain_scores_gemma":[0.9987165,0.0005996539,0.00008108385,0.00044261722,0.00004331752,0.00011686894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015352182,0.00019785535,0.00018286916,0.00044738653,0.0004296935,0.0001715569,0.00035355816,0.00012454379,0.0000026627306],"category_scores_gemma":[0.0000023309294,0.0002014758,0.00013240107,0.0007478119,0.00010293275,0.0003962863,0.000005243323,0.00026467358,0.000022256703],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006598299,0.00090179045,0.051504217,0.00007159902,0.00020306416,0.000030351839,0.001244868,0.043176167,0.000738601,0.0053849723,0.0023472726,0.8943311],"study_design_scores_gemma":[0.0018391248,0.00023676372,0.8049464,0.000058825597,0.00008875893,0.000033414857,0.000024046469,0.1823902,0.0065546827,0.0023531555,0.0007534862,0.0007211412],"about_ca_topic_score_codex":0.00029202996,"about_ca_topic_score_gemma":0.000040877465,"teacher_disagreement_score":0.89361,"about_ca_system_score_codex":0.000045115306,"about_ca_system_score_gemma":0.000028647242,"threshold_uncertainty_score":0.82159454},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01719488378731872,"score_gpt":0.23907187753019768,"score_spread":0.22187699374287895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128504838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07881231,0.000025599233,0.9194635,0.00012590815,0.0009957638,0.00021617988,0.0000035473147,0.00020221941,0.00015496569],"genre_scores_gemma":[0.77106774,0.000013349696,0.22859095,0.0002264755,0.000028985973,0.000021877502,5.8730825e-7,0.000012427599,0.00003760687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863064,0.00009919355,0.00023598204,0.00045143804,0.00025897473,0.00032374676],"domain_scores_gemma":[0.99918526,0.00006866155,0.00007066441,0.0004594897,0.000078969046,0.00013695596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013734054,0.0001936649,0.00015000452,0.00033293996,0.0003899015,0.00015258358,0.00045282155,0.000080111895,0.0000116783995],"category_scores_gemma":[0.0000018249619,0.0001911244,0.00016266765,0.0009001385,0.00006488684,0.00045977614,0.0000026366922,0.00020129296,0.0000246763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019930707,0.00065610977,0.00014741755,0.00003750972,0.0001018725,0.000018315219,0.0014692721,0.7516319,0.006329118,0.0033035283,0.00009566364,0.23618937],"study_design_scores_gemma":[0.0009367748,0.00015247265,0.00046308382,0.000050931572,0.000036176625,0.000121841134,0.000044415974,0.8845976,0.11200637,0.00029135888,0.00079831947,0.00050063175],"about_ca_topic_score_codex":0.00003755079,"about_ca_topic_score_gemma":0.000012392057,"teacher_disagreement_score":0.69225544,"about_ca_system_score_codex":0.000053009648,"about_ca_system_score_gemma":0.0000683225,"threshold_uncertainty_score":0.77938265},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03693312533703984,"score_gpt":0.2647202868880352,"score_spread":0.22778716155099532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132451830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121358514,0.0000044816647,0.87621456,0.00019291912,0.001398716,0.0005132588,0.000043300413,0.00021447771,0.000059794],"genre_scores_gemma":[0.9901597,0.000013630639,0.009332636,0.00022281017,0.000040439863,0.000170495,0.000012495957,0.000012382819,0.000035415676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984532,0.00006839837,0.00031997054,0.00050815044,0.00032423926,0.00032607085],"domain_scores_gemma":[0.9990657,0.00008296525,0.000086055006,0.0005133583,0.00013309573,0.000118805205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011491461,0.00020428047,0.00026106596,0.000702637,0.00072821596,0.00011864252,0.00040273825,0.00007779298,0.000031898726],"category_scores_gemma":[0.0000013000274,0.00021059274,0.00055692275,0.0013462611,0.00006460789,0.0002916643,0.0000036315632,0.00018058132,0.000008843189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036016433,0.004990178,0.0014988006,0.00014889486,0.010642158,0.00009524673,0.023480946,0.30027324,0.008595368,0.010955006,0.0068020285,0.632158],"study_design_scores_gemma":[0.0036236073,0.0010355486,0.012391881,0.000031766507,0.0005247583,0.00005519,0.00012683492,0.96722096,0.008134481,0.0005684361,0.0050833663,0.0012031804],"about_ca_topic_score_codex":0.000084643536,"about_ca_topic_score_gemma":0.00009965655,"teacher_disagreement_score":0.8688012,"about_ca_system_score_codex":0.00008120628,"about_ca_system_score_gemma":0.00005734929,"threshold_uncertainty_score":0.8587723},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013942774073868616,"score_gpt":0.2435503478042002,"score_spread":0.22960757373033158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132902317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111354396,0.000012317666,0.88559616,0.0003156275,0.0017298557,0.00016804785,0.0000052214414,0.00025438995,0.00056399516],"genre_scores_gemma":[0.98584,0.00001546102,0.011541988,0.0024476638,0.00004316823,0.000007746807,0.0000010256762,0.00001403099,0.00008886871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985981,0.00006454291,0.00023804841,0.00045658427,0.00025965687,0.00038306997],"domain_scores_gemma":[0.9988373,0.00035416146,0.000062251165,0.00052021997,0.000034098688,0.00019195765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034080597,0.00023161729,0.00018234058,0.0003628872,0.0003954845,0.00014574775,0.00054596603,0.00008084105,0.000009220879],"category_scores_gemma":[7.820655e-7,0.00022820964,0.00014097024,0.00044332058,0.00007888241,0.0003202352,0.000007983513,0.00028175503,0.00004040516],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032335144,0.000996636,0.00015553086,0.000037174214,0.00020934595,0.000110802765,0.0032832848,0.0065885247,0.00082945457,0.020001044,0.001975232,0.9654896],"study_design_scores_gemma":[0.035163105,0.022297762,0.045967504,0.0029976415,0.00060446374,0.0015367083,0.0012296368,0.5226148,0.20856673,0.049631234,0.096862614,0.012527828],"about_ca_topic_score_codex":0.000008085588,"about_ca_topic_score_gemma":0.000018459292,"teacher_disagreement_score":0.9529618,"about_ca_system_score_codex":0.000047788508,"about_ca_system_score_gemma":0.000014968977,"threshold_uncertainty_score":0.9306119},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Field-programmable gate array; Virtex; Embedded system; Network on a chip; Computer architecture; Routing (electronic design automation); Network packet; Parallel computing; Computer network","score_opus":0.028082194922674473,"score_gpt":0.27110447984074343,"score_spread":0.24302228491806896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135218079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024237544,0.000014296751,0.99012935,0.0005026128,0.0057059205,0.00061977364,0.0000061737355,0.0003226787,0.00027545096],"genre_scores_gemma":[0.96916133,0.0000012298227,0.029345449,0.00064968783,0.00043147858,0.00012040275,0.0000020950677,0.000018913932,0.0002693885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986783,0.00008097638,0.0002452101,0.0003334566,0.00022074241,0.00044129055],"domain_scores_gemma":[0.9989221,0.00036163646,0.00007704401,0.0004216984,0.00007145671,0.0001460843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026365067,0.00019339689,0.00017812986,0.00019222508,0.00031399104,0.00016600623,0.0003283022,0.000093438925,0.000007979108],"category_scores_gemma":[0.0000023110497,0.0001730426,0.00019731875,0.00028713845,0.000023930386,0.000338059,0.0000021092637,0.0002048273,0.00006429738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036551563,0.00016670556,0.000003287031,0.000011970585,0.000032182834,5.516436e-7,0.00056164106,0.8351038,0.000031384774,0.0014321819,0.0007995877,0.16182014],"study_design_scores_gemma":[0.0005346225,0.0004725366,0.000018569937,0.00006463742,0.0000105752915,0.000016059914,0.000012739436,0.95760185,0.001263428,0.00019795983,0.039581254,0.00022574108],"about_ca_topic_score_codex":0.000012253866,"about_ca_topic_score_gemma":0.00001186488,"teacher_disagreement_score":0.9667376,"about_ca_system_score_codex":0.00008162081,"about_ca_system_score_gemma":0.000020668955,"threshold_uncertainty_score":0.70564723},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","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","score_opus":0.009825076464437171,"score_gpt":0.22416966409986805,"score_spread":0.21434458763543088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136484227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17128803,0.00010147446,0.8270371,0.00068372523,0.0005121563,0.0001673141,0.0000020783323,0.00016380167,0.00004434826],"genre_scores_gemma":[0.94239736,0.00014163338,0.056947324,0.00042887186,0.000052444728,0.000009759497,6.3498754e-7,0.000007162519,0.000014807293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989145,0.00004245723,0.00019374934,0.00045274728,0.00016735744,0.0002291912],"domain_scores_gemma":[0.9993458,0.000106344894,0.000050599025,0.00033837726,0.000025981399,0.0001329361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009690155,0.00017404901,0.00016102944,0.00028987176,0.00027724935,0.00020011164,0.0002379209,0.00008160526,0.0000023919215],"category_scores_gemma":[0.0000010214247,0.00016804386,0.000076438606,0.0003625466,0.00007034235,0.0004059741,0.000004601361,0.00017658895,0.000004933606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010343908,0.000458136,0.000223312,0.000029598687,0.00009188295,0.000020036186,0.0017931118,0.04473786,0.0075018425,0.004065007,0.0002728239,0.940703],"study_design_scores_gemma":[0.00392195,0.0009306147,0.07525023,0.00014730793,0.000063998945,0.00013035737,0.000048909773,0.9072695,0.0068533733,0.0034945891,0.00093833724,0.0009508816],"about_ca_topic_score_codex":0.00005973,"about_ca_topic_score_gemma":0.000019154708,"teacher_disagreement_score":0.93975204,"about_ca_system_score_codex":0.000018534716,"about_ca_system_score_gemma":0.000015165755,"threshold_uncertainty_score":0.685263},"labels":[],"label_agreement":null},{"id":"W2139324515","doi":"10.1109/tc.2010.84","title":"Generating Reliable Code from Hybrid-Systems Models","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Automaton; Code generation; Hybrid system; Code (set theory); Distributed computing; Formalism (music); Set (abstract data type); Programming language; Theoretical computer science","score_opus":0.03588080040127277,"score_gpt":0.2650586328657621,"score_spread":0.2291778324644893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139324515","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02548334,0.000015805148,0.9623648,0.00013216402,0.010968987,0.00021637726,0.000027808766,0.00048731535,0.00030340918],"genre_scores_gemma":[0.43401796,0.0000063734014,0.5655388,0.00020271582,0.000114814786,0.00003147698,0.0000020198627,0.000014471524,0.000071323644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983421,0.00009749853,0.00036003254,0.00055534596,0.00034049468,0.0003045145],"domain_scores_gemma":[0.99840415,0.00019832389,0.00011857408,0.0010383852,0.00009840796,0.0001421401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003678263,0.00020264609,0.00019867107,0.0001525374,0.00033394236,0.00034347564,0.0009712084,0.00009531915,0.000010711874],"category_scores_gemma":[0.000004785864,0.00021029539,0.0000964748,0.00027497674,0.000049994327,0.0009628983,0.0000059374365,0.00052097475,0.00008766868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005594651,0.00006997589,0.0000011699221,0.0000047296376,0.00002201907,0.000004510629,0.00024045246,0.93333334,0.010243253,0.0047614793,0.0005254314,0.050788052],"study_design_scores_gemma":[0.00023218639,0.000047978418,0.000004768543,0.00002280227,0.000007659359,0.000021393607,0.000008272971,0.9604964,0.036892302,0.000718019,0.0013262619,0.00022195849],"about_ca_topic_score_codex":0.0002916996,"about_ca_topic_score_gemma":0.00002257986,"teacher_disagreement_score":0.40853462,"about_ca_system_score_codex":0.00005695426,"about_ca_system_score_gemma":0.00006235371,"threshold_uncertainty_score":0.8575597},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Downtime; Operating system; Soft error; Software; Embedded system; Commodity; Transient (computer programming); Microprocessor; Real-time computing; Engineering","score_opus":0.008619772076645379,"score_gpt":0.21479039854252333,"score_spread":0.20617062646587794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140631135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3379031,0.000044866258,0.6605575,0.000028842196,0.0009766273,0.00021792194,0.000023643526,0.00023483104,0.000012651305],"genre_scores_gemma":[0.99522483,0.000007288333,0.0046517625,0.00004226965,0.00002444248,0.000017697617,0.0000014836373,0.000024438015,0.000005797348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992408,0.000033989105,0.00020608198,0.00017646671,0.00014708424,0.00019554053],"domain_scores_gemma":[0.9994106,0.00014636293,0.000023451475,0.0002820173,0.000032788972,0.00010476567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001291556,0.00014259735,0.00019833817,0.00013064677,0.00006766727,0.000017312668,0.000119609875,0.00007192078,0.0000037285563],"category_scores_gemma":[0.0000038149497,0.00016028868,0.00005569383,0.00019562266,0.00004569182,0.00008951634,8.880743e-7,0.00019527058,0.000010796968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008851017,0.000043538977,0.000011037583,0.000101267535,0.00003970624,9.3827316e-7,0.00032734402,0.9849416,0.0003976197,0.000015301346,0.000106302585,0.014006501],"study_design_scores_gemma":[0.0015576521,0.00061273016,0.0013702565,0.0002333758,0.000067024615,0.000032241034,0.00011421358,0.9637818,0.03114571,0.0001341329,0.00034406915,0.0006068411],"about_ca_topic_score_codex":0.00009455114,"about_ca_topic_score_gemma":0.00020240957,"teacher_disagreement_score":0.6573217,"about_ca_system_score_codex":0.00025513314,"about_ca_system_score_gemma":0.000028849085,"threshold_uncertainty_score":0.6536383},"labels":[],"label_agreement":null},{"id":"W2144397004","doi":"10.1109/tc.2010.266","title":"Computational Vector-Magnitude-Based Range Determination for Scientific Abstract Data Types","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Computational complexity theory; Scalar (mathematics); Range (aeronautics); Key (lock); Modulo; Theoretical computer science; Satisfiability; Computational science; Block (permutation group theory); Algorithm; Computer engineering; Mathematics","score_opus":0.055371385950592815,"score_gpt":0.32539545675151266,"score_spread":0.27002407080091984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144397004","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025977364,0.0000057901925,0.98981196,0.00083381607,0.0060760733,0.00032351248,0.000112001166,0.00021211704,0.000026981546],"genre_scores_gemma":[0.38054964,3.1790944e-7,0.6190776,0.00020805765,0.000081103826,0.000023851402,0.000022084338,0.000011267618,0.000026075262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839175,0.000047183876,0.00025604139,0.00067901745,0.00035606473,0.00026996955],"domain_scores_gemma":[0.99786824,0.0008861691,0.00009291153,0.00083393604,0.00018376563,0.00013494873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054969836,0.00017607241,0.00017056361,0.00022656373,0.000453961,0.00047269036,0.0012731226,0.000075201446,0.00002622517],"category_scores_gemma":[0.000016803277,0.00016931871,0.00010592538,0.00041577162,0.00012827497,0.0005816038,0.000008517954,0.000271763,0.0000393957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017141598,0.00030573472,0.0000045126694,0.000021067975,0.000019025401,0.0000043061627,0.000057069312,0.04142708,0.0014203254,0.00052126637,0.00038536944,0.9558171],"study_design_scores_gemma":[0.0006253373,0.00010873545,0.00047604917,0.000018276085,0.000014190474,0.0000062983618,0.000002135779,0.9920312,0.0027836603,0.000999774,0.0027169187,0.0002174292],"about_ca_topic_score_codex":0.000012009963,"about_ca_topic_score_gemma":0.000022437905,"teacher_disagreement_score":0.95559967,"about_ca_system_score_codex":0.000026862932,"about_ca_system_score_gemma":0.00013396163,"threshold_uncertainty_score":0.69046164},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01577423187320397,"score_gpt":0.2544011287992291,"score_spread":0.23862689692602512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144693841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034409545,0.00026148534,0.96099037,0.002763771,0.00067876256,0.00048519988,0.0000049440446,0.0002112592,0.00019466295],"genre_scores_gemma":[0.9815542,0.00017259103,0.017554803,0.00045157847,0.000059823564,0.00011098137,5.3969495e-7,0.000013877464,0.00008159296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985382,0.000117662894,0.00027305415,0.0004628387,0.00028750318,0.00032071603],"domain_scores_gemma":[0.9983271,0.0006796889,0.000057854908,0.00065085624,0.00007309889,0.0002114099],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00020238922,0.00020767584,0.00018954733,0.00021723086,0.0014473182,0.00014149076,0.000779069,0.000066792825,0.0000022694296],"category_scores_gemma":[0.0000039057218,0.00014718328,0.00011789495,0.00096562185,0.00014229807,0.00017845734,0.000011204453,0.00027655988,0.00005485378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020159906,0.0015608707,0.00086488895,0.000074340256,0.0005551898,0.00007897415,0.012871295,0.2087567,0.0018527781,0.10194374,0.012373819,0.6588658],"study_design_scores_gemma":[0.0043702098,0.0017332083,0.056775913,0.0002670938,0.00014163989,0.0014441817,0.0005114465,0.8163079,0.032942526,0.017986502,0.06433866,0.0031807371],"about_ca_topic_score_codex":0.000017819935,"about_ca_topic_score_gemma":0.00009986531,"teacher_disagreement_score":0.9471447,"about_ca_system_score_codex":0.00002695848,"about_ca_system_score_gemma":0.000041414118,"threshold_uncertainty_score":0.99985266},"labels":[],"label_agreement":null},{"id":"W2145315554","doi":"10.1109/tc.2013.2297306","title":"QoS-Based Composition of Service Specific Overlay Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Quality of service; Overlay; Service (business); Overlay network; Distributed computing; Mobile QoS; Component (thermodynamics); Service composition; Composition (language); Service discovery; Fuzzy logic; Computer network; Scheme (mathematics); Service delivery framework; Web service; Artificial intelligence; World Wide Web; The Internet; Programming language","score_opus":0.008468857189845953,"score_gpt":0.20416763378591066,"score_spread":0.19569877659606472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145315554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009741952,0.000024343115,0.98500305,0.0016160535,0.002769242,0.00018273189,0.0000059565637,0.00028973474,0.0003669572],"genre_scores_gemma":[0.9418544,0.0000067990863,0.05159416,0.0063393693,0.00016322218,0.0000113879605,0.0000076254237,0.000019110736,0.000003910175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983644,0.0001317633,0.00034535074,0.00048409312,0.0003581907,0.00031619493],"domain_scores_gemma":[0.9984038,0.00036206038,0.0001456519,0.0008069836,0.00014374172,0.00013774887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017236685,0.00024855285,0.00027245932,0.0002693573,0.00019726164,0.00009178071,0.0009555366,0.00010069476,0.00001828978],"category_scores_gemma":[1.5894479e-7,0.00024357522,0.0001599141,0.00092640973,0.000037014943,0.0002529404,0.000006614358,0.00026736662,0.000039992083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049215796,0.00023494402,0.00000743562,0.000042719268,0.000035015753,0.0000024295377,0.000381815,0.9440274,0.0014259227,0.0017427778,0.00018410891,0.051866192],"study_design_scores_gemma":[0.00085552374,0.00026549323,0.00030645556,0.00014408736,0.000017392098,0.00000909316,0.0000112187445,0.9712603,0.02387845,0.00013067167,0.002843676,0.00027763646],"about_ca_topic_score_codex":0.0001033419,"about_ca_topic_score_gemma":0.00007753744,"teacher_disagreement_score":0.93340886,"about_ca_system_score_codex":0.000036820176,"about_ca_system_score_gemma":0.0000298834,"threshold_uncertainty_score":0.99327093},"labels":[],"label_agreement":null},{"id":"W2147835010","doi":"10.1109/tc.2012.201","title":"Holistic Routing Algorithm Design to Support Workload Consolidation in NoCs","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Workload; Distributed computing; Routing (electronic design automation); Consolidation (business); Computer network; Network congestion","score_opus":0.06089908564678301,"score_gpt":0.28574219896270053,"score_spread":0.22484311331591753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147835010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010994199,0.0000105409945,0.99123806,0.00020871087,0.006680748,0.00035737795,0.0000026985363,0.00018700531,0.00021544904],"genre_scores_gemma":[0.8924613,0.0000037132265,0.10641962,0.0007454084,0.00019568233,0.000050378807,7.292583e-7,0.00001360916,0.000109526416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830484,0.0002032419,0.0003953758,0.00034460286,0.00024137672,0.00051054877],"domain_scores_gemma":[0.999,0.0002898533,0.00007444749,0.0003652492,0.00006155644,0.00020887771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065546535,0.00018984948,0.00021711703,0.00035773925,0.0001700546,0.00017280046,0.00040317304,0.000089483096,0.000022506527],"category_scores_gemma":[0.000004114948,0.0001983759,0.00008504326,0.00070550287,0.000018925748,0.0005737756,0.000005037048,0.00024001405,0.00026783548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016284932,0.00021599767,0.000042518117,0.0000052636237,0.000027537088,0.0000123725495,0.0025281156,0.34400687,0.000090115806,0.00055761676,0.001392202,0.6511051],"study_design_scores_gemma":[0.0005191675,0.00026946486,0.00023011085,0.00015822808,0.000008735456,0.00008922928,0.00009904791,0.9944957,0.002892197,0.00004006719,0.00083216524,0.00036587624],"about_ca_topic_score_codex":0.00006445733,"about_ca_topic_score_gemma":0.000015958622,"teacher_disagreement_score":0.8913619,"about_ca_system_score_codex":0.00019587607,"about_ca_system_score_gemma":0.000046338682,"threshold_uncertainty_score":0.8089534},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Finite field; Finite field arithmetic; Arithmetic; Field (mathematics); Algorithm; Mathematics; Cryptography; Discrete mathematics","score_opus":0.0182988739172879,"score_gpt":0.26326360060462123,"score_spread":0.24496472668733332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149110203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14325616,0.000077763594,0.8549391,0.00061610126,0.00075981,0.00022010655,0.0000021962821,0.0001160559,0.000012694553],"genre_scores_gemma":[0.97683275,0.000019409188,0.022508861,0.0005850157,0.000033338765,0.00001022782,3.5311763e-7,0.000006414165,0.00000365642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987857,0.00010951154,0.0002758252,0.00039588835,0.00017620236,0.0002569004],"domain_scores_gemma":[0.9993069,0.00023918526,0.000034592736,0.00027823428,0.000036317648,0.000104782484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011927395,0.00018572119,0.00019071034,0.00065780804,0.00026706012,0.00015779622,0.00025868457,0.00008338489,0.0000022766646],"category_scores_gemma":[0.000006491963,0.00017806752,0.00009459082,0.00072240666,0.000047379686,0.00015303702,0.0000032181479,0.00033438197,0.0000029448875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009064168,0.00016529951,0.00000912088,0.000010310793,0.00001422052,0.00001322947,0.0006277355,0.5875343,0.0012929771,0.00021975147,0.0000032289506,0.41010076],"study_design_scores_gemma":[0.0005950738,0.0003554713,0.00066095806,0.0000964847,0.000016508293,0.000072588344,0.000021935417,0.9866518,0.011002447,0.00028928643,0.000021131522,0.00021633926],"about_ca_topic_score_codex":0.00013128111,"about_ca_topic_score_gemma":0.00029378184,"teacher_disagreement_score":0.83357656,"about_ca_system_score_codex":0.000041626477,"about_ca_system_score_gemma":0.00003899715,"threshold_uncertainty_score":0.7261383},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.021331262807773324,"score_gpt":0.2522161742658325,"score_spread":0.23088491145805917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149204794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062332217,0.00001814767,0.9340206,0.0016454543,0.0010752253,0.0005410055,0.000035110097,0.00030378503,0.000028481056],"genre_scores_gemma":[0.7646026,0.000006126675,0.23458116,0.0006243513,0.000081368475,0.000077250945,0.0000029738221,0.000014463226,0.00000969774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848187,0.00004993699,0.0002762181,0.0005683577,0.00025011922,0.00037352336],"domain_scores_gemma":[0.9988847,0.00022594977,0.00008332726,0.0005945611,0.00005617458,0.00015533376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111811285,0.00024320018,0.0002169571,0.0003503959,0.00045568348,0.00013973602,0.00068640447,0.00010030351,0.000007645794],"category_scores_gemma":[0.0000022563102,0.0002311176,0.0003470175,0.0004759012,0.00015907513,0.00012020208,0.0000059231807,0.00022726349,0.000019102428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012120311,0.0007048628,0.000020306905,0.000043952434,0.00009976063,0.000004598626,0.00083887693,0.86386764,0.0009770012,0.0020758165,0.0003674298,0.13087857],"study_design_scores_gemma":[0.012431855,0.0014754588,0.017642092,0.0002783984,0.0001252487,0.00010149123,0.000044601038,0.8355883,0.10947174,0.019311912,0.0017117688,0.001817185],"about_ca_topic_score_codex":0.00018199977,"about_ca_topic_score_gemma":0.00015855064,"teacher_disagreement_score":0.7022704,"about_ca_system_score_codex":0.00008121479,"about_ca_system_score_gemma":0.00006851986,"threshold_uncertainty_score":0.94247025},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","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","score_opus":0.011887130865366951,"score_gpt":0.2762625963288175,"score_spread":0.26437546546345053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149767240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06200809,0.000013997847,0.9298062,0.00045135297,0.006837851,0.0006397559,0.00007008525,0.0001670655,0.0000056454187],"genre_scores_gemma":[0.9729315,0.000019233985,0.026666375,0.00017344313,0.00008105026,0.00010832793,0.0000039338383,0.000010804162,0.0000053049066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987008,0.00003633432,0.00026150353,0.00038817222,0.00034180278,0.000271416],"domain_scores_gemma":[0.99891496,0.00028217759,0.000098732315,0.0004610413,0.0001602602,0.00008284719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019198646,0.00018292494,0.00013643308,0.00016778111,0.00073340314,0.00022674313,0.0005069165,0.00007467368,0.000031445757],"category_scores_gemma":[0.000003945656,0.00014471528,0.00017530029,0.00034039284,0.00007158236,0.00036092522,0.0000045393317,0.0003930586,0.0000036463998],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024956615,0.000052724743,0.0000034655252,0.000008210656,0.000049302387,4.8699945e-7,0.0004423056,0.006938478,0.013010212,0.004176485,0.00005777806,0.9752356],"study_design_scores_gemma":[0.003351734,0.0006628874,0.00041028715,0.000025098172,0.0000717879,0.000044462617,0.00024563976,0.7306473,0.22148831,0.0022251983,0.040253505,0.00057376246],"about_ca_topic_score_codex":0.0000207056,"about_ca_topic_score_gemma":0.0005590139,"teacher_disagreement_score":0.9746618,"about_ca_system_score_codex":0.000054415574,"about_ca_system_score_gemma":0.000053724343,"threshold_uncertainty_score":0.59013176},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computational complexity theory; Polynomial basis; Multiplier (economics); Mathematics; Discrete mathematics; Matrix multiplication; Toeplitz matrix; Polynomial; Time complexity; Computer science; Algorithm; Combinatorics; Pure mathematics","score_opus":0.04373998678267655,"score_gpt":0.27502531965156407,"score_spread":0.23128533286888753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150782829","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021462943,0.000009058229,0.9936925,0.0009750921,0.0013722613,0.0006646953,0.0000052230616,0.00038358875,0.0007512775],"genre_scores_gemma":[0.47153068,0.0000013439252,0.5274986,0.00072591705,0.000051197654,0.000026934902,0.0000012436242,0.000011340667,0.00015272305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983097,0.00006125647,0.00027885588,0.0006175807,0.00023911176,0.00049353245],"domain_scores_gemma":[0.99838907,0.0004439926,0.00005933218,0.0006852931,0.000052304324,0.00037004062],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004612218,0.00025084382,0.0002463534,0.00039489492,0.00037818064,0.00013380265,0.00087478687,0.00010430113,0.000010647627],"category_scores_gemma":[0.000003807218,0.00025871964,0.00028157287,0.0007663849,0.000062124396,0.00023208569,0.000008217944,0.00023638035,0.00003350631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011026172,0.0015590824,0.000009620414,0.00009952225,0.00028082737,0.000021914862,0.007334784,0.33922836,0.0009034115,0.17947987,0.0136118205,0.45636818],"study_design_scores_gemma":[0.0045797722,0.0019981617,0.000897723,0.00013549378,0.0000858431,0.00007113809,0.0003861075,0.9436241,0.006543038,0.034095228,0.00597942,0.0016039773],"about_ca_topic_score_codex":0.00003738487,"about_ca_topic_score_gemma":0.000034951783,"teacher_disagreement_score":0.60439575,"about_ca_system_score_codex":0.000058114627,"about_ca_system_score_gemma":0.000059529684,"threshold_uncertainty_score":0.9999865},"labels":[],"label_agreement":null},{"id":"W2151662465","doi":"10.1109/tc.2012.197","title":"Parallel Simulation of Pore Networks Using Multicore CPUs","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Computer science; Multi-core processor; Parallel computing; Set (abstract data type); Monte Carlo method; Speedup; Algorithm; Distributed computing; Mathematics","score_opus":0.0380393125837284,"score_gpt":0.28851626510685646,"score_spread":0.25047695252312807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151662465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037020475,0.00005254641,0.99444723,0.000036724305,0.0010843045,0.00017853583,0.0000016907883,0.00041787073,0.00007903698],"genre_scores_gemma":[0.66323125,0.000008276788,0.33657297,0.000110115296,0.000048785176,0.0000031491054,0.000001291546,0.000010171077,0.000013973444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987849,0.000094015835,0.00033291793,0.00024581578,0.00022100005,0.0003213768],"domain_scores_gemma":[0.9989802,0.00020857458,0.00015987118,0.00043045986,0.00009827439,0.00012257871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020198242,0.00017693374,0.00020646414,0.00021711377,0.0001724969,0.00004694789,0.00041859588,0.00010433912,0.0000051753527],"category_scores_gemma":[0.000002661684,0.00018083196,0.00012914972,0.00043501993,0.000046185192,0.00046315882,0.00000651348,0.00018030201,0.000004081745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009523034,0.00014272203,0.00005214337,0.000005727955,0.0000219405,9.575948e-7,0.00028474058,0.97491294,0.00003016091,0.00018545044,0.000060415092,0.024293266],"study_design_scores_gemma":[0.00028194222,0.00005947683,0.00010549913,0.000046806726,0.000012808177,0.000010175151,0.0000058257324,0.99803644,0.0011541733,0.000037388574,0.00006801537,0.00018143826],"about_ca_topic_score_codex":0.000018884642,"about_ca_topic_score_gemma":6.3004103e-7,"teacher_disagreement_score":0.6595292,"about_ca_system_score_codex":0.000060115846,"about_ca_system_score_gemma":0.000026165037,"threshold_uncertainty_score":0.7374114},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.021107610935111924,"score_gpt":0.26267279027639334,"score_spread":0.2415651793412814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151770284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010506687,0.000010222232,0.9856167,0.001797205,0.0011954581,0.00030008395,0.000010434216,0.0004255249,0.00013771153],"genre_scores_gemma":[0.9171664,0.000004867813,0.081275314,0.0012751098,0.00007648014,0.000048159556,0.000009751653,0.000016466116,0.00012744381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833643,0.00005922876,0.00036649223,0.0005037381,0.00038214398,0.00035195905],"domain_scores_gemma":[0.9990382,0.00024978266,0.00010262351,0.00033536376,0.000098745455,0.00017528208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008924396,0.0002229225,0.00017414398,0.00019415215,0.00044116692,0.00020392412,0.0006139827,0.00004989659,0.00002798561],"category_scores_gemma":[8.361026e-7,0.00022949238,0.00012925056,0.0007250247,0.000058209524,0.00039141413,0.0000067173414,0.00024030574,0.00021993369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006829933,0.00014825835,0.000005025927,0.0000016514867,0.000022126127,0.000008158617,0.000046435656,0.85090035,0.000024862033,0.00085170235,0.0012563376,0.14672825],"study_design_scores_gemma":[0.00053602573,0.00010897819,0.00014419867,0.000016521759,0.000009543648,0.00007677597,0.000006066009,0.9972323,0.000042209955,0.0012025812,0.00039177,0.00023302909],"about_ca_topic_score_codex":0.000010097303,"about_ca_topic_score_gemma":0.0000053841745,"teacher_disagreement_score":0.9066597,"about_ca_system_score_codex":0.0000660336,"about_ca_system_score_gemma":0.000037556125,"threshold_uncertainty_score":0.93584275},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01753760132844699,"score_gpt":0.21251788692109483,"score_spread":0.19498028559264785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152005431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068342397,0.000011556862,0.9854761,0.0046963375,0.0008038623,0.0003636419,0.00000868964,0.0008025006,0.0010030781],"genre_scores_gemma":[0.9526874,0.000016256241,0.044431414,0.00172113,0.0000681624,0.000086200555,0.0000010774523,0.000017742725,0.00097063906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982569,0.00020965704,0.00025632489,0.00046287518,0.00034463927,0.0004696067],"domain_scores_gemma":[0.99885297,0.00020750458,0.00004819894,0.0006879341,0.000043836586,0.00015958532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042514666,0.00020694864,0.00017928408,0.00011157695,0.0008608213,0.00028222625,0.0010355663,0.000057967754,0.000115638264],"category_scores_gemma":[0.0000020283455,0.00016240025,0.00012226922,0.00058814936,0.00006335358,0.00029713794,0.000008626394,0.00036873773,0.00067072775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007547553,0.00016481495,0.0000015661767,0.0000035804867,0.000038475922,0.000005360863,0.0013035419,0.4656299,0.00023794209,0.0015410727,0.0030762167,0.52799],"study_design_scores_gemma":[0.0006023038,0.00045558112,0.00022438895,0.000105460575,0.00002569651,0.00011023316,0.00008130094,0.9340823,0.0019158582,0.00065737264,0.061256737,0.00048271113],"about_ca_topic_score_codex":0.00008757124,"about_ca_topic_score_gemma":0.000016910742,"teacher_disagreement_score":0.9458531,"about_ca_system_score_codex":0.000106251384,"about_ca_system_score_gemma":0.000044188466,"threshold_uncertainty_score":0.8621072},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02843785834086029,"score_gpt":0.21876276367784542,"score_spread":0.19032490533698512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152747729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3701888,0.000012354089,0.62900335,0.000038543247,0.00040964337,0.00014532998,0.0000036616318,0.00011061808,0.00008766903],"genre_scores_gemma":[0.9701143,0.0000067397314,0.029756645,0.0000624812,0.000021119757,0.000011738873,6.882019e-8,0.000012497156,0.000014427069],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987722,0.000108791,0.00024509215,0.00045363992,0.0001729904,0.00024730165],"domain_scores_gemma":[0.9989436,0.0002974187,0.0000873402,0.0005129413,0.000048263,0.00011039586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016979317,0.0002086845,0.00027350895,0.00025220882,0.00020276403,0.00004767416,0.0006061679,0.00005215587,0.000008000492],"category_scores_gemma":[0.000002581925,0.00017618289,0.0000963902,0.00038880593,0.00006182439,0.0001648836,0.000013683865,0.00020243088,0.0000053735675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028750299,0.0018172493,0.000053236334,0.00003409913,0.00026873618,0.000050496084,0.036119,0.07183989,0.00038089085,0.00018805904,0.00009552218,0.8891241],"study_design_scores_gemma":[0.0014817341,0.0027578727,0.001944056,0.00023228594,0.00006920856,0.0001914268,0.0014266692,0.9477973,0.042998396,0.00028506643,0.00009375124,0.0007222288],"about_ca_topic_score_codex":0.000098093056,"about_ca_topic_score_gemma":0.000009687823,"teacher_disagreement_score":0.88840187,"about_ca_system_score_codex":0.000017341275,"about_ca_system_score_gemma":0.000031147665,"threshold_uncertainty_score":0.718453},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; 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","score_opus":0.040505280702170424,"score_gpt":0.27504136869582535,"score_spread":0.23453608799365494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154269166","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034593432,0.0000032056673,0.9936746,0.0006887506,0.00078805553,0.0009895649,0.000022460847,0.00028594022,0.00008812325],"genre_scores_gemma":[0.38124844,0.0000034643567,0.6178738,0.00027007255,0.0000606199,0.0004818891,0.0000022420045,0.0000148833315,0.000044601897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870527,0.000029355493,0.0002362272,0.00057510356,0.00019921098,0.00025480587],"domain_scores_gemma":[0.9984858,0.00035619643,0.00008626651,0.0006849802,0.00019486537,0.00019186828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030053666,0.00017961583,0.00014293635,0.00021803098,0.00041050816,0.00021452627,0.0006198596,0.00008633821,0.0000043989694],"category_scores_gemma":[0.00001566142,0.00017835069,0.00004821809,0.0005259128,0.000092107366,0.0004464276,0.0000043400355,0.00023031888,0.000023570281],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004392268,0.0005489401,0.00008464091,0.00008358625,0.000072799376,0.000001653598,0.0016696679,0.05896666,0.06729872,0.05003764,0.0006881975,0.8205036],"study_design_scores_gemma":[0.0018518982,0.0012618765,0.0018142059,0.00008706018,0.00009390889,0.00020701671,0.000060200608,0.75687176,0.20439109,0.0009885285,0.031113554,0.0012588956],"about_ca_topic_score_codex":0.000013531916,"about_ca_topic_score_gemma":0.000026654361,"teacher_disagreement_score":0.8192447,"about_ca_system_score_codex":0.0000465882,"about_ca_system_score_gemma":0.0000733396,"threshold_uncertainty_score":0.727293},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.021365074338475912,"score_gpt":0.24324589287024515,"score_spread":0.22188081853176922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160197556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040098797,0.000039412113,0.991817,0.00045195717,0.00058478385,0.000092608425,0.0000013393825,0.0026909197,0.000312097],"genre_scores_gemma":[0.7150267,0.000003952051,0.2847749,0.00013426764,0.000027359632,0.000008387994,1.6361055e-7,0.000005925484,0.000018395905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990833,0.000057218454,0.00021590918,0.00023725777,0.00022185525,0.00018449638],"domain_scores_gemma":[0.9989073,0.00047174966,0.0000916722,0.00044952214,0.00005392726,0.000025819207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002332699,0.000120937664,0.0001278822,0.00012353518,0.00022236608,0.00008805269,0.00072173175,0.00004024867,0.0000019452518],"category_scores_gemma":[0.0000034283703,0.00009124092,0.000098197226,0.00038486923,0.000091153415,0.00018231272,0.0000043400023,0.00016540712,0.0000042109855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001072086,0.00027364373,0.00012675353,0.000030934352,0.00006268505,0.000019608253,0.0016075053,0.6442675,0.0012327766,0.004339761,0.005367792,0.3426603],"study_design_scores_gemma":[0.00032258886,0.00024368004,0.00030814012,0.0002583339,0.000023748238,0.00007464711,0.000017225642,0.9018099,0.0851272,0.010998863,0.0004234641,0.00039223008],"about_ca_topic_score_codex":0.00031699322,"about_ca_topic_score_gemma":0.000008777031,"teacher_disagreement_score":0.7110168,"about_ca_system_score_codex":0.000032517724,"about_ca_system_score_gemma":0.00003605157,"threshold_uncertainty_score":0.3720697},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.009442735712164141,"score_gpt":0.21863528165083485,"score_spread":0.2091925459386707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164336166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035466928,0.000030592677,0.96194804,0.00025662145,0.0013298797,0.00018944994,0.000004497661,0.00024068977,0.00053332315],"genre_scores_gemma":[0.84682375,0.0000070865303,0.15276758,0.00031698824,0.000017752875,0.000024446164,6.1217315e-7,0.000009090732,0.000032656575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987028,0.00009568743,0.00021126386,0.00042592472,0.00026502513,0.00029926206],"domain_scores_gemma":[0.9990519,0.00018466875,0.00005200728,0.000517266,0.00005772362,0.00013640086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015582933,0.00017401755,0.00013097502,0.00028680608,0.00033317215,0.00011223003,0.00042014185,0.000062952844,0.000020975947],"category_scores_gemma":[0.000002255684,0.00016734032,0.00017119903,0.0006481221,0.000072266674,0.00012901283,0.000002481261,0.0001885463,0.00007430429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009584865,0.0004360114,0.000013133555,0.0000072768344,0.000034314377,0.000009370495,0.00037916837,0.93820935,0.00058364525,0.005249977,0.000167022,0.05490112],"study_design_scores_gemma":[0.00094776734,0.00024105761,0.00042545114,0.000030843014,0.000022789893,0.00007732134,0.000037955895,0.9501572,0.045725923,0.00012666607,0.0018034222,0.00040354795],"about_ca_topic_score_codex":0.000014046273,"about_ca_topic_score_gemma":0.0000041516155,"teacher_disagreement_score":0.81135684,"about_ca_system_score_codex":0.000036078156,"about_ca_system_score_gemma":0.000045368422,"threshold_uncertainty_score":0.682394},"labels":[],"label_agreement":null},{"id":"W2165139922","doi":"10.1109/tc.2010.122","title":"On Using Lossy Compression for Repeatable Experiments during Silicon Debug","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Debugging; Background debug mode interface; Lossy compression; Computer science; Embedded system; Field-programmable gate array; Window (computing); Computer hardware; Artificial intelligence; Operating system","score_opus":0.03219631837285147,"score_gpt":0.2810674653508984,"score_spread":0.2488711469780469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165139922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34809557,0.0000047989893,0.64951694,0.000042145602,0.0018481534,0.00017471892,0.0000041249223,0.00022519112,0.000088374436],"genre_scores_gemma":[0.97790164,0.0000011994887,0.02167049,0.00022235405,0.00009887788,0.000023786208,0.0000012088975,0.00002207296,0.000058359245],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985398,0.000035133522,0.00025328583,0.00055206835,0.0002353016,0.0003844125],"domain_scores_gemma":[0.9988735,0.00024440652,0.00008955926,0.00058933225,0.000060084374,0.00014314488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001221632,0.00021294178,0.00019220912,0.00020293359,0.0006674214,0.00018126854,0.0005568512,0.000087373715,0.000008441783],"category_scores_gemma":[0.0000057621237,0.00021246109,0.00013986748,0.00022872938,0.000037722584,0.00040744536,0.000006115159,0.00031824343,0.000016331984],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014935241,0.0005399845,0.000050850547,0.00005326816,0.00005726413,0.000025312092,0.0006730369,0.20325571,0.67764705,0.00081193546,0.00013587007,0.11673475],"study_design_scores_gemma":[0.00092916307,0.00014394322,0.00010695371,0.00017154738,0.000010375766,0.000046949634,0.000012111733,0.63854617,0.3594338,0.00022648454,0.000069318376,0.00030318534],"about_ca_topic_score_codex":0.000041299936,"about_ca_topic_score_gemma":0.0000061239116,"teacher_disagreement_score":0.6298061,"about_ca_system_score_codex":0.000062973755,"about_ca_system_score_gemma":0.000040450333,"threshold_uncertainty_score":0.8663912},"labels":[],"label_agreement":null},{"id":"W2166087899","doi":"10.1109/tc.2011.43","title":"Improved Decimal Floating-Point Logarithmic Converter Based on Selection by Rounding","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rounding; Retiming; Computer science; CORDIC; Logarithm; Parallel computing; Latency (audio); Floating point; Critical path method; Decimal; Adder; Standard cell; Field-programmable gate array; Arithmetic; Algorithm; Computer hardware; Mathematics; Integrated circuit","score_opus":0.024148604484967667,"score_gpt":0.24773158991262176,"score_spread":0.2235829854276541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166087899","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010878424,0.0000030657422,0.99525505,0.00024936502,0.0025752466,0.00023350793,0.00000592141,0.00037009784,0.0002199221],"genre_scores_gemma":[0.4835524,0.0000015951737,0.51510465,0.0012057823,0.000045289748,0.000019618676,7.434491e-7,0.000018343671,0.000051589497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822676,0.0001853244,0.00029861505,0.0006168751,0.00026210916,0.00041030804],"domain_scores_gemma":[0.9990025,0.00026614574,0.00009901116,0.00038372196,0.000065962915,0.00018263448],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027894846,0.0002652404,0.00023973906,0.00022009101,0.00029824357,0.00014382033,0.0005239508,0.00009968498,0.00005718499],"category_scores_gemma":[0.0000044290414,0.0002485051,0.00016955443,0.0004943115,0.00005467355,0.00037240938,0.0000040422324,0.00039202903,0.00004787792],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010622542,0.00083910633,0.000017154569,0.00001576413,0.00007023494,0.000013160204,0.0004981671,0.0065430384,0.010806789,0.00032019275,0.00065030705,0.9801199],"study_design_scores_gemma":[0.0006905424,0.0008742775,0.000051530067,0.00003689689,0.000011926039,0.000011899288,0.000009742839,0.9418124,0.05581037,0.00018144528,0.00021959265,0.0002893958],"about_ca_topic_score_codex":0.0001644674,"about_ca_topic_score_gemma":0.0000041980165,"teacher_disagreement_score":0.97983044,"about_ca_system_score_codex":0.00015463651,"about_ca_system_score_gemma":0.000051919767,"threshold_uncertainty_score":0.9999967},"labels":[],"label_agreement":null},{"id":"W2166667495","doi":"10.1109/tc.2007.70808","title":"Sharp Thresholds for Scheduling Recurring Tasks with Distance Constraints","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Dynamic priority scheduling; Scheduling (production processes); Fair-share scheduling; Rate-monotonic scheduling; Two-level scheduling; Job shop scheduling; Round-robin scheduling; Radar; Distributed computing; Fixed-priority pre-emptive scheduling; Mathematical optimization; Quality of service; Mathematics; Computer network","score_opus":0.02853944247007663,"score_gpt":0.24603274053938431,"score_spread":0.21749329806930767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166667495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021601858,0.000036860336,0.9751402,0.0002809877,0.0014566522,0.000603139,0.000016067399,0.00047013265,0.00039406592],"genre_scores_gemma":[0.67979425,0.000007992007,0.31983376,0.00014766924,0.000068251924,0.00007312007,0.0000013092189,0.000025973864,0.00004766586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977999,0.000057747555,0.0004106177,0.0007781467,0.00041210622,0.00054150395],"domain_scores_gemma":[0.9984344,0.0003078322,0.0001534432,0.0007420951,0.00015195471,0.00021024357],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025945524,0.00032102855,0.00034729508,0.00021739413,0.00063693384,0.00019565813,0.0008402927,0.00010305168,0.000007811415],"category_scores_gemma":[0.0000041875633,0.00030188914,0.00017462834,0.0004962663,0.000209973,0.0008078192,0.000005035727,0.00031594897,0.00003475244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014056142,0.00033111734,0.0002111246,0.00013162091,0.0002720583,0.00015871065,0.0025301748,0.8959425,0.001305519,0.0049847923,0.0002902266,0.0937016],"study_design_scores_gemma":[0.0024368877,0.0005440576,0.00014474183,0.00070067274,0.00003118398,0.0008945517,0.00010172553,0.9797473,0.013704335,0.00016429626,0.00062284915,0.0009074259],"about_ca_topic_score_codex":0.000023239389,"about_ca_topic_score_gemma":0.000015856662,"teacher_disagreement_score":0.6581924,"about_ca_system_score_codex":0.00013523808,"about_ca_system_score_gemma":0.00016518663,"threshold_uncertainty_score":0.9999433},"labels":[],"label_agreement":null},{"id":"W2167845685","doi":"10.1109/tc.2015.2401024","title":"Comments on “Low-Latency Digit-Serial Systolic Double Basis Multiplier over $GF(2^{m})$ Using Subquadratic Toeplitz Matrix-Vector Product Approach”","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Toeplitz matrix; Arithmetic; Matrix multiplication; Multiplier (economics); Computer science; Multiplication (music); Numerical digit; Latency (audio); Parallel computing; GF(2); Basis (linear algebra); Mathematics; Algorithm; Discrete mathematics; Combinatorics; Finite field; Pure mathematics; Telecommunications","score_opus":0.0468885360226933,"score_gpt":0.2719314946344938,"score_spread":0.2250429586118005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167845685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2071242,0.000017136907,0.7872656,0.00020225531,0.0040370603,0.0006093396,0.000015118698,0.00047446805,0.00025480206],"genre_scores_gemma":[0.9708427,0.0000033797292,0.028390765,0.0003495895,0.00022429942,0.00005836604,0.000004702773,0.00004219009,0.00008401767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971511,0.00022045779,0.0004794864,0.0009435542,0.0006113344,0.0005940819],"domain_scores_gemma":[0.9980093,0.00015074642,0.00016119724,0.0012133475,0.000110220746,0.00035515183],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038627672,0.00045835093,0.00043213408,0.00048041638,0.00044243233,0.0004569318,0.0010496321,0.00011843235,0.00001448896],"category_scores_gemma":[0.0000041740614,0.00043867182,0.0003084072,0.0010184321,0.00010648719,0.0007912538,0.000019331368,0.00039048606,0.000076879944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003049788,0.007602124,0.00026866762,0.00043456873,0.0010901716,0.000093513474,0.010065877,0.86976135,0.0048467745,0.021295706,0.0039467444,0.07754474],"study_design_scores_gemma":[0.010602465,0.0013620452,0.00029780678,0.0005324604,0.000202381,0.00013632109,0.00017248145,0.94783187,0.03370588,0.0015068743,0.0014827141,0.0021667168],"about_ca_topic_score_codex":0.00008605171,"about_ca_topic_score_gemma":0.00000571531,"teacher_disagreement_score":0.7637185,"about_ca_system_score_codex":0.00024124201,"about_ca_system_score_gemma":0.00012447956,"threshold_uncertainty_score":0.9998065},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","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","score_opus":0.02385932636325061,"score_gpt":0.2450125041940351,"score_spread":0.2211531778307845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168048374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09569234,0.000014904128,0.90222996,0.00013564773,0.0012669296,0.00049359153,0.0000118419675,0.000112198126,0.000042579606],"genre_scores_gemma":[0.9464377,0.000051115967,0.05277998,0.0005600979,0.000024894143,0.00012790799,0.0000019165657,0.000008977962,0.000007379135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989387,0.00004308946,0.00023388093,0.00036192976,0.00017027071,0.00025214997],"domain_scores_gemma":[0.9992078,0.00021346207,0.00007375167,0.00035019475,0.000072427574,0.00008238857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001671968,0.00017696289,0.00014201883,0.0001600486,0.0005794093,0.00011558237,0.00039174315,0.00006141705,0.0000125760025],"category_scores_gemma":[8.553371e-7,0.00014230581,0.00009982682,0.00032659725,0.00008700627,0.00034149358,0.00000797559,0.00021106281,0.0000035286225],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015451963,0.0007573702,0.00007356862,0.00009381214,0.00025983932,0.0000024572525,0.009016979,0.012512,0.0011606457,0.0033157622,0.0005132602,0.9721398],"study_design_scores_gemma":[0.0017659779,0.0010474527,0.0010803596,0.000034742396,0.000064297594,0.000033682194,0.00024613747,0.9158918,0.07837049,0.00015549808,0.000903488,0.00040606142],"about_ca_topic_score_codex":0.0001262737,"about_ca_topic_score_gemma":0.00006646025,"teacher_disagreement_score":0.97173375,"about_ca_system_score_codex":0.000027763675,"about_ca_system_score_gemma":0.000019411727,"threshold_uncertainty_score":0.58030623},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0246899663490851,"score_gpt":0.24330902170566754,"score_spread":0.21861905535658244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168839239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10080648,0.000030061969,0.8982918,0.00020662071,0.000389742,0.00013945228,0.0000038419316,0.00009462625,0.00003736698],"genre_scores_gemma":[0.89082783,0.000016883823,0.10906106,0.000067741414,0.0000125948645,0.0000036563172,0.0000012079421,0.0000045759834,0.000004456295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991657,0.000033569264,0.0002133123,0.00025729145,0.00018337551,0.00014675745],"domain_scores_gemma":[0.9993649,0.000104982166,0.000074742784,0.00031763222,0.00006531983,0.00007239815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020051972,0.00009790804,0.000115507406,0.00025586667,0.00014160408,0.000033696455,0.00023078296,0.00005010232,0.0000025626855],"category_scores_gemma":[0.0000011155806,0.00009871084,0.000077664125,0.0003649378,0.00011819688,0.00021821937,0.0000032178577,0.000099829886,0.0000034390002],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009079167,0.0009750244,0.00050041196,0.00011399741,0.00018138542,0.00001210359,0.0034938324,0.0505137,0.037606787,0.024469357,0.000097331606,0.88194525],"study_design_scores_gemma":[0.0015646078,0.00034572973,0.08278539,0.000110391564,0.000038412963,0.0000406881,0.00009326124,0.6770464,0.23343357,0.0038111275,0.00027689335,0.0004534931],"about_ca_topic_score_codex":0.00004435663,"about_ca_topic_score_gemma":0.00002239015,"teacher_disagreement_score":0.8814918,"about_ca_system_score_codex":0.000017526932,"about_ca_system_score_gemma":0.0000100045745,"threshold_uncertainty_score":0.40253115},"labels":[],"label_agreement":null},{"id":"W2170123632","doi":"10.1109/tc.2013.111","title":"Data Similarity-Aware Computation Infrastructure for the Cloud","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Cache; Cloud computing; Scalability; Exploit; Locality; Cache algorithms; Distributed computing; Parallel computing; Database; CPU cache; Operating system","score_opus":0.03791889465467431,"score_gpt":0.2611096420787313,"score_spread":0.22319074742405698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170123632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016295175,0.000026177526,0.9894612,0.0039023617,0.0041026752,0.000516608,0.00008186113,0.00025997366,0.000019616493],"genre_scores_gemma":[0.97501045,0.00001532616,0.022333493,0.002304513,0.00017990918,0.000051321887,0.000021105025,0.0000145812655,0.00006929172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877816,0.00006293566,0.00021309977,0.00046835258,0.00023326799,0.00024415113],"domain_scores_gemma":[0.9980844,0.00065299845,0.0000679933,0.0009991074,0.0001173466,0.000078132645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017169083,0.00017141704,0.00014155392,0.00008970485,0.0005096542,0.0004042067,0.0016370295,0.00006738907,0.000010607268],"category_scores_gemma":[0.0000032465398,0.0001305131,0.000106722764,0.00022943808,0.00004997147,0.00065454503,0.000017760281,0.00027980297,0.000043594446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012042377,0.00007322528,0.0000054049924,0.00001433937,0.00010202921,0.0000016162659,0.00025246202,0.41339293,0.00010575017,0.0003040746,0.047565363,0.53817075],"study_design_scores_gemma":[0.0003954501,0.00007555225,0.00017884666,0.000020044494,0.000021924132,0.000013774113,0.000041994554,0.9955054,0.00009919135,0.0005834851,0.0029028135,0.00016153019],"about_ca_topic_score_codex":0.00012087129,"about_ca_topic_score_gemma":0.000024277557,"teacher_disagreement_score":0.9733809,"about_ca_system_score_codex":0.000043271968,"about_ca_system_score_gemma":0.00005043646,"threshold_uncertainty_score":0.532217},"labels":[],"label_agreement":null},{"id":"W2170753697","doi":"10.1109/tc.2014.2315617","title":"SLA: A Stage-Level Latency Analysisfor Real-Time Communicationin a Pipelined Resource Model","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Carbon Management Canada; Canada Foundation for Innovation","keywords":"Computer science; Latency (audio); Pipeline (software); Parallel computing; Data transmission; Transmission (telecommunications); Distributed computing; Computer network; Operating system; Telecommunications","score_opus":0.030228198371584903,"score_gpt":0.2530044651024675,"score_spread":0.22277626673088258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170753697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057853884,0.000010258647,0.98900485,0.001082723,0.00028909,0.00035213825,0.000017674041,0.000725831,0.0027320562],"genre_scores_gemma":[0.6413651,0.00002152065,0.35596788,0.0003113191,0.000049734375,0.00004860365,0.000008098799,0.000038998318,0.0021887189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672043,0.00052724907,0.00076667225,0.0008019016,0.0006504333,0.0005333116],"domain_scores_gemma":[0.9961422,0.000643637,0.0002941197,0.0024368532,0.00021247538,0.00027071554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010923067,0.00038039417,0.0005217493,0.0005146245,0.0005604326,0.00037759382,0.0021243924,0.00018168412,0.000019498142],"category_scores_gemma":[0.000014430758,0.00038664578,0.0003314163,0.0010085013,0.00008916294,0.00068495225,0.000023316954,0.00045682013,0.00034084433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020142308,0.00016818779,0.000004193886,0.000025110066,0.000103110455,0.0000029947867,0.0008852332,0.97349155,0.002168203,0.0012015458,0.0005597765,0.02136993],"study_design_scores_gemma":[0.00069890317,0.00010895462,0.000041183874,0.00011642061,0.000039854564,0.000013876759,0.000027382559,0.99610895,0.0019017964,0.00020169688,0.0003460726,0.000394908],"about_ca_topic_score_codex":0.00039199152,"about_ca_topic_score_gemma":0.00007279518,"teacher_disagreement_score":0.63557976,"about_ca_system_score_codex":0.00017751585,"about_ca_system_score_gemma":0.00016918033,"threshold_uncertainty_score":0.99985856},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Speedup; Homomorphic encryption; Computer science; IBM; Encryption; Theoretical computer science; Parallel computing; Operating system","score_opus":0.06959331102854904,"score_gpt":0.30372368922318815,"score_spread":0.2341303781946391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295445672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011606021,0.000025328305,0.98575926,0.00040984098,0.0014959087,0.00019038813,0.00014797882,0.0002449431,0.00012033652],"genre_scores_gemma":[0.9202713,0.000020277834,0.079392575,0.00023222252,0.000029916962,0.000009772021,0.000029834953,0.00001106236,0.0000030650688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842566,0.00009896077,0.00032837057,0.0004838054,0.0004066822,0.0002565225],"domain_scores_gemma":[0.9982064,0.00011500368,0.00011455653,0.0012687228,0.00009775915,0.00019759315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037517922,0.00016069683,0.00019816721,0.00029976945,0.00011814416,0.00010223127,0.0013533736,0.00006691597,0.000029844732],"category_scores_gemma":[0.0000024655722,0.0001648491,0.00008121057,0.0008429846,0.000091915295,0.0010795562,0.000018747982,0.0001881741,0.00003703152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020321591,0.0018149418,0.00053193583,0.0001245557,0.00062307506,0.000063140986,0.008894189,0.0292716,0.0020128028,0.04532223,0.06430594,0.8468324],"study_design_scores_gemma":[0.009716361,0.0024182391,0.0014527654,0.00021901268,0.0002508123,0.00013324067,0.002961091,0.86837333,0.07750753,0.009447302,0.025530731,0.0019895523],"about_ca_topic_score_codex":0.00035379996,"about_ca_topic_score_gemma":0.000151122,"teacher_disagreement_score":0.90866524,"about_ca_system_score_codex":0.00004074266,"about_ca_system_score_gemma":0.00016184043,"threshold_uncertainty_score":0.67223513},"labels":[],"label_agreement":null},{"id":"W2325206984","doi":"10.1109/tc.2013.77","title":"Constructing Connected-Dominating-Set with Maximum Lifetime in Cognitive Radio Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cognitive radio; Computer science; Connected dominating set; Dominating set; Set (abstract data type); Computer network; Telecommunications; Theoretical computer science; Wireless; Graph","score_opus":0.01067508925970002,"score_gpt":0.22224690812970246,"score_spread":0.21157181887000245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325206984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032868158,0.000020276888,0.96371055,0.00034167053,0.0012782997,0.0003083299,0.000004519063,0.00027300825,0.0011951985],"genre_scores_gemma":[0.96720475,0.000010195481,0.03199899,0.00053453795,0.000189247,0.000013356396,0.000003602252,0.00002888772,0.00001645117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977996,0.00023075157,0.0003685827,0.00071965007,0.00028529277,0.0005961526],"domain_scores_gemma":[0.99768746,0.0015349062,0.00014722618,0.00033439742,0.00012252224,0.00017348232],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036879556,0.00033589677,0.0004148609,0.0003446532,0.00028061864,0.0002469224,0.0003742073,0.000111024514,0.00001537424],"category_scores_gemma":[0.00001138141,0.0003267831,0.00010887962,0.0009185083,0.00017739272,0.00035504613,0.0000066657276,0.00061998464,0.000012659728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013422384,0.00014362647,0.00030344207,0.000010657137,0.00011426435,0.00008936899,0.00074664317,0.23027086,0.00001925241,0.0015463954,0.00010953526,0.76651174],"study_design_scores_gemma":[0.0022066496,0.0004168571,0.00037052992,0.0004704073,0.000025861158,0.00028765813,0.00015650468,0.994666,0.0007128845,0.00018110425,0.00004516826,0.00046040246],"about_ca_topic_score_codex":0.000058616904,"about_ca_topic_score_gemma":0.00026016042,"teacher_disagreement_score":0.9343366,"about_ca_system_score_codex":0.00014202853,"about_ca_system_score_gemma":0.000056812747,"threshold_uncertainty_score":0.9999184},"labels":[],"label_agreement":null},{"id":"W2344568791","doi":"10.1109/tc.2016.2560840","title":"Generating Cyclic-Random Sequences in a Constrained Space for In-System Validation","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Porting; Software; Feature (linguistics); Random access; Theoretical computer science; Algorithm; Computer engineering; Programming language","score_opus":0.026074815892228424,"score_gpt":0.2467978038511961,"score_spread":0.22072298795896766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344568791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06722011,0.0000074018226,0.930563,0.0007213774,0.00091719476,0.00030195148,0.0000065133386,0.00017388519,0.0000885777],"genre_scores_gemma":[0.9741999,0.000003248462,0.025550043,0.0000945794,0.0000522522,0.000066833716,5.586761e-7,0.00000868051,0.000023933218],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986969,0.000106591164,0.0003429488,0.00040258947,0.00015277066,0.00029814916],"domain_scores_gemma":[0.9988432,0.00074341585,0.00008865265,0.00021907463,0.00004450576,0.00006117598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004070235,0.0001470566,0.00020681566,0.00029890865,0.00012947402,0.00010099379,0.0003276358,0.00005912734,0.0000015438445],"category_scores_gemma":[0.000011889698,0.00011950251,0.00008308751,0.00040727117,0.000038971935,0.0004090143,0.0000018482332,0.000092212,0.000007834126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007682655,0.000119618424,0.0003868657,0.000060169474,0.000025608182,0.000038844002,0.0011814372,0.24083978,0.048216954,0.0028887384,0.00003469933,0.7061996],"study_design_scores_gemma":[0.0038416842,0.00015873527,0.00011170055,0.00080189615,0.000007450608,0.00005280424,0.000117722804,0.9578138,0.036448114,0.00024285716,0.000043968765,0.00035924648],"about_ca_topic_score_codex":0.00006910746,"about_ca_topic_score_gemma":0.00011241225,"teacher_disagreement_score":0.90697974,"about_ca_system_score_codex":0.00016078044,"about_ca_system_score_gemma":0.00008010762,"threshold_uncertainty_score":0.4873171},"labels":[],"label_agreement":null},{"id":"W2409013312","doi":"10.1109/tc.2015.2479617","title":"Multiple-Bit Parity-Based Concurrent Fault Detection Architecture for Parallel CRC Computation","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Radiation Effects in Electronics","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Parity bit; Checksum; Fault detection and isolation; Computer science; Parallel computing; Algorithm; Overhead (engineering); Computation; Very-large-scale integration; Parity (physics); Arithmetic; Computer engineering; Mathematics; Embedded system","score_opus":0.01799828662591013,"score_gpt":0.24544713487033823,"score_spread":0.2274488482444281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2409013312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017623968,0.000043426036,0.9770331,0.000121408215,0.0035920897,0.0007492805,0.000040425755,0.00077016186,0.000026140353],"genre_scores_gemma":[0.97836626,0.000003372106,0.021094168,0.00013969997,0.0001167639,0.0001881821,0.000029602756,0.00005541058,0.0000065327727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884063,0.00007029266,0.00026096377,0.00026473743,0.0002335883,0.00032980318],"domain_scores_gemma":[0.9990641,0.00045289216,0.000050179544,0.00017614604,0.00009613817,0.00016054604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015304226,0.0002473563,0.00020778569,0.00022632867,0.00013313921,0.000057412104,0.00013163983,0.00013374872,0.0000020903633],"category_scores_gemma":[0.000008886402,0.0002760942,0.00014694313,0.00023025835,0.000036588965,0.0001045225,4.922681e-7,0.00035551534,0.00002067382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051218663,0.000058566904,0.0000016187817,0.00004366757,0.00004525434,6.6405386e-7,0.00014200786,0.82061493,0.00023511559,0.0000064973515,0.00048377263,0.17831667],"study_design_scores_gemma":[0.0024078344,0.00034187362,0.000023225291,0.000027733066,0.000037413516,0.0000063050934,0.000010817626,0.98490626,0.008655064,0.000104585815,0.0032009445,0.00027791853],"about_ca_topic_score_codex":0.0000145667855,"about_ca_topic_score_gemma":0.00012838119,"teacher_disagreement_score":0.9607423,"about_ca_system_score_codex":0.00039936855,"about_ca_system_score_gemma":0.00005674432,"threshold_uncertainty_score":0.9999691},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01258042604090034,"score_gpt":0.20150533497891254,"score_spread":0.1889249089380122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2461274627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29949233,0.000032883334,0.6971866,0.00004442516,0.002278147,0.0004493233,0.000020003677,0.00041063468,0.00008567513],"genre_scores_gemma":[0.97650737,0.00007035591,0.022951152,0.0001099586,0.00007570132,0.00014004449,0.000008463431,0.000071624294,0.00006535022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883956,0.000018231534,0.00027563787,0.00030102846,0.0001985175,0.00036700358],"domain_scores_gemma":[0.9993687,0.00006552469,0.000029802268,0.00028060403,0.000057950405,0.00019739747],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001782831,0.0002827989,0.00024299207,0.0002175895,0.0001680837,0.00009580483,0.00016444467,0.00011735295,0.000009143695],"category_scores_gemma":[0.0000013925601,0.00028516233,0.000054511118,0.00017383725,0.00006639437,0.0005560637,0.0000014798615,0.00020253337,0.000049144604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008056244,0.0000528209,0.000011689926,0.00008595295,0.00006933916,0.0000015047701,0.00080187776,0.9724347,0.0017902242,0.000026972903,0.0016860967,0.022958262],"study_design_scores_gemma":[0.002059251,0.0002807669,0.00007547508,0.00006170924,0.000026713997,0.000011169751,0.000046098943,0.9390372,0.05706799,0.0000105567515,0.0009559009,0.00036718126],"about_ca_topic_score_codex":0.000007391779,"about_ca_topic_score_gemma":0.0000036653394,"teacher_disagreement_score":0.677015,"about_ca_system_score_codex":0.00016804384,"about_ca_system_score_gemma":0.000033746925,"threshold_uncertainty_score":0.99996006},"labels":[],"label_agreement":null},{"id":"W2467362426","doi":"10.1109/tc.2015.2481408","title":"New Architectures for Digit-Level Single, Hybrid-Double, Hybrid-Triple Field Multiplications and Exponentiation Using Gaussian Normal Bases","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Division of Administrative Services; Natural Sciences and Engineering Research Council of Canada","keywords":"Exponentiation; Mathematics; Arithmetic; Multiplication (music); Finite field; Multiplier (economics); Discrete mathematics; Combinatorics","score_opus":0.058153709370258044,"score_gpt":0.2651781174924571,"score_spread":0.20702440812219908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2467362426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07182157,0.00004408283,0.92563695,0.0008686383,0.0009774885,0.0004069808,0.000030110657,0.00017112245,0.0000430637],"genre_scores_gemma":[0.7675559,0.0000035748133,0.23199344,0.00028489492,0.00007924903,0.00002399283,0.0000038275966,0.000012945033,0.00004220006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872464,0.000038700713,0.00026461695,0.0004484145,0.00022649605,0.00029716035],"domain_scores_gemma":[0.998863,0.0002862863,0.00008708987,0.0004007332,0.00008273153,0.0002802023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000096963005,0.00020409375,0.00017659814,0.00038948967,0.0003403891,0.0002633958,0.00036464946,0.0000455981,0.0000028261327],"category_scores_gemma":[0.0000067948235,0.00020139937,0.00014933111,0.00033958844,0.000045623005,0.00027629422,0.000008951553,0.00014835593,0.0000027671208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028281144,0.00051700906,0.00017440457,0.000055534754,0.00019803345,0.000015153978,0.0013721975,0.2979273,0.0020740945,0.0007201683,0.0030778279,0.69358546],"study_design_scores_gemma":[0.005267702,0.00070991105,0.0008391337,0.00012325465,0.00010295596,0.0002455485,0.000054321135,0.78885,0.19957832,0.0022034228,0.0013041275,0.00072128716],"about_ca_topic_score_codex":0.00032889313,"about_ca_topic_score_gemma":0.00008780674,"teacher_disagreement_score":0.6957343,"about_ca_system_score_codex":0.000042405023,"about_ca_system_score_gemma":0.000108868866,"threshold_uncertainty_score":0.82128274},"labels":[],"label_agreement":null},{"id":"W2518296955","doi":"10.1109/tc.2016.2602833","title":"Schedulability Analysis for Real-Time Task Set on Resource with Performance Degradation and Dual-Level Periodic Rejuvenations","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Pain Society; National Science Foundation","keywords":"Scheduling (production processes); Computer science; Resource (disambiguation); Job shop scheduling; Set (abstract data type); Processor scheduling; Algorithm; Mathematics; Embedded system; Programming language; Mathematical optimization; Computer network","score_opus":0.02530828708885076,"score_gpt":0.23928973228766115,"score_spread":0.2139814451988104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518296955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29729882,0.0000026651892,0.7007683,0.0010807802,0.00012992372,0.00039985456,0.000053667365,0.00019445403,0.000071554234],"genre_scores_gemma":[0.904911,0.000012077267,0.09445242,0.000092219816,0.0000320608,0.00010473503,0.000009147558,0.0000214013,0.00036492935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977884,0.00017165684,0.00041049163,0.000838602,0.00043078986,0.00036005292],"domain_scores_gemma":[0.9978413,0.00069679576,0.0001860008,0.00091508444,0.00018405051,0.00017675932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059246836,0.00028420275,0.00036189583,0.000580105,0.00054539193,0.00022413129,0.00038141134,0.000101642996,0.000007747916],"category_scores_gemma":[0.000010932447,0.00020885149,0.00015963822,0.0010464184,0.00012800207,0.00075882627,0.0000060565685,0.00013665309,0.000033095977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079462456,0.00091887545,0.0022861902,0.00024346894,0.002528705,0.000017960327,0.004425886,0.559282,0.027275823,0.0021490697,0.00092052296,0.39915684],"study_design_scores_gemma":[0.00231224,0.0012819315,0.013532177,0.00034531573,0.00029261,0.000052073,0.000071426344,0.97011137,0.010597574,0.000059919126,0.0005770013,0.0007663435],"about_ca_topic_score_codex":0.000058025278,"about_ca_topic_score_gemma":0.000039712744,"teacher_disagreement_score":0.6076122,"about_ca_system_score_codex":0.00021262142,"about_ca_system_score_gemma":0.000107970205,"threshold_uncertainty_score":0.8516717},"labels":[],"label_agreement":null},{"id":"W2532094356","doi":"10.1109/tc.2016.2621045","title":"Design and Applications for Embedded Networks-on-Chip on FPGAs","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Computer science; Embedded system; Network on a chip; Ethernet; Network packet; Computer architecture; Computer hardware; Computer network","score_opus":0.02557364602422677,"score_gpt":0.24291641780405798,"score_spread":0.21734277177983122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2532094356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015680237,0.000009472085,0.99536395,0.0013148066,0.0018421297,0.00086871505,0.0000051289267,0.0002468382,0.0001921483],"genre_scores_gemma":[0.96468157,0.000027916924,0.032142572,0.0019470644,0.0002436173,0.0005428847,6.1361396e-7,0.000024242736,0.0003895004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986811,0.00013787931,0.0002430268,0.00051016215,0.00015097446,0.00027681308],"domain_scores_gemma":[0.99796194,0.0012879401,0.000075361255,0.00048929226,0.000065249835,0.00012023665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031314165,0.00019635734,0.0001840181,0.00016510725,0.0003108248,0.00014627699,0.00035549345,0.000085698266,0.0000051538573],"category_scores_gemma":[0.000001600505,0.0001445581,0.0001116371,0.00019966655,0.000040953386,0.00019019241,0.0000024970584,0.00012707684,0.000041870448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007818548,0.00013628397,4.935566e-7,0.000006517363,0.000052926283,0.0000013122685,0.00015641384,0.71950316,0.0001245732,0.020941932,0.0035411662,0.255457],"study_design_scores_gemma":[0.001094749,0.00089009904,0.0000103385455,0.00015872158,0.000011303652,0.000023386616,0.000009814618,0.98746514,0.0019477608,0.0010970543,0.0069895755,0.00030204342],"about_ca_topic_score_codex":0.0000031852503,"about_ca_topic_score_gemma":0.000003841432,"teacher_disagreement_score":0.9645248,"about_ca_system_score_codex":0.000062335464,"about_ca_system_score_gemma":0.000025923247,"threshold_uncertainty_score":0.58949083},"labels":[],"label_agreement":null},{"id":"W2574407746","doi":"10.1109/tc.2017.2653780","title":"Two Approximate Voting Schemes for Reliable Computing","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Radiation Effects in Electronics","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Triple modular redundancy; Computer science; Modular design; Redundancy (engineering); Voting; Probabilistic logic; Overhead (engineering); Scheme (mathematics); Algorithm; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.012307359225081235,"score_gpt":0.2551684797242756,"score_spread":0.24286112049919434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574407746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025938658,0.000031473195,0.96996427,0.00006735791,0.0026330994,0.00031461578,0.000008152422,0.00057972065,0.0004626809],"genre_scores_gemma":[0.9441134,0.000006436519,0.055558328,0.000054168544,0.00014455407,0.000026498437,0.000001978538,0.000053984597,0.000040677878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999095,0.00001085829,0.0001927624,0.00021499406,0.00011420527,0.0003721718],"domain_scores_gemma":[0.9992757,0.00017154773,0.00006605473,0.0003871393,0.000035410383,0.00006415308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017930912,0.00017489117,0.00017612081,0.00009515127,0.000691196,0.0001792651,0.00031850135,0.000059472757,0.000004182017],"category_scores_gemma":[0.00000555529,0.00020219182,0.00010855279,0.000057676632,0.000037718102,0.0002142324,0.0000013740879,0.00023275986,0.000016800095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000614786,0.00001805939,0.0000050054146,0.000052305353,0.000057281577,7.2135424e-7,0.00005568809,0.9255648,0.00033958774,0.0003386072,0.00032055835,0.07324123],"study_design_scores_gemma":[0.0007061363,0.000048098977,0.00001570553,0.000065823406,0.000019907664,0.000004717034,0.000005392714,0.9788793,0.01839619,0.000047775604,0.0016072643,0.0002037272],"about_ca_topic_score_codex":0.000010872736,"about_ca_topic_score_gemma":0.000008492435,"teacher_disagreement_score":0.91817474,"about_ca_system_score_codex":0.00013498127,"about_ca_system_score_gemma":0.000017664577,"threshold_uncertainty_score":0.82451427},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03194913396190989,"score_gpt":0.2487956558079305,"score_spread":0.2168465218460206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2589986623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022968918,0.000024544031,0.97290564,0.000038438317,0.002817429,0.00074230775,0.00002593902,0.00038779664,0.000088976485],"genre_scores_gemma":[0.88109535,0.000016372582,0.11866273,0.000028236838,0.000063823565,0.000038137056,0.000001933395,0.000070012786,0.000023423047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867916,0.000027528751,0.00038268563,0.0002900117,0.00019469034,0.00042591465],"domain_scores_gemma":[0.9988526,0.00021232298,0.0001232851,0.0006470141,0.00005553773,0.000109216635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025126804,0.0002911234,0.00037450186,0.00020905284,0.00048646258,0.000093620576,0.0005297945,0.00011330648,0.0000074535833],"category_scores_gemma":[0.0000025477195,0.00030447985,0.00016124173,0.000085578715,0.00012461821,0.00029071386,0.0000023321743,0.00022267958,0.000015502912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006400849,0.00005885749,0.000006462565,0.00013270204,0.00013290993,0.000002780972,0.0006502371,0.9634677,0.0047626286,0.000012056083,0.00039970258,0.030309916],"study_design_scores_gemma":[0.0014449006,0.00013655002,0.000061646395,0.0001430706,0.00004311279,0.000006496173,0.000027029486,0.93627137,0.061410908,0.000014647981,0.00013849167,0.00030176452],"about_ca_topic_score_codex":0.000013818905,"about_ca_topic_score_gemma":0.0000023595683,"teacher_disagreement_score":0.8581264,"about_ca_system_score_codex":0.00010032916,"about_ca_system_score_gemma":0.000029271148,"threshold_uncertainty_score":0.99994075},"labels":[],"label_agreement":null},{"id":"W2592025126","doi":"10.1109/tc.2017.2676763","title":"Efficient Composited de Bruijn Sequence Generators","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Institute of Standards and Technology; Cisco Systems","keywords":"De Bruijn sequence; Sequence (biology); Computer science; Application-specific integrated circuit; Algorithm; Stream cipher; Parallel computing; Discrete mathematics; Mathematics; Cryptography; Computer hardware","score_opus":0.026515201882527626,"score_gpt":0.26316942932266646,"score_spread":0.23665422744013884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592025126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1190168,0.000008360625,0.8778011,0.0005366704,0.0017759503,0.00010680566,0.00000576882,0.00030523018,0.0004433211],"genre_scores_gemma":[0.94885004,0.000003550766,0.050438218,0.0005939325,0.000049345297,0.000012572574,3.2713163e-7,0.000010698489,0.000041304385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874306,0.00009985438,0.00017244539,0.00042081595,0.00021912613,0.0003447089],"domain_scores_gemma":[0.99840707,0.000112521186,0.00009894265,0.001157328,0.000049552695,0.00017456891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002507725,0.00018505323,0.00015535469,0.00026320067,0.0012625402,0.00051592715,0.0015773554,0.000053948028,0.0000114065515],"category_scores_gemma":[0.0000018835469,0.00018889278,0.0001762843,0.0002677734,0.00015848712,0.00017106158,0.000010153537,0.00023268239,0.00005168462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058061454,0.0005139946,0.00014397573,0.000019190611,0.00013722766,0.00010559662,0.0011378663,0.71896595,0.012805053,0.033629715,0.00063809473,0.23184524],"study_design_scores_gemma":[0.00056833477,0.00015913227,0.00060543366,0.0000748307,0.00001919242,0.00004805109,0.0000063495077,0.9490164,0.04740735,0.0010467111,0.0006665484,0.0003816807],"about_ca_topic_score_codex":0.000039700466,"about_ca_topic_score_gemma":0.000016251432,"teacher_disagreement_score":0.82983327,"about_ca_system_score_codex":0.00007438815,"about_ca_system_score_gemma":0.000055562166,"threshold_uncertainty_score":0.97105664},"labels":[],"label_agreement":null},{"id":"W2600340828","doi":"10.1109/tc.2017.2687920","title":"Rate-Selective Caching for Adaptive Streaming Over Information-Centric Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Computer network; Overhead (engineering); Information-centric networking; Scalability; Provisioning; The Internet; Quality of service; Throughput; Distributed computing; Real-time computing; Wireless; Telecommunications","score_opus":0.01786392560857536,"score_gpt":0.23579656039838462,"score_spread":0.21793263478980926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600340828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006381479,0.000012040728,0.98988724,0.00019880704,0.0027685352,0.00032355907,0.0000149742,0.00018581685,0.0002275325],"genre_scores_gemma":[0.99269915,0.000012314124,0.006597811,0.0004998083,0.000089908994,0.00003963658,0.0000024741462,0.000009891749,0.000049025417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893224,0.00004577296,0.00022879352,0.00029515135,0.00016808028,0.0003299525],"domain_scores_gemma":[0.9986572,0.00034197522,0.00019121265,0.0005860255,0.00012256783,0.00010097751],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0002147886,0.00019138682,0.0001815712,0.00019890883,0.0013654354,0.000696469,0.00080780743,0.00007551796,0.0000019392867],"category_scores_gemma":[0.000009119125,0.00019400299,0.00018470948,0.00012781328,0.00003974103,0.0019850987,0.0000087175495,0.0002845258,0.000014297495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007110057,0.00006841131,0.000026186159,0.0000061489586,0.000105941,0.0000036752263,0.00044262872,0.75392324,0.000023516932,0.001004389,0.0007397117,0.24358504],"study_design_scores_gemma":[0.0008957307,0.0001623408,0.0007816197,0.000055858913,0.000020703208,0.0000056240306,0.000023568487,0.9971861,0.00029442005,0.00009814771,0.00024658948,0.00022925345],"about_ca_topic_score_codex":0.00028571187,"about_ca_topic_score_gemma":0.000040786068,"teacher_disagreement_score":0.98631763,"about_ca_system_score_codex":0.00013711436,"about_ca_system_score_gemma":0.000062742205,"threshold_uncertainty_score":0.9999347},"labels":[],"label_agreement":null},{"id":"W2604978221","doi":"10.1109/tc.2017.2690420","title":"Arithmetical Improvement of the Round-Off for Cryptosystems in High-Dimensional Lattices","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fundação para a Ciência e a Tecnologia; Agence Nationale de la Recherche","keywords":"Computer science; SIMD; Parallel computing; Cryptography; Cryptosystem; Encryption; Arithmetic; Algorithm; Mathematics","score_opus":0.01975803306219012,"score_gpt":0.2602411233823112,"score_spread":0.24048309032012108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604978221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13986956,0.000013485724,0.85620224,0.0009650464,0.0025005124,0.00034488435,0.000054078526,0.000029050969,0.000021133097],"genre_scores_gemma":[0.96966875,0.0000043653667,0.03008046,0.00016110229,0.000036347075,0.00003790322,9.725181e-7,0.0000056937974,0.0000044170483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884325,0.000039967115,0.00028293653,0.00033709643,0.0002778194,0.00021892866],"domain_scores_gemma":[0.9984878,0.00023125882,0.00015105851,0.0010087598,0.00006153295,0.000059638678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027879947,0.0001324307,0.00019090818,0.000114484115,0.0004177245,0.00018337589,0.0012462506,0.00006343902,0.0000032105102],"category_scores_gemma":[0.0000052302225,0.00010149896,0.00017686277,0.00013888697,0.00013359761,0.00039695948,0.000018006818,0.00016489463,0.0000024032033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003263933,0.0035031664,0.0009146973,0.0003295984,0.00039993675,0.000016006972,0.001438154,0.06084582,0.007495724,0.25218087,0.0014625383,0.6710871],"study_design_scores_gemma":[0.005951056,0.0012341145,0.015804954,0.00056288653,0.00007967381,0.000020874599,0.00004772316,0.8840715,0.07168407,0.016972337,0.0027509185,0.0008198338],"about_ca_topic_score_codex":0.0002719731,"about_ca_topic_score_gemma":0.00026710797,"teacher_disagreement_score":0.8297992,"about_ca_system_score_codex":0.000034225704,"about_ca_system_score_gemma":0.00005238207,"threshold_uncertainty_score":0.41390076},"labels":[],"label_agreement":null},{"id":"W2763046940","doi":"10.1109/tc.2017.2762293","title":"Mapping and Scheduling Mixed-Criticality Systems with On-Demand Redundancy","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Avionics; Mixed criticality; Fault tolerance; Redundancy (engineering); Quality of service; Distributed computing; Scheduling (production processes); Criticality; Certification; Reliability engineering; Embedded system; Automotive industry; Software quality; Software; Computer network; Operating system; Software development; Engineering","score_opus":0.025016963715371397,"score_gpt":0.2542686612242818,"score_spread":0.22925169750891042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763046940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079229884,0.000053609052,0.9159198,0.0008536594,0.002653111,0.0003627889,0.000004456174,0.00026735602,0.0006553676],"genre_scores_gemma":[0.9319461,0.000013435212,0.067689344,0.000101672864,0.00012490066,0.000033478078,3.660165e-7,0.00002487978,0.00006582167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976691,0.00017247988,0.00039947464,0.00082424894,0.00046768354,0.00046703644],"domain_scores_gemma":[0.9975721,0.00032159826,0.00019926883,0.0015142728,0.00011636499,0.00027634687],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00058536546,0.00031638102,0.0004023852,0.00022123275,0.0013694506,0.0017222338,0.0009812481,0.00011575612,0.0000015879839],"category_scores_gemma":[0.000012073769,0.00028154702,0.00009168503,0.00016216026,0.00019902592,0.0010170074,0.000013900244,0.00040558534,0.00004462829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018079771,0.00080833863,0.0006621515,0.0010035846,0.00079084764,0.0005296065,0.0038833797,0.80437744,0.0025141581,0.021455964,0.00028907025,0.16350466],"study_design_scores_gemma":[0.0014498794,0.0004043271,0.0019450173,0.0018844025,0.000027379221,0.00033350117,0.00022183203,0.9895646,0.0030216582,0.0002179705,0.00021718131,0.0007122657],"about_ca_topic_score_codex":0.00017441463,"about_ca_topic_score_gemma":0.000011699285,"teacher_disagreement_score":0.8527162,"about_ca_system_score_codex":0.00009091172,"about_ca_system_score_gemma":0.0000771778,"threshold_uncertainty_score":0.99996364},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Stochastic computing; Computer science; Perceptron; Artificial neural network; Algorithm; Multilayer perceptron; Computation; Artificial intelligence","score_opus":0.026733666894722487,"score_gpt":0.2602225842534681,"score_spread":0.23348891735874563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791777778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008993441,0.000002921287,0.98878586,0.0009375539,0.00052313745,0.00038331552,0.0000058296446,0.00031368664,0.000054262466],"genre_scores_gemma":[0.7786792,8.0776107e-7,0.22052504,0.00053435843,0.00009744294,0.000054922588,0.000002767079,0.000014203612,0.00009128131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986936,0.000046550846,0.00020075096,0.0004910088,0.00029734458,0.00027076507],"domain_scores_gemma":[0.99914974,0.00010020068,0.00007214727,0.00038031582,0.00017105992,0.0001265581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007097286,0.00019468737,0.00013981335,0.0001347197,0.00042728483,0.00015469031,0.00044016488,0.000049586997,0.000025854913],"category_scores_gemma":[5.36332e-7,0.00016525129,0.000067273955,0.00050533155,0.00014169441,0.0003478467,0.000004220969,0.00019115934,0.00024048584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029301124,0.0002651019,0.0000028011355,0.000004760667,0.0000352054,0.0000027481892,0.00044492958,0.9080983,0.00032733328,0.0012772961,0.00064223027,0.088870004],"study_design_scores_gemma":[0.0006293285,0.00040117773,0.00035631756,0.000040910276,0.0000126072155,0.000038224585,0.000011841813,0.99739623,0.00058158237,0.0001565904,0.00015241672,0.00022275788],"about_ca_topic_score_codex":0.000013299621,"about_ca_topic_score_gemma":0.00002792777,"teacher_disagreement_score":0.76968575,"about_ca_system_score_codex":0.000065039036,"about_ca_system_score_gemma":0.000064871456,"threshold_uncertainty_score":0.6738752},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00834257827932496,"score_gpt":0.22815545526917042,"score_spread":0.21981287698984545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791851645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13493547,0.000018380668,0.86083174,0.00043184982,0.0028380244,0.0006187276,0.0000020331668,0.00028217898,0.000041617826],"genre_scores_gemma":[0.9092549,0.0000033798678,0.08967322,0.00052751275,0.00044544123,0.000019770468,0.000003875254,0.000026845264,0.000045032986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998303,0.00006660448,0.00031911457,0.0006191024,0.00027120695,0.0004209701],"domain_scores_gemma":[0.99883974,0.00034418877,0.00012596854,0.00032737906,0.00020309558,0.00015962524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029452116,0.00029128484,0.00027280106,0.00022995171,0.0007770033,0.00023873932,0.00033513177,0.00011276134,0.0000031122645],"category_scores_gemma":[0.0000023945388,0.00025791515,0.000093208655,0.00039842995,0.00011420675,0.00054986967,0.000005254293,0.00022565364,0.0000110758965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081170205,0.0006700448,0.000103540544,0.00007855509,0.00023197725,0.00000587256,0.00648095,0.034286864,0.034348294,0.00030769242,0.0032815782,0.91939294],"study_design_scores_gemma":[0.0024373878,0.0020292075,0.00018237859,0.00017433456,0.00002045596,0.0000260479,0.000026761803,0.9617834,0.029119408,0.00004122365,0.0037988094,0.00036058403],"about_ca_topic_score_codex":0.00003056327,"about_ca_topic_score_gemma":0.000004912579,"teacher_disagreement_score":0.92749655,"about_ca_system_score_codex":0.00007512587,"about_ca_system_score_gemma":0.000066911314,"threshold_uncertainty_score":0.9999873},"labels":[],"label_agreement":null},{"id":"W2794116586","doi":"10.1109/tc.2018.2811467","title":"Towards a Cryptographic Minimal Design: The sLiSCP Family of Permutations","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Institute of Standards and Technology","keywords":"Computer science; Cryptography; Cryptographic primitive; Symmetric-key algorithm; Encryption; Theoretical computer science; Overhead (engineering); Pseudorandom number generator; Hash function; Cryptographic protocol; Algorithm; Public-key cryptography; Computer network; Computer security","score_opus":0.04050270576651208,"score_gpt":0.2847700426373786,"score_spread":0.24426733687086652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794116586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033169135,0.000021817697,0.9639811,0.00095410744,0.0011768249,0.00032717045,0.000020818445,0.0001297539,0.00021928948],"genre_scores_gemma":[0.8829626,0.000021400805,0.11633895,0.0005666407,0.000051279414,0.00004214835,0.0000010054816,0.000009757298,0.000006201461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984413,0.00017283179,0.00036673548,0.0003483667,0.00037955193,0.0002912537],"domain_scores_gemma":[0.9986821,0.00027880372,0.00010869209,0.00061604107,0.0002269185,0.000087445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032464432,0.0001815092,0.00017344781,0.00039656842,0.00057461753,0.00013200869,0.000864175,0.000054181015,0.000035961366],"category_scores_gemma":[0.000002799025,0.00014333695,0.00022339768,0.0014597785,0.00036326193,0.00028975113,0.0000072089133,0.00017917053,0.000019028696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022858918,0.0021711485,0.00009889409,0.00005298074,0.0009307202,0.00002333587,0.042710688,0.029336542,0.010575023,0.12616943,0.00982471,0.7778779],"study_design_scores_gemma":[0.0038701023,0.004399352,0.015496285,0.0001701513,0.00023945482,0.00011409255,0.0023884578,0.91127205,0.04063242,0.012915885,0.0071027526,0.001398977],"about_ca_topic_score_codex":0.00012374374,"about_ca_topic_score_gemma":0.00005471491,"teacher_disagreement_score":0.88193554,"about_ca_system_score_codex":0.00002321216,"about_ca_system_score_gemma":0.00012568524,"threshold_uncertainty_score":0.5845111},"labels":[],"label_agreement":null},{"id":"W2803808538","doi":"10.1109/tc.2018.2837755","title":"Computation of 2D 8×8 DCT Based on the Loeffler Factorization Using Algebraic Integer Encoding","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Discrete cosine transform; Computation; Integer (computer science); Algebraic number; Mathematics; Algorithm; Field-programmable gate array; Block (permutation group theory); Pixel; Discrete mathematics; Computer science; Arithmetic; Image (mathematics); Computer hardware; Combinatorics","score_opus":0.06174886273377754,"score_gpt":0.28961196277806805,"score_spread":0.2278631000442905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803808538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01719365,0.000001055944,0.9801927,0.00031232607,0.0015435537,0.00026490408,0.000007405293,0.000107037944,0.00037736355],"genre_scores_gemma":[0.9809505,6.020678e-7,0.01810586,0.0008522179,0.000056066856,0.0000067351943,0.0000034507075,0.000013090744,0.000011477084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870247,0.00012646819,0.00030863026,0.0003049755,0.00036176518,0.00019570516],"domain_scores_gemma":[0.99905485,0.0002855851,0.00014229966,0.00031463066,0.00014855903,0.000054090513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020133599,0.00016645636,0.00013465226,0.00028419844,0.00022675918,0.00018581396,0.00039029928,0.00004304576,0.000026357084],"category_scores_gemma":[0.000004679629,0.00013462748,0.00009809238,0.0006140114,0.00008438951,0.00056189566,0.000003816469,0.00011392762,0.00003185321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012646639,0.00066457584,0.000070737544,0.000052312877,0.00014549863,0.000004532762,0.004298022,0.48658216,0.026971735,0.0070840353,0.0012154403,0.4727845],"study_design_scores_gemma":[0.00033722114,0.00041160383,0.0001112654,0.000097007745,0.000010538965,0.000002540435,0.00002948528,0.9084165,0.089986436,0.00040451094,0.00005202344,0.00014084426],"about_ca_topic_score_codex":0.000022297761,"about_ca_topic_score_gemma":0.000003823385,"teacher_disagreement_score":0.96375686,"about_ca_system_score_codex":0.00009980943,"about_ca_system_score_gemma":0.00006498256,"threshold_uncertainty_score":0.54899496},"labels":[],"label_agreement":null},{"id":"W2858801556","doi":"10.1109/tc.2018.2854757","title":"Hardware Optimizations and Analysis for the WG-16 Cipher with Tower Field Arithmetic","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Datapath; Computer science; Parallel computing; Arithmetic; Field-programmable gate array; Cipher; Clock rate; Computer hardware; Mathematics; Encryption; Chip","score_opus":0.01361540963635866,"score_gpt":0.2300953382651075,"score_spread":0.21647992862874885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2858801556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080705597,0.000019091798,0.9963891,0.0017796536,0.0004689142,0.0001975456,0.0000076245424,0.000120056175,0.00021096901],"genre_scores_gemma":[0.8908658,0.000011477033,0.10755291,0.0012998168,0.00004572084,0.000048942282,8.28047e-7,0.0000076256665,0.00016688157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925584,0.000035751833,0.00011364788,0.0003052669,0.000119193544,0.00017027566],"domain_scores_gemma":[0.998801,0.0005447087,0.0000368028,0.0004577862,0.00009736085,0.00006236131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012764109,0.00012264164,0.00012583642,0.0002146026,0.00055755425,0.00019210578,0.00038711334,0.000038753824,0.00005328277],"category_scores_gemma":[0.0000020477353,0.00008463482,0.00013780958,0.0009963942,0.00011934474,0.00016467902,0.000003964008,0.000096847005,0.000002835507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025149807,0.000453365,0.0003837568,0.000023117824,0.0036684717,0.0000057986813,0.0040361295,0.45269707,0.000038776576,0.018831454,0.0044474183,0.5151631],"study_design_scores_gemma":[0.0007467184,0.001110606,0.00043234855,0.00003623669,0.0006171572,0.0000152379935,0.00008462682,0.9879832,0.0018143011,0.001220955,0.005584297,0.00035426996],"about_ca_topic_score_codex":0.000014728901,"about_ca_topic_score_gemma":0.00006757835,"teacher_disagreement_score":0.89005876,"about_ca_system_score_codex":0.000012796989,"about_ca_system_score_gemma":0.00001865295,"threshold_uncertainty_score":0.42883128},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Erzincan Üniversitesi; University of Toronto","keywords":"Convolutional neural network; Computer science; Algorithm; Parallel computing; Arithmetic; Artificial intelligence; Mathematics","score_opus":0.0253079684981974,"score_gpt":0.2708273379042991,"score_spread":0.2455193694061017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900613774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027857486,0.0000258283,0.9906004,0.00037700337,0.0054305703,0.00038540259,0.000009451645,0.00029553229,0.0000900496],"genre_scores_gemma":[0.6487516,0.0000012811887,0.34991312,0.0009659402,0.00022547558,0.000035802554,0.0000016473648,0.000016460739,0.000088663364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830186,0.00010107957,0.00028400237,0.0005586741,0.0002570846,0.00049731473],"domain_scores_gemma":[0.9986726,0.0004519097,0.00007951323,0.00045805753,0.00018460285,0.0001533105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039734508,0.00023256369,0.0002177369,0.00018590089,0.0005391367,0.00016966826,0.0006516474,0.000102156104,0.000009765144],"category_scores_gemma":[0.000004710762,0.0002265059,0.00022496395,0.00036945366,0.00021035914,0.000132026,0.0000065884183,0.00021922967,0.00002775401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011636032,0.00016012824,0.0000013192818,0.000009735472,0.000046880104,0.000005227647,0.0003012757,0.88596576,0.0006220561,0.0006959289,0.00093079533,0.11114455],"study_design_scores_gemma":[0.0012828169,0.00028857007,0.000029208017,0.000021439744,0.000017258055,0.000026277314,0.000007384154,0.992027,0.0055447384,0.00018138446,0.00031965278,0.0002543019],"about_ca_topic_score_codex":0.0000103284065,"about_ca_topic_score_gemma":0.00000199244,"teacher_disagreement_score":0.6459659,"about_ca_system_score_codex":0.00008602358,"about_ca_system_score_gemma":0.0000484213,"threshold_uncertainty_score":0.9236643},"labels":[],"label_agreement":null},{"id":"W2901241775","doi":"10.1109/tc.2018.2878829","title":"Faster Key Compression for Isogeny-Based Cryptosystems","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Public Works and Government Services Canada","keywords":"Isogeny; Computer science; Cryptosystem; Cryptography; Key (lock); Elliptic curve cryptography; Overhead (engineering); Compression (physics); Data compression; Key encapsulation; Theoretical computer science; Post-quantum cryptography; Public-key cryptography; Computer engineering; Key exchange; Algorithm; Mathematics; Encryption; Computer security; Elliptic curve; Physics","score_opus":0.018656392660759007,"score_gpt":0.2484637332216778,"score_spread":0.2298073405609188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901241775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005392617,0.000021111438,0.9890393,0.0006303375,0.003923111,0.00045106464,0.000016249827,0.0003373654,0.00018882145],"genre_scores_gemma":[0.860731,0.0000020980117,0.1381267,0.00085021765,0.00016401238,0.00006147756,0.0000016187552,0.000017995246,0.000044856013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984758,0.00008072023,0.0002789269,0.00052372995,0.0002723794,0.00036843607],"domain_scores_gemma":[0.9987015,0.0002705916,0.00008058713,0.0006506757,0.00014686803,0.0001497704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015756254,0.00022252467,0.00021248093,0.0003369569,0.0004906809,0.00018386821,0.0007299098,0.00010302778,0.000016610467],"category_scores_gemma":[0.000001240097,0.00019563269,0.00026898383,0.00048326058,0.00012866728,0.00023438754,0.0000040441587,0.00014377596,0.00007529681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076212257,0.0029087232,0.00013430935,0.00047015594,0.00066109514,0.000042197295,0.0052808,0.13868082,0.029745132,0.012730118,0.024068914,0.7845156],"study_design_scores_gemma":[0.001852747,0.0009915072,0.00011401266,0.00021394614,0.0000292828,0.000016456723,0.000022319487,0.8898907,0.09311724,0.0005395855,0.01275812,0.00045412983],"about_ca_topic_score_codex":0.000016975135,"about_ca_topic_score_gemma":0.000016064392,"teacher_disagreement_score":0.8553384,"about_ca_system_score_codex":0.000032558135,"about_ca_system_score_gemma":0.000053884556,"threshold_uncertainty_score":0.797767},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01378502794709515,"score_gpt":0.24885029591215002,"score_spread":0.23506526796505486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914973130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06665099,0.000008043329,0.9274907,0.00026939355,0.0043313405,0.00065464457,0.000013107454,0.00043230853,0.00014943464],"genre_scores_gemma":[0.52198523,0.000003006056,0.4775546,0.00026255313,0.000042465726,0.000015444162,0.0000013839448,0.000026977901,0.00010835744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966431,0.0002762485,0.00053328235,0.0010935062,0.00085139886,0.0006024667],"domain_scores_gemma":[0.99675924,0.0013712868,0.00017845184,0.0012041115,0.00016123969,0.00032564762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058961863,0.00042641768,0.0004769541,0.0003419548,0.0002944301,0.00023139697,0.0010786691,0.00013089094,0.00009289229],"category_scores_gemma":[0.000014853151,0.0003345581,0.0002604279,0.000880371,0.00007394645,0.00027179474,0.000023358834,0.0004966351,0.0005157667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105357074,0.00043121976,0.000036738726,0.000012944566,0.000038366103,0.000023078659,0.00040943135,0.4098108,0.0024235179,0.000043461605,0.00017290574,0.5864922],"study_design_scores_gemma":[0.0022402178,0.0012346763,0.0003779868,0.0001561181,0.000015171054,0.00004426095,0.00004958332,0.97279304,0.021449007,0.0000629079,0.0010717872,0.00050525914],"about_ca_topic_score_codex":0.000046882436,"about_ca_topic_score_gemma":0.000008204964,"teacher_disagreement_score":0.5859869,"about_ca_system_score_codex":0.00013363779,"about_ca_system_score_gemma":0.00007912268,"threshold_uncertainty_score":0.99991065},"labels":[],"label_agreement":null},{"id":"W2950297715","doi":"10.1109/tc.2019.2922601","title":"New Low-Area Designs for the AES Forward, Inverse and Combined S-Boxes","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Western University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Application-specific integrated circuit; S-box; Computer science; Advanced Encryption Standard; Cryptography; Block (permutation group theory); Inverse; CMOS; Computer engineering; Algorithm; Embedded system; Block cipher; Mathematics; Electronic engineering; Engineering","score_opus":0.02604376551896256,"score_gpt":0.2581856610882511,"score_spread":0.23214189556928852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950297715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017911308,0.000018839364,0.9783671,0.0015662978,0.0013208957,0.00066544337,0.000014093249,0.000109068395,0.00002695738],"genre_scores_gemma":[0.9209028,0.000046103,0.077893294,0.0009467376,0.000026770089,0.000047496393,0.000002338968,0.000011450358,0.0001230164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999074,0.000032812448,0.00018336983,0.00031140997,0.00016496437,0.00023348493],"domain_scores_gemma":[0.9988373,0.00054901576,0.00005080074,0.00041222028,0.000047750735,0.000102937374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001523321,0.0001498247,0.00014223682,0.00014885319,0.000334426,0.00020691882,0.00043126638,0.000041514755,0.000036462636],"category_scores_gemma":[0.000001197152,0.00011743968,0.00013249213,0.00031561442,0.000043553442,0.00029746976,0.0000054365337,0.000113593116,0.000013173945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029251495,0.000539595,0.0004561798,0.00012880626,0.0006659501,0.000006280343,0.010844217,0.07987887,0.001529804,0.044112787,0.035662808,0.8258822],"study_design_scores_gemma":[0.0035639622,0.00087420584,0.0006103575,0.00005224789,0.000065452994,0.00001719458,0.0003328707,0.9808676,0.0034148179,0.003089519,0.0066828965,0.00042885228],"about_ca_topic_score_codex":0.000110241155,"about_ca_topic_score_gemma":0.00015194829,"teacher_disagreement_score":0.9029915,"about_ca_system_score_codex":0.000022230588,"about_ca_system_score_gemma":0.00006106726,"threshold_uncertainty_score":0.47890514},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.008221479260659581,"score_gpt":0.1870785827645566,"score_spread":0.17885710350389702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954748826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41585404,0.000031522228,0.5835116,0.000005046718,0.00028120054,0.00017676053,0.0000075709054,0.000091407506,0.000040836258],"genre_scores_gemma":[0.9854185,0.000043292137,0.014462431,0.000021869437,0.0000026752289,0.000010203523,0.0000013607623,0.000023847375,0.000015801543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991993,0.00002334617,0.00020121443,0.00022927455,0.00014752994,0.00019935441],"domain_scores_gemma":[0.9994926,0.0001342187,0.000030524752,0.00023929129,0.000021729504,0.00008162251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012279545,0.00017737929,0.00029417538,0.0005178252,0.00004730579,0.00002774003,0.000086995344,0.000064928776,0.00002765839],"category_scores_gemma":[3.5914783e-7,0.00017146417,0.000072573326,0.0004881277,0.000054800723,0.000083036175,0.0000012816056,0.00012529433,0.000008455374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026435211,0.000037019883,0.000095207884,0.000034691,0.00048997597,0.000001190046,0.00077075063,0.99086875,0.004406624,0.000005498495,0.000027542143,0.0032362915],"study_design_scores_gemma":[0.00051025354,0.000093093106,0.0008077063,0.000030307006,0.00020845773,0.0000026020693,0.000040891606,0.98442256,0.013683537,0.0000012291175,0.000019989038,0.00017934873],"about_ca_topic_score_codex":0.0000046609866,"about_ca_topic_score_gemma":8.665332e-7,"teacher_disagreement_score":0.56956446,"about_ca_system_score_codex":0.000042675674,"about_ca_system_score_gemma":0.000007678445,"threshold_uncertainty_score":0.6992106},"labels":[],"label_agreement":null},{"id":"W2967852196","doi":"10.1109/tc.2019.2906881","title":"An Absorbing Markov Chain Based Model to Solve Computation and Communication Tradeoff in GPU-Accelerated MDRUs for Safety Confirmation in Disaster Scenarios","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Thunder Bay Regional Research Institute","funders":"","keywords":"Computer science; Overhead (engineering); Computation; Markov chain; Flexibility (engineering); Distributed computing; Network packet; Shared resource; Parallel computing; Embedded system; Computer network; Algorithm","score_opus":0.02583729811551938,"score_gpt":0.26515017723722983,"score_spread":0.23931287912171045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967852196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13629536,0.000012348485,0.8614904,0.0007823007,0.00029921948,0.0009665417,0.000012652276,0.00012187595,0.000019276134],"genre_scores_gemma":[0.8277788,0.0000073523684,0.17123975,0.0008488092,0.000009019205,0.00007031129,0.000024811516,0.000017137194,0.0000040219647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852794,0.000110544985,0.00043216496,0.00046434256,0.00017373369,0.00029129843],"domain_scores_gemma":[0.9989248,0.00038554703,0.00009008535,0.00043019353,0.000063207306,0.00010614768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040282798,0.00020509252,0.00025715807,0.00041843168,0.00013528885,0.00018920307,0.0003751736,0.00010843997,0.0000030656922],"category_scores_gemma":[0.0000020808147,0.00022743602,0.000053202264,0.0005337914,0.000024630026,0.0006433091,0.000005197952,0.00022241018,0.0000053965896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013040662,0.00015337809,0.000060936993,0.000020989684,0.000006142701,5.952516e-7,0.0019870612,0.93346566,0.00025964787,0.00024458027,0.000026764716,0.06364385],"study_design_scores_gemma":[0.0020797318,0.00020485798,0.0014320336,0.00017014188,0.000004604807,0.0000022335187,0.000061334475,0.99535525,0.00021920959,0.00019960468,0.000018660692,0.00025234287],"about_ca_topic_score_codex":0.000117733376,"about_ca_topic_score_gemma":0.00040795893,"teacher_disagreement_score":0.69148344,"about_ca_system_score_codex":0.00016724103,"about_ca_system_score_gemma":0.00005930713,"threshold_uncertainty_score":0.92745715},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.053461033632081566,"score_gpt":0.3028072657203022,"score_spread":0.24934623208822063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971946864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013204516,0.000047259287,0.9832313,0.00044062556,0.0016078772,0.00095811725,0.0000062849153,0.00046784736,0.000036169546],"genre_scores_gemma":[0.6293538,0.0000186615,0.36990714,0.00041345097,0.000090876434,0.000049203485,0.0000028621535,0.000022715285,0.00014128913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810904,0.00005686476,0.00034767558,0.00074310176,0.0002130585,0.0005302517],"domain_scores_gemma":[0.9970868,0.0017705682,0.00012117552,0.0006867619,0.0000744654,0.00026018784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013121478,0.00029396408,0.00030060392,0.00014561146,0.00036606492,0.00017996073,0.0007314142,0.00009937916,0.000010450975],"category_scores_gemma":[0.0000067757364,0.00030201426,0.00012340427,0.0006328118,0.00004238851,0.0006853032,0.000017483928,0.0002988908,0.00003842933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027264541,0.00001829259,0.00003823456,0.0000048030593,0.000012736022,6.278415e-7,0.00022635405,0.6157026,0.00026968005,0.00046883733,0.000053705222,0.38317683],"study_design_scores_gemma":[0.0013049415,0.00023687273,0.0003343974,0.000052072075,0.0000113707565,0.000013790316,0.000016178152,0.99310404,0.0009420931,0.0014547904,0.002201666,0.0003277777],"about_ca_topic_score_codex":0.000019987763,"about_ca_topic_score_gemma":0.00003335709,"teacher_disagreement_score":0.6161493,"about_ca_system_score_codex":0.00004304483,"about_ca_system_score_gemma":0.000051311876,"threshold_uncertainty_score":0.9999432},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016998031474346705,"score_gpt":0.2521783771278744,"score_spread":0.2351803456535277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973613048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037816565,0.000021034135,0.9593658,0.0005142062,0.0013249379,0.0006353052,0.000015171055,0.00024104462,0.000065980974],"genre_scores_gemma":[0.8675968,0.000003660926,0.13165994,0.0005515096,0.00006316445,0.000038732454,0.0000020134642,0.000013597374,0.00007058033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877083,0.000026037447,0.00021246023,0.00052897225,0.0001678501,0.0002938681],"domain_scores_gemma":[0.99893343,0.00042454377,0.0000720225,0.00037496432,0.00007852589,0.00011653657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008588249,0.00016993906,0.0001675412,0.00011521198,0.00030874033,0.000072672075,0.00040817334,0.000051022194,0.0000055855903],"category_scores_gemma":[8.8090974e-7,0.00017630296,0.000084531144,0.00030739917,0.00005514387,0.00016622899,0.0000088268025,0.00015852989,0.000059128244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016105769,0.00012051184,0.000016310352,0.000017227385,0.000025091214,6.833618e-7,0.00020565,0.8987205,0.0011568227,0.008105385,0.00030387522,0.09131182],"study_design_scores_gemma":[0.0006657093,0.00011300662,0.00025436943,0.000026829734,0.0000059506906,0.000017245362,0.000011659787,0.99501526,0.0024734163,0.0001657592,0.0010476039,0.00020316133],"about_ca_topic_score_codex":0.0000017926927,"about_ca_topic_score_gemma":0.0000010857855,"teacher_disagreement_score":0.8297802,"about_ca_system_score_codex":0.00006501337,"about_ca_system_score_gemma":0.000035741574,"threshold_uncertainty_score":0.7189426},"labels":[],"label_agreement":null},{"id":"W2989372335","doi":"10.1109/tc.2019.2953751","title":"Approximate Restoring Dividers Using Inexact Cells and Estimation From Partial Remainders","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Mathematics; Algorithm; Arithmetic; Applied mathematics","score_opus":0.014416317405753014,"score_gpt":0.20516187754648046,"score_spread":0.19074556014072744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989372335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44170946,0.000013451518,0.5560009,0.000011498688,0.001839839,0.00015667568,0.0000073651154,0.0002294304,0.000031369997],"genre_scores_gemma":[0.9759729,0.000024679275,0.02384001,0.000034824174,0.00005676642,0.00000806285,0.0000031366528,0.000050465656,0.000009155849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989663,0.000029243813,0.00023365165,0.00027920416,0.00020629683,0.0002853088],"domain_scores_gemma":[0.99945426,0.00011369072,0.0000366342,0.00028423348,0.000014678776,0.000096480144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009905533,0.0002226578,0.00020546652,0.0001939263,0.000109451,0.00008651681,0.000113833084,0.00009592158,0.000024510484],"category_scores_gemma":[6.612074e-7,0.00024576773,0.00005657845,0.00018585137,0.00003398933,0.00046817985,0.000001690271,0.00024286614,0.00005762713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016584061,0.000015864853,0.000042631003,0.00004141348,0.000059530346,0.0000028968775,0.00055728474,0.974224,0.016824258,0.0000030073627,0.00005530975,0.008157253],"study_design_scores_gemma":[0.0005388483,0.0000420633,0.000084807194,0.000115936746,0.000034856483,0.0000038230273,0.00004671927,0.937782,0.061014432,0.000016963386,0.00006429276,0.00025528818],"about_ca_topic_score_codex":0.00008502892,"about_ca_topic_score_gemma":0.0000064630294,"teacher_disagreement_score":0.53426343,"about_ca_system_score_codex":0.0001651466,"about_ca_system_score_gemma":0.000016237089,"threshold_uncertainty_score":0.99999946},"labels":[],"label_agreement":null},{"id":"W3011787975","doi":"10.1109/tc.2020.2979460","title":"Analysis and Efficient Implementations of a Class of Composited de Bruijn Sequences","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Institute of Standards and Technology; U.S. Department of Commerce","keywords":"De Bruijn sequence; Sequence (biology); Randomness; Computer science; Tuple; Discrete mathematics; Binary number; Mathematics; Algorithm; Combinatorics; Arithmetic; Statistics","score_opus":0.017455396072236968,"score_gpt":0.25407952206589374,"score_spread":0.23662412599365676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011787975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25077325,0.000009707146,0.74855703,0.00045336183,0.000058669528,0.00006421377,0.000018069295,0.000043147324,0.000022549797],"genre_scores_gemma":[0.96697766,0.000006715178,0.032765098,0.00023764599,0.0000045948027,0.000003939579,9.4415543e-7,0.0000027555175,6.349223e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991968,0.000094161755,0.00022986063,0.0002124946,0.0001473376,0.00011931437],"domain_scores_gemma":[0.99938834,0.00020196565,0.000091592156,0.00017992443,0.000048329333,0.00008987417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121974575,0.000086755994,0.00018969268,0.0003074474,0.00009067769,0.000027926913,0.00029970662,0.000023430186,0.00000922338],"category_scores_gemma":[0.0000010106093,0.000087562796,0.00016327793,0.0015772718,0.00009818872,0.00006843235,0.000004445861,0.00007440195,6.6076524e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008064132,0.00034312185,0.0017280241,0.00006825158,0.0011856433,0.000005318165,0.009151631,0.90258217,0.024050873,0.010482444,0.000033394797,0.050288476],"study_design_scores_gemma":[0.00043744227,0.00039209993,0.002473591,0.00002267304,0.00025132947,0.0000038198355,0.00014688764,0.94108486,0.0548121,0.00021061578,0.000028409817,0.00013616792],"about_ca_topic_score_codex":0.000051452393,"about_ca_topic_score_gemma":0.000013995661,"teacher_disagreement_score":0.7162044,"about_ca_system_score_codex":0.000011509377,"about_ca_system_score_gemma":0.00002855832,"threshold_uncertainty_score":0.3570707},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.015841727702311306,"score_gpt":0.21909670907695167,"score_spread":0.20325498137464038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023146441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06717589,0.00003340521,0.9309976,0.000117182804,0.00091982906,0.0001944831,0.000024137278,0.00050476246,0.0000327179],"genre_scores_gemma":[0.9895288,0.0000050389212,0.0095289685,0.0007290571,0.00013767144,0.00002261031,0.0000051953116,0.000038330076,0.0000043370524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917763,0.000020498595,0.00018112797,0.00026176733,0.000087040265,0.00027193126],"domain_scores_gemma":[0.99954814,0.0001281329,0.000024530354,0.00012194688,0.000032189477,0.00014507586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000035066707,0.00018689503,0.00017554917,0.000073778545,0.00013668758,0.000041010615,0.00016416909,0.00006004055,0.0000062150325],"category_scores_gemma":[0.0000011670714,0.00019479624,0.00010820889,0.00021942463,0.000029851744,0.00008317797,4.8088805e-7,0.0001728618,0.000005073288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034213837,0.000037523143,6.4179704e-7,0.000020812467,0.000038950366,0.0000013270887,0.00045771737,0.9242509,0.008740656,0.000011634839,0.00015038796,0.06625524],"study_design_scores_gemma":[0.00062011374,0.00025785813,0.000012634919,0.000012356538,0.000016441174,0.0000022604706,0.00006155599,0.9713885,0.027117232,0.0000034158365,0.0002995937,0.00020801071],"about_ca_topic_score_codex":0.000005800874,"about_ca_topic_score_gemma":0.0000054542634,"teacher_disagreement_score":0.9223529,"about_ca_system_score_codex":0.000055640303,"about_ca_system_score_gemma":0.000009122514,"threshold_uncertainty_score":0.794356},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.10040542067053455,"score_gpt":0.3646781160977232,"score_spread":0.2642726954271887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082110198","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032097795,0.000013741498,0.8949921,0.099118195,0.0013949687,0.00039122984,0.000032745284,0.000835581,0.000011626348],"genre_scores_gemma":[0.27884063,0.000041332853,0.71819514,0.002805255,0.00008494126,0.0000112827465,0.0000053329713,0.000014839776,0.0000012247825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792415,0.000120953795,0.0004660163,0.0008954619,0.00031273067,0.00028071247],"domain_scores_gemma":[0.9950283,0.0018793416,0.00015944961,0.0026221378,0.00010530962,0.0002054376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044232226,0.0002117842,0.000261872,0.00011768564,0.00023328012,0.0002320467,0.0052511725,0.00024404353,0.0000036593733],"category_scores_gemma":[0.0005637123,0.00020708416,0.00013210291,0.00043877398,0.000119879085,0.0005528044,0.0003311453,0.00049150904,0.00002814625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041259188,0.00033646525,0.000054622844,0.00014893395,0.00009729412,0.000022654718,0.00014489357,0.0031267742,0.00031233658,0.001184846,0.080111645,0.91404694],"study_design_scores_gemma":[0.00094172644,0.00044570264,0.00014230513,0.000074731535,0.000023818808,0.000009976702,0.000019396228,0.98536205,0.0013795508,0.0067181583,0.004669281,0.000213276],"about_ca_topic_score_codex":0.0000075474213,"about_ca_topic_score_gemma":0.000009842233,"teacher_disagreement_score":0.9822353,"about_ca_system_score_codex":0.00004649892,"about_ca_system_score_gemma":0.000114308714,"threshold_uncertainty_score":0.9758072},"labels":[],"label_agreement":null},{"id":"W3112375100","doi":"10.1109/tc.2020.3044234","title":"Speculative Barriers With Transactional Memory","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Junta de Andalucía; Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Transactional memory; Computer science; Thread (computing); Parallel computing; Transaction processing; Operating system; Database transaction; Speculative multithreading; Speculative execution; Concurrency control; Speculation; Transactional leadership; Leverage (statistics); Commit; Programming language; Multithreading; Database; Artificial intelligence","score_opus":0.014166590642790959,"score_gpt":0.20932990562909903,"score_spread":0.19516331498630807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112375100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020741725,0.000013137699,0.9924699,0.0031481956,0.0008297041,0.00023228585,0.000043454358,0.00037199332,0.0008171639],"genre_scores_gemma":[0.9774548,0.0000032882192,0.020128042,0.0022188236,0.00007843931,0.000024371364,0.0000019757138,0.000016795659,0.00007350041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839723,0.000069768736,0.00024144955,0.00056615693,0.00043327612,0.00029212233],"domain_scores_gemma":[0.9990282,0.000077088844,0.00006967483,0.0003280806,0.00008069943,0.00041627415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006941721,0.00024086371,0.00024542928,0.00008018022,0.00025391753,0.00014055114,0.0005691603,0.00006501935,0.00006486164],"category_scores_gemma":[0.0000010930415,0.00021293927,0.00013989041,0.0006188404,0.00007949967,0.0004984939,0.0000014683959,0.00030003724,0.00010009124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020095987,0.00014648726,0.000011381699,0.00004081007,0.00029821193,0.00014519009,0.004507168,0.913652,0.00057954766,0.0020341359,0.002561394,0.07582273],"study_design_scores_gemma":[0.0025908567,0.00093803066,0.00016042181,0.000120843964,0.00003827346,0.000110551664,0.0003162853,0.97319967,0.012772352,0.00006607461,0.008848267,0.00083837134],"about_ca_topic_score_codex":0.000016469876,"about_ca_topic_score_gemma":0.000006495849,"teacher_disagreement_score":0.9753806,"about_ca_system_score_codex":0.00006396901,"about_ca_system_score_gemma":0.00012064161,"threshold_uncertainty_score":0.8683411},"labels":[],"label_agreement":null},{"id":"W3127874933","doi":"10.1109/tc.2007.250622","title":"Low-Weight Polynomial Form Integers for Efficient Modular Multiplication","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Modular arithmetic; Mathematics; Moduli; Elliptic curve; Mersenne prime; Integer (computer science); Polynomial; Prime (order theory); Finite field; Discrete mathematics; Multiplication (music); Cryptosystem; Arithmetic; Cryptography; Pure mathematics; Combinatorics; Computer science; Algorithm","score_opus":0.006939187852687204,"score_gpt":0.21135899217323653,"score_spread":0.20441980432054932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127874933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03480314,0.000020899315,0.9617912,0.00060922856,0.0018974887,0.00050428126,0.000014204619,0.00028076724,0.00007879508],"genre_scores_gemma":[0.91971743,0.0000044252606,0.07984167,0.00017461536,0.00011068054,0.000094034,0.0000043263985,0.000015240478,0.00003756637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986407,0.00002967216,0.0002844037,0.00048520791,0.00022025403,0.00033974583],"domain_scores_gemma":[0.9990749,0.00018405882,0.00007580866,0.0004982969,0.000078276724,0.000088659945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012781969,0.00019874294,0.00016795761,0.00034312456,0.0003408205,0.00012229732,0.00054616743,0.00009051885,0.0000030466554],"category_scores_gemma":[0.0000010345248,0.0001873653,0.00029703262,0.00047750247,0.0000726569,0.00017400805,0.0000035037028,0.00015035094,0.000019898747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006595886,0.00091854844,0.000007957307,0.00003487702,0.00006432583,0.0000044018675,0.0003952675,0.814854,0.005812848,0.003349405,0.0015308158,0.17296158],"study_design_scores_gemma":[0.0011236421,0.00016365308,0.00032198976,0.00003852065,0.000019021094,0.000010759937,0.0000089914165,0.92267746,0.07374016,0.00041730935,0.0012008812,0.0002776254],"about_ca_topic_score_codex":0.000071843955,"about_ca_topic_score_gemma":0.000021355941,"teacher_disagreement_score":0.8849143,"about_ca_system_score_codex":0.00008442506,"about_ca_system_score_gemma":0.000037423793,"threshold_uncertainty_score":0.76405346},"labels":[],"label_agreement":null},{"id":"W3137662336","doi":"10.1109/tc.2021.3066466","title":"Efficient Memory Arbitration in High-Level Synthesis From Multi-Threaded Code","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council; Royal Academy of Engineering","keywords":"Computer science; Satisfiability modulo theories; Parallel computing; Programming language; Correctness; Memory model; High-level synthesis; Memory bandwidth; Embedded system; Field-programmable gate array; Shared memory","score_opus":0.046586142806392394,"score_gpt":0.26105631811720165,"score_spread":0.21447017531080925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137662336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028849995,0.00003928499,0.9680443,0.00043619663,0.0015762929,0.00031354354,0.000047781094,0.00058611593,0.00010651543],"genre_scores_gemma":[0.70158666,0.0000066288007,0.29789293,0.00032171592,0.000030381725,0.000091347014,0.000002479003,0.000017810324,0.00005004275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976008,0.0003687871,0.00050236564,0.0007806463,0.0004135296,0.0003338732],"domain_scores_gemma":[0.99807245,0.0006681372,0.00011086384,0.000919408,0.000111902555,0.00011721603],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000301532,0.00026644734,0.0003563293,0.00033360583,0.00013712358,0.00016688215,0.00066970463,0.00016710907,0.00002361513],"category_scores_gemma":[0.000011359908,0.00029295043,0.00014716122,0.00069614465,0.000046521,0.00019929504,0.000007661477,0.00034960554,0.00006136752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050468658,0.0022557615,0.000039464558,0.000055493136,0.00019614256,0.00049874187,0.0034745284,0.789913,0.063107215,0.0016376444,0.0007268886,0.13804464],"study_design_scores_gemma":[0.00048536336,0.000035620327,0.00036175363,0.0001946224,0.000012830419,0.000017819366,0.000046910256,0.590558,0.407839,0.00014938621,0.000019589947,0.00027914625],"about_ca_topic_score_codex":0.0005141532,"about_ca_topic_score_gemma":0.0005144685,"teacher_disagreement_score":0.67273664,"about_ca_system_score_codex":0.00027062366,"about_ca_system_score_gemma":0.00019487449,"threshold_uncertainty_score":0.99995226},"labels":[],"label_agreement":null},{"id":"W4206631564","doi":"10.1109/tc.2021.3133828","title":"Stop and Look: A Novel Checkpointing and Debugging Flow for FPGAs","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Radiation Effects in Electronics","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Computer science; Debugging; Embedded system; State (computer science); Overhead (engineering); FPGA prototype; Place and route; Finite-state machine; Context (archaeology); Reconfigurable computing; Computer hardware; Operating system","score_opus":0.007822088240934213,"score_gpt":0.20457680136214484,"score_spread":0.19675471312121062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206631564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055925466,0.0002917123,0.94261426,0.000121829675,0.0006382051,0.00013666836,0.000010625651,0.0002246874,0.000036554764],"genre_scores_gemma":[0.90759623,0.000067643836,0.09205031,0.00012960417,0.000057243124,0.000027790355,0.0000023056584,0.000036771904,0.000032097076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942935,0.000010289167,0.00011790662,0.00018044913,0.00006324611,0.00019877024],"domain_scores_gemma":[0.99957,0.00022605734,0.000013359603,0.00010794708,0.000025510206,0.000057098794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000796687,0.00011687779,0.000121879435,0.000075484735,0.000114849565,0.000055904296,0.00003690621,0.00005071933,0.0000035555045],"category_scores_gemma":[0.0000040023897,0.00014114624,0.000042308944,0.000108471366,0.000019017147,0.00009699879,7.444735e-7,0.00014666228,0.0000012236169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034837183,0.00001546335,9.85774e-7,0.000066765395,0.000060350038,0.0000014222155,0.00023232013,0.8870636,0.0050849463,0.00003659943,0.00006671134,0.107367344],"study_design_scores_gemma":[0.00058268337,0.000030286355,0.000026930427,0.000048046873,0.000029444642,0.000041285148,0.000020023552,0.9776349,0.020781746,0.000034953402,0.00063132594,0.00013836924],"about_ca_topic_score_codex":0.0000024575654,"about_ca_topic_score_gemma":0.000011812174,"teacher_disagreement_score":0.85167074,"about_ca_system_score_codex":0.0000621334,"about_ca_system_score_gemma":0.00002131579,"threshold_uncertainty_score":0.5755777},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028317525118953885,"score_gpt":0.24627229614047128,"score_spread":0.2179547710215174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212962064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010629824,0.00010597389,0.9839269,0.00306517,0.0010998697,0.00042411775,0.00007431467,0.0005007361,0.00017307476],"genre_scores_gemma":[0.9721575,0.000054622582,0.026847044,0.0005714341,0.000020090696,0.00019710696,0.000007357632,0.000014350943,0.00013053975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980074,0.00018160947,0.00028755376,0.00088339986,0.0003251956,0.00031481564],"domain_scores_gemma":[0.9979653,0.00017969469,0.00007719148,0.0016526025,0.000023501781,0.00010173226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060535397,0.00020117011,0.00019712585,0.00026275747,0.00087923463,0.00007739091,0.002055721,0.000054778688,0.000038656857],"category_scores_gemma":[8.179425e-7,0.00022748268,0.000055329143,0.00059378153,0.0001261424,0.000082506536,0.000092702016,0.000433346,0.000007713711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015046404,0.0021113022,0.000094086405,0.00014476951,0.00054601755,0.00018065695,0.0017263654,0.091649,0.00012244513,0.051255085,0.009032918,0.8429869],"study_design_scores_gemma":[0.0010761326,0.00015746936,0.00040510553,0.000023882949,0.000059493723,0.00015729935,0.00028282878,0.9685236,0.00036811503,0.0013155616,0.0271288,0.0005017127],"about_ca_topic_score_codex":0.00001751376,"about_ca_topic_score_gemma":0.00001120256,"teacher_disagreement_score":0.96152765,"about_ca_system_score_codex":0.00006645432,"about_ca_system_score_gemma":0.000027287044,"threshold_uncertainty_score":0.9276475},"labels":[],"label_agreement":null},{"id":"W4233307210","doi":"10.1109/tc.2007.70834","title":"A New Finite-Field Multiplier Using Redundant Representation","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplier (economics); Finite field; Critical path method; Mathematics; Algorithm; Representation (politics); Computer science; Arithmetic; Discrete mathematics","score_opus":0.046651435540987045,"score_gpt":0.2699889923095845,"score_spread":0.22333755676859746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233307210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021712424,0.000011609452,0.9756148,0.00031920706,0.0016982646,0.00012751913,0.0000012706064,0.00029518185,0.00021972941],"genre_scores_gemma":[0.7987221,0.000012451541,0.20052513,0.0005277906,0.00006860865,0.00000466182,3.6234115e-7,0.0000100156,0.00012887926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883443,0.00007957441,0.0002123906,0.0004064966,0.00023326276,0.00023385027],"domain_scores_gemma":[0.99882495,0.00039319176,0.00006127045,0.00054113654,0.000038723647,0.00014073245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008797154,0.00015594796,0.00014476807,0.00028928957,0.00041707975,0.000080037324,0.00047170313,0.00006495149,0.00003182584],"category_scores_gemma":[0.0000042921674,0.00016359567,0.0001867576,0.0007032148,0.000038988655,0.0003968271,0.0000048664347,0.0002096017,0.00003681308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016251317,0.00032740642,0.00007832022,0.000010760754,0.00014191188,0.00016802677,0.005209444,0.5221926,0.0038909144,0.0033389141,0.00276283,0.46171638],"study_design_scores_gemma":[0.001342949,0.0004340003,0.00019497368,0.00009699088,0.000030151412,0.00031476573,0.000042207837,0.9259354,0.067197695,0.0025818737,0.0012691496,0.0005598737],"about_ca_topic_score_codex":0.00010681096,"about_ca_topic_score_gemma":0.000005932866,"teacher_disagreement_score":0.77700967,"about_ca_system_score_codex":0.0000371767,"about_ca_system_score_gemma":0.000076619195,"threshold_uncertainty_score":0.6671238},"labels":[],"label_agreement":null},{"id":"W4301047919","doi":"10.1109/tc.2012.208","title":"Measuring Temporal Lags in Delay-Tolerant Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network","score_opus":0.041300068570715824,"score_gpt":0.2315653517016009,"score_spread":0.19026528313088506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301047919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008268037,0.00015436305,0.9853417,0.00023745977,0.0048052236,0.00022361847,0.0000026122004,0.0002983468,0.0006686042],"genre_scores_gemma":[0.9710519,0.000032826032,0.027727695,0.0008294669,0.00023904041,0.000026526925,0.0000021780254,0.000025156016,0.00006525651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774396,0.00011846349,0.0004711365,0.00045227198,0.00038132395,0.0008328159],"domain_scores_gemma":[0.9986724,0.00021951202,0.00009593155,0.00060157146,0.000046365763,0.00036418947],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005141269,0.00030578757,0.00033278365,0.0002909113,0.00021928921,0.00013896855,0.00068015023,0.00016688161,0.000021526223],"category_scores_gemma":[4.162586e-7,0.0003071808,0.00016693692,0.00063735584,0.00006026626,0.0007587892,0.000009452283,0.00056882587,0.000070592694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053776388,0.00062443066,0.0008895107,0.000014247036,0.00006439609,0.00011921022,0.0010493428,0.50638837,0.000012892487,0.00092900696,0.0009859939,0.48886883],"study_design_scores_gemma":[0.00063602754,0.000074195195,0.0002520704,0.000094238254,0.000011818255,0.00009158009,0.000016218648,0.99742657,0.000096252494,0.000059923226,0.00087387854,0.00036722745],"about_ca_topic_score_codex":0.00008906363,"about_ca_topic_score_gemma":0.000036636557,"teacher_disagreement_score":0.9627838,"about_ca_system_score_codex":0.00012797242,"about_ca_system_score_gemma":0.00006557344,"threshold_uncertainty_score":0.999938},"labels":[],"label_agreement":null},{"id":"W4313154430","doi":"10.1109/tc.2022.3224377","title":"PyTracer: Automatically Profiling Numerical Instabilities in Python","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Computational Physics and Python Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Python (programming language); Computer science; Scalability; Numerical stability; Programming language; Monte Carlo method; Numerical analysis; Computational science; Algorithm; Theoretical computer science; Mathematics; Operating system; Statistics","score_opus":0.014846849164747438,"score_gpt":0.24681797670542116,"score_spread":0.23197112754067373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313154430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018370649,0.0000090525955,0.9780166,0.001764257,0.000721731,0.00031890208,0.00001626831,0.00034105478,0.00044146276],"genre_scores_gemma":[0.9139829,0.0000014710822,0.085087806,0.0005904657,0.000023926586,0.00025413407,0.000003947296,0.000014853223,0.000040489296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838996,0.00014815814,0.00033215372,0.00044333487,0.00042945438,0.00025696435],"domain_scores_gemma":[0.99896383,0.00040725007,0.00006221245,0.00043718316,0.000041791383,0.000087738576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023114882,0.00015281868,0.00017469106,0.00025652617,0.00038411815,0.000101931335,0.0006541773,0.000025474417,0.00004223601],"category_scores_gemma":[0.0000017497549,0.00017588784,0.00011383734,0.000992522,0.00003734949,0.0002348026,0.000018133906,0.0004118339,0.000034262895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009610302,0.0004517068,0.000016767824,0.000007990936,0.0000125271235,0.0000063364396,0.0007125698,0.88751894,0.000121900615,0.0365327,0.00012502915,0.07448389],"study_design_scores_gemma":[0.00032572102,0.00013360068,0.00031581265,0.000008181559,0.0000033209567,0.000018297746,0.000066542736,0.9898763,0.0005212032,0.007426796,0.0010978273,0.00020642467],"about_ca_topic_score_codex":0.00003438175,"about_ca_topic_score_gemma":0.000004356071,"teacher_disagreement_score":0.89561224,"about_ca_system_score_codex":0.00021021707,"about_ca_system_score_gemma":0.00015086797,"threshold_uncertainty_score":0.71724975},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.035538685316916285,"score_gpt":0.254171627796285,"score_spread":0.2186329424793687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323022585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100581385,0.000010195673,0.8907554,0.0069850488,0.00015241862,0.0003091163,0.000023016099,0.0011618661,0.000021514574],"genre_scores_gemma":[0.9445943,0.0000043564664,0.054968484,0.000279192,0.00001907708,0.00006914246,0.000012678653,0.000014635081,0.000038118622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860406,0.000045284218,0.00019555636,0.0006669517,0.00021430546,0.0002738692],"domain_scores_gemma":[0.9980818,0.0002852105,0.00006586425,0.0014320473,0.000048087702,0.00008700989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002584477,0.00017855816,0.00016269155,0.00036199272,0.00037003262,0.00009678351,0.0012853926,0.00009760451,0.0000034262541],"category_scores_gemma":[0.000004480082,0.00016585935,0.000031934364,0.0012772335,0.0001067458,0.0001635301,0.000021318358,0.0002579044,0.000012427252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013062338,0.0009995325,0.0003578482,0.0001715002,0.00034788746,0.00009291508,0.0032685115,0.29425806,0.0017915192,0.021261046,0.009763949,0.6675566],"study_design_scores_gemma":[0.00062748895,0.00013927711,0.00033690128,0.0000342576,0.000013143602,0.000011935047,0.000013596565,0.99471945,0.0019605686,0.0008602638,0.0010895861,0.00019355331],"about_ca_topic_score_codex":0.000029533454,"about_ca_topic_score_gemma":0.000051443873,"teacher_disagreement_score":0.8440129,"about_ca_system_score_codex":0.000029000821,"about_ca_system_score_gemma":0.00006997034,"threshold_uncertainty_score":0.67635477},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03349375374757956,"score_gpt":0.2605833325612889,"score_spread":0.22708957881370934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360994195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03718934,0.000008846132,0.94441277,0.010751887,0.0037456492,0.000279773,0.000017817945,0.0035588425,0.000035058052],"genre_scores_gemma":[0.840581,0.000048797374,0.1588011,0.00027535754,0.00012889296,0.00006539759,0.000009500842,0.000034155153,0.000055797147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997764,0.000088986824,0.0002671166,0.0007578065,0.0004563786,0.0006657249],"domain_scores_gemma":[0.9945964,0.00027554287,0.00008764963,0.0048630186,0.000053396125,0.00012398773],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00013374175,0.00029180356,0.00025113818,0.000307119,0.00034701286,0.00023911324,0.012237269,0.000105503124,0.0000149527295],"category_scores_gemma":[0.000056755638,0.0002488023,0.00011291501,0.001582214,0.000119870914,0.00047165682,0.0008711928,0.0005232192,0.00016634935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000927097,0.00029612574,0.00013634798,0.00003701662,0.00020013264,0.00016580228,0.00020366779,0.16079848,0.0001487743,0.00035601688,0.2650058,0.5725591],"study_design_scores_gemma":[0.00060474663,0.0003609694,0.0010345383,0.00009840231,0.000017623513,0.00003769441,0.0000071846607,0.9930733,0.0009839281,0.002160682,0.0012445054,0.00037644216],"about_ca_topic_score_codex":0.000011929922,"about_ca_topic_score_gemma":0.000008006093,"teacher_disagreement_score":0.8322748,"about_ca_system_score_codex":0.00008225233,"about_ca_system_score_gemma":0.000042696724,"threshold_uncertainty_score":0.9999964},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05966546207419866,"score_gpt":0.2679069968707073,"score_spread":0.20824153479650864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385237357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44012797,0.0000034141622,0.557019,0.0002457123,0.0019318016,0.00013044251,0.000007501916,0.0005041081,0.0000300573],"genre_scores_gemma":[0.9856839,0.000060732484,0.013737428,0.00027000767,0.000072228024,0.00012679855,0.0000039801375,0.000020033931,0.00002486515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981291,0.000056998986,0.00036330716,0.0005316738,0.00042161572,0.000497257],"domain_scores_gemma":[0.9989693,0.00018244307,0.00007084306,0.00055810635,0.00007787076,0.00014141828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029955557,0.00022294815,0.00019801292,0.0006277563,0.0006115414,0.0002532914,0.000604027,0.000048570288,0.00003361525],"category_scores_gemma":[0.0000015478181,0.00022842055,0.00012657378,0.0019417849,0.000045625315,0.00051620445,0.000013351824,0.0002563446,0.00018045756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021068869,0.0002578721,0.00004733634,0.000038683,0.0000883384,0.00003281528,0.0053240852,0.7526916,0.0010159377,0.0018405527,0.0010634129,0.2375783],"study_design_scores_gemma":[0.0010361547,0.00020957195,0.0017841764,0.00008758215,0.000016714097,0.000014819708,0.00024760695,0.9814105,0.013048011,0.00008506652,0.0015937588,0.0004660641],"about_ca_topic_score_codex":0.000041126183,"about_ca_topic_score_gemma":0.0000105634335,"teacher_disagreement_score":0.54555595,"about_ca_system_score_codex":0.00006841527,"about_ca_system_score_gemma":0.000054665034,"threshold_uncertainty_score":0.931472},"labels":[],"label_agreement":null},{"id":"W4388837988","doi":"10.1109/tc.2023.3334140","title":"Fast Inner-Product Algorithms and Architectures for Deep Neural Network Accelerators","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Pipeline (software); Convolutional neural network; Systolic array; Algorithm; Throughput; Matrix multiplication; Floating point; Parallel computing; Gate array; Field-programmable gate array; Computer hardware; Embedded system; Very-large-scale integration; Artificial intelligence; Wireless","score_opus":0.021547431843284955,"score_gpt":0.24506001079589054,"score_spread":0.2235125789526056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388837988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33165464,0.000048784204,0.66544235,0.00006542744,0.0019296529,0.00018260846,0.0000074689233,0.000661804,0.0000072871876],"genre_scores_gemma":[0.9902557,0.000015412275,0.009164069,0.000110012246,0.00035696846,0.0000307007,0.0000033375463,0.000043427237,0.000020357598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913883,0.000017990707,0.0001565811,0.00026133138,0.00007945829,0.00034583558],"domain_scores_gemma":[0.99952245,0.00021635188,0.000016943353,0.00014480315,0.000015685006,0.00008375144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006475194,0.00018458781,0.0001599473,0.00012252823,0.00025600754,0.000037817637,0.00010588361,0.000038052982,0.0000025112931],"category_scores_gemma":[0.0000014707687,0.00018615917,0.0000723102,0.00036393994,0.000033220935,0.000049382725,0.000002052122,0.00023353839,0.0000056443314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000111582,0.000003915859,0.0000023103237,0.00002796861,0.000020850739,0.0000035876894,0.00012003087,0.71181566,0.00066809024,0.0000017630043,0.00011365865,0.28721103],"study_design_scores_gemma":[0.0003117526,0.000080591824,0.00014312576,0.000026438223,0.000013289234,0.000018617615,0.000021601982,0.9812061,0.017644638,0.00010785022,0.00020878421,0.00021720055],"about_ca_topic_score_codex":0.0000012348507,"about_ca_topic_score_gemma":0.000006036735,"teacher_disagreement_score":0.6586011,"about_ca_system_score_codex":0.000018761188,"about_ca_system_score_gemma":0.000003324396,"threshold_uncertainty_score":0.75913507},"labels":[],"label_agreement":null},{"id":"W4389747812","doi":"10.1109/tc.2023.3343093","title":"Decoder Reduction Approximation Scheme for Booth Multipliers","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Multiplier (economics); Booth's multiplication algorithm; Mathematics; Logarithm; Approximation error; Adder; Algorithm; Arithmetic; Computer science; Latency (audio)","score_opus":0.01889540419608347,"score_gpt":0.22934883810816895,"score_spread":0.21045343391208549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389747812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07396103,0.000008361574,0.91983944,0.000086510256,0.0038842584,0.0004839574,0.000018375398,0.0016314406,0.00008660227],"genre_scores_gemma":[0.951877,0.000045609686,0.04735619,0.000035731187,0.00013992694,0.00025484274,0.00002254147,0.000077061246,0.00019110364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990579,0.000012410202,0.00022167503,0.00023687743,0.0001591553,0.0003119879],"domain_scores_gemma":[0.9995581,0.00007021521,0.000024911235,0.0002330197,0.000037588386,0.0000761933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012649164,0.00018526199,0.00014649837,0.00037472066,0.00017520128,0.000046621797,0.0001283428,0.00010050784,0.00001328254],"category_scores_gemma":[0.0000012598831,0.00020626094,0.00010799198,0.0004905631,0.000029866516,0.00030862412,6.129295e-7,0.00016209012,0.00021676805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023559753,0.000027340755,0.0000015081191,0.00007039218,0.00006768078,7.050016e-7,0.00043819437,0.94291776,0.010375207,0.000022402775,0.0067474064,0.039307863],"study_design_scores_gemma":[0.0006708866,0.000058189733,0.000035710866,0.000036613546,0.000017959728,0.0000053607346,0.00006416302,0.93584645,0.06144515,0.00003549272,0.001557146,0.00022690874],"about_ca_topic_score_codex":0.000002987072,"about_ca_topic_score_gemma":0.0000020983323,"teacher_disagreement_score":0.877916,"about_ca_system_score_codex":0.0001519804,"about_ca_system_score_gemma":0.000016083237,"threshold_uncertainty_score":0.84110767},"labels":[],"label_agreement":null},{"id":"W4390097623","doi":"10.1109/tc.2023.3345163","title":"Learning the Error Features of Approximate Multipliers for Neural Network Applications","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Artificial neural network; Dropout (neural networks); Feature (linguistics); Mean squared error; Artificial intelligence; Machine learning; Algorithm; Mathematics; Statistics","score_opus":0.013928491567882836,"score_gpt":0.22937944184904482,"score_spread":0.21545095028116198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390097623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01768765,0.00003259255,0.97928447,0.00013088236,0.0012194226,0.0007191126,0.00001826718,0.0008225078,0.0000851281],"genre_scores_gemma":[0.9927797,0.000037266236,0.006364564,0.000045902656,0.00012050419,0.00046478558,0.000010094465,0.000051973828,0.00012521785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917316,0.000023281931,0.00019645969,0.00016708784,0.0001296411,0.0003103831],"domain_scores_gemma":[0.9993327,0.00030715298,0.000036036567,0.00024635508,0.00003030884,0.000047392707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014658173,0.00015680699,0.00015560978,0.00012746098,0.0002945802,0.000028445884,0.00024214147,0.0000626927,0.000003765546],"category_scores_gemma":[0.0000010276622,0.00013165474,0.00012705209,0.00059569743,0.000059598337,0.00008601105,0.0000014599972,0.0002751821,0.000022030817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014625071,0.000011593829,0.000006409361,0.00005252113,0.00006342882,2.985762e-7,0.00040750162,0.9554614,0.0005894623,0.00003045355,0.0025864667,0.04077588],"study_design_scores_gemma":[0.0003405484,0.000064323256,0.0002170348,0.000024826988,0.00003188253,0.0000028795007,0.00011199001,0.993013,0.0035171914,0.000027977754,0.0024997587,0.00014859038],"about_ca_topic_score_codex":0.0000037471698,"about_ca_topic_score_gemma":0.0000051235647,"teacher_disagreement_score":0.97509205,"about_ca_system_score_codex":0.000035157926,"about_ca_system_score_gemma":0.000009700222,"threshold_uncertainty_score":0.53687245},"labels":[],"label_agreement":null},{"id":"W4392309053","doi":"10.1109/tc.2024.3371793","title":"On the Security of Quotient Filters: Attacks and Potential Countermeasures","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Agencia Estatal de Investigación","keywords":"Computer security; Computer science; Quotient; Mathematics","score_opus":0.012245066142428141,"score_gpt":0.22400904218080317,"score_spread":0.21176397603837502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392309053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08788713,0.000051119117,0.9068238,0.0011159355,0.0037471072,0.000117192045,0.000010782855,0.0001522096,0.00009468948],"genre_scores_gemma":[0.9990759,0.000022757855,0.00048542913,0.00032976017,0.000049084836,0.000008047891,2.9786563e-7,0.000007509865,0.000021246988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906987,0.00007936126,0.00014678422,0.00029227437,0.0002785983,0.00013309141],"domain_scores_gemma":[0.9993213,0.00026451627,0.000029286512,0.00030443168,0.000033377317,0.000047130347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020211145,0.000120268414,0.00010006144,0.00013835552,0.0001569331,0.0002313262,0.00030510363,0.000047869697,0.0000128330075],"category_scores_gemma":[0.000001920167,0.00008878294,0.00009954919,0.0002351808,0.00007410314,0.00020402417,0.0000036795245,0.00023827804,0.000016544944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034675794,0.0010827958,0.000019697105,0.0004551894,0.00092192914,0.00014811885,0.022829298,0.3207734,0.007135704,0.038963623,0.038025517,0.56929797],"study_design_scores_gemma":[0.00031408065,0.000716386,0.00017500535,0.00036199164,0.0000365788,0.00007176864,0.00005313329,0.9734728,0.019964159,0.003265682,0.0013137627,0.0002547017],"about_ca_topic_score_codex":0.00003823869,"about_ca_topic_score_gemma":0.000008682624,"teacher_disagreement_score":0.9111887,"about_ca_system_score_codex":0.00003584826,"about_ca_system_score_gemma":0.000026014526,"threshold_uncertainty_score":0.36204633},"labels":[],"label_agreement":null},{"id":"W4394585993","doi":"10.1109/tc.2024.3386068","title":"LogSay: An Efficient Comprehension System for Log Numerical Reasoning","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Comprehension; Computer science; Programming language","score_opus":0.016408016086588015,"score_gpt":0.2538376564882267,"score_spread":0.2374296404016387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394585993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016644467,0.00002483817,0.9903838,0.00047881858,0.0056596315,0.00034224612,0.000013713706,0.001338927,0.0000935826],"genre_scores_gemma":[0.798617,0.0000027258982,0.20110752,0.00013329046,0.00006125942,0.000031732052,0.0000044969934,0.0000168641,0.000025087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986114,0.00008109634,0.00025723848,0.00056210975,0.00023368186,0.00025446014],"domain_scores_gemma":[0.9991782,0.00019804668,0.000039315215,0.00035872014,0.00007412731,0.00015162608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016437133,0.00018449851,0.00017515408,0.00027100905,0.00029939393,0.00034404683,0.00028005653,0.00008173817,0.000011595706],"category_scores_gemma":[0.0000013373726,0.00017977432,0.00015464156,0.00043984898,0.0000359013,0.00028845313,0.000003148641,0.00018415057,0.000060356993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012734484,0.00006190924,0.0000013211147,0.000042023577,0.00002558067,0.00001083627,0.00030502598,0.8137012,0.0001606603,0.007963032,0.00014169565,0.17757398],"study_design_scores_gemma":[0.00029269635,0.00017452425,0.00004040657,0.0001702931,0.000017600003,0.00009788002,0.000042993903,0.9968806,0.0012295246,0.000025525023,0.0008304207,0.00019756435],"about_ca_topic_score_codex":0.000017671802,"about_ca_topic_score_gemma":0.000004148549,"teacher_disagreement_score":0.7969526,"about_ca_system_score_codex":0.00015265994,"about_ca_system_score_gemma":0.00008350347,"threshold_uncertainty_score":0.7330984},"labels":[],"label_agreement":null},{"id":"W4403211188","doi":"10.1109/tc.2024.3475586","title":"A Numerical Variability Approach to Results Stability Tests and Its Application to Neuroimaging","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Hemodynamic Monitoring and Therapy","field":"Medicine","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Neuroimaging; Stability (learning theory); Computer science; Artificial intelligence; Algorithm; Machine learning; Neuroscience; Psychology","score_opus":0.024935488522271593,"score_gpt":0.29258707428771125,"score_spread":0.2676515857654397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403211188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17242542,0.000009276954,0.8235568,0.0022232041,0.0005301553,0.000629508,0.00002049324,0.0002733362,0.0003318606],"genre_scores_gemma":[0.98972315,0.00000384835,0.009627192,0.00038999936,0.00010582751,0.0000903784,0.0000031926413,0.000020273392,0.000036133162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987513,0.00006883673,0.00021671217,0.0005943888,0.00018233468,0.00018642473],"domain_scores_gemma":[0.99907976,0.00024723867,0.0000113347,0.0003360205,0.000048144433,0.00027751742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034723288,0.00013913776,0.00017964887,0.00013128518,0.00008058288,0.000042849635,0.00006708934,0.000046673144,0.0000020922396],"category_scores_gemma":[0.000013819239,0.00012930336,0.000056216108,0.0004499778,0.000017375347,0.000053267373,0.0000015558167,0.00025886786,0.000030831805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010547177,0.0014962001,0.0001855316,0.00054604583,0.0001495398,0.000018241957,0.004257955,0.07617913,0.027155694,0.00018973039,0.00028079786,0.8884864],"study_design_scores_gemma":[0.00067183445,0.00043662594,0.004007594,0.00015700437,0.000049338214,0.000065317705,0.000026308184,0.98385626,0.007829375,0.00004747303,0.0026162514,0.000236592],"about_ca_topic_score_codex":0.000045517954,"about_ca_topic_score_gemma":7.1870704e-7,"teacher_disagreement_score":0.9076772,"about_ca_system_score_codex":0.00013695873,"about_ca_system_score_gemma":0.00004955811,"threshold_uncertainty_score":0.5272837},"labels":[],"label_agreement":null},{"id":"W4404609150","doi":"10.1109/tc.2024.3500369","title":"Mix-GEMM: Extending RISC-V CPUs for Energy-Efficient Mixed-Precision DNN Inference Using Binary Segmentation","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Geophysical Methods and Applications","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Binary number; Parallel computing; Inference; Segmentation; Algorithm; Arithmetic; Artificial intelligence; Mathematics","score_opus":0.031093614405805572,"score_gpt":0.3064758833789454,"score_spread":0.27538226897313983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404609150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08558284,0.000092454335,0.910944,0.000047549653,0.0026202148,0.00022165269,0.000048151356,0.00040587992,0.00003730469],"genre_scores_gemma":[0.877904,0.000035002493,0.121736825,0.000024151674,0.000104250474,0.000116127594,0.000007680516,0.00003717009,0.000034790617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990871,0.00003151551,0.00022574954,0.00029177862,0.0001444867,0.00021934649],"domain_scores_gemma":[0.99915653,0.00052391324,0.000019001885,0.00018909379,0.000030945565,0.00008050607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009783428,0.00017825123,0.00014554545,0.00020549516,0.00018936016,0.00010881883,0.00011881736,0.00006372024,0.00001433151],"category_scores_gemma":[0.0000018287071,0.00018035165,0.00014538181,0.00039774907,0.000024280007,0.00010959258,0.000001884118,0.00014599644,0.000026018934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004345698,0.000044248685,1.1032583e-7,0.0000390513,0.000028235247,0.0000011428147,0.000067908455,0.6976028,0.047423687,0.00024402095,0.00013724732,0.2544072],"study_design_scores_gemma":[0.00014737011,0.000058858757,0.00002144664,0.00015674662,0.000048703205,0.000003612683,0.00003485084,0.9572661,0.04040635,0.00045781318,0.0012093261,0.00018881763],"about_ca_topic_score_codex":0.000016962962,"about_ca_topic_score_gemma":0.0000022676784,"teacher_disagreement_score":0.79232115,"about_ca_system_score_codex":0.00014333302,"about_ca_system_score_gemma":0.000018075227,"threshold_uncertainty_score":0.73545265},"labels":[],"label_agreement":null},{"id":"W4406110898","doi":"10.1109/tc.2025.3525606","title":"Karatsuba Matrix Multiplication and Its Efficient Custom Hardware Implementations","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Matrix multiplication; Scalar multiplication; Multiplication algorithm; Computer science; Multiplication (music); Parallel computing; Multiplier (economics); Reduction (mathematics); Arithmetic; Scalar (mathematics); Algorithm; Mathematics; Binary number","score_opus":0.015170705946591881,"score_gpt":0.2995743447746522,"score_spread":0.28440363882806036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406110898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033677253,0.00007340082,0.9932036,0.0013377873,0.00061833346,0.00037040946,0.000010514802,0.00076346594,0.00025478992],"genre_scores_gemma":[0.85714084,0.000043104836,0.14193869,0.00048424854,0.000013513657,0.000060498136,0.000003393731,0.000008069341,0.0003076397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881494,0.00007672406,0.00027751562,0.0004502939,0.00016472129,0.00021578671],"domain_scores_gemma":[0.9991861,0.0001678779,0.000071244016,0.00037528647,0.00012231874,0.0000771887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014861213,0.00016778486,0.00014654426,0.00039485964,0.0004413108,0.00018056511,0.0004303737,0.00006243273,0.0000056298495],"category_scores_gemma":[0.0000031806044,0.00017784424,0.0000715745,0.0006440099,0.000027433724,0.00016710663,0.000010816625,0.00015565833,0.000023400937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001094606,0.0001907943,0.000012463571,0.000026715677,0.00004937541,0.000002092325,0.00050225673,0.90763205,0.00057010096,0.010709915,0.002339659,0.07795365],"study_design_scores_gemma":[0.00042838024,0.000049163038,0.00015249616,0.0000516281,0.000013888384,0.0000055866262,0.000016124259,0.98283356,0.015157387,0.00013590214,0.000987295,0.00016858256],"about_ca_topic_score_codex":0.0000142711815,"about_ca_topic_score_gemma":0.0000036201093,"teacher_disagreement_score":0.8537731,"about_ca_system_score_codex":0.00008077475,"about_ca_system_score_gemma":0.000063058666,"threshold_uncertainty_score":0.7252277},"labels":[],"label_agreement":null},{"id":"W4412171603","doi":"10.1109/tc.2025.3587623","title":"A High-Efficiency Parallel Mechanism for Canonical Polyadic Decomposition on Heterogeneous Computing Platform","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Parallel computing; Decomposition; Mechanism (biology); Supercomputer; Computational science; Theoretical computer science; Distributed computing; Chemistry; Physics","score_opus":0.013915366902260548,"score_gpt":0.2733420441649771,"score_spread":0.25942667726271657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412171603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3531983,0.000015625905,0.6453133,0.00016954559,0.00090981316,0.00026318748,0.000017016195,0.000048611128,0.000064604596],"genre_scores_gemma":[0.98540944,0.00001232144,0.012153876,0.002151757,0.00012503554,0.00002415175,0.000037656562,0.0000146409975,0.00007111535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986997,0.00004358998,0.00028448654,0.0005121974,0.000106146326,0.00035384644],"domain_scores_gemma":[0.99943185,0.00011727521,0.00006524263,0.00024059723,0.00006271385,0.00008230819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011614411,0.00022708456,0.00020746734,0.00010420425,0.00036768918,0.000045925164,0.00024542268,0.00019599451,0.0000037196723],"category_scores_gemma":[0.0000053551626,0.00020396685,0.00023263191,0.00012753304,0.000052819254,0.0000031896734,0.000007149291,0.00015896796,0.0000065158074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012983885,0.0011538037,0.000011699101,0.00006405034,0.00037139672,0.000014520973,0.000049297254,0.690864,0.1749675,0.007510837,0.00071213563,0.12298232],"study_design_scores_gemma":[0.004050322,0.0055951565,0.00010279735,0.00024930155,0.00010859498,0.000055386787,0.000031614047,0.2633213,0.722951,0.0015645832,0.0011060046,0.00086392567],"about_ca_topic_score_codex":0.000020965643,"about_ca_topic_score_gemma":0.000017447634,"teacher_disagreement_score":0.6331594,"about_ca_system_score_codex":0.000055416967,"about_ca_system_score_gemma":0.000057718746,"threshold_uncertainty_score":0.83175266},"labels":[],"label_agreement":null},{"id":"W4413126041","doi":"10.1109/tc.2025.3596698","title":"TeeRollup: Efficient Rollup Design Using Heterogeneous TEE","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Vehicle License Plate Recognition","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"National Natural Science Foundation of China","keywords":"Computer science; Materials science; Parallel computing","score_opus":0.019505421119030638,"score_gpt":0.22396764487684712,"score_spread":0.20446222375781647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413126041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19044176,0.000038645907,0.80645496,0.000023926506,0.0020766011,0.00025354335,0.000010718529,0.0005393284,0.00016050192],"genre_scores_gemma":[0.9832445,0.000015985792,0.016486028,0.0001262422,0.00003259272,0.000019828423,0.0000013627322,0.000037084617,0.000036405505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902225,0.00005088799,0.00024372888,0.00024171665,0.0001424093,0.00029903257],"domain_scores_gemma":[0.99950105,0.00014790749,0.000019910964,0.00022419453,0.000034401466,0.0000725177],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000088979665,0.00021746953,0.00019453096,0.0003541086,0.00015373928,0.000081854734,0.0001332026,0.000112157824,0.000022118895],"category_scores_gemma":[8.739369e-7,0.00024861709,0.0001238329,0.00039310404,0.000026943291,0.00008956297,0.0000010074983,0.00023320474,0.00006863826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023317712,0.000059219514,5.6593353e-7,0.000026675514,0.000117490636,0.000011671755,0.000057973764,0.9532695,0.008827969,0.0000021751518,0.00005998834,0.037543457],"study_design_scores_gemma":[0.0004718224,0.00003641837,0.00000929881,0.00010425041,0.000057326368,0.00003149658,0.000008054472,0.908745,0.0902202,0.000016452013,0.00010716262,0.00019254608],"about_ca_topic_score_codex":0.000009052146,"about_ca_topic_score_gemma":0.0000039018014,"teacher_disagreement_score":0.7928027,"about_ca_system_score_codex":0.00022604025,"about_ca_system_score_gemma":0.00002506596,"threshold_uncertainty_score":0.9999966},"labels":[],"label_agreement":null},{"id":"W7117501352","doi":"10.1109/tc.2025.3649209","title":"Dual-Pronged Deep Learning Preprocessing on Heterogeneous Platforms With CPU, Accelerator and CSD","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Computers","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Preprocessor; Deep learning; Bottleneck; Data pre-processing; Dram; Central processing unit; Consistency (knowledge bases); Energy consumption","score_opus":0.016180984727127014,"score_gpt":0.25505046087766065,"score_spread":0.23886947615053364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117501352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0875207,0.00027097008,0.90888184,0.0006482223,0.0010718616,0.0009203817,0.0000056642193,0.00047862332,0.0002017481],"genre_scores_gemma":[0.97068983,0.0002482284,0.027224446,0.0011290045,0.000095377756,0.00018217803,0.0000024058327,0.000060271126,0.0003682451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613154,0.00009808162,0.000638873,0.0017961303,0.0005074832,0.0008278809],"domain_scores_gemma":[0.9976176,0.0005606285,0.00028893995,0.0010354518,0.0001746306,0.00032273124],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00017416579,0.00071683875,0.0005486401,0.0005040985,0.001983452,0.0007413535,0.0007310561,0.00022395702,0.000014617189],"category_scores_gemma":[0.0000043596797,0.0006762507,0.0001526948,0.0016688938,0.0003311874,0.0008576521,0.000025738505,0.0012863618,0.000040048773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017206788,0.0002641859,0.000015301266,0.00006094482,0.0001242258,0.000026645694,0.0006648172,0.59534085,0.00019599518,0.00019831426,0.000016921547,0.40291977],"study_design_scores_gemma":[0.001963556,0.0011896085,0.00014016527,0.0008288336,0.000116304385,0.00014725862,0.00007985354,0.9738649,0.019742504,0.00039117027,0.00072038115,0.00081543106],"about_ca_topic_score_codex":0.000009347802,"about_ca_topic_score_gemma":0.000044319386,"teacher_disagreement_score":0.8831691,"about_ca_system_score_codex":0.00025370944,"about_ca_system_score_gemma":0.00016680411,"threshold_uncertainty_score":0.9995689},"labels":[],"label_agreement":null}]}