{"id":"W2921327408","doi":"10.1109/access.2019.2903304","title":"Exploring Various Levels of Parallelism in High-Performance CRC Algorithms","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Higher Education Discipline Innovation Project","keywords":"Computer science; Parallel computing; Task parallelism; Thread (computing); Data parallelism; Instruction-level parallelism; Slicing; Speedup; Parallelism (grammar); Implicit parallelism; Algorithm; Computation","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003293944,0.0001100416,0.000188906,0.0002175988,0.00003555284,0.00008921372,0.001467058,0.00003683515,0.00002604046],"category_scores_gemma":[0.000005727999,0.0001044871,0.00004298025,0.0006773667,0.00002695302,0.001932801,0.0002076062,0.0001319736,0.00003620974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001491327,"about_ca_system_score_gemma":0.00002637113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008216468,"about_ca_topic_score_gemma":0.000005679802,"domain_scores_codex":[0.9989966,0.00004401439,0.0002299277,0.00028358,0.000202631,0.0002432998],"domain_scores_gemma":[0.9992192,0.00008415412,0.00008560818,0.0005318463,0.00004076977,0.0000383913],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00009674615,0.0004381414,0.1154888,0.0003523376,0.00008814957,0.00005901699,0.006163681,0.02693895,0.01042403,0.1769096,0.0001160474,0.6629245],"study_design_scores_gemma":[0.002157205,0.0003557398,0.7742359,0.000356192,0.00001073513,0.00001573559,0.00004629815,0.04801502,0.1288214,0.04433436,0.0007857177,0.0008657237],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9448819,0.00003446402,0.05295182,0.00005936835,0.001141972,0.0001113503,0.000001457642,0.00006790792,0.0007497429],"genre_scores_gemma":[0.9966986,0.0000417228,0.003055335,0.00009066713,0.00004716679,0.00002217059,2.528543e-7,0.000006942555,0.00003712516],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6620588,"threshold_uncertainty_score":0.4260859,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09974725890309234,"score_gpt":0.2800559948137624,"score_spread":0.1803087359106701,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}