{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40945086,0.0010916163,0.5733317,0.00020877688,0.00017209636,0.000138977,0.00014410423,0.0014330776,0.014028793],"genre_scores_gemma":[0.77758193,0.00033018825,0.21472485,0.000063255306,0.000041239637,0.000069129615,0.00017502716,0.000035631467,0.0069787386],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998301,0.000027896607,0.000013737026,0.00003083841,0.00007177062,0.000025620076],"domain_scores_gemma":[0.99978036,0.000044355158,0.000029684566,0.000050478153,0.00007761046,0.000017598564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021057484,0.00030076542,0.00024747674,0.00045037438,0.00026891657,0.0005742854,0.0006208183,0.0002701323,0.0027125643],"category_scores_gemma":[0.0004529436,0.00014283498,0.0002298823,0.0005276888,0.00024333864,0.0008145533,0.0003693908,0.0003933719,0.0008760889],"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.0011883723,0.00023188736,0.0019850614,0.0003951352,0.00007751647,0.00047970138,0.00024897655,0.034754172,0.46754557,0.10706698,0.0033760802,0.38265052],"study_design_scores_gemma":[0.00026745116,0.0021854066,0.0033154136,0.00008734643,0.000106394764,0.0018819085,0.0001322205,0.43339542,0.48098654,0.037180323,0.040347088,0.00011448222],"about_ca_topic_score_codex":0.00034832387,"about_ca_topic_score_gemma":0.0007944139,"teacher_disagreement_score":0.0027125643,"about_ca_system_score_codex":0.00042048682,"about_ca_system_score_gemma":0.00042325445,"threshold_uncertainty_score":0.00907445},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13140255,0.0015208176,0.8523473,0.00028836456,0.00022980913,0.0002388828,0.00025782728,0.0030145263,0.010699957],"genre_scores_gemma":[0.5239708,0.0004882558,0.46946448,0.00007005928,0.00007481935,0.00014563836,0.00035201336,0.0001169493,0.0053170156],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995358,0.0000918924,0.00006087901,0.0000757,0.00019180315,0.00004395384],"domain_scores_gemma":[0.9995516,0.000105945845,0.000061145416,0.00015936374,0.00008829932,0.000033645938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043318636,0.00038439137,0.00046506294,0.000801333,0.000735062,0.001244154,0.00058180734,0.0003970138,0.0046835425],"category_scores_gemma":[0.0012348937,0.00014357385,0.00022143518,0.001119791,0.000489876,0.0016952164,0.0010372561,0.00043740944,0.0016294043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014631996,0.00013065507,0.0016880437,0.0004988516,0.00005708555,0.0003601912,0.0003412154,0.038264614,0.096478544,0.3394685,0.008875258,0.51237386],"study_design_scores_gemma":[0.00037816897,0.0008067409,0.0014527638,0.0001338609,0.00009310066,0.0023668562,0.00021104855,0.5317115,0.19030532,0.19465147,0.07773189,0.00015725118],"about_ca_topic_score_codex":0.00029561308,"about_ca_topic_score_gemma":0.00046074708,"teacher_disagreement_score":0.0046835425,"about_ca_system_score_codex":0.00065149355,"about_ca_system_score_gemma":0.00064188574,"threshold_uncertainty_score":0.015668035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14415598,0.00093853706,0.83123267,0.0007515718,0.00004184868,0.000118346965,0.00017312102,0.0002538342,0.02233414],"genre_scores_gemma":[0.89795727,0.0009921868,0.092840366,0.00010563753,0.000045049233,0.0002484878,0.00009831947,0.00016791621,0.0075447625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990397,0.00029801132,0.00004279386,0.00012298713,0.00032695167,0.00016964374],"domain_scores_gemma":[0.9977471,0.0017060471,0.00017048996,0.00020206196,0.00011743736,0.000056898065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011441245,0.00090536627,0.0007120215,0.00079651625,0.0005407067,0.001613957,0.0015126582,0.0012447087,0.004066065],"category_scores_gemma":[0.0062787887,0.00068648736,0.0006736593,0.0015611902,0.0015519749,0.0037588708,0.0009378841,0.0009716802,0.00058569707],"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.00004723273,0.000031388827,0.00019157754,0.000024950883,0.0000073360284,0.000027955817,0.00002979911,0.94019556,0.0012235721,0.053862955,0.00014300247,0.0042146463],"study_design_scores_gemma":[0.000008564019,0.000016238946,0.000057744455,0.000002808501,0.00000392368,0.000012274014,0.000008315174,0.9659235,0.000366599,0.03325657,0.0003397705,0.000003629922],"about_ca_topic_score_codex":0.0027244242,"about_ca_topic_score_gemma":0.0037278256,"teacher_disagreement_score":0.004066065,"about_ca_system_score_codex":0.0019554286,"about_ca_system_score_gemma":0.0009793852,"threshold_uncertainty_score":0.014187753},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008387473,0.00015385858,0.9964401,0.000028817094,0.00003316021,0.000085837804,0.00014011227,0.0006010981,0.0016781155],"genre_scores_gemma":[0.06940075,0.0008150521,0.9220575,0.0001393725,0.000083452884,0.0008819166,0.00080260914,0.0006271269,0.0051922197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908066,0.0001423657,0.000064151376,0.00013061521,0.0005083756,0.0000738582],"domain_scores_gemma":[0.9989513,0.00023952966,0.00007228366,0.00029443132,0.0004202736,0.000022106242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007911477,0.00091973506,0.0007054893,0.0017373395,0.00054124754,0.0010673327,0.0020713797,0.00069956743,0.007254806],"category_scores_gemma":[0.002961046,0.00053395814,0.0008185882,0.0012970071,0.00046832586,0.0010730748,0.0011881653,0.0014043468,0.003310652],"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.0000659156,0.00014687791,0.0013346924,0.0008842418,0.00015039185,0.0003718647,0.00023225557,0.2541335,0.083809644,0.33690938,0.012349075,0.30961227],"study_design_scores_gemma":[0.00002839992,0.00011392039,0.00044237028,0.00008570343,0.00005247811,0.00040049793,0.000043346314,0.7973263,0.039861627,0.09534224,0.0662398,0.00006334019],"about_ca_topic_score_codex":0.0010903666,"about_ca_topic_score_gemma":0.0010198584,"teacher_disagreement_score":0.007254806,"about_ca_system_score_codex":0.00055793324,"about_ca_system_score_gemma":0.0014278915,"threshold_uncertainty_score":0.02426976},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03249711,0.0002589532,0.96548337,0.000087525696,0.000035393772,0.00007592082,0.000031064857,0.0005784527,0.0009522382],"genre_scores_gemma":[0.5934349,0.00040629742,0.40407845,0.000054705393,0.00004843621,0.0001422877,0.00018795255,0.00009294127,0.0015539045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983559,0.00061284855,0.00014971552,0.00024697598,0.0005467443,0.00008771473],"domain_scores_gemma":[0.9952632,0.0025926393,0.00059602055,0.0008894482,0.0005017359,0.00015688116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029131102,0.00053754734,0.00052668387,0.0005695525,0.000656594,0.00094786106,0.00097375613,0.000420247,0.0008827758],"category_scores_gemma":[0.008042852,0.00019755933,0.00026178194,0.0006895251,0.00062807725,0.0020628937,0.00085332827,0.00069237675,0.00021824872],"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.0014137732,0.0001662507,0.0038877358,0.0003440661,0.00012947345,0.00018329623,0.00050609733,0.41667336,0.06326001,0.073983565,0.0016344355,0.43781793],"study_design_scores_gemma":[0.00004489607,0.00025694765,0.000558617,0.00001228818,0.000036036494,0.00012191757,0.000083145474,0.9527606,0.027492672,0.01321826,0.0053983578,0.000016362263],"about_ca_topic_score_codex":0.0010217495,"about_ca_topic_score_gemma":0.001419401,"teacher_disagreement_score":0.0029131102,"about_ca_system_score_codex":0.0007122393,"about_ca_system_score_gemma":0.0010845099,"threshold_uncertainty_score":0.015406251},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8386123,0.00092210004,0.1545213,0.00014854502,0.000024135958,0.00004956223,0.00035716503,0.0028509984,0.0025138627],"genre_scores_gemma":[0.98064935,0.00008352773,0.018460251,0.000021627862,0.0000070902756,0.000039877155,0.00028570803,0.000103375096,0.0003491739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99843115,0.0003298452,0.000059666698,0.0001382548,0.00090039446,0.00014072294],"domain_scores_gemma":[0.9905972,0.0050329966,0.0015694051,0.0015366769,0.0011395928,0.00012412353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009836096,0.0005423196,0.00031538878,0.0013102682,0.00024663322,0.00045222038,0.0005628285,0.00038479653,0.0014678877],"category_scores_gemma":[0.008547773,0.00024413317,0.0003145093,0.0005821036,0.0004047598,0.0007302326,0.00049083773,0.00037422223,0.00022188302],"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.0009850081,0.00019963464,0.0787398,0.0004021877,0.00010071468,0.00050986273,0.00038977724,0.41961676,0.30593023,0.005783232,0.0013291688,0.18601361],"study_design_scores_gemma":[0.000020758345,0.0009712994,0.029137854,0.000035551755,0.000040139,0.00029450512,0.000056938843,0.7876303,0.17661768,0.003460089,0.0017080349,0.000026831827],"about_ca_topic_score_codex":0.0012264339,"about_ca_topic_score_gemma":0.0026765473,"teacher_disagreement_score":0.0014678877,"about_ca_system_score_codex":0.00070673047,"about_ca_system_score_gemma":0.00057057047,"threshold_uncertainty_score":0.005201876},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018816927,0.00033247977,0.97880334,0.000078626086,0.000033512373,0.00005729129,0.000018997489,0.0009773467,0.00088152377],"genre_scores_gemma":[0.4018412,0.00040362598,0.59608245,0.00012628971,0.00002924353,0.000159545,0.00009386128,0.000112238624,0.0011515825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994311,0.00016450635,0.000039465034,0.00006841588,0.00022968402,0.00006687426],"domain_scores_gemma":[0.9993579,0.0002016799,0.000098733806,0.00018576399,0.00012470498,0.000031198404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007089894,0.00054463645,0.00033804518,0.0009064024,0.0005640709,0.0005200491,0.0013675732,0.00046505342,0.000862558],"category_scores_gemma":[0.0013642476,0.00024652318,0.00047764325,0.00047832372,0.0006988239,0.00093675486,0.0006796871,0.00054573396,0.00012900379],"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.00011973945,0.00015274608,0.0016044861,0.00045099604,0.00011247611,0.00029118214,0.00021598463,0.5095989,0.12866783,0.06354599,0.002513888,0.29272568],"study_design_scores_gemma":[0.000050814746,0.00040363704,0.00060004106,0.000030855932,0.00006721487,0.000327688,0.00003740746,0.91697395,0.0505456,0.023355698,0.0075616334,0.000045444776],"about_ca_topic_score_codex":0.0015096097,"about_ca_topic_score_gemma":0.0019002091,"teacher_disagreement_score":0.0015096097,"about_ca_system_score_codex":0.00065322756,"about_ca_system_score_gemma":0.0009899404,"threshold_uncertainty_score":0.0047394633},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06831937,0.00027785706,0.9285824,0.00018153002,0.000028868808,0.00007620323,0.00008143446,0.00040116988,0.0020511525],"genre_scores_gemma":[0.6313036,0.0003279968,0.36627036,0.000071127084,0.00002292563,0.00017030911,0.00022924089,0.00008401591,0.0015204551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996288,0.000117962416,0.00002109185,0.0000698607,0.00011604523,0.00004619444],"domain_scores_gemma":[0.9992804,0.00029701844,0.00016585871,0.00008896584,0.00009849434,0.00006934841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033766814,0.0007777046,0.0006573444,0.0006033847,0.00035318767,0.00045906386,0.00076925196,0.00066981826,0.001911633],"category_scores_gemma":[0.0020456684,0.00033525392,0.000384953,0.0006532718,0.0003663017,0.0010818719,0.00082942203,0.0005256695,0.0004713909],"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.0005987408,0.00018319939,0.0024292495,0.00041080939,0.00005078543,0.0007875202,0.00027087628,0.7445822,0.088575445,0.023200985,0.0037308165,0.13517946],"study_design_scores_gemma":[0.000039113373,0.00026252877,0.0006746532,0.000016280685,0.000012710925,0.00025302055,0.00008051823,0.9798728,0.01129112,0.0055657513,0.0019167629,0.000014828088],"about_ca_topic_score_codex":0.0006276338,"about_ca_topic_score_gemma":0.00070270995,"teacher_disagreement_score":0.001911633,"about_ca_system_score_codex":0.0003640141,"about_ca_system_score_gemma":0.00041483543,"threshold_uncertainty_score":0.0063951015},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010427324,0.00030552517,0.84507066,0.0010920606,0.00028832187,0.00146428,0.004339317,0.1214976,0.015514965],"genre_scores_gemma":[0.1588222,0.0005707358,0.8164463,0.0007394743,0.00018971068,0.0025318917,0.007141907,0.0022019285,0.011355785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703515,0.0008746034,0.0005271923,0.0003863672,0.0010466814,0.00012994664],"domain_scores_gemma":[0.99367553,0.0031641836,0.00039090138,0.00088511745,0.0013825055,0.00050169666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048008407,0.0017453989,0.0014956561,0.0023992267,0.0013144304,0.0049914806,0.0029008177,0.002238969,0.028117966],"category_scores_gemma":[0.0130385,0.000795213,0.0008974141,0.0017756112,0.0007904021,0.002987978,0.0025446876,0.0017927925,0.008353393],"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.0020954283,0.0009951432,0.004706542,0.0016260457,0.0003527398,0.0021635664,0.0012371844,0.11638389,0.03146281,0.06452037,0.17085463,0.6036017],"study_design_scores_gemma":[0.0007987326,0.00033857164,0.001034784,0.00034074904,0.00015568036,0.0003411708,0.00020141924,0.7670106,0.018612253,0.04045578,0.17050931,0.00020095495],"about_ca_topic_score_codex":0.0033791228,"about_ca_topic_score_gemma":0.0023720677,"teacher_disagreement_score":0.028117966,"about_ca_system_score_codex":0.00157511,"about_ca_system_score_gemma":0.0026260319,"threshold_uncertainty_score":0.09406394},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27744204,0.0014426553,0.68508786,0.00031356944,0.0003965753,0.0002535179,0.00018475823,0.005019018,0.029860077],"genre_scores_gemma":[0.6877916,0.00065991626,0.29614294,0.00010896175,0.00011261748,0.00013356627,0.0005414753,0.00013433235,0.014374594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998073,0.00003108348,0.000021464331,0.00003035776,0.00007242658,0.000037409976],"domain_scores_gemma":[0.99963975,0.000055080494,0.000043735203,0.000081910184,0.00015567215,0.000023832312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019945223,0.00051536807,0.00032499278,0.0007105569,0.00035512075,0.0007223888,0.0006719022,0.00032157538,0.0048856605],"category_scores_gemma":[0.00055996305,0.00019011436,0.00023649089,0.0008196926,0.0002526264,0.0014640794,0.00037302973,0.00054208963,0.0018228474],"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.00081901095,0.00026027008,0.001459934,0.0003695749,0.000066983266,0.0006105452,0.00034177778,0.020728014,0.31444976,0.10341105,0.010059442,0.5474237],"study_design_scores_gemma":[0.00031089914,0.0026332664,0.002975079,0.00012902613,0.00015586216,0.0023774179,0.00029219338,0.35965532,0.43489987,0.07761805,0.118742235,0.00021080751],"about_ca_topic_score_codex":0.000378615,"about_ca_topic_score_gemma":0.0008714304,"teacher_disagreement_score":0.0048856605,"about_ca_system_score_codex":0.00044352867,"about_ca_system_score_gemma":0.00048334844,"threshold_uncertainty_score":0.01634419},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10563875,0.000901764,0.8892296,0.0006275229,0.0000568855,0.0004113524,0.000034903052,0.00083744916,0.002261806],"genre_scores_gemma":[0.7532463,0.0004882001,0.24371627,0.00019570818,0.00006645003,0.0005930057,0.000094870265,0.00009021231,0.0015089454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991215,0.00032309786,0.00008564409,0.0000933827,0.00027941715,0.00009702535],"domain_scores_gemma":[0.99815315,0.00075853034,0.00031062154,0.0003083507,0.00040143018,0.00006781658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016170571,0.000362653,0.00034380326,0.00052754907,0.00089817675,0.000932831,0.0010344785,0.0006755019,0.0008765416],"category_scores_gemma":[0.0037542738,0.00045622786,0.0002268934,0.0005274176,0.0009018605,0.0020309,0.00085321884,0.00073692907,0.00022455186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006776013,0.00056813296,0.0065091155,0.0010616013,0.00018580978,0.0005361679,0.0010369634,0.3748727,0.26326638,0.10222025,0.0051956153,0.24386959],"study_design_scores_gemma":[0.00017476104,0.00068869133,0.0006560202,0.00004075325,0.00009217958,0.00024261247,0.00020917156,0.905634,0.06979576,0.011513904,0.010907249,0.00004486035],"about_ca_topic_score_codex":0.00076696154,"about_ca_topic_score_gemma":0.0017421186,"teacher_disagreement_score":0.0016170571,"about_ca_system_score_codex":0.0007547098,"about_ca_system_score_gemma":0.0014033961,"threshold_uncertainty_score":0.008551955},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019257655,0.00048727595,0.968037,0.00009961287,0.00012601112,0.00013508312,0.00047971896,0.007949655,0.003427939],"genre_scores_gemma":[0.1481605,0.00039174297,0.8430868,0.0001340837,0.00011362816,0.00044054992,0.002549029,0.0012398788,0.003883815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833626,0.00016688906,0.000118872675,0.00021730203,0.0010161181,0.0001445932],"domain_scores_gemma":[0.9972235,0.00096781575,0.00039220808,0.000492782,0.00079509587,0.0001286924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010436166,0.0011345709,0.0007795336,0.0028933163,0.0010363207,0.0018242395,0.0017217286,0.0010929711,0.007712521],"category_scores_gemma":[0.00884565,0.00041945852,0.0008359605,0.0025198597,0.00091360114,0.0035483642,0.0017135987,0.0012141996,0.0035614918],"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.0007801297,0.0001533615,0.004163837,0.00042094372,0.00011308114,0.00018520215,0.00022135631,0.040053755,0.06562441,0.03626258,0.024422547,0.8275988],"study_design_scores_gemma":[0.0001553086,0.00064969104,0.0035263684,0.000097142845,0.00006633993,0.0007995963,0.00017535243,0.7473297,0.15594605,0.05441987,0.03666119,0.00017334406],"about_ca_topic_score_codex":0.0020599882,"about_ca_topic_score_gemma":0.0024751988,"teacher_disagreement_score":0.007712521,"about_ca_system_score_codex":0.0011813348,"about_ca_system_score_gemma":0.001704174,"threshold_uncertainty_score":0.025800943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075385086,0.00052834523,0.9141756,0.00038190364,0.00009920328,0.00011845098,0.00022009798,0.0008526901,0.008238518],"genre_scores_gemma":[0.8864002,0.0002959605,0.1081998,0.00006093527,0.000037250546,0.00011054163,0.00026393906,0.00013224728,0.0044991267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951947,0.00015708667,0.000020016789,0.00007075463,0.00012370167,0.00010895083],"domain_scores_gemma":[0.9992669,0.00033130086,0.00007937621,0.00015558457,0.00010000217,0.000066905755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000511916,0.0007509348,0.0006969131,0.0006978738,0.0005769119,0.0010374527,0.0013868951,0.00053956785,0.004972146],"category_scores_gemma":[0.002506201,0.00030995172,0.00034853464,0.0007254011,0.00045691765,0.0015857326,0.0011562152,0.0005769622,0.00046377647],"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.00010956499,0.00005890156,0.00041093593,0.000093875926,0.000016694012,0.00008665808,0.00007022973,0.8672482,0.003144561,0.03749607,0.0031289605,0.08813544],"study_design_scores_gemma":[0.000006411051,0.0000286777,0.00011653489,0.000005425672,0.0000047764897,0.00004202075,0.000022778711,0.9758647,0.0009476203,0.021541016,0.0014150351,0.0000050236863],"about_ca_topic_score_codex":0.0023759017,"about_ca_topic_score_gemma":0.0022356533,"teacher_disagreement_score":0.004972146,"about_ca_system_score_codex":0.0012128339,"about_ca_system_score_gemma":0.00089240645,"threshold_uncertainty_score":0.01663351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005489446,0.00011952082,0.9851216,0.00009066488,0.00008221434,0.00011863289,0.00006962239,0.0075082877,0.0013999869],"genre_scores_gemma":[0.22607233,0.00025797592,0.7644964,0.00038657177,0.00020280533,0.0003435037,0.00033023543,0.0012327589,0.006677403],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974946,0.0003877032,0.0002180131,0.00073972903,0.0009410741,0.00021896345],"domain_scores_gemma":[0.99432474,0.0017465582,0.00052420737,0.0025849137,0.0006510783,0.00016854357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016255807,0.0010630772,0.0007936425,0.0022764024,0.0006870024,0.0019147915,0.0031096188,0.0013328037,0.0077097006],"category_scores_gemma":[0.004231037,0.0006423689,0.0008571514,0.0012613571,0.0013372367,0.0031776843,0.0018270105,0.0017133991,0.001984197],"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.0013119117,0.0004258707,0.0027241185,0.0004648255,0.00013336385,0.0011076141,0.0007925044,0.024028847,0.26960704,0.17973068,0.0069501996,0.512723],"study_design_scores_gemma":[0.00028468875,0.0014660895,0.0011783344,0.00010122966,0.00025741706,0.002336138,0.000088742425,0.3550985,0.5120427,0.04782204,0.0791148,0.00020930542],"about_ca_topic_score_codex":0.0005405042,"about_ca_topic_score_gemma":0.0005739144,"teacher_disagreement_score":0.0077097006,"about_ca_system_score_codex":0.00063184655,"about_ca_system_score_gemma":0.001121591,"threshold_uncertainty_score":0.025791526},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02071228,0.00021396318,0.9712833,0.00006705833,0.00005938931,0.00003827338,0.000044598626,0.0003566796,0.007224413],"genre_scores_gemma":[0.2905809,0.00034795597,0.69803965,0.00011050768,0.00006578671,0.0001549735,0.00022247313,0.0003084014,0.010169335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996823,0.000052549087,0.000023654668,0.000043116266,0.00015522647,0.00004315477],"domain_scores_gemma":[0.9996462,0.000089211535,0.000020958594,0.00008535231,0.00013231696,0.000025966889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040437642,0.000489704,0.0003769371,0.0009404424,0.0004634559,0.0006772869,0.0007555655,0.00041287448,0.0062906174],"category_scores_gemma":[0.001140124,0.00019942618,0.00042691277,0.00080416637,0.000590503,0.0017583728,0.0009495613,0.0009003467,0.0018198548],"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.00014202509,0.00008032987,0.0006240213,0.00016165033,0.00002820879,0.0003044217,0.00042335448,0.030554326,0.04192627,0.5393978,0.005415755,0.38094187],"study_design_scores_gemma":[0.00003513548,0.0001619869,0.00029850946,0.000039938754,0.000021975962,0.0003509203,0.00010376627,0.6779017,0.03599,0.26829323,0.016765393,0.00003757821],"about_ca_topic_score_codex":0.00074065523,"about_ca_topic_score_gemma":0.0014863937,"teacher_disagreement_score":0.0062906174,"about_ca_system_score_codex":0.0004779814,"about_ca_system_score_gemma":0.0005263815,"threshold_uncertainty_score":0.021044195},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16299933,0.0020230804,0.7958252,0.00096601824,0.00071827543,0.00036179886,0.00029788687,0.015511429,0.021297028],"genre_scores_gemma":[0.5948291,0.00057674415,0.39087194,0.00026608576,0.0001991528,0.00021504554,0.00057273166,0.00016661864,0.012302563],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996369,0.00004261323,0.000034430905,0.00007901731,0.00011953433,0.00008748863],"domain_scores_gemma":[0.99969864,0.000049113092,0.000036213998,0.00008415455,0.000098725286,0.000033258842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033849425,0.000760309,0.0005951486,0.0014214504,0.0009592546,0.0011285223,0.0014000342,0.0007321502,0.0067185108],"category_scores_gemma":[0.00063191366,0.00036581207,0.00045670688,0.0007146537,0.0004893911,0.0021776822,0.0007795239,0.00084709993,0.0024705294],"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.0011987266,0.0003581852,0.0020734945,0.00045254375,0.00007680191,0.0005339316,0.00050463725,0.010805328,0.21142615,0.07278078,0.016534118,0.6832553],"study_design_scores_gemma":[0.0012010422,0.004098668,0.004393827,0.0002618682,0.00027600877,0.0033796602,0.00038093497,0.28511345,0.5242132,0.040111378,0.13612731,0.00044271862],"about_ca_topic_score_codex":0.0010476895,"about_ca_topic_score_gemma":0.001324642,"teacher_disagreement_score":0.0067185108,"about_ca_system_score_codex":0.00092655304,"about_ca_system_score_gemma":0.0011783302,"threshold_uncertainty_score":0.02247566},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6173857,0.00034871424,0.37785685,0.00008322549,0.000018427043,0.000043297172,0.00010369557,0.00038476175,0.003775284],"genre_scores_gemma":[0.9875915,0.00009430171,0.011773026,0.00001027314,0.000008530266,0.00001819651,0.00003553661,0.000014108428,0.00045451557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997428,0.00003684356,0.000017522074,0.000037214668,0.00013585777,0.000029729345],"domain_scores_gemma":[0.99818194,0.0011046848,0.0003232382,0.00017731413,0.00017407752,0.000038799513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035930122,0.00029801557,0.00020919323,0.0005609518,0.00013818608,0.00036452748,0.00023648821,0.00021233171,0.0009198407],"category_scores_gemma":[0.002874292,0.00013640367,0.00027390075,0.00026574286,0.0003905808,0.0004122511,0.00020629163,0.0002449352,0.000089710215],"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.00036385935,0.000058805177,0.004347894,0.00022003824,0.000046965557,0.00040584576,0.00017746892,0.6547468,0.19534053,0.08929417,0.00025385455,0.0547438],"study_design_scores_gemma":[0.000005972364,0.000113654256,0.0010228967,0.000008135818,0.000012729286,0.0001087333,0.00001139606,0.958681,0.02262531,0.01697269,0.00042979434,0.000007591326],"about_ca_topic_score_codex":0.00061596424,"about_ca_topic_score_gemma":0.00033489647,"teacher_disagreement_score":0.0009198407,"about_ca_system_score_codex":0.00033953946,"about_ca_system_score_gemma":0.00037684044,"threshold_uncertainty_score":0.003077209},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09488615,0.00017976703,0.89130956,0.000120833145,0.00008009366,0.0002651148,0.00014449509,0.009956242,0.0030577565],"genre_scores_gemma":[0.66350335,0.00015569213,0.33253244,0.0001572398,0.0000352595,0.00022807872,0.00032199424,0.0011042253,0.0019616738],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99835783,0.0005372631,0.00013715471,0.0002634007,0.00047713856,0.00022722525],"domain_scores_gemma":[0.99316967,0.0038612313,0.00089861755,0.0012691314,0.000693605,0.00010773229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001569564,0.0011892499,0.000582742,0.0008702314,0.00040852866,0.0014165511,0.0015252742,0.00080525223,0.0040725856],"category_scores_gemma":[0.007280753,0.0005285907,0.0004287621,0.0004666574,0.0007952845,0.001585858,0.0006876987,0.00094278617,0.00070025184],"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.002052677,0.00041421448,0.0125000905,0.0008613225,0.000116327916,0.0017903572,0.001069089,0.13645996,0.33555022,0.058661122,0.0057343277,0.44479033],"study_design_scores_gemma":[0.00012571586,0.0005907386,0.0024546843,0.00008298928,0.0000869585,0.00053569645,0.00017368273,0.30911246,0.6506504,0.023571635,0.012541775,0.00007335899],"about_ca_topic_score_codex":0.00065586105,"about_ca_topic_score_gemma":0.0011261946,"teacher_disagreement_score":0.0040725856,"about_ca_system_score_codex":0.0005493886,"about_ca_system_score_gemma":0.0012130822,"threshold_uncertainty_score":0.013624132},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32214683,0.0008357544,0.65255696,0.00019424665,0.00016026913,0.000089740766,0.00025819708,0.0040051397,0.019752935],"genre_scores_gemma":[0.6914211,0.00034416732,0.29947805,0.00006598277,0.000041775256,0.000060824736,0.00041072696,0.000097771175,0.008079715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998568,0.000023449307,0.000012144383,0.000029261671,0.00005990081,0.000018354074],"domain_scores_gemma":[0.9997727,0.00006178694,0.00003337917,0.00006421725,0.00006120236,0.0000066185016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017877108,0.0003908311,0.0002566553,0.0004684062,0.00023209765,0.0004425423,0.00047773088,0.00017150545,0.0023187206],"category_scores_gemma":[0.00051772996,0.00018478016,0.00022848228,0.0005403591,0.00017329081,0.00057806395,0.00025949228,0.00022108835,0.0006532307],"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.0007033073,0.0001623505,0.0019226113,0.0004230005,0.00008479104,0.0007430704,0.0002272862,0.08093324,0.36689582,0.041739598,0.004624607,0.50154036],"study_design_scores_gemma":[0.0001311294,0.0006280869,0.0013779434,0.000050990184,0.000114465634,0.0014289829,0.00006492763,0.5444551,0.41405138,0.011796165,0.025853304,0.000047469555],"about_ca_topic_score_codex":0.0004287184,"about_ca_topic_score_gemma":0.0009048812,"teacher_disagreement_score":0.0023187206,"about_ca_system_score_codex":0.00024667557,"about_ca_system_score_gemma":0.00038496417,"threshold_uncertainty_score":0.0077568293},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97552705,0.000228971,0.019555567,0.00007329528,0.000043716467,0.0001055291,0.00005673281,0.00027917916,0.004130042],"genre_scores_gemma":[0.99194044,0.00006673457,0.0072402847,0.000008387758,0.00000629387,0.000039176346,0.000052777697,0.00002045794,0.0006254535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990729,0.00028907886,0.000055014727,0.00009095081,0.0003024578,0.0001894844],"domain_scores_gemma":[0.9971745,0.0012164346,0.0002419062,0.0003634002,0.00086654973,0.00013718197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011623552,0.0005455259,0.000260737,0.00073982746,0.00035600038,0.000556508,0.0008011979,0.00033618946,0.0013342662],"category_scores_gemma":[0.0041839425,0.00014653325,0.00021766018,0.00044842798,0.00038807924,0.0012113318,0.00039769502,0.00034583316,0.00013722137],"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.0033506155,0.0009433633,0.009690692,0.0006203619,0.00014634196,0.0003072001,0.000381375,0.72218144,0.10046646,0.0153823,0.0015191411,0.14501071],"study_design_scores_gemma":[0.00016041867,0.0029997863,0.005966479,0.00002385011,0.00011379184,0.000117323514,0.0002077893,0.90403575,0.08152229,0.0020156223,0.0028038896,0.000033021683],"about_ca_topic_score_codex":0.0018027691,"about_ca_topic_score_gemma":0.0015555706,"teacher_disagreement_score":0.0018027691,"about_ca_system_score_codex":0.0013660379,"about_ca_system_score_gemma":0.0005833577,"threshold_uncertainty_score":0.009911299},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09604274,0.0012479116,0.89158684,0.0005720269,0.00016619427,0.000077587196,0.00013095206,0.0009110964,0.009264636],"genre_scores_gemma":[0.928649,0.00043366145,0.06853262,0.00007428036,0.00002830866,0.000030360423,0.0001207201,0.00003574549,0.0020953205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997749,0.00007039561,0.0000056388153,0.00002960465,0.00006637615,0.000053148495],"domain_scores_gemma":[0.99973804,0.00008245333,0.000034602675,0.000066437286,0.000053163418,0.000025297806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029308742,0.00038835645,0.00029053012,0.000303154,0.0006084435,0.0005585214,0.0007660643,0.00033681598,0.002136635],"category_scores_gemma":[0.000760539,0.00009865956,0.00020496173,0.00047708012,0.00025230146,0.0010421715,0.0008953311,0.00053791335,0.00027146554],"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.00028746665,0.000094279654,0.0012756846,0.00013211308,0.000043375072,0.00043396567,0.00016596867,0.6492954,0.035290416,0.03682196,0.006819911,0.26933956],"study_design_scores_gemma":[0.000004909427,0.000032421565,0.00026969204,0.000007444703,0.0000060382145,0.00014608927,0.00008714159,0.9770181,0.0046778447,0.01330866,0.0044344347,0.0000072358716],"about_ca_topic_score_codex":0.0020965303,"about_ca_topic_score_gemma":0.0031537425,"teacher_disagreement_score":0.002136635,"about_ca_system_score_codex":0.0005842221,"about_ca_system_score_gemma":0.00063963083,"threshold_uncertainty_score":0.007147789},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012111382,0.00032056146,0.9952188,0.00020773234,0.000042171083,0.000054471886,0.000066461456,0.00036436928,0.002514323],"genre_scores_gemma":[0.14833161,0.0027158551,0.84407735,0.0004484825,0.0004538937,0.0007219534,0.00050299754,0.00027219433,0.0024756552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929957,0.0026654687,0.0006137066,0.00073563005,0.002474614,0.00051498075],"domain_scores_gemma":[0.9846859,0.0117113115,0.00076125603,0.0015643624,0.0011625133,0.00011462122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009812902,0.001481841,0.000923123,0.0024409937,0.00095993077,0.003044241,0.002721859,0.001074855,0.005016435],"category_scores_gemma":[0.018438496,0.00067934673,0.0029005625,0.0015691784,0.0044918186,0.003457438,0.002605685,0.0034262158,0.0013844623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00003515345,0.0000839167,0.00036749736,0.00060231093,0.00007437225,0.00037734403,0.00036924475,0.059842303,0.0032916393,0.87958896,0.0026351262,0.05273214],"study_design_scores_gemma":[0.000055777266,0.000050606795,0.000136826,0.0001533687,0.00005025767,0.00020956121,0.000049904575,0.11794195,0.0047721136,0.86009914,0.016444562,0.000035912708],"about_ca_topic_score_codex":0.0015333768,"about_ca_topic_score_gemma":0.00075928844,"teacher_disagreement_score":0.009812902,"about_ca_system_score_codex":0.00175068,"about_ca_system_score_gemma":0.002558835,"threshold_uncertainty_score":0.051896214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21727297,0.0019384951,0.75011706,0.000928276,0.0002419392,0.00014799026,0.00014907829,0.003510203,0.025694042],"genre_scores_gemma":[0.7572407,0.0006365592,0.23871247,0.00008885799,0.00002506247,0.000078999,0.00012379928,0.00013245737,0.0029610759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981374,0.000072072406,0.0000093383205,0.000017004926,0.00006486526,0.000023044953],"domain_scores_gemma":[0.9994875,0.00026456578,0.00003264592,0.00006440006,0.00012452088,0.000026366793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032359196,0.0003409651,0.00019226818,0.0003289742,0.00028119236,0.0003283851,0.0004245393,0.00026603922,0.0030111477],"category_scores_gemma":[0.0015052045,0.00017350412,0.00018982743,0.00045637527,0.00019479511,0.0003320419,0.00029517655,0.00029428102,0.00024427474],"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.0003803643,0.00008691486,0.0047167717,0.00021477524,0.00007617482,0.00034914727,0.0001693218,0.723496,0.025230667,0.015874192,0.0047101458,0.22469552],"study_design_scores_gemma":[0.000023040002,0.00006302502,0.0005555567,0.00001497144,0.000013862121,0.0000826332,0.000026901884,0.98355365,0.0073538055,0.0026608584,0.005644107,0.000007676767],"about_ca_topic_score_codex":0.0031716998,"about_ca_topic_score_gemma":0.0059731826,"teacher_disagreement_score":0.0031716998,"about_ca_system_score_codex":0.00051278964,"about_ca_system_score_gemma":0.000509797,"threshold_uncertainty_score":0.010073245},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24688523,0.0013436258,0.7203334,0.0004316093,0.00032237195,0.00046326427,0.00019777575,0.0023747378,0.02764802],"genre_scores_gemma":[0.5739921,0.0005956065,0.40784818,0.00012178116,0.00008961854,0.00017837906,0.00040077878,0.00015340897,0.016620148],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944943,0.00010531069,0.00006137846,0.000079343925,0.00023723824,0.00006735983],"domain_scores_gemma":[0.99955684,0.000050417606,0.0000558718,0.00017113393,0.00013263093,0.000033030385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005846446,0.00040761626,0.0004385235,0.0007562116,0.0004572754,0.0006715655,0.0006982606,0.0003690182,0.0035401105],"category_scores_gemma":[0.0010374631,0.00016248183,0.000327167,0.00061669055,0.0004926524,0.0016034495,0.00078478974,0.0007061101,0.001292887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015441043,0.00025235012,0.0019312885,0.00056074996,0.00007596934,0.0009541139,0.00080124795,0.016048651,0.26434493,0.2708879,0.0053519765,0.43724662],"study_design_scores_gemma":[0.0007132049,0.0035968288,0.0026582305,0.00025850558,0.00020228409,0.006328044,0.000286167,0.23006824,0.44440678,0.09679239,0.21439134,0.0002981222],"about_ca_topic_score_codex":0.00015492711,"about_ca_topic_score_gemma":0.00023079876,"teacher_disagreement_score":0.0035401105,"about_ca_system_score_codex":0.00040023107,"about_ca_system_score_gemma":0.00073129043,"threshold_uncertainty_score":0.011842787},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033889703,0.000064063795,0.9631031,0.00008280926,0.000020943331,0.000082260805,0.00006308068,0.0003039266,0.0023901367],"genre_scores_gemma":[0.6632154,0.000104176936,0.3298307,0.00006218815,0.000024809193,0.00028654534,0.00023054039,0.0001441263,0.0061015137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943775,0.00012376245,0.000032813623,0.00018507679,0.000107883534,0.000112643385],"domain_scores_gemma":[0.9991959,0.00030357533,0.00017526514,0.00013985435,0.00008949782,0.00009597796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001077541,0.0007335946,0.0009996673,0.00063771795,0.0007114564,0.00086432614,0.0016927143,0.0007988704,0.0039929873],"category_scores_gemma":[0.002519602,0.00043542316,0.00052556506,0.0008389973,0.000622264,0.0012784408,0.0014464167,0.0006294915,0.0005794479],"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.00031898022,0.00011976049,0.00062310096,0.000079263285,0.000027961767,0.000090322836,0.00013014615,0.9128442,0.0053199916,0.02928068,0.0015586873,0.04960692],"study_design_scores_gemma":[0.0000413447,0.00008908764,0.00018831293,0.000004037572,0.000007196453,0.000036045672,0.00003642319,0.98561966,0.0013921524,0.011571557,0.0010066639,0.00000745261],"about_ca_topic_score_codex":0.0024533768,"about_ca_topic_score_gemma":0.002485683,"teacher_disagreement_score":0.0039929873,"about_ca_system_score_codex":0.0009781725,"about_ca_system_score_gemma":0.0014308704,"threshold_uncertainty_score":0.013357818},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040285527,0.00004159077,0.99497247,0.000038281098,0.000012953286,0.000029283225,0.000014787729,0.00046864757,0.00039345067],"genre_scores_gemma":[0.061697174,0.00003855406,0.9373845,0.000046721787,0.000016701688,0.00007315354,0.00007134114,0.000059360078,0.00061250036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992367,0.0001467388,0.00005621118,0.00016848237,0.00031052166,0.000081302605],"domain_scores_gemma":[0.9985671,0.00060848927,0.00016501876,0.0003517913,0.00026293233,0.00004465595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086820265,0.0008493513,0.00071954046,0.0009026672,0.00066942925,0.0010423716,0.0019417022,0.0010329245,0.0021796632],"category_scores_gemma":[0.003774246,0.00048373238,0.00047459546,0.0008978487,0.0006350396,0.0014981027,0.0012772316,0.001034725,0.00069542596],"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.00027482727,0.00018999854,0.0016951084,0.00014397576,0.00007335708,0.0001249344,0.00013580086,0.2818173,0.036348235,0.03453911,0.0029199237,0.6417374],"study_design_scores_gemma":[0.000044447646,0.00006763639,0.00015973336,0.000008628263,0.000013357879,0.000102507285,0.00001369266,0.9824554,0.006532596,0.008763098,0.0018265797,0.000012391352],"about_ca_topic_score_codex":0.0019758437,"about_ca_topic_score_gemma":0.0044023735,"teacher_disagreement_score":0.0021796632,"about_ca_system_score_codex":0.00048754236,"about_ca_system_score_gemma":0.0023279085,"threshold_uncertainty_score":0.0072916746},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0665561,0.0009868722,0.9277809,0.00029578284,0.00009855701,0.0001287563,0.00006233247,0.00021142095,0.0038792517],"genre_scores_gemma":[0.8090471,0.0009110997,0.18686144,0.00010641366,0.0000785071,0.00017252969,0.00010964792,0.000106665444,0.0026066578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892056,0.00040174954,0.000049471226,0.00017928531,0.00024163627,0.00020743502],"domain_scores_gemma":[0.99797016,0.0013992485,0.00019370615,0.000112817455,0.00018969955,0.00013435968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015367343,0.0015774544,0.0015346527,0.0005842115,0.000509024,0.0013752582,0.0012950918,0.0012179913,0.0015689087],"category_scores_gemma":[0.0035471895,0.00066444697,0.00067109935,0.0011052982,0.00070030056,0.0015431849,0.0009895123,0.0010790825,0.00022795679],"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.00004620317,0.00007348692,0.00026271085,0.00006630827,0.000019571884,0.000056521483,0.000019715853,0.9698915,0.0017754136,0.0042306627,0.00048311238,0.023074664],"study_design_scores_gemma":[0.000007341876,0.00003581878,0.00005809223,0.0000030889894,0.000008217063,0.000015856713,0.0000101404685,0.9972053,0.0006316213,0.001799737,0.00022142516,0.0000033560607],"about_ca_topic_score_codex":0.0024158119,"about_ca_topic_score_gemma":0.0027213853,"teacher_disagreement_score":0.0024158119,"about_ca_system_score_codex":0.001154235,"about_ca_system_score_gemma":0.0017541234,"threshold_uncertainty_score":0.008374572},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01970407,0.00018908671,0.97769004,0.00007169575,0.000010010578,0.00003304044,0.00009534655,0.0008373825,0.0013692427],"genre_scores_gemma":[0.4466819,0.0003273625,0.55042106,0.000056376724,0.00004540243,0.00013268834,0.0005637998,0.00021132335,0.0015600742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989587,0.00028315687,0.000050232895,0.00018399925,0.00043603117,0.00008775531],"domain_scores_gemma":[0.9959466,0.0024914455,0.0003612043,0.0004750733,0.00065102795,0.00007480052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011867271,0.0010508902,0.0011090096,0.0016920834,0.0004665351,0.0013115105,0.0011215701,0.0009254479,0.0021877852],"category_scores_gemma":[0.011846286,0.0007176662,0.0006289581,0.00081571104,0.00054534554,0.0016856373,0.0009860425,0.0011554341,0.0007737288],"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.000058178455,0.000029457971,0.0012527019,0.000070086455,0.000027450284,0.0000538533,0.00003939879,0.884858,0.005946839,0.010433714,0.0010209815,0.09620941],"study_design_scores_gemma":[0.000003566982,0.0000072447083,0.00015548508,0.000004162747,0.0000023970365,0.0000161876,0.0000041534117,0.99398166,0.000984998,0.004673656,0.00016219795,0.0000042190195],"about_ca_topic_score_codex":0.0035746591,"about_ca_topic_score_gemma":0.0041711,"teacher_disagreement_score":0.0035746591,"about_ca_system_score_codex":0.0008991058,"about_ca_system_score_gemma":0.0013948333,"threshold_uncertainty_score":0.0073188543},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069956775,0.0070581506,0.01039153,0.8615268,0.06528413,0.000064670625,0.0005397238,0.0014174937,0.046721853],"genre_scores_gemma":[0.077083565,0.0036165067,0.004286582,0.86544865,0.030217478,0.00019082267,0.00021140139,0.00028792926,0.018656967],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967211,0.00057529146,0.00025044612,0.0007339213,0.0012915323,0.00042763635],"domain_scores_gemma":[0.99248564,0.0037598396,0.0005704838,0.00085600157,0.0018289008,0.0004990718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036827757,0.000895366,0.0008822456,0.00048039015,0.0025068985,0.0015072942,0.004095041,0.012827801,0.010987482],"category_scores_gemma":[0.013900097,0.00046416238,0.0010924096,0.0006827716,0.0073740194,0.0063584317,0.0024750507,0.015310243,0.0058903787],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00019207256,0.000029693978,0.00045284192,0.0004031816,0.000022226912,0.00075760414,0.00031142178,0.00063472055,0.0021916588,0.27325287,0.7091968,0.012554914],"study_design_scores_gemma":[0.0001023025,0.00010725046,0.0006823261,0.0002286884,0.000024296589,0.0010682117,0.00032068105,0.001061528,0.0033030994,0.09610735,0.8969381,0.000056285942],"about_ca_topic_score_codex":0.0027974078,"about_ca_topic_score_gemma":0.0021333385,"teacher_disagreement_score":0.012827801,"about_ca_system_score_codex":0.00253434,"about_ca_system_score_gemma":0.0011882037,"threshold_uncertainty_score":0.036756814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15027569,0.0013622995,0.80737454,0.00035251817,0.000073605996,0.00015225794,0.0006377797,0.0010937593,0.038677424],"genre_scores_gemma":[0.9425716,0.00076866086,0.04813765,0.000056748646,0.000034760087,0.00012617618,0.00026111846,0.00006287969,0.0079804575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954,0.00012601972,0.000017654304,0.00007322363,0.0001543621,0.00008889879],"domain_scores_gemma":[0.999511,0.00014706282,0.00007423767,0.000082070794,0.00015695252,0.000028721552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056891306,0.00035804987,0.00029741495,0.0005207756,0.00027840628,0.0006532139,0.0013747448,0.0005792925,0.0029551098],"category_scores_gemma":[0.0016404658,0.0002028138,0.00029297342,0.00068260764,0.0003300347,0.0012487195,0.0004358081,0.00037467698,0.0007392925],"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.00002581979,0.000017663271,0.0003373117,0.00002387453,0.0000042943857,0.000032199663,0.000021493624,0.9684645,0.0017287504,0.023537662,0.00055650756,0.0052498356],"study_design_scores_gemma":[0.0000021187873,0.000012828022,0.00011051165,0.0000022669271,0.0000019785107,0.000012269942,0.00000561558,0.99589646,0.00029554547,0.0030190176,0.00063786976,0.0000035909288],"about_ca_topic_score_codex":0.0064167953,"about_ca_topic_score_gemma":0.0038378467,"teacher_disagreement_score":0.0064167953,"about_ca_system_score_codex":0.0014419656,"about_ca_system_score_gemma":0.0007758474,"threshold_uncertainty_score":0.012758911},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74658805,0.0072669946,0.2293376,0.0005745259,0.00007868697,0.0002698219,0.00031051724,0.00065748976,0.0149163585],"genre_scores_gemma":[0.9560529,0.00077618944,0.04194636,0.000043535067,0.000031427368,0.00010121898,0.00018758705,0.00010185323,0.00075891544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99268264,0.0040870886,0.00040882968,0.00035839024,0.0021090205,0.00035406795],"domain_scores_gemma":[0.9791895,0.015185158,0.0021234879,0.0012134677,0.0020876536,0.00020060567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058719763,0.0015437234,0.00058053696,0.002318168,0.00046982616,0.001105871,0.00077249075,0.0007359154,0.0011118926],"category_scores_gemma":[0.024302043,0.00030100724,0.0004421175,0.002118757,0.00055002753,0.001676023,0.000612785,0.0004952897,0.00018539943],"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.0012489833,0.00034455405,0.012723833,0.000508929,0.00016454121,0.00021259816,0.00014911218,0.747689,0.034761332,0.008640142,0.0011191107,0.19243781],"study_design_scores_gemma":[0.00003671837,0.0012256253,0.005829109,0.00004555781,0.000089332025,0.000247589,0.000097145974,0.9520871,0.034171514,0.0045668436,0.0015673124,0.000036163998],"about_ca_topic_score_codex":0.00080227625,"about_ca_topic_score_gemma":0.0011311587,"teacher_disagreement_score":0.0058719763,"about_ca_system_score_codex":0.0017875895,"about_ca_system_score_gemma":0.0005067156,"threshold_uncertainty_score":0.031054378},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03475196,0.00040293168,0.75115675,0.00017537433,0.0002787398,0.00022762557,0.0047321096,0.17418283,0.03409172],"genre_scores_gemma":[0.27899238,0.00071651797,0.5493221,0.0005839856,0.00012257001,0.0012667652,0.031934243,0.07726418,0.059797205],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966097,0.00003057447,0.000022106782,0.000063118685,0.00015954056,0.00006361167],"domain_scores_gemma":[0.99940634,0.00014178643,0.000039701645,0.00016440048,0.00021717283,0.00003063304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040291925,0.0012908586,0.0006934032,0.00095509115,0.00060498697,0.00093692663,0.0017927949,0.00054809276,0.023784244],"category_scores_gemma":[0.0015477261,0.0005501319,0.0008168101,0.0010836434,0.00037225263,0.00085243996,0.00075067586,0.0009765588,0.008854613],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016933575,0.0002625461,0.0051643895,0.0016163308,0.00017154173,0.001492149,0.00057315925,0.062866315,0.14951725,0.06817448,0.23645994,0.47200856],"study_design_scores_gemma":[0.00030340045,0.00021906324,0.0024118568,0.00010823989,0.00008799018,0.0013219094,0.000070779,0.29412016,0.29746267,0.009848599,0.39388186,0.00016356468],"about_ca_topic_score_codex":0.0028968498,"about_ca_topic_score_gemma":0.0024482647,"teacher_disagreement_score":0.023784244,"about_ca_system_score_codex":0.0010297156,"about_ca_system_score_gemma":0.0013257968,"threshold_uncertainty_score":0.07956624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30626142,0.0042275866,0.6835494,0.0006733071,0.00016235911,0.0001864356,0.00008057736,0.0022065504,0.0026523843],"genre_scores_gemma":[0.9776023,0.00028531262,0.021558315,0.00005226747,0.00003472708,0.00004132017,0.000033503697,0.000022727945,0.0003695661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995003,0.00013951471,0.00005077296,0.0000987394,0.0001345879,0.00007608772],"domain_scores_gemma":[0.9983339,0.00064588,0.00024238753,0.00034150254,0.0002609407,0.00017530861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008871653,0.00044419043,0.00065512856,0.000557163,0.0010202447,0.0010938003,0.0012884886,0.0005948061,0.00030271817],"category_scores_gemma":[0.0026558253,0.00032789956,0.00022132859,0.00059846195,0.00059306255,0.0019197518,0.0014526794,0.00054858223,0.000095315874],"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.00032730115,0.00024627065,0.011783224,0.00035026125,0.00025996537,0.00097404345,0.0010751373,0.7048658,0.061024986,0.018147487,0.004514368,0.19643115],"study_design_scores_gemma":[0.000019737416,0.000073785246,0.0011207048,0.000010754796,0.00003411751,0.00015353663,0.0001641833,0.9862407,0.0044677365,0.0053088125,0.0023849525,0.000021141095],"about_ca_topic_score_codex":0.0031470996,"about_ca_topic_score_gemma":0.004122674,"teacher_disagreement_score":0.0031470996,"about_ca_system_score_codex":0.0005676159,"about_ca_system_score_gemma":0.00054177915,"threshold_uncertainty_score":0.006257534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04876773,0.0079938155,0.9243033,0.0015313957,0.00021747209,0.0001796361,0.00043360045,0.0010649794,0.015508],"genre_scores_gemma":[0.78124034,0.010134934,0.19977684,0.0009790825,0.0008638305,0.0007459012,0.0009929059,0.0009014725,0.0043647634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99069595,0.0022890635,0.00047714438,0.001528218,0.0033211822,0.0016884726],"domain_scores_gemma":[0.92430013,0.061592735,0.0035095806,0.0055901706,0.0038817239,0.0011256435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011197396,0.003798349,0.0022134327,0.0034106793,0.0021888858,0.0055771293,0.00485313,0.0022945995,0.004846539],"category_scores_gemma":[0.066268325,0.0012478033,0.0014960249,0.0034634122,0.0037229657,0.013885804,0.0043079313,0.0043394966,0.0013113774],"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.0012426454,0.00029755206,0.0026243255,0.000973725,0.00023624641,0.00033284203,0.0005946449,0.6659629,0.012305391,0.19953413,0.0066220467,0.10927361],"study_design_scores_gemma":[0.00003750856,0.00040822136,0.0007400927,0.00016402811,0.00016781483,0.00042777596,0.00018738191,0.8514506,0.008041208,0.13435821,0.003952442,0.000064624626],"about_ca_topic_score_codex":0.002318951,"about_ca_topic_score_gemma":0.0013907586,"teacher_disagreement_score":0.011197396,"about_ca_system_score_codex":0.004897568,"about_ca_system_score_gemma":0.002276671,"threshold_uncertainty_score":0.059218228},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009980387,0.000079376056,0.9977852,0.000027995064,0.00003911804,0.000020292702,0.000009189734,0.0002915186,0.00074930716],"genre_scores_gemma":[0.033663187,0.00022068455,0.9624396,0.00006559175,0.00007315404,0.000091839844,0.00007493863,0.00013390262,0.0032370696],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936193,0.00012742718,0.000039612598,0.00013664944,0.00028819675,0.00004609169],"domain_scores_gemma":[0.99946254,0.0001754315,0.000041018946,0.00010251349,0.0001908549,0.00002767095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005641287,0.0007831249,0.0006144058,0.000796766,0.00074055325,0.00088147173,0.0011543159,0.000724008,0.008547195],"category_scores_gemma":[0.0020166286,0.00036753176,0.0005708636,0.0011298351,0.0007651417,0.0016274662,0.0010543765,0.0016315216,0.0036807167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026134218,0.00014877132,0.0004334617,0.00039601375,0.0001181865,0.00018624953,0.0002456469,0.042777773,0.082594514,0.105064765,0.006141785,0.7616315],"study_design_scores_gemma":[0.00020923634,0.00043997302,0.0006273888,0.000077884426,0.000105192485,0.0011139978,0.00009996316,0.75285167,0.0712663,0.08574261,0.08731576,0.00015007779],"about_ca_topic_score_codex":0.00093418884,"about_ca_topic_score_gemma":0.0014904886,"teacher_disagreement_score":0.008547195,"about_ca_system_score_codex":0.00047999356,"about_ca_system_score_gemma":0.0008846877,"threshold_uncertainty_score":0.028593183},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016733024,0.0005250935,0.9796825,0.00022928853,0.000021005842,0.00007773538,0.0000491503,0.0008754718,0.0018066865],"genre_scores_gemma":[0.60614204,0.00075292157,0.38905206,0.00018524307,0.00013021898,0.0003800372,0.00020065668,0.00016789733,0.0029888963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782443,0.0007333733,0.000098169694,0.0003036317,0.0007805627,0.00025994313],"domain_scores_gemma":[0.99274135,0.0038263437,0.0009521162,0.0017393574,0.00061306445,0.00012788508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021189908,0.0008834823,0.0018443457,0.0011463052,0.0009616704,0.0012904204,0.0023118232,0.00121801,0.0014256706],"category_scores_gemma":[0.010185572,0.00064193807,0.0006682118,0.0016817853,0.0011749689,0.0022712315,0.0017852996,0.0012154133,0.0007420756],"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.000968971,0.00017486911,0.0009577255,0.0007288438,0.00016428469,0.00041714907,0.00068830315,0.61218876,0.032821715,0.125313,0.008368649,0.21720777],"study_design_scores_gemma":[0.00014529456,0.00033411902,0.0003014084,0.000050867275,0.00006979479,0.00046037155,0.00009973073,0.9358139,0.01121229,0.04687515,0.004601975,0.00003514791],"about_ca_topic_score_codex":0.0018193532,"about_ca_topic_score_gemma":0.0014072773,"teacher_disagreement_score":0.0023118232,"about_ca_system_score_codex":0.0013507522,"about_ca_system_score_gemma":0.0014052673,"threshold_uncertainty_score":0.011206448},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006842067,0.00088029826,0.9842233,0.00038776235,0.000052889976,0.00007560939,0.000085350606,0.00041735702,0.007035492],"genre_scores_gemma":[0.110354766,0.0013024529,0.88274795,0.0002549652,0.000088121014,0.00033714005,0.0004823465,0.00026552446,0.0041666515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894387,0.00035217486,0.000062561194,0.000216606,0.00032239655,0.00010251659],"domain_scores_gemma":[0.998698,0.00086127257,0.000107386666,0.00016202396,0.00013673748,0.000034463486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010979656,0.0011699743,0.0011087529,0.0014047286,0.0009863761,0.002036083,0.0015522926,0.0016669417,0.006168612],"category_scores_gemma":[0.003900023,0.0009835637,0.0011903096,0.002005807,0.0012315992,0.0025264951,0.0018913948,0.0015464224,0.0015088057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011156175,0.00008947396,0.0009250854,0.0004222466,0.00005884321,0.00009064536,0.00021100859,0.6487283,0.004081752,0.088257745,0.0065217405,0.2505016],"study_design_scores_gemma":[0.000041280353,0.000042945903,0.00026914067,0.000041740073,0.000018793964,0.00011670445,0.000052414784,0.93452305,0.0011982308,0.05668029,0.006995653,0.000019789877],"about_ca_topic_score_codex":0.004253997,"about_ca_topic_score_gemma":0.0058660307,"teacher_disagreement_score":0.006168612,"about_ca_system_score_codex":0.0014209002,"about_ca_system_score_gemma":0.0015557412,"threshold_uncertainty_score":0.020636022},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12085512,0.0009227357,0.86574334,0.0002101952,0.00021199534,0.00014607723,0.00010751571,0.0009985857,0.010804409],"genre_scores_gemma":[0.4236603,0.00046579813,0.5675986,0.00012196197,0.00013292044,0.00013781105,0.00017496741,0.00004366516,0.0076639396],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999106,0.000023079034,0.0000074698555,0.000014095167,0.000034563294,0.0000101979085],"domain_scores_gemma":[0.9997495,0.00006902155,0.000052879295,0.000044788754,0.00006933308,0.000014415368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025791491,0.00035708142,0.00021509887,0.0005864699,0.0003125321,0.00037072168,0.00044118962,0.00028276345,0.0034497003],"category_scores_gemma":[0.0006855861,0.00012579358,0.00020739566,0.00042581154,0.00025333793,0.0008205481,0.00029301504,0.0003349798,0.0008190181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000711957,0.00018369265,0.0010661385,0.00040316695,0.00005898727,0.0005396634,0.00017778872,0.016161706,0.14551027,0.120726354,0.005310237,0.7091501],"study_design_scores_gemma":[0.00040606345,0.002174568,0.002682507,0.00016764694,0.00012820099,0.0031925952,0.0001649331,0.5772177,0.24496068,0.08376845,0.08499052,0.00014603403],"about_ca_topic_score_codex":0.0001712396,"about_ca_topic_score_gemma":0.00058264757,"teacher_disagreement_score":0.0034497003,"about_ca_system_score_codex":0.0002365155,"about_ca_system_score_gemma":0.00031755902,"threshold_uncertainty_score":0.011540413},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019375134,0.0030052958,0.96377987,0.0009383984,0.00021802161,0.00021607011,0.00002474615,0.00043943277,0.012003038],"genre_scores_gemma":[0.6577705,0.005635173,0.3278779,0.00057007343,0.0010078918,0.00048772543,0.00008478365,0.00013749072,0.0064284145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959149,0.0010788362,0.00029079572,0.00045369117,0.0020206259,0.00024119359],"domain_scores_gemma":[0.9932708,0.0034785806,0.0010443548,0.0014291528,0.000666175,0.00011097359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021238846,0.0017146914,0.00082604034,0.00340055,0.0008948044,0.002699553,0.0017648528,0.0018363643,0.0029610842],"category_scores_gemma":[0.010380053,0.0005868893,0.0010014642,0.0014854854,0.003715545,0.004673486,0.002046277,0.0023128518,0.0006965306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0004052054,0.00022177606,0.0010841398,0.0006634556,0.00017121696,0.00036978777,0.00032811685,0.10660356,0.022776766,0.60283875,0.002133877,0.26240325],"study_design_scores_gemma":[0.0001498835,0.0005772892,0.0007653114,0.0002956066,0.00015203722,0.0016911335,0.0001550514,0.4966477,0.049581207,0.43117884,0.018666148,0.00013985929],"about_ca_topic_score_codex":0.00013690887,"about_ca_topic_score_gemma":0.00018490336,"teacher_disagreement_score":0.00340055,"about_ca_system_score_codex":0.0009421513,"about_ca_system_score_gemma":0.0010024079,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066626244,0.00006855663,0.992167,0.00007104139,0.000022498014,0.000047434783,0.000029557968,0.00038115375,0.0005501304],"genre_scores_gemma":[0.29335016,0.00015893177,0.7033004,0.00014205511,0.000050228682,0.0003381991,0.00031677607,0.00014125429,0.00220198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990933,0.0001868778,0.000056605633,0.00027639378,0.00027262926,0.00011423044],"domain_scores_gemma":[0.99881786,0.0005767473,0.0001568567,0.00014755107,0.00021512824,0.00008584126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011758411,0.000808416,0.0011351559,0.0009821436,0.0007042717,0.00087843114,0.0022699577,0.0009445677,0.0017972029],"category_scores_gemma":[0.0038059368,0.0004775943,0.0005701116,0.00094810984,0.00081101264,0.0018915883,0.0017096195,0.0013185638,0.00040760168],"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.00013284975,0.00009852454,0.0006958987,0.000087176515,0.0000532165,0.000054994805,0.0001152605,0.79435796,0.0038094227,0.023300152,0.0021372645,0.17515743],"study_design_scores_gemma":[0.000017637323,0.000028167919,0.000051283725,0.0000037484049,0.0000043831446,0.000018520706,0.000009737683,0.9926795,0.0005538233,0.0059217843,0.0007052949,0.00000616018],"about_ca_topic_score_codex":0.004587856,"about_ca_topic_score_gemma":0.003912097,"teacher_disagreement_score":0.004587856,"about_ca_system_score_codex":0.0012913942,"about_ca_system_score_gemma":0.0021095201,"threshold_uncertainty_score":0.009369791},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014531969,0.0106836725,0.9474296,0.00036353158,0.00022450059,0.00015909837,0.0000987092,0.0014806883,0.025028167],"genre_scores_gemma":[0.32870036,0.010961211,0.63719517,0.0003466471,0.00045540126,0.0002518638,0.00026014532,0.0001933813,0.021635782],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953485,0.00006720267,0.000030338608,0.00007366803,0.0002589161,0.000035032797],"domain_scores_gemma":[0.999778,0.0000695599,0.000035325687,0.000038869337,0.000067966896,0.00001036706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045713113,0.00056086155,0.0005191057,0.0007225289,0.00043890098,0.0014054185,0.0010760357,0.00063951564,0.0037271157],"category_scores_gemma":[0.0007217818,0.00045205443,0.00039540476,0.0009764745,0.0006598365,0.0016191178,0.0004244045,0.0007917763,0.0022314016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026739476,0.00008367156,0.00094861275,0.0009736902,0.00008811666,0.00024062443,0.0002376592,0.03771394,0.119296856,0.34514663,0.00541388,0.48958895],"study_design_scores_gemma":[0.00014657987,0.0015308359,0.0015390891,0.00030189718,0.00019845349,0.003321322,0.0001493975,0.28639522,0.27061716,0.10771938,0.32790565,0.00017493094],"about_ca_topic_score_codex":0.00035540675,"about_ca_topic_score_gemma":0.00057461584,"teacher_disagreement_score":0.0037271157,"about_ca_system_score_codex":0.0007766237,"about_ca_system_score_gemma":0.000643089,"threshold_uncertainty_score":0.012468398},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8515811,0.00028235724,0.13732333,0.000563305,0.000025700008,0.0001078147,0.0005401131,0.00065851625,0.008917711],"genre_scores_gemma":[0.950478,0.00015984014,0.045885094,0.000082491424,0.00005075213,0.00007569087,0.0005944417,0.00011463202,0.0025590698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997741,0.00044045274,0.00015006543,0.0004219677,0.0008118506,0.00043458544],"domain_scores_gemma":[0.9793075,0.013903024,0.0018077516,0.003407552,0.0010298216,0.0005443661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001130086,0.00052275,0.00069266476,0.0011799302,0.00064918975,0.0019038635,0.0008678627,0.00051527476,0.004237847],"category_scores_gemma":[0.013556812,0.00037842285,0.0006429979,0.0010720898,0.0018612443,0.005607898,0.0013462577,0.00120431,0.00057266204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0038648054,0.0005169906,0.03630684,0.000730384,0.0001290405,0.00048122692,0.0008770954,0.30480236,0.0634308,0.43029487,0.005682089,0.15288351],"study_design_scores_gemma":[0.00014059358,0.00042389534,0.0042121275,0.000048952246,0.000038813705,0.00092784956,0.00019805723,0.40631554,0.034629915,0.5481342,0.00485362,0.000076436045],"about_ca_topic_score_codex":0.00063062704,"about_ca_topic_score_gemma":0.0010560744,"teacher_disagreement_score":0.004237847,"about_ca_system_score_codex":0.0015006526,"about_ca_system_score_gemma":0.0012851218,"threshold_uncertainty_score":0.014177084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006734258,0.0004569669,0.98785806,0.0001323926,0.000054685595,0.000068758956,0.000036682006,0.0005979779,0.004060342],"genre_scores_gemma":[0.12666456,0.0015440728,0.8654814,0.00014818949,0.00023583029,0.00017326842,0.00024983843,0.00019783968,0.0053050104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838114,0.0003928544,0.00013411666,0.00024128365,0.00065647333,0.00019405426],"domain_scores_gemma":[0.998906,0.00031801948,0.00012588118,0.00045856924,0.000147658,0.000043855576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012741303,0.00095520983,0.0009941416,0.0015934736,0.0009134379,0.0023608452,0.0017643312,0.00063284795,0.0047622775],"category_scores_gemma":[0.0032673082,0.00047210342,0.001243487,0.0017620174,0.0016471283,0.0058293096,0.002773238,0.0020836103,0.0031449804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0002545304,0.00011088297,0.0005185133,0.00027278913,0.000050679475,0.00015546895,0.00031200144,0.019868765,0.01497018,0.52262455,0.0037984718,0.43706316],"study_design_scores_gemma":[0.00019849728,0.00059672346,0.00055194163,0.00032324775,0.00012605613,0.0013926813,0.00021334802,0.26229757,0.080643594,0.5439117,0.10948723,0.0002573613],"about_ca_topic_score_codex":0.00043680653,"about_ca_topic_score_gemma":0.00055368745,"teacher_disagreement_score":0.0047622775,"about_ca_system_score_codex":0.00095749914,"about_ca_system_score_gemma":0.0015526837,"threshold_uncertainty_score":0.015931427},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2769316,0.0026740714,0.6776179,0.00033325312,0.0003564254,0.00029236107,0.00045765445,0.004461374,0.03687537],"genre_scores_gemma":[0.73916036,0.0013429513,0.24076976,0.00023683916,0.00013400441,0.00023905093,0.0006583475,0.000095532,0.0173632],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998603,0.000020390016,0.0000109876255,0.000028046674,0.000050428298,0.000029929222],"domain_scores_gemma":[0.99983335,0.000027321303,0.000030968302,0.000037154594,0.000050806982,0.000020365058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017405771,0.0004313779,0.00027846498,0.00040129395,0.00032160606,0.0005634167,0.00048718022,0.0002527987,0.0026111433],"category_scores_gemma":[0.0003527287,0.00013847667,0.00027788282,0.00037966025,0.000323674,0.0006111393,0.00035750927,0.00042227414,0.0007289581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005491384,0.00018990533,0.0021356875,0.0004051182,0.000068005735,0.00054926303,0.00021806044,0.027160946,0.18965115,0.12407511,0.008805714,0.64619195],"study_design_scores_gemma":[0.0003351628,0.002737273,0.0050459425,0.00029133394,0.00023777643,0.004602171,0.0002622442,0.36585772,0.32086524,0.10264714,0.19697295,0.00014513041],"about_ca_topic_score_codex":0.00022963915,"about_ca_topic_score_gemma":0.00052226486,"teacher_disagreement_score":0.0026111433,"about_ca_system_score_codex":0.00029844177,"about_ca_system_score_gemma":0.0004887776,"threshold_uncertainty_score":0.00873512},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21147288,0.0006886522,0.7650288,0.00034067826,0.000085722626,0.00014434046,0.000068686946,0.0010468516,0.021123506],"genre_scores_gemma":[0.74396443,0.00066918164,0.23968925,0.00009797074,0.00009932411,0.00010029271,0.00022100608,0.00009659913,0.01506196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99943,0.00009427175,0.000031312167,0.000085835316,0.00027128845,0.00008729278],"domain_scores_gemma":[0.9995197,0.00016580685,0.00006004365,0.00013067483,0.000103226404,0.000020602187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053421425,0.000536641,0.0005795358,0.00054058863,0.0005137302,0.0009433366,0.00052755635,0.00042015285,0.003927936],"category_scores_gemma":[0.0012309672,0.00024444037,0.0005797863,0.00051608164,0.00057025347,0.0019006606,0.0005782808,0.00075472274,0.001365223],"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.000994405,0.00025769326,0.00096126675,0.00043847365,0.000079023586,0.00052658556,0.00027375168,0.116493404,0.1633309,0.46727955,0.004321107,0.24504393],"study_design_scores_gemma":[0.000170081,0.00095839816,0.00069623685,0.000060762915,0.000087671004,0.0014326455,0.00010963506,0.6102065,0.1644278,0.20148285,0.020277862,0.00008960843],"about_ca_topic_score_codex":0.0005222888,"about_ca_topic_score_gemma":0.0012183598,"teacher_disagreement_score":0.003927936,"about_ca_system_score_codex":0.0005553452,"about_ca_system_score_gemma":0.00092902064,"threshold_uncertainty_score":0.013140261},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040844567,0.0042833243,0.8272612,0.0024369643,0.0009678826,0.00008242096,0.00060599635,0.0005866548,0.122931],"genre_scores_gemma":[0.613439,0.011096466,0.27802336,0.0015306429,0.002226328,0.00030474176,0.001557956,0.00071716396,0.091104485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807644,0.0004655652,0.00013882841,0.0002538409,0.00077464106,0.00029058655],"domain_scores_gemma":[0.9946812,0.002274687,0.0004459934,0.0012800051,0.0011279271,0.00019023698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00105501,0.0007395271,0.0005412432,0.0021882786,0.001484087,0.0031231765,0.00089066965,0.0012001656,0.008762171],"category_scores_gemma":[0.009166053,0.00037876572,0.0004926529,0.0033346226,0.0039408314,0.0064587635,0.00292892,0.0024307775,0.003381618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000025391144,0.000005898381,0.00014248188,0.000020844534,0.0000017259274,0.000036859572,0.00008800468,0.0072189094,0.00026933898,0.97108454,0.0024975901,0.018608408],"study_design_scores_gemma":[0.0000066200764,0.00001782127,0.00010839347,0.000051487266,0.0000036049137,0.00012999044,0.000084562445,0.028134199,0.00085689075,0.9454943,0.025093488,0.00001869421],"about_ca_topic_score_codex":0.0033311648,"about_ca_topic_score_gemma":0.0028491102,"teacher_disagreement_score":0.008762171,"about_ca_system_score_codex":0.0014482083,"about_ca_system_score_gemma":0.0014031209,"threshold_uncertainty_score":0.029312432},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13532335,0.0014225264,0.8315578,0.0007552153,0.0006965442,0.00029851843,0.00024531162,0.001726932,0.027973779],"genre_scores_gemma":[0.39596617,0.0009791126,0.58639014,0.00030721698,0.00029924075,0.0002526764,0.00041200165,0.000075605385,0.015317873],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983823,0.00002693919,0.000011952004,0.000042402557,0.00005395409,0.000026469736],"domain_scores_gemma":[0.999782,0.000027139577,0.00003840687,0.00005229475,0.00007434397,0.000025746796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019229185,0.0005263471,0.0005038792,0.00065252045,0.0006557444,0.0005409394,0.0007706566,0.0004654905,0.0027376385],"category_scores_gemma":[0.0005040524,0.00030621243,0.0005204934,0.00075163506,0.00040878088,0.0011560109,0.000608943,0.00070119445,0.0009576278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008985879,0.00019764843,0.001809009,0.0005978401,0.0001604113,0.0013563356,0.00036828945,0.013528917,0.2813693,0.1832736,0.010665721,0.5057743],"study_design_scores_gemma":[0.0005205871,0.0031227097,0.0048487675,0.00018537091,0.00054329494,0.010411853,0.0002294869,0.21844482,0.40777916,0.13034181,0.22328153,0.0002905952],"about_ca_topic_score_codex":0.000288514,"about_ca_topic_score_gemma":0.000647328,"teacher_disagreement_score":0.0027376385,"about_ca_system_score_codex":0.0003873873,"about_ca_system_score_gemma":0.00065372366,"threshold_uncertainty_score":0.009158313},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013810458,0.0003441613,0.98089534,0.00037110745,0.00008843085,0.00023838309,0.0011664787,0.0018567058,0.0012289122],"genre_scores_gemma":[0.17013898,0.0007955349,0.82312286,0.00032333162,0.00009664934,0.0005804028,0.0030370806,0.00019195609,0.0017132437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957425,0.0006368531,0.0006984761,0.00082248927,0.0019463763,0.00015336147],"domain_scores_gemma":[0.99240416,0.0029610677,0.0011199161,0.0018389957,0.0013906577,0.00028525208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025122268,0.00088760746,0.0010951192,0.0036882772,0.00067944266,0.0019870033,0.0023042941,0.001052163,0.0010555962],"category_scores_gemma":[0.011094927,0.00053240533,0.0012713664,0.004160598,0.00097243505,0.004216381,0.0012825491,0.0014718798,0.0005852936],"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.00067774806,0.00052128296,0.03866353,0.00087185146,0.00046015784,0.001150941,0.00102112,0.07573614,0.020271309,0.06859131,0.009518888,0.78251576],"study_design_scores_gemma":[0.00009145666,0.00057751697,0.008635543,0.00018170368,0.00031922717,0.00341061,0.00041760138,0.8008475,0.028127138,0.11367471,0.043514915,0.00020203966],"about_ca_topic_score_codex":0.0027080858,"about_ca_topic_score_gemma":0.003486158,"teacher_disagreement_score":0.0036882772,"about_ca_system_score_codex":0.00049755647,"about_ca_system_score_gemma":0.001377766,"threshold_uncertainty_score":0.013286114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39376888,0.00080579217,0.6012113,0.00022308315,0.00006332977,0.00009997474,0.00002599177,0.00096665096,0.0028349522],"genre_scores_gemma":[0.90590864,0.0002130836,0.09175509,0.00006341944,0.00003069438,0.00004162196,0.000024768238,0.00003448266,0.0019282312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988973,0.00024649064,0.000085738124,0.00021295036,0.00045793378,0.00009950806],"domain_scores_gemma":[0.99659437,0.0018567311,0.00068446103,0.00042739243,0.0003921573,0.00004491916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012051762,0.0005059456,0.0004043348,0.0007401966,0.00047480513,0.0009466188,0.00084921444,0.00057098037,0.0009157106],"category_scores_gemma":[0.0045440663,0.00024582562,0.0003172498,0.00055328413,0.0007346744,0.0017147526,0.00082631316,0.00047629746,0.00019595401],"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.0026741421,0.00043891635,0.010128568,0.00053614745,0.00015356086,0.0019666243,0.0010509103,0.18635733,0.33076352,0.08134434,0.0011119834,0.38347393],"study_design_scores_gemma":[0.00013530087,0.00095152453,0.001148605,0.00007720218,0.00009828537,0.0016373493,0.000077788325,0.58184093,0.39071602,0.019058416,0.0041975942,0.000060998787],"about_ca_topic_score_codex":0.00044864716,"about_ca_topic_score_gemma":0.0006137833,"teacher_disagreement_score":0.0012051762,"about_ca_system_score_codex":0.00049982703,"about_ca_system_score_gemma":0.00060591573,"threshold_uncertainty_score":0.006373644},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076749444,0.00030467845,0.9125775,0.00015447644,0.00007704587,0.00009933633,0.000033028926,0.0020183,0.007986135],"genre_scores_gemma":[0.44473267,0.0003418299,0.5498755,0.00006540302,0.00009458396,0.000090580565,0.00011132731,0.00016261937,0.004525512],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994704,0.00006420677,0.000037125814,0.00006474034,0.00030258248,0.000060842292],"domain_scores_gemma":[0.99899393,0.00016567444,0.00011450069,0.00050951255,0.00018290912,0.00003352566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005455209,0.00044157397,0.00039653908,0.00074226625,0.0004328235,0.0007736621,0.00091754517,0.00030866984,0.0027363044],"category_scores_gemma":[0.0015978103,0.00029929858,0.00039132428,0.0007904152,0.0007512132,0.0018073606,0.00097383093,0.0009170334,0.0009227449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044487166,0.00019215238,0.0022133645,0.00024519613,0.00005570753,0.00042112274,0.00033373904,0.036597714,0.18651903,0.23538835,0.0042819954,0.5333067],"study_design_scores_gemma":[0.00028349448,0.001360462,0.0016564024,0.000104508435,0.00012933087,0.0017711698,0.00012348512,0.45745277,0.3585407,0.11612949,0.062353443,0.000094770396],"about_ca_topic_score_codex":0.0003095082,"about_ca_topic_score_gemma":0.00053903245,"teacher_disagreement_score":0.0027363044,"about_ca_system_score_codex":0.00033388237,"about_ca_system_score_gemma":0.000746663,"threshold_uncertainty_score":0.009153843},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010962258,0.00012598914,0.9829927,0.00009238764,0.000013610138,0.000060613915,0.00007286319,0.00025176775,0.005427855],"genre_scores_gemma":[0.34227186,0.0005639696,0.64608383,0.00012599619,0.0000501281,0.0003569204,0.00049250113,0.00014801293,0.009906683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995516,0.00011986726,0.00002038339,0.00008628612,0.00016595231,0.000055826233],"domain_scores_gemma":[0.9997522,0.000087547895,0.000027852355,0.00009591918,0.000027629518,0.000008776946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048200472,0.00072463753,0.00045457538,0.00050654996,0.00042048804,0.0007080876,0.0011135034,0.0005930982,0.004139376],"category_scores_gemma":[0.00080210617,0.0005262636,0.001600318,0.0005369971,0.00086861267,0.0012821081,0.0008990968,0.0012121848,0.0006529708],"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.000077952944,0.00006951061,0.00024661425,0.00020164844,0.000040848532,0.00019183748,0.00016411985,0.54665035,0.012589097,0.3767861,0.0020163835,0.06096548],"study_design_scores_gemma":[0.000037554677,0.00009783489,0.00019874099,0.00002935783,0.000042243515,0.00017184384,0.000047036876,0.81256485,0.0069100973,0.16513297,0.01474694,0.000020498861],"about_ca_topic_score_codex":0.0014002376,"about_ca_topic_score_gemma":0.0025188627,"teacher_disagreement_score":0.004139376,"about_ca_system_score_codex":0.00073943305,"about_ca_system_score_gemma":0.0005713824,"threshold_uncertainty_score":0.01384753},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14233884,0.0010318819,0.8215869,0.00063162425,0.00013422547,0.000184195,0.00010848907,0.0007511311,0.03323264],"genre_scores_gemma":[0.5528625,0.0011140029,0.4267781,0.00040209727,0.0003377162,0.00033875005,0.0002712379,0.0001887405,0.017706862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992799,0.00015571825,0.0000467145,0.0001606469,0.0002360744,0.0001209606],"domain_scores_gemma":[0.9986563,0.00051757024,0.00023223281,0.0003053927,0.00022571371,0.00006271724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006065819,0.00038175567,0.00035000805,0.0012590477,0.0006345423,0.0015472508,0.00094030745,0.0008026742,0.0050492864],"category_scores_gemma":[0.003532815,0.00033512418,0.00033286883,0.0013597731,0.0010719611,0.002263792,0.0013018437,0.001227754,0.0013211042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00037099735,0.000110161884,0.0010069559,0.000088483044,0.000025736728,0.00015717976,0.00019567195,0.014228001,0.016451297,0.7515578,0.0021835335,0.21362416],"study_design_scores_gemma":[0.00019848818,0.0005289188,0.0013191238,0.00011817485,0.00004648477,0.0016010276,0.000106867825,0.17921601,0.060675815,0.7259466,0.0301315,0.000110913716],"about_ca_topic_score_codex":0.0005397908,"about_ca_topic_score_gemma":0.0005886638,"teacher_disagreement_score":0.0050492864,"about_ca_system_score_codex":0.00079627836,"about_ca_system_score_gemma":0.0012137416,"threshold_uncertainty_score":0.01689154},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061110094,0.0005392669,0.9223202,0.00015321368,0.00014387644,0.0000969763,0.00004068157,0.0032425905,0.012353087],"genre_scores_gemma":[0.32179317,0.0005172465,0.66904545,0.000078319485,0.00006615358,0.00010210405,0.00019314137,0.0001423166,0.008062047],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99961793,0.00009317177,0.00002229196,0.000055427598,0.00016862752,0.000042560478],"domain_scores_gemma":[0.9994344,0.0001689558,0.00004256488,0.00012922446,0.000198564,0.000026222711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042750305,0.0006004388,0.00046123177,0.0005446505,0.00037970603,0.000841622,0.0007720539,0.0004157182,0.0033093889],"category_scores_gemma":[0.0015116503,0.0001932819,0.00031580793,0.0008104182,0.00044057413,0.0015383572,0.0007218132,0.00073089334,0.0014129202],"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.00086703914,0.00016080576,0.001310891,0.00028052006,0.000047500285,0.00029458912,0.0002182385,0.038306437,0.09581166,0.13835002,0.008262698,0.71608967],"study_design_scores_gemma":[0.0002033173,0.0009991758,0.00092338014,0.00008033011,0.000061591345,0.0009804922,0.00010938916,0.6637055,0.17710331,0.10136151,0.05440027,0.0000716649],"about_ca_topic_score_codex":0.0004370585,"about_ca_topic_score_gemma":0.00071894866,"teacher_disagreement_score":0.0033093889,"about_ca_system_score_codex":0.00039551413,"about_ca_system_score_gemma":0.00073067157,"threshold_uncertainty_score":0.011071026},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52218384,0.0017545864,0.46192372,0.00036793386,0.0001997866,0.00022451766,0.00017536544,0.004572967,0.008597257],"genre_scores_gemma":[0.97532266,0.00016082494,0.022395726,0.00015510773,0.000025201607,0.00002697829,0.00006185813,0.000047420228,0.0018042186],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999579,0.00006218334,0.000034216384,0.00009317624,0.00015338698,0.00007808342],"domain_scores_gemma":[0.998845,0.00033452435,0.00019003867,0.00042203238,0.00017523803,0.00003308117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024011507,0.0004740287,0.00038713033,0.0005202425,0.0003511752,0.00052951707,0.00080045493,0.000587211,0.003378237],"category_scores_gemma":[0.0011984006,0.00018987124,0.00026821395,0.0003127774,0.0004246619,0.0011393684,0.00042185915,0.0004448523,0.0007585446],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0012823419,0.00016144264,0.0032158878,0.0004973571,0.000115956536,0.0007239482,0.0003033827,0.013466902,0.6883499,0.012100632,0.0026180749,0.27716416],"study_design_scores_gemma":[0.000106353546,0.001726999,0.0029226148,0.0000727521,0.0001855895,0.0020099676,0.00006380509,0.092291154,0.88139266,0.0041090767,0.015063204,0.0000559602],"about_ca_topic_score_codex":0.00022569699,"about_ca_topic_score_gemma":0.00021414077,"teacher_disagreement_score":0.003378237,"about_ca_system_score_codex":0.00047229786,"about_ca_system_score_gemma":0.00025877013,"threshold_uncertainty_score":0.011301339},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033714296,0.004662329,0.012812066,0.757304,0.1587971,0.00011768298,0.00086534466,0.0011937633,0.060876273],"genre_scores_gemma":[0.069172814,0.00782351,0.011459134,0.652553,0.10398422,0.00034030236,0.00063165044,0.0010192596,0.15301609],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99496514,0.0011633573,0.00051794265,0.00063889957,0.002213835,0.0005007368],"domain_scores_gemma":[0.9853881,0.0070895823,0.0008647725,0.0009795381,0.005255187,0.00042284257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050228224,0.001253286,0.00072981237,0.0011096115,0.00400885,0.0021200336,0.00393934,0.007738558,0.035088636],"category_scores_gemma":[0.02275746,0.00063755875,0.0013978767,0.001174881,0.004457133,0.0064638047,0.002409219,0.0124251945,0.013750668],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00011195892,0.000016425072,0.00016475518,0.00021838052,0.000011919994,0.00048294512,0.0005039204,0.00026705198,0.0006942938,0.06512462,0.92362124,0.0087825125],"study_design_scores_gemma":[0.000019225383,0.000036682824,0.00039952534,0.00018546237,0.000012461007,0.00032089278,0.00025545305,0.0004180125,0.0013824374,0.026083473,0.97083515,0.000051197232],"about_ca_topic_score_codex":0.008650783,"about_ca_topic_score_gemma":0.005660786,"teacher_disagreement_score":0.035088636,"about_ca_system_score_codex":0.0039986656,"about_ca_system_score_gemma":0.0020093475,"threshold_uncertainty_score":0.11738318},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04044125,0.0003933999,0.9206373,0.00017567811,0.00015359449,0.0003516336,0.000986295,0.026077723,0.010783086],"genre_scores_gemma":[0.3325514,0.0005743363,0.65798306,0.00017521062,0.000040392362,0.00088201853,0.00179403,0.0016281289,0.0043713334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971753,0.00008060972,0.000020803485,0.000034182372,0.000112930844,0.000033879252],"domain_scores_gemma":[0.99963534,0.00016735407,0.0000310889,0.000058718233,0.00007730249,0.000030177514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005156693,0.0008481543,0.00039227895,0.00056701375,0.00038718976,0.0006035411,0.0018268854,0.00053284067,0.0081752725],"category_scores_gemma":[0.0013818147,0.0004432996,0.00056042575,0.00033834856,0.00036965165,0.000511955,0.00058091886,0.0008680608,0.0009452254],"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.0002742304,0.000093591116,0.0023811571,0.0003457501,0.0001292712,0.0003093912,0.00014234513,0.8799539,0.013313726,0.016140936,0.011809963,0.07510582],"study_design_scores_gemma":[0.000059519658,0.000059077935,0.00018150141,0.000018212728,0.000011522566,0.000041394123,0.000009783833,0.9857604,0.0050605317,0.0017843276,0.007001195,0.000012525724],"about_ca_topic_score_codex":0.0037503329,"about_ca_topic_score_gemma":0.003573323,"teacher_disagreement_score":0.0081752725,"about_ca_system_score_codex":0.0005835963,"about_ca_system_score_gemma":0.0007984012,"threshold_uncertainty_score":0.027349055},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29022112,0.0015166592,0.6609023,0.0003674858,0.00015866169,0.00018839276,0.00011137562,0.00075182033,0.045782004],"genre_scores_gemma":[0.73612314,0.0012635137,0.2437452,0.0001536546,0.00012032112,0.00009373853,0.0002378186,0.00007773703,0.018184945],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998436,0.000023660332,0.000013945612,0.00003671272,0.00005414892,0.000027937105],"domain_scores_gemma":[0.9997303,0.00006755377,0.00006605626,0.00007275043,0.000046001598,0.000017319619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022670829,0.0004858488,0.00027300467,0.00052064925,0.00037642056,0.0006515628,0.0003517946,0.00035068893,0.004322414],"category_scores_gemma":[0.0009801049,0.00017162538,0.00041804338,0.00053476624,0.00049746095,0.0013480766,0.0004468978,0.00044569914,0.0012294515],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060679315,0.00020571485,0.0025499398,0.00042109124,0.00006688268,0.00068516016,0.0003578501,0.030762207,0.14718947,0.30438006,0.0024098188,0.51036507],"study_design_scores_gemma":[0.0001887988,0.0021575764,0.0042923614,0.00019398087,0.00015668295,0.006439457,0.00038665402,0.23993465,0.41693023,0.23784854,0.09132409,0.00014700553],"about_ca_topic_score_codex":0.0002210226,"about_ca_topic_score_gemma":0.0006771546,"teacher_disagreement_score":0.004322414,"about_ca_system_score_codex":0.00028378514,"about_ca_system_score_gemma":0.00040156217,"threshold_uncertainty_score":0.014459908},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05943465,0.000040369767,0.936467,0.000081001715,0.000022362592,0.000095935495,0.00008304125,0.0018242768,0.001951393],"genre_scores_gemma":[0.694782,0.00009358652,0.3015692,0.00005536749,0.000015667658,0.00030068695,0.00029098714,0.00040253496,0.0024899314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900824,0.00023826606,0.00007370144,0.000109975605,0.00048801818,0.000081743456],"domain_scores_gemma":[0.99729353,0.0012794379,0.00024176898,0.0007315358,0.00041119193,0.000042452724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010983276,0.00045443265,0.0003516764,0.00056510814,0.0002724103,0.0007109647,0.0011272271,0.0006746362,0.0014316746],"category_scores_gemma":[0.004813554,0.0003430149,0.00073090335,0.00027097808,0.00093976705,0.000786584,0.0010302651,0.00079221366,0.0002817696],"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.00015885601,0.000087185326,0.0012397945,0.00018718974,0.000043931526,0.0004124422,0.00035430392,0.8114409,0.028342452,0.11869734,0.00076517573,0.038270473],"study_design_scores_gemma":[0.000025551824,0.000054853695,0.00009313316,0.000011953251,0.000014472788,0.00003994712,0.000020170235,0.9638627,0.015156254,0.019425986,0.0012866172,0.000008271985],"about_ca_topic_score_codex":0.001148029,"about_ca_topic_score_gemma":0.001309272,"teacher_disagreement_score":0.0014316746,"about_ca_system_score_codex":0.00060721184,"about_ca_system_score_gemma":0.0008715708,"threshold_uncertainty_score":0.005808592},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.992188,0.00040792336,0.0054447185,0.00007104207,0.000029603985,0.000040643106,0.00010905305,0.0005145275,0.0011946113],"genre_scores_gemma":[0.99606043,0.00017575195,0.002905102,0.00003198011,0.000007408599,0.000015936614,0.00016355659,0.0000792721,0.00056056364],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99709773,0.00040770072,0.00023845378,0.0004931429,0.0014224766,0.00034051272],"domain_scores_gemma":[0.97866356,0.008328371,0.004460709,0.0052616945,0.0028409236,0.00044475493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011131591,0.00040596156,0.0005245671,0.0014900934,0.0006124052,0.000863178,0.0007689488,0.0005046014,0.0020319412],"category_scores_gemma":[0.021130888,0.00033165372,0.00039136648,0.0018824572,0.0008926428,0.0010359284,0.0011239396,0.00066757214,0.00032448812],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.004636239,0.00037987312,0.24489805,0.0017974327,0.00048262734,0.003818104,0.004194141,0.23594327,0.2531622,0.0071779503,0.0037818484,0.2397283],"study_design_scores_gemma":[0.00012269325,0.0046786056,0.31231892,0.00018374622,0.00044956242,0.005794036,0.0038668262,0.30752364,0.33541116,0.014633622,0.014789706,0.00022742749],"about_ca_topic_score_codex":0.0025636666,"about_ca_topic_score_gemma":0.0017503143,"teacher_disagreement_score":0.0025636666,"about_ca_system_score_codex":0.00068873016,"about_ca_system_score_gemma":0.0005510408,"threshold_uncertainty_score":0.006797552},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013554631,0.0002444711,0.9817151,0.00025603006,0.000038518712,0.00006538994,0.00014218956,0.00080608204,0.003177653],"genre_scores_gemma":[0.20517498,0.00021551015,0.7904125,0.0001288346,0.000058805042,0.00024242498,0.0004941715,0.00029204553,0.00298072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863404,0.00043534068,0.00014190741,0.00015208915,0.0005374993,0.00009905213],"domain_scores_gemma":[0.99466527,0.0035321645,0.00046026634,0.0005417713,0.0007018485,0.000098709395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001851937,0.00067737984,0.0009286906,0.0023515297,0.00053273403,0.0020357633,0.0017060239,0.0007895868,0.008126738],"category_scores_gemma":[0.013560861,0.00053760654,0.0007686507,0.0021604975,0.0010608895,0.0040116115,0.0019302379,0.0011881872,0.001463981],"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.00044084512,0.000101565674,0.0016930503,0.000513741,0.000048126123,0.00012229143,0.00025131393,0.29216757,0.008928647,0.22377856,0.0060883407,0.46586585],"study_design_scores_gemma":[0.000038276117,0.00005491173,0.00018792559,0.000051116975,0.00000946259,0.00008483177,0.000062768544,0.88519883,0.0058396715,0.10462127,0.0038271667,0.00002377067],"about_ca_topic_score_codex":0.0014656235,"about_ca_topic_score_gemma":0.002686245,"teacher_disagreement_score":0.008126738,"about_ca_system_score_codex":0.0009848276,"about_ca_system_score_gemma":0.0015849228,"threshold_uncertainty_score":0.027186632},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00843509,0.0072826934,0.970426,0.00030672585,0.00038709273,0.000059932052,0.000049891536,0.00044856546,0.012604047],"genre_scores_gemma":[0.24976696,0.008035736,0.7342513,0.0003262682,0.0007278493,0.00012528495,0.00012796595,0.00014781475,0.0064907162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983437,0.00036349508,0.00017574558,0.00028491142,0.0007579726,0.000074059804],"domain_scores_gemma":[0.9981839,0.00089438603,0.00021160227,0.00028717695,0.00039342986,0.000029577024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017296713,0.00074914657,0.0008013407,0.0016612579,0.00043667018,0.0015204874,0.0009662718,0.00076998747,0.0023223283],"category_scores_gemma":[0.0056162886,0.0003472377,0.00067780825,0.0020611323,0.0013732584,0.002282914,0.00083605084,0.0011514605,0.00093797484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00036047123,0.0000325205,0.00069213536,0.00049562193,0.0000699328,0.0005402537,0.00022717752,0.045896985,0.025761355,0.48348093,0.0031836058,0.43925893],"study_design_scores_gemma":[0.00015103226,0.00076857716,0.0013425025,0.00023469626,0.00013532132,0.0042759064,0.000090051835,0.4936421,0.09838284,0.28757077,0.11318831,0.00021789085],"about_ca_topic_score_codex":0.00050332985,"about_ca_topic_score_gemma":0.0004396409,"teacher_disagreement_score":0.0023223283,"about_ca_system_score_codex":0.00078135455,"about_ca_system_score_gemma":0.00073880795,"threshold_uncertainty_score":0.009147465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07428198,0.00012887854,0.9216291,0.00007822852,0.00004012128,0.00010779322,0.00004762975,0.00063272985,0.0030535005],"genre_scores_gemma":[0.64371145,0.0002170343,0.3531084,0.000028772713,0.000023274535,0.00009769367,0.00020866116,0.00007391513,0.0025308183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99898773,0.00023972441,0.00006980645,0.00015416738,0.00046701622,0.00008154719],"domain_scores_gemma":[0.99928695,0.00018194085,0.00008339207,0.00012447157,0.00025023933,0.00007304234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007837382,0.00046381343,0.0005537566,0.0007800876,0.0008486155,0.0006742374,0.0008335313,0.0005020213,0.0008822612],"category_scores_gemma":[0.0023799865,0.00021232746,0.0004615726,0.00074665167,0.00043504208,0.0010131038,0.0010732905,0.00047062922,0.00025869906],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003416909,0.00016507586,0.0017366626,0.00020145244,0.000107201384,0.0008033329,0.00047353562,0.60422546,0.14884944,0.053840104,0.0015105518,0.18774551],"study_design_scores_gemma":[0.000009139875,0.000038008868,0.00019763767,0.000005034053,0.00002078811,0.0001501131,0.00006196129,0.9684133,0.019030785,0.009252316,0.0028093713,0.000011638153],"about_ca_topic_score_codex":0.0023887418,"about_ca_topic_score_gemma":0.0032457951,"teacher_disagreement_score":0.0023887418,"about_ca_system_score_codex":0.000781575,"about_ca_system_score_gemma":0.00086473796,"threshold_uncertainty_score":0.005670786},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066415675,0.0008232784,0.92676,0.00017780345,0.000086312364,0.00009563662,0.000054852495,0.0013608289,0.004225682],"genre_scores_gemma":[0.5984298,0.00055299455,0.39868048,0.00020883164,0.000053594154,0.00015794393,0.0001667697,0.00017091921,0.0015786209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995746,0.00010046012,0.000044299537,0.000067742396,0.00015249831,0.000060303297],"domain_scores_gemma":[0.9995721,0.000070846676,0.00005717789,0.000090905014,0.00017865066,0.000030298621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063166866,0.0005471386,0.000531123,0.00059182144,0.00025722486,0.0007967876,0.0010712317,0.00034742543,0.00094555103],"category_scores_gemma":[0.0011474054,0.0002696123,0.00033102607,0.00045242647,0.00022774562,0.0010071952,0.00064547977,0.00044460708,0.00032004277],"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.0001785578,0.00012730187,0.0020439974,0.000318919,0.000153318,0.00014713546,0.00010788391,0.5288292,0.1613746,0.015039331,0.0032181859,0.28846157],"study_design_scores_gemma":[0.000035457422,0.00025504598,0.0006306996,0.000018128992,0.00006791319,0.00024240877,0.000041105646,0.96168447,0.026704876,0.0048943055,0.0054005054,0.00002523523],"about_ca_topic_score_codex":0.00049446255,"about_ca_topic_score_gemma":0.0011726705,"teacher_disagreement_score":0.0010712317,"about_ca_system_score_codex":0.00045911115,"about_ca_system_score_gemma":0.0008166155,"threshold_uncertainty_score":0.0033406615},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.642643,0.0003499489,0.3539119,0.000115588264,0.000054953165,0.000049448154,0.0000270844,0.0007562502,0.0020918807],"genre_scores_gemma":[0.9327222,0.000099190256,0.0660383,0.000018550958,0.000017012977,0.000015282654,0.000022681446,0.000023512033,0.0010431899],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994368,0.00009987525,0.00004186409,0.000079831414,0.00027234486,0.00006933393],"domain_scores_gemma":[0.99867034,0.000519799,0.0002768238,0.0002352734,0.0002612478,0.000036637135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065378565,0.00041340297,0.0003238447,0.0005334706,0.00030774015,0.0005128642,0.0006248698,0.0002642575,0.0008448705],"category_scores_gemma":[0.0023475953,0.00020803281,0.00025503294,0.00046171653,0.00051198085,0.0014458231,0.00046975186,0.00028286723,0.00012018666],"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.0018909359,0.00028899964,0.010075107,0.00030563594,0.00009040943,0.00108676,0.00047680896,0.25684714,0.28418112,0.046671428,0.00087899546,0.39720657],"study_design_scores_gemma":[0.000060099803,0.000649013,0.001315147,0.000022815793,0.000046366695,0.00042688492,0.000093349845,0.8110377,0.1756129,0.008925482,0.0017752928,0.000034887846],"about_ca_topic_score_codex":0.0007614825,"about_ca_topic_score_gemma":0.0014936912,"teacher_disagreement_score":0.0008448705,"about_ca_system_score_codex":0.00040554575,"about_ca_system_score_gemma":0.0006969008,"threshold_uncertainty_score":0.0034576058},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105437905,0.0005521302,0.88144433,0.00022117152,0.000074656746,0.0001435246,0.000108585045,0.00081356656,0.011204158],"genre_scores_gemma":[0.48254412,0.0006268579,0.507748,0.00011289379,0.0000742545,0.00015842453,0.0002796905,0.00007874623,0.008377079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997961,0.000047921163,0.000016027181,0.000033988454,0.00007810589,0.000027985563],"domain_scores_gemma":[0.99977905,0.000055989578,0.000044380657,0.00006896661,0.00004390119,0.000007830081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020945969,0.00045360625,0.00031097615,0.0003429454,0.00038747778,0.00064784323,0.0007305058,0.00026880967,0.0038926438],"category_scores_gemma":[0.00056542095,0.00017241268,0.00042420227,0.0006135932,0.0003538246,0.0012194355,0.00032191313,0.0006222934,0.00094975624],"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.0004351528,0.00019868014,0.0010523022,0.000594519,0.00010478104,0.0005020892,0.0002727285,0.17877112,0.1739723,0.34497482,0.0057032746,0.29341823],"study_design_scores_gemma":[0.00012677052,0.0007078957,0.0009346969,0.00006136007,0.0001112488,0.0008404683,0.000095458076,0.73854965,0.10860853,0.12329798,0.026611945,0.000053979766],"about_ca_topic_score_codex":0.00051975844,"about_ca_topic_score_gemma":0.0024212454,"teacher_disagreement_score":0.0038926438,"about_ca_system_score_codex":0.0005895006,"about_ca_system_score_gemma":0.0006638862,"threshold_uncertainty_score":0.013022125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081162676,0.0004618178,0.91590196,0.0001728662,0.000062776046,0.00013621684,0.00002611231,0.00057659775,0.0014989084],"genre_scores_gemma":[0.82069033,0.00020989418,0.17756687,0.00006447325,0.000039909224,0.00008019144,0.000038161703,0.000026680571,0.0012835201],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998429,0.0003418831,0.0001304358,0.00022431168,0.00073671184,0.00013755276],"domain_scores_gemma":[0.9960068,0.001275044,0.0006037541,0.0010498354,0.0009845634,0.00008012088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015655474,0.0005328671,0.00045612213,0.00089715596,0.00058196404,0.00092513324,0.0011884737,0.00060111505,0.0010776904],"category_scores_gemma":[0.0047523007,0.00022846377,0.0005169267,0.00048649323,0.000770077,0.0019994332,0.0010619522,0.0010118339,0.00022924447],"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.001915358,0.00031274965,0.0047668917,0.00050944794,0.00012323949,0.00044834876,0.0007121384,0.1640343,0.20010224,0.18440872,0.0019679994,0.4406986],"study_design_scores_gemma":[0.00014429667,0.00072746736,0.00079052564,0.000061462335,0.00012223571,0.0005814685,0.00005761531,0.78317904,0.17497915,0.033474535,0.005816934,0.0000652646],"about_ca_topic_score_codex":0.00055697525,"about_ca_topic_score_gemma":0.0007617652,"teacher_disagreement_score":0.0015655474,"about_ca_system_score_codex":0.0009826467,"about_ca_system_score_gemma":0.0010933366,"threshold_uncertainty_score":0.008279502},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010098481,0.00029010934,0.9795101,0.00013786889,0.00011203511,0.00011086205,0.000055246917,0.000651601,0.009033665],"genre_scores_gemma":[0.12359435,0.0005314335,0.86436784,0.00018645234,0.00015658185,0.00028611821,0.00018454954,0.00011516348,0.010577495],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995473,0.000099107834,0.000045102122,0.00008517677,0.00017489077,0.000048306458],"domain_scores_gemma":[0.9995627,0.00010427562,0.000053667172,0.00012634134,0.00012979092,0.000023264682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045649317,0.00093513407,0.00047617237,0.0009960172,0.00071571517,0.0012211947,0.0012338925,0.00038673237,0.008535557],"category_scores_gemma":[0.0010953278,0.00036245858,0.00056017336,0.001286363,0.00055981387,0.0020363932,0.0010188755,0.0011618254,0.0024525425],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040632472,0.00018286251,0.00031055245,0.00033484725,0.000060680908,0.00015482161,0.0002127113,0.02704395,0.081868425,0.40213823,0.008117145,0.47916934],"study_design_scores_gemma":[0.00028810132,0.0013432499,0.00039398673,0.00010317231,0.0001398705,0.0011041578,0.00010399201,0.49225155,0.16554962,0.22281662,0.115778,0.0001277278],"about_ca_topic_score_codex":0.0005356963,"about_ca_topic_score_gemma":0.0013242698,"teacher_disagreement_score":0.008535557,"about_ca_system_score_codex":0.00081098214,"about_ca_system_score_gemma":0.0010853068,"threshold_uncertainty_score":0.02855432},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48715594,0.00052038225,0.48588517,0.00037189157,0.00016981857,0.00022425865,0.0010388447,0.0039880374,0.020645699],"genre_scores_gemma":[0.81776184,0.00027023183,0.1777387,0.000059677543,0.000021431813,0.00035612375,0.00076765503,0.00019530691,0.0028290022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996934,0.0000713615,0.00002037157,0.000056137527,0.00009469275,0.000063968466],"domain_scores_gemma":[0.99928826,0.0003131482,0.000054437605,0.00013353385,0.00013950853,0.0000711197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000434418,0.0005337844,0.00082479336,0.00042247545,0.00068333594,0.000744002,0.0015261852,0.00076370663,0.0028089855],"category_scores_gemma":[0.001602707,0.00038625777,0.00067362405,0.00092118164,0.0005086525,0.00088995235,0.0006920129,0.0007244839,0.00029813292],"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.00015654351,0.00008966506,0.0015516629,0.000083195,0.000044932327,0.00008950649,0.000073475014,0.9749347,0.0051748343,0.0055596204,0.00093808665,0.01130387],"study_design_scores_gemma":[0.000017716988,0.000017436905,0.00018605453,0.0000018713502,0.0000038465637,0.000010689985,0.0000087876915,0.99651766,0.0015355325,0.0011293993,0.0005667904,0.00000423963],"about_ca_topic_score_codex":0.009341379,"about_ca_topic_score_gemma":0.0070016864,"teacher_disagreement_score":0.009341379,"about_ca_system_score_codex":0.0008064762,"about_ca_system_score_gemma":0.0012533112,"threshold_uncertainty_score":0.018574059},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071884766,0.01399118,0.9317604,0.0014935998,0.00047937955,0.00006565487,0.00018697267,0.00044750536,0.04438691],"genre_scores_gemma":[0.5572103,0.02460973,0.37588844,0.0013845339,0.0013566078,0.0004642845,0.0004842463,0.00021514423,0.038386725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994906,0.00013388187,0.000033232274,0.00008078974,0.00022881269,0.00003263995],"domain_scores_gemma":[0.9996082,0.000190355,0.0000460209,0.00006177065,0.000077602126,0.0000160904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049238105,0.00052366336,0.00053174427,0.00049888145,0.00039043967,0.0015230139,0.00070108654,0.0011187429,0.0034247376],"category_scores_gemma":[0.0018835624,0.00030584654,0.0004980711,0.0011475415,0.0018848816,0.0017770216,0.00085056934,0.0014274822,0.0012563923],"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.000027559876,0.00001879139,0.00049234874,0.00025376966,0.000031470732,0.00005736253,0.00005702077,0.08782567,0.0027468055,0.84424573,0.0032312048,0.06101225],"study_design_scores_gemma":[0.000010493803,0.000052469215,0.00035409193,0.00011600364,0.000017396094,0.00017951804,0.000028712397,0.39736733,0.0023910278,0.54494673,0.0545103,0.000025986212],"about_ca_topic_score_codex":0.0012696087,"about_ca_topic_score_gemma":0.0010071929,"teacher_disagreement_score":0.0034247376,"about_ca_system_score_codex":0.0009537026,"about_ca_system_score_gemma":0.0006114379,"threshold_uncertainty_score":0.011456847},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025410153,0.00050795544,0.963569,0.0003917578,0.00009394094,0.000060964703,0.000116450254,0.0004838906,0.009365875],"genre_scores_gemma":[0.59708023,0.0007009833,0.39165634,0.00015692262,0.0001218163,0.000400493,0.00036263006,0.00013067012,0.009389971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945503,0.00017068199,0.000036885474,0.00014561077,0.0001151138,0.00007669652],"domain_scores_gemma":[0.9976739,0.0016851978,0.00012188843,0.00019634694,0.00021783654,0.00010476671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006357527,0.00082685036,0.00093289244,0.0006240812,0.00064758,0.0014156476,0.0016258297,0.0015832591,0.0051582283],"category_scores_gemma":[0.0032827926,0.00043240326,0.0008410921,0.00073650153,0.0014271872,0.001111341,0.0012926069,0.0017535541,0.000604961],"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.00009576975,0.00008697104,0.00033840988,0.00017861577,0.000040997358,0.00011379405,0.00018167718,0.8169832,0.001683957,0.12753145,0.0019795366,0.050785623],"study_design_scores_gemma":[0.000020096368,0.000021357531,0.0000332042,0.0000074017034,0.000005552043,0.000015299669,0.00001763766,0.9511563,0.0004162782,0.04734706,0.0009529743,0.0000067677443],"about_ca_topic_score_codex":0.0027433815,"about_ca_topic_score_gemma":0.0034284617,"teacher_disagreement_score":0.0051582283,"about_ca_system_score_codex":0.0010818647,"about_ca_system_score_gemma":0.0014531673,"threshold_uncertainty_score":0.017255962},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4881913,0.0015906184,0.47298297,0.0009909773,0.000047233752,0.0001540035,0.00033564446,0.0006459658,0.035061166],"genre_scores_gemma":[0.7972512,0.00069317553,0.19845548,0.00011228769,0.000019447634,0.0001263742,0.0002092619,0.00013424525,0.0029984792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938655,0.00014664566,0.00003809651,0.00010007798,0.00024346854,0.00008509659],"domain_scores_gemma":[0.99789304,0.0015707811,0.00019837236,0.00016911389,0.00013558069,0.00003301905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007184333,0.00032050264,0.0004517372,0.0005611685,0.00047303023,0.00076429016,0.0005192791,0.00058486057,0.0034613158],"category_scores_gemma":[0.0046590446,0.00029167996,0.0003289403,0.0006463816,0.0009827263,0.001602185,0.0003045869,0.0006197583,0.00024984207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018948318,0.000109217326,0.0011891897,0.000468109,0.000029981826,0.00014654099,0.0001560544,0.53138363,0.046832513,0.30943638,0.0011881246,0.10887071],"study_design_scores_gemma":[0.000071565344,0.00021483524,0.0005471844,0.00005436207,0.000025353624,0.0001594388,0.000108290806,0.80754375,0.073381156,0.11120918,0.0066580786,0.000026799282],"about_ca_topic_score_codex":0.0009183659,"about_ca_topic_score_gemma":0.0012041625,"teacher_disagreement_score":0.0034613158,"about_ca_system_score_codex":0.0015419687,"about_ca_system_score_gemma":0.0011991508,"threshold_uncertainty_score":0.0115792155},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012467427,0.00021250139,0.9838658,0.0003054789,0.00003753266,0.00011509665,0.00031193913,0.00082652736,0.0018576916],"genre_scores_gemma":[0.30393094,0.0005576316,0.6905686,0.0002009049,0.000052988184,0.00050715735,0.0011495698,0.0003155687,0.0027166326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867636,0.00046594944,0.00011890399,0.0001491248,0.0004967661,0.00009285863],"domain_scores_gemma":[0.99645436,0.0021656926,0.00040985583,0.0005871216,0.0003375999,0.000045455792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013623779,0.00071656244,0.0004354452,0.0008667289,0.00041158433,0.0010167239,0.0008713453,0.00075702596,0.0045724357],"category_scores_gemma":[0.0078100627,0.00030860363,0.00078257284,0.0010807655,0.0009324445,0.002028114,0.00069511886,0.0011884561,0.00063071545],"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.0004766442,0.00014546077,0.00068638433,0.00046114397,0.00003496933,0.0003969916,0.00033871757,0.2916494,0.022555334,0.41074008,0.0048957593,0.26761907],"study_design_scores_gemma":[0.00011336849,0.00020472232,0.0002044209,0.00013858547,0.00003971881,0.00027665452,0.000072253875,0.6721976,0.024686338,0.28789032,0.014136865,0.000039156424],"about_ca_topic_score_codex":0.0016406806,"about_ca_topic_score_gemma":0.002016601,"teacher_disagreement_score":0.0045724357,"about_ca_system_score_codex":0.0014431628,"about_ca_system_score_gemma":0.0010794747,"threshold_uncertainty_score":0.01529628},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28782773,0.001356049,0.6954608,0.00055577856,0.00013565947,0.00052717194,0.0005282341,0.0037151594,0.009893345],"genre_scores_gemma":[0.6097521,0.00040354277,0.38420922,0.00015029933,0.000041666703,0.00030187247,0.0008898994,0.00077924493,0.0034721394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746895,0.0006963806,0.00026979318,0.00062080333,0.0006153698,0.00032870306],"domain_scores_gemma":[0.9915406,0.004781183,0.0012070613,0.00075175747,0.0013312354,0.0003882332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018161122,0.0012442678,0.00097400666,0.001257092,0.000626492,0.0012318082,0.0016268782,0.00093704986,0.0033062086],"category_scores_gemma":[0.011243792,0.0007815522,0.00068664114,0.001228095,0.00073960604,0.0020924222,0.0009561805,0.0011486149,0.0009924689],"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.001706514,0.0005095878,0.008256962,0.00063322205,0.00014010587,0.0003555253,0.00034781426,0.6055328,0.07574732,0.010246743,0.0030395584,0.2934838],"study_design_scores_gemma":[0.00014466647,0.0009740488,0.002371745,0.00008764779,0.00015110885,0.0003784322,0.00024144087,0.9167105,0.060696386,0.012903042,0.005295115,0.00004583855],"about_ca_topic_score_codex":0.0016875523,"about_ca_topic_score_gemma":0.0030612957,"teacher_disagreement_score":0.0033062086,"about_ca_system_score_codex":0.0013627373,"about_ca_system_score_gemma":0.0025018717,"threshold_uncertainty_score":0.011060357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10197285,0.0011642822,0.87084085,0.00036825167,0.0002487743,0.000098888595,0.00010480378,0.0013158453,0.023885483],"genre_scores_gemma":[0.56359327,0.0007711024,0.42507532,0.00012663673,0.00015487353,0.00007918386,0.0002791845,0.000109559536,0.009810916],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993918,0.00013026495,0.000049231552,0.000100057216,0.00023469438,0.000093934665],"domain_scores_gemma":[0.99929607,0.0002397161,0.00006385918,0.0002029284,0.00016375835,0.00003365871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005722468,0.00047898988,0.0005687141,0.00056662154,0.00048244972,0.0012746122,0.00055044814,0.00039002043,0.0035499898],"category_scores_gemma":[0.0018850976,0.00021430316,0.0002834866,0.0008218329,0.00068655866,0.0026441868,0.001207961,0.00076273317,0.0015412928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073731627,0.00013326122,0.00076884474,0.0002381218,0.000025646714,0.0002122903,0.00023087746,0.03050747,0.063447475,0.44584033,0.0075014075,0.45035696],"study_design_scores_gemma":[0.00011945762,0.0006107677,0.00036923282,0.00007798822,0.000024870136,0.00084660295,0.00012950196,0.35067564,0.085400864,0.51447034,0.047223266,0.000051517036],"about_ca_topic_score_codex":0.00021872681,"about_ca_topic_score_gemma":0.00040952003,"teacher_disagreement_score":0.0035499898,"about_ca_system_score_codex":0.0003754717,"about_ca_system_score_gemma":0.0006958628,"threshold_uncertainty_score":0.011875927},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29863793,0.0018488922,0.693468,0.00053452165,0.00006887974,0.00022724213,0.00008911584,0.0022715277,0.0028539116],"genre_scores_gemma":[0.79618466,0.0008100638,0.20109716,0.00018153117,0.00007479375,0.00014650918,0.00011851647,0.00013556243,0.0012512326],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99941194,0.00016239112,0.000026974325,0.000100077945,0.00023835347,0.000060306822],"domain_scores_gemma":[0.9973316,0.0013441626,0.00030009146,0.0006673824,0.0002944494,0.00006228452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009079129,0.00063491554,0.000404721,0.00067943713,0.0004080357,0.000617056,0.0009973956,0.0004970668,0.0015151658],"category_scores_gemma":[0.0034213772,0.00024151584,0.00018280988,0.0006850068,0.00077716156,0.0023944483,0.0007874472,0.0006809595,0.00034474325],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0022234644,0.00027167125,0.005799383,0.0003457005,0.000060057413,0.0003918675,0.00045249815,0.04442199,0.5106934,0.013114303,0.0011014298,0.42112437],"study_design_scores_gemma":[0.0001557039,0.00147323,0.004561819,0.00009582993,0.000087422726,0.00076072855,0.00012451207,0.39868551,0.576794,0.008199482,0.008972618,0.00008914691],"about_ca_topic_score_codex":0.00059362326,"about_ca_topic_score_gemma":0.0009283985,"teacher_disagreement_score":0.0015151658,"about_ca_system_score_codex":0.0005139327,"about_ca_system_score_gemma":0.00043013477,"threshold_uncertainty_score":0.005068779},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08605757,0.001207613,0.8796141,0.00025816236,0.00026364485,0.00021640863,0.00023107098,0.006843822,0.025307538],"genre_scores_gemma":[0.55633855,0.00076692377,0.42962873,0.00022503168,0.00010371383,0.00009872001,0.0005054153,0.00015198044,0.0121809095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967813,0.000033953085,0.00002921835,0.000062747895,0.00015850506,0.000037544916],"domain_scores_gemma":[0.9997869,0.000039279144,0.000017559601,0.000047796762,0.00009722719,0.000011255423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027350697,0.00038366174,0.0003927519,0.0007026547,0.00038150442,0.0010420518,0.0009160017,0.00026988977,0.004172166],"category_scores_gemma":[0.0006376137,0.00016836835,0.00027378483,0.00083379465,0.00026994434,0.0009973657,0.00036716825,0.0005236906,0.0014560255],"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.00091599557,0.00017232809,0.001865103,0.0003829071,0.000053526885,0.0006987193,0.00023220971,0.029910594,0.2187909,0.044124912,0.007123254,0.6957296],"study_design_scores_gemma":[0.00031970374,0.0012536487,0.0018734562,0.00012241252,0.00014291763,0.0038938364,0.00015072511,0.42793396,0.4765624,0.011912689,0.07569859,0.00013564841],"about_ca_topic_score_codex":0.0010109012,"about_ca_topic_score_gemma":0.0013656691,"teacher_disagreement_score":0.004172166,"about_ca_system_score_codex":0.0004161157,"about_ca_system_score_gemma":0.0007899013,"threshold_uncertainty_score":0.013957322},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21961755,0.0009949522,0.7737938,0.00037952702,0.000067328896,0.00018298,0.00017371184,0.00075074116,0.0040394603],"genre_scores_gemma":[0.9327634,0.00032124965,0.065241285,0.00015084796,0.000037659844,0.00017778557,0.00016787015,0.00011888858,0.0010209781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980856,0.00050764356,0.00017146385,0.0003216717,0.00054647116,0.00036721415],"domain_scores_gemma":[0.9850756,0.010505713,0.0019465926,0.0008207095,0.00078537915,0.000866038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023219527,0.00067626964,0.0010172839,0.0011323149,0.0004786448,0.0016661516,0.0010951568,0.00087320287,0.0020176817],"category_scores_gemma":[0.022041082,0.0006241249,0.00054545625,0.0008306741,0.0013728177,0.0025143512,0.0017707505,0.00182132,0.0003305423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007875464,0.00021408171,0.0021655434,0.00039354083,0.00008044833,0.00025663455,0.0005199723,0.7565449,0.04030008,0.1591589,0.0017683737,0.03780998],"study_design_scores_gemma":[0.00007196453,0.0002844798,0.00082795887,0.000029556728,0.00001958944,0.00007660907,0.00009744251,0.8819905,0.0062616514,0.10946837,0.00083023286,0.000041602994],"about_ca_topic_score_codex":0.0014352725,"about_ca_topic_score_gemma":0.0007990858,"teacher_disagreement_score":0.0023219527,"about_ca_system_score_codex":0.0014952353,"about_ca_system_score_gemma":0.0012575501,"threshold_uncertainty_score":0.0122798085},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00887535,0.0029728103,0.02063874,0.7934556,0.14186727,0.00022076507,0.0009048886,0.0018501168,0.029214516],"genre_scores_gemma":[0.081587814,0.0030645425,0.015198347,0.7868863,0.048744917,0.00034775113,0.00035903568,0.0005975714,0.06321385],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954466,0.00068194553,0.00065778114,0.0007362027,0.0019840049,0.0004934376],"domain_scores_gemma":[0.9882245,0.003321773,0.000941633,0.00067249767,0.0065374947,0.00030206834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002813818,0.0010405648,0.0006327641,0.00060568965,0.0025355504,0.0015114761,0.002736869,0.01452095,0.009133488],"category_scores_gemma":[0.019572953,0.0007276249,0.0014005511,0.0005837804,0.0026127943,0.002291604,0.0011650017,0.010876699,0.0099483365],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00054848485,0.000057319096,0.0010500577,0.00041111733,0.00006197294,0.0018344542,0.0005110857,0.0014497997,0.0070273215,0.022367535,0.9484597,0.016221225],"study_design_scores_gemma":[0.0001399849,0.00028990224,0.0026499326,0.00039097204,0.00011073105,0.0012800893,0.00042855155,0.0033373034,0.015789514,0.014690251,0.9606748,0.00021800755],"about_ca_topic_score_codex":0.00893635,"about_ca_topic_score_gemma":0.009282412,"teacher_disagreement_score":0.01452095,"about_ca_system_score_codex":0.0033528542,"about_ca_system_score_gemma":0.0027794854,"threshold_uncertainty_score":0.030554533},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23966445,0.00034060696,0.7535105,0.0002573627,0.0000955516,0.0001779825,0.000048202128,0.0014136318,0.004491727],"genre_scores_gemma":[0.8017876,0.00008877433,0.19561023,0.00006872639,0.000026045946,0.00005050795,0.000032610944,0.00001844387,0.0023170616],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99973124,0.00004935924,0.000016306236,0.000048312402,0.000125631,0.00002911787],"domain_scores_gemma":[0.9993845,0.00017298503,0.00010977126,0.00016000222,0.00014130413,0.00003141219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003839925,0.00029580283,0.00031742977,0.00048576389,0.00037535376,0.00046080508,0.00082960975,0.00038776657,0.002046949],"category_scores_gemma":[0.0007775753,0.00015099758,0.00030516385,0.000270708,0.00047547751,0.00094070006,0.00040536522,0.00059223955,0.0003148177],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0022889709,0.00042046804,0.0039925454,0.0005209154,0.000111632566,0.000605835,0.00036623582,0.062742926,0.5107331,0.08635214,0.003188879,0.32867622],"study_design_scores_gemma":[0.00023148351,0.0019659172,0.0014959938,0.00004411114,0.0001002927,0.0011522442,0.00005886044,0.62325335,0.35064092,0.009546958,0.011433594,0.000076214164],"about_ca_topic_score_codex":0.0004235996,"about_ca_topic_score_gemma":0.0006555411,"teacher_disagreement_score":0.002046949,"about_ca_system_score_codex":0.0003992207,"about_ca_system_score_gemma":0.00056698616,"threshold_uncertainty_score":0.0068476796},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24068865,0.008641018,0.6922384,0.00236862,0.00046621414,0.00025721267,0.00062515703,0.002585767,0.052129008],"genre_scores_gemma":[0.77008885,0.0030551406,0.21324804,0.00025661424,0.00032867098,0.0002298832,0.0007262701,0.0002406999,0.011825827],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969187,0.0005222443,0.00025971237,0.00032982047,0.0016441793,0.0003253729],"domain_scores_gemma":[0.99557567,0.0027542962,0.000323557,0.00066990545,0.00060806586,0.000068619505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010686895,0.0006476278,0.00060504663,0.0009190737,0.0005959251,0.0023731457,0.0012000089,0.00062437536,0.0068609538],"category_scores_gemma":[0.007964941,0.00042792075,0.0006116186,0.0011787096,0.0007229831,0.004157229,0.0010568666,0.0008536942,0.0019275685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015216888,0.000164806,0.004190105,0.001303207,0.00014061682,0.0007985555,0.00039125548,0.14614622,0.049649507,0.19451286,0.011608402,0.5895729],"study_design_scores_gemma":[0.0003543644,0.000646144,0.0032945373,0.00022204804,0.00017752121,0.0022270419,0.0002662656,0.6978216,0.06942012,0.18394396,0.041491713,0.00013466853],"about_ca_topic_score_codex":0.00096296467,"about_ca_topic_score_gemma":0.0012393296,"teacher_disagreement_score":0.0068609538,"about_ca_system_score_codex":0.0012004668,"about_ca_system_score_gemma":0.0019743745,"threshold_uncertainty_score":0.02295214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093679026,0.0016525389,0.8898858,0.000994838,0.00016789476,0.00019747381,0.00029877148,0.0056613605,0.0074623767],"genre_scores_gemma":[0.72684145,0.00040740232,0.2699674,0.0001984217,0.00006278301,0.00009472423,0.00047985415,0.0000776766,0.0018701432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994666,0.00007466507,0.000034822464,0.000086141474,0.00023618402,0.00010162257],"domain_scores_gemma":[0.99903154,0.000098765595,0.000073051255,0.00041728016,0.00028761415,0.00009180453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037840533,0.0003392898,0.00053868577,0.0006361539,0.0010035593,0.0009021156,0.0020021992,0.00047312022,0.0019759752],"category_scores_gemma":[0.0014927705,0.00022225546,0.00046067705,0.0015935738,0.00038632186,0.0020564075,0.0018741017,0.00070646586,0.0005687472],"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.0010175119,0.000440875,0.008687203,0.0005416524,0.00020910907,0.0007019105,0.00034905598,0.19947526,0.120085314,0.12440874,0.042203426,0.50188005],"study_design_scores_gemma":[0.00005480042,0.00013847796,0.0015575697,0.00002135878,0.000049646966,0.00026778787,0.00009991902,0.92726403,0.030267997,0.023801273,0.01643475,0.00004247267],"about_ca_topic_score_codex":0.004960216,"about_ca_topic_score_gemma":0.006930682,"teacher_disagreement_score":0.004960216,"about_ca_system_score_codex":0.0015949203,"about_ca_system_score_gemma":0.0024906525,"threshold_uncertainty_score":0.011572003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019719021,0.00030600396,0.9762249,0.00016386103,0.000035548353,0.00007787456,0.00014363047,0.0006770945,0.002652098],"genre_scores_gemma":[0.77454025,0.00057141104,0.2180363,0.00024452107,0.00016660408,0.00033600096,0.00034348236,0.0005500035,0.00521143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844295,0.00029176034,0.000058081623,0.00017191957,0.00061465095,0.00042062835],"domain_scores_gemma":[0.9974789,0.0011702629,0.00031129396,0.00038027833,0.00053830905,0.00012091013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016845295,0.0013760469,0.0007049731,0.0012814966,0.0006543239,0.0012275425,0.0019575711,0.00069061684,0.00547969],"category_scores_gemma":[0.004543881,0.00070574414,0.0014206648,0.0009664941,0.0010229181,0.0022164413,0.0012371353,0.0016430112,0.0010537826],"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.00017293687,0.000066345245,0.0010817156,0.00017433912,0.000047159116,0.0000960798,0.00008997286,0.9297742,0.016457332,0.027291702,0.0015918448,0.023156283],"study_design_scores_gemma":[0.0000062947493,0.00004750645,0.00015158561,0.000006639589,0.000012158606,0.000014924723,0.000011310285,0.9912846,0.0023429692,0.0053506647,0.00076265004,0.0000085814],"about_ca_topic_score_codex":0.006089747,"about_ca_topic_score_gemma":0.004541279,"teacher_disagreement_score":0.006089747,"about_ca_system_score_codex":0.001903975,"about_ca_system_score_gemma":0.0040772413,"threshold_uncertainty_score":0.018331409},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051477406,0.0004638745,0.9082275,0.00031724139,0.00015037418,0.00022303082,0.0005751242,0.027397454,0.011168053],"genre_scores_gemma":[0.6003352,0.0002746164,0.38304874,0.0003536332,0.00009430618,0.00024443114,0.0014167078,0.0015006488,0.012731667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989442,0.00017438698,0.00007808431,0.00015503023,0.0004901193,0.00015806698],"domain_scores_gemma":[0.9988237,0.0002772156,0.000078583,0.00057877885,0.00018809993,0.000053591808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009569697,0.00044230724,0.00046979508,0.00046675728,0.00034382174,0.0011646005,0.0014036008,0.0006082637,0.009389476],"category_scores_gemma":[0.0027088288,0.00028358013,0.00045452145,0.00040941813,0.0006128387,0.002588164,0.0014274034,0.0011959927,0.003869016],"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.0018374585,0.00053656375,0.0040322347,0.000542584,0.0001918009,0.0007044874,0.0005058119,0.07615487,0.1361196,0.15320271,0.045646872,0.580525],"study_design_scores_gemma":[0.00021435655,0.00034286763,0.0010024023,0.000055477056,0.000048312144,0.00058127346,0.00008235041,0.6633407,0.24325801,0.048559275,0.042444244,0.0000708417],"about_ca_topic_score_codex":0.0005730816,"about_ca_topic_score_gemma":0.00068430277,"teacher_disagreement_score":0.009389476,"about_ca_system_score_codex":0.0006491316,"about_ca_system_score_gemma":0.0010117139,"threshold_uncertainty_score":0.031410992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036168687,0.0007179917,0.9603738,0.00029793222,0.000043940352,0.00015430774,0.00012051666,0.00023918052,0.0018835536],"genre_scores_gemma":[0.5916077,0.000885047,0.40480703,0.00022542349,0.000059318038,0.00045790354,0.00034945,0.0000997712,0.0015084908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869543,0.00055878964,0.00006912049,0.0002751355,0.0002936398,0.000107968015],"domain_scores_gemma":[0.99699736,0.0018562194,0.00035619698,0.00022671248,0.00035701593,0.00020652686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021960281,0.0012168139,0.0013616276,0.0010669692,0.0010501196,0.0010411885,0.0019439508,0.0010475332,0.00070005836],"category_scores_gemma":[0.00590284,0.0006551157,0.0009117272,0.0016225545,0.0010601034,0.0016036417,0.0016983415,0.000798292,0.00016195128],"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.000096166405,0.00007368821,0.0007061171,0.00026454378,0.000060711343,0.00014722085,0.00023293022,0.9335751,0.003269739,0.019960977,0.0018040276,0.039808765],"study_design_scores_gemma":[0.000027162967,0.00008519168,0.00015975603,0.000020794814,0.00002631121,0.00011171909,0.00007097073,0.97116214,0.0014315578,0.025568318,0.0013199245,0.000016219841],"about_ca_topic_score_codex":0.0018514151,"about_ca_topic_score_gemma":0.0023295747,"teacher_disagreement_score":0.0021960281,"about_ca_system_score_codex":0.0013849983,"about_ca_system_score_gemma":0.0015682852,"threshold_uncertainty_score":0.011613846},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051697195,0.000071416696,0.9449148,0.00006611002,0.00003014747,0.00015225988,0.00008172284,0.0011226385,0.0018636645],"genre_scores_gemma":[0.6535022,0.00008759798,0.34386164,0.00015149049,0.000016232487,0.0004143979,0.00023038818,0.00033592584,0.0014002251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998569,0.0005978502,0.00008033717,0.00016924232,0.0004920437,0.000091549446],"domain_scores_gemma":[0.9955069,0.0024924222,0.00036952458,0.001041372,0.0005007875,0.000088927576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016136534,0.0005393601,0.0003703352,0.00047941695,0.0002724441,0.0004283687,0.0008794834,0.0004050203,0.0026728534],"category_scores_gemma":[0.0076798815,0.00021043615,0.00026790035,0.00036457216,0.0007538796,0.0007615743,0.00083882705,0.00060048176,0.00043757944],"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.00096384366,0.000361834,0.003916269,0.0004472163,0.00009364602,0.0004269139,0.00046441267,0.5665589,0.16395661,0.081104696,0.0022509752,0.17945468],"study_design_scores_gemma":[0.000060714876,0.00040142372,0.00048466612,0.000026157059,0.000017756758,0.00016880837,0.000030052119,0.880059,0.09975943,0.014572593,0.00438555,0.00003380523],"about_ca_topic_score_codex":0.00043399126,"about_ca_topic_score_gemma":0.0008765912,"teacher_disagreement_score":0.0026728534,"about_ca_system_score_codex":0.00037333873,"about_ca_system_score_gemma":0.000758327,"threshold_uncertainty_score":0.008941591},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10088907,0.0005873439,0.88722974,0.00031332477,0.00016197062,0.00017859178,0.00012946692,0.004871261,0.005639263],"genre_scores_gemma":[0.7039945,0.0002308379,0.29112783,0.00017437726,0.000055576944,0.00010054024,0.00017341935,0.000087095344,0.004055806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996388,0.000047734477,0.00003068637,0.00008092433,0.0001557975,0.000046083842],"domain_scores_gemma":[0.9994624,0.000089614885,0.00008197144,0.00012704755,0.00021404719,0.000024890185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029291896,0.0004067113,0.00032561118,0.0007678856,0.0004765318,0.00048798713,0.0011340539,0.0004977391,0.0021947944],"category_scores_gemma":[0.0009783603,0.00019698752,0.00032360584,0.0005256783,0.00031515284,0.001171071,0.00047585115,0.00054807577,0.00061752956],"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.0011065605,0.00038017417,0.002941491,0.00044669316,0.000119244505,0.0008020573,0.0003723583,0.13376442,0.3429737,0.039672412,0.006651737,0.47076905],"study_design_scores_gemma":[0.00010397487,0.0006944186,0.0008816506,0.00003560813,0.000087747794,0.00087066763,0.00003797105,0.7855655,0.19566585,0.0055023558,0.010491555,0.00006275042],"about_ca_topic_score_codex":0.0022694427,"about_ca_topic_score_gemma":0.0033810555,"teacher_disagreement_score":0.0022694427,"about_ca_system_score_codex":0.0007373116,"about_ca_system_score_gemma":0.0012192792,"threshold_uncertainty_score":0.0073423386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07625023,0.0049720565,0.873288,0.00057017844,0.000481296,0.00024138985,0.0005298398,0.004884808,0.038782176],"genre_scores_gemma":[0.45999587,0.0029239804,0.51050454,0.00048517605,0.0003094596,0.00034902352,0.0011338405,0.0005716422,0.023726393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997718,0.000032295236,0.000018874129,0.000035361903,0.000113490845,0.00002825105],"domain_scores_gemma":[0.9997718,0.000055536453,0.00004802069,0.000043469347,0.00007020058,0.000010942817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027320258,0.00072446704,0.00037819293,0.0006240386,0.0003609312,0.0008562343,0.0006691582,0.00044256178,0.009723749],"category_scores_gemma":[0.0011801246,0.0002455991,0.00025820427,0.0007712594,0.0002754663,0.0011472922,0.00041603734,0.00069690746,0.0039187395],"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.00071968976,0.0001538179,0.0008963126,0.0012500932,0.00008402354,0.00068250584,0.00032112934,0.053771913,0.27048817,0.14632301,0.024314221,0.5009951],"study_design_scores_gemma":[0.000121681915,0.0007693469,0.00079102983,0.00019936971,0.00009157089,0.0020973964,0.000110872556,0.3167719,0.38691634,0.04191674,0.2501025,0.00011128676],"about_ca_topic_score_codex":0.00024410989,"about_ca_topic_score_gemma":0.00062311,"teacher_disagreement_score":0.009723749,"about_ca_system_score_codex":0.00038745193,"about_ca_system_score_gemma":0.0007472496,"threshold_uncertainty_score":0.032529175},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19983459,0.001569515,0.76263607,0.00023772435,0.0004216906,0.00021149528,0.0004880053,0.0048138886,0.029787019],"genre_scores_gemma":[0.52695876,0.00086406624,0.4521848,0.0001954555,0.00012415025,0.00016422832,0.001202659,0.00019686003,0.018108958],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99987376,0.000014929042,0.000013873578,0.000029555136,0.000049001632,0.000018893345],"domain_scores_gemma":[0.99982184,0.000025508498,0.000022573602,0.00004543103,0.00006776192,0.000016907346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018058298,0.0004818258,0.00028816267,0.0005712013,0.00025180806,0.00063930015,0.000776969,0.00024570918,0.0048891115],"category_scores_gemma":[0.00043318447,0.00019083719,0.00022231606,0.0006493875,0.00022823755,0.0010976504,0.000536992,0.0005245256,0.002470426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072048896,0.00022423065,0.0016678862,0.0004658608,0.00008225675,0.00050090457,0.00023802032,0.015198414,0.31074733,0.094532296,0.0126234135,0.5629989],"study_design_scores_gemma":[0.00024169275,0.00115821,0.0022066175,0.00011687754,0.00012559943,0.002252614,0.00017526634,0.2837929,0.5528292,0.040512394,0.11646093,0.00012777177],"about_ca_topic_score_codex":0.00031289906,"about_ca_topic_score_gemma":0.0010182186,"teacher_disagreement_score":0.0048891115,"about_ca_system_score_codex":0.00031921818,"about_ca_system_score_gemma":0.00046093093,"threshold_uncertainty_score":0.016355693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22863288,0.00084003794,0.7643234,0.00042326475,0.000108763685,0.000088759916,0.00014316528,0.00040600705,0.0050337114],"genre_scores_gemma":[0.96344537,0.0002102502,0.03403975,0.00007878558,0.000072258146,0.000097649536,0.0001650432,0.00005617047,0.001834785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982868,0.00028829215,0.000096158765,0.00027908362,0.0006453957,0.00040425517],"domain_scores_gemma":[0.99772614,0.0010385296,0.00045332024,0.0002822242,0.0003704436,0.00012929227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014739753,0.0006389609,0.00062762335,0.00096998573,0.00045938842,0.0008969474,0.00078148337,0.0005157322,0.001090338],"category_scores_gemma":[0.004825012,0.00033477866,0.0011168597,0.0004935304,0.00086235953,0.0011751093,0.0006058372,0.0009622776,0.00013628289],"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.00041390827,0.00014992806,0.004344838,0.00022319032,0.00008719195,0.0007288138,0.00031472868,0.8626989,0.034585614,0.069764435,0.0015716502,0.025116833],"study_design_scores_gemma":[0.00001366678,0.000054955875,0.00061247137,0.000008094806,0.000013325209,0.00006694367,0.000036161273,0.9834427,0.002559298,0.01263817,0.0005436592,0.000010586715],"about_ca_topic_score_codex":0.005866192,"about_ca_topic_score_gemma":0.0024702637,"teacher_disagreement_score":0.005866192,"about_ca_system_score_codex":0.0014906994,"about_ca_system_score_gemma":0.0018343079,"threshold_uncertainty_score":0.011664093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023243539,0.008662387,0.82585067,0.0009952026,0.00076424406,0.0004548281,0.00021865034,0.003475386,0.13633506],"genre_scores_gemma":[0.2744536,0.009184847,0.617622,0.00083122996,0.0002741027,0.0006948025,0.0007726958,0.0004930408,0.095673636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977523,0.000049828566,0.00001931609,0.000022014334,0.000107967615,0.000025660825],"domain_scores_gemma":[0.9998369,0.000036434558,0.000017673565,0.00003138544,0.00006373363,0.000013817662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002576527,0.00059414486,0.00017789588,0.00035866394,0.00016779732,0.00054477167,0.0005038797,0.00040914075,0.009177376],"category_scores_gemma":[0.0004946155,0.00019190482,0.0002280209,0.00029432142,0.00018380946,0.0003697586,0.00024363695,0.00047777256,0.0027781904],"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.00012055604,0.000111827074,0.0016194588,0.0009948995,0.000065728964,0.0008730132,0.00018975281,0.06587096,0.09326592,0.14243652,0.04098408,0.6534672],"study_design_scores_gemma":[0.00009791739,0.0003690599,0.0017696369,0.00032161086,0.000064973494,0.0016756996,0.00007969166,0.17319044,0.052991103,0.034396205,0.7350018,0.000041849547],"about_ca_topic_score_codex":0.00042761696,"about_ca_topic_score_gemma":0.0009830128,"teacher_disagreement_score":0.009177376,"about_ca_system_score_codex":0.00036227168,"about_ca_system_score_gemma":0.00034574416,"threshold_uncertainty_score":0.030701399},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013331882,0.0006758752,0.98098046,0.0001928253,0.00013748168,0.000091793096,0.000037706854,0.0003175852,0.004234514],"genre_scores_gemma":[0.5980862,0.0007983071,0.39343658,0.0002811093,0.00017859007,0.00020979372,0.000110096276,0.00010076118,0.006798559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981059,0.00041603053,0.00011350128,0.0003028092,0.00086548255,0.00019623236],"domain_scores_gemma":[0.9982589,0.00038970448,0.00019952715,0.0007426601,0.00034374182,0.00006539658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012631298,0.00048545122,0.0009732071,0.0007848843,0.00068645104,0.0012968972,0.0017476993,0.0009894416,0.0027029123],"category_scores_gemma":[0.0043419944,0.00028274808,0.00059552764,0.0008419549,0.0010905307,0.0021793542,0.0017655477,0.0013834916,0.0006060673],"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.00046131527,0.00006245439,0.0006041237,0.00034641716,0.00006457162,0.0001817061,0.00039743521,0.11337284,0.056444157,0.41315836,0.003268859,0.41163775],"study_design_scores_gemma":[0.00006897333,0.00048016262,0.0004370542,0.00007896926,0.00006894091,0.0006251462,0.00010062489,0.8122916,0.056389086,0.09333376,0.03601995,0.00010568646],"about_ca_topic_score_codex":0.0004418921,"about_ca_topic_score_gemma":0.00048308796,"teacher_disagreement_score":0.0027029123,"about_ca_system_score_codex":0.0008413053,"about_ca_system_score_gemma":0.00069331203,"threshold_uncertainty_score":0.009042203},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13975176,0.0007198034,0.8547353,0.00014669748,0.00007303654,0.00012376017,0.00005939579,0.0005892725,0.0038010152],"genre_scores_gemma":[0.5914535,0.0003351732,0.40512264,0.000071385766,0.00003515807,0.00010319095,0.00008885222,0.000032251293,0.0027578683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998412,0.00003627945,0.000013001139,0.000021034215,0.00006887422,0.000019513373],"domain_scores_gemma":[0.99972147,0.00006176162,0.000071234106,0.00004832432,0.00008822223,0.000008962515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025072953,0.0003559257,0.0002732703,0.0004136543,0.00026818606,0.00040220082,0.00049771566,0.00027249553,0.0013890022],"category_scores_gemma":[0.00088264886,0.00018910752,0.0001725691,0.0003646346,0.00017281873,0.0005710805,0.00024581156,0.00025991222,0.00031788377],"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.00056382536,0.000095315954,0.0026844568,0.00042434558,0.00013102806,0.00044425973,0.0002705087,0.14841776,0.31603798,0.05300783,0.0024253759,0.47549734],"study_design_scores_gemma":[0.000090659574,0.0010639298,0.0014138554,0.0000665083,0.00006548218,0.0010580057,0.00008991435,0.7405753,0.21617134,0.013459141,0.02589873,0.000047148093],"about_ca_topic_score_codex":0.00021493608,"about_ca_topic_score_gemma":0.00047843452,"teacher_disagreement_score":0.0013890022,"about_ca_system_score_codex":0.00025004987,"about_ca_system_score_gemma":0.00040980766,"threshold_uncertainty_score":0.004646659},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13549137,0.0011339068,0.82979375,0.00039622383,0.00034184978,0.0004750133,0.0006070176,0.0055357628,0.026225049],"genre_scores_gemma":[0.59510106,0.0002464835,0.38212025,0.00017817794,0.0000885231,0.0002849829,0.0010150023,0.00018913062,0.02077637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990687,0.00013355303,0.000076792574,0.00018162238,0.00039578605,0.00014364376],"domain_scores_gemma":[0.9992811,0.00022810767,0.00007181643,0.00016292221,0.00019513298,0.000060918082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003898305,0.0005395115,0.0006011798,0.00060318713,0.00042611625,0.00079769694,0.000934674,0.0005326061,0.006363661],"category_scores_gemma":[0.0015301578,0.0002986578,0.00031100193,0.0005855257,0.00041730402,0.0012735412,0.0010698604,0.00067754864,0.0021409916],"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.0022423433,0.0003528712,0.0015521249,0.00062475627,0.000073666,0.00079423137,0.00032707443,0.061209865,0.25607425,0.10535723,0.014436423,0.5569551],"study_design_scores_gemma":[0.0005469968,0.0009819615,0.0013946482,0.00008664193,0.0000614698,0.001581138,0.00009132746,0.5441895,0.34173355,0.040068004,0.069151886,0.00011285183],"about_ca_topic_score_codex":0.0005189565,"about_ca_topic_score_gemma":0.001088192,"teacher_disagreement_score":0.006363661,"about_ca_system_score_codex":0.00073780393,"about_ca_system_score_gemma":0.0010608116,"threshold_uncertainty_score":0.021288574},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22121082,0.0017176359,0.7671564,0.000593594,0.000084450556,0.00014909841,0.00014399154,0.00094859436,0.007995371],"genre_scores_gemma":[0.9577552,0.0004375909,0.040758353,0.00004865781,0.000019069106,0.00003974775,0.00004896579,0.00003024184,0.0008621518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997507,0.00007997477,0.000011810395,0.000029561304,0.000083194,0.000044836033],"domain_scores_gemma":[0.9992137,0.0004108458,0.00008359617,0.000089432695,0.00016111185,0.00004127625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079274416,0.00035945897,0.00039177763,0.00038282564,0.0004742271,0.0005707178,0.0009095884,0.00038387024,0.00081707357],"category_scores_gemma":[0.003219023,0.00017379054,0.0002116693,0.00057692017,0.00033928157,0.0007044674,0.00030875255,0.00037788137,0.00008282666],"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.00014906084,0.0000613472,0.0014409433,0.0000744795,0.000026342335,0.000092403345,0.00007245625,0.9319402,0.008800653,0.021536319,0.0014202577,0.034385562],"study_design_scores_gemma":[0.000006758764,0.000020383774,0.00012632785,0.0000030679128,0.0000059965164,0.000012047169,0.000005853308,0.99674976,0.0009059683,0.0017722197,0.00038860025,0.0000029742378],"about_ca_topic_score_codex":0.012189803,"about_ca_topic_score_gemma":0.020178521,"teacher_disagreement_score":0.012189803,"about_ca_system_score_codex":0.0017492491,"about_ca_system_score_gemma":0.0016356807,"threshold_uncertainty_score":0.024237692},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16383895,0.0008485292,0.80407166,0.00048099164,0.00023485362,0.000096282216,0.00013340171,0.0016236242,0.028671587],"genre_scores_gemma":[0.6345321,0.0004187688,0.3596027,0.00010550917,0.0001009973,0.00007656026,0.00016826874,0.00015474613,0.004840405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991667,0.00019055165,0.000045222492,0.000080525446,0.00041660573,0.00010027481],"domain_scores_gemma":[0.9988599,0.00036913535,0.000094694406,0.00041658388,0.00020006068,0.00005967923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070818514,0.0005138818,0.0004065603,0.0004982482,0.00042540312,0.0008396528,0.0006783162,0.00031681304,0.0026897436],"category_scores_gemma":[0.002729889,0.00017738128,0.0004345866,0.0004878355,0.0011368765,0.0016398653,0.0010407497,0.0012841871,0.00115617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0010076701,0.00023193438,0.0015018865,0.0002845498,0.000038047536,0.00038899417,0.00028419928,0.16338314,0.092916556,0.47829017,0.006098405,0.2555744],"study_design_scores_gemma":[0.0001249008,0.00052113424,0.00050911127,0.00004681887,0.000022760058,0.00048937596,0.000078039084,0.7716258,0.100645855,0.10389916,0.021959692,0.00007740106],"about_ca_topic_score_codex":0.0005103776,"about_ca_topic_score_gemma":0.00068039354,"teacher_disagreement_score":0.0026897436,"about_ca_system_score_codex":0.00051866943,"about_ca_system_score_gemma":0.0007292805,"threshold_uncertainty_score":0.008998096},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5566784,0.00022382344,0.43868116,0.00015574551,0.000045000215,0.00019990285,0.00006070196,0.0005080827,0.0034471569],"genre_scores_gemma":[0.9491421,0.00005628738,0.049875494,0.000021500857,0.0000112519265,0.00008162381,0.000050980863,0.000030435183,0.0007303699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996232,0.000105740844,0.00002269313,0.000057378125,0.000096358235,0.00009457915],"domain_scores_gemma":[0.9990889,0.0004870974,0.0001583257,0.00010488809,0.00010399971,0.00005684498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063012243,0.00070159754,0.0004327938,0.0004336412,0.0003807503,0.00046361185,0.00078204804,0.00036610305,0.0011216417],"category_scores_gemma":[0.0019247212,0.00028800117,0.0003726503,0.00027458108,0.00039568625,0.00056259375,0.0006024687,0.000427054,0.0001445143],"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.00033051983,0.00015008872,0.0015347713,0.00012911607,0.000036007892,0.00023569274,0.00020614872,0.9209209,0.022726862,0.0067655733,0.0004199314,0.04654439],"study_design_scores_gemma":[0.00003944004,0.00026155025,0.00032394033,0.0000046976465,0.0000134861775,0.000056967296,0.000037366764,0.9894739,0.004878358,0.0043196734,0.00058432115,0.000006310045],"about_ca_topic_score_codex":0.0020497073,"about_ca_topic_score_gemma":0.0017884722,"teacher_disagreement_score":0.0020497073,"about_ca_system_score_codex":0.0005357928,"about_ca_system_score_gemma":0.00075936515,"threshold_uncertainty_score":0.004075527},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011284358,0.00027959218,0.98575735,0.00010822987,0.000074516225,0.000033990655,0.000049687624,0.0009287825,0.0014835264],"genre_scores_gemma":[0.49885014,0.0005047806,0.49505734,0.00024839147,0.000060400474,0.00013565348,0.00021475078,0.000070326794,0.0048581655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996086,0.0000818347,0.000031435357,0.000074975025,0.00016119842,0.000041931224],"domain_scores_gemma":[0.99966943,0.0001121822,0.000047620808,0.000050795552,0.0001029371,0.000016928501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008019357,0.0005833007,0.00056303263,0.00046215445,0.0002823502,0.00065889553,0.0013243929,0.0007261369,0.0016497752],"category_scores_gemma":[0.0010565383,0.0004262408,0.0006920182,0.0005955838,0.00044033883,0.0008379502,0.00046883902,0.00089494686,0.00042446845],"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.00021304133,0.00011901102,0.0013948786,0.0002853958,0.0001983219,0.00019279776,0.0000628683,0.58391404,0.046852026,0.028006246,0.002970055,0.33579135],"study_design_scores_gemma":[0.0000075344624,0.00004524348,0.00014593829,0.0000051892803,0.000013092376,0.000030042833,0.0000014863552,0.9926214,0.004829647,0.0010178342,0.0012756004,0.0000069659854],"about_ca_topic_score_codex":0.002129906,"about_ca_topic_score_gemma":0.0036617527,"teacher_disagreement_score":0.002129906,"about_ca_system_score_codex":0.0005862687,"about_ca_system_score_gemma":0.00089776394,"threshold_uncertainty_score":0.0055190325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08651752,0.00037427104,0.90715045,0.00028143413,0.00016800073,0.00015809534,0.00004058072,0.00057933474,0.0047302553],"genre_scores_gemma":[0.9291107,0.00011206143,0.06863105,0.00007193351,0.000030180721,0.00006294811,0.000032511063,0.000021632615,0.0019269277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997811,0.000049164006,0.000013674503,0.000044783803,0.000055729623,0.000055503453],"domain_scores_gemma":[0.9997975,0.000048725302,0.00002733252,0.000040278865,0.000051629147,0.000034593744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002859868,0.00037755456,0.00045553624,0.0002762727,0.0005842221,0.00054572016,0.000987951,0.00043758005,0.00096258527],"category_scores_gemma":[0.0005550026,0.00012614227,0.00026609527,0.0003786937,0.00030670385,0.0006437678,0.0005653347,0.0005080483,0.00020129299],"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.0009195751,0.00037633782,0.0020640471,0.00017187413,0.00008236228,0.00071000564,0.00026504343,0.5723735,0.08344284,0.063601084,0.009018647,0.2669747],"study_design_scores_gemma":[0.00002068409,0.000084766754,0.00020800435,0.0000034671637,0.000009133105,0.00007945236,0.000018077322,0.990681,0.005182998,0.0022959867,0.0014088983,0.000007557369],"about_ca_topic_score_codex":0.0015559953,"about_ca_topic_score_gemma":0.002103612,"teacher_disagreement_score":0.0015559953,"about_ca_system_score_codex":0.0005378031,"about_ca_system_score_gemma":0.0005553291,"threshold_uncertainty_score":0.003902018},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054302253,0.00040685252,0.922375,0.00046673283,0.0001004484,0.00016209733,0.0001286795,0.00056322245,0.021494789],"genre_scores_gemma":[0.5382927,0.0007169466,0.44939217,0.0003492635,0.000080505146,0.00051010837,0.00028539024,0.00019712585,0.010175747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993279,0.00021248922,0.00005154637,0.000089078574,0.0002428224,0.000076138465],"domain_scores_gemma":[0.9992337,0.00020930066,0.000111058296,0.00027699952,0.00012004429,0.000048876205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007783355,0.00043145896,0.00033660862,0.0006147426,0.0004928457,0.0010725862,0.0006428028,0.0006529497,0.0021197705],"category_scores_gemma":[0.0014177919,0.00030272454,0.0005524097,0.00053095166,0.0012933237,0.0014129241,0.0009528311,0.0013145856,0.00097178813],"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.00016969205,0.00004064205,0.00049251626,0.00019515942,0.00001956306,0.00020697429,0.00015673263,0.019401845,0.038030997,0.8723536,0.0017448817,0.06718752],"study_design_scores_gemma":[0.00011537621,0.0009865193,0.0005020277,0.00013486326,0.000054473054,0.0018177341,0.00013082632,0.20195366,0.08893233,0.58572525,0.11955897,0.000087983535],"about_ca_topic_score_codex":0.00018279924,"about_ca_topic_score_gemma":0.00021983052,"teacher_disagreement_score":0.0021197705,"about_ca_system_score_codex":0.0005394681,"about_ca_system_score_gemma":0.0009723702,"threshold_uncertainty_score":0.0070913434},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014931898,0.00027001865,0.9763848,0.0000687784,0.00008105157,0.00007063433,0.00011152407,0.00067630154,0.0074050655],"genre_scores_gemma":[0.13426952,0.00045524625,0.8594203,0.00008393788,0.00008761968,0.00008454121,0.0004832079,0.00011705683,0.0049986173],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997682,0.000025865209,0.000016638282,0.000039940882,0.00012323254,0.000026098569],"domain_scores_gemma":[0.9998123,0.000057573056,0.000020673058,0.000033681237,0.00006522495,0.000010617675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023168598,0.0005218571,0.00032626092,0.0006691116,0.00030310484,0.00071477046,0.00040921426,0.00030279552,0.0053916126],"category_scores_gemma":[0.0007349723,0.00015422684,0.00037522143,0.00054872397,0.0002974609,0.00084027776,0.00033295006,0.00041361075,0.0018494917],"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.0003302058,0.00008488898,0.0008395767,0.00041584382,0.000037023656,0.00058228703,0.00029881636,0.073145054,0.24445932,0.13763979,0.0060370797,0.53613013],"study_design_scores_gemma":[0.00007422835,0.00031262691,0.0005982201,0.00008227033,0.00003496969,0.0012129175,0.000109843626,0.7757589,0.14959544,0.015470666,0.056677952,0.00007197705],"about_ca_topic_score_codex":0.0012575183,"about_ca_topic_score_gemma":0.0024418868,"teacher_disagreement_score":0.0053916126,"about_ca_system_score_codex":0.0003750204,"about_ca_system_score_gemma":0.0007067706,"threshold_uncertainty_score":0.018036783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2777955,0.0023323467,0.6713474,0.00046484594,0.00018796805,0.00030721453,0.00050638866,0.002259017,0.04479936],"genre_scores_gemma":[0.84877217,0.0009836828,0.14231165,0.00011721915,0.000070261,0.00010663524,0.00060444674,0.00027711937,0.0067568896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994759,0.00008849849,0.000041720723,0.000050113023,0.00023280563,0.000110970854],"domain_scores_gemma":[0.99962413,0.00013120074,0.00005961296,0.00009528632,0.000079551326,0.000010172978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004908651,0.0007643091,0.0003371072,0.00074017403,0.00034698192,0.00071619893,0.00040356713,0.00022178129,0.0045573832],"category_scores_gemma":[0.0013898503,0.00022891881,0.00067902217,0.00068456726,0.00049328164,0.0016100033,0.0003903005,0.0006308546,0.0012316017],"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.00094049214,0.00013527054,0.0037433086,0.0007459407,0.00010827976,0.00083264447,0.00030758453,0.3807062,0.18493912,0.1987765,0.008140278,0.22062442],"study_design_scores_gemma":[0.00011961795,0.0009516737,0.001892704,0.00017120711,0.00011643054,0.00077600114,0.0001542029,0.75413054,0.16643889,0.042786133,0.03239606,0.00006661438],"about_ca_topic_score_codex":0.0009231168,"about_ca_topic_score_gemma":0.0014816583,"teacher_disagreement_score":0.0045573832,"about_ca_system_score_codex":0.00085721473,"about_ca_system_score_gemma":0.0011304257,"threshold_uncertainty_score":0.015245914},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037347145,0.00094772683,0.9544476,0.00019901177,0.0001277974,0.00006782118,0.00009091659,0.0014042954,0.0053676665],"genre_scores_gemma":[0.4091834,0.00060083275,0.5810432,0.00020151609,0.00008794054,0.00015248297,0.0002476775,0.00017798528,0.008304972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996505,0.0000698389,0.000029994198,0.000060246366,0.00014699723,0.000042394353],"domain_scores_gemma":[0.9996213,0.00014008906,0.000047632322,0.0000878167,0.00008770882,0.000015386735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043066626,0.00079977483,0.00040734705,0.0005643783,0.00038740705,0.00088694255,0.0013154661,0.00043734672,0.0041677044],"category_scores_gemma":[0.0020492023,0.00030890622,0.00031049977,0.00056186714,0.00043879868,0.0019989538,0.0007882584,0.0008472747,0.00090656534],"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.00056224957,0.00014250916,0.0010754263,0.00029328172,0.00006687046,0.00030346337,0.0001460014,0.14988488,0.06491503,0.09102756,0.008868449,0.6827143],"study_design_scores_gemma":[0.00005657852,0.0004019908,0.00036960427,0.000059484082,0.000041804215,0.00038655812,0.00006152409,0.88920087,0.050886147,0.03953429,0.018960893,0.000040231178],"about_ca_topic_score_codex":0.0012348008,"about_ca_topic_score_gemma":0.0041936366,"teacher_disagreement_score":0.0041677044,"about_ca_system_score_codex":0.0006441533,"about_ca_system_score_gemma":0.0009064202,"threshold_uncertainty_score":0.013942361},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.220251,0.0074335705,0.750305,0.0014754807,0.00052994554,0.00023511214,0.00023538922,0.004763778,0.014770759],"genre_scores_gemma":[0.7198625,0.003071262,0.26645106,0.0002978024,0.00041130136,0.0001368851,0.0006325462,0.00053183525,0.008604761],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991967,0.000105539206,0.0000607066,0.00011335993,0.0004167649,0.000106842344],"domain_scores_gemma":[0.99864,0.00056171353,0.000104978324,0.00044486858,0.00021251939,0.000035968213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007027706,0.00070527045,0.00083217776,0.0013473174,0.00055208936,0.0013046266,0.00077166996,0.0005991371,0.007453049],"category_scores_gemma":[0.002500211,0.000257522,0.00033779404,0.0014114918,0.00074945536,0.0050307903,0.001138707,0.00137683,0.0022031916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021276714,0.00021050271,0.00084699417,0.00063721184,0.000049254824,0.00044262217,0.00064881064,0.023375435,0.24429068,0.16217467,0.007325532,0.5578707],"study_design_scores_gemma":[0.0002513396,0.0005836296,0.0012613827,0.00010579022,0.00006225015,0.0011791902,0.00028493113,0.3293066,0.516129,0.11765994,0.033082712,0.000093249386],"about_ca_topic_score_codex":0.00032959357,"about_ca_topic_score_gemma":0.0003013116,"teacher_disagreement_score":0.007453049,"about_ca_system_score_codex":0.0006338705,"about_ca_system_score_gemma":0.0004868486,"threshold_uncertainty_score":0.024932921},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087273404,0.0023796037,0.8897644,0.00034651536,0.0004789977,0.00019259071,0.00032003087,0.006042463,0.013201973],"genre_scores_gemma":[0.50186175,0.0005552689,0.48858714,0.0002647853,0.00018976338,0.00016639713,0.0006145546,0.00012422024,0.007636085],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99939406,0.000051817075,0.00005129174,0.000093668656,0.00033724683,0.00007177182],"domain_scores_gemma":[0.9994869,0.00007566419,0.000050057595,0.0001040455,0.00025693225,0.000026432816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003428161,0.00084106886,0.0007773097,0.001036528,0.0006551772,0.0011532338,0.0018386075,0.0005193828,0.0046357117],"category_scores_gemma":[0.00097179366,0.0004236036,0.00054175773,0.0009243649,0.00030369812,0.0020818184,0.0009874188,0.0006924658,0.0019044174],"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.0013996626,0.00021200134,0.0015493415,0.0007105466,0.0001833169,0.00080949033,0.0001953113,0.021480141,0.21744372,0.033816192,0.012827177,0.7093731],"study_design_scores_gemma":[0.0001912857,0.0012828292,0.0012753244,0.00013141721,0.00025939295,0.0021950314,0.00009941124,0.49905005,0.3971296,0.011970839,0.08624139,0.00017345964],"about_ca_topic_score_codex":0.00081798347,"about_ca_topic_score_gemma":0.0020336804,"teacher_disagreement_score":0.0046357117,"about_ca_system_score_codex":0.0005019782,"about_ca_system_score_gemma":0.00080381247,"threshold_uncertainty_score":0.015508056},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15267588,0.0020049445,0.81837213,0.00043156793,0.0003731534,0.0002937886,0.00031655465,0.0024323468,0.023099631],"genre_scores_gemma":[0.49245295,0.0008493123,0.49095178,0.00023473141,0.00012305047,0.00024081572,0.00035836155,0.00013318882,0.014655874],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971837,0.00004727259,0.000032611977,0.00004791671,0.00011093249,0.000042759842],"domain_scores_gemma":[0.9995809,0.0000819588,0.00009110647,0.00008802554,0.00013512092,0.000022777553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033108477,0.00060049375,0.00029792948,0.00057606876,0.00029346236,0.00074240955,0.0009886218,0.0003900078,0.004825344],"category_scores_gemma":[0.00071989896,0.00029018297,0.000505065,0.00037385925,0.0003970011,0.0013111258,0.0003990885,0.0006447613,0.0014171974],"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.001147858,0.00016919026,0.0015622529,0.0010258816,0.00014989325,0.0004634056,0.00038227954,0.04097052,0.48639098,0.15869115,0.0096768625,0.29936984],"study_design_scores_gemma":[0.0006274133,0.004016236,0.0025378515,0.00023861515,0.0004177537,0.0030476036,0.00023394334,0.22140439,0.54843116,0.034803975,0.18404888,0.00019214643],"about_ca_topic_score_codex":0.00033595366,"about_ca_topic_score_gemma":0.0011613833,"teacher_disagreement_score":0.004825344,"about_ca_system_score_codex":0.00070120377,"about_ca_system_score_gemma":0.00069081236,"threshold_uncertainty_score":0.016142428},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28840896,0.0018717925,0.6925512,0.00033456416,0.00006636726,0.00016875044,0.0001383479,0.0006057374,0.015854247],"genre_scores_gemma":[0.854843,0.00052764604,0.13957433,0.000056608882,0.000032250897,0.00011705853,0.00008883891,0.000026275611,0.004733988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99976784,0.00004521691,0.000009538098,0.000028618484,0.000120739416,0.00002804165],"domain_scores_gemma":[0.9997029,0.00010406948,0.000070226066,0.000037592315,0.00007672197,0.00000854665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002211653,0.00036955968,0.00031390064,0.0003290225,0.00024340127,0.00059569796,0.00048180862,0.00026383984,0.001921182],"category_scores_gemma":[0.0009892187,0.0002184367,0.00021862779,0.00039806525,0.00022012206,0.0006031553,0.00020770796,0.00021937677,0.00029201803],"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.00050629047,0.00008353271,0.0031686095,0.00040305292,0.000094619216,0.00029279778,0.0002125429,0.54822445,0.13140534,0.07324499,0.003217759,0.23914602],"study_design_scores_gemma":[0.00004685173,0.00055364793,0.00075059914,0.000022046612,0.000028696453,0.00025611455,0.00004032302,0.9589774,0.025769006,0.0057288986,0.007813289,0.000013053194],"about_ca_topic_score_codex":0.0007773156,"about_ca_topic_score_gemma":0.0012618863,"teacher_disagreement_score":0.001921182,"about_ca_system_score_codex":0.0005796683,"about_ca_system_score_gemma":0.0007210479,"threshold_uncertainty_score":0.00642699},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04458864,0.0005234172,0.9467306,0.0007654762,0.00012158253,0.000082172446,0.00025211062,0.00033467019,0.0066012754],"genre_scores_gemma":[0.93466204,0.00081219897,0.04782006,0.0002680254,0.00011005217,0.00033881684,0.00033810333,0.00011857948,0.015532164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929595,0.00015510892,0.000024739731,0.00016149787,0.00013045498,0.00023218374],"domain_scores_gemma":[0.99688965,0.0021585138,0.00028262968,0.00008779933,0.00041696252,0.00016440818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012347279,0.0010048959,0.0015331388,0.0008516849,0.0011929639,0.0016631864,0.0023153597,0.0016653602,0.008203173],"category_scores_gemma":[0.0038956366,0.000714414,0.00105844,0.0008767675,0.001616369,0.0018758987,0.0015791354,0.0023665898,0.00059962214],"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.00006698296,0.0000316435,0.0010222598,0.000061082916,0.000024125828,0.00015688415,0.000095203344,0.95176494,0.0007319766,0.04061194,0.0012227931,0.004210074],"study_design_scores_gemma":[0.0000054496995,0.000006704204,0.00005734172,0.0000043521904,0.000006962499,0.000010542216,0.00001271166,0.9959877,0.000096764015,0.0036533512,0.00015306429,0.0000049958153],"about_ca_topic_score_codex":0.024981631,"about_ca_topic_score_gemma":0.021268439,"teacher_disagreement_score":0.024981631,"about_ca_system_score_codex":0.0020814708,"about_ca_system_score_gemma":0.0025515493,"threshold_uncertainty_score":0.049672425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022791378,0.0016932794,0.95738804,0.00031036054,0.0005273453,0.00024909078,0.00034155423,0.008555706,0.008143212],"genre_scores_gemma":[0.38849533,0.0010070314,0.5929577,0.00060988014,0.0002948088,0.00045644143,0.0009963888,0.00035565972,0.014826756],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992029,0.000072592185,0.00009337,0.00017321341,0.00035911263,0.000098773875],"domain_scores_gemma":[0.99916446,0.00013589837,0.00008442856,0.0001767955,0.0003899174,0.00004841001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006635711,0.0013147666,0.00067905354,0.0013789652,0.00078115053,0.0013538987,0.0029591096,0.00069411896,0.01010667],"category_scores_gemma":[0.002159658,0.00050777907,0.0005002946,0.0011795824,0.00050125737,0.0025072491,0.0012215077,0.0012878237,0.0026157522],"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.0011664759,0.00017502654,0.0017380986,0.0006287102,0.00016689718,0.00047388385,0.00022146855,0.02600223,0.09192011,0.030335285,0.020757843,0.82641387],"study_design_scores_gemma":[0.0001912763,0.00090086967,0.0012896771,0.00017226257,0.00023950572,0.0010238473,0.00008421862,0.658649,0.24182762,0.011970005,0.083501436,0.000150273],"about_ca_topic_score_codex":0.0030824274,"about_ca_topic_score_gemma":0.0055453214,"teacher_disagreement_score":0.01010667,"about_ca_system_score_codex":0.0009733676,"about_ca_system_score_gemma":0.0015289627,"threshold_uncertainty_score":0.0338102},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1853805,0.0022334564,0.76839936,0.0008050255,0.0005951985,0.00017003954,0.0007288228,0.01172457,0.029963002],"genre_scores_gemma":[0.7679323,0.0007283912,0.20826471,0.00047437905,0.000072059476,0.00014951576,0.001299194,0.00027608316,0.020803463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998493,0.000011185904,0.000008805056,0.000023769231,0.000067381385,0.00003954018],"domain_scores_gemma":[0.99983907,0.000034345478,0.0000182063,0.000027067923,0.000062765066,0.000018445415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001818072,0.0005660194,0.00025251298,0.00035506795,0.00024568575,0.00045402092,0.0010229304,0.00032086126,0.0058846436],"category_scores_gemma":[0.0005035091,0.00018908913,0.00025609432,0.0003625156,0.00019698282,0.0007602202,0.00052800355,0.0006854031,0.0012250032],"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.0013366701,0.00040778378,0.004737131,0.0006575713,0.00016658996,0.0007463218,0.00016828865,0.16287436,0.18341047,0.0505789,0.070379175,0.5245367],"study_design_scores_gemma":[0.0000784678,0.00027311454,0.00093066663,0.000038687554,0.00004801785,0.0002470132,0.00003060242,0.8870023,0.07238813,0.0069578616,0.03197329,0.000031886975],"about_ca_topic_score_codex":0.002285309,"about_ca_topic_score_gemma":0.0049610846,"teacher_disagreement_score":0.0058846436,"about_ca_system_score_codex":0.0005431905,"about_ca_system_score_gemma":0.00095449155,"threshold_uncertainty_score":0.019686103},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07358153,0.0005124007,0.92074263,0.00012749883,0.00005164493,0.00004680647,0.000045204222,0.0013209765,0.0035713527],"genre_scores_gemma":[0.53249717,0.00034392189,0.46301737,0.00008111917,0.00004083237,0.00005364371,0.000103928585,0.00005806765,0.0038039198],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995283,0.00006456399,0.00003343622,0.00006891198,0.00027225705,0.000032471904],"domain_scores_gemma":[0.9994294,0.00016245496,0.00011148992,0.00018252019,0.000102045415,0.000011944861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041124233,0.00047940508,0.0004604226,0.00049851375,0.00033150136,0.001009296,0.00076947594,0.00040447127,0.0018015278],"category_scores_gemma":[0.0015547719,0.00020332595,0.0002836726,0.00042493522,0.0005416106,0.0013003882,0.00044696697,0.00047862635,0.00049447856],"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.00057200453,0.00007344611,0.0027146644,0.00024052418,0.00006551347,0.00034540714,0.0004279588,0.22165965,0.21327181,0.0541902,0.0020904092,0.50434846],"study_design_scores_gemma":[0.000048207283,0.00058069144,0.0007527717,0.00004711208,0.00006191254,0.0008778931,0.00014653755,0.74285716,0.22186399,0.009328246,0.023378188,0.000057286452],"about_ca_topic_score_codex":0.00097285624,"about_ca_topic_score_gemma":0.0021301191,"teacher_disagreement_score":0.0018015278,"about_ca_system_score_codex":0.0004928222,"about_ca_system_score_gemma":0.0005389769,"threshold_uncertainty_score":0.0060266852},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21232824,0.00043128585,0.7733601,0.0001701271,0.0000940789,0.0001751471,0.0001884267,0.000717438,0.0125352675],"genre_scores_gemma":[0.6656623,0.00029406967,0.32755068,0.00007613157,0.00008225594,0.0002536601,0.0003891557,0.00013571234,0.0055560716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903405,0.00013761537,0.0000719831,0.0002181431,0.0004088163,0.00012938151],"domain_scores_gemma":[0.99716586,0.0010863304,0.00033482077,0.0008293741,0.00045661343,0.00012702742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006587075,0.00042391164,0.00042493708,0.0009268572,0.0006448409,0.00092241657,0.001035366,0.000613414,0.0026877003],"category_scores_gemma":[0.0040305345,0.0003761214,0.00059769757,0.00090205116,0.0009025275,0.001407567,0.0008072755,0.0009656952,0.0005219717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0006536285,0.00018697292,0.0035741266,0.00048007097,0.00007384995,0.0006418946,0.00037303325,0.15733956,0.101955675,0.56705576,0.0025865221,0.16507885],"study_design_scores_gemma":[0.00009225013,0.00041506762,0.0014409582,0.000057671645,0.00005280647,0.00084412715,0.000066226894,0.8099369,0.058302842,0.10848551,0.0202366,0.00006907312],"about_ca_topic_score_codex":0.0003991406,"about_ca_topic_score_gemma":0.0006362321,"teacher_disagreement_score":0.0026877003,"about_ca_system_score_codex":0.0007512398,"about_ca_system_score_gemma":0.000811881,"threshold_uncertainty_score":0.008991241},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06414272,0.0037573485,0.9031959,0.0006736545,0.00048275548,0.00013597019,0.00034747538,0.0036910581,0.0235732],"genre_scores_gemma":[0.6268178,0.001387636,0.35137448,0.00056556344,0.00018468828,0.00013199757,0.000449632,0.00013196748,0.018956197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997942,0.000026873853,0.000018738012,0.00004569583,0.000087027125,0.000027536898],"domain_scores_gemma":[0.9997836,0.00005481601,0.000025883252,0.000034729386,0.0000888951,0.000012076556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027229555,0.00048042863,0.00028618702,0.0005278481,0.00034623794,0.0006979623,0.0011431681,0.00035285513,0.0075964886],"category_scores_gemma":[0.00079241523,0.00017461741,0.0002369963,0.000602041,0.00024318717,0.0012822951,0.0005061154,0.0005517737,0.0014719184],"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.00072432443,0.00015877404,0.0010494629,0.0006030816,0.000058705293,0.00044007727,0.0001183771,0.04582941,0.20345844,0.034728292,0.011851005,0.7009801],"study_design_scores_gemma":[0.00010656285,0.0011245378,0.0010444351,0.00015570386,0.00010082127,0.0012027567,0.000071597926,0.6800799,0.21569067,0.0156905,0.08465046,0.00008211092],"about_ca_topic_score_codex":0.0005700793,"about_ca_topic_score_gemma":0.0016748848,"teacher_disagreement_score":0.0075964886,"about_ca_system_score_codex":0.00051666243,"about_ca_system_score_gemma":0.0005867727,"threshold_uncertainty_score":0.025412798},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061637584,0.0008294686,0.9267633,0.002214301,0.00023063646,0.00029410957,0.00047925173,0.0019714923,0.0055798995],"genre_scores_gemma":[0.89285713,0.00044389738,0.10310289,0.0003863931,0.00012031145,0.0001908054,0.0005397933,0.00010234908,0.0022564498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997068,0.0007136961,0.00032157026,0.00042852608,0.0010033036,0.00046498812],"domain_scores_gemma":[0.9970782,0.00091525336,0.0003818729,0.0009846571,0.0004878317,0.00015220931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016399926,0.0005875399,0.00080224336,0.00040305327,0.00086801243,0.0019140835,0.0010526247,0.0009615614,0.0041368036],"category_scores_gemma":[0.006851668,0.00024647807,0.0006151393,0.0006432992,0.0006979802,0.0025410408,0.0022731437,0.0017382875,0.0015603906],"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.0027520896,0.0006188615,0.012552436,0.00059305865,0.00020575206,0.0015849518,0.000563418,0.2593829,0.039454874,0.14888585,0.031170677,0.5022352],"study_design_scores_gemma":[0.00006461638,0.000095431176,0.0007662661,0.000032784515,0.000021950153,0.00039445277,0.000067257395,0.95578474,0.012169639,0.025460653,0.0051202048,0.000021995647],"about_ca_topic_score_codex":0.0015405817,"about_ca_topic_score_gemma":0.0011618591,"teacher_disagreement_score":0.0041368036,"about_ca_system_score_codex":0.0013826749,"about_ca_system_score_gemma":0.0023558617,"threshold_uncertainty_score":0.013839006},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05243218,0.0019359661,0.91693324,0.00082401687,0.00029103635,0.00029811088,0.00013601784,0.012393375,0.014756047],"genre_scores_gemma":[0.5806624,0.0009337719,0.4042249,0.0005465112,0.00013888086,0.00041317538,0.00027857997,0.0015072004,0.011294593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972451,0.00063890085,0.00027879185,0.00031769965,0.0012272622,0.0002923715],"domain_scores_gemma":[0.99357635,0.0015711725,0.00060458155,0.0032322055,0.0007869217,0.00022881462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020509202,0.0007554369,0.0004644308,0.00077303714,0.0007705788,0.0030354937,0.0035215456,0.0011215963,0.0044622202],"category_scores_gemma":[0.0081542665,0.0009425935,0.0006773985,0.001048712,0.0018216097,0.0058606747,0.0037546128,0.0023633768,0.0012241517],"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.0014361417,0.0003139337,0.0095705055,0.0013102308,0.00019981738,0.0013043537,0.0037303863,0.067849,0.068025984,0.49909952,0.01655383,0.33060637],"study_design_scores_gemma":[0.00030123166,0.0006860926,0.0013653061,0.00038244663,0.00025279695,0.0013092378,0.00054191356,0.48219004,0.13372919,0.19000247,0.18901502,0.00022427134],"about_ca_topic_score_codex":0.0019564526,"about_ca_topic_score_gemma":0.0017083432,"teacher_disagreement_score":0.0044622202,"about_ca_system_score_codex":0.0009237692,"about_ca_system_score_gemma":0.0019627747,"threshold_uncertainty_score":0.014927566},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12436282,0.0029515561,0.8157113,0.000964363,0.0002565742,0.00022181256,0.00011934129,0.0018677255,0.053544477],"genre_scores_gemma":[0.59602284,0.0015917504,0.39154726,0.00016410733,0.00018993841,0.00018296586,0.00020318695,0.00027913824,0.009818787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950457,0.00010337192,0.00004318835,0.00007468264,0.00020625064,0.00006797345],"domain_scores_gemma":[0.99960166,0.00014209478,0.00006803376,0.0001338218,0.000037000602,0.000017304596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059303915,0.00070351304,0.0005325533,0.0007918763,0.0006307043,0.0014395323,0.00048382694,0.00048696436,0.0068503576],"category_scores_gemma":[0.0021328868,0.00034126674,0.00042507905,0.00088672154,0.00095104985,0.0029764131,0.0013543862,0.0011078824,0.0026671789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00034501957,0.00010660528,0.000644906,0.00042043027,0.000019203257,0.00038987954,0.0003572756,0.01128649,0.06732636,0.6850997,0.0048774327,0.22912675],"study_design_scores_gemma":[0.00015396802,0.0004970376,0.0005623254,0.00027522328,0.00005237285,0.0019825783,0.0001651483,0.11926074,0.14339796,0.59971607,0.13384527,0.00009128439],"about_ca_topic_score_codex":0.00006129454,"about_ca_topic_score_gemma":0.00012567968,"teacher_disagreement_score":0.0068503576,"about_ca_system_score_codex":0.0005098828,"about_ca_system_score_gemma":0.00028422268,"threshold_uncertainty_score":0.022916734},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044988908,0.00037957708,0.94473416,0.0001535165,0.00006333565,0.00012613577,0.00013386231,0.0056046634,0.0038158621],"genre_scores_gemma":[0.428841,0.0002955966,0.5671833,0.00013078641,0.00002659186,0.0002529719,0.00038902104,0.0008908628,0.0019898026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989427,0.00024730948,0.000075037846,0.00012379722,0.00045416673,0.0001570044],"domain_scores_gemma":[0.99875915,0.0006762477,0.00012932497,0.00021440367,0.00019050662,0.000030452757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012844029,0.00063485414,0.00048431463,0.0007733514,0.00039115702,0.0011327286,0.0010175229,0.00047383673,0.0028560194],"category_scores_gemma":[0.0027735087,0.0005089423,0.00097635837,0.00036798854,0.0008011948,0.0009926391,0.0006992099,0.0007970147,0.000553237],"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.00034381097,0.00013937551,0.003331744,0.00087724946,0.00009536416,0.0005382454,0.00038166242,0.5639799,0.100190766,0.059961133,0.003200047,0.26696068],"study_design_scores_gemma":[0.000075872704,0.000195717,0.00039771007,0.00010507274,0.000056687524,0.000106978274,0.00004209241,0.8978132,0.07393846,0.018792342,0.008446807,0.000029126993],"about_ca_topic_score_codex":0.0023699834,"about_ca_topic_score_gemma":0.0034769964,"teacher_disagreement_score":0.0028560194,"about_ca_system_score_codex":0.0009239286,"about_ca_system_score_gemma":0.0021935543,"threshold_uncertainty_score":0.0095543265},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017792499,0.00048425616,0.9475804,0.00025646127,0.00012257945,0.00009954401,0.00027029958,0.02863608,0.004757874],"genre_scores_gemma":[0.36659372,0.0005578399,0.6182124,0.0003771691,0.000074240605,0.0001930603,0.0007364976,0.0023483485,0.010906717],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995516,0.0000925361,0.00003207063,0.00008691611,0.00017614408,0.00006076269],"domain_scores_gemma":[0.99903035,0.0003190604,0.000094635354,0.00035108527,0.00014249232,0.00006241465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005713557,0.00074373477,0.00033742134,0.000656942,0.0004168333,0.0008541893,0.0013163008,0.00054115057,0.0055802907],"category_scores_gemma":[0.0018141891,0.00037750008,0.0003691391,0.00033424576,0.0005375707,0.0018936872,0.0011144711,0.0010369364,0.0008471826],"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.001113205,0.0001761425,0.004484676,0.0003991636,0.000056198052,0.0006106152,0.0009093846,0.056538444,0.061974734,0.043240618,0.034287002,0.7962098],"study_design_scores_gemma":[0.0003780682,0.0008164089,0.0017048052,0.00022806236,0.00011266651,0.0009820553,0.00018204995,0.6385956,0.17209134,0.04636997,0.13833869,0.00020033345],"about_ca_topic_score_codex":0.0014573094,"about_ca_topic_score_gemma":0.0024805276,"teacher_disagreement_score":0.0055802907,"about_ca_system_score_codex":0.00045103088,"about_ca_system_score_gemma":0.0008032646,"threshold_uncertainty_score":0.018667877},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13181512,0.0002934988,0.85203546,0.0011766786,0.000099817276,0.0005534471,0.00015795656,0.00055921794,0.013308813],"genre_scores_gemma":[0.9361717,0.0001361363,0.05847771,0.0001402587,0.000038109596,0.00018302885,0.00009358733,0.000043442782,0.004715967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600035,0.0013807425,0.00020243415,0.00066144636,0.0011020055,0.0006530879],"domain_scores_gemma":[0.9943645,0.0015197315,0.00069698185,0.001874796,0.0010002048,0.0005437602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044579795,0.00037633855,0.000673556,0.0005437282,0.002001875,0.0024246085,0.001350005,0.0013875624,0.003042525],"category_scores_gemma":[0.006958202,0.0002501023,0.00050573994,0.0010269613,0.0022186455,0.0047801924,0.0033996482,0.001360952,0.00053783413],"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.0010312716,0.00045152433,0.00489536,0.00017850727,0.00007383881,0.00061828963,0.000842288,0.19515528,0.02063555,0.64624554,0.004990934,0.124881625],"study_design_scores_gemma":[0.00020640889,0.00020346147,0.0005986582,0.000030513853,0.000025650535,0.0002657133,0.00014187723,0.8169835,0.013569599,0.15795851,0.009957428,0.000058571877],"about_ca_topic_score_codex":0.0038189883,"about_ca_topic_score_gemma":0.0032005052,"teacher_disagreement_score":0.0044579795,"about_ca_system_score_codex":0.0020045864,"about_ca_system_score_gemma":0.005074711,"threshold_uncertainty_score":0.02357632},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15847659,0.001157452,0.8178729,0.00044345148,0.00055569294,0.00018796125,0.00023363017,0.0022882235,0.018784193],"genre_scores_gemma":[0.57118654,0.00065355795,0.41415006,0.00021761427,0.00021303291,0.000108601766,0.00033830962,0.00005427673,0.013078017],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998698,0.000021259197,0.000011409448,0.00002827188,0.00004788203,0.000021310147],"domain_scores_gemma":[0.999838,0.000022594857,0.000030761992,0.000032143424,0.00006192754,0.0000144572605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019471918,0.00045496927,0.00044228637,0.0005396496,0.00038279867,0.00045392133,0.00078113005,0.00038506804,0.0031152407],"category_scores_gemma":[0.0003523803,0.00021067867,0.00032304326,0.0004997427,0.00023212665,0.0010009463,0.00027874944,0.00045530443,0.00087047025],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0006060381,0.00014419644,0.0007562318,0.0004616489,0.00008936411,0.0006945233,0.00014060113,0.013743535,0.5438424,0.07491982,0.004790845,0.35981086],"study_design_scores_gemma":[0.0004145063,0.0037729032,0.0019968005,0.00017072186,0.00040567038,0.0068337084,0.00010608412,0.30008456,0.5506796,0.03082067,0.104520954,0.00019379833],"about_ca_topic_score_codex":0.00019458051,"about_ca_topic_score_gemma":0.000467469,"teacher_disagreement_score":0.0031152407,"about_ca_system_score_codex":0.00028465333,"about_ca_system_score_gemma":0.0005734428,"threshold_uncertainty_score":0.0104215145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15722735,0.00062377035,0.83851326,0.00045366454,0.00013048846,0.000073963805,0.00028875849,0.00041173556,0.0022770357],"genre_scores_gemma":[0.94590694,0.0005574826,0.0521838,0.00009092533,0.00007801488,0.00009183881,0.0002444233,0.000056184395,0.0007904707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850476,0.00039920036,0.000110970606,0.00041899743,0.0003868478,0.00017931976],"domain_scores_gemma":[0.9891328,0.006474829,0.0023331481,0.0008657951,0.00069068494,0.0005026469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002592006,0.00077659666,0.0005891496,0.0013798781,0.0006244007,0.0018093331,0.001270095,0.0009463816,0.0012568336],"category_scores_gemma":[0.0189962,0.00048253222,0.00043134482,0.00150087,0.0018946299,0.0044594756,0.0020356548,0.0012879126,0.00021006048],"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.00034449762,0.000097738106,0.0102036,0.00024652688,0.00005780418,0.00025664986,0.0005780504,0.7081872,0.007838394,0.22886486,0.0007607925,0.042563844],"study_design_scores_gemma":[0.000028682542,0.00010293029,0.0016460124,0.000035546425,0.000020795851,0.000084389314,0.0001650738,0.8292007,0.0034857618,0.16327652,0.0019137667,0.000039813032],"about_ca_topic_score_codex":0.0028742165,"about_ca_topic_score_gemma":0.0013404845,"teacher_disagreement_score":0.0028742165,"about_ca_system_score_codex":0.0016073334,"about_ca_system_score_gemma":0.0008890913,"threshold_uncertainty_score":0.013708055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016228184,0.00024340262,0.5242255,0.0005088315,0.00022699739,0.00025758974,0.004338527,0.4455168,0.008454149],"genre_scores_gemma":[0.26980284,0.0006911727,0.5335222,0.0015601617,0.00014416559,0.0018176946,0.015923567,0.1662612,0.010277113],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9961861,0.0006360995,0.00035633714,0.0005243489,0.0019039613,0.0003931111],"domain_scores_gemma":[0.9927812,0.0030531303,0.00066015794,0.0015304711,0.0015295884,0.00044549743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047053657,0.002396324,0.0011896284,0.0020434083,0.0015504727,0.0037400865,0.005200926,0.0013496296,0.015949734],"category_scores_gemma":[0.022550842,0.0013513145,0.0019074704,0.0016792549,0.0025122794,0.0055268323,0.0052837366,0.004774393,0.008492673],"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.0017316262,0.00071665546,0.028634978,0.0032022723,0.0006119858,0.0012085346,0.0028609736,0.1735258,0.047701463,0.098270014,0.3553013,0.2862344],"study_design_scores_gemma":[0.00017790939,0.00012407577,0.0034890373,0.00023755926,0.00006095844,0.00032376344,0.00022809471,0.7988985,0.059390325,0.05235907,0.08443783,0.00027283304],"about_ca_topic_score_codex":0.004377421,"about_ca_topic_score_gemma":0.00423561,"teacher_disagreement_score":0.015949734,"about_ca_system_score_codex":0.0012903773,"about_ca_system_score_gemma":0.005083675,"threshold_uncertainty_score":0.053357124},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038039513,0.0003047106,0.955328,0.00052018574,0.000104105915,0.00032955856,0.00024006174,0.0005856849,0.00454817],"genre_scores_gemma":[0.8629111,0.0003242711,0.12853917,0.00018216296,0.00007888329,0.00028173026,0.00028257896,0.000073570445,0.0073264614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947685,0.0012236543,0.00035322097,0.0009626773,0.001945641,0.0007462694],"domain_scores_gemma":[0.99366164,0.0019595113,0.00067971426,0.0020855567,0.0010190741,0.0005944958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003952083,0.0006174604,0.0014791229,0.0009214692,0.0021782853,0.002342886,0.002839215,0.0017504625,0.004601886],"category_scores_gemma":[0.0076704244,0.00047460676,0.0007935794,0.0019872284,0.0023056439,0.0063451594,0.0041176965,0.0016953407,0.0011892068],"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.0013484417,0.00038563524,0.0030428,0.00039007902,0.00015605072,0.0011074992,0.0012375223,0.36045888,0.022897672,0.44959295,0.0057882206,0.15359433],"study_design_scores_gemma":[0.00024586907,0.00018776761,0.0003222135,0.000036990245,0.000047146663,0.00042856656,0.00009926025,0.7356025,0.0090374565,0.2427496,0.011165017,0.00007760031],"about_ca_topic_score_codex":0.0031560622,"about_ca_topic_score_gemma":0.0028043347,"teacher_disagreement_score":0.004601886,"about_ca_system_score_codex":0.0017273772,"about_ca_system_score_gemma":0.004333804,"threshold_uncertainty_score":0.020900905},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019749658,0.00023510114,0.9775179,0.00041623323,0.000055605462,0.00003259485,0.000116322466,0.00047609684,0.001400512],"genre_scores_gemma":[0.87519723,0.00044293105,0.11813916,0.0003776651,0.00008782681,0.00010975243,0.00033745376,0.00009874379,0.0052091475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751186,0.00075340347,0.00017734723,0.00054429803,0.00075149327,0.0002616185],"domain_scores_gemma":[0.99680907,0.0012319428,0.0003902121,0.00085814827,0.0005895045,0.00012109981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002869278,0.0010152695,0.0010158737,0.00040052668,0.00065625523,0.0011776699,0.0017073643,0.0013783835,0.0015649579],"category_scores_gemma":[0.008696499,0.0004303417,0.0008995231,0.00074945006,0.0015123363,0.0035791697,0.0021980854,0.0023075214,0.00046032603],"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.000448216,0.00010015176,0.0020489488,0.00013732481,0.00009576072,0.00034020244,0.00019863248,0.74234384,0.011212499,0.109176114,0.0038553204,0.13004301],"study_design_scores_gemma":[0.000005745316,0.000029673894,0.00006957082,0.0000039364513,0.000006938546,0.000037819264,0.0000060619004,0.9849037,0.0018267625,0.0127216885,0.0003804008,0.000007704039],"about_ca_topic_score_codex":0.0036337385,"about_ca_topic_score_gemma":0.0036858248,"teacher_disagreement_score":0.0036337385,"about_ca_system_score_codex":0.0017296063,"about_ca_system_score_gemma":0.0018512708,"threshold_uncertainty_score":0.015174389},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32660753,0.002906953,0.59653354,0.0010069959,0.00052408327,0.00035233825,0.00080781314,0.01513994,0.056120746],"genre_scores_gemma":[0.7803014,0.0004463626,0.19246273,0.0003490064,0.000069030524,0.00016072117,0.00083682494,0.00023606693,0.025137892],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99985516,0.000020385596,0.0000065901813,0.000023679251,0.000062296334,0.000031817577],"domain_scores_gemma":[0.99984133,0.000031922904,0.000031188025,0.000026796959,0.000039712413,0.000028967183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021660292,0.00034068828,0.00024530845,0.0002632082,0.00028119155,0.0005859187,0.0008995326,0.00035524333,0.0074441335],"category_scores_gemma":[0.00035224768,0.00018978183,0.00017822524,0.00032517067,0.00021973308,0.00084299763,0.0005121173,0.00065739575,0.0016684819],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0035283891,0.00063643185,0.00678757,0.001018662,0.00022108329,0.0010274615,0.00044461063,0.054860756,0.4552514,0.078537405,0.05644385,0.34124243],"study_design_scores_gemma":[0.0006751579,0.0032333208,0.0038774714,0.0001126507,0.00013707712,0.0015318975,0.00013758385,0.46320426,0.34195173,0.012315122,0.17268184,0.00014187017],"about_ca_topic_score_codex":0.00061631156,"about_ca_topic_score_gemma":0.0013073556,"teacher_disagreement_score":0.0074441335,"about_ca_system_score_codex":0.0004555349,"about_ca_system_score_gemma":0.000896159,"threshold_uncertainty_score":0.024903119},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005826531,0.00037606034,0.98721397,0.00011516618,0.000086532404,0.000029327113,0.00008082909,0.002853506,0.0034181208],"genre_scores_gemma":[0.12927619,0.0004926162,0.861283,0.0002006534,0.00009697785,0.00015531889,0.00054796063,0.00064471865,0.0073026167],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99946886,0.000078177036,0.000042653384,0.00009185067,0.00024788405,0.000070506336],"domain_scores_gemma":[0.9993068,0.00019512701,0.00006509779,0.00016763092,0.00023193109,0.000033475644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066636596,0.0010946222,0.00048045494,0.00073524483,0.00041825327,0.0011559124,0.001875258,0.00058045425,0.008034461],"category_scores_gemma":[0.0023893248,0.00052980456,0.00059322285,0.0009757799,0.0006290906,0.0025249994,0.0011858491,0.0016576129,0.0025539582],"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.0005116185,0.00015062233,0.0009989829,0.00035361582,0.00010494457,0.00013884559,0.00019520702,0.13490278,0.032973044,0.14997765,0.020600144,0.6590925],"study_design_scores_gemma":[0.00007320672,0.00027090503,0.0002824359,0.000052573163,0.000038193044,0.00015000543,0.000034192333,0.8595511,0.046867244,0.0610171,0.031620275,0.000042789685],"about_ca_topic_score_codex":0.0020691482,"about_ca_topic_score_gemma":0.0035724503,"teacher_disagreement_score":0.008034461,"about_ca_system_score_codex":0.0011078782,"about_ca_system_score_gemma":0.0014656843,"threshold_uncertainty_score":0.026878},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03058899,0.000741882,0.9589565,0.00014655787,0.00012257263,0.000117540185,0.00018945968,0.0019191384,0.0072174403],"genre_scores_gemma":[0.45661002,0.00060424156,0.5243415,0.00024784074,0.000116333,0.00023508992,0.00064397004,0.00019138493,0.017009636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999393,0.00009669649,0.000041974265,0.00009339934,0.0003162656,0.00005863652],"domain_scores_gemma":[0.9995097,0.00013465516,0.000054246593,0.0001434224,0.00014148216,0.000016612847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045521784,0.0007349829,0.00044479402,0.00048043826,0.00038110948,0.0007889449,0.0009036814,0.0005260236,0.0076135644],"category_scores_gemma":[0.0020646772,0.00025120212,0.0003653794,0.0003673909,0.00036422754,0.00097566366,0.0008041897,0.0009280462,0.0025469495],"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.0009166338,0.00011957787,0.0015744251,0.00037611942,0.00009012577,0.00033997576,0.00023901972,0.16813534,0.078989096,0.06272652,0.0105848685,0.6759083],"study_design_scores_gemma":[0.000088216795,0.0003943157,0.000498265,0.00006670546,0.00004720563,0.0005285956,0.000051742205,0.888082,0.06777778,0.016523765,0.025902897,0.000038565642],"about_ca_topic_score_codex":0.0014093743,"about_ca_topic_score_gemma":0.0027955833,"teacher_disagreement_score":0.0076135644,"about_ca_system_score_codex":0.00048121467,"about_ca_system_score_gemma":0.0010190901,"threshold_uncertainty_score":0.0254699},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03954024,0.0003582262,0.9589225,0.00010120253,0.000025115858,0.000036463745,0.000051840503,0.00033274488,0.0006316999],"genre_scores_gemma":[0.75692,0.0005235009,0.2402175,0.000097285,0.0000650654,0.00020564267,0.00030616554,0.000116108255,0.001548782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907553,0.00019377132,0.0000742529,0.0001501663,0.00044806374,0.00005822677],"domain_scores_gemma":[0.9968148,0.001529092,0.00062560267,0.0002256142,0.0007504007,0.00005448982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002085471,0.0011175532,0.0007790368,0.0010012792,0.00025195745,0.0008618503,0.0009396923,0.0006969958,0.0007790813],"category_scores_gemma":[0.011847877,0.00035035124,0.00046613018,0.0006418365,0.00057927374,0.0014416827,0.0008628527,0.001064125,0.00021543342],"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.00024296509,0.000088815024,0.005534851,0.00023309684,0.00006492222,0.000066242224,0.0000844638,0.754867,0.011965493,0.012255166,0.0009801924,0.21361665],"study_design_scores_gemma":[0.0000033120284,0.00003797185,0.000379175,0.0000094456245,0.000006449021,0.000016215714,0.0000051176567,0.9946374,0.0022395821,0.0023966506,0.00026276745,0.000005870842],"about_ca_topic_score_codex":0.0016161605,"about_ca_topic_score_gemma":0.0015820008,"teacher_disagreement_score":0.002085471,"about_ca_system_score_codex":0.00061694154,"about_ca_system_score_gemma":0.0007116714,"threshold_uncertainty_score":0.011029184},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2452313,0.004578318,0.7334117,0.0038910748,0.00022572254,0.00024631334,0.00016371704,0.001615307,0.010636461],"genre_scores_gemma":[0.96431464,0.0010778623,0.03318661,0.00029124608,0.00009426105,0.00005411233,0.000050755163,0.00006565814,0.00086483674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9944067,0.0017901622,0.0003007287,0.00062062335,0.0019305415,0.0009511792],"domain_scores_gemma":[0.9646297,0.021468492,0.0026136304,0.007723552,0.0029952333,0.00056934205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005649123,0.0011078834,0.001278956,0.0020286804,0.0014861228,0.0030270074,0.0013661693,0.0028190867,0.002202957],"category_scores_gemma":[0.03041919,0.00047876665,0.0008783554,0.0011836337,0.0035251,0.011884595,0.0029874016,0.0022187752,0.00048417592],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016645994,0.00033728106,0.011234662,0.0006467036,0.00031323597,0.0008303125,0.0011637157,0.26184303,0.06573151,0.444513,0.007151642,0.20457031],"study_design_scores_gemma":[0.00004828677,0.00055496243,0.00086066156,0.00015417763,0.000073975236,0.0012859321,0.0002770937,0.84153664,0.026658924,0.12147889,0.0069670947,0.00010339009],"about_ca_topic_score_codex":0.0011450709,"about_ca_topic_score_gemma":0.00046489656,"teacher_disagreement_score":0.005649123,"about_ca_system_score_codex":0.001449582,"about_ca_system_score_gemma":0.0010518252,"threshold_uncertainty_score":0.029875755},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002828254,0.0002812174,0.61512,0.0004320385,0.00007982805,0.0004590142,0.008867823,0.3686408,0.0032909834],"genre_scores_gemma":[0.08296871,0.0007209979,0.8408062,0.001046151,0.00019388553,0.0013964773,0.04509963,0.016960518,0.010807432],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968471,0.000792964,0.0005039809,0.0007811566,0.00096748734,0.000107195],"domain_scores_gemma":[0.9923126,0.0044796737,0.00046063864,0.0011307086,0.0014029399,0.0002134224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036724338,0.0026547317,0.0015598595,0.0032520138,0.00093182013,0.0034111107,0.0046742205,0.0019006009,0.035552073],"category_scores_gemma":[0.017857417,0.0015070983,0.001827742,0.0016045215,0.0008960454,0.012168881,0.003600071,0.002499651,0.013632083],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016521898,0.00050676457,0.0049651493,0.0024106856,0.00023053103,0.0005308381,0.0018337088,0.019283056,0.015573765,0.042572234,0.3097587,0.6006824],"study_design_scores_gemma":[0.0004367592,0.0002945632,0.0017561131,0.00033149772,0.00016348228,0.00056574907,0.0005545635,0.54973674,0.042838406,0.094615765,0.30841744,0.00028894367],"about_ca_topic_score_codex":0.005235354,"about_ca_topic_score_gemma":0.0068632127,"teacher_disagreement_score":0.035552073,"about_ca_system_score_codex":0.0015972926,"about_ca_system_score_gemma":0.0030481422,"threshold_uncertainty_score":0.11893356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013859521,0.00008644532,0.9968727,0.00014357043,0.000052136904,0.00005826696,0.000027715776,0.00044953823,0.00092363113],"genre_scores_gemma":[0.1429629,0.00025097557,0.85288185,0.0004058384,0.0003151667,0.00097620813,0.00017900325,0.0009415127,0.0010865736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.92877257,0.035335463,0.005292662,0.008251421,0.021298405,0.0010493892],"domain_scores_gemma":[0.7158367,0.20216505,0.020172363,0.033359833,0.027287323,0.001178755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.045087945,0.0020442419,0.0015545492,0.005733597,0.0018819924,0.005321753,0.0038267078,0.0032997113,0.003775675],"category_scores_gemma":[0.25741827,0.001061888,0.002856629,0.003347678,0.008218511,0.004492853,0.0060742623,0.0058693825,0.001510761],"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.00092733564,0.00031641842,0.012827736,0.00083015155,0.00054205826,0.00093487755,0.0022147428,0.11193919,0.030554304,0.30590555,0.0060457047,0.5269619],"study_design_scores_gemma":[0.00012683285,0.0009976395,0.0072075226,0.00036552048,0.0001927143,0.0016024974,0.0003383855,0.6233887,0.042800196,0.30497703,0.017550388,0.00045263238],"about_ca_topic_score_codex":0.001967079,"about_ca_topic_score_gemma":0.0010037682,"teacher_disagreement_score":0.045087945,"about_ca_system_score_codex":0.001890127,"about_ca_system_score_gemma":0.003239184,"threshold_uncertainty_score":0.2384507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13817199,0.0026722772,0.730348,0.0008092649,0.00075965415,0.0003154352,0.0019365271,0.06526364,0.059723236],"genre_scores_gemma":[0.54392326,0.0004384633,0.43180636,0.00086112536,0.00010701216,0.00033883788,0.0031984681,0.002070699,0.0172558],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997491,0.000032285327,0.000016580498,0.00006562006,0.00009522256,0.00004113673],"domain_scores_gemma":[0.9997619,0.00005716083,0.000026549978,0.000060466467,0.000068252055,0.000025598156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028765624,0.0008438697,0.00033309485,0.00047633782,0.00025411448,0.00082804327,0.0023170211,0.0005163466,0.013934008],"category_scores_gemma":[0.00089048425,0.0003719011,0.00034966323,0.00044224673,0.00033873247,0.0011685119,0.0008203392,0.0007928387,0.0034522947],"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.0017801803,0.00038442705,0.0048036594,0.0010423535,0.00033019934,0.00081993587,0.00038141143,0.09183402,0.17318852,0.045567542,0.13567716,0.5441905],"study_design_scores_gemma":[0.00018736426,0.0005469931,0.001218192,0.00009828666,0.00008981309,0.00030028142,0.00006022123,0.76997405,0.1350877,0.011854742,0.08050142,0.000080998114],"about_ca_topic_score_codex":0.0020331435,"about_ca_topic_score_gemma":0.0046052663,"teacher_disagreement_score":0.013934008,"about_ca_system_score_codex":0.000822834,"about_ca_system_score_gemma":0.0009587087,"threshold_uncertainty_score":0.04661393},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022443203,0.00034828827,0.9596326,0.0001460266,0.00012106944,0.00008892152,0.00006404282,0.003550156,0.013605661],"genre_scores_gemma":[0.33713424,0.00043115576,0.6431317,0.00018581627,0.000110562076,0.00017486047,0.00029518496,0.000343619,0.018192984],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996031,0.00006187822,0.000028860088,0.000083472965,0.00016737022,0.000055362114],"domain_scores_gemma":[0.9992829,0.00015366916,0.000077302066,0.00023827021,0.00021967989,0.00002823056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003352312,0.0007391336,0.00028001468,0.0006558332,0.00050596,0.0011504464,0.0013848467,0.0003971474,0.010981773],"category_scores_gemma":[0.0012342305,0.00035073725,0.0003975059,0.00084110093,0.00042249518,0.0015375788,0.00063102477,0.00075972197,0.002529276],"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.0005718225,0.00022619242,0.001139388,0.0005324074,0.00010965796,0.00045578516,0.00031092044,0.04896002,0.23349483,0.12511133,0.0110151665,0.5780725],"study_design_scores_gemma":[0.00014765987,0.00086130016,0.001301872,0.00011006666,0.000100209094,0.001710621,0.00015204387,0.5165363,0.30484658,0.05051583,0.12360999,0.00010754384],"about_ca_topic_score_codex":0.00092937035,"about_ca_topic_score_gemma":0.0027154982,"teacher_disagreement_score":0.010981773,"about_ca_system_score_codex":0.00057281624,"about_ca_system_score_gemma":0.00081408536,"threshold_uncertainty_score":0.03673768},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005319004,0.00018280302,0.9905918,0.00011225388,0.000108949804,0.00006670004,0.00008472236,0.001613534,0.0019203129],"genre_scores_gemma":[0.19983311,0.00038451614,0.7938498,0.00018117446,0.00016322949,0.00035164854,0.00073245197,0.0004419237,0.004062141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991629,0.00015354084,0.00006855635,0.00017193987,0.0003266806,0.000116330135],"domain_scores_gemma":[0.9991903,0.00009993197,0.000053326585,0.0002668204,0.00030276782,0.000086809065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073915126,0.0011580989,0.0008860264,0.0011026296,0.0012127461,0.001507216,0.001604242,0.0004910792,0.0043943264],"category_scores_gemma":[0.002065703,0.0004104099,0.00082679995,0.001976437,0.0007002652,0.0017783204,0.0018890764,0.0012236101,0.001950214],"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.0006302281,0.0002941031,0.0024928823,0.00042775477,0.00019464204,0.00050896686,0.00037563418,0.21766277,0.06104092,0.09494103,0.046893217,0.5745379],"study_design_scores_gemma":[0.000059786962,0.000066226625,0.00023406338,0.000012518532,0.000024289477,0.00012373753,0.00006044195,0.96284145,0.012359408,0.013846693,0.010334154,0.000037267047],"about_ca_topic_score_codex":0.004633702,"about_ca_topic_score_gemma":0.0063114776,"teacher_disagreement_score":0.004633702,"about_ca_system_score_codex":0.00080418895,"about_ca_system_score_gemma":0.0020347086,"threshold_uncertainty_score":0.014700472},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023541203,0.0001230578,0.9621529,0.0001635254,0.00006631636,0.00042582286,0.00012838953,0.007453811,0.005944949],"genre_scores_gemma":[0.5707932,0.00024983365,0.41511506,0.0001965196,0.000038381073,0.00069893594,0.0005801255,0.0011734156,0.011154586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821496,0.0005525203,0.00018219724,0.00032512305,0.0004836246,0.0002416469],"domain_scores_gemma":[0.9976126,0.0004819368,0.0002061276,0.001180399,0.0003497078,0.00016919023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022225513,0.00064848264,0.0005018492,0.0006587313,0.0009318534,0.0021240988,0.0015600199,0.00090458075,0.0054755495],"category_scores_gemma":[0.004487038,0.00053046906,0.00046523838,0.0004946028,0.0010667432,0.0033667532,0.0027502691,0.0013349837,0.001598136],"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.0019854847,0.00050797866,0.003149639,0.0005260714,0.0001523108,0.0014440584,0.0010687173,0.2659815,0.120862685,0.18818797,0.013077191,0.40305638],"study_design_scores_gemma":[0.0001929574,0.00047232863,0.00049487763,0.00007041633,0.00005515178,0.00033991513,0.00022231809,0.7855271,0.1164894,0.045841128,0.050198793,0.00009564937],"about_ca_topic_score_codex":0.00089052663,"about_ca_topic_score_gemma":0.0013445364,"teacher_disagreement_score":0.0054755495,"about_ca_system_score_codex":0.0006659562,"about_ca_system_score_gemma":0.0013621211,"threshold_uncertainty_score":0.01831752},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20532098,0.005085555,0.7370466,0.0015094501,0.0011112042,0.0003496856,0.0014256937,0.027824301,0.020326551],"genre_scores_gemma":[0.7192664,0.0009728656,0.2625446,0.0010693631,0.00018016082,0.00036748455,0.0028317256,0.0005358104,0.012231544],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992631,0.00006983274,0.000064588916,0.0002498747,0.00020215487,0.00015045214],"domain_scores_gemma":[0.99913955,0.00015903363,0.00006189449,0.0003432569,0.00021117978,0.00008497297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057492894,0.0014511013,0.00070519216,0.00083825376,0.00069302006,0.001505843,0.003915549,0.00055744237,0.0073767602],"category_scores_gemma":[0.0018470443,0.0006354086,0.00065919984,0.0015981924,0.0005850769,0.0035391322,0.0022803012,0.0014962914,0.0023203793],"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.0018660285,0.0008700361,0.007950806,0.0007046338,0.00029116447,0.00068406167,0.0002443072,0.0707897,0.08066053,0.015848506,0.08040423,0.73968595],"study_design_scores_gemma":[0.00031893485,0.0007431634,0.0028549943,0.00006404676,0.00019270925,0.0005360253,0.00024449968,0.83091223,0.112466365,0.012933331,0.03862796,0.000105748135],"about_ca_topic_score_codex":0.0033982687,"about_ca_topic_score_gemma":0.0074990517,"teacher_disagreement_score":0.0073767602,"about_ca_system_score_codex":0.0012450478,"about_ca_system_score_gemma":0.0018862034,"threshold_uncertainty_score":0.024677694},"labels":[],"label_agreement":null}]}