{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Frank R. Kschischang","is_ca":true},{"name":"Brendan J. Frey","is_ca":true},{"name":"Hans‐Andrea Loeliger","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003043899,0.001295874,0.001458846,0.001678607,0.00109545,0.003183152,0.002040282,0.00182779,0.00738229],"category_scores_gemma":[0.01394931,0.0007057065,0.0009741696,0.002960234,0.002473048,0.005633563,0.002368048,0.002313171,0.003803039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001256058,"about_ca_system_score_gemma":0.002159284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003172921,"about_ca_topic_score_gemma":0.002229479,"domain_scores_codex":[0.997072,0.001054419,0.0001688919,0.0006072461,0.0008649807,0.0002324637],"domain_scores_gemma":[0.9956335,0.00229622,0.0002382324,0.0008349615,0.0008853856,0.000111637],"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.0001178716,0.00003598303,0.0003748299,0.0001483916,0.00006952719,0.00007192136,0.000122709,0.1788648,0.0009597513,0.5479689,0.007687894,0.2635775],"study_design_scores_gemma":[0.0000296234,0.00003263456,0.0000799605,0.00002784639,0.00002289859,0.00008280014,0.00002435248,0.4300573,0.001411874,0.555389,0.01281496,0.00002676807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001375328,0.0003001151,0.9946397,0.0001874156,0.00004641951,0.00003241241,0.00005070804,0.0003384231,0.003029471],"genre_scores_gemma":[0.09721451,0.00145442,0.8899047,0.0003530001,0.0002129934,0.00026434,0.0005011199,0.000381355,0.009713559],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00738229,"threshold_uncertainty_score":0.02469629,"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","authors":[{"name":"Hans‐Andrea Loeliger","is_ca":false},{"name":"Justin Dauwels","is_ca":false},{"name":"Junli Hu","is_ca":false},{"name":"S. Korl","is_ca":false},{"name":"Li Ping","is_ca":false},{"name":"Frank R. Kschischang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067789,0.000930282,0.0006842092,0.001307336,0.0004173464,0.001810669,0.001384957,0.001187605,0.007157364],"category_scores_gemma":[0.002545787,0.0005071601,0.0008825752,0.001794072,0.001183272,0.001683464,0.0009945793,0.00184333,0.00343831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008722017,"about_ca_system_score_gemma":0.0008658304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004379625,"about_ca_topic_score_gemma":0.003344747,"domain_scores_codex":[0.9992895,0.00025937,0.00003215412,0.0001503177,0.0002279206,0.00004076112],"domain_scores_gemma":[0.9992374,0.0003935888,0.00005745967,0.0001569417,0.0001288989,0.00002581369],"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.0000335626,0.00002672773,0.0001907896,0.0002099682,0.00008476608,0.0001249576,0.000101067,0.1786578,0.002471064,0.6483692,0.01064469,0.1590852],"study_design_scores_gemma":[0.000009943567,0.00003345262,0.0001468828,0.00004087257,0.00002638257,0.0001114053,0.0000189139,0.443821,0.001257993,0.5142866,0.04022148,0.0000250331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000343202,0.0006835636,0.9948052,0.0002875164,0.00005444099,0.00001143229,0.00006600969,0.0003042185,0.003444419],"genre_scores_gemma":[0.1461136,0.007504604,0.8224028,0.0007266899,0.0007892388,0.0002037738,0.0007495677,0.0005761593,0.02093351],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007157364,"threshold_uncertainty_score":0.02394372,"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","authors":[{"name":"Amin Alamdar-Yazdi","is_ca":true},{"name":"Frank R. Kschischang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004064586,0.0007134189,0.0006582123,0.0005419563,0.0004883419,0.0009037564,0.00101648,0.0005206284,0.004024907],"category_scores_gemma":[0.001558627,0.0002956539,0.0004989547,0.0005651246,0.0005087136,0.0008871285,0.0008868364,0.001495623,0.0034789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004492599,"about_ca_system_score_gemma":0.001852763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002070561,"about_ca_topic_score_gemma":0.004076391,"domain_scores_codex":[0.9994055,0.00007543015,0.00003308947,0.00007044904,0.0003657884,0.00004975563],"domain_scores_gemma":[0.9993144,0.000134292,0.00004589571,0.0001816388,0.0002885067,0.00003521811],"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.0007531113,0.0001067855,0.0006270917,0.0005268406,0.00008822923,0.0007581007,0.000188923,0.1185872,0.3030799,0.1617576,0.01295993,0.4005663],"study_design_scores_gemma":[0.0001589245,0.0003078239,0.0004833145,0.00008351642,0.0001071341,0.001938127,0.00005101242,0.6633887,0.2192892,0.04206871,0.07195946,0.0001640988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004932541,0.0001978071,0.987484,0.000122155,0.0001551323,0.0001073945,0.0002245785,0.0008659079,0.005910379],"genre_scores_gemma":[0.1486066,0.00108315,0.8304265,0.0003916879,0.0002034105,0.0002576625,0.001161543,0.000234246,0.01763529],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004024907,"threshold_uncertainty_score":0.01346463,"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","authors":[{"name":"H. El Gamal","is_ca":false},{"name":"A. Roger Hammons","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008974248,0.000460157,0.0004944939,0.0006636518,0.0002892138,0.0005793726,0.0005775853,0.0006814883,0.00101588],"category_scores_gemma":[0.004275004,0.0002412332,0.0005589075,0.0008086983,0.00103044,0.001128618,0.0005846714,0.0006978113,0.0005105535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008837015,"about_ca_system_score_gemma":0.001329369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004154304,"about_ca_topic_score_gemma":0.002766284,"domain_scores_codex":[0.9995197,0.0001342989,0.00001560343,0.00005647054,0.0002098423,0.00006406137],"domain_scores_gemma":[0.9986101,0.0007577455,0.0001251706,0.000149353,0.0003239152,0.00003374037],"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.00005623142,0.00001413237,0.0009117822,0.00003974349,0.00002988822,0.0001563671,0.00008775508,0.7841398,0.004528395,0.1929512,0.0008062957,0.01627837],"study_design_scores_gemma":[0.000001858013,0.00001019614,0.0001116371,0.000002931577,0.00000329751,0.00003021295,0.000005192681,0.9768037,0.001023027,0.02167308,0.0003299151,0.000005105434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02056622,0.0002127082,0.9760666,0.0001153431,0.00002006772,0.00001120603,0.00005387811,0.0001685961,0.002785378],"genre_scores_gemma":[0.8294364,0.001244972,0.1624337,0.0002010587,0.00009842005,0.00008929138,0.0002040056,0.0001438099,0.006148453],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004154304,"threshold_uncertainty_score":0.00826025,"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","authors":[{"name":"J. Zhao","is_ca":true},{"name":"F. Zarkeshvari","is_ca":true},{"name":"Amir H. Banihashemi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001479641,0.000833365,0.0005988985,0.0004985383,0.0004554346,0.0008915663,0.001165366,0.0005893818,0.001430647],"category_scores_gemma":[0.005271513,0.0003021902,0.0003758069,0.0007745938,0.0006074358,0.0009205859,0.0006298729,0.001160313,0.0005588564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006552091,"about_ca_system_score_gemma":0.0008627714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001895864,"about_ca_topic_score_gemma":0.00279953,"domain_scores_codex":[0.9988323,0.0004216084,0.0000676762,0.0001039047,0.0005061157,0.0000684075],"domain_scores_gemma":[0.9979091,0.001018506,0.0001419091,0.0003909867,0.0004986767,0.00004077121],"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.0009352298,0.0002210616,0.002289289,0.00033339,0.0002073931,0.0002020501,0.0002792847,0.3673942,0.06540892,0.04410826,0.002804847,0.515816],"study_design_scores_gemma":[0.00003402579,0.00025658,0.0003889636,0.00001554706,0.00003243097,0.000204074,0.00002468917,0.9483166,0.04331989,0.004658812,0.002719015,0.00002930209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04195786,0.0006222971,0.953294,0.0001425891,0.00009566617,0.00009111891,0.00004449994,0.000830417,0.002921488],"genre_scores_gemma":[0.2554852,0.0005209584,0.7415864,0.0001050985,0.00005772044,0.0001058912,0.0001639339,0.00009615739,0.001878663],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001895864,"threshold_uncertainty_score":0.007825196,"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","authors":[{"name":"Camille Leroux","is_ca":true},{"name":"Ido Tal","is_ca":false},{"name":"Alexander Vardy","is_ca":false},{"name":"Warren J. Gross","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003719008,0.0006032509,0.0002924516,0.0006562065,0.0005288589,0.0007993162,0.0009292681,0.0005037707,0.0039312],"category_scores_gemma":[0.001628716,0.0002944626,0.000251319,0.0006723342,0.0005625616,0.0009718979,0.0007401437,0.0008342194,0.0015367],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006855933,"about_ca_system_score_gemma":0.0009842812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001456782,"about_ca_topic_score_gemma":0.002512358,"domain_scores_codex":[0.9995508,0.00008165449,0.0000276578,0.00005160607,0.0002212389,0.00006699903],"domain_scores_gemma":[0.9993662,0.0002092945,0.00007349275,0.0001083681,0.0002136041,0.00002896551],"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.0008493231,0.0001553271,0.001015309,0.0004087764,0.00006148418,0.000388744,0.0003284958,0.1549169,0.2377765,0.1700889,0.008984182,0.425026],"study_design_scores_gemma":[0.0001663979,0.0005462515,0.0007093799,0.00007834515,0.00005228636,0.0005248063,0.00009652584,0.7097322,0.2008958,0.05896274,0.02816428,0.00007098891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05823365,0.0008347172,0.9215621,0.0003860317,0.0001914577,0.0001008323,0.0001087324,0.002585095,0.01599731],"genre_scores_gemma":[0.565187,0.0009382574,0.4216187,0.0002958612,0.0001490188,0.0001521004,0.0003559142,0.0001102015,0.01119302],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0039312,"threshold_uncertainty_score":0.01315117,"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","authors":[{"name":"Kangwook Lee","is_ca":true},{"name":"Changho Suh","is_ca":true},{"name":"Kannan Ramchandran","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004340118,0.0004063954,0.0003332721,0.000438372,0.000428737,0.0007345606,0.0007636987,0.0005115735,0.0030923],"category_scores_gemma":[0.002212014,0.0001298564,0.0002181541,0.0007726877,0.0008315088,0.0009001331,0.0007968833,0.000692508,0.0007333219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006341917,"about_ca_system_score_gemma":0.0007842126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008003917,"about_ca_topic_score_gemma":0.001285093,"domain_scores_codex":[0.9995161,0.0001047791,0.00001998144,0.00006095549,0.0002453814,0.00005274911],"domain_scores_gemma":[0.9988173,0.000370644,0.00009300956,0.0003663985,0.0003030704,0.0000495884],"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.00025215,0.00007277777,0.0005089341,0.0002132879,0.00003466988,0.0002223502,0.0002096764,0.1965857,0.04666934,0.6057312,0.006737088,0.1427628],"study_design_scores_gemma":[0.00003042363,0.0001019295,0.000146865,0.00002496913,0.000009715364,0.0001700239,0.00002065978,0.8704601,0.01671618,0.1002763,0.01201451,0.00002839087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02409114,0.0002854307,0.9645905,0.0002923383,0.0001148998,0.00006408629,0.00009045842,0.0003657223,0.01010536],"genre_scores_gemma":[0.523001,0.0003823936,0.467681,0.0001957123,0.0001394385,0.0001771252,0.0001636548,0.00006631747,0.008193552],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0030923,"threshold_uncertainty_score":0.01034474,"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","authors":[{"name":"Lei M. Zhang","is_ca":true},{"name":"Frank R. Kschischang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005495811,0.0005843557,0.0002272326,0.0005337511,0.0004738902,0.0006545762,0.0007538882,0.0006601391,0.002703041],"category_scores_gemma":[0.003905248,0.0001561017,0.0002852216,0.0006628427,0.0004985231,0.0009425643,0.0003955131,0.000678333,0.0005709289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001212167,"about_ca_system_score_gemma":0.00154817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00294643,"about_ca_topic_score_gemma":0.004508177,"domain_scores_codex":[0.9995173,0.000103669,0.00002538518,0.00004304753,0.0002083375,0.0001021336],"domain_scores_gemma":[0.9970334,0.001159215,0.000366602,0.0004951182,0.0008445917,0.0001011726],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001118469,0.0002435352,0.003800795,0.0003716201,0.0001058108,0.0004079332,0.00023432,0.7224352,0.1166439,0.07762641,0.003118126,0.07389387],"study_design_scores_gemma":[0.00006773642,0.0003886317,0.0004392008,0.00002684332,0.00004151485,0.0002119121,0.00003418816,0.8810331,0.1034201,0.00843473,0.005866631,0.00003532384],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5838829,0.000621721,0.3955879,0.0004886523,0.00009900405,0.0002800153,0.0003879009,0.001688606,0.01696332],"genre_scores_gemma":[0.9286607,0.0001566308,0.06849483,0.0000793224,0.000008055337,0.0000995876,0.0001365682,0.00009302419,0.002271216],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00294643,"threshold_uncertainty_score":0.009042561,"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","authors":[{"name":"Seyyed Ali Hashemi","is_ca":true},{"name":"Carlo Condo","is_ca":true},{"name":"Warren J. Gross","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004949291,0.000621066,0.0004084187,0.0009062816,0.0005277422,0.0008416726,0.0009127342,0.000482515,0.002892085],"category_scores_gemma":[0.001754298,0.0002627361,0.0003003285,0.0008724549,0.0005208056,0.0008594172,0.0007818167,0.0008915111,0.001796643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007780271,"about_ca_system_score_gemma":0.001413765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00202546,"about_ca_topic_score_gemma":0.004290972,"domain_scores_codex":[0.9995158,0.00008839136,0.00003295889,0.00005277374,0.0002587695,0.00005123897],"domain_scores_gemma":[0.9991146,0.0003236859,0.0001212917,0.0001406689,0.0002694102,0.00003043026],"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.0007116024,0.0001162121,0.001228892,0.000436544,0.00006768818,0.0003900974,0.0003171315,0.1393384,0.2070347,0.0834044,0.01027098,0.5566834],"study_design_scores_gemma":[0.0001184411,0.0003363015,0.0005686368,0.00008118114,0.00004102302,0.0005972866,0.00004898869,0.7891734,0.1668032,0.01552709,0.02662535,0.00007904191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02104494,0.0005570962,0.9703537,0.0001692932,0.00007652899,0.0001187968,0.0001980093,0.002241467,0.005240099],"genre_scores_gemma":[0.2433504,0.0008289001,0.7464195,0.0002842068,0.0001180664,0.000218718,0.0007277728,0.0001711483,0.007881298],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002892085,"threshold_uncertainty_score":0.009674966,"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","authors":[{"name":"S. Sharifi Tehrani","is_ca":true},{"name":"Shie Mannor","is_ca":true},{"name":"Warren J. Gross","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000234078,0.0004415584,0.0004486208,0.0004671864,0.0003907493,0.0005551854,0.0005643239,0.0004496612,0.003040738],"category_scores_gemma":[0.0006914081,0.000262533,0.0003411916,0.0004984197,0.0002674229,0.0006177491,0.0005166078,0.0003495955,0.001164655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006559107,"about_ca_system_score_gemma":0.001223626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002047392,"about_ca_topic_score_gemma":0.004433086,"domain_scores_codex":[0.9995171,0.00006243523,0.00003223492,0.0001079944,0.0002276573,0.00005248576],"domain_scores_gemma":[0.9995502,0.0001080773,0.00004170799,0.00009807957,0.0001748239,0.00002716233],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007324526,0.0001943432,0.002126076,0.0002513839,0.0001251543,0.0003905354,0.0001855035,0.3843644,0.254051,0.05709382,0.008602417,0.291883],"study_design_scores_gemma":[0.00005417596,0.0001328663,0.0007846102,0.00001404142,0.00002207362,0.0003507144,0.00001568805,0.9033709,0.07685214,0.009684657,0.008687689,0.00003052508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1503013,0.0003125636,0.8270101,0.0002611425,0.00008638339,0.0001281345,0.0006587731,0.004077051,0.01716456],"genre_scores_gemma":[0.7341467,0.0002629561,0.2497927,0.0002063701,0.00005744073,0.0001562065,0.001040492,0.0001702843,0.01416702],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003040738,"threshold_uncertainty_score":0.01017225,"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)","authors":[{"name":"Vincent Gaudet","is_ca":true},{"name":"Anthony Rapley","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005195222,0.0003851143,0.0005310063,0.0004051665,0.0004639193,0.0008200938,0.0006902122,0.000702722,0.001346377],"category_scores_gemma":[0.001647254,0.0002228587,0.0003890801,0.0005187842,0.0006343891,0.0006269873,0.000828428,0.0007054345,0.0005975922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005420715,"about_ca_system_score_gemma":0.001090828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00107666,"about_ca_topic_score_gemma":0.001921024,"domain_scores_codex":[0.9995103,0.000132118,0.00002734839,0.00006148109,0.0002126413,0.00005607653],"domain_scores_gemma":[0.9994215,0.0002664445,0.0000366491,0.00009970964,0.0001494155,0.00002631486],"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.0002046004,0.00008251183,0.0008464132,0.0001202229,0.00008383008,0.0002241726,0.0001535075,0.5557861,0.0471149,0.2595495,0.002011316,0.1338229],"study_design_scores_gemma":[0.00001706335,0.00004829195,0.00007623729,0.000008888032,0.00001045239,0.00007375373,0.000004062537,0.9686836,0.009755541,0.01956401,0.001744655,0.00001356903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0168757,0.00009816259,0.9775912,0.0001001841,0.00004072571,0.0000499517,0.00003216892,0.0004064231,0.004805538],"genre_scores_gemma":[0.5058234,0.0003039241,0.4875805,0.000133065,0.0000517001,0.0001951147,0.0001242566,0.00008209971,0.005705943],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001346377,"threshold_uncertainty_score":0.004504085,"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","authors":[{"name":"Gaoning He","is_ca":false},{"name":"Jean‐Claude Belfiore","is_ca":false},{"name":"Ingmar Land","is_ca":false},{"name":"Ganghua Yang","is_ca":false},{"name":"Xiaocheng Liu","is_ca":false},{"name":"Ying Chen","is_ca":false},{"name":"Rong Li","is_ca":false},{"name":"Jun Wang","is_ca":false},{"name":"Yiqun Ge","is_ca":true},{"name":"Ran Zhang","is_ca":true},{"name":"Wen Tong","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001594474,0.0006041517,0.0005241867,0.001202448,0.0007356461,0.001232923,0.0010497,0.000753266,0.002308973],"category_scores_gemma":[0.007255287,0.0004597268,0.0007551461,0.0007576589,0.002977991,0.002587261,0.001766421,0.00225749,0.0005987438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008383169,"about_ca_system_score_gemma":0.0006939222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005127455,"about_ca_topic_score_gemma":0.0003712684,"domain_scores_codex":[0.9989139,0.0003551474,0.0000438351,0.000187704,0.0003674828,0.0001319754],"domain_scores_gemma":[0.9970531,0.001797945,0.0002226856,0.0004748429,0.0003314723,0.0001198663],"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.00002449208,0.00001206645,0.0002854995,0.00003515164,0.000005180388,0.0000571552,0.0001613226,0.0333779,0.003947011,0.9496031,0.0002805128,0.01221058],"study_design_scores_gemma":[0.00002062123,0.0000930391,0.0001667222,0.00004139656,0.00001023289,0.0002359659,0.00006818834,0.4390209,0.008411773,0.5467793,0.005114887,0.00003717844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01571638,0.0001469196,0.9804524,0.00008617445,0.00002178902,0.00002424169,0.00002010755,0.00008284717,0.003449185],"genre_scores_gemma":[0.4837651,0.0007439391,0.5084963,0.0002331032,0.0001604591,0.0002695282,0.0001426654,0.0002502363,0.005938642],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002308973,"threshold_uncertainty_score":0.008432448,"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","authors":[{"name":"Hua Xiao","is_ca":true},{"name":"Amir H. Banihashemi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003124257,0.0003935152,0.0003993062,0.0004919366,0.000353055,0.000312775,0.0005450947,0.0004967464,0.0008475609],"category_scores_gemma":[0.001493932,0.0001608464,0.0002879509,0.0006551656,0.0005709082,0.0007288373,0.001034366,0.0008898086,0.0003482762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002473727,"about_ca_system_score_gemma":0.00048482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006397579,"about_ca_topic_score_gemma":0.0007857318,"domain_scores_codex":[0.9997528,0.00005813043,0.00001440711,0.00003565125,0.0001014231,0.00003750467],"domain_scores_gemma":[0.9993665,0.0001900971,0.0000622286,0.0002282199,0.0001160595,0.00003699349],"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.0004705912,0.0001576273,0.002240945,0.0003244205,0.00004797869,0.0006048691,0.0003573064,0.2670764,0.1495878,0.175714,0.005279663,0.3981384],"study_design_scores_gemma":[0.00007715913,0.0001851661,0.0006507043,0.00002565265,0.00002738002,0.0006006876,0.00003832896,0.8522188,0.08892177,0.04019374,0.0170085,0.00005204185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08495028,0.0002794437,0.9066623,0.0002404959,0.00007206495,0.0001051933,0.0001794847,0.0009326186,0.006578029],"genre_scores_gemma":[0.4283963,0.0003637793,0.5664622,0.0001200324,0.00002590143,0.0001259786,0.0004191176,0.0001188419,0.003967733],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0008475609,"threshold_uncertainty_score":0.002835333,"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","authors":[{"name":"Jeff Castura","is_ca":true},{"name":"Yongyi Mao","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009681549,0.0004765358,0.0004951792,0.0004483773,0.0004776483,0.0009179329,0.001220767,0.0007938119,0.001187258],"category_scores_gemma":[0.003143313,0.0001730356,0.0003848825,0.0005435945,0.001097295,0.001389061,0.0006508082,0.0009954172,0.000352933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006690695,"about_ca_system_score_gemma":0.000678796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00222959,"about_ca_topic_score_gemma":0.001375449,"domain_scores_codex":[0.9994363,0.0002266604,0.00001779759,0.00004675889,0.0001760072,0.0000965038],"domain_scores_gemma":[0.9987882,0.000558241,0.0001202768,0.0002774983,0.000218531,0.00003736404],"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.00009633959,0.00002886813,0.0002457,0.00008880332,0.00002674279,0.0003091838,0.0001689405,0.4603592,0.009203664,0.49027,0.001301168,0.03790154],"study_design_scores_gemma":[0.00002509862,0.00007248246,0.00008086457,0.00002901484,0.00001527078,0.0001785342,0.00002018135,0.8889669,0.003901735,0.1019883,0.004691972,0.000029638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02181893,0.0005170229,0.9723278,0.0002803779,0.00007546282,0.00004866915,0.00004257071,0.0002836374,0.004605609],"genre_scores_gemma":[0.7834409,0.0009981643,0.2117366,0.0001812212,0.0001171135,0.0001407249,0.00005415826,0.00005803285,0.003272945],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00222959,"threshold_uncertainty_score":0.005120158,"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","authors":[{"name":"Yongyi Mao","is_ca":true},{"name":"Amir H. Banihashemi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004890405,0.000443859,0.000632434,0.001017908,0.0005484505,0.0004278212,0.0005831459,0.0006402374,0.001212409],"category_scores_gemma":[0.003171614,0.0003361422,0.0003347812,0.0006828441,0.0005959498,0.0005772345,0.000503654,0.0004171072,0.0003429613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003569535,"about_ca_system_score_gemma":0.0009549205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006765869,"about_ca_topic_score_gemma":0.002077421,"domain_scores_codex":[0.9997535,0.00008298235,0.00001218402,0.00005390534,0.0000609018,0.00003655685],"domain_scores_gemma":[0.9986766,0.0008096253,0.0001324462,0.000147896,0.0001509798,0.000082413],"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.0008135086,0.0002878865,0.009341419,0.0004288179,0.0001480923,0.0006036164,0.0004104644,0.685012,0.07573278,0.03555826,0.004988072,0.1866751],"study_design_scores_gemma":[0.0002077109,0.0004146406,0.001110523,0.00003574247,0.00007070162,0.0003253234,0.0001471647,0.9486402,0.01639048,0.0302547,0.002369965,0.00003275771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4737951,0.0006048935,0.5194435,0.0003557085,0.00005326631,0.0001571266,0.0002302484,0.0007892841,0.004570845],"genre_scores_gemma":[0.695947,0.0002194756,0.301508,0.0001468393,0.00002766124,0.0002392189,0.0005027254,0.0001034994,0.00130565],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001212409,"threshold_uncertainty_score":0.004055917,"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","authors":[{"name":"S. Sharifi Tehrani","is_ca":true},{"name":"Warren J. Gross","is_ca":true},{"name":"Shie Mannor","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008276216,0.0005485344,0.0007666511,0.000695408,0.0006335585,0.0008513454,0.0006291539,0.0007389174,0.001012019],"category_scores_gemma":[0.006525315,0.0003239654,0.0005337417,0.0008370417,0.00083648,0.0006061208,0.001047043,0.001041514,0.0007166035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008481959,"about_ca_system_score_gemma":0.001773348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002001142,"about_ca_topic_score_gemma":0.002262899,"domain_scores_codex":[0.9978808,0.0005820406,0.00009608979,0.0002108902,0.001087503,0.0001427046],"domain_scores_gemma":[0.9979131,0.0009910809,0.0001630891,0.0003562251,0.0005118588,0.00006458414],"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.0001638372,0.000041978,0.0007283117,0.0001834921,0.00007868031,0.0002402582,0.0001928749,0.5577887,0.03150052,0.2704169,0.002667063,0.1359973],"study_design_scores_gemma":[0.00001465555,0.00002553566,0.000116776,0.00001979187,0.000007450782,0.0001118397,0.000006824544,0.942885,0.01286189,0.04064655,0.003284684,0.00001903564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009122904,0.0001123417,0.9869112,0.0000928693,0.00003463703,0.00003065143,0.00008433764,0.0004063438,0.00320464],"genre_scores_gemma":[0.4845614,0.0007114657,0.5062662,0.0002739578,0.0001294037,0.0002416898,0.0006181917,0.0002650801,0.006932685],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002001142,"threshold_uncertainty_score":0.00615406,"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","authors":[{"name":"Gabi Sarkis","is_ca":true},{"name":"Pascal Giard","is_ca":true},{"name":"Alexander Vardy","is_ca":false},{"name":"Claude Thibeault","is_ca":true},{"name":"Warren J. Gross","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005734944,0.0006741645,0.0003844888,0.001331627,0.0007159256,0.001337727,0.000713443,0.0007333632,0.005025597],"category_scores_gemma":[0.003676625,0.0002718164,0.0003241533,0.001107849,0.0005175094,0.001341825,0.001097461,0.0009091244,0.003304075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000705883,"about_ca_system_score_gemma":0.001405527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001560437,"about_ca_topic_score_gemma":0.002656604,"domain_scores_codex":[0.9995041,0.0001009216,0.00004351506,0.00005641324,0.0002365344,0.00005855039],"domain_scores_gemma":[0.9980616,0.0008187541,0.0002133834,0.0002493078,0.000604604,0.00005234135],"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.0007356994,0.0001184591,0.001470171,0.000393314,0.00004900881,0.0003170567,0.0003886213,0.1073221,0.08947245,0.1071697,0.01079571,0.6817678],"study_design_scores_gemma":[0.0001542944,0.0003057908,0.0004852317,0.0001223118,0.00004597086,0.0004627081,0.00009842223,0.7596725,0.1706121,0.0395609,0.02839217,0.00008760719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01399644,0.0004114284,0.9772273,0.0001531999,0.0001080356,0.00007791059,0.000142337,0.002799289,0.005084066],"genre_scores_gemma":[0.1625788,0.0006825568,0.8253523,0.0002082567,0.000130523,0.0001881516,0.0005950052,0.0003134183,0.009951053],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005025597,"threshold_uncertainty_score":0.01681226,"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)","authors":[{"name":"M Yazdani","is_ca":true},{"name":"Amir H. Banihashemi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001772004,0.0003732138,0.0004266339,0.0007122752,0.0005974068,0.0006329764,0.0007200149,0.0005065664,0.0007751782],"category_scores_gemma":[0.004136202,0.0003613359,0.0005997238,0.0005067431,0.001181694,0.0008663569,0.001153434,0.0009623446,0.0003251816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004901208,"about_ca_system_score_gemma":0.0008244833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003478822,"about_ca_topic_score_gemma":0.0002625628,"domain_scores_codex":[0.9989016,0.0003871369,0.00005866216,0.0001234877,0.0004370176,0.00009199186],"domain_scores_gemma":[0.9983297,0.0008160528,0.0001857788,0.000422809,0.0001853778,0.00006022073],"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.000119955,0.00004621882,0.0008665933,0.0002044847,0.00002221769,0.0002887457,0.000269666,0.1152213,0.0268956,0.8030269,0.0006961979,0.05234215],"study_design_scores_gemma":[0.00007446452,0.0002723708,0.0005367252,0.0001038591,0.00003285646,0.0007523017,0.00006584633,0.6201935,0.06841347,0.2947469,0.01473205,0.00007567331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04049613,0.0002863129,0.9555781,0.000114592,0.00002438847,0.00007038776,0.000061162,0.000149233,0.003219779],"genre_scores_gemma":[0.4205505,0.0007901345,0.5758363,0.00010398,0.00005666914,0.0002398232,0.0002491917,0.0000955049,0.002077973],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001772004,"threshold_uncertainty_score":0.00937134,"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","authors":[{"name":"M Yazdani","is_ca":true},{"name":"Amir H. Banihashemi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008729816,0.0004038255,0.0003595066,0.0006883948,0.0005537721,0.0006175705,0.0005928077,0.0004601815,0.0008647651],"category_scores_gemma":[0.001980936,0.0002791609,0.0004982385,0.0004403357,0.0009222395,0.0006436917,0.001133368,0.0008709954,0.0004468208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003744317,"about_ca_system_score_gemma":0.0006341938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003214408,"about_ca_topic_score_gemma":0.0002596187,"domain_scores_codex":[0.999472,0.0001594374,0.00002220573,0.0000576772,0.0002232799,0.00006544995],"domain_scores_gemma":[0.999363,0.0002356026,0.00007862482,0.0001828441,0.0001013704,0.0000385429],"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.0001028675,0.00004367965,0.0007507018,0.000164558,0.000016043,0.0004364513,0.0002912903,0.06959845,0.03285781,0.8434036,0.0008583579,0.05147619],"study_design_scores_gemma":[0.00008225667,0.0003040539,0.0004922118,0.0001034061,0.00003324601,0.0008384608,0.00008101591,0.5149485,0.07756577,0.3815002,0.02396256,0.00008836684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04522646,0.0003098069,0.9482121,0.0001151706,0.0000414142,0.00008138255,0.00006781983,0.0002071109,0.005738732],"genre_scores_gemma":[0.5047185,0.000753061,0.4908448,0.0001142191,0.00006505816,0.0002122671,0.0002520207,0.0001016707,0.00293849],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0008729816,"threshold_uncertainty_score":0.004616857,"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)","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005917383,0.0006772217,0.0004248593,0.00133778,0.000802532,0.001382244,0.0007138777,0.0007190072,0.004649034],"category_scores_gemma":[0.003734375,0.0002854562,0.0003356934,0.001137896,0.0005313091,0.001401032,0.001125242,0.0009403524,0.003342314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007285675,"about_ca_system_score_gemma":0.001527359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001538502,"about_ca_topic_score_gemma":0.002646163,"domain_scores_codex":[0.9994947,0.0001011315,0.00004498982,0.0000566797,0.0002423125,0.00006015047],"domain_scores_gemma":[0.9979323,0.0008217864,0.000223599,0.000269813,0.0006945596,0.00005796059],"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.0008366941,0.0001266852,0.001570838,0.0004633109,0.0000511982,0.0003652533,0.0004367501,0.1104107,0.09327234,0.1192113,0.01193561,0.6613194],"study_design_scores_gemma":[0.0001672997,0.0003441999,0.0004678436,0.0001310407,0.00004912415,0.0005308187,0.000105426,0.7557401,0.1707229,0.04214498,0.02949829,0.00009793797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01427193,0.0005084407,0.9767557,0.0001761579,0.000123063,0.00008962135,0.0001477488,0.002713699,0.005213575],"genre_scores_gemma":[0.1699179,0.0007682266,0.8189715,0.0002381826,0.0001324892,0.0001995651,0.0005673845,0.0003098424,0.008894973],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004649034,"threshold_uncertainty_score":0.01555258,"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","authors":[{"name":"Inmar E. Givoni","is_ca":true},{"name":"Brendan J. Frey","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002205183,0.0009421752,0.001081907,0.001619835,0.001138596,0.00257677,0.0050297,0.003369849,0.01447305],"category_scores_gemma":[0.01090794,0.0006977258,0.001071651,0.003276439,0.001900431,0.004745245,0.002180917,0.004907159,0.005013519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001718498,"about_ca_system_score_gemma":0.001488778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005213741,"about_ca_topic_score_gemma":0.004605115,"domain_scores_codex":[0.9977381,0.0007441289,0.0001049673,0.0005859557,0.0005915149,0.0002352419],"domain_scores_gemma":[0.996941,0.001537969,0.0002419001,0.0004610342,0.000680625,0.0001374463],"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.00005505772,0.0000528604,0.0004023151,0.00008095447,0.00003690962,0.000111138,0.0001297567,0.1326665,0.001032546,0.8113295,0.009478095,0.0446244],"study_design_scores_gemma":[0.00002471283,0.0000258582,0.0001226691,0.00001923861,0.0000174433,0.000100979,0.00001473961,0.6882716,0.0005452688,0.3012904,0.009546576,0.00002058917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00152672,0.0001308883,0.9934961,0.0005364717,0.000105155,0.0000406762,0.0001723079,0.0002173314,0.00377444],"genre_scores_gemma":[0.2593686,0.001089142,0.6819999,0.001275507,0.0005209278,0.001033204,0.00136117,0.0004636537,0.05288795],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01447305,"threshold_uncertainty_score":0.04841715,"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","authors":[{"name":"Ali Naderi","is_ca":true},{"name":"Shie Mannor","is_ca":false},{"name":"Mohamad Sawan","is_ca":true},{"name":"Warren J. Gross","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004146666,0.0004794388,0.000455652,0.0004314351,0.0003962073,0.0007664096,0.0006645196,0.000427202,0.001415823],"category_scores_gemma":[0.001957488,0.0002171066,0.0003300763,0.0005083045,0.0004452437,0.0004998213,0.0005623423,0.0005838536,0.0005099166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009702085,"about_ca_system_score_gemma":0.001729324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002231968,"about_ca_topic_score_gemma":0.002757781,"domain_scores_codex":[0.9992951,0.0001561768,0.00004058494,0.0001139773,0.0003198747,0.00007424571],"domain_scores_gemma":[0.9989617,0.0003333834,0.00009435113,0.0001655908,0.0003994706,0.0000455986],"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.0005277944,0.00007037352,0.001168166,0.0002641877,0.00005529457,0.0003076238,0.0001219536,0.4537867,0.1275591,0.1747852,0.004302196,0.2370513],"study_design_scores_gemma":[0.00003446504,0.00007109628,0.0001800963,0.00001284212,0.0000123117,0.0001150968,0.000006059614,0.9316654,0.04496074,0.01524937,0.007672546,0.00001999805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02494456,0.0001814041,0.9704098,0.00008998965,0.00007843327,0.0000432133,0.0001344533,0.0006096502,0.003508613],"genre_scores_gemma":[0.5472621,0.0004980922,0.4412601,0.0001599901,0.00009093036,0.0001673462,0.0006724806,0.0001472898,0.009741714],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002231968,"threshold_uncertainty_score":0.007039428,"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","authors":[{"name":"Ahmad Darabiha","is_ca":true},{"name":"Anthony Chan Carusone","is_ca":true},{"name":"Frank R. Kschischang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001107905,0.0005087531,0.0002227914,0.0004393166,0.000341244,0.0004317801,0.0005410694,0.0002746258,0.003281712],"category_scores_gemma":[0.0006488217,0.0002029389,0.0002322442,0.0005319227,0.0002471539,0.0004766735,0.0003297529,0.0003793827,0.00102236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005240386,"about_ca_system_score_gemma":0.0003774232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007016339,"about_ca_topic_score_gemma":0.002007751,"domain_scores_codex":[0.9998147,0.0000254965,0.0000105562,0.00002797648,0.0001061496,0.00001505796],"domain_scores_gemma":[0.9997596,0.00009709148,0.00002774069,0.00004095819,0.00006973943,0.000004810621],"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.0001674507,0.00009390176,0.0006294612,0.0004219549,0.00005349035,0.0002385194,0.000311552,0.05776986,0.4864745,0.0448028,0.003203228,0.4058333],"study_design_scores_gemma":[0.00006153487,0.0003369382,0.001044884,0.00006538045,0.00007153639,0.0008035804,0.00008052739,0.4849105,0.4491558,0.02533358,0.038101,0.00003466536],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06972815,0.001430621,0.907843,0.000278223,0.00005337319,0.00009383041,0.0001008404,0.001298652,0.01917328],"genre_scores_gemma":[0.4960352,0.001855891,0.4737686,0.0002350078,0.00007464043,0.000145764,0.0003658753,0.0002890317,0.0272301],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003281712,"threshold_uncertainty_score":0.0109784,"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","authors":[{"name":"G. David Forney","is_ca":false},{"name":"R. Koetter","is_ca":false},{"name":"Frank R. Kschischang","is_ca":true},{"name":"Alex Reznik","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001117395,0.001716326,0.001129403,0.005214451,0.00172245,0.003595807,0.001772519,0.001721616,0.006210544],"category_scores_gemma":[0.008209196,0.0009311785,0.0007836433,0.003105825,0.002999316,0.00627574,0.002114503,0.002741944,0.001116023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001690868,"about_ca_system_score_gemma":0.0007710011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009277725,"about_ca_topic_score_gemma":0.00144213,"domain_scores_codex":[0.9986975,0.0003031101,0.00007846748,0.0001831802,0.0005509526,0.0001868198],"domain_scores_gemma":[0.9955629,0.002643853,0.0003423884,0.0004082733,0.0007439263,0.000298671],"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.00002301947,0.00001300075,0.0001210203,0.00005171592,0.000007369571,0.00003496702,0.0001566387,0.002169104,0.001177219,0.9839337,0.001217055,0.0110951],"study_design_scores_gemma":[0.000007192245,0.0000129301,0.0001278667,0.0000406039,0.000008726744,0.00007932046,0.00004653405,0.00954962,0.001139852,0.9855451,0.003423778,0.00001848364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3641227,0.005451873,0.4481679,0.001864877,0.001457371,0.0002002314,0.0006605523,0.0005390458,0.1775353],"genre_scores_gemma":[0.845332,0.005257512,0.08610441,0.0008479503,0.001566221,0.0005163587,0.0008698061,0.00115922,0.05834659],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006210544,"threshold_uncertainty_score":0.02077633,"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","authors":[{"name":"Mark M. Wilde","is_ca":true},{"name":"Saikat Guha","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000757947,0.0004123444,0.0002853824,0.0005867117,0.0006226974,0.001342141,0.0004590155,0.0007007118,0.003418772],"category_scores_gemma":[0.003303268,0.0002449462,0.000386385,0.0005607356,0.001999088,0.001944438,0.001889827,0.001747594,0.000739177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008778012,"about_ca_system_score_gemma":0.0008474967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005498842,"about_ca_topic_score_gemma":0.0003806136,"domain_scores_codex":[0.9991721,0.0002230635,0.00002998459,0.0001037661,0.0003433188,0.0001278245],"domain_scores_gemma":[0.9977577,0.001235758,0.0001990635,0.0003681885,0.0003293713,0.0001098337],"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.00002668622,0.000007739936,0.00006391631,0.00002132993,0.000001938356,0.00002126445,0.00007489448,0.007136919,0.001150151,0.9849532,0.0005261601,0.006015795],"study_design_scores_gemma":[0.00001651077,0.00001810903,0.0001108766,0.00002126935,0.000004824386,0.00005103712,0.00003800994,0.05374081,0.003610726,0.9372977,0.005074889,0.00001526042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1007285,0.0008992315,0.8216268,0.001530174,0.0001915571,0.0001235768,0.0004068284,0.000240789,0.07425248],"genre_scores_gemma":[0.8537337,0.001354951,0.1278256,0.0007740698,0.0002895768,0.0003573647,0.0005211472,0.00009340042,0.01505032],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003418772,"threshold_uncertainty_score":0.01143694,"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","authors":[{"name":"Masoud Ardakani","is_ca":true},{"name":"Frank R. Kschischang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006778793,0.0005774205,0.0006657229,0.0007688408,0.0004797205,0.0008687227,0.0004800711,0.0005179509,0.001196198],"category_scores_gemma":[0.003808989,0.0003993511,0.0004874014,0.0005732829,0.0008117332,0.001012152,0.0006470276,0.0009975662,0.0004724816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009612367,"about_ca_system_score_gemma":0.00086195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001186166,"about_ca_topic_score_gemma":0.001030817,"domain_scores_codex":[0.9993741,0.0001801115,0.00003301348,0.00007211983,0.0003039539,0.0000367889],"domain_scores_gemma":[0.998379,0.0007327092,0.000193184,0.0003030577,0.0003548067,0.0000372904],"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.00003097642,0.00001838578,0.0006522976,0.00009003462,0.00001952772,0.00005072684,0.00007793548,0.884919,0.01587634,0.07175558,0.0007282838,0.02578087],"study_design_scores_gemma":[0.000002147947,0.000009191897,0.00006375508,0.000005320182,0.000002548837,0.00002358212,0.000005290367,0.9861022,0.003090747,0.009522501,0.001164191,0.000008550584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01050995,0.00009745061,0.9871489,0.00007124664,0.00001762627,0.00001830645,0.00004657547,0.0001305674,0.001959289],"genre_scores_gemma":[0.4133974,0.000599157,0.5824735,0.0001501261,0.00004452553,0.0001832361,0.0002056581,0.0002003754,0.002745939],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001196198,"threshold_uncertainty_score":0.00697422,"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","authors":[{"name":"Muhammad Hanif","is_ca":true},{"name":"Masoud Ardakani","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005854992,0.0007517425,0.000446747,0.0006299549,0.0007039637,0.000921758,0.0007048774,0.0005702668,0.002426486],"category_scores_gemma":[0.003029962,0.0003143831,0.0003083513,0.0003904918,0.0007904713,0.001429156,0.00101057,0.0008838835,0.001243295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004849025,"about_ca_system_score_gemma":0.001675566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001480043,"about_ca_topic_score_gemma":0.003156833,"domain_scores_codex":[0.9996308,0.00006793408,0.00003083997,0.00004260257,0.0001637849,0.00006401011],"domain_scores_gemma":[0.9983969,0.0004869996,0.0001519884,0.000325268,0.0005700777,0.00006866678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001211624,0.0002122752,0.003123742,0.0004143945,0.00008009224,0.0007590755,0.000610709,0.09945518,0.411512,0.1050782,0.002712205,0.3748306],"study_design_scores_gemma":[0.00008637858,0.0003633859,0.0005637256,0.00006197496,0.00005316644,0.0009163364,0.0001250742,0.4024084,0.5640481,0.01961438,0.01168609,0.00007304183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1273107,0.0004043401,0.8577114,0.0002844658,0.0001926197,0.0001466795,0.00009598712,0.001092231,0.01276158],"genre_scores_gemma":[0.5446912,0.000581103,0.4433029,0.0001995908,0.00006636458,0.0001135973,0.0002466891,0.0001541749,0.0106444],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002426486,"threshold_uncertainty_score":0.008117378,"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","authors":[{"name":"Siting Liu","is_ca":true},{"name":"Jie Han","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003222014,0.0002380598,0.0003092177,0.0003928727,0.000227281,0.0005470928,0.0004051663,0.0003627773,0.001334222],"category_scores_gemma":[0.00155455,0.0001250582,0.0001410574,0.0004160518,0.0005340106,0.0008051574,0.000490217,0.0005171157,0.0003762586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003127118,"about_ca_system_score_gemma":0.000483044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002597688,"about_ca_topic_score_gemma":0.0004936123,"domain_scores_codex":[0.9996779,0.0000682361,0.00002070417,0.00003696868,0.0001545631,0.00004163685],"domain_scores_gemma":[0.9994524,0.0002568609,0.00006933601,0.00009661282,0.00009854766,0.00002619816],"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.0004304714,0.00008529917,0.0009007197,0.0003403364,0.0000355532,0.0003077642,0.0001747264,0.2081135,0.1494576,0.4590973,0.001398117,0.1796586],"study_design_scores_gemma":[0.00003840516,0.0002772713,0.000255304,0.00005359093,0.00001303336,0.0002393136,0.00003567836,0.8052859,0.09129328,0.09440682,0.008066732,0.00003472228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1413569,0.0007383455,0.8474751,0.0003675385,0.00007691118,0.00005405466,0.00005820423,0.0006035055,0.009269538],"genre_scores_gemma":[0.8502788,0.0004034962,0.1459552,0.0001417159,0.00003319118,0.00006191976,0.00007505128,0.00006212934,0.002988655],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001334222,"threshold_uncertainty_score":0.004463434,"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","authors":[{"name":"Gabi Sarkis","is_ca":true},{"name":"Warren J. Gross","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008613697,0.0006770597,0.000545254,0.0007770568,0.00048366,0.000975983,0.0006332914,0.000556625,0.005056612],"category_scores_gemma":[0.004988689,0.0002509948,0.0002340617,0.0006989018,0.0006489105,0.001376466,0.0006820738,0.0007638992,0.001717184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009414092,"about_ca_system_score_gemma":0.001427951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001611906,"about_ca_topic_score_gemma":0.002201156,"domain_scores_codex":[0.9988542,0.0002257264,0.00006271376,0.0001215025,0.0005910693,0.0001448301],"domain_scores_gemma":[0.9966732,0.001507523,0.0001898682,0.0004880847,0.001064564,0.00007670305],"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.001913281,0.0001610349,0.004076974,0.0003745609,0.0001060938,0.000583698,0.0002573838,0.155388,0.5057895,0.04131484,0.006470132,0.2835645],"study_design_scores_gemma":[0.00008714176,0.000354806,0.001667837,0.00004083606,0.00006767256,0.0009293312,0.0000590173,0.4392343,0.5375884,0.007486468,0.01242469,0.00005959499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.307039,0.001170389,0.6523424,0.0009725309,0.0002968403,0.0002139048,0.0003714149,0.004709356,0.03288414],"genre_scores_gemma":[0.8435181,0.0005777707,0.1435969,0.0002961615,0.0001359889,0.0001024666,0.0004590733,0.0001372614,0.01117635],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005056612,"threshold_uncertainty_score":0.0169161,"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","authors":[{"name":"Mehdi Karimi","is_ca":true},{"name":"Amir H. Banihashemi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005959325,0.001069602,0.0008843649,0.002155878,0.001092916,0.0009883948,0.001432063,0.000901668,0.004907652],"category_scores_gemma":[0.003566049,0.0005065604,0.0006906741,0.001352509,0.0007268812,0.001254137,0.00164515,0.0010517,0.001834767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009759659,"about_ca_system_score_gemma":0.002167155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002873562,"about_ca_topic_score_gemma":0.003714818,"domain_scores_codex":[0.9993256,0.0001285597,0.00005191893,0.0001265487,0.0002814234,0.00008594365],"domain_scores_gemma":[0.9988421,0.0005395904,0.00008461504,0.000155553,0.0003409518,0.00003727612],"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.0003117906,0.0001465644,0.001567403,0.0004057851,0.00009011197,0.0003730445,0.0004948163,0.2637545,0.02594463,0.07592497,0.007182109,0.6238043],"study_design_scores_gemma":[0.0001136963,0.00007261255,0.0002324464,0.00003960966,0.00002877701,0.0002650032,0.00007077331,0.9344227,0.01098733,0.0473795,0.006347571,0.00003987786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006162643,0.00009198643,0.990956,0.00006565051,0.00002000239,0.0001124796,0.00008467312,0.00080134,0.001705217],"genre_scores_gemma":[0.06771601,0.0001123282,0.9287754,0.00005637627,0.00001478338,0.0003353695,0.0003924333,0.0001564221,0.00244086],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004907652,"threshold_uncertainty_score":0.01641768,"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","authors":[{"name":"Seyyed Ali Hashemi","is_ca":true},{"name":"Carlo Condo","is_ca":true},{"name":"Warren J. Gross","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002437975,0.0007160532,0.000511487,0.0008827586,0.0005844824,0.001033976,0.0008661147,0.0006790057,0.004274144],"category_scores_gemma":[0.0006648159,0.0002410362,0.000256291,0.0007602764,0.0003421911,0.001064041,0.0007028165,0.0006668771,0.004192599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005979565,"about_ca_system_score_gemma":0.001427463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002745976,"about_ca_topic_score_gemma":0.004168554,"domain_scores_codex":[0.999694,0.00005450751,0.00001986089,0.00004554803,0.0001484597,0.00003764529],"domain_scores_gemma":[0.9995511,0.0000891845,0.00003198403,0.00006375054,0.000233932,0.00003008176],"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.001028956,0.0001730785,0.00146145,0.0004695959,0.0001137328,0.0007479828,0.0002547659,0.06748014,0.3552479,0.05707245,0.02242943,0.4935205],"study_design_scores_gemma":[0.0001320408,0.0006408475,0.0005335672,0.00005985185,0.0000784321,0.001122695,0.00005535687,0.6041421,0.3399705,0.008042664,0.04511905,0.0001029664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.021571,0.000684902,0.9576756,0.0002828138,0.0002318049,0.0001681122,0.0003676467,0.006659545,0.01235864],"genre_scores_gemma":[0.2939396,0.001016674,0.6853792,0.0004530414,0.0002128747,0.0001740966,0.001143263,0.0002463895,0.01743488],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004274144,"threshold_uncertainty_score":0.01429838,"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","authors":[{"name":"A.J. Feltstrom","is_ca":false},{"name":"Dmitri Truhachev","is_ca":true},{"name":"Michael Lentmaier","is_ca":false},{"name":"Kamil Sh. Zigangirov","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037844,0.0005161968,0.0006591791,0.0009106346,0.0004738297,0.001277878,0.0008408353,0.000655847,0.004069276],"category_scores_gemma":[0.002336106,0.000231472,0.0002549741,0.0009463396,0.00091369,0.001586574,0.00112106,0.001363556,0.001805936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006573995,"about_ca_system_score_gemma":0.001253674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001084993,"about_ca_topic_score_gemma":0.001361307,"domain_scores_codex":[0.9992067,0.0001164682,0.00003973341,0.0001403777,0.0003665564,0.0001301261],"domain_scores_gemma":[0.9986191,0.0003107239,0.0001559848,0.0003309806,0.0004856853,0.0000975631],"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.000366787,0.00005096037,0.001063923,0.0002280773,0.00003507368,0.0004450756,0.0002479262,0.04366266,0.0507011,0.7182325,0.006210735,0.1787553],"study_design_scores_gemma":[0.0001206302,0.0003203853,0.001054816,0.0001754286,0.00004313527,0.001534958,0.00006995894,0.4503821,0.05559552,0.3837749,0.10678,0.0001481459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05553426,0.003221113,0.9094266,0.0003181514,0.0003232719,0.0001316233,0.0006256208,0.0008545642,0.02956479],"genre_scores_gemma":[0.6514599,0.003348115,0.2933049,0.0006361949,0.0003079023,0.0004676695,0.001644388,0.0003436003,0.04848721],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004069276,"threshold_uncertainty_score":0.01361305,"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","authors":[{"name":"Siting Liu","is_ca":true},{"name":"Jie Han","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002559251,0.0003902185,0.0002392549,0.0004204856,0.0001996787,0.0004985225,0.0006328477,0.0003066395,0.001762085],"category_scores_gemma":[0.0006841662,0.0001807063,0.000237008,0.0004607108,0.0002989185,0.0006925549,0.0003315503,0.0004278718,0.00041125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000411834,"about_ca_system_score_gemma":0.0006385369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005265727,"about_ca_topic_score_gemma":0.001173591,"domain_scores_codex":[0.999754,0.00004231464,0.00001582737,0.00004137102,0.0001151901,0.00003125685],"domain_scores_gemma":[0.9996666,0.0001113183,0.00007166321,0.00005324587,0.00008203019,0.00001528635],"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.0003393939,0.0002033802,0.00098704,0.0005039989,0.00007233049,0.0002986088,0.0001811925,0.1788189,0.3984331,0.1099009,0.003001951,0.3072593],"study_design_scores_gemma":[0.00006771411,0.000664126,0.0004639647,0.00006199507,0.00004557362,0.0003476668,0.0000377816,0.7677568,0.1858009,0.02459698,0.02012358,0.00003279885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08864006,0.000608254,0.9017348,0.0002278632,0.00006565886,0.0001240648,0.00007414701,0.001249276,0.007275811],"genre_scores_gemma":[0.613987,0.0005366984,0.3815596,0.0001794886,0.00005175922,0.0001561225,0.0001497428,0.00009331101,0.003286225],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001762085,"threshold_uncertainty_score":0.00589478,"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","authors":[{"name":"Mohammad M. Karimi","is_ca":true},{"name":"Amir H. Banihashemi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004994496,0.0004052339,0.0003518213,0.0009688063,0.0004500135,0.0005531779,0.0004893811,0.0004532166,0.001347093],"category_scores_gemma":[0.004801919,0.0002733904,0.0003161007,0.0006710469,0.001353914,0.001043196,0.001049332,0.001045007,0.0002433461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007543963,"about_ca_system_score_gemma":0.0005587797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006586419,"about_ca_topic_score_gemma":0.0007598512,"domain_scores_codex":[0.9995684,0.000100549,0.00001528858,0.00007287752,0.0001502646,0.00009270768],"domain_scores_gemma":[0.9964899,0.002378416,0.0003319254,0.0004340331,0.0002060304,0.0001596796],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004827176,0.00008001968,0.006949745,0.0003825507,0.00007703281,0.0005590999,0.0008413575,0.5650669,0.08080284,0.2921602,0.001442133,0.05115539],"study_design_scores_gemma":[0.0000373374,0.0002844773,0.004677165,0.0001016292,0.0000454986,0.000628033,0.0001760114,0.6525343,0.02899985,0.3086627,0.003781689,0.00007128255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7778673,0.0008434827,0.2078194,0.0004648998,0.00005991741,0.00004691173,0.0002171155,0.0002552131,0.01242577],"genre_scores_gemma":[0.9799063,0.0007675511,0.01782709,0.00006268396,0.00004192315,0.00004150363,0.0001274418,0.00005237082,0.001173125],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001347093,"threshold_uncertainty_score":0.005473614,"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","authors":[{"name":"M Yazdani","is_ca":true},{"name":"Saied Hemati","is_ca":true},{"name":"Amir H. Banihashemi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001831518,0.001059264,0.001095091,0.001486917,0.0005635429,0.001171757,0.001602452,0.001347301,0.001200652],"category_scores_gemma":[0.01688208,0.0006568609,0.0005144454,0.001563611,0.001162394,0.003160049,0.001975455,0.001399828,0.0004345176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009453902,"about_ca_system_score_gemma":0.001157468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006826079,"about_ca_topic_score_gemma":0.0048608,"domain_scores_codex":[0.9986607,0.0005704973,0.00006039555,0.0001980091,0.000353736,0.0001566942],"domain_scores_gemma":[0.9900287,0.007414618,0.0004507866,0.0008794573,0.001062854,0.0001634686],"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.000210103,0.00004462094,0.001062643,0.0001185293,0.00006771889,0.00009306952,0.0001626209,0.8294926,0.00275006,0.04208177,0.002254423,0.1216618],"study_design_scores_gemma":[0.00001174382,0.00001549083,0.00006342554,0.000005474106,0.000007962642,0.00001186955,0.000006343386,0.9783546,0.0007800338,0.02036589,0.0003715977,0.000005579651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03179466,0.0004694843,0.9647919,0.0004205979,0.00005459741,0.00002906765,0.00006052535,0.0006898075,0.001689433],"genre_scores_gemma":[0.6695341,0.001045727,0.3250683,0.000378344,0.0001692565,0.0001297162,0.0003020335,0.0001871465,0.003185416],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006826079,"threshold_uncertainty_score":0.01357269,"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","authors":[{"name":"Camille Leroux","is_ca":false},{"name":"Alexandre J. Raymond","is_ca":true},{"name":"Gabi Sarkis","is_ca":true},{"name":"Ido Tal","is_ca":false},{"name":"Alexander Vardy","is_ca":false},{"name":"Warren J. Gross","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004604762,0.0005763944,0.0003532921,0.0006738087,0.0004762332,0.0009592524,0.0008426491,0.0005573704,0.005804342],"category_scores_gemma":[0.001724186,0.0002945969,0.0002691094,0.0004236751,0.0002496442,0.0005527004,0.0005306815,0.000636113,0.0020292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000479806,"about_ca_system_score_gemma":0.00123902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001679147,"about_ca_topic_score_gemma":0.003837774,"domain_scores_codex":[0.999608,0.00009438516,0.00002587597,0.00003465362,0.0001729836,0.00006408799],"domain_scores_gemma":[0.9991672,0.000357895,0.00005022546,0.000104296,0.0002816108,0.0000388213],"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.00188885,0.0003543061,0.001922975,0.0004305227,0.0001544213,0.0004570656,0.0003134271,0.06535044,0.3112888,0.05955629,0.007173326,0.5511096],"study_design_scores_gemma":[0.0002832341,0.0007002536,0.001004315,0.00007162039,0.00008414836,0.0007068066,0.00007817904,0.5764771,0.3928434,0.0112111,0.01646353,0.0000764038],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07801528,0.0005603195,0.9063286,0.0002941016,0.0002970462,0.0001313814,0.000217382,0.004012399,0.01014358],"genre_scores_gemma":[0.5315674,0.0003952413,0.4592222,0.000249386,0.00009933826,0.0001160868,0.0004154668,0.00009940119,0.007835457],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005804342,"threshold_uncertainty_score":0.01941741,"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","authors":[{"name":"Max Welling","is_ca":true},{"name":"Yee Whye Teh","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002735254,0.0006600841,0.002100398,0.001374393,0.0009480029,0.002515991,0.002484834,0.002026352,0.003234607],"category_scores_gemma":[0.02665433,0.001059342,0.0009618867,0.001733385,0.003157353,0.005298657,0.002749291,0.004225911,0.0005396715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001996848,"about_ca_system_score_gemma":0.001333911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006391902,"about_ca_topic_score_gemma":0.005757579,"domain_scores_codex":[0.9981526,0.0009200135,0.00007865109,0.0002301831,0.000478246,0.0001403773],"domain_scores_gemma":[0.9896305,0.008563827,0.0003051761,0.000771571,0.000575382,0.0001534955],"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.0000961754,0.00003145101,0.0005165674,0.0001230199,0.0000672398,0.00003224165,0.0001117025,0.4578407,0.0004750417,0.5010515,0.001739294,0.03791517],"study_design_scores_gemma":[0.000006571373,0.000003994041,0.00005330592,0.00001162874,0.000006439497,0.000006705245,0.000005581388,0.6707469,0.0001663915,0.3285884,0.0003981812,0.000005902372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0147986,0.001247489,0.9792697,0.0007774046,0.0001253482,0.00001671866,0.00005218927,0.0003398922,0.00337275],"genre_scores_gemma":[0.6567044,0.001757721,0.3294888,0.0005106258,0.0004955695,0.0002498861,0.0003719965,0.0003861801,0.01003485],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006391902,"threshold_uncertainty_score":0.01448822,"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","authors":[{"name":"Seyyed Ali Hashemi","is_ca":false},{"name":"Carlo Condo","is_ca":true},{"name":"Warren J. Gross","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008997524,0.0007751859,0.0005920065,0.001025568,0.0005536935,0.00108559,0.0009193667,0.000487669,0.002316545],"category_scores_gemma":[0.004841397,0.0002625618,0.0004390677,0.001029334,0.0007138253,0.00124987,0.0009729777,0.000881659,0.001639876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007748068,"about_ca_system_score_gemma":0.002390238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003356468,"about_ca_topic_score_gemma":0.005037937,"domain_scores_codex":[0.9988046,0.0002818263,0.00005564891,0.00009411469,0.0006441233,0.0001196762],"domain_scores_gemma":[0.9962907,0.00144228,0.0003232244,0.0006045093,0.001274788,0.00006450638],"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.0006592197,0.00009278866,0.002240247,0.0004273834,0.00007286025,0.0006687017,0.0003915987,0.4839166,0.09540723,0.08334295,0.005664157,0.3271162],"study_design_scores_gemma":[0.00005444065,0.0001955684,0.0003369569,0.00003801386,0.00002487941,0.0004501255,0.00004578381,0.9083534,0.07107054,0.01189618,0.007490667,0.00004336287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02945948,0.0003442503,0.962863,0.0001616268,0.00005676693,0.0001030659,0.0001796002,0.001016472,0.005815715],"genre_scores_gemma":[0.3779245,0.0007856838,0.6118198,0.0002019759,0.00007005896,0.0001558678,0.0008866995,0.0001467227,0.008008703],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003356468,"threshold_uncertainty_score":0.007749557,"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","authors":[{"name":"Andrew W. Eckford","is_ca":true},{"name":"Frank R. Kschischang","is_ca":true},{"name":"S. Pasupathy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009657991,0.000626079,0.0005376291,0.001295175,0.0005068461,0.0009373428,0.0007493186,0.0008795672,0.001365393],"category_scores_gemma":[0.006685975,0.0003111493,0.0004861768,0.0007743053,0.001531052,0.001128062,0.000702219,0.0009722841,0.0002513473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001605391,"about_ca_system_score_gemma":0.001349748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004556592,"about_ca_topic_score_gemma":0.002568242,"domain_scores_codex":[0.9995939,0.000133106,0.00001113257,0.00003063168,0.0001694849,0.00006185818],"domain_scores_gemma":[0.9968214,0.002337433,0.0002355677,0.0001255079,0.0004230606,0.00005709499],"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.00005889255,0.00001746704,0.0008926417,0.00007581653,0.00002143939,0.0001996298,0.0001509554,0.7547358,0.004277037,0.2335665,0.0005675185,0.005436271],"study_design_scores_gemma":[0.000002431782,0.000007151501,0.0001568759,0.000009499369,0.000003430398,0.00003370447,0.00001035467,0.9644554,0.0009127512,0.0342052,0.000194107,0.000009152128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2333541,0.001473413,0.746804,0.0009012243,0.00005011968,0.00007562601,0.0002322717,0.0002072758,0.01690195],"genre_scores_gemma":[0.9711051,0.001035238,0.0237026,0.0001030282,0.00004472357,0.00008213484,0.0001560025,0.0000651119,0.003705993],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004556592,"threshold_uncertainty_score":0.011648,"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","authors":[{"name":"Alireza Tasdighi","is_ca":false},{"name":"Amir H. Banihashemi","is_ca":true},{"name":"Mohammad‐Reza Sadeghi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002537687,0.0002816654,0.0004019651,0.0006459114,0.00037118,0.0003329288,0.0004756927,0.0004592433,0.001188754],"category_scores_gemma":[0.002125603,0.000260376,0.0002861993,0.0004622003,0.000400259,0.0005008989,0.0004585915,0.0003537794,0.000177145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005465708,"about_ca_system_score_gemma":0.001305665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002158196,"about_ca_topic_score_gemma":0.004507394,"domain_scores_codex":[0.9998448,0.00003829359,0.000006250054,0.00002651068,0.00005589381,0.00002829806],"domain_scores_gemma":[0.9993487,0.0004195406,0.00007048092,0.00006469592,0.00006904483,0.00002739079],"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.0002555117,0.0001288649,0.005415519,0.0003333689,0.00006668002,0.0004181977,0.0002725324,0.8035955,0.04493917,0.04839769,0.002083094,0.09409372],"study_design_scores_gemma":[0.00004636164,0.00006496193,0.0007348603,0.00001729497,0.00001234611,0.00008554423,0.00005043554,0.9728737,0.006230727,0.01869225,0.001182274,0.000009122473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7605171,0.0007404795,0.2299613,0.0003480451,0.00002213062,0.0001200346,0.0004088951,0.0003802543,0.007501754],"genre_scores_gemma":[0.8413332,0.0003469111,0.1554405,0.0001046682,0.00001014701,0.0001089089,0.0006641742,0.00006512275,0.001926473],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002158196,"threshold_uncertainty_score":0.004291296,"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","authors":[{"name":"Christian Schlegel","is_ca":true},{"name":"Shuai Zhang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001909804,0.0002410638,0.0001752202,0.0009814271,0.0003968944,0.0004989982,0.0003069581,0.0003371091,0.001344307],"category_scores_gemma":[0.002143253,0.0001565689,0.0001483062,0.0005094512,0.001012411,0.0008623042,0.0003647262,0.0003189341,0.0001610109],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003921273,"about_ca_system_score_gemma":0.0002570822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008091027,"about_ca_topic_score_gemma":0.0006612013,"domain_scores_codex":[0.999893,0.00002822765,0.00000356745,0.00001015795,0.0000456756,0.00001947471],"domain_scores_gemma":[0.9993113,0.0004314252,0.00009529802,0.00004225675,0.0000895722,0.00003007604],"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.00009283014,0.00003800774,0.001582908,0.0001128508,0.00001086828,0.0003741499,0.0004215574,0.5115521,0.02403315,0.4442358,0.0007957242,0.01675],"study_design_scores_gemma":[0.000005969429,0.0000340661,0.0007138114,0.00001467297,0.000002742591,0.0001709416,0.00006241388,0.9230715,0.003790671,0.07140503,0.0007112428,0.00001696444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7730035,0.0007241408,0.2016623,0.0003720949,0.0000342015,0.0000473678,0.0001375061,0.0003241934,0.02369479],"genre_scores_gemma":[0.9881919,0.0002668021,0.009489564,0.00001917821,0.000008519228,0.000028221,0.00005365158,0.00003166914,0.001910542],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001344307,"threshold_uncertainty_score":0.004497111,"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","authors":[{"name":"Warren J. Gross","is_ca":true},{"name":"Vincent Gaudet","is_ca":true},{"name":"A. Milner","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004756702,0.0004268714,0.0004001345,0.0004421616,0.0004081204,0.0007234711,0.0006906705,0.0005875785,0.00236594],"category_scores_gemma":[0.001842269,0.0002544406,0.0003204828,0.0005540649,0.000425805,0.000552475,0.0004678462,0.0006926229,0.0009138493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000735767,"about_ca_system_score_gemma":0.001150423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001910023,"about_ca_topic_score_gemma":0.002217661,"domain_scores_codex":[0.9989372,0.0002507881,0.00005808561,0.000116893,0.0005334443,0.0001035753],"domain_scores_gemma":[0.9990807,0.0003290757,0.00008417507,0.0001623144,0.0003143112,0.00002946788],"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.0002226184,0.00008494862,0.0009404237,0.0002752314,0.00008836797,0.0002546919,0.0001856161,0.4497755,0.06299905,0.2856852,0.004002855,0.1954854],"study_design_scores_gemma":[0.00003515943,0.0001040623,0.0002278958,0.00003513335,0.0000216931,0.0002549397,0.00001327473,0.9092655,0.04303443,0.02887803,0.01809727,0.00003260895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01605384,0.0002973021,0.9741383,0.0001251119,0.0000494235,0.00004525491,0.00009623117,0.001418134,0.007776405],"genre_scores_gemma":[0.5362031,0.0008177754,0.4529525,0.0002312088,0.00007229602,0.000175651,0.0003569429,0.0001356961,0.009054673],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00236594,"threshold_uncertainty_score":0.007914901,"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","authors":[{"name":"Carlo Condo","is_ca":true},{"name":"Furkan Ercan","is_ca":true},{"name":"Warren J. Gross","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006012921,0.0007393563,0.0005136215,0.000634046,0.0003487735,0.0006445914,0.0005524173,0.0004704458,0.00111835],"category_scores_gemma":[0.00287365,0.0001601463,0.0003345614,0.0009049109,0.0005409023,0.0006985216,0.0005805892,0.0006180173,0.0005575792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004327969,"about_ca_system_score_gemma":0.001149533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001821405,"about_ca_topic_score_gemma":0.002071322,"domain_scores_codex":[0.9994379,0.0001353191,0.00002901133,0.00006330309,0.0002675215,0.00006692575],"domain_scores_gemma":[0.9986326,0.0005378763,0.0001228243,0.0001936352,0.0004751087,0.00003785836],"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.0006650208,0.0001071888,0.002234675,0.0002402541,0.00008712927,0.0005144789,0.0003015646,0.3259349,0.1582333,0.08289405,0.002748094,0.4260394],"study_design_scores_gemma":[0.00003215745,0.0001272625,0.000337386,0.00002185357,0.00002273649,0.0003628984,0.00002316711,0.8854986,0.1045483,0.006253326,0.002744635,0.00002763348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05735348,0.0003122386,0.9370323,0.0001314534,0.00007528991,0.00005591316,0.0000820888,0.0005297255,0.004427574],"genre_scores_gemma":[0.4895018,0.0007136075,0.5035062,0.0001516822,0.00007047467,0.00007221683,0.0003952822,0.00007716352,0.005511532],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001821405,"threshold_uncertainty_score":0.003741264,"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","authors":[{"name":"Hamid Saber","is_ca":true},{"name":"Ian Marsland","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006559273,0.0005679555,0.000424172,0.0004179273,0.000465106,0.0005388329,0.0007954062,0.0004524417,0.0009312588],"category_scores_gemma":[0.001719069,0.0002055314,0.0003404266,0.0005376842,0.0007043764,0.0008859315,0.001194067,0.000813693,0.000495496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001881677,"about_ca_system_score_gemma":0.0003944134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001975347,"about_ca_topic_score_gemma":0.0001672925,"domain_scores_codex":[0.9995381,0.0001489503,0.0000279091,0.00007244595,0.0001571528,0.00005555234],"domain_scores_gemma":[0.9987889,0.0003548559,0.0001740059,0.0003781516,0.0002429133,0.00006129679],"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.001035435,0.000144923,0.002305483,0.0004075127,0.00009401438,0.00158839,0.0006888302,0.151368,0.297851,0.192212,0.003138435,0.3491658],"study_design_scores_gemma":[0.0001546807,0.001011465,0.001234328,0.00008777147,0.00009847448,0.002670201,0.0001197242,0.7568432,0.1705395,0.04745716,0.01961292,0.0001705551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04866766,0.000354413,0.9467818,0.0001306757,0.00008038495,0.00007629517,0.00007781926,0.000481231,0.003349687],"genre_scores_gemma":[0.5884809,0.0004065396,0.4077639,0.000209017,0.00007404766,0.0001221322,0.0001282742,0.0000534338,0.0027617],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0009312588,"threshold_uncertainty_score":0.003468931,"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","authors":[{"name":"Saied Hemati","is_ca":true},{"name":"Amir H. Banihashemi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006604814,0.0003420188,0.0003487143,0.0003531385,0.0002071504,0.000362291,0.000467669,0.0003780761,0.0007616894],"category_scores_gemma":[0.004880137,0.0002024371,0.000217963,0.0003322633,0.0008027698,0.0007957394,0.0004305953,0.0005715205,0.0001493494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000929811,"about_ca_system_score_gemma":0.0006259609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002892049,"about_ca_topic_score_gemma":0.001330755,"domain_scores_codex":[0.9996567,0.0001190577,0.000009823292,0.00003920525,0.0001379196,0.0000374235],"domain_scores_gemma":[0.9981174,0.001259659,0.0002234821,0.0001104305,0.0002546945,0.00003426316],"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.00006355107,0.00002225445,0.001042345,0.00004912837,0.00001247789,0.00007161346,0.0001243366,0.9553568,0.01193804,0.02377686,0.000171828,0.007370768],"study_design_scores_gemma":[0.000001471432,0.00001047123,0.000145086,0.000001813662,0.000001350799,0.000009997589,0.00000461235,0.9974748,0.001182137,0.001116752,0.00004858207,0.00000282887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4882405,0.0005144026,0.5010403,0.0003374149,0.00001977788,0.0000527015,0.00008877283,0.0002944836,0.009411608],"genre_scores_gemma":[0.987314,0.0001787931,0.01146015,0.00001881743,0.000006001336,0.00002140917,0.00003900519,0.00002218406,0.0009397366],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002892049,"threshold_uncertainty_score":0.006746352,"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","authors":[{"name":"Syed Mohsin Abbas","is_ca":true},{"name":"Thibaud Tonnellier","is_ca":true},{"name":"Furkan Ercan","is_ca":false},{"name":"Marwan Jalaleddine","is_ca":true},{"name":"Warren J. Gross","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001369584,0.0004264204,0.0002777078,0.0004717082,0.000228303,0.000557495,0.001237538,0.000312401,0.004493194],"category_scores_gemma":[0.0004194467,0.0001972572,0.0001827182,0.0003663082,0.0001586293,0.0006038509,0.0003870615,0.0003281457,0.001376735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006103808,"about_ca_system_score_gemma":0.0006257318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001163247,"about_ca_topic_score_gemma":0.002661158,"domain_scores_codex":[0.9998443,0.00002323735,0.00001048967,0.00003091783,0.00005860775,0.0000323714],"domain_scores_gemma":[0.9997905,0.00004595823,0.00003449684,0.00003494498,0.00007818102,0.00001597748],"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.0008399272,0.0002944621,0.003816049,0.0007229275,0.0001531936,0.0008590037,0.0003342861,0.04310774,0.4820821,0.03573731,0.03567896,0.396374],"study_design_scores_gemma":[0.0002951625,0.002949351,0.003536006,0.0001369426,0.0002100233,0.00118234,0.0001386812,0.5155684,0.3873327,0.009713802,0.07877779,0.0001588377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.420263,0.003005872,0.5143121,0.0009873462,0.000421242,0.0003396354,0.000869168,0.01504264,0.04475914],"genre_scores_gemma":[0.8129275,0.0004255711,0.1709378,0.000283271,0.00007182685,0.0001402934,0.0008961518,0.0001378299,0.01417961],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004493194,"threshold_uncertainty_score":0.01503128,"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","authors":[{"name":"Amir H. Banihashemi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003219149,0.0003163543,0.0003941779,0.001368704,0.0007980787,0.000932353,0.0006504516,0.0005042453,0.003035699],"category_scores_gemma":[0.002788327,0.0003123918,0.0005432343,0.0007737122,0.001347272,0.001496538,0.0008997362,0.0009001619,0.0002682209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006475127,"about_ca_system_score_gemma":0.0003915489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007893115,"about_ca_topic_score_gemma":0.0006191036,"domain_scores_codex":[0.9996004,0.00006610369,0.00002380552,0.0001163458,0.0001154172,0.00007796075],"domain_scores_gemma":[0.9976376,0.001212128,0.0004456321,0.0002223438,0.0002687984,0.0002134951],"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.0001602472,0.0001064612,0.008101442,0.0002200323,0.0000372038,0.0005739607,0.001040293,0.05642751,0.02680065,0.8776255,0.001608834,0.0272978],"study_design_scores_gemma":[0.0000388093,0.000186898,0.005600345,0.00008355081,0.00004101026,0.001108735,0.0004274594,0.3533945,0.01474187,0.6169753,0.007334735,0.00006663094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6724246,0.0003840217,0.3108873,0.0002403949,0.00003232765,0.0001082685,0.000526982,0.0002576485,0.01513845],"genre_scores_gemma":[0.9618521,0.0002778713,0.03289215,0.0001052742,0.00005067917,0.0001099801,0.0005960579,0.00009137775,0.004024434],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003035699,"threshold_uncertainty_score":0.01015538,"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","authors":[{"name":"Seyyed Ali Hashemi","is_ca":true},{"name":"Carlo Condo","is_ca":true},{"name":"Warren J. Gross","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007625111,0.0008367419,0.0006150658,0.001016318,0.0005458879,0.001404319,0.0009185694,0.0007159761,0.002954201],"category_scores_gemma":[0.003667925,0.0002926451,0.0004604323,0.00108611,0.0008799461,0.001319207,0.001115103,0.0009145479,0.002109157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007709184,"about_ca_system_score_gemma":0.001967405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002345003,"about_ca_topic_score_gemma":0.002945787,"domain_scores_codex":[0.9987015,0.0003176079,0.00006996463,0.000108912,0.0006810207,0.0001210223],"domain_scores_gemma":[0.9985989,0.0004390441,0.000120991,0.0003074965,0.0004973919,0.00003623955],"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.000583512,0.00007803552,0.0007511989,0.0005177689,0.00005982689,0.0005724311,0.0003422151,0.3093889,0.07550944,0.2149244,0.00915409,0.3881181],"study_design_scores_gemma":[0.00006052111,0.0000913426,0.0001980807,0.0000489475,0.00002037997,0.0003398767,0.00003687974,0.9079373,0.04204911,0.03753677,0.01163371,0.00004700291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009967862,0.0002906023,0.9829276,0.0001818929,0.0001021122,0.00006581263,0.0001186591,0.0004855166,0.005859851],"genre_scores_gemma":[0.2090469,0.0009875132,0.7792324,0.0003088906,0.0001855134,0.0001537607,0.0006159002,0.0001697119,0.009299439],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002954201,"threshold_uncertainty_score":0.009882808,"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","authors":[{"name":"Furkan Ercan","is_ca":true},{"name":"Carlo Condo","is_ca":true},{"name":"Warren J. Gross","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005423232,0.0006805343,0.0005569431,0.0008737997,0.0003794603,0.0006304763,0.0007933231,0.0006762252,0.002051257],"category_scores_gemma":[0.002269248,0.0001869925,0.0004455505,0.001032499,0.0004163918,0.0006398085,0.0006385295,0.0007989123,0.001019237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005963481,"about_ca_system_score_gemma":0.001314649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002938945,"about_ca_topic_score_gemma":0.003023996,"domain_scores_codex":[0.9993007,0.0001306649,0.0000501664,0.0001022206,0.0003571071,0.00005909039],"domain_scores_gemma":[0.9991924,0.0002776834,0.0000629103,0.0001072268,0.0003366936,0.00002307632],"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.0004508592,0.00007453671,0.001318404,0.0001893767,0.00005705758,0.0003270848,0.0002227519,0.2266279,0.09730414,0.04187838,0.002938395,0.6286111],"study_design_scores_gemma":[0.00003468596,0.00008969472,0.0002666671,0.00001636526,0.00001236611,0.0002784379,0.00001345262,0.9578536,0.03370965,0.004456466,0.003242421,0.00002617487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009440602,0.0001515595,0.9885029,0.00005024138,0.00004058277,0.00005628807,0.00004920389,0.0004467627,0.00126185],"genre_scores_gemma":[0.1407371,0.0003058697,0.8558608,0.00009244586,0.00003246904,0.0001476557,0.0002875875,0.00005819505,0.002477746],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002938945,"threshold_uncertainty_score":0.006862164,"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","authors":[{"name":"Jeff Castura","is_ca":true},{"name":"Yongyi Mao","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002782187,0.0009386655,0.0007349209,0.00091976,0.0004538439,0.00100576,0.0006016226,0.0009690386,0.001012117],"category_scores_gemma":[0.008923647,0.0004135754,0.0004081046,0.0008697225,0.001013623,0.001223299,0.0007639636,0.0008949162,0.0004302243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004906455,"about_ca_system_score_gemma":0.0007790561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005214292,"about_ca_topic_score_gemma":0.0004930287,"domain_scores_codex":[0.9979964,0.001126133,0.00007587476,0.0001439144,0.0005390251,0.0001185836],"domain_scores_gemma":[0.9946938,0.003890832,0.0004074939,0.0002310382,0.0007065583,0.00007014006],"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.0004066179,0.0000555068,0.0008900665,0.0004734724,0.00008357037,0.0003117173,0.0003772575,0.6887785,0.01367375,0.144025,0.002406799,0.1485178],"study_design_scores_gemma":[0.00003237234,0.0001992308,0.0001420319,0.00008644172,0.00002378592,0.000322762,0.00004219677,0.9375989,0.01390943,0.04336975,0.00423425,0.00003898832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01405725,0.0009718664,0.9812822,0.0001518948,0.00003629431,0.00004724633,0.00004333542,0.0001939232,0.003215986],"genre_scores_gemma":[0.4191627,0.002865999,0.574006,0.0002160639,0.0001722942,0.0001940401,0.0001740834,0.0001321334,0.003076718],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002782187,"threshold_uncertainty_score":0.01471376,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}