{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":812,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":812,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"f2d3e0a26263","filters":{"topic":"Error Correcting Code Techniques"}},"results":[{"id":"W2137813581","doi":"10.1109/18.910572","title":"Factor graphs and the sum-product algorithm","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6481,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Toronto","funders":"Massachusetts Institute of Technology","keywords":"Factor graph; Algorithm; Computer science; Prime-factor FFT algorithm; Viterbi algorithm; Bipartite graph; Mathematics; Graph; Decoding methods; Theoretical computer science; Fourier transform; Fractional Fourier transform; Fourier analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01048131773468266,"gpt":0.2321744062873737,"spread":0.221693088552691,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006867711,0.0001309601,0.0001122628,0.0002378451,0.0003513303,0.0001843654,0.0004298205,0.00004643909,0.00003203304],"category_scores_gemma":[0.0000190143,0.00009261659,0.00007466841,0.0004193758,0.00014018,0.001838105,0.000004024537,0.0002541278,0.00007490088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003089788,"about_ca_system_score_gemma":0.00002591594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002602581,"about_ca_topic_score_gemma":0.000005167108,"domain_scores_codex":[0.9990715,0.0001415813,0.0002597538,0.0001368666,0.0002219298,0.0001683383],"domain_scores_gemma":[0.9989548,0.0002982474,0.0001017802,0.0005044638,0.00009242124,0.00004823185],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004174814,0.00002047209,0.000003886127,0.000005643796,0.00001874649,6.787895e-7,0.004323466,0.0001755965,0.00001868616,0.05449035,0.0001340997,0.9407666],"study_design_scores_gemma":[0.006974458,0.0006659149,0.001406841,0.000190167,0.0001214047,0.001313817,0.003139769,0.3171036,0.1077281,0.5269408,0.03228862,0.002126419],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003599062,0.00003048003,0.9916931,0.0006205517,0.000678534,0.0002816712,0.00000620588,0.0007491928,0.002341167],"genre_scores_gemma":[0.9816319,0.0001589125,0.0168505,0.0009665677,0.00001494525,0.00007415002,9.652571e-7,0.000007102183,0.0002950057],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9780328,"threshold_uncertainty_score":0.3776795,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052963087","doi":"10.1109/jproc.2007.896497","title":"The Factor Graph Approach to Model-Based Signal Processing","year":2007,"lang":"en","type":"article","venue":"Proceedings of the IEEE","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":533,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Message passing; Factor graph; Computer science; Computation; Gaussian; Algorithm; Variety (cybernetics); Gradient descent; Graph; Kalman filter; Focus (optics); Theoretical computer science; Artificial intelligence; Artificial neural network","retraction":null,"screen_n_in":null,"score":{"opus":0.02629862969842002,"gpt":0.2620263511875703,"spread":0.2357277214891502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001063062,0.0001664468,0.0001423575,0.000121182,0.0003881902,0.0002032036,0.002635565,0.00006654617,1.826999e-7],"category_scores_gemma":[0.00008833021,0.0000984666,0.0001092317,0.0009089592,0.00009439149,0.000306179,0.0002338618,0.0002501182,0.000001287844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000611363,"about_ca_system_score_gemma":0.00007976403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009190246,"about_ca_topic_score_gemma":0.00000246149,"domain_scores_codex":[0.9984247,0.000005403415,0.0002855366,0.0003449895,0.0005398638,0.0003995268],"domain_scores_gemma":[0.99894,0.00008362766,0.0002427844,0.0002456448,0.0004032571,0.00008467124],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002179098,0.0006420366,0.007787422,0.0005930202,0.00005876152,8.775909e-7,0.01520132,0.006076276,0.601837,0.04006098,0.01277521,0.3147491],"study_design_scores_gemma":[0.0001085822,0.00006950821,0.0005774224,0.0001057514,0.000008041977,0.00000663693,0.0001091665,0.3755415,0.613835,0.009172355,0.0002319163,0.0002341024],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1202863,0.00003895792,0.8713775,0.0005635322,0.0001406079,0.0004036076,6.124278e-7,0.0004054382,0.006783451],"genre_scores_gemma":[0.861655,5.886541e-7,0.1378778,0.0002591949,0.00004444769,0.00002331387,2.960206e-8,0.00001550991,0.0001240998],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7413688,"threshold_uncertainty_score":0.489758,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051270424","doi":"10.1109/lcomm.2011.101811.111480","title":"A Simplified Successive-Cancellation Decoder for Polar Codes","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":457,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Computer science; Block code; Algorithm; Latency (audio); Soft-decision decoder; Polar; Bit error rate; Concatenated error correction code; Linear code; Polar code; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.09236214429013771,"gpt":0.3130310112581669,"spread":0.2206688669680292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003571399,0.0001413695,0.0001467079,0.0001619318,0.0003840647,0.00008803119,0.003154958,0.00006110661,0.00000529271],"category_scores_gemma":[0.00009346312,0.0001522864,0.00008646347,0.00032477,0.0001186637,0.0004861999,0.0002808084,0.0001763763,0.00002164611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008179357,"about_ca_system_score_gemma":0.00004406562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002855839,"about_ca_topic_score_gemma":0.0002757873,"domain_scores_codex":[0.998925,0.0001387526,0.0002804617,0.0002818388,0.0001234029,0.0002505835],"domain_scores_gemma":[0.9963715,0.0004960168,0.0001972191,0.002722898,0.0001550281,0.00005734796],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000111441,0.001065659,0.0206975,0.000157702,0.0003463132,0.000009207194,0.03843427,0.0003896856,0.413162,0.2710165,0.1298676,0.1247421],"study_design_scores_gemma":[0.002560214,0.0005063617,0.01608674,0.000407298,0.000189491,0.00006883372,0.0004500422,0.4810406,0.3466175,0.05595727,0.09277444,0.003341226],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01223396,0.0001138711,0.9784964,0.005934917,0.0002647024,0.0004259134,0.000008908242,0.0006988197,0.00182251],"genre_scores_gemma":[0.630879,0.00001956329,0.3671762,0.001692589,0.00002059457,0.0001581468,0.000009050444,0.00001390205,0.00003085541],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6186451,"threshold_uncertainty_score":0.6210058,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2103374230","doi":"10.1109/18.910581","title":"Analyzing the turbo decoder using the Gaussian approximation","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":339,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Partenariat Canadien Contre Le Cancer","keywords":"Turbo code; Convolutional code; Low-density parity-check code; Serial concatenated convolutional codes; Algorithm; Additive white Gaussian noise; Decoding methods; Concatenated error correction code; Mathematics; Gaussian; Computer science; Block code; White noise; Statistics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01874291578754073,"gpt":0.2630277063617985,"spread":0.2442847905742577,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001247592,0.0001467038,0.00009248326,0.0002360297,0.0008839897,0.0003411255,0.0007729814,0.00006938475,0.00003944604],"category_scores_gemma":[0.00002179015,0.00008947837,0.0001041283,0.0007810459,0.00007682105,0.0023712,0.000005384989,0.0003463942,0.00007068262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001101657,"about_ca_system_score_gemma":0.00005274997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002567817,"about_ca_topic_score_gemma":0.00001082437,"domain_scores_codex":[0.9988126,0.0002257436,0.000356972,0.0001280833,0.0002587131,0.0002178515],"domain_scores_gemma":[0.9986337,0.0003121291,0.0001976874,0.0007087658,0.0001096544,0.00003808677],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006275622,0.00007673321,0.00002788503,0.00002145314,0.00007564826,0.000001269273,0.01748629,0.1065136,0.0004062268,0.06627341,0.000300634,0.808754],"study_design_scores_gemma":[0.0002570268,0.00005959976,0.0001214233,0.00005968591,0.00004333854,0.0001562282,0.001453953,0.9439251,0.02459572,0.02689656,0.002109329,0.0003220306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004599509,0.00001682287,0.9897672,0.0008753533,0.0005684687,0.0003146486,0.000001655648,0.0005093469,0.003346975],"genre_scores_gemma":[0.98419,0.00002054651,0.0148207,0.0007782928,0.00003095351,0.00005302194,0.000001069692,0.000008331889,0.00009700626],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9795906,"threshold_uncertainty_score":0.6799024,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127421917","doi":"10.1109/tcomm.2004.836563","title":"On Implementation of Min-Sum Algorithm and Its Modifications for Decoding Low-Density Parity-Check (LDPC) Codes","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":279,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Decoding methods; Quantization (signal processing); Mathematics; Parity-check matrix; Belief propagation; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.05494814690018784,"gpt":0.3493726599252929,"spread":0.294424513025105,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004294792,0.0001722234,0.0002039444,0.0002871164,0.0007605004,0.00007183242,0.001058503,0.00008797483,0.000009110287],"category_scores_gemma":[0.00002327487,0.0001978756,0.0001076556,0.0003879084,0.00008604135,0.0004344729,0.00002007286,0.0002794123,0.00001094086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001267704,"about_ca_system_score_gemma":0.00008446685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001156218,"about_ca_topic_score_gemma":0.0009891078,"domain_scores_codex":[0.998668,0.0001438297,0.0004425039,0.000335751,0.0001917924,0.0002181645],"domain_scores_gemma":[0.9968697,0.0009595621,0.0002054821,0.001579818,0.0003028775,0.00008255979],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002604076,0.001631306,0.00003759397,0.00007311859,0.0001504361,3.149651e-7,0.004983448,0.002422611,0.01773613,0.09673528,0.0009097271,0.875294],"study_design_scores_gemma":[0.0007299681,0.0002772292,0.0005325418,0.0001122598,0.00008149875,0.00001253572,0.0003631552,0.5989918,0.3922165,0.005367395,0.0009158134,0.0003993309],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01411093,0.00008734424,0.9809914,0.003301586,0.0001229051,0.0006898488,0.0001023964,0.0003408868,0.0002526729],"genre_scores_gemma":[0.6871147,0.0002131178,0.3122021,0.0001162054,0.00001001483,0.0002576192,0.000008887519,0.0000131625,0.00006417926],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8748947,"threshold_uncertainty_score":0.8069133,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163509114","doi":"10.1109/icassp.2011.5946819","title":"Hardware architectures for successive cancellation decoding of polar codes","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":254,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Single antenna interference cancellation; Logarithm; Coding (social sciences); Throughput; Sequential decoding; List decoding; Polar; Multiplication (music); Algorithm; Arithmetic; Parallel computing; Computer hardware; Concatenated error correction code; Block code; Telecommunications; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04115868825466009,"gpt":0.305342444605205,"spread":0.264183756350545,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003635208,0.0002513373,0.0003886471,0.0002675646,0.0000819932,0.00007656052,0.001567048,0.0002256613,0.00001355139],"category_scores_gemma":[0.0002452768,0.0002320613,0.000191063,0.0001200394,0.00004540807,0.00005337397,0.001127446,0.0003240989,0.00000116821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007887063,"about_ca_system_score_gemma":0.0002134114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001748932,"about_ca_topic_score_gemma":0.0008961771,"domain_scores_codex":[0.9984792,0.00006652498,0.0003873818,0.0006074142,0.0002107235,0.0002487905],"domain_scores_gemma":[0.9978472,0.0003472102,0.0005321386,0.0008737449,0.0003456798,0.0000540175],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002805149,0.0004788243,0.04822464,0.007389737,0.000875958,0.00002802895,0.04400591,0.02469151,0.0240048,0.2956938,0.01412506,0.5402012],"study_design_scores_gemma":[0.0002394018,0.0002049361,0.001413699,0.0008427984,0.00004793744,0.000008429204,0.00005819342,0.1830072,0.5619563,0.2509317,0.0003805628,0.0009088379],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02087986,0.0002437061,0.9721678,0.0001260872,0.0006914291,0.0006838276,0.00003045389,0.0006870144,0.004489854],"genre_scores_gemma":[0.6296608,0.000007069093,0.3699965,0.00004101283,0.00005392289,0.00006941034,0.000008019829,0.00001543682,0.0001478379],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6087809,"threshold_uncertainty_score":0.9463186,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2745045892","doi":"10.1109/isit.2017.8006963","title":"High-dimensional coded matrix multiplication","year":2017,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":242,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Matrix multiplication; Computer science; Decoding methods; Computation; Backup; Redundancy (engineering); Low-density parity-check code; Multiplication (music); Algorithm; Theoretical computer science; Parallel computing; Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.0221721166084263,"gpt":0.309881385354015,"spread":0.2877092687455887,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002258088,0.00007833014,0.00008279926,0.00004489712,0.0003614422,0.0002263205,0.001308026,0.00004614322,0.00001552961],"category_scores_gemma":[0.0001270314,0.00006889219,0.00003262922,0.00003994673,0.00003310187,0.0004948427,0.0004769717,0.00008007541,0.0001746409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002759358,"about_ca_system_score_gemma":0.00002540833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003777865,"about_ca_topic_score_gemma":0.00003650876,"domain_scores_codex":[0.9992636,0.00001856025,0.0001189702,0.0002806408,0.000178448,0.000139718],"domain_scores_gemma":[0.9982814,0.00004885801,0.0001290472,0.00139984,0.00009355656,0.00004727429],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000122251,0.0001565196,0.006371493,0.00001190622,0.00001904917,0.00001834871,0.000255148,0.0001154544,0.0723399,0.7408384,0.03734592,0.1425156],"study_design_scores_gemma":[0.0007288125,0.0001236661,0.07987787,0.00004447899,0.000007513403,0.00005316515,0.000005521297,0.5065504,0.3573582,0.05118059,0.003448373,0.000621479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07137717,0.00001008312,0.9185904,0.003531509,0.0005126455,0.0001569524,6.343146e-7,0.00135192,0.004468646],"genre_scores_gemma":[0.6245507,7.058316e-7,0.3737667,0.0001097663,0.00002766927,0.00001010485,6.771866e-7,0.00000386587,0.001529773],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6896578,"threshold_uncertainty_score":0.2809342,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1995314179","doi":"10.1109/jlt.2014.2316732","title":"Staircase Codes With 6% to 33% Overhead","year":2014,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":240,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"University of Toronto; Government of Ontario; Compute Canada","keywords":"Decoding methods; Overhead (engineering); Computer science; Code (set theory); Coding (social sciences); Transmission (telecommunications); Coding gain; Algorithm; Theoretical computer science; Mathematics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.005793733105844699,"gpt":0.237950587754719,"spread":0.2321568546488743,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006984699,0.0001754075,0.0003864041,0.001017326,0.00008027728,0.00006384082,0.001471981,0.000160161,0.000005990263],"category_scores_gemma":[0.0003752415,0.0001290642,0.00006762115,0.001002311,0.00008216115,0.0003090905,0.0002937532,0.000487122,0.00002580266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001025943,"about_ca_system_score_gemma":0.0001018705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006789371,"about_ca_topic_score_gemma":0.00003467566,"domain_scores_codex":[0.998552,0.0000630729,0.0004398937,0.0002565577,0.0003522783,0.0003362025],"domain_scores_gemma":[0.9981301,0.0001421612,0.0004371841,0.0007162121,0.000439582,0.0001348002],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002437292,0.0006036151,0.02363985,0.00006525421,0.0002311987,0.001541722,0.001855146,0.0001838924,0.08492053,0.5799364,0.02962996,0.2771486],"study_design_scores_gemma":[0.001696137,0.01484902,0.002542457,0.0006700113,0.00006726964,0.01267858,0.0002758169,0.003114841,0.6779543,0.1068944,0.1781624,0.00109473],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2171371,0.00005464375,0.7712913,0.009176626,0.0002602693,0.0001045234,5.588334e-7,0.0005301044,0.001444975],"genre_scores_gemma":[0.7051628,0.000005402197,0.2942919,0.0003850841,0.0000625663,0.000003663939,5.436935e-8,0.00001257361,0.00007595917],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5930338,"threshold_uncertainty_score":0.5263085,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2601496744","doi":"10.1109/tsp.2017.2740204","title":"Fast and Flexible Successive-Cancellation List Decoders for Polar Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":207,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Algorithm; Error detection and correction; Coding gain; Polar code; Throughput; Polar; Coding (social sciences); Bit error rate; Parity bit; Computer engineering; Telecommunications; Mathematics; Statistics; Physics; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.03388292182735758,"gpt":0.311307947499687,"spread":0.2774250256723294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0002840225,0.0001794527,0.0001770437,0.0001534265,0.001965638,0.0009702903,0.0005994313,0.00009123782,0.00000538729],"category_scores_gemma":[0.0000145609,0.0001830124,0.00006461214,0.0001165224,0.0001287181,0.001455163,0.000005639498,0.000200618,0.000002515088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006316484,"about_ca_system_score_gemma":0.000110035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001207008,"about_ca_topic_score_gemma":0.0001494912,"domain_scores_codex":[0.9988372,0.00002816796,0.0002096783,0.0004537625,0.0002024632,0.0002687106],"domain_scores_gemma":[0.9989699,0.0001506878,0.0002409659,0.000379886,0.0001723599,0.00008621555],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005994446,0.00007618416,0.0002029413,0.0001404027,0.00001850437,0.000002780742,0.001008033,0.003378796,0.01661724,0.0002729633,0.00007355894,0.9781486],"study_design_scores_gemma":[0.0004785861,0.0002026028,0.0001671423,0.000278292,0.00003107487,0.00001697379,0.00008640621,0.6386877,0.3563243,0.003055464,0.0002903597,0.0003810189],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003986388,0.0001023015,0.9937209,0.0005987685,0.0002231497,0.0002563885,0.00001186275,0.0004713423,0.0006289163],"genre_scores_gemma":[0.9309876,0.00001184753,0.06846575,0.0001088444,0.00004734599,0.0000534244,9.162031e-7,0.00002080768,0.0003034382],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9777676,"threshold_uncertainty_score":0.9993337,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144024329","doi":"10.1109/tsp.2008.929671","title":"Fully Parallel Stochastic LDPC Decoders","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":207,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Low-density parity-check code; Computer science; Field-programmable gate array; Parallel computing; Algorithm; Gate array; Clock rate; Throughput; FLOPS; Computer hardware; Wireless; Telecommunications; Chip","retraction":null,"screen_n_in":null,"score":{"opus":0.03476306807681433,"gpt":0.2671225874347176,"spread":0.2323595193579033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000196013,0.0002430478,0.000208446,0.0002848908,0.0007823708,0.0001224765,0.0006960044,0.0001063592,0.00002756892],"category_scores_gemma":[0.000005707737,0.0002466046,0.0001176167,0.0006466937,0.0001117839,0.0008145242,0.000003821992,0.0004583736,0.00007324738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000104951,"about_ca_system_score_gemma":0.0002494433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002157007,"about_ca_topic_score_gemma":0.00001550575,"domain_scores_codex":[0.998254,0.00005944763,0.0003051571,0.0005325058,0.0004408935,0.0004079884],"domain_scores_gemma":[0.9991075,0.0001326792,0.0001172665,0.0003617252,0.0001443576,0.0001364873],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001088918,0.0005867411,0.00002320961,0.00008182434,0.00005155981,0.0001416832,0.005708339,0.2996517,0.007839043,0.0001948657,0.0006323573,0.6849797],"study_design_scores_gemma":[0.000683974,0.0004537081,0.00007805769,0.0002762207,0.00003366426,0.0007318467,0.0001221291,0.9524975,0.04161448,0.002466085,0.000165816,0.0008765592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005566345,0.00008473365,0.9915931,0.000257051,0.0002394473,0.00017945,0.000001151342,0.001444723,0.0006339467],"genre_scores_gemma":[0.8951853,0.000006113997,0.1041035,0.000321306,0.00003544068,0.00005179445,2.679743e-7,0.00002650508,0.0002697525],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.889619,"threshold_uncertainty_score":0.9999986,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2019751845","doi":"10.1049/el:20030217","title":"Iterative decoding using stochastic computation","year":2003,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":205,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; Computation; Computer science; Sequential decoding; Algorithm; List decoding; Code (set theory); Simple (philosophy); Berlekamp–Welch algorithm; Iterative method; Theoretical computer science; Concatenated error correction code; Set (abstract data type)","retraction":null,"screen_n_in":null,"score":{"opus":0.01957735228012552,"gpt":0.2767375105798688,"spread":0.2571601582997433,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003290587,0.0001454049,0.0001251318,0.0001511578,0.0001816959,0.0001535859,0.0003249333,0.00003774406,0.000002536705],"category_scores_gemma":[0.00008676691,0.0001610604,0.00004952767,0.0004136601,0.00002162942,0.0003893558,0.00004757885,0.000251178,0.000009407634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003485419,"about_ca_system_score_gemma":0.00009714111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006148462,"about_ca_topic_score_gemma":0.000006229692,"domain_scores_codex":[0.9987336,0.0001359784,0.0001759172,0.0003367961,0.0001953363,0.0004223732],"domain_scores_gemma":[0.9994257,0.0001302182,0.0001060137,0.0002408444,0.00005134994,0.00004588016],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000119911,0.0001221398,0.0005198676,0.00002745786,0.000107176,0.00005539807,0.005582365,0.1539319,0.5482169,0.2650059,0.00262364,0.02379529],"study_design_scores_gemma":[0.000279349,0.0001162035,0.00003461078,0.00004640519,0.00001284562,0.0001505682,0.00002001986,0.93949,0.04863856,0.01036577,0.0003720768,0.0004735575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.145901,0.0001234139,0.8526586,0.0004045493,0.0002308088,0.0001251994,1.308973e-7,0.000360238,0.0001960173],"genre_scores_gemma":[0.7877596,0.000001199231,0.2111505,0.001041037,0.00002084783,0.000006079749,7.690546e-7,0.00001324384,0.000006705435],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7855582,"threshold_uncertainty_score":0.656785,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2608866305","doi":"10.1109/glocom.2017.8254146","title":"Beta-Expansion: A Theoretical Framework for Fast and Recursive Construction of Polar Codes","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":202,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Mathematics; Polynomial ring; Polynomial expansion; Algorithm; Applied mathematics; Interval (graph theory); Polynomial; Polar; Discrete mathematics; Computer science; Combinatorics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02362302383466364,"gpt":0.3103734069780927,"spread":0.2867503831434291,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005372291,0.0002497092,0.0004933841,0.0001285661,0.0001689982,0.0002024248,0.001183976,0.0004376821,0.00001111766],"category_scores_gemma":[0.0004204076,0.0002197663,0.0001519193,0.00005154718,0.0007089394,0.0001418783,0.001448257,0.0005776035,0.00000100653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003389714,"about_ca_system_score_gemma":0.0001512515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006203195,"about_ca_topic_score_gemma":0.000008868792,"domain_scores_codex":[0.998448,0.00008891831,0.0003295448,0.0006803925,0.000233485,0.0002196675],"domain_scores_gemma":[0.9970889,0.000604033,0.0004748146,0.001395104,0.0003553339,0.00008177938],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001389418,0.00001899624,0.0003507457,0.000102693,0.00002920579,0.000001262479,0.0005628716,0.000001698625,0.00007380817,0.964076,0.0001770878,0.0345917],"study_design_scores_gemma":[0.00008918789,0.0001626199,0.0001639897,0.0005688462,0.00003098574,0.0000421519,0.0001065401,0.005052056,0.01764938,0.9757591,0.0001162665,0.0002588376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007370048,0.0002109672,0.9870498,0.001718125,0.0008717821,0.0006320438,0.0000256963,0.0003643347,0.001757273],"genre_scores_gemma":[0.317747,0.0000799692,0.6819661,0.00005660113,0.00007012211,0.00004685395,0.000004285285,0.00001220854,0.000016822],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.310377,"threshold_uncertainty_score":0.8961812,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147861990","doi":"10.1109/lcomm.2004.839612","title":"Improved Progressive-Edge-Growth (PEG) Construction of Irregular LDPC Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":192,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Computer science; Enhanced Data Rates for GSM Evolution; Turbo code; PEG ratio; Block code; Block (permutation group theory); Construct (python library); Simple (philosophy); Mathematics; Decoding methods; Telecommunications; Combinatorics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01934133079425129,"gpt":0.2719253126176138,"spread":0.2525839818233625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000318635,0.0001742232,0.0002225453,0.0002324313,0.0002677841,0.00008264431,0.003199165,0.00007967734,0.000001801929],"category_scores_gemma":[0.00009380833,0.0001835651,0.0001046924,0.000640803,0.0005976945,0.000490222,0.0004640355,0.0003093724,0.000008650662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001457189,"about_ca_system_score_gemma":0.0001039761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001793861,"about_ca_topic_score_gemma":0.00003283288,"domain_scores_codex":[0.998665,0.0001689092,0.0004058431,0.0003050109,0.0002094875,0.0002457055],"domain_scores_gemma":[0.9961009,0.0001528491,0.0003605841,0.003051466,0.0002714916,0.00006273466],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001495824,0.0004693885,0.002025941,0.00008577254,0.0001247535,0.000008438587,0.003394273,0.0001746256,0.8309382,0.1315212,0.001512101,0.02973044],"study_design_scores_gemma":[0.001309963,0.0002578823,0.002085607,0.0004687011,0.00006673548,0.0002623136,0.0002200055,0.01262552,0.9579555,0.02244155,0.00139682,0.0009093805],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1570888,0.0003841711,0.8198659,0.02007348,0.0004515593,0.0005204047,0.000005814079,0.001012383,0.0005974773],"genre_scores_gemma":[0.5858073,0.00003567968,0.4136227,0.0004302443,0.00001837252,0.00006541564,0.000004469692,0.0000115986,0.000004252754],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4287184,"threshold_uncertainty_score":0.7485569,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133071357","doi":"10.1109/lcomm.2006.1576565","title":"Rateless coding over fading channels","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":189,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Fading; Computer science; Fountain code; Channel state information; Transmitter; Robustness (evolution); Coding (social sciences); Forward error correction; Computer network; Channel (broadcasting); Decoding methods; Binary erasure channel; Algorithm; Theoretical computer science; Channel capacity; Telecommunications; Block code; Wireless; Concatenated error correction code; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03528169430475773,"gpt":0.2894447272929726,"spread":0.2541630329882149,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003632458,0.0001434963,0.0001420801,0.0002076546,0.0004104698,0.0002408884,0.003353394,0.00004975351,0.000003499796],"category_scores_gemma":[0.00002295342,0.0001604166,0.00007107216,0.0005501718,0.0001025696,0.0005222591,0.0005168981,0.0002832072,0.00004117729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001236076,"about_ca_system_score_gemma":0.00002118278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003288103,"about_ca_topic_score_gemma":0.00005906543,"domain_scores_codex":[0.9988384,0.0001634833,0.0002679985,0.0002663209,0.0001795662,0.0002842438],"domain_scores_gemma":[0.9967752,0.0002884808,0.0001391294,0.002699069,0.0000603048,0.0000378505],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004256498,0.000275345,0.005099367,0.00003349346,0.00004728134,0.00002645171,0.002782321,0.003824314,0.7097234,0.1447831,0.1159782,0.01742257],"study_design_scores_gemma":[0.001286685,0.00009613397,0.009716863,0.000570688,0.00005269468,0.0001836529,0.0001277079,0.5323104,0.3460633,0.01482836,0.09204841,0.002715074],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1096467,0.0001190565,0.8730026,0.01142291,0.0006418226,0.0001995811,0.000001351726,0.001298273,0.003667626],"genre_scores_gemma":[0.9090421,0.00002212399,0.08899754,0.001692136,0.00008059919,0.00005549318,0.000004871734,0.00001681995,0.00008833203],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7993954,"threshold_uncertainty_score":0.6541601,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1813544306","doi":"10.1109/icc.2001.936269","title":"A heuristic search for good low-density parity-check codes at short block lengths","year":2002,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":172,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Toronto","funders":"","keywords":"Low-density parity-check code; Tanner graph; Heuristic; Computer science; Block code; Algorithm; Degree distribution; Block size; Block (permutation group theory); Degree (music); Mathematics; Theoretical computer science; Decoding methods; Combinatorics; Error floor","retraction":null,"screen_n_in":null,"score":{"opus":0.0426256018935306,"gpt":0.2862079065260987,"spread":0.2435823046325681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006479931,0.0002265905,0.0002856952,0.0001175884,0.0003299062,0.0001537962,0.001083993,0.000130266,0.00004995078],"category_scores_gemma":[0.0001751689,0.0002161373,0.0001393259,0.0003372454,0.00007270776,0.0002336035,0.0007434459,0.0002597835,0.0001534067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001632137,"about_ca_system_score_gemma":0.00002917186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001301709,"about_ca_topic_score_gemma":0.0003544668,"domain_scores_codex":[0.9979748,0.00009249181,0.0002978063,0.0006969371,0.0003601757,0.0005777469],"domain_scores_gemma":[0.9981252,0.000522088,0.00004377415,0.0009171992,0.0002266172,0.0001650982],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001634695,0.003820287,0.1437985,0.001135237,0.0004086341,0.0004511445,0.01060213,0.0003443412,0.04782839,0.2320138,0.3866046,0.1728295],"study_design_scores_gemma":[0.0005306994,0.0006405575,0.003771415,0.0001016138,0.00003526396,0.0002688729,0.00006221933,0.645386,0.3390142,0.003712269,0.005394512,0.001082383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.330855,0.0001119527,0.6442416,0.001379391,0.0004234722,0.0008805115,0.000006665401,0.002742083,0.01935933],"genre_scores_gemma":[0.9058306,0.00002103638,0.08883164,0.0002878914,0.00007411147,0.00004858737,0.000001756138,0.00002186156,0.004882557],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6450416,"threshold_uncertainty_score":0.8813823,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131239166","doi":"10.1109/lcomm.2006.060570","title":"Stochastic decoding of LDPC codes","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":168,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Computer science; Berlekamp–Welch algorithm; Algorithm; Factor graph; List decoding; Sequential decoding; Code (set theory); Throughput; Theoretical computer science; Concatenated error correction code; Error floor; Block code; Telecommunications; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.02927228328082015,"gpt":0.2840308639770852,"spread":0.2547585806962651,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002901674,0.00009920775,0.0001386957,0.0001785184,0.0001705569,0.00005089707,0.002882055,0.00003371193,0.000001681585],"category_scores_gemma":[0.00004727788,0.000109059,0.00006216306,0.0004119822,0.0001546331,0.0002411938,0.0003665892,0.0001709048,0.00001344657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005782632,"about_ca_system_score_gemma":0.00002589434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003241508,"about_ca_topic_score_gemma":0.0001282658,"domain_scores_codex":[0.9990972,0.000117765,0.0002906402,0.0001709835,0.0001540002,0.0001694008],"domain_scores_gemma":[0.9967557,0.000450228,0.0001727716,0.002515784,0.00008115445,0.00002441062],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006079799,0.0004375806,0.004067803,0.00004437299,0.00005448608,0.000004997129,0.001867491,0.008934187,0.7647808,0.1568555,0.03898406,0.02396261],"study_design_scores_gemma":[0.001203226,0.0002007886,0.01367919,0.0007383364,0.0001036249,0.0001514422,0.0001787322,0.6786799,0.2629587,0.032672,0.00739638,0.00203774],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06137629,0.0001420964,0.9312075,0.005090683,0.0001486377,0.0001247367,0.000001916168,0.0004608367,0.001447256],"genre_scores_gemma":[0.7457871,0.000005877932,0.2537833,0.0003551316,0.00001629723,0.0000235766,0.000002552825,0.000007828023,0.00001830333],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6844108,"threshold_uncertainty_score":0.5355622,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3098807857","doi":"","title":"Fast list decoders for polar codes","year":2016,"lang":"en","type":"article","venue":"Espace ÉTS (ETS)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure; McGill University","funders":"","keywords":"Decoding methods; Low-density parity-check code; Computer science; List decoding; Concatenated error correction code; Polar code; Error detection and correction; Sequential decoding; Algorithm; Forward error correction; Serial concatenated convolutional codes; Berlekamp–Welch algorithm; Cyclic redundancy check; Theoretical computer science; Block code; Error floor","retraction":null,"screen_n_in":null,"score":{"opus":0.01645277043609536,"gpt":0.2753505181720378,"spread":0.2588977477359424,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004821054,0.0002049805,0.0002073512,0.0001515386,0.0001793091,0.0001492488,0.00113045,0.0001026374,0.0000216858],"category_scores_gemma":[0.0004123489,0.000154249,0.0001191242,0.0002610361,0.00007552137,0.0005226865,0.0002707427,0.0001003969,0.000104047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001111252,"about_ca_system_score_gemma":0.00008225842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001004325,"about_ca_topic_score_gemma":0.0005421121,"domain_scores_codex":[0.998489,0.00006514341,0.0001918905,0.000535938,0.0002439671,0.0004741217],"domain_scores_gemma":[0.9982985,0.0004509114,0.0001276119,0.0008512191,0.0001387848,0.000132929],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001332872,0.0003106504,0.02322358,0.0001167231,0.0001231982,0.00005201212,0.006704127,0.00002966181,0.1191276,0.1725426,0.2581846,0.419452],"study_design_scores_gemma":[0.002656891,0.001144574,0.005868965,0.0007428732,0.00005363833,0.0001384404,0.000433419,0.02137588,0.4139785,0.03202732,0.5190684,0.002511138],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01607044,0.00009918708,0.9703311,0.009073487,0.0006518097,0.0003397376,0.00001702992,0.001292104,0.002125059],"genre_scores_gemma":[0.8009925,0.00002022838,0.1930204,0.0005652796,0.0001365213,0.00007244773,0.000001572582,0.00003659231,0.005154362],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7849221,"threshold_uncertainty_score":0.629009,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999589899","doi":"10.1109/icc.2004.1312525","title":"On construction of rate-compatible low-density parity-check codes","year":2004,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Turbo code; Puncturing; Block code; Raptor code; Computer science; Serial concatenated convolutional codes; Linear code; Hybrid automatic repeat request; Code rate; Algorithm; Concatenated error correction code; Code (set theory); Mathematics; Theoretical computer science; Decoding methods; Telecommunications; Programming language; Transmission (telecommunications)","retraction":null,"screen_n_in":null,"score":{"opus":0.01352686782819135,"gpt":0.2514271152527381,"spread":0.2379002474245467,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000332847,0.0001127725,0.0001840494,0.0001128466,0.00007597877,0.00004227819,0.0004192876,0.00006451094,0.00001329995],"category_scores_gemma":[0.0001025745,0.0001037402,0.00005432697,0.0003216682,0.00008288133,0.0002342258,0.0001221617,0.0001485645,0.00003666247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006963225,"about_ca_system_score_gemma":0.00007471494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005483303,"about_ca_topic_score_gemma":0.0001412578,"domain_scores_codex":[0.9990826,0.00005770327,0.0002177316,0.0002852819,0.0001919703,0.0001646754],"domain_scores_gemma":[0.9990765,0.0001135867,0.0001187762,0.0005106233,0.0001324138,0.00004809159],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001932832,0.0002051415,0.004398139,0.00003412741,0.00001394994,0.00000855857,0.0004680034,0.0005064095,0.01825078,0.9698966,0.0006160637,0.005582939],"study_design_scores_gemma":[0.0002635291,0.0001941788,0.004394952,0.00007544597,0.000003307739,0.00002174189,0.00003325711,0.002834809,0.835952,0.1560467,0.0000211994,0.0001588589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.50701,0.000003266422,0.4864095,0.0002288974,0.0002227184,0.00008827761,4.133289e-7,0.0005237389,0.005513207],"genre_scores_gemma":[0.8003931,0.00000290667,0.199379,0.000160023,0.00001094378,0.000002945643,6.293688e-7,0.000004588095,0.00004586152],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8177013,"threshold_uncertainty_score":0.4230404,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150494733","doi":"10.1109/lcomm.2004.825728","title":"On Construction of Rate-Compatible Low-Density Parity-Check Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":155,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Low-density parity-check code; Mathematics; Algorithm; Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.02667592626354847,"gpt":0.2780708074728517,"spread":0.2513948812093032,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004408894,0.0001421797,0.0002077942,0.0001987681,0.0002664419,0.00006206088,0.002173986,0.00006241162,0.000002128175],"category_scores_gemma":[0.0001047741,0.0001550988,0.00008065102,0.0005067338,0.0003352665,0.000300455,0.0002913405,0.0003514077,0.00003511686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001451008,"about_ca_system_score_gemma":0.00006843944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004156678,"about_ca_topic_score_gemma":0.0001431631,"domain_scores_codex":[0.9987984,0.0002425098,0.0003287923,0.0002551288,0.0001894871,0.0001856685],"domain_scores_gemma":[0.9961852,0.0003777365,0.0002404628,0.003006325,0.0001402782,0.00004992462],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003452712,0.0009255164,0.005352415,0.00008036241,0.000100959,0.000008953057,0.003735368,0.00534877,0.4622182,0.5069918,0.006000445,0.009202725],"study_design_scores_gemma":[0.001001931,0.0002171091,0.00917176,0.0004919808,0.00003198911,0.00006224983,0.0001234287,0.008992659,0.9170201,0.06164758,0.0005383539,0.0007008643],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5683506,0.00002168058,0.4209811,0.008937588,0.00027355,0.0001806589,0.000002623963,0.0004627035,0.0007894853],"genre_scores_gemma":[0.775834,0.00002826197,0.2228776,0.001213153,0.00001051606,0.00001904729,0.000004410802,0.000008626393,0.000004431776],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4548019,"threshold_uncertainty_score":0.6324746,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2230831824","doi":"10.1109/jsac.2015.2504299","title":"Fast List Decoders for Polar Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure; McGill University","funders":"University of California, San Diego; École Polytechnique Fédérale de Lausanne; University of Illinois at Urbana-Champaign; Centre National de la Recherche Scientifique; Center for Advanced Study, University of Illinois at Urbana-Champaign; David and Lucile Packard Foundation; National Science Foundation","keywords":"Decoding methods; List decoding; Polar code; Sequential decoding; Concatenated error correction code; Low-density parity-check code; Berlekamp–Welch algorithm; Code (set theory)","retraction":null,"screen_n_in":null,"score":{"opus":0.0810445107494296,"gpt":0.3521803789829451,"spread":0.2711358682335155,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001170042,0.0001670284,0.0002210112,0.000438979,0.0003984554,0.0002845904,0.003542774,0.00009834051,0.000001851476],"category_scores_gemma":[0.001079987,0.0001650335,0.00007962241,0.001104891,0.00007812366,0.0004729631,0.0001982023,0.0008280028,0.00001171439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004051183,"about_ca_system_score_gemma":0.0004727675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001125222,"about_ca_topic_score_gemma":0.001227341,"domain_scores_codex":[0.998278,0.0004131753,0.0004586779,0.0002163427,0.0002948579,0.0003389011],"domain_scores_gemma":[0.9960898,0.0008643495,0.0002808466,0.001637029,0.0009171032,0.000210836],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005686888,0.007021355,0.07812066,0.00007255944,0.0005535024,0.0001004154,0.03567904,0.01003477,0.01812489,0.196888,0.4237226,0.2291135],"study_design_scores_gemma":[0.006057782,0.003173068,0.01131587,0.001447075,0.00009969748,0.002388598,0.00158438,0.6392524,0.02508356,0.1461467,0.1608031,0.002647755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02748116,0.00064788,0.9524078,0.01131473,0.0008559645,0.0005606882,0.00001906377,0.000772657,0.00594001],"genre_scores_gemma":[0.7531579,0.0001424755,0.2460009,0.0004620292,0.00006868357,0.00005272907,0.000007692927,0.00002061418,0.00008703273],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7256767,"threshold_uncertainty_score":0.6729872,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148727093","doi":"10.1162/neco.2009.05-08-785","title":"A Binary Variable Model for Affinity Propagation","year":2009,"lang":"en","type":"article","venue":"Neural Computation","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":138,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Affinity propagation; Cluster analysis; Graphical model; Computer science; Variable (mathematics); Binary number; Algorithm; Artificial intelligence; Theoretical computer science; Mathematics; Correlation clustering; Canopy clustering algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.04036854436624773,"gpt":0.3017541364138341,"spread":0.2613855920475864,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002342732,0.0001022394,0.00009905177,0.00009742085,0.0001465217,0.0001066283,0.0002928073,0.00005029379,3.912184e-7],"category_scores_gemma":[0.00007738981,0.0001036537,0.00003986628,0.0003095707,0.000008013216,0.0006321223,0.00004208508,0.00009464673,0.000003181797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005177613,"about_ca_system_score_gemma":0.00005148045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000467933,"about_ca_topic_score_gemma":0.000001221425,"domain_scores_codex":[0.9991586,0.00004293608,0.0001780304,0.0002884863,0.000158648,0.0001733144],"domain_scores_gemma":[0.9994069,0.0000878167,0.0001057515,0.0001871136,0.0001751601,0.00003730997],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004060688,0.0001667989,0.00005594167,0.000030908,0.000004096897,0.000002595261,0.0009329016,0.7337976,0.02544281,0.0554489,0.002830025,0.1812468],"study_design_scores_gemma":[0.0001459072,0.0002784794,0.0005530759,0.00001006554,0.000003015973,0.000006221815,0.000001932243,0.9193223,0.001949066,0.07760718,0.00001461559,0.000108143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05238274,0.000008895658,0.9447109,0.0009168138,0.0001726007,0.0004177035,9.78373e-7,0.0009886337,0.0004007346],"genre_scores_gemma":[0.6292813,3.072242e-7,0.3702531,0.0003714353,0.00002580729,0.00001755585,0.000007580001,0.000004240088,0.00003859079],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5768986,"threshold_uncertainty_score":0.4226874,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2171060285","doi":"10.1109/tsp.2011.2163630","title":"Delayed Stochastic Decoding of LDPC Codes","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":136,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Polytechnique Montréal","funders":"","keywords":"Decoding methods; Low-density parity-check code; Computer science; CMOS; Algorithm; Engineering; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04835232394564914,"gpt":0.2754522703981205,"spread":0.2270999464524713,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002930269,0.0001723525,0.0002044708,0.0002843815,0.0002394108,0.00005426614,0.0005941327,0.00008121046,0.00003372348],"category_scores_gemma":[0.000005720563,0.0001715384,0.00009069558,0.0005444851,0.00007635661,0.0005894314,0.000003976596,0.0002716878,0.00001121306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005148798,"about_ca_system_score_gemma":0.0001149936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005602231,"about_ca_topic_score_gemma":0.00002317626,"domain_scores_codex":[0.9987267,0.00005201666,0.0003349173,0.0003462639,0.0002795428,0.0002605843],"domain_scores_gemma":[0.9991722,0.0001203936,0.0001754763,0.0002839697,0.0001708312,0.00007715035],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001354738,0.0005178474,0.00002476761,0.0001243736,0.00006315096,0.00001706224,0.009331552,0.009982212,0.05145228,0.0006310047,0.0000313882,0.9276889],"study_design_scores_gemma":[0.0002320574,0.0003865327,0.00003146292,0.0003256843,0.00004013571,0.00005153542,0.0001462809,0.364667,0.6306224,0.003166516,0.000004248193,0.0003260475],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01302204,0.00005290224,0.985036,0.00001860753,0.0001623015,0.0001261222,0.000002144057,0.0006072479,0.0009726515],"genre_scores_gemma":[0.8662999,0.000001855666,0.1335636,0.00005028175,0.00001167736,0.00002061477,1.290717e-7,0.00001725473,0.00003466876],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9273629,"threshold_uncertainty_score":0.6995134,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138551264","doi":"10.1109/jssc.2008.925402","title":"Power Reduction Techniques for LDPC Decoders","year":2008,"lang":"en","type":"article","venue":"IEEE Journal of Solid-State Circuits","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":131,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Low-density parity-check code; CMOS; Parallel computing; Computer science; Decoding methods; Very-large-scale integration; Throughput; Overhead (engineering); Power (physics); Reduction (mathematics); Code (set theory); Subthreshold conduction; Computer hardware; Algorithm; Mathematics; Voltage; Embedded system; Electronic engineering; Transistor; Wireless; Electrical engineering; Telecommunications; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03228159806211426,"gpt":0.2982665878258631,"spread":0.2659849897637488,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009767604,0.0002237913,0.0003844594,0.0004763144,0.0002308372,0.00006725176,0.001051147,0.0001155566,0.000004757098],"category_scores_gemma":[0.0002145958,0.0002141283,0.0002659658,0.0003932835,0.0000997321,0.001185087,0.00004918787,0.0003826881,0.000006761966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002198968,"about_ca_system_score_gemma":0.0003004645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005629267,"about_ca_topic_score_gemma":0.000001717348,"domain_scores_codex":[0.9979542,0.00008479332,0.0007652354,0.0003009298,0.000470972,0.000423884],"domain_scores_gemma":[0.9975374,0.0001690907,0.0007827049,0.0004355956,0.0008984569,0.0001767676],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001145749,0.0007452376,0.0007967831,0.0001366255,0.0003320986,0.0007918585,0.0204322,0.001038812,0.5832995,0.001221324,0.1638362,0.2272548],"study_design_scores_gemma":[0.0006543364,0.001316869,0.0004227751,0.0002607401,0.00002479465,0.007898369,0.0001177956,0.00133041,0.9602675,0.01665516,0.0104691,0.000582094],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1381144,0.0001574653,0.8576684,0.0004226388,0.002243935,0.000304407,0.000004857372,0.0004095382,0.0006743705],"genre_scores_gemma":[0.9482428,0.0002349883,0.05075324,0.0001980626,0.0002589392,0.0000163505,3.682777e-7,0.00003641452,0.0002588269],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8101284,"threshold_uncertainty_score":0.87319,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1595640491","doi":"10.1007/978-1-4613-0165-3_5","title":"On the Effective Weights of Pseudocodewords for Codes Defined on Graphs with Cycles","year":2001,"lang":"en","type":"book-chapter","venue":"˜The œIMA volumes in mathematics and its applications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Binary Golay code; Mathematics; Code word; Decoding methods; Minimum weight; Additive white Gaussian noise; Hamming code; List decoding; Combinatorics; Tree (set theory); Discrete mathematics; Algorithm; Concatenated error correction code; Block code; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01605532437353184,"gpt":0.2547285427574361,"spread":0.2386732183839043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004721619,0.0003097741,0.0003836147,0.0001832387,0.0002544112,0.00007335247,0.0009521343,0.0001443694,0.000004888012],"category_scores_gemma":[0.00003751095,0.0001760584,0.0001032191,0.0001618678,0.0001707511,0.00004586307,0.0001354689,0.0003154848,0.000008006262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004175539,"about_ca_system_score_gemma":0.00003613345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007868931,"about_ca_topic_score_gemma":0.00009655356,"domain_scores_codex":[0.9987328,0.00002371255,0.0003669492,0.0004117445,0.0002768168,0.0001879634],"domain_scores_gemma":[0.9955281,0.002823602,0.0004330593,0.001015675,0.0001659641,0.0000335893],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007583754,0.00008025068,0.00000423325,0.00009496344,0.00003592594,3.39278e-7,0.0004241432,0.00000968209,0.00001713172,0.9917756,0.000398719,0.007151464],"study_design_scores_gemma":[0.0001395924,0.000263769,0.00002623894,0.0005534802,0.00004529886,0.00001167662,0.00002665781,0.02636482,0.0002352023,0.9672647,0.004835749,0.0002328793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002252224,0.0004677956,0.7793605,0.0009887436,0.00006119289,0.008266624,0.00008423726,0.0002946863,0.208224],"genre_scores_gemma":[0.6136901,0.001570595,0.3077931,0.0009113399,0.0002220086,0.0181214,0.00004546134,0.0004122391,0.05723378],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6114379,"threshold_uncertainty_score":0.7179452,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094676669","doi":"10.1109/tit.2012.2218792","title":"Polar Codes for Classical-Quantum Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"ExxonMobil Research and Engineering Company; Defense Advanced Research Projects Agency; École Polytechnique Fédérale de Lausanne; Ministère du Développement Économique, de l’Innovation et de l’Exportation","keywords":"Classical capacity; Computer science; Quantum capacity; Quantum channel; Polar code; Channel capacity; Channel (broadcasting); Quantum; Puncturing; Decoding methods; Algorithm; Mathematics; Topology (electrical circuits); Theoretical computer science; Quantum information; Telecommunications; Physics; Quantum mechanics; Quantum network; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01878489496873109,"gpt":0.2653956083520281,"spread":0.246610713383297,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009619805,0.0001512562,0.0001345481,0.0003002995,0.0003094068,0.0001272063,0.0004440196,0.0001081133,0.00002452293],"category_scores_gemma":[0.00003256016,0.0001423622,0.0001258037,0.0002786947,0.00004509562,0.003659806,0.000003019901,0.0002044279,0.0002149483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008472576,"about_ca_system_score_gemma":0.00003758336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004208441,"about_ca_topic_score_gemma":7.467821e-7,"domain_scores_codex":[0.9989319,0.00008674691,0.0003171764,0.0001098964,0.0002102688,0.0003439666],"domain_scores_gemma":[0.9988019,0.0004085378,0.0001303896,0.0004221515,0.000123888,0.0001130645],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001008244,0.0002383849,0.000006952313,0.00007241771,0.00005246254,1.614455e-7,0.008921013,0.001661938,0.0006203869,0.7509344,0.003240333,0.2341507],"study_design_scores_gemma":[0.001492417,0.0009007237,0.0001099444,0.0001695121,0.00008140411,0.00008925891,0.001166325,0.2827327,0.4793935,0.130557,0.1019105,0.001396744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001061636,0.00001486012,0.9932668,0.0003545583,0.002337741,0.0003845144,0.00002400826,0.0009962532,0.001559696],"genre_scores_gemma":[0.9737867,0.000007252514,0.02481359,0.00086407,0.00007133831,0.0002085212,0.000004170902,0.00001082885,0.0002336053],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.972725,"threshold_uncertainty_score":0.5805361,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148095386","doi":"10.1109/tcomm.2004.838718","title":"A More Accurate One-Dimensional Analysis and Design of Irregular LDPC Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Noisy-channel coding theorem; Additive white Gaussian noise; Gaussian; Mathematics; Computer science; Variable (mathematics); Turbo code; Limit (mathematics); Code (set theory); Range (aeronautics); Node (physics); Convergence (economics); Random variable; White noise; Statistics; Error floor","retraction":null,"screen_n_in":null,"score":{"opus":0.05692893816505234,"gpt":0.3093812915881105,"spread":0.2524523534230582,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003450289,0.0001432716,0.0002480489,0.0005126772,0.0003934817,0.00005250702,0.001294485,0.00007671348,0.000006664639],"category_scores_gemma":[0.00001411106,0.0001526362,0.0001275605,0.001512179,0.0002403173,0.0003158835,0.00002371923,0.0002778145,0.000005803736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006992793,"about_ca_system_score_gemma":0.0001103146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000318179,"about_ca_topic_score_gemma":0.0002869933,"domain_scores_codex":[0.9988183,0.0001904028,0.0003192711,0.0002759822,0.0002378764,0.0001581327],"domain_scores_gemma":[0.9968283,0.0004848834,0.0001416161,0.002279924,0.0001907174,0.00007455812],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008214979,0.003810234,0.0001732164,0.00005314358,0.002484527,0.000006668573,0.009080789,0.8250483,0.0747949,0.0332792,0.0001042844,0.05108256],"study_design_scores_gemma":[0.001126251,0.0005118674,0.00326579,0.0002575704,0.00115088,0.0000519063,0.0001966011,0.6472129,0.3211983,0.02407008,0.0001169184,0.0008409943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005852059,0.0001371554,0.9909405,0.00235324,0.00004656371,0.0002382655,0.00001492098,0.0003371521,0.00008022114],"genre_scores_gemma":[0.6166682,0.0001166187,0.3830569,0.00007296049,0.000001630542,0.00005110589,0.00000194181,0.000006950022,0.0000236849],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6108161,"threshold_uncertainty_score":0.6224324,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2750544224","doi":"10.1109/lcomm.2017.2740305","title":"Fast Successive-Cancellation Decoding of Polar Codes: Identification and Decoding of New Nodes","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; List decoding; Computer science; Sequential decoding; Berlekamp–Welch algorithm; Algorithm; Polar; Latency (audio); Arithmetic; Concatenated error correction code; Telecommunications; Block code; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0542195442835175,"gpt":0.3318252000715529,"spread":0.2776056557880354,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005144752,0.0001129255,0.0001949647,0.0001933179,0.0005365907,0.0002012352,0.00299754,0.00005119974,0.000001427733],"category_scores_gemma":[0.0002691293,0.0001289236,0.0000521761,0.000159837,0.0002617481,0.0009127675,0.0005148686,0.0001511636,0.000002102439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005233262,"about_ca_system_score_gemma":0.00005110519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008150893,"about_ca_topic_score_gemma":0.0002702028,"domain_scores_codex":[0.9989088,0.0001086194,0.0004378594,0.0002320523,0.0001748228,0.000137885],"domain_scores_gemma":[0.995321,0.0003414627,0.0009433668,0.003192792,0.0001532094,0.00004821967],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000005979035,0.00005711585,0.05661721,0.00006736277,0.00003915851,5.335526e-7,0.004086836,0.0001879994,0.8462846,0.008321307,0.001046162,0.08328568],"study_design_scores_gemma":[0.0007661801,0.00006150219,0.1149456,0.000868523,0.00007628842,0.00001792577,0.0003291309,0.2474891,0.6301877,0.0038888,0.0006701212,0.0006991779],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2985078,0.0002313392,0.695285,0.005141917,0.0001702193,0.0001587668,0.00000442752,0.0001042652,0.0003962304],"genre_scores_gemma":[0.8514653,0.0001832185,0.1482001,0.00008328118,0.00001717737,0.000008769618,0.000003623154,0.000009237982,0.00002930271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5529575,"threshold_uncertainty_score":0.5570225,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2614053718","doi":"10.23919/date.2017.7927069","title":"Energy efficient stochastic computing with Sobol sequences","year":2017,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Sobol sequence; Stochastic computing; Sequence (biology); Pseudorandom binary sequence; Computer science; Shift register; Pseudorandom number generator; Energy (signal processing); Algorithm; Efficient energy use; Computation; Binary number; Parallel computing; Mathematics; Arithmetic; Monte Carlo method; Statistics; Engineering; Telecommunications; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01880136315765332,"gpt":0.2680878117081027,"spread":0.2492864485504494,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002572119,0.0001390204,0.0001400812,0.00007265416,0.0006480477,0.0005092396,0.001837956,0.00003701069,0.000004821503],"category_scores_gemma":[0.000056536,0.000101903,0.00003219026,0.00009045144,0.0001174483,0.000227128,0.0005505912,0.00009890704,0.00001247392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003733992,"about_ca_system_score_gemma":0.00007296374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000650654,"about_ca_topic_score_gemma":0.0001449073,"domain_scores_codex":[0.9988541,0.00002835624,0.0001365543,0.0004029698,0.0002854246,0.0002925902],"domain_scores_gemma":[0.998439,0.00009624549,0.0001855248,0.001107504,0.00009719926,0.00007456273],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002202256,0.0002451483,0.003023756,0.00003188245,0.00006853824,0.0001959016,0.002848975,0.08345888,0.003251862,0.5454229,0.001485398,0.3599447],"study_design_scores_gemma":[0.0001393714,0.0001459611,0.000929978,0.00008272264,0.000004021947,0.00007538879,0.00003383543,0.9887688,0.007314212,0.002142785,0.00009632295,0.0002665934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03072674,0.00001518458,0.9554301,0.0004540864,0.0002629598,0.00006809182,1.396839e-7,0.0009013087,0.01214142],"genre_scores_gemma":[0.8719915,3.559958e-7,0.1275488,0.0001464627,0.00004272347,0.00000483566,1.50688e-7,0.000007875175,0.0002572577],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9053099,"threshold_uncertainty_score":0.4984324,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072100797","doi":"10.1109/lcomm.2013.021213.121633","title":"Increasing the Throughput of Polar Decoders","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":113,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Throughput; Decoding methods; Computer science; Algorithm; Polar; Sequential decoding; Error detection and correction; Telecommunications; Wireless; Block code","retraction":null,"screen_n_in":null,"score":{"opus":0.03240705621641109,"gpt":0.2830047920305757,"spread":0.2505977358141646,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005276391,0.0001006296,0.0001150128,0.00009022461,0.0003025023,0.0001066413,0.004763519,0.00003498587,0.000005343904],"category_scores_gemma":[0.0001224241,0.00008021966,0.00007026523,0.0004302812,0.0002726009,0.0005165646,0.0006167039,0.0002596235,0.00004863954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004836024,"about_ca_system_score_gemma":0.00003117192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00230308,"about_ca_topic_score_gemma":0.0000786061,"domain_scores_codex":[0.9988329,0.0003997929,0.000262612,0.0001570669,0.0001668769,0.0001807634],"domain_scores_gemma":[0.9949432,0.0008108054,0.000173796,0.003928918,0.0001114543,0.00003180355],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005483642,0.0003375402,0.03041721,0.00004025685,0.0001707755,0.000002029563,0.01593684,0.0003274723,0.7090913,0.04912522,0.1069217,0.08762419],"study_design_scores_gemma":[0.00187179,0.0003955623,0.1362838,0.0009468641,0.0001809826,0.0007015371,0.003043295,0.4754778,0.2312523,0.05692336,0.08908021,0.003842446],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3306759,0.0003207686,0.5845153,0.08044262,0.0002403458,0.0004411426,0.000001259572,0.0005412106,0.002821475],"genre_scores_gemma":[0.7550795,0.00003803184,0.2417114,0.003094342,0.00001155825,0.00004752975,9.932187e-7,0.00000844613,0.000008212854],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.477839,"threshold_uncertainty_score":0.8851883,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008209264","doi":"10.1109/tit.2012.2205663","title":"Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":105,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Tanner graph; Decoding methods; Computer science; Degree (music); Code (set theory); Graph; Set (abstract data type); Factor graph; Belief propagation; Error floor; Mathematics; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.018091293421844,"gpt":0.2731903225689815,"spread":0.2550990291471375,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001356799,0.0001331474,0.0001592313,0.0003889347,0.0002294752,0.00004325261,0.0003330924,0.00007841006,0.00001131016],"category_scores_gemma":[0.00002065721,0.0001257057,0.0001286447,0.000313176,0.00004414712,0.0009297507,0.00000307585,0.0001387407,0.00002199422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008215004,"about_ca_system_score_gemma":0.0000393111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004619081,"about_ca_topic_score_gemma":5.001916e-7,"domain_scores_codex":[0.9989141,0.00007200082,0.0004175959,0.00009854449,0.0002209549,0.0002768342],"domain_scores_gemma":[0.9988031,0.0004658248,0.0002237124,0.0003153601,0.0001257467,0.00006626434],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003204385,0.0001509839,0.000002573501,0.00007346152,0.00003372937,9.24413e-8,0.01239035,0.01241422,0.001074497,0.01639289,0.00009670442,0.9573385],"study_design_scores_gemma":[0.0004545592,0.0001456946,0.00004350014,0.0001165162,0.00002342236,0.00002038434,0.0007151364,0.5645738,0.4316196,0.001555006,0.0004867137,0.0002457339],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005831008,0.00001606889,0.9917361,0.00003573298,0.001020159,0.0004182025,0.00002902627,0.0002694865,0.0006442311],"genre_scores_gemma":[0.8571782,0.000003680587,0.1425661,0.00009301413,0.00001460758,0.0001065575,0.000001933239,0.000006882285,0.00002909387],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9570927,"threshold_uncertainty_score":0.5126131,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2554527937","doi":"10.1109/tcsi.2016.2619324","title":"A Fast Polar Code List Decoder Architecture Based on Sphere Decoding","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Polar code; Computer science; List decoding; Throughput; Polar; Algorithm; Error detection and correction; Code (set theory); Sequential decoding; Soft-decision decoder; Concatenated error correction code; Telecommunications; Block code; Set (abstract data type); Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.01595336298905812,"gpt":0.2303364820129234,"spread":0.2143831190238653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004510787,0.0003438136,0.0003413314,0.0002653487,0.0004299037,0.0002347616,0.0005524519,0.000197378,0.00003025755],"category_scores_gemma":[0.00002755601,0.000248703,0.0001695898,0.0003352621,0.0000945659,0.0002052887,0.000003784452,0.0002880589,0.00001919385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001641395,"about_ca_system_score_gemma":0.0001098344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001188305,"about_ca_topic_score_gemma":0.0003007859,"domain_scores_codex":[0.9976888,0.0002511147,0.0003573239,0.0007739226,0.0004783403,0.0004504524],"domain_scores_gemma":[0.9982071,0.0003781407,0.0001337104,0.000928212,0.00007792917,0.0002749387],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004570057,0.0002811608,0.0003253353,0.0002135959,0.0001400721,0.00009502645,0.001149858,0.01400172,0.1512327,0.002719614,0.0007227074,0.8290725],"study_design_scores_gemma":[0.01268391,0.006373975,0.002218737,0.01718628,0.0004709572,0.002771675,0.001820894,0.4824053,0.3520757,0.001872913,0.1106168,0.009502911],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009859732,0.0001003974,0.9839885,0.0008622976,0.00099273,0.0004186464,0.00004332169,0.0007329681,0.003001405],"genre_scores_gemma":[0.9961591,0.00002215012,0.002080746,0.0003682422,0.00006151485,0.00007233791,6.264247e-7,0.00004568009,0.001189559],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9862994,"threshold_uncertainty_score":0.9999965,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100525102","doi":"10.1109/tit.2009.2018350","title":"Braided Block Codes","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"National Aeronautics and Space Administration; National Science Foundation","keywords":"Block code; Concatenated error correction code; Linear code; Expander code; Computer science; Decoding methods; Serial concatenated convolutional codes; Convolutional code; Tornado code; Block (permutation group theory); Sequential decoding; Theoretical computer science; Algorithm; Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.009182243179655785,"gpt":0.2404326014872944,"spread":0.2312503583076386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004903253,0.000135053,0.0001118034,0.0003267001,0.0002266416,0.0001558955,0.000525316,0.00007948111,0.00002924097],"category_scores_gemma":[0.00001703283,0.0001313453,0.00008564612,0.0003994885,0.00002849785,0.00228911,0.000001398228,0.0002343467,0.0003220407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000065051,"about_ca_system_score_gemma":0.00004449879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005023741,"about_ca_topic_score_gemma":0.000002287358,"domain_scores_codex":[0.9990503,0.00008315925,0.0003068236,0.0001254023,0.0002424479,0.0001918532],"domain_scores_gemma":[0.9990649,0.0001596405,0.000108537,0.0004975764,0.0001042291,0.00006517967],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005636815,0.0001312368,0.000001697903,0.00001253652,0.0000211685,0.000001637162,0.004560221,0.007823833,0.0008632194,0.1685925,0.001565256,0.8163703],"study_design_scores_gemma":[0.001298317,0.001260098,0.0004734843,0.0001777594,0.00003850068,0.0002191609,0.0005275774,0.1153206,0.6442378,0.2247241,0.01048103,0.001241603],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002179663,0.000004897796,0.9806467,0.0005637471,0.0004706374,0.0001761866,0.00000381113,0.001460941,0.01449339],"genre_scores_gemma":[0.9769516,0.000008242445,0.02019461,0.002538383,0.00001368716,0.00001975181,0.000001071919,0.000004107558,0.0002685392],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9747719,"threshold_uncertainty_score":0.5356105,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2794935685","doi":"10.1109/tvlsi.2018.2812214","title":"Toward Energy-Efficient Stochastic Circuits Using Parallel Sobol Sequences","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Stochastic computing; Sobol sequence; Computer science; Parallel computing; Random number generation; Electronic circuit; Algorithm; Efficient energy use; Binary number; Computation; Pseudorandom number generator; Mathematics; Monte Carlo method; Arithmetic; Engineering; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04107774159824099,"gpt":0.277744882069191,"spread":0.23666714047095,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007352582,0.000427333,0.0004263234,0.0005636933,0.0007709105,0.000458168,0.0009416764,0.0002634978,0.00003121351],"category_scores_gemma":[0.00002413797,0.0003962029,0.0002301161,0.001005637,0.0001632324,0.0007009186,0.000009777355,0.0004130371,0.0001106414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004945837,"about_ca_system_score_gemma":0.0002402233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007220802,"about_ca_topic_score_gemma":0.0004979547,"domain_scores_codex":[0.9965594,0.0003582097,0.000744114,0.0008947377,0.0008122633,0.0006312086],"domain_scores_gemma":[0.9978437,0.0001839254,0.0003017115,0.000915472,0.0005573556,0.000197818],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001168196,0.001903595,0.00003216496,0.0001823016,0.0002905217,0.00006333121,0.02109242,0.8373386,0.07136745,0.02003462,0.001556198,0.04602195],"study_design_scores_gemma":[0.0002924754,0.0003044961,0.000007499521,0.000401992,0.00003206401,0.0001585786,0.0007630585,0.9627333,0.03439787,0.000232784,0.0002146245,0.0004612614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01572081,0.00008633168,0.9754093,0.0001090073,0.006289106,0.0005098537,0.00003396978,0.001244099,0.0005974809],"genre_scores_gemma":[0.9904293,0.000006652902,0.008475357,0.0001526763,0.0002773032,0.0001782964,0.000003914405,0.00004102335,0.0004354744],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9747085,"threshold_uncertainty_score":0.999849,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119604283","doi":"10.1109/tit.2013.2251395","title":"On the Girth of Quasi-Cyclic Protograph LDPC Codes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Girth (graph theory); Low-density parity-check code; Mathematics; Tanner graph; Combinatorics; Upper and lower bounds; Discrete mathematics; Odd graph; Base (topology); Degree (music); Graph; Decoding methods; Chordal graph; Algorithm; 1-planar graph; Error floor","retraction":null,"screen_n_in":null,"score":{"opus":0.009495993991673227,"gpt":0.2240988473380092,"spread":0.2146028533463359,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006909975,0.0001446618,0.0001293599,0.0003555777,0.0002312381,0.0001197861,0.0007056858,0.00007272594,0.000147378],"category_scores_gemma":[0.00003601498,0.0001009815,0.0001202496,0.0005295725,0.0001051793,0.001515968,0.000003494702,0.0002823229,0.0003316481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003354402,"about_ca_system_score_gemma":0.00003810453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005338656,"about_ca_topic_score_gemma":0.000005313957,"domain_scores_codex":[0.9988109,0.0001878662,0.0003889538,0.000117566,0.0003180985,0.000176563],"domain_scores_gemma":[0.9982134,0.0006677457,0.0002160152,0.0006888994,0.0001689706,0.00004496071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007167336,0.0003723988,0.00001672147,0.00007860008,0.00007375521,2.476553e-7,0.009581912,0.002975225,0.001115942,0.6077703,0.002105017,0.3758382],"study_design_scores_gemma":[0.0007944753,0.001710477,0.0006921522,0.0003688295,0.00003170237,0.00002890192,0.001901975,0.06820802,0.5706623,0.3531726,0.001639,0.000789565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01891744,0.000002740466,0.9723917,0.0004424506,0.0002958877,0.001046801,0.000005817163,0.0004806738,0.006416513],"genre_scores_gemma":[0.9941199,0.000007514696,0.004273445,0.0008406134,0.000006311333,0.0006385617,7.779039e-7,0.000006996162,0.000105899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9752024,"threshold_uncertainty_score":0.4262776,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123330494","doi":"10.1109/lcomm.2003.822499","title":"Improving Belief Propagation on Graphs With Cycles","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Belief propagation; Factor graph; Multiplicative function; Decoding methods; Computer science; Algorithm; Reliability (semiconductor); Offset (computer science); Random variable; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02229873940237453,"gpt":0.2611080439434295,"spread":0.2388093045410549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002329212,0.000141246,0.0001027794,0.0002170263,0.0003879826,0.000137558,0.002357282,0.00003863142,4.397702e-7],"category_scores_gemma":[0.00003220309,0.0001275122,0.00004275636,0.0005340705,0.000142032,0.0004536303,0.0002122039,0.0003091339,0.00002772042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001447033,"about_ca_system_score_gemma":0.0000567011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002369181,"about_ca_topic_score_gemma":0.0001495569,"domain_scores_codex":[0.9990095,0.00009321491,0.0001870742,0.0002803099,0.0002252809,0.0002046075],"domain_scores_gemma":[0.9967306,0.0001168421,0.0001517857,0.00287714,0.00007675595,0.00004693744],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003420102,0.0009592978,0.002373316,0.00005889422,0.00009281364,0.00002812667,0.007159437,0.008296469,0.4942489,0.3215764,0.002265655,0.1629065],"study_design_scores_gemma":[0.004450567,0.002388975,0.02056103,0.001928852,0.0001253135,0.0003984353,0.0004192519,0.05459465,0.8637539,0.04232391,0.005004081,0.004051046],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.160232,0.00003827712,0.8115985,0.02546448,0.0001270606,0.0003553176,9.515745e-7,0.001218587,0.0009648085],"genre_scores_gemma":[0.7353005,0.00001164545,0.2623764,0.00219205,0.00001178912,0.00008505536,0.000003050765,0.00001358508,0.000005964112],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5750685,"threshold_uncertainty_score":0.5199797,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071727855","doi":"10.1007/s11265-012-0685-3","title":"Hardware Implementation of Successive-Cancellation Decoders for Polar Codes","year":2012,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Coding (social sciences); Polar; Logarithm; Arithmetic; Algorithm; Coding theory; Theoretical computer science; Computer engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02961915339333666,"gpt":0.3307011821027505,"spread":0.3010820287094138,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001549408,0.0001196919,0.00029451,0.0002325045,0.0001240928,0.0001386269,0.0004454735,0.00006018448,0.000002800177],"category_scores_gemma":[0.00005108872,0.0001029667,0.00009886803,0.0002540572,0.00002462487,0.001730922,0.00003249002,0.0001167386,5.076065e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001255299,"about_ca_system_score_gemma":0.0002325282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007978729,"about_ca_topic_score_gemma":0.000007487356,"domain_scores_codex":[0.9983659,0.00009177988,0.0007579732,0.0001147602,0.0004271621,0.0002424391],"domain_scores_gemma":[0.9969262,0.000175231,0.001830877,0.00011333,0.0008698066,0.00008455214],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002409429,0.0004346285,0.2175147,0.005082189,0.0003402308,0.00001053342,0.03044173,0.005183844,0.2405975,0.007273211,0.008927325,0.4839533],"study_design_scores_gemma":[0.004712107,0.003120151,0.01257073,0.007407782,0.000444096,0.001038128,0.01847124,0.3085632,0.628756,0.003866968,0.009269617,0.001779973],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04156483,0.002520298,0.9549453,0.0001001216,0.000518137,0.0002239424,0.000004740354,0.00004905641,0.00007363295],"genre_scores_gemma":[0.9630845,0.000006455066,0.03652439,0.00001917015,0.0003206801,0.000008755395,0.000001399896,0.0000133578,0.00002126424],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9215197,"threshold_uncertainty_score":0.4198859,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985813166","doi":"10.1016/s0004-3702(02)00361-2","title":"Approximate inference in Boltzmann machines","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Belief propagation; Boltzmann constant; Inference; Boltzmann machine; Mathematics; Applied mathematics; Energy (signal processing); Boltzmann distribution; Statistical physics; Order (exchange); Mathematical optimization; Physics; Quantum mechanics; Algorithm; Computer science; Artificial intelligence; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.08489014672356088,"gpt":0.3214881698387175,"spread":0.2365980231151567,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004090358,0.0001829501,0.0001839474,0.0002460994,0.00009533291,0.000180444,0.00130247,0.00007866979,0.0001038219],"category_scores_gemma":[0.0005055718,0.0001820224,0.00005371639,0.0009545133,0.00007916403,0.000418383,0.0003101831,0.000286656,0.0005101363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005050382,"about_ca_system_score_gemma":0.00001470595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002714321,"about_ca_topic_score_gemma":0.0003950034,"domain_scores_codex":[0.9982949,0.00008340986,0.0004477435,0.0005091917,0.0002506095,0.0004141851],"domain_scores_gemma":[0.9987686,0.0002968838,0.00009694506,0.0006877548,0.00007486792,0.00007500857],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003583916,0.0001936209,0.002498191,0.0000123441,0.000003163578,0.00004803154,0.002808116,0.0006131789,0.002779621,0.2900946,0.0001483933,0.7007972],"study_design_scores_gemma":[0.000009530394,0.0000623563,0.0001896672,0.00003950902,0.00000124073,0.000008324891,0.00004211861,0.8127038,0.04102938,0.1453922,0.000266687,0.0002552496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03657854,0.0001708215,0.9544384,0.001058279,0.0004760947,0.0002164843,7.754959e-7,0.000653057,0.006407482],"genre_scores_gemma":[0.9570478,0.00004559886,0.04245543,0.0002316601,0.00004653596,0.00003480531,3.582179e-7,0.00001136011,0.0001265073],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9204692,"threshold_uncertainty_score":0.7422659,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2610741500","doi":"10.1109/wcncw.2017.7919044","title":"Fast Simplified Successive-Cancellation List Decoding of Polar Codes","year":2017,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Algorithm; Node (physics); Computer science; Polar; Polar code; List decoding; Set (abstract data type); Code (set theory); Error detection and correction; Word error rate; Sequential decoding; Concatenated error correction code; Block code; Physics; Speech recognition","retraction":null,"screen_n_in":null,"score":{"opus":0.02894424314882754,"gpt":0.3113803890463912,"spread":0.2824361458975637,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002932121,0.0000974509,0.0001525515,0.0000771593,0.0003353367,0.0002622568,0.001409693,0.00005213682,0.00001994848],"category_scores_gemma":[0.0002602215,0.00009059598,0.00004834126,0.00007769296,0.00006616353,0.0006932655,0.0003818822,0.00008668165,0.000007669862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003255687,"about_ca_system_score_gemma":0.00003988388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008790284,"about_ca_topic_score_gemma":0.000529372,"domain_scores_codex":[0.9991571,0.00002895596,0.0002051785,0.0002571899,0.0001818472,0.000169679],"domain_scores_gemma":[0.9983644,0.0001234655,0.0003443837,0.0009850524,0.0001376823,0.00004495071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002288505,0.0001220386,0.2812011,0.0001102914,0.00004431414,0.00001757662,0.00220566,0.0001504395,0.1474999,0.2856264,0.003747314,0.2792521],"study_design_scores_gemma":[0.0004049677,0.0001497294,0.04480351,0.000170206,0.00001090426,0.00001162101,0.00009395642,0.2562557,0.6831068,0.01332961,0.001114756,0.0005482441],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07906436,0.00002259773,0.8780069,0.0004936358,0.0002950913,0.0001043339,0.000001629384,0.0003703898,0.0416411],"genre_scores_gemma":[0.9208344,0.000005918114,0.07856216,0.00004980094,0.00003533332,0.000003314119,7.108573e-7,0.00000657131,0.0005018514],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.84177,"threshold_uncertainty_score":0.3694397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163750149","doi":"10.1109/tit.2005.856934","title":"Analysis of Low-Density Parity-Check Codes for the Gilbert–Elliott Channel","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Low-density parity-check code; Decoding methods; List decoding; Algorithm; Sequential decoding; Channel (broadcasting); Computer science; Concatenated error correction code; Theoretical computer science; Mathematics; Telecommunications; Block code","retraction":null,"screen_n_in":null,"score":{"opus":0.01269385825656941,"gpt":0.252619449542173,"spread":0.2399255912856036,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001217686,0.0001394795,0.0002191132,0.0005619123,0.00032145,0.00008446754,0.0006283661,0.00008953508,0.00002412165],"category_scores_gemma":[0.0000375473,0.0001104831,0.0002929816,0.001040126,0.00007927337,0.001273261,0.000004510103,0.0001910451,0.00002718666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007021743,"about_ca_system_score_gemma":0.00004232119,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003508911,"about_ca_topic_score_gemma":0.0001109205,"domain_scores_codex":[0.9988759,0.00008998458,0.0004502766,0.000140057,0.0002586324,0.0001851441],"domain_scores_gemma":[0.9978101,0.0009850021,0.0002462943,0.0006563226,0.0002582153,0.00004412905],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002520145,0.0003430057,0.00002354991,0.0001108486,0.001353186,2.154361e-7,0.01951444,0.465844,0.0003929099,0.07259789,0.0007871451,0.4387808],"study_design_scores_gemma":[0.0002586212,0.00009429632,0.0002698878,0.00002649013,0.0003364337,0.000003480206,0.0003939269,0.8739467,0.1195116,0.003803767,0.001138609,0.0002162323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003504484,0.00001375763,0.9942175,0.0005343502,0.0003103364,0.0003475907,0.00002897857,0.0003127385,0.0007303309],"genre_scores_gemma":[0.9881947,0.00003079333,0.01084111,0.0006390118,0.00001893069,0.00008614777,0.000004405513,0.000005734818,0.0001791403],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9846902,"threshold_uncertainty_score":0.4505372,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2299446443","doi":"10.1109/tit.2016.2523979","title":"Efficient Search of Girth-Optimal QC-LDPC Codes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Girth (graph theory); Mathematics; Tanner graph; Block code; Concatenated error correction code; Combinatorics; Discrete mathematics; Block (permutation group theory); Upper and lower bounds; Linear code; Decoding methods; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01162905658006248,"gpt":0.2484669592249792,"spread":0.2368379026449167,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009518401,0.0001289254,0.0001373307,0.0004223849,0.0001445539,0.00004654984,0.0005553697,0.00007852252,0.0000818784],"category_scores_gemma":[0.00002309044,0.00009503371,0.0001019126,0.0003728168,0.0001132747,0.0007374388,0.000005904138,0.0001521876,0.0002294448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009140583,"about_ca_system_score_gemma":0.00008268187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001081103,"about_ca_topic_score_gemma":0.000001739818,"domain_scores_codex":[0.9987284,0.0001350693,0.0003949876,0.0001388823,0.0003841553,0.0002185173],"domain_scores_gemma":[0.9986053,0.0004403791,0.0001317038,0.0005366064,0.0002202308,0.00006578312],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001892271,0.0002334549,0.00001209391,0.0000716655,0.00005461121,0.000001151048,0.008250663,0.07547378,0.009380896,0.1095685,0.0002577252,0.7965062],"study_design_scores_gemma":[0.0006491084,0.0003862355,0.0001378551,0.0001839904,0.00001275622,0.0000266166,0.0003474156,0.08355824,0.9113414,0.002509744,0.0005264143,0.0003201884],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03879605,0.000004099079,0.9573976,0.0002002286,0.0004093439,0.00019839,0.00002138829,0.000494021,0.00247882],"genre_scores_gemma":[0.9795384,0.00000802049,0.02010359,0.0001114723,0.000008510087,0.00003139638,4.870152e-7,0.000006513593,0.0001916265],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9407423,"threshold_uncertainty_score":0.3875362,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114074598","doi":"10.1109/tit.2010.2048448","title":"On the Dynamics of the Error Floor Behavior in (Regular) LDPC Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Algorithm; Decoding methods; Bit error rate; Code (set theory); Computer science; Turbo code; Concatenated error correction code; Iterative method; Topology (electrical circuits); Mathematics; Block code; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.008429924930415729,"gpt":0.2361899961375481,"spread":0.2277600712071324,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009635881,0.0001291573,0.0001083787,0.000232622,0.0002145315,0.00006153127,0.001021247,0.0001079728,0.00005308783],"category_scores_gemma":[0.00005756085,0.00008180035,0.0001101639,0.0004985972,0.0001398124,0.0007170724,0.000007101924,0.0006512855,0.00004316324],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006869868,"about_ca_system_score_gemma":0.00006921556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003754684,"about_ca_topic_score_gemma":0.0003255092,"domain_scores_codex":[0.9989201,0.0001511356,0.0003603674,0.0001081395,0.000304033,0.0001562419],"domain_scores_gemma":[0.9984573,0.0003802292,0.0001819755,0.0008542323,0.00009921892,0.00002704052],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007566909,0.0002949948,0.00006655923,0.00002697252,0.00001760714,6.308376e-7,0.005885262,0.006147987,0.001957944,0.8271689,0.0001553831,0.1582021],"study_design_scores_gemma":[0.0009990849,0.0004657567,0.00811864,0.0002468249,0.00006241548,0.00006975751,0.002130081,0.4324656,0.4518926,0.102432,0.0003539862,0.0007632422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2272339,8.21231e-7,0.7691649,0.0006707147,0.00100008,0.0003938508,0.00001705777,0.0001668934,0.001351757],"genre_scores_gemma":[0.99686,0.000001502985,0.0023846,0.0004682112,0.000005883177,0.0001377547,0.000001029441,0.000006980064,0.0001340372],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7696261,"threshold_uncertainty_score":0.3335721,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114997074","doi":"10.1109/acssc.2005.1599845","title":"Stochastic Implementation of LDPC Decoders","year":2006,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; McGill University","funders":"","keywords":"Stratix; Computer science; Low-density parity-check code; Field-programmable gate array; Decoding methods; Factor graph; Throughput; WiMAX; Soft-decision decoder; Forward error correction; Parallel computing; Algorithm; Computer hardware; Wireless; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.009162287173892447,"gpt":0.2878477871638672,"spread":0.2786854999899748,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000123634,0.00004949307,0.00006028892,0.00007684353,0.00002411059,0.0000188297,0.0002834164,0.00001621787,0.00002766065],"category_scores_gemma":[0.000006828681,0.00004700976,0.00002555358,0.0001771332,0.00001229052,0.0001710551,0.00007074944,0.00002847602,0.000007294034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002135566,"about_ca_system_score_gemma":0.00002735119,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001255417,"about_ca_topic_score_gemma":0.0005820015,"domain_scores_codex":[0.999469,0.00001446832,0.0001541513,0.0001305134,0.0001251898,0.0001066829],"domain_scores_gemma":[0.9996086,0.00004397452,0.00006668916,0.0002182289,0.00004915049,0.00001332046],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000004865845,0.0001518774,0.01655948,0.00003306427,0.00002042279,0.00000516278,0.001341214,0.001890813,0.03746189,0.6964691,0.02649392,0.2195682],"study_design_scores_gemma":[0.0009227371,0.000466298,0.05952386,0.00004133375,0.00001988551,0.00003662865,0.0006897407,0.1412685,0.653066,0.1427542,0.0005049132,0.0007059231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05339454,0.00000853928,0.9425578,0.0001475766,0.0000820005,0.000082925,2.986408e-7,0.0003355613,0.003390731],"genre_scores_gemma":[0.8506283,1.663512e-7,0.1492216,0.00004148837,0.00001025689,0.000005629509,7.400248e-7,0.000002976388,0.00008886208],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7972337,"threshold_uncertainty_score":0.1917002,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2772435313","doi":"10.1109/wcncw.2018.8368991","title":"Improved successive cancellation flip decoding of polar codes based on error distribution","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Algorithm; Error detection and correction; Sorting; Code word; List decoding; Index selection; Block Error Rate; Bit error rate; Selection (genetic algorithm); Block code; Concatenated error correction code; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02431425572408844,"gpt":0.3005457492957231,"spread":0.2762314935716347,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006858892,0.0003262868,0.0003975897,0.0002040601,0.0001260624,0.0001413515,0.001312421,0.000343565,0.00003161416],"category_scores_gemma":[0.0004038074,0.0003117712,0.00016269,0.0002990396,0.00008183315,0.0001846535,0.0007872009,0.000452376,0.000008066941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004238457,"about_ca_system_score_gemma":0.0003796318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001288743,"about_ca_topic_score_gemma":0.000327025,"domain_scores_codex":[0.9978198,0.0001583762,0.0005064753,0.0008100612,0.0004000845,0.0003052354],"domain_scores_gemma":[0.9970204,0.0003184491,0.0007630658,0.001268131,0.0005519087,0.00007809795],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00159596,0.00375223,0.09749325,0.006394939,0.0009741683,0.0001044227,0.009819751,0.07766092,0.2303093,0.1183808,0.06667313,0.3868411],"study_design_scores_gemma":[0.000125096,0.0001690755,0.0008297591,0.0003438495,0.00001229512,5.888176e-7,0.000008340919,0.8428175,0.1537992,0.001511193,0.0000806453,0.0003024432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02918801,0.0000251651,0.9661196,0.0003617871,0.001103116,0.0005227528,0.00007492746,0.0008349374,0.001769684],"genre_scores_gemma":[0.8968953,0.000004110704,0.1026181,0.00009244883,0.0001071506,0.00004209144,0.000137233,0.00001842978,0.000085174],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8677073,"threshold_uncertainty_score":0.9999334,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2182209980","doi":"10.1109/tcomm.2015.2477082","title":"An Incremental Redundancy Hybrid ARQ Scheme via Puncturing and Extending of Polar Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Puncturing; Hybrid automatic repeat request; Algorithm; Computer science; Automatic repeat request; Redundancy (engineering); Polar code; Polar; Coding (social sciences); Error detection and correction; Decoding methods; Forward error correction; Mathematics; Transmission (telecommunications); Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.05324886164437508,"gpt":0.3161911413478035,"spread":0.2629422797034284,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005090541,0.0001487532,0.0001744289,0.0002547102,0.0003845187,0.00008152509,0.001494904,0.00004639185,0.000003748449],"category_scores_gemma":[0.00001517906,0.0001593299,0.00005437901,0.0003193282,0.0001688213,0.000737402,0.0000321277,0.0003419122,0.000005527535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001057048,"about_ca_system_score_gemma":0.00007186153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004218616,"about_ca_topic_score_gemma":0.0002200859,"domain_scores_codex":[0.9988275,0.0002031079,0.0003045023,0.0002621219,0.0002245123,0.0001782507],"domain_scores_gemma":[0.9972454,0.0001649182,0.0001282746,0.002174996,0.0001434729,0.0001429583],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001053703,0.004191354,0.002592797,0.000122853,0.0003307648,0.00001302899,0.01477871,0.001896773,0.5280102,0.02700143,0.0004761942,0.4204805],"study_design_scores_gemma":[0.000800484,0.0007258994,0.0007437165,0.0002313194,0.00005516246,0.0002317514,0.0005841727,0.259848,0.7248945,0.01020604,0.0009971189,0.0006818438],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05629507,0.0002390549,0.9414684,0.0004637111,0.00016223,0.0001886251,0.00001402128,0.0004788112,0.0006900522],"genre_scores_gemma":[0.7380178,0.00008861963,0.2617803,0.00003924987,0.000006869087,0.00003321008,0.000003146311,0.00001275128,0.00001806641],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6817228,"threshold_uncertainty_score":0.6497285,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044607510","doi":"10.1109/tcomm.2005.861668","title":"Dynamics and performance analysis of analog iterative decoding for low-density parity-check (LDPC) codes","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Asynchronous communication; Successive over-relaxation; Belief propagation; Relaxation (psychology); Mathematics; Computer science; Iterative method; Gaussian; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02492340874859349,"gpt":0.2895366205965194,"spread":0.2646132118479259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003536148,0.0001377101,0.0002808115,0.0004946687,0.0005988305,0.00007482796,0.0008883109,0.00007546888,0.000002099123],"category_scores_gemma":[0.00001223536,0.0001501656,0.0001499675,0.001197011,0.0001633293,0.0003377365,0.00001827972,0.0002337148,8.952601e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001065578,"about_ca_system_score_gemma":0.00004096347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003493376,"about_ca_topic_score_gemma":0.007240614,"domain_scores_codex":[0.9989824,0.0001118117,0.0003533153,0.0002592528,0.0001290987,0.0001641139],"domain_scores_gemma":[0.997299,0.0007396919,0.0001731399,0.001480423,0.0002687325,0.00003904454],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002789449,0.006462052,0.0659586,0.0005325764,0.004545782,0.000003437448,0.01293385,0.1160896,0.01705622,0.3842964,0.0005517309,0.3912908],"study_design_scores_gemma":[0.0001218941,0.00008706192,0.007404503,0.0000383167,0.0002365317,0.00000259754,0.0000437548,0.9761401,0.01454959,0.001210787,0.00001304616,0.0001518059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1332174,0.00004062889,0.8652984,0.0005098433,0.00005309313,0.0002135661,0.00005689341,0.0001951112,0.0004150601],"genre_scores_gemma":[0.8177111,0.000130641,0.1819419,0.00003420196,0.000003477194,0.00007009423,0.00001914545,0.000007528542,0.00008192578],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8600504,"threshold_uncertainty_score":0.6123577,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3208657910","doi":"10.1109/tvlsi.2022.3153605","title":"High-Throughput and Energy-Efficient VLSI Architecture for Ordered Reliability Bits GRAND","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Decoding methods; Code word; Code (set theory); Latency (audio); Code rate; Throughput; Algorithm; Parallel computing; Computer engineering; Wireless; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01031769425105502,"gpt":0.2336148887118031,"spread":0.2232971944607481,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001160247,0.000383959,0.0004579852,0.0004280249,0.001258094,0.0002686956,0.0006569368,0.0001648254,0.00002064357],"category_scores_gemma":[0.00003391377,0.0003592487,0.0002296286,0.0008595667,0.00007732811,0.0003047096,0.00002148863,0.0006021128,0.00000439768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003796408,"about_ca_system_score_gemma":0.0001283528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006137872,"about_ca_topic_score_gemma":0.0008225232,"domain_scores_codex":[0.9965828,0.000546483,0.0006814579,0.001032059,0.0006668756,0.0004903443],"domain_scores_gemma":[0.9979073,0.0004395067,0.0002462777,0.0009744642,0.0002883549,0.0001440817],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008404796,0.003038716,0.00007124,0.0004266524,0.0002141217,0.00002215247,0.01304262,0.850485,0.01596251,0.01700107,0.008525762,0.09036972],"study_design_scores_gemma":[0.002010392,0.001632356,0.00005728824,0.0002108475,0.00007062007,0.0001743772,0.001171645,0.9122598,0.05312929,0.001787518,0.0265089,0.0009869899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03909138,0.000120072,0.9534881,0.0006518039,0.004400669,0.0009014436,0.0002749571,0.0009343918,0.0001372032],"genre_scores_gemma":[0.9833176,0.00001496062,0.01417022,0.0002028966,0.00008622857,0.001086857,0.00002530616,0.00004383269,0.001052171],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9442261,"threshold_uncertainty_score":0.999886,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157927886","doi":"10.1109/tit.2014.2334657","title":"On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Coding (social sciences); Computer science; Node (physics); Variable (mathematics); Set (abstract data type); Characterization (materials science); Tanner graph; Graph; Class (philosophy); Simple (philosophy); Code (set theory); Discrete mathematics; Combinatorics; Decoding methods; Mathematics; Theoretical computer science; Algorithm; Error floor; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.006652840438808025,"gpt":0.2176007685741675,"spread":0.2109479281353595,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009543938,0.0001287584,0.0001779885,0.0004239775,0.0001042369,0.00002829942,0.0003753259,0.00007458586,0.00004501166],"category_scores_gemma":[0.00002076068,0.000129607,0.00007119749,0.000393558,0.00004804303,0.001319395,0.000002911942,0.0001425921,0.00001382234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004345967,"about_ca_system_score_gemma":0.00003766779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001067386,"about_ca_topic_score_gemma":8.712541e-7,"domain_scores_codex":[0.9987569,0.000172685,0.0005270225,0.0001180717,0.0002911155,0.0001341359],"domain_scores_gemma":[0.9987441,0.0002599057,0.000359724,0.0004487077,0.00015213,0.0000354296],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002176873,0.0003332855,0.00001429042,0.0003164707,0.0001079665,1.77807e-7,0.006987732,0.01969649,0.1065348,0.4121604,0.0000857214,0.453545],"study_design_scores_gemma":[0.0004500146,0.0004628031,0.00023421,0.0002498607,0.00002288558,0.000005125704,0.0001169275,0.09054017,0.8864021,0.02100164,0.000295874,0.0002184052],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05388786,8.202049e-7,0.9436823,0.00005373625,0.0003648344,0.0002195704,0.00002599147,0.0002318008,0.001533125],"genre_scores_gemma":[0.9840318,0.0000056971,0.01551451,0.0003645541,0.000007055994,0.00002924911,0.00001564193,0.000007050049,0.00002445136],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.930144,"threshold_uncertainty_score":0.5285221,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2518374686","doi":"10.1109/isit.2016.7541412","title":"Simplified Successive-Cancellation List decoding of polar codes","year":2016,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Polar code; Computer science; Algorithm; List decoding; Code (set theory); Polar; Computational complexity theory; Error detection and correction; Theoretical computer science; Concatenated error correction code; Block code","retraction":null,"screen_n_in":null,"score":{"opus":0.0190146752604304,"gpt":0.2736983518369704,"spread":0.25468367657654,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002568175,0.00008285351,0.0001217716,0.00009662454,0.00005460535,0.00003529282,0.000569174,0.00004359594,0.00004238581],"category_scores_gemma":[0.0001734867,0.00005608717,0.00004016234,0.0002183542,0.00003650247,0.0004168549,0.0001588402,0.00003862963,0.0000123682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004527172,"about_ca_system_score_gemma":0.00003670789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001690678,"about_ca_topic_score_gemma":0.0001319608,"domain_scores_codex":[0.9991993,0.00004070442,0.0002077678,0.0002302731,0.0001639108,0.0001580817],"domain_scores_gemma":[0.9989399,0.0003453176,0.0001451236,0.0004084768,0.0001212914,0.00003983596],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001137721,0.00004631779,0.05794609,0.00002833819,0.00001601191,0.00000393475,0.0004875328,0.00000902015,0.4937896,0.2233274,0.002753957,0.2215804],"study_design_scores_gemma":[0.0002507065,0.00009772331,0.003771791,0.0001291738,0.000003900927,0.000005866638,0.00002068044,0.01389616,0.9657813,0.0144479,0.001335205,0.0002596444],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05485003,0.00002526341,0.9333725,0.0006927061,0.0001592169,0.00007612124,0.000001326671,0.0004739412,0.01034888],"genre_scores_gemma":[0.9274634,0.000008864048,0.07184834,0.00006931765,0.00002414389,0.000003453992,2.562827e-7,0.000005879932,0.0005764146],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8726133,"threshold_uncertainty_score":0.2287168,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2886581636","doi":"10.1109/tcomm.2018.2873322","title":"Improved Bit-Flipping Algorithm for Successive Cancellation Decoding of Polar Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Algorithm; Decoding methods; Computer science; Error detection and correction; Bit error rate; Sorting; List decoding; Code (set theory); Concatenated error correction code; Block code","retraction":null,"screen_n_in":null,"score":{"opus":0.03909433696062872,"gpt":0.3243455029031874,"spread":0.2852511659425587,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003579699,0.0001425751,0.0001866919,0.0002843518,0.0007648907,0.00006641249,0.001641721,0.00008848623,0.00000715066],"category_scores_gemma":[0.00003098426,0.0001580776,0.0001174043,0.0006110684,0.0001936541,0.0004140661,0.00001811916,0.000217925,0.000004832739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001233296,"about_ca_system_score_gemma":0.0001255633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004451046,"about_ca_topic_score_gemma":0.001176526,"domain_scores_codex":[0.9988911,0.0001132835,0.0003731707,0.0002716831,0.0001356659,0.0002150753],"domain_scores_gemma":[0.9964786,0.0008303788,0.0002485354,0.001851723,0.0005346891,0.00005604045],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001759746,0.0003970067,0.00002824693,0.00003480743,0.0001130278,1.915492e-7,0.003426788,0.000309377,0.07029929,0.005547381,0.000204705,0.9196216],"study_design_scores_gemma":[0.0002076419,0.0002020417,0.00001743411,0.00007572523,0.00002155042,0.000003170693,0.0000729653,0.7727808,0.2245781,0.001171447,0.0007046523,0.0001644736],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006019868,0.0000827707,0.9966458,0.0007450001,0.0004286408,0.0004630148,0.000052297,0.0004230909,0.000557372],"genre_scores_gemma":[0.5533812,0.00005710613,0.4462875,0.00005364887,0.00002146191,0.0001104042,0.000003175868,0.00001192584,0.00007354554],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9194571,"threshold_uncertainty_score":0.6446219,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998929580","doi":"10.1109/tcomm.2009.11.070095","title":"On the design of raptor codes for binary-input gaussian channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Raptor code; Computer science; EXIT chart; Additive white Gaussian noise; Binary number; Channel (broadcasting); Forward error correction; Decoding methods; Turbo code; Code (set theory); Algorithm; Binary code; Telecommunications; Concatenated error correction code; Block code; Mathematics; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.07119583108889162,"gpt":0.3137383782324997,"spread":0.2425425471436081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005943779,0.0001561019,0.0001726124,0.0002167481,0.0006853346,0.00006456183,0.002727019,0.00007566762,0.00000875469],"category_scores_gemma":[0.00003930334,0.0001247046,0.0001422124,0.0005485393,0.000120153,0.0001847507,0.000007442434,0.0003093606,0.00001337236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005852634,"about_ca_system_score_gemma":0.000074757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000189473,"about_ca_topic_score_gemma":0.00001354946,"domain_scores_codex":[0.998797,0.0003012631,0.0002906918,0.0002309246,0.0001786008,0.0002014914],"domain_scores_gemma":[0.9944778,0.002197906,0.0001399817,0.002986867,0.0001475928,0.000049832],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002468825,0.00505327,0.000002517605,0.00003703921,0.0002292482,0.000001617858,0.008778759,0.08422633,0.05824618,0.6443351,0.01584717,0.1829959],"study_design_scores_gemma":[0.0005805841,0.00268453,0.00005535831,0.0002854382,0.00006279303,0.00001307386,0.0001691744,0.6453986,0.2786276,0.0692944,0.002312392,0.0005160683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003267097,0.00004833317,0.9818938,0.0154931,0.0002183583,0.0008091325,0.00001500501,0.0004265072,0.0007690534],"genre_scores_gemma":[0.850339,0.0001037752,0.1485383,0.0005386937,0.000009178802,0.0002753675,0.000001351868,0.00001164172,0.0001827255],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8500123,"threshold_uncertainty_score":0.5271109,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}