{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":451,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":451,"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":"2a892fb2da13","filters":{"venue":"IEEE Transactions on Information Theory"}},"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":"W2127300249","doi":"10.1109/tit.2009.2016018","title":"Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\\ell _{1}$-Constrained Quadratic Programming (Lasso)","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1252,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Alfred P. Sloan Foundation","keywords":"Lasso (programming language); Compressed sensing; Dimension (graph theory); Algorithm; Mathematics; Quadratic programming; Quadratic equation; Gaussian; Combinatorics; Noise (video); Computer science; Applied mathematics; Discrete mathematics; Mathematical optimization; Artificial intelligence; Physics","authors":[{"name":"Martin J. Wainwright","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01285032071729191,"gpt":0.2205997337126051,"spread":0.2077494129953132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008289787,0.001678433,0.002440149,0.001139095,0.0006598149,0.002049217,0.002282837,0.002660217,0.002927066],"category_scores_gemma":[0.04343861,0.001051856,0.001121499,0.00117493,0.003873799,0.004397609,0.004306234,0.004105456,0.0006585838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001383567,"about_ca_system_score_gemma":0.002228765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002034457,"about_ca_topic_score_gemma":0.001354012,"domain_scores_codex":[0.9959612,0.001617638,0.0002361489,0.0007769157,0.001061977,0.0003460287],"domain_scores_gemma":[0.9794881,0.01579533,0.001884268,0.0009654805,0.001309292,0.0005576939],"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.0007218246,0.0001684112,0.00183432,0.0008353046,0.0001707313,0.0005485772,0.0005198818,0.6609396,0.01523545,0.2449755,0.006453958,0.0675965],"study_design_scores_gemma":[0.00002769798,0.00007559649,0.0003609151,0.00005056592,0.00001128481,0.00006030039,0.00003544316,0.9337121,0.001795932,0.06325095,0.0005934231,0.00002581709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01219164,0.0004687935,0.9848579,0.0007062337,0.00003377171,0.0000420795,0.0001341888,0.0002351489,0.001330136],"genre_scores_gemma":[0.5664553,0.001432796,0.4254076,0.0009739088,0.0002592074,0.00065885,0.0008915174,0.0003978467,0.003522954],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008289787,"threshold_uncertainty_score":0.04384106,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139416652","doi":"10.1109/tit.2008.926449","title":"Coding for Errors and Erasures in Random Network Coding","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1097,"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":"Grassmannian; Decoding methods; Mathematics; Code word; Discrete mathematics; List decoding; Linear network coding; Vector space; Coding theory; Linear space; Linear code; Combinatorics; Algorithm; Concatenated error correction code; Block code; Computer science; Network packet; Pure mathematics","authors":[{"name":"R. Koetter","is_ca":false},{"name":"Frank R. Kschischang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02987853723354601,"gpt":0.2569482130286362,"spread":0.2270696757950902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001661252,0.0008739688,0.0007381784,0.001471281,0.0005391835,0.001745466,0.0009437267,0.001284145,0.004493527],"category_scores_gemma":[0.007049445,0.0003466424,0.0007320474,0.001714451,0.00209363,0.00309446,0.00185729,0.002442195,0.001187225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001563556,"about_ca_system_score_gemma":0.001059126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001827073,"about_ca_topic_score_gemma":0.00193304,"domain_scores_codex":[0.9983529,0.0007923855,0.00007577616,0.0001752835,0.0004424507,0.0001611403],"domain_scores_gemma":[0.9979328,0.001231971,0.0001561865,0.0003692134,0.0002626042,0.00004724845],"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.00001651269,0.00000380382,0.00005409436,0.00004852882,0.000006041212,0.00004618365,0.00006071665,0.0141986,0.0003956045,0.9725395,0.002535046,0.01009535],"study_design_scores_gemma":[0.00000910302,0.00001681552,0.00008477479,0.00005365169,0.000005926222,0.00007531574,0.00002874609,0.1083959,0.000559911,0.8794436,0.01131031,0.00001605212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01472275,0.008220453,0.9314009,0.003517571,0.0008792485,0.00008226664,0.0003858763,0.0003460857,0.04044484],"genre_scores_gemma":[0.6451675,0.01767828,0.2821653,0.001868574,0.002502647,0.0008462778,0.001342495,0.0004471491,0.04798176],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004493527,"threshold_uncertainty_score":0.01503235,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062610219","doi":"10.1109/tit.2008.2009807","title":"Capacity Bounds for the Gaussian Interference Channel","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":469,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Gaussian; Gaussian random field; Mathematics; Topology (electrical circuits); Range (aeronautics); Interference (communication); Gaussian noise; Upper and lower bounds; Channel (broadcasting); Channel capacity; Algorithm; Gaussian function; Combinatorics; Computer science; Physics; Telecommunications; Mathematical analysis; Engineering","authors":[{"name":"Seyed Abolfazl Motahari","is_ca":true},{"name":"Amir K. Khandani","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01790983207713149,"gpt":0.2350918578325372,"spread":0.2171820257554058,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002627486,0.001600455,0.001141431,0.001985133,0.0009770385,0.00313116,0.001626702,0.0009339676,0.008903166],"category_scores_gemma":[0.01239864,0.0004823364,0.0008172149,0.002052431,0.002189124,0.003838337,0.003038947,0.002480283,0.001648862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003384129,"about_ca_system_score_gemma":0.00184563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005097008,"about_ca_topic_score_gemma":0.002766867,"domain_scores_codex":[0.9975851,0.0005126205,0.00008652682,0.0002616874,0.0009657447,0.0005882925],"domain_scores_gemma":[0.987653,0.007512302,0.0009079862,0.00121712,0.002386453,0.0003231469],"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.0003054754,0.00007752555,0.0006115282,0.0005764106,0.0001040431,0.0002882814,0.0004649713,0.3882209,0.006935594,0.5253878,0.01982208,0.05720542],"study_design_scores_gemma":[0.00001868237,0.00006481454,0.0006168742,0.0001840968,0.00005440885,0.0003640664,0.0001433939,0.7314339,0.005556625,0.2509314,0.01053352,0.00009821082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03309005,0.009430734,0.8739548,0.001874779,0.0003468505,0.0000974529,0.00102491,0.0009113202,0.07926905],"genre_scores_gemma":[0.9060059,0.01037859,0.06812173,0.0009507249,0.00108423,0.0005150446,0.001247769,0.0003200447,0.01137595],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008903166,"threshold_uncertainty_score":0.02978408,"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":"W1683834415","doi":"10.1109/tit.2005.864418","title":"A unified framework for tree search decoding: rediscovering the sequential decoder","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":303,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Algorithm; Intersymbol interference; Computer science; MIMO; Tree (set theory); Search tree; Search algorithm; Tree structure; Mathematics; Theoretical computer science; Binary tree","authors":[{"name":"Arul Murugan","is_ca":false},{"name":"H. El Gamal","is_ca":false},{"name":"Mohamed Oussama Damen","is_ca":true},{"name":"G. Caire","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01725278796548103,"gpt":0.2677141701677557,"spread":0.2504613822022747,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00126493,0.0008478719,0.0008196434,0.00063791,0.0003998496,0.001340889,0.0009738096,0.001212281,0.002402192],"category_scores_gemma":[0.003271875,0.0003274016,0.0005652121,0.0009856528,0.001051871,0.001670878,0.0009927267,0.001359044,0.0008617144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008241765,"about_ca_system_score_gemma":0.001618131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001548215,"about_ca_topic_score_gemma":0.001988904,"domain_scores_codex":[0.9991909,0.0003300228,0.00003632393,0.00008902611,0.0002895396,0.00006417155],"domain_scores_gemma":[0.9991085,0.0004657316,0.0000660272,0.0001309852,0.0001965681,0.00003222227],"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.00007533263,0.0000388481,0.0003122776,0.0001204176,0.00002990661,0.0001351491,0.0001352179,0.3925899,0.005947396,0.5216677,0.001757712,0.07719012],"study_design_scores_gemma":[0.00001203297,0.00006040028,0.00003929227,0.00001886775,0.000007934256,0.00008240047,0.00001726189,0.9066104,0.002072889,0.08804725,0.003017065,0.00001417494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009779149,0.00009915749,0.997677,0.00004557215,0.00001015693,0.000009090056,0.00001457375,0.00003408623,0.001132415],"genre_scores_gemma":[0.172284,0.001233859,0.8209911,0.0002014022,0.0001389843,0.0001471386,0.0001149003,0.00008818688,0.004800533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002402192,"threshold_uncertainty_score":0.008036137,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090831658","doi":"10.1109/18.985979","title":"Diagonal algebraic space-time block codes","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":289,"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":"Block code; Mathematics; Hadamard transform; Decoding methods; Diagonal; Concatenated error correction code; Algorithm; Full Rate; Linear code; Space–time block code; Discrete mathematics","authors":[{"name":"Mohamed Oussama Damen","is_ca":true},{"name":"Karim Abed‐Meraim","is_ca":false},{"name":"J.-C. Belfiore","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007211529268538529,"gpt":0.1968682053189268,"spread":0.1896566760503883,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000292564,0.0003681096,0.0003163247,0.000583273,0.0003331295,0.0007522223,0.0004369544,0.0003200306,0.00242036],"category_scores_gemma":[0.001418506,0.0001717689,0.0002565679,0.0008902844,0.0006420981,0.0007100946,0.0006511009,0.0006937374,0.001233322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004422208,"about_ca_system_score_gemma":0.0007193599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001302099,"about_ca_topic_score_gemma":0.001595635,"domain_scores_codex":[0.9993566,0.0001463998,0.00003974824,0.00008058084,0.0002998445,0.00007681405],"domain_scores_gemma":[0.9989485,0.0002007101,0.0001927804,0.0001665982,0.0004272669,0.00006414155],"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.0003074483,0.00008502469,0.001292719,0.0001802278,0.00004420751,0.0002592205,0.0001850579,0.1020402,0.03713253,0.6722482,0.005890574,0.1803345],"study_design_scores_gemma":[0.0001100428,0.000356948,0.0008785732,0.00006180518,0.00004729539,0.0008669061,0.00006407603,0.755934,0.04687767,0.116355,0.07836583,0.0000818723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04378824,0.0009486972,0.9314057,0.0003223061,0.0001991441,0.0001133367,0.0004662013,0.0005741888,0.02218211],"genre_scores_gemma":[0.5411912,0.001638557,0.4381301,0.0002624233,0.0001996002,0.0002639234,0.001162994,0.00009312621,0.01705816],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00242036,"threshold_uncertainty_score":0.008096933,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152374199","doi":"10.1109/tit.2010.2043876","title":"Theoretical and Empirical Results for Recovery From Multiple Measurements","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":270,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Compressed sensing; Minification; Computer science; Algorithm; Extension (predicate logic); Mathematics","authors":[{"name":"E. van den Berg","is_ca":true},{"name":"Michael P. Friedlander","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02146178145333773,"gpt":0.2483098190398186,"spread":0.2268480375864809,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02168277,0.003916071,0.003554382,0.006948495,0.002725616,0.005078594,0.005878059,0.005309419,0.01257582],"category_scores_gemma":[0.1576049,0.002013023,0.002899783,0.009966679,0.009375037,0.01533809,0.006962041,0.009475951,0.002643045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004693077,"about_ca_system_score_gemma":0.002995468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00356344,"about_ca_topic_score_gemma":0.002179069,"domain_scores_codex":[0.9873292,0.004722626,0.0006209147,0.002126282,0.004170786,0.001030179],"domain_scores_gemma":[0.8242681,0.1460654,0.007527305,0.01356609,0.006868795,0.001704229],"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.0006975294,0.0004452151,0.01089515,0.002211421,0.0005831973,0.000516763,0.000688599,0.3233449,0.001960242,0.4843287,0.03504598,0.1392824],"study_design_scores_gemma":[0.0001007984,0.0001478688,0.002781739,0.0004098041,0.0001008438,0.000466949,0.0002199805,0.512844,0.001251531,0.4720232,0.009542309,0.0001108217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01847521,0.02057863,0.9357623,0.007024126,0.0004356729,0.0001821655,0.001971747,0.0009252642,0.01464488],"genre_scores_gemma":[0.598096,0.04441712,0.3218651,0.004094795,0.005782759,0.002099537,0.01014701,0.001302041,0.01219565],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02168277,"threshold_uncertainty_score":0.1146708,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111394763","doi":"10.1109/tit.2011.2167214","title":"Recovering Compressively Sampled Signals Using Partial Support Information","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":266,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minification; Computer science; Compressed sensing; Algorithm; Artificial intelligence; World Wide Web","authors":[{"name":"Michael P. Friedlander","is_ca":true},{"name":"Hassan Mansour","is_ca":true},{"name":"Rayan Saab","is_ca":false},{"name":"Özgür Yılmaz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03576259163528422,"gpt":0.2301614195230408,"spread":0.1943988278877566,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002025353,0.001537423,0.001147485,0.0006921643,0.0003270787,0.0009740958,0.001096274,0.001666625,0.001904],"category_scores_gemma":[0.01636866,0.0005745394,0.0007354523,0.0006272299,0.00178599,0.002579552,0.00211065,0.001407451,0.0005417577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004732905,"about_ca_system_score_gemma":0.000813422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001401857,"about_ca_topic_score_gemma":0.0009369766,"domain_scores_codex":[0.9989834,0.0002974911,0.00005585423,0.0001912213,0.0003662645,0.0001057077],"domain_scores_gemma":[0.9938539,0.004381109,0.0007002568,0.0004248803,0.00050441,0.0001354241],"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.00109389,0.000176847,0.002030249,0.000744587,0.0001792334,0.0005852396,0.0003259566,0.7203965,0.06273185,0.1320349,0.002467127,0.07723369],"study_design_scores_gemma":[0.00001954232,0.00008352745,0.0002377142,0.00002609611,0.00001197632,0.00007241131,0.00002599531,0.9770362,0.008940342,0.01304167,0.0004861021,0.00001837532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07381029,0.0004600843,0.9216192,0.0007803459,0.00004542634,0.00004603569,0.0001965003,0.0001656443,0.00287636],"genre_scores_gemma":[0.8302518,0.001034386,0.1620871,0.0002636738,0.0001647419,0.0001688981,0.001003124,0.0001370812,0.004889088],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002025353,"threshold_uncertainty_score":0.01071119,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126115158","doi":"10.1109/tit.2014.2321151","title":"Information Transmission Using the Nonlinear Fourier Transform, Part II: Numerical Methods","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Nonlinear Waves and Solitons","field":"Physics and Astronomy","cited_by":261,"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":"Eigenvalues and eigenvectors; Nonlinear system; Mathematical analysis; Integrable system; Spectrum (functional analysis); Mathematics; Fourier transform; Transmission (telecommunications); Optics; Algorithm; Physics; Telecommunications; Computer science","authors":[{"name":"Mansoor I. Yousefi","is_ca":true},{"name":"Frank R. Kschischang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01202283092129279,"gpt":0.2905410076675263,"spread":0.2785181767462335,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001235011,0.0005147922,0.0004833337,0.0007820753,0.0005054052,0.0009887283,0.0007501502,0.001062241,0.003082572],"category_scores_gemma":[0.003665213,0.0002519815,0.0004444113,0.000724419,0.001259277,0.001513913,0.00086118,0.001203911,0.0008775757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005903103,"about_ca_system_score_gemma":0.0007973493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001907339,"about_ca_topic_score_gemma":0.001083941,"domain_scores_codex":[0.999604,0.0001510798,0.00002399759,0.0000282997,0.0001741726,0.00001844265],"domain_scores_gemma":[0.9991502,0.0004900486,0.00006688428,0.00012411,0.0001509919,0.00001775898],"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.00004921209,0.00007064476,0.0005414087,0.0003531063,0.00003575595,0.0001328614,0.0002338882,0.5134246,0.01163759,0.3745003,0.002112678,0.09690806],"study_design_scores_gemma":[0.000006855521,0.00001077766,0.00008353216,0.00002907244,0.000002839168,0.00003619515,0.0000145808,0.9627863,0.001046318,0.03311218,0.002860698,0.00001068988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003459861,0.0006748422,0.9901653,0.0001943555,0.0001120906,0.00004908923,0.00002999506,0.0001009775,0.005213575],"genre_scores_gemma":[0.2106687,0.002722247,0.7731814,0.0002000945,0.0002157821,0.0005395444,0.0001172415,0.0001917965,0.01216308],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003082572,"threshold_uncertainty_score":0.01031226,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163934701","doi":"10.1109/tit.2006.876253","title":"Algebraic immunity for cryptographically significant Boolean functions: analysis and construction","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":241,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Boolean function; Mathematics; Hamming weight; Cryptography; Algebraic function; Discrete mathematics; Boolean expression; Algebraic number; Hamming distance; Symmetric function; Addition theorem; Degree (music); Function (biology); Hamming code; Algorithm","authors":[{"name":"Claude Carlet","is_ca":false},{"name":"Deepak Kumar Dalai","is_ca":false},{"name":"K.C. Gupta","is_ca":true},{"name":"Subhamoy Maitra","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004967897182034475,"gpt":0.1939445870323249,"spread":0.1889766898502905,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000783768,0.0004325665,0.0003820413,0.001131459,0.0006406954,0.001309413,0.0005540667,0.0005843689,0.001900744],"category_scores_gemma":[0.003748247,0.0002535467,0.0008633638,0.0006509883,0.002455505,0.001979657,0.001616602,0.001565004,0.000427491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008465948,"about_ca_system_score_gemma":0.0003544413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001310995,"about_ca_topic_score_gemma":0.0001097488,"domain_scores_codex":[0.9992643,0.0001613727,0.00004679786,0.00009923959,0.0003065459,0.00012174],"domain_scores_gemma":[0.9980041,0.00115216,0.0002287022,0.0003482599,0.0001793003,0.00008754262],"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.0001107249,0.00006068531,0.00207303,0.000120862,0.00002233923,0.0001402481,0.0002967662,0.02093525,0.02186522,0.9212444,0.0006949094,0.03243548],"study_design_scores_gemma":[0.00003283626,0.0002603071,0.002259564,0.00005153149,0.0000762995,0.001208681,0.0001259029,0.2829967,0.06348609,0.6390426,0.01040035,0.00005900209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3320357,0.0004580657,0.6471997,0.0007459612,0.00004870921,0.0001017663,0.0001186211,0.0003781898,0.01891323],"genre_scores_gemma":[0.9254522,0.0004321377,0.07010528,0.0001059545,0.00009406562,0.00009754403,0.0001419068,0.00006183292,0.003509073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001900744,"threshold_uncertainty_score":0.006358564,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2569741146","doi":"10.1109/tit.2013.2274264","title":"An Algebraic Approach to Physical-Layer Network Coding","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":234,"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":"Linear network coding; Decoding methods; Algebraic number; Computer science; Theoretical computer science; Coding (social sciences); Relay; Gaussian; Lattice (music); Encoding (memory); Mathematics; Algorithm; Topology (electrical circuits); Computer network; Artificial intelligence","authors":[{"name":"Chen Feng","is_ca":true},{"name":"Danilo Silva","is_ca":false},{"name":"Frank R. Kschischang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0224123968946915,"gpt":0.2554212682628074,"spread":0.2330088713681159,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009546984,0.0005648381,0.0004426546,0.0009556991,0.0007403017,0.001809633,0.001292168,0.0008553622,0.003628028],"category_scores_gemma":[0.002845229,0.0003313308,0.0006013672,0.001210062,0.002121124,0.00257363,0.001641414,0.002057318,0.0006911512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001554069,"about_ca_system_score_gemma":0.001068245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006584825,"about_ca_topic_score_gemma":0.0007251639,"domain_scores_codex":[0.9992396,0.0002663276,0.00004568721,0.0001061482,0.0002611423,0.000081108],"domain_scores_gemma":[0.9989123,0.0005759476,0.0001301406,0.0001714989,0.0001708296,0.00003918846],"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.000008121618,0.00000950075,0.00004954957,0.00004622947,0.000004467757,0.00003206427,0.00004757334,0.03186923,0.001203685,0.9583476,0.0005351557,0.007846817],"study_design_scores_gemma":[0.00001187612,0.00005043432,0.00006530783,0.00004067139,0.000008572522,0.0001326767,0.00004433926,0.312588,0.001390747,0.6741616,0.01148147,0.00002428637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004762427,0.0005494506,0.9734704,0.0005098851,0.00008282648,0.00005448854,0.00008470361,0.00004699571,0.02043878],"genre_scores_gemma":[0.4499594,0.00427306,0.5309391,0.0005282282,0.0005146599,0.0005423687,0.0002081547,0.00006443967,0.01297058],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003628028,"threshold_uncertainty_score":0.01213694,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011984612","doi":"10.1109/tit.2014.2321143","title":"Information Transmission Using the Nonlinear Fourier Transform, Part I: Mathematical Tools","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Chaos control and synchronization","field":"Physics and Astronomy","cited_by":231,"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":"Killam Trusts; University of Toronto; Sharif University of Technology; Technische Universität München; Canada Council for the Arts","keywords":"Nonlinear system; Fourier transform; Split-step method; Dispersion (optics); Integrable system; Transmission (telecommunications); Fourier analysis; Fourier series; Multiplexing","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01003503453401596,"gpt":0.2257264923978647,"spread":0.2156914578638487,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009339747,0.0008008242,0.0004404102,0.001669003,0.0006069744,0.001848263,0.0005120256,0.00114476,0.002614839],"category_scores_gemma":[0.001822399,0.000349105,0.0007307513,0.0009964762,0.00367317,0.002982428,0.001062241,0.002480332,0.00102054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009868043,"about_ca_system_score_gemma":0.0006483115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006238801,"about_ca_topic_score_gemma":0.0002557632,"domain_scores_codex":[0.9995209,0.0001438673,0.00004333941,0.00007500729,0.0001873878,0.00002944448],"domain_scores_gemma":[0.9994992,0.0002733579,0.00006151554,0.00008016478,0.00006975299,0.00001607613],"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.000007618259,0.00001579773,0.0000674516,0.0001172838,0.000006584432,0.00006322403,0.0001906215,0.002673979,0.00264968,0.9744856,0.002140281,0.01758191],"study_design_scores_gemma":[0.000009153082,0.00005540637,0.0002634391,0.0001443825,0.000009677589,0.0003346039,0.00005279027,0.0343434,0.002687278,0.9131945,0.04887118,0.00003420118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01288694,0.03794863,0.870931,0.004630321,0.002161139,0.00008744263,0.0002413112,0.0003074838,0.07080583],"genre_scores_gemma":[0.3923043,0.05684222,0.4997797,0.002143871,0.005473182,0.000645262,0.0003484551,0.0003480307,0.04211494],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002614839,"threshold_uncertainty_score":0.008747458,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015853863","doi":"10.1109/tit.2007.909169","title":"LLL Reduction Achieves the Receive Diversity in MIMO Decoding","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":202,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; MIMO; Fading; Lattice reduction; Mathematics; Algorithm; Reduction (mathematics); Computer science; Telecommunications; Channel (broadcasting)","authors":[{"name":"Mahmoud Taherzadeh","is_ca":true},{"name":"Amin Mobasher","is_ca":true},{"name":"Amir K. Khandani","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01389240243716282,"gpt":0.2402089153570055,"spread":0.2263165129198427,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008579162,0.0007639643,0.000869068,0.000389905,0.0005666545,0.001167162,0.0004932508,0.0008652598,0.001421496],"category_scores_gemma":[0.004175547,0.0003195014,0.0005221606,0.000444687,0.002247336,0.001132881,0.001705395,0.001485029,0.001380048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005398927,"about_ca_system_score_gemma":0.0008983681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00040655,"about_ca_topic_score_gemma":0.0004809991,"domain_scores_codex":[0.9980612,0.0006179692,0.00006934986,0.000191854,0.0007809215,0.0002785611],"domain_scores_gemma":[0.9979966,0.001055824,0.0001704703,0.000411819,0.0002980186,0.00006717339],"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.0005002747,0.0001955704,0.001034538,0.000277019,0.00005651934,0.0005006515,0.0004527949,0.2547756,0.1053048,0.4980538,0.005476509,0.1333719],"study_design_scores_gemma":[0.0000699909,0.0002280633,0.0002900851,0.00003467574,0.00001922583,0.0005395703,0.00006492005,0.6593109,0.07178238,0.2628258,0.004780226,0.00005424418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05226744,0.0003129063,0.9281102,0.0007064423,0.00007458142,0.00003818827,0.00009358337,0.0006608773,0.01773571],"genre_scores_gemma":[0.7853863,0.0004606515,0.2050914,0.0005815501,0.0001840707,0.000120877,0.0001621185,0.000185011,0.007828142],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001421496,"threshold_uncertainty_score":0.004755437,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145630771","doi":"10.1109/tit.2007.904983","title":"Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":174,"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; Bilayer; Relay; Code (set theory); Channel (broadcasting); Channel capacity; Decoding methods","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.02026939436584421,"gpt":0.2708845776144249,"spread":0.2506151832485807,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004764929,0.0003607307,0.0003100836,0.0004002963,0.0003012679,0.0004991457,0.0003993694,0.0004425502,0.0009910582],"category_scores_gemma":[0.002100914,0.0001588767,0.0002340581,0.0004330509,0.0005288228,0.0006675231,0.0006108051,0.0005988277,0.0003579429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005538968,"about_ca_system_score_gemma":0.0007024127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006864079,"about_ca_topic_score_gemma":0.0006931346,"domain_scores_codex":[0.9996705,0.00009888646,0.00001674381,0.00003202411,0.0001544035,0.00002740123],"domain_scores_gemma":[0.9994697,0.0002155396,0.00006270108,0.0001150524,0.0001175957,0.00001946249],"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.0001926582,0.00006066034,0.0006199253,0.0002330375,0.00002514887,0.0001856383,0.000198739,0.2911456,0.05757544,0.5457008,0.001346883,0.1027155],"study_design_scores_gemma":[0.00001816499,0.00007908655,0.0001071616,0.00002245658,0.00001156934,0.0001208237,0.00001566557,0.9306507,0.02150827,0.04322939,0.004215405,0.00002127246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02976765,0.0003148349,0.9664026,0.0001336899,0.00003544035,0.00005078905,0.00006123281,0.0001975304,0.003036049],"genre_scores_gemma":[0.5619239,0.0007343241,0.434965,0.00008189958,0.00002802095,0.000137358,0.0001151397,0.00004905554,0.001965402],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0009910582,"threshold_uncertainty_score":0.004018784,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2137106574","doi":"10.1109/tit.2005.850045","title":"A Generalized Framework for Distributed Power Control in Wireless Networks","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":173,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Power control; Throughput; Wireless; Computer network; Transmitter power output; Signal-to-interference ratio; Coding (social sciences); Transmission (telecommunications); Interference (communication); Wireless network; Code rate; Power (physics); Real-time computing; Algorithm; Telecommunications; Mathematics; Decoding methods; Transmitter; Channel (broadcasting)","authors":[{"name":"Chi Wan Sung","is_ca":false},{"name":"Kwong-Keung Leung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004185315579633416,"gpt":0.2103455253740328,"spread":0.2061602097943994,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00157732,0.001582958,0.00113276,0.0006883364,0.0006392404,0.001892401,0.002592212,0.001470078,0.003544894],"category_scores_gemma":[0.002145037,0.0004156703,0.0009526441,0.001509568,0.001624292,0.002063217,0.001732347,0.002501149,0.00104571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001223512,"about_ca_system_score_gemma":0.001229935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003219187,"about_ca_topic_score_gemma":0.003017066,"domain_scores_codex":[0.998831,0.0004322022,0.00006055869,0.000232443,0.0003521242,0.00009172301],"domain_scores_gemma":[0.9994797,0.0002315089,0.00004640796,0.0000872391,0.0001222292,0.00003290105],"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.00002593633,0.00002605644,0.0001059939,0.000133216,0.00003689475,0.0001761633,0.000105988,0.2914888,0.001249985,0.667227,0.004394787,0.03502908],"study_design_scores_gemma":[0.00002837621,0.00004766009,0.00007353508,0.0000305544,0.00001713502,0.00009320614,0.00002524771,0.7165431,0.0001973631,0.2623742,0.02055309,0.00001653628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007645672,0.0009579341,0.9940585,0.0002569066,0.0001249752,0.00002879278,0.00003888061,0.00007843105,0.003691017],"genre_scores_gemma":[0.3876293,0.01005728,0.5738956,0.0008462054,0.002087352,0.001232051,0.0003213433,0.000230215,0.02370069],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003544894,"threshold_uncertainty_score":0.01185888,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128555802","doi":"10.1109/tit.2009.2032817","title":"On Metrics for Error Correction in Network Coding","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":169,"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":"Linear network coding; Error detection and correction; Subspace topology; Computer science; Algorithm; Constant-weight code; Metric (unit); Coding (social sciences); Variable-length code; Theoretical computer science; Decoding methods; Topology (electrical circuits); Linear code; Mathematics; Block code; Computer network; Artificial intelligence; Statistics","authors":[{"name":"Danilo Silva","is_ca":true},{"name":"Frank R. Kschischang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02773562526010384,"gpt":0.2775726853735803,"spread":0.2498370601134765,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068773,0.002948845,0.001585996,0.0046102,0.001493093,0.00367198,0.002297366,0.003059837,0.003107969],"category_scores_gemma":[0.03170494,0.0005415786,0.001107169,0.004529339,0.006356724,0.009380047,0.005299162,0.00505221,0.001062365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004517328,"about_ca_system_score_gemma":0.001616384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002303312,"about_ca_topic_score_gemma":0.0008786698,"domain_scores_codex":[0.9925672,0.003617013,0.0004226741,0.0008593306,0.002080952,0.0004528929],"domain_scores_gemma":[0.9773453,0.01509345,0.001784271,0.00214715,0.002965859,0.0006639868],"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.000027521,0.000009567743,0.0001594905,0.00008111118,0.00001587757,0.00003743605,0.0001034688,0.03961077,0.0005285803,0.9431928,0.001313375,0.01491995],"study_design_scores_gemma":[0.000006602794,0.00006875081,0.0001364921,0.00008401911,0.00001115296,0.00007852248,0.00004071968,0.1355433,0.0007846802,0.856435,0.006774958,0.0000358593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009786433,0.006016463,0.9629537,0.001392048,0.0003268282,0.00008513058,0.0002416229,0.0001892018,0.01900842],"genre_scores_gemma":[0.5658817,0.01846983,0.3891892,0.001380926,0.002181491,0.0008876274,0.001257942,0.0007776365,0.01997358],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0068773,"threshold_uncertainty_score":0.03637111,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058936451","doi":"10.1109/tit.2006.872849","title":"Sigma-delta (/spl Sigma//spl Delta/) quantization and finite frames","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":156,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Quantization (signal processing); Sigma; Mathematics; Norm (philosophy); Upper and lower bounds; Mean squared error; Delta-sigma modulation; Combinatorics; Physics; Algorithm; Mathematical analysis; Statistics; Quantum mechanics","authors":[{"name":"John J. Benedetto","is_ca":false},{"name":"Alexander M. Powell","is_ca":false},{"name":"Özgür Yılmaz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009930336720268619,"gpt":0.2385886236583999,"spread":0.2286582869381313,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008510399,0.0005124447,0.0004960806,0.0005043311,0.000246993,0.0009484026,0.0008267263,0.0006784484,0.002086371],"category_scores_gemma":[0.003741796,0.0002467198,0.0002676703,0.0007900873,0.001007534,0.001156952,0.0008746844,0.001217867,0.0006139266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006005144,"about_ca_system_score_gemma":0.0004900617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00111424,"about_ca_topic_score_gemma":0.001297841,"domain_scores_codex":[0.9993229,0.0001813572,0.00005552995,0.0001128001,0.0002849443,0.00004246485],"domain_scores_gemma":[0.999062,0.0004118651,0.0001161079,0.0001625361,0.0002205544,0.00002691175],"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.000318227,0.000032991,0.0006084556,0.0003112572,0.00003133446,0.0002437501,0.0002364267,0.1327124,0.04585979,0.4549743,0.002792859,0.3618783],"study_design_scores_gemma":[0.00001484432,0.0001320152,0.0003759454,0.00008735604,0.00001458082,0.00034811,0.00005169715,0.8314122,0.03971132,0.1148465,0.01296568,0.00003976616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005738975,0.0008914429,0.9914118,0.00007038398,0.00005603757,0.00001367659,0.00002801712,0.0001252484,0.001664326],"genre_scores_gemma":[0.2527875,0.001803826,0.7391105,0.0001660543,0.0001140399,0.00007994006,0.0001965156,0.00009021273,0.005651464],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002086371,"threshold_uncertainty_score":0.006979585,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152678257","doi":"10.1109/tit.2014.2321155","title":"Information Transmission Using the Nonlinear Fourier Transform, Part III: Spectrum Modulation","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Optical Network Technologies","field":"Engineering","cited_by":156,"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":"Multiplexing; Nonlinear system; Fourier transform; Modulation (music); Nonlinear distortion; Transmission (telecommunications); SIGNAL (programming language); Delta modulation; Wavelength-division multiplexing; Signal processing","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.007045735550853316,"gpt":0.2000743907244406,"spread":0.1930286551735873,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002107514,0.0003492091,0.0003175627,0.0003238679,0.0002736447,0.0007719131,0.0002723921,0.0006115267,0.00197829],"category_scores_gemma":[0.0004842392,0.0001306712,0.0002240337,0.0004666574,0.0009499313,0.0008341586,0.0004411658,0.000598174,0.0006213007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003514555,"about_ca_system_score_gemma":0.0001546586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002815032,"about_ca_topic_score_gemma":0.0001822288,"domain_scores_codex":[0.9998492,0.0000301815,0.000007805348,0.00002169931,0.00007377614,0.00001736307],"domain_scores_gemma":[0.9999096,0.00004325467,0.00001272239,0.0000182081,0.00001241432,0.000003746041],"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.0001608583,0.00007194791,0.0004068969,0.0005295404,0.00002640239,0.0003634948,0.0003227997,0.02146896,0.2054425,0.6096616,0.004051945,0.1574931],"study_design_scores_gemma":[0.0000402595,0.0004538032,0.00243946,0.0002578657,0.00004100096,0.002913985,0.0001648357,0.4988112,0.1365281,0.264258,0.09397736,0.0001140654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1117946,0.02954858,0.7276155,0.001454199,0.001058254,0.0001221285,0.0001623315,0.0003014024,0.1279429],"genre_scores_gemma":[0.837348,0.01923744,0.1097046,0.0004875637,0.0007559279,0.0001405787,0.0001593365,0.00009794098,0.0320687],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00197829,"threshold_uncertainty_score":0.006618023,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4312763750","doi":"10.1109/tit.2022.3227538","title":"Two-Timescale Design for Reconfigurable Intelligent Surface-Aided Massive MIMO Systems With Imperfect CSI","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":151,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"European Research Council; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; Università degli Studi dell'Aquila; Centre National de la Recherche Scientifique; Killam Trusts; Bundesministerium für Bildung und Forschung; University of Technology Sydney; University of New South Wales; School of Electronic Engineering and Computer Science, Queen Mary University of London; Académie des Sciences, Institut de France; Queen Mary University of London; Commonwealth Scientific and Industrial Research Organisation; National Science Foundation; Beijing University of Posts and Telecommunications; European Commission; Alexander von Humboldt-Stiftung; Vodafone Foundation; University of Warwick; Northumbria University; Deutsche Forschungsgemeinschaft; Nokia Foundation; Jiangsu Science and Technology Department; China Scholarship Council; University of Essex; National Natural Science Foundation of China; Royal Academy of Engineering","keywords":"Rician fading; MIMO; Fading; Computer science; Channel state information; Beamforming; Transmitter power output; Base station; Channel (broadcasting); Spatial correlation; Control theory (sociology); Algorithm; Electronic engineering; Wireless; Telecommunications; Engineering; Transmitter","authors":[{"name":"Kangda Zhi","is_ca":false},{"name":"Cunhua Pan","is_ca":false},{"name":"Hong Ren","is_ca":false},{"name":"Kezhi Wang","is_ca":false},{"name":"Maged Elkashlan","is_ca":false},{"name":"Marco Di Renzo","is_ca":false},{"name":"Robert Schober","is_ca":false},{"name":"H. Vincent Poor","is_ca":false},{"name":"Jiangzhou Wang","is_ca":false},{"name":"Lajos Hanzo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01544285623752507,"gpt":0.2224374951626247,"spread":0.2069946389250996,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003453254,0.0006935569,0.0005209168,0.0002016359,0.0002954263,0.0006523762,0.000770425,0.0004884506,0.001188862],"category_scores_gemma":[0.001009028,0.0002236482,0.0003193396,0.0002966611,0.0004377703,0.0005847736,0.000740813,0.0005133587,0.0003784501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003461998,"about_ca_system_score_gemma":0.0003928811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006974576,"about_ca_topic_score_gemma":0.0009890863,"domain_scores_codex":[0.9996079,0.000101824,0.00001517153,0.000081308,0.0001233342,0.00007060201],"domain_scores_gemma":[0.9996105,0.000119497,0.0001003148,0.00006059636,0.00007459197,0.00003447149],"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.0002476415,0.00007656637,0.001214728,0.0001656501,0.00006330793,0.0003546193,0.0002082558,0.806035,0.05922987,0.01952731,0.001363809,0.1115132],"study_design_scores_gemma":[0.00001011532,0.0001743289,0.0002070833,0.000006611943,0.00001099729,0.00008098855,0.00002374261,0.9936515,0.003384654,0.001542179,0.000896848,0.00001087265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03732476,0.0002342736,0.9575719,0.0001136628,0.00004934603,0.00002872233,0.00002752294,0.0002497328,0.00440015],"genre_scores_gemma":[0.9430749,0.0001534955,0.05525021,0.00007281216,0.0000327897,0.00005484908,0.00003228947,0.00001595386,0.001312702],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001188862,"threshold_uncertainty_score":0.00397718,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3026218946","doi":"10.1109/tit.2020.2996543","title":"Levenshtein Distance, Sequence Comparison and Biological Database Search","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":150,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"National Institute of General Medical Sciences; National Institutes of Health","keywords":"Levenshtein distance; Edit distance; Nearest neighbor search; Heuristics; Computer science; Metric (unit); Similarity (geometry); Data mining; Smith–Waterman algorithm; Database; Theoretical computer science; Artificial intelligence; Sequence alignment; Biology","authors":[{"name":"Bonnie Berger","is_ca":false},{"name":"Michael S. Waterman","is_ca":false},{"name":"Yun William Yu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04782399564894595,"gpt":0.2778887731993038,"spread":0.2300647775503578,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003443483,0.000801907,0.002095181,0.005300562,0.0008679905,0.003998686,0.002465859,0.002166261,0.003129849],"category_scores_gemma":[0.0146106,0.0004200996,0.0008116223,0.01002275,0.00385721,0.007971514,0.002477349,0.002039287,0.001920384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002240685,"about_ca_system_score_gemma":0.001506453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002495119,"about_ca_topic_score_gemma":0.001531971,"domain_scores_codex":[0.9951873,0.001359054,0.0004820423,0.0008710427,0.001910459,0.0001900204],"domain_scores_gemma":[0.9948682,0.00352213,0.0004436806,0.000362615,0.0006740957,0.0001293163],"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.0001446504,0.00006399905,0.001468648,0.002050488,0.0001402033,0.0003546281,0.0003367045,0.04587206,0.004006873,0.4272676,0.008299133,0.509995],"study_design_scores_gemma":[0.0000195249,0.0001446886,0.001441126,0.0003194208,0.00004432027,0.001116357,0.0002412223,0.1143796,0.005145313,0.795156,0.08189297,0.00009951864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01286812,0.1447018,0.8181243,0.002474359,0.0007296243,0.0001228571,0.0005120327,0.0008611238,0.0196058],"genre_scores_gemma":[0.2236068,0.07989604,0.6824314,0.00107083,0.001661545,0.0003448386,0.001726698,0.0003979028,0.008863887],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005300562,"threshold_uncertainty_score":0.01821107,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143019587","doi":"10.1109/tit.2002.804044","title":"New designs for signal sets with low cross correlation, balance property, and large linear span: GF(p) case","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":144,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Autocorrelation; Mathematics; Linear span; Sequence (biology); Quadratic equation; Binary number; Span (engineering); Discrete mathematics; Algorithm; Combinatorics; Statistics; Arithmetic; Engineering","authors":[{"name":"Guang Gong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01601449989209099,"gpt":0.2309714948572693,"spread":0.2149569949651783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007401726,0.0006999669,0.0004532702,0.0007167035,0.0006640314,0.0005384705,0.0007888171,0.0004727927,0.002847729],"category_scores_gemma":[0.002126804,0.0002931489,0.0003517317,0.0008088971,0.0004952533,0.001270037,0.0007112192,0.0006534592,0.0008709224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006748462,"about_ca_system_score_gemma":0.0004236868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002887914,"about_ca_topic_score_gemma":0.0005532609,"domain_scores_codex":[0.9993194,0.0001783148,0.00007660278,0.0001180785,0.0002179477,0.00008957805],"domain_scores_gemma":[0.9987192,0.0004032693,0.0002654948,0.0002235492,0.0003216552,0.00006684167],"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.001921353,0.0002257342,0.002061558,0.000685561,0.0001259975,0.0009414532,0.0005813222,0.03758866,0.2124125,0.1442374,0.006812376,0.5924061],"study_design_scores_gemma":[0.0006858656,0.004279216,0.00315843,0.000453331,0.0003173507,0.005955861,0.0003133649,0.3491038,0.3913013,0.1341872,0.110011,0.0002333873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1046345,0.001440117,0.8846711,0.0003026107,0.0001585322,0.0001791296,0.0001997898,0.0009777433,0.007436494],"genre_scores_gemma":[0.5475333,0.0008703836,0.4440228,0.0003197782,0.0002769379,0.0005665596,0.0005701118,0.000114948,0.005725141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002847729,"threshold_uncertainty_score":0.00952661,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116213015","doi":"10.1109/tit.2010.2080470","title":"Capacity Bounds for Wireless Optical Intensity Channels With Gaussian Noise","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":143,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Upper and lower bounds; Channel capacity; Mathematics; Topology (electrical circuits); Entropy (arrow of time); Optical wireless; Channel (broadcasting); Gaussian; Telecommunications; Wireless; Mathematical analysis; Combinatorics; Physics; Computer science; Quantum mechanics","authors":[{"name":"Ahmed A. Farid","is_ca":true},{"name":"Steve Hranilovic","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009872243119052807,"gpt":0.2060927511542161,"spread":0.1962205080351633,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003267221,0.001928208,0.001259014,0.002476364,0.0009687781,0.003325371,0.001831339,0.001210649,0.006240508],"category_scores_gemma":[0.02096251,0.0005661241,0.0007245147,0.002644852,0.002725694,0.004429583,0.00305386,0.002722844,0.001086811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003503437,"about_ca_system_score_gemma":0.00140872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002340335,"about_ca_topic_score_gemma":0.001786719,"domain_scores_codex":[0.9971551,0.0006516476,0.0001120676,0.0002603476,0.001093435,0.000727342],"domain_scores_gemma":[0.9816467,0.01391905,0.0009398402,0.0009217992,0.002259252,0.0003133968],"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.0002307823,0.00007489025,0.0005870783,0.0004078803,0.00005380132,0.0002231116,0.0002823123,0.5921935,0.007595449,0.3554646,0.005534266,0.03735222],"study_design_scores_gemma":[0.00001184073,0.00004015313,0.0003210311,0.0001191386,0.00001946349,0.00011698,0.00006968123,0.8442607,0.003687009,0.1485971,0.002715018,0.00004191955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04027532,0.006750242,0.9133672,0.001783529,0.0002329088,0.00007465669,0.0007178825,0.0005379512,0.03626031],"genre_scores_gemma":[0.9213974,0.007752778,0.05998469,0.0006792528,0.0008171254,0.0005707369,0.0007900381,0.0002805525,0.007727467],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006240508,"threshold_uncertainty_score":0.02541935,"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":"W2143772938","doi":"10.1109/tit.2007.901248","title":"Dual RSA and Its Security Analysis","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cryptography and Data Security","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 Waterloo","funders":"","keywords":"PKCS #1; Public-key cryptography; Computer science; Dual (grammatical number); Secrecy; Cryptography; Key generation; Information-theoretic security; Key size; Authentication (law); Security analysis; Key (lock); Theoretical computer science; Mathematics; Computer security; Encryption","authors":[{"name":"Hung–Min Sun","is_ca":false},{"name":"Mu‐En Wu","is_ca":false},{"name":"Wei-Chi Ting","is_ca":false},{"name":"M. Jason Hinek","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006610957988836975,"gpt":0.2277177245244399,"spread":0.2211067665356029,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002832391,0.000931379,0.0007089798,0.002170585,0.001017613,0.003570336,0.001248727,0.001337386,0.004920909],"category_scores_gemma":[0.008233706,0.000631393,0.001296052,0.001322275,0.003328573,0.006625334,0.003459468,0.004286138,0.002506715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001300935,"about_ca_system_score_gemma":0.0008896925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003077659,"about_ca_topic_score_gemma":0.0001238065,"domain_scores_codex":[0.9958864,0.001071612,0.0002517208,0.0007179885,0.00163999,0.0004323858],"domain_scores_gemma":[0.9947051,0.001992984,0.0004825938,0.00169629,0.0009125293,0.0002103518],"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.000127255,0.00003280644,0.0003828093,0.00009161096,0.00002316303,0.0001334982,0.0001027514,0.005069306,0.00461844,0.9576022,0.002120179,0.02969601],"study_design_scores_gemma":[0.00003665025,0.00008617776,0.0002479191,0.00007504567,0.00003719554,0.001443624,0.0000596326,0.07032064,0.008488052,0.8792057,0.03994333,0.00005596538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04489843,0.007241724,0.8379041,0.003816542,0.0008588335,0.0001436274,0.0002891136,0.0004604206,0.1043873],"genre_scores_gemma":[0.7642855,0.005286107,0.2103457,0.0009905827,0.001298647,0.0002072655,0.0002789956,0.0002090094,0.01709824],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004920909,"threshold_uncertainty_score":0.01646203,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1608621648","doi":"10.1109/tit.2009.2018339","title":"Quantum Serial Turbo Codes","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute; Université de Sherbrooke","funders":"","keywords":"Turbo code; Serial concatenated convolutional codes; Quantum convolutional code; Convolutional code; Concatenated error correction code; Low-density parity-check code; Algorithm; Computer science; Block code; Linear code; Theoretical computer science; BCJR algorithm; Decoding methods","authors":[{"name":"David Poulin","is_ca":true},{"name":"Jean–Pierre Tillich","is_ca":false},{"name":"H Ollivier","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006329227655511901,"gpt":0.2174012273477657,"spread":0.2110719996922538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005241437,0.0003958438,0.0005028867,0.0007341516,0.0009446839,0.0009300613,0.0008191491,0.001114817,0.00482996],"category_scores_gemma":[0.001929774,0.0002729794,0.0006122593,0.0006432848,0.001418895,0.001312279,0.0008352857,0.000748274,0.001169481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008947389,"about_ca_system_score_gemma":0.001059164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001177151,"about_ca_topic_score_gemma":0.000907752,"domain_scores_codex":[0.9994401,0.0001463534,0.00003128574,0.00006500788,0.0002427049,0.00007445958],"domain_scores_gemma":[0.9990228,0.0003073101,0.00009690619,0.0002082996,0.0003070508,0.0000575905],"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.00003513697,0.0000217828,0.000284884,0.00005898562,0.00001214527,0.0001125039,0.00008361478,0.07463139,0.003114624,0.9108036,0.001232315,0.009609045],"study_design_scores_gemma":[0.00002688405,0.00007826044,0.0002379955,0.0000410412,0.00001728134,0.0003666771,0.00004189651,0.7039805,0.007016356,0.2770752,0.01107209,0.00004579534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07732542,0.0006165877,0.8738598,0.0003717392,0.000184775,0.0001240853,0.0001921425,0.0004774393,0.04684804],"genre_scores_gemma":[0.785638,0.0007910567,0.1922546,0.000380698,0.0001312649,0.0002270727,0.0002824777,0.0001960136,0.02009859],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00482996,"threshold_uncertainty_score":0.01615787,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2294622949","doi":"10.1109/tit.2017.2688381","title":"Exponential Decay of Reconstruction Error From Binary Measurements of Sparse Signals","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":114,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Army Research Office; Simons Foundation; American Institute of Mathematics; National Science Foundation","keywords":"Quantization (signal processing); Oversampling; Algorithm; Compressed sensing; Thresholding; Binary number; Computer science; Normalization (sociology); Signal reconstruction; Exponential function; Mathematics; Signal processing; Artificial intelligence; Bandwidth (computing); Digital signal processing; Arithmetic","authors":[{"name":"Richard G. Baraniuk","is_ca":false},{"name":"Simon Foucart","is_ca":false},{"name":"Deanna Needell","is_ca":false},{"name":"Yaniv Plan","is_ca":true},{"name":"Mary Wootters","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03830852518159136,"gpt":0.2505299503411701,"spread":0.2122214251595788,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00850475,0.001056957,0.001169868,0.000701028,0.0003492363,0.001222975,0.001445028,0.001688499,0.00173692],"category_scores_gemma":[0.05645372,0.0006034361,0.0005395848,0.0006452329,0.002405389,0.003528758,0.002592703,0.002849891,0.0006101575],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001244804,"about_ca_system_score_gemma":0.001082701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001396061,"about_ca_topic_score_gemma":0.0009773653,"domain_scores_codex":[0.9959259,0.001028432,0.0002857123,0.0006749599,0.001801271,0.000283699],"domain_scores_gemma":[0.9682521,0.02452719,0.001856781,0.002596099,0.002328364,0.0004393815],"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.001588363,0.0001790009,0.005582762,0.0008792722,0.0001574534,0.0004913636,0.0007161848,0.6763823,0.06162141,0.1313845,0.002480266,0.1185372],"study_design_scores_gemma":[0.00002227991,0.0001122804,0.001034558,0.00009590545,0.00001295982,0.0001375069,0.00005446043,0.9579249,0.01534881,0.02448726,0.0007373645,0.0000315969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06131441,0.0009149937,0.9339,0.000787013,0.00007371526,0.00003567079,0.0001221541,0.0005000381,0.002352051],"genre_scores_gemma":[0.6607657,0.00138687,0.3309366,0.0005634034,0.00009279799,0.0001850318,0.0005093237,0.0004217717,0.005138448],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00850475,"threshold_uncertainty_score":0.04497796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159581371","doi":"10.1109/tit.2003.811928","title":"Optical intensity-modulated direct detection channels: signal space and lattice codes","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":114,"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":"Bandwidth (computing); Coding (social sciences); Constellation diagram; Coding gain; Lattice (music); Intensity modulation; Optical communication; Constellation; Optical wireless; Channel capacity; Computer science; Channel (broadcasting); Mathematics; Topology (electrical circuits); Electronic engineering; Wireless; Algorithm; Telecommunications; Optics; Decoding methods; Physics; Bit error rate; Phase modulation; Acoustics; Engineering","authors":[{"name":"Steve Hranilovic","is_ca":true},{"name":"Frank R. Kschischang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008450431315789961,"gpt":0.2000116519969346,"spread":0.1915612206811446,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007505582,0.0004482951,0.0004181538,0.0004689852,0.0003311779,0.001360025,0.0007972384,0.0009174079,0.001385479],"category_scores_gemma":[0.002141885,0.0002485301,0.0003032514,0.0007014879,0.00209605,0.001656062,0.0006588092,0.0009512596,0.000461995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000936257,"about_ca_system_score_gemma":0.0006514697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007595334,"about_ca_topic_score_gemma":0.0005645345,"domain_scores_codex":[0.9993873,0.0002171233,0.00001637734,0.00005300067,0.0002598323,0.00006644445],"domain_scores_gemma":[0.9991289,0.0003731932,0.000131628,0.0001595894,0.0001575049,0.00004923484],"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.00005180968,0.00001794613,0.0001078451,0.00003006635,0.000004465551,0.00003680147,0.00004507618,0.204941,0.003252236,0.781643,0.0004247105,0.00944504],"study_design_scores_gemma":[0.00001676413,0.00004576231,0.00005790992,0.00001475805,0.000002557512,0.00006572751,0.00002124977,0.6696715,0.002081215,0.3258496,0.00215444,0.00001858873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03990424,0.0006167412,0.9462357,0.0003735281,0.00005736992,0.00003909734,0.00009951677,0.0001411283,0.01253277],"genre_scores_gemma":[0.7885129,0.001008606,0.2043561,0.0001775843,0.0001174206,0.0001364688,0.0001330923,0.00006102436,0.0054968],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001385479,"threshold_uncertainty_score":0.006793022,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2103286274","doi":"10.1109/tit.2003.809569","title":"The inequalities of quantum information theory","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Von Neumann entropy; Combinatorics; Multipartite; Density matrix; Quantum relative entropy; Discrete mathematics; Subadditivity; Quantum state; Entropy (arrow of time); Monotonic function; Quantum; Quantum entanglement; Quantum discord; Quantum mechanics; Mathematical analysis; Physics","authors":[{"name":"Nicholas Pippenger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007305151534862395,"gpt":0.2129751825237104,"spread":0.205670030988848,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003863784,0.0007823868,0.0008394948,0.001539749,0.001436379,0.003487033,0.00111735,0.001260988,0.007086628],"category_scores_gemma":[0.01358809,0.0003687794,0.0009960206,0.001922427,0.005212517,0.005271378,0.002713066,0.004314645,0.0008330251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004695223,"about_ca_system_score_gemma":0.00161963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005177288,"about_ca_topic_score_gemma":0.001894005,"domain_scores_codex":[0.9961058,0.001360451,0.0002131965,0.0006643254,0.001119661,0.0005365133],"domain_scores_gemma":[0.9925764,0.005364711,0.0003519228,0.0005147324,0.0009943048,0.000197975],"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.000007117666,0.000002294201,0.00006705328,0.00002542568,0.000005290202,0.000009978296,0.00007267521,0.001084563,0.0001207514,0.9925383,0.001344753,0.004721933],"study_design_scores_gemma":[0.000004768071,0.000008593495,0.0001626275,0.00002275722,0.000003355327,0.00001522589,0.00002470728,0.006782499,0.0001123721,0.9859304,0.006925516,0.000007109632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04435011,0.0206542,0.6550065,0.02028134,0.001046481,0.0001609964,0.003290456,0.000155156,0.2550547],"genre_scores_gemma":[0.8108175,0.01220858,0.1381287,0.00459565,0.002578098,0.0006996655,0.001322302,0.0001424025,0.02950712],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007086628,"threshold_uncertainty_score":0.03406638,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131876845","doi":"10.1109/tit.2007.904773","title":"Delay-Tolerant Distributed-TAST Codes for Cooperative Diversity","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Block code; Computer science; Decoding methods; Cooperative diversity; Antenna diversity; Code (set theory); Linear code; Transmission (telecommunications); Space–time block code; Fountain code; Full Rate; Constellation; Theoretical computer science; Algorithm; Telecommunications; Antenna (radio); Fading","authors":[{"name":"Mohamed Oussama Damen","is_ca":true},{"name":"A. Roger Hammons","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02343281527466811,"gpt":0.2602419983474376,"spread":0.2368091830727695,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006011706,0.000343029,0.000375573,0.0004790972,0.0004961097,0.0006754256,0.0005607461,0.0004397691,0.0008340418],"category_scores_gemma":[0.002954875,0.0001617576,0.0003325846,0.0006980285,0.0010185,0.0008387131,0.0009600958,0.0009598104,0.0002524167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008176347,"about_ca_system_score_gemma":0.001284893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008282939,"about_ca_topic_score_gemma":0.0009436175,"domain_scores_codex":[0.9994893,0.00009126926,0.00003629066,0.00007170778,0.0002421752,0.00006907232],"domain_scores_gemma":[0.9984004,0.0004809399,0.0003419562,0.0003082739,0.0003620985,0.000106371],"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.0002520776,0.00003894691,0.0006339931,0.0001223709,0.00002225961,0.0001687418,0.0003186399,0.2411281,0.02698013,0.6551644,0.001541104,0.07362913],"study_design_scores_gemma":[0.00005931351,0.0002665812,0.000166586,0.00003871984,0.00001902537,0.0003466274,0.00005177419,0.7328155,0.01344953,0.2412324,0.01151434,0.0000395752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06542389,0.0005402721,0.9293234,0.0001949552,0.00009264649,0.00005323224,0.00009068488,0.0002097138,0.00407123],"genre_scores_gemma":[0.8321612,0.000681878,0.1625997,0.000165828,0.00008990859,0.0001797555,0.0001606557,0.00005008387,0.003910978],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0008340418,"threshold_uncertainty_score":0.00593245,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105854862","doi":"10.1109/tit.2007.915887","title":"On the User Selection for MIMO Broadcast Channels","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":108,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Telecommunications link; Rayleigh fading; Base station; Throughput; Computer science; MIMO; Fading; Selection (genetic algorithm); Set (abstract data type); Communications system; Mathematical optimization; Algorithm; Mathematics; Computer network; Telecommunications; Wireless; Decoding methods; Channel (broadcasting)","authors":[{"name":"Alireza Bayesteh","is_ca":true},{"name":"Amir K. Khandani","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01063049383997389,"gpt":0.2045153286103264,"spread":0.1938848347703525,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001132704,0.0007180414,0.001084371,0.0005184621,0.0006968274,0.001027644,0.000603678,0.0006670744,0.002516129],"category_scores_gemma":[0.005115571,0.000363667,0.0003291119,0.001064067,0.0008854049,0.0008495354,0.0007488232,0.0005992431,0.0005527323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007587857,"about_ca_system_score_gemma":0.0009474759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00281123,"about_ca_topic_score_gemma":0.003085572,"domain_scores_codex":[0.9986315,0.0007629893,0.00002354547,0.0001189825,0.0002961995,0.0001667348],"domain_scores_gemma":[0.9973557,0.002184927,0.000101067,0.0001093773,0.0001926854,0.00005618064],"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.0007709299,0.00007917082,0.001727156,0.0003028279,0.00008927293,0.0004882601,0.0002871003,0.7514009,0.007658399,0.121208,0.007214452,0.1087734],"study_design_scores_gemma":[0.00003205037,0.00005421885,0.0002095419,0.00001238136,0.00001975191,0.0001012917,0.00002729666,0.9846374,0.001109902,0.01225572,0.001527186,0.00001324683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02469997,0.001140912,0.9678636,0.0002911311,0.00007129108,0.00005216632,0.00008188761,0.0001662578,0.00563276],"genre_scores_gemma":[0.8747454,0.002041077,0.1163769,0.0001798985,0.0003622552,0.0001854589,0.0001476294,0.00005522255,0.005906164],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00281123,"threshold_uncertainty_score":0.008417249,"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":"W2160348245","doi":"10.1109/tit.2008.2011516","title":"A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of Calgary","funders":"","keywords":"Linear network coding; Multicast; Computer science; Coding (social sciences); Computer network; Upper and lower bounds; Bounded function; Throughput; Theoretical computer science; Mathematics; Telecommunications","authors":[{"name":"Zongpeng Li","is_ca":true},{"name":"Baochun Li","is_ca":true},{"name":"Lap Chi Lau","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01700696795083134,"gpt":0.2562433237211498,"spread":0.2392363557703184,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005672565,0.002486345,0.001598957,0.002106488,0.001466824,0.003230086,0.002650264,0.002046321,0.006044436],"category_scores_gemma":[0.04505597,0.0007452158,0.001200813,0.002544893,0.003915657,0.005885977,0.004159059,0.005019811,0.001474048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003727548,"about_ca_system_score_gemma":0.001705623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001262293,"about_ca_topic_score_gemma":0.0008530542,"domain_scores_codex":[0.9935516,0.002068109,0.0001635963,0.0009869009,0.001706809,0.001523002],"domain_scores_gemma":[0.9586095,0.03447553,0.001775082,0.002942906,0.001527701,0.0006692663],"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.001279255,0.0002345576,0.001279301,0.0009638037,0.0002042047,0.0005413648,0.000569923,0.3755158,0.03507061,0.4427899,0.01424395,0.1273075],"study_design_scores_gemma":[0.00008691657,0.0004059858,0.0009556946,0.0003677245,0.0002375349,0.0007765615,0.0001632413,0.5998129,0.02603015,0.3586764,0.01237968,0.0001072603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08366507,0.01420045,0.8217072,0.00629712,0.0009184292,0.0001443711,0.00054682,0.002331904,0.07018869],"genre_scores_gemma":[0.9028355,0.007590193,0.07974023,0.00176137,0.001023993,0.0003775041,0.0003148809,0.0007874306,0.005568872],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006044436,"threshold_uncertainty_score":0.02999973,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146818257","doi":"10.1109/tit.2008.2011518","title":"Capacity of a Class of Modulo-Sum Relay Channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":103,"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":"Relay channel; Relay; Transmitter; Channel capacity; Modulo; Topology (electrical circuits); Channel (broadcasting); Mathematics; Noise (video); Computer science; Telecommunications; Discrete mathematics; Combinatorics; Artificial intelligence","authors":[{"name":"Marko Aleksic","is_ca":true},{"name":"Peyman Razaghi","is_ca":true},{"name":"Wei Yu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02453187754079024,"gpt":0.2445473489539233,"spread":0.2200154714131331,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001556097,0.0007654721,0.0009551435,0.001522092,0.0009057809,0.002881241,0.001326339,0.0009344572,0.00392589],"category_scores_gemma":[0.006995593,0.0002764219,0.0005623716,0.001277673,0.002364925,0.00261736,0.001554044,0.001133778,0.0005376321],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001916326,"about_ca_system_score_gemma":0.001084158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001290595,"about_ca_topic_score_gemma":0.000467347,"domain_scores_codex":[0.998326,0.0004159131,0.00005257337,0.0002488878,0.0004821811,0.0004743612],"domain_scores_gemma":[0.9942434,0.004041765,0.0005248288,0.0004857971,0.00049205,0.0002121121],"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.0003540509,0.00006229655,0.0008608275,0.0001666456,0.00005169395,0.0003113848,0.0003523804,0.1944962,0.005998509,0.7757963,0.003349612,0.01820004],"study_design_scores_gemma":[0.00005895259,0.00007172118,0.0004622692,0.00005666258,0.00003126273,0.000338569,0.0001032868,0.6219763,0.004009386,0.3687564,0.004082769,0.00005235567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5351323,0.002029476,0.4050863,0.001390239,0.0001147941,0.0001909936,0.00177265,0.0006385346,0.05364475],"genre_scores_gemma":[0.9909251,0.0006176458,0.006118454,0.00008065741,0.0000783487,0.000115314,0.0002277062,0.00003362045,0.001803229],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00392589,"threshold_uncertainty_score":0.01390392,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106711692","doi":"10.1109/tit.2003.809560","title":"Secret-key agreement over unauthenticated public channels-part II: the simulatability condition","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":103,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"A priori and a posteriori; Computer science; Formalism (music); Key (lock); Secret sharing; Context (archaeology); Theoretical computer science; Representation (politics); Authentication (law); Channel (broadcasting); Cryptography; Computer security; Mathematics; Topology (electrical circuits); Computer network; Combinatorics","authors":[{"name":"Ueli Maurer","is_ca":false},{"name":"Stefan Wolf","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01434947389589895,"gpt":0.2329499708838691,"spread":0.2186004969879702,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00983493,0.001207547,0.001826839,0.001322349,0.002130414,0.004567206,0.002232697,0.003863969,0.006952168],"category_scores_gemma":[0.03166406,0.001046614,0.002517789,0.00162654,0.0108151,0.01536498,0.004858063,0.006874766,0.001936256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002721956,"about_ca_system_score_gemma":0.002774663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000621399,"about_ca_topic_score_gemma":0.0003039426,"domain_scores_codex":[0.9895112,0.003109517,0.0007602075,0.002219585,0.003032407,0.001367112],"domain_scores_gemma":[0.9714983,0.02042266,0.002113192,0.004029721,0.001496929,0.0004390792],"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.0001112112,0.00001948666,0.0001465485,0.00005432304,0.00001461162,0.000132618,0.0001809606,0.008191499,0.001105723,0.9871159,0.0005694016,0.002357643],"study_design_scores_gemma":[0.00006822654,0.00004256632,0.00005233999,0.00002566051,0.00001142261,0.0001446477,0.00003203327,0.06275751,0.003023368,0.9319428,0.001879454,0.00001994182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02716506,0.0003696586,0.9570019,0.001722524,0.0001277133,0.0002083845,0.0003731371,0.0002303959,0.0128012],"genre_scores_gemma":[0.8804392,0.0009508405,0.1065538,0.0007550141,0.0003841254,0.001326976,0.000707377,0.00016719,0.008715449],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00983493,"threshold_uncertainty_score":0.05201268,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130433404","doi":"10.1109/tit.2003.818411","title":"Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Algorithm; Data compression; Lossless compression; Mathematics; Countable set; Entropy encoding; Arithmetic coding; Discrete mathematics; Theoretical computer science; Computer science; Context-adaptive binary arithmetic coding","authors":[{"name":"En‐hui Yang","is_ca":true},{"name":"Dake He","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02623472200375592,"gpt":0.242439027781114,"spread":0.2162043057773581,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068594,0.0007808629,0.0007527643,0.0009214964,0.0004177271,0.0007165915,0.00130197,0.000888231,0.001023736],"category_scores_gemma":[0.002780165,0.0003190463,0.0006072923,0.001501455,0.0009607244,0.001654175,0.001600252,0.001232451,0.0005362043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007056578,"about_ca_system_score_gemma":0.0008620404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001035321,"about_ca_topic_score_gemma":0.001246448,"domain_scores_codex":[0.9995431,0.0001045135,0.00003313881,0.0001080484,0.0001666077,0.00004466209],"domain_scores_gemma":[0.9992993,0.0003653319,0.0000661368,0.0001533761,0.000089753,0.00002618106],"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.0002191813,0.0001094587,0.000743768,0.0001817007,0.0000596119,0.0002165274,0.0003066789,0.1979513,0.03225037,0.142262,0.004235264,0.621464],"study_design_scores_gemma":[0.00002213065,0.00005912717,0.0001210735,0.00001373371,0.00001255908,0.000212888,0.00002898576,0.9460542,0.01324189,0.0381138,0.002105585,0.00001402356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01145538,0.0004440444,0.9866229,0.0001172225,0.00002940775,0.00005184708,0.00004909204,0.0004448514,0.0007853],"genre_scores_gemma":[0.2016503,0.0005173312,0.795517,0.00015832,0.00005961966,0.0002066233,0.0002454277,0.00009681933,0.001548511],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00130197,"threshold_uncertainty_score":0.00511992,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073196023","doi":"10.1109/tit.2011.2170133","title":"Novel Simple Representations for Gaussian Class Multivariate Distributions With Generalized Correlation","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Statistical Distribution Estimation and Applications","field":"Mathematics","cited_by":98,"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":"Mathematics; Weibull distribution; Applied mathematics; Gaussian; Random variable; Rician fading; Independent and identically distributed random variables; Transformation (genetics); Discrete mathematics; Algorithm; Statistics","authors":[{"name":"Norman C. Beaulieu","is_ca":true},{"name":"Kasun T. Hemachandra","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0644185346676988,"gpt":0.3275546531182864,"spread":0.2631361184505876,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001549358,0.0008302539,0.0007381591,0.001746627,0.0004435729,0.002126679,0.001226942,0.001296966,0.002942739],"category_scores_gemma":[0.005524862,0.0003317072,0.001108187,0.002097058,0.001030974,0.002559595,0.001166067,0.001755119,0.001078246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001116998,"about_ca_system_score_gemma":0.001310368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001281998,"about_ca_topic_score_gemma":0.001465968,"domain_scores_codex":[0.9992362,0.0001928171,0.00003708392,0.0001013897,0.0003457454,0.00008671171],"domain_scores_gemma":[0.998491,0.0005761702,0.0002394753,0.000222798,0.0003749381,0.00009555274],"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.00003083198,0.00004166506,0.0004868652,0.00009165068,0.00002639741,0.0002199172,0.0001420717,0.05175218,0.002999278,0.8959355,0.003921734,0.04435195],"study_design_scores_gemma":[0.000009881707,0.00001834575,0.0003141079,0.00002500512,0.00001481411,0.0004477552,0.0000426916,0.7227184,0.0008425912,0.2702666,0.005265967,0.00003389089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006931004,0.0003970233,0.9878216,0.0001817975,0.00007647194,0.00002689843,0.00008354304,0.000173396,0.004308338],"genre_scores_gemma":[0.4435748,0.003181013,0.5350942,0.000662983,0.0006174309,0.0002941497,0.0006465942,0.0003574038,0.01557141],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002942739,"threshold_uncertainty_score":0.009844422,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087541534","doi":"10.1109/tit.2009.2013041","title":"Quaternary Constant-Amplitude Codes for Multicode CDMA","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Code (set theory); Constant (computer programming); Binary number; Computer science; Algorithm; Discrete mathematics; Mathematics; Programming language; Arithmetic","authors":[{"name":"Kai-Uwe Schmidt","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01369890084982494,"gpt":0.2487448365982638,"spread":0.2350459357484389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005678508,0.0004287037,0.0002699008,0.0007627454,0.0007483175,0.001257209,0.0005015545,0.0009309896,0.004283044],"category_scores_gemma":[0.002847797,0.0001826294,0.0002963408,0.00143156,0.0008086074,0.0009325373,0.0007667965,0.001092562,0.001819081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009287547,"about_ca_system_score_gemma":0.001070417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001593127,"about_ca_topic_score_gemma":0.001961693,"domain_scores_codex":[0.9992573,0.0001891483,0.00004466474,0.0001119367,0.0003234707,0.0000735557],"domain_scores_gemma":[0.9988979,0.0002923457,0.0001295854,0.0002056511,0.0004176631,0.00005689463],"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.0003078562,0.00008597023,0.0006077079,0.0003343539,0.00001959218,0.0003387903,0.0003818657,0.03843927,0.03959654,0.6526041,0.01653866,0.2507453],"study_design_scores_gemma":[0.00009121106,0.0005285286,0.001023457,0.000346272,0.00005439822,0.00153956,0.0001347098,0.4254012,0.05774272,0.2340076,0.2789601,0.0001700907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02901862,0.005396477,0.9226947,0.001071073,0.001638626,0.0001667177,0.0003278676,0.0007630317,0.03892281],"genre_scores_gemma":[0.5073515,0.006247634,0.4439849,0.001285764,0.00155047,0.000392119,0.0009678144,0.0002774009,0.03794242],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004283044,"threshold_uncertainty_score":0.01432818,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056654970","doi":"10.1109/tit.2004.831853","title":"On Skew Information","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":96,"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":"Skew; Commutator; Measure (data warehouse); Observable; Relation (database); Uncertainty principle; Mutual information; Extension (predicate logic); Mathematics; Computer science; Variance (accounting); Quantum; Statistical physics; Statistics; Pure mathematics; Data mining; Algebra over a field; Quantum mechanics; Physics; Telecommunications","authors":[{"name":"Shunlong Luo","is_ca":true},{"name":"Qiang Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005274115473889611,"gpt":0.2154766377802386,"spread":0.210202522306349,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004314911,0.0008975668,0.001138653,0.00227772,0.00164174,0.003106521,0.001278105,0.002098919,0.004230163],"category_scores_gemma":[0.01754102,0.0005406489,0.0009935995,0.001902691,0.006536189,0.01138346,0.004821226,0.003868231,0.0008092325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001394653,"about_ca_system_score_gemma":0.0009531198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000583621,"about_ca_topic_score_gemma":0.0003256105,"domain_scores_codex":[0.9946121,0.001482211,0.0002990974,0.0009248474,0.002262375,0.0004193095],"domain_scores_gemma":[0.9843433,0.009390599,0.001686586,0.002121383,0.00202755,0.0004306258],"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.00001665601,0.000005012558,0.0001398545,0.0000361046,0.000007289272,0.00006932661,0.00008029843,0.002084665,0.0004447878,0.9920623,0.0005331766,0.004520687],"study_design_scores_gemma":[0.000005511181,0.0000180016,0.00009470795,0.00003002076,0.000006757723,0.0001158534,0.00002066414,0.00831293,0.0005020049,0.9881223,0.00275483,0.00001643077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05762262,0.004500716,0.8515163,0.003824415,0.0008147233,0.00006822478,0.0004809865,0.0002695529,0.08090244],"genre_scores_gemma":[0.8905683,0.00589241,0.08480192,0.003996542,0.002867091,0.0002061467,0.0005395496,0.0003111105,0.01081708],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004314911,"threshold_uncertainty_score":0.0228197,"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":"W2122694741","doi":"10.1109/tit.2003.817423","title":"Linear threaded algebraic space-time constellations","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":92,"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":"Quadrature amplitude modulation; Constellation; Constellation diagram; QAM; Mathematics; Amplitude and phase-shift keying; Phase-shift keying; Diversity gain; Signal-to-noise ratio (imaging); Coding gain; Control theory (sociology); Algorithm; Computer science; Mathematical optimization; Topology (electrical circuits); Fading; Bit error rate; Decoding methods; Statistics","authors":[{"name":"Mohamed Oussama Damen","is_ca":true},{"name":"H. El Gamal","is_ca":false},{"name":"Norman C. Beaulieu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007537560666553184,"gpt":0.214086294556839,"spread":0.2065487338902858,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006000241,0.0005051341,0.0005518174,0.000507043,0.0004292637,0.001377894,0.0004870082,0.0004961953,0.004418565],"category_scores_gemma":[0.00316405,0.0001781138,0.0003655654,0.001101898,0.0006988811,0.001906755,0.000900083,0.0007262978,0.0008323856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004105357,"about_ca_system_score_gemma":0.0004181088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002333805,"about_ca_topic_score_gemma":0.0002308905,"domain_scores_codex":[0.9993225,0.0002376284,0.0000630198,0.00009318529,0.0002021359,0.00008145783],"domain_scores_gemma":[0.9981619,0.000640439,0.0003963843,0.0002940371,0.0004228,0.00008453895],"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.0005419007,0.0000399739,0.0008678866,0.0002270712,0.00004644672,0.000350487,0.0002376586,0.1512213,0.0250538,0.7036781,0.002118756,0.1156167],"study_design_scores_gemma":[0.00008924976,0.000650961,0.0004501341,0.00008759432,0.00004258796,0.00122345,0.0001388104,0.6341214,0.01729678,0.3153455,0.03047852,0.00007507724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05596842,0.0007493456,0.9284162,0.0002403823,0.0001179398,0.00006795754,0.0001865888,0.0002070337,0.01404618],"genre_scores_gemma":[0.782477,0.001105868,0.2089212,0.0001331368,0.0001750825,0.0001485906,0.0003543448,0.00003862143,0.006646193],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004418565,"threshold_uncertainty_score":0.01478153,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166779638","doi":"10.1109/tit.2004.833363","title":"Performance Bounds for Space–Time Block Codes With Receive Antenna Selection","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":90,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Antenna (radio); Upper and lower bounds; Block code; Mathematics; Signal-to-noise ratio (imaging); Bit error rate; Selection (genetic algorithm); Block (permutation group theory); Maximal-ratio combining; Algorithm; Diversity combining; Computer science; Fading; Topology (electrical circuits); Telecommunications; Decoding methods; Combinatorics; Mathematical analysis","authors":[{"name":"X. N. Zeng","is_ca":true},{"name":"Ali Ghrayeb","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005225569943576393,"gpt":0.205794236765601,"spread":0.2005686668220246,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002637183,0.001944563,0.001122121,0.001240987,0.0008241091,0.00207321,0.0007800634,0.0008975989,0.004963712],"category_scores_gemma":[0.0135054,0.0005090779,0.0005139244,0.002016795,0.001423463,0.002446697,0.001696716,0.001594675,0.001669925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002844462,"about_ca_system_score_gemma":0.001870221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003587645,"about_ca_topic_score_gemma":0.00300479,"domain_scores_codex":[0.9971802,0.000795471,0.00007637177,0.0002077029,0.001194608,0.0005457815],"domain_scores_gemma":[0.9894044,0.007064651,0.0007612467,0.0006816002,0.001924993,0.0001631317],"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.0002150785,0.00004791519,0.0009122248,0.0002732885,0.00007874185,0.0001310706,0.0002349547,0.7518475,0.008969249,0.1877626,0.004026261,0.04550106],"study_design_scores_gemma":[0.00001522626,0.0001114239,0.0006787085,0.0001098198,0.00003229156,0.0001994864,0.00005516293,0.9180599,0.004904631,0.07130995,0.004481252,0.000042034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04550806,0.008794989,0.9040223,0.001110806,0.0001347119,0.0001035327,0.0005812605,0.0005640092,0.03918033],"genre_scores_gemma":[0.911864,0.008828791,0.06768055,0.0005545052,0.0003846034,0.000311636,0.0008785058,0.0002916111,0.009205841],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004963712,"threshold_uncertainty_score":0.02063817,"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":"W2090331763","doi":"10.1109/tit.2006.876251","title":"Constructions of quadratic bent functions in polynomial forms","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","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":"University of Waterloo","funders":"","keywords":"Bent molecular geometry; Combinatorics; Mathematics; Bent function; Boolean function; Polynomial; Quadratic equation; Degree (music); Discrete mathematics; Sigma; Geometry; Physics; Mathematical analysis","authors":[{"name":"Nam Yul Yu","is_ca":true},{"name":"Guang Gong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004477564958067519,"gpt":0.1895377663441877,"spread":0.1850602013861202,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003912214,0.0006050218,0.0004681991,0.0008608113,0.0009379471,0.001453281,0.0006100298,0.0004957294,0.004137028],"category_scores_gemma":[0.001379678,0.0003776118,0.0006770965,0.00115003,0.0009357941,0.001539296,0.00101663,0.001408091,0.00141478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005828722,"about_ca_system_score_gemma":0.0004378143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003281973,"about_ca_topic_score_gemma":0.000586497,"domain_scores_codex":[0.9994313,0.0001639466,0.00003651382,0.00008331611,0.0001697327,0.0001151168],"domain_scores_gemma":[0.9993904,0.0001933323,0.00006346322,0.0001353865,0.0001637488,0.00005368996],"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.000297458,0.0001039402,0.0009521378,0.0002845635,0.00002739408,0.00047614,0.001171355,0.01054144,0.04390226,0.8128166,0.002995239,0.1264315],"study_design_scores_gemma":[0.00007254416,0.0006276608,0.001702574,0.0001499762,0.00006714762,0.003105948,0.000745247,0.08503699,0.08304962,0.7341127,0.09116835,0.0001612017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2798351,0.0005995157,0.6498947,0.0004552058,0.0002191467,0.0001807235,0.0002968156,0.0005706033,0.06794822],"genre_scores_gemma":[0.6786042,0.0007568069,0.2907777,0.0002569259,0.0001020553,0.0001447414,0.0004979672,0.0002748768,0.02858463],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004137028,"threshold_uncertainty_score":0.01383978,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115698032","doi":"10.1109/tit.2008.928269","title":"The Quantum Capacity With Symmetric Side Channels","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Army Research Office; Engineering and Physical Sciences Research Council; European Commission; Natural Sciences and Engineering Research Council of Canada; University of Bristol; Deutscher Akademischer Austauschdienst; National Science Foundation","keywords":"Quantum capacity; Classical capacity; Amplitude damping channel; Channel capacity; Quantum entanglement; Channel (broadcasting); Upper and lower bounds; Quantum channel","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01427900235946871,"gpt":0.1987965795999647,"spread":0.184517577240496,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002746501,0.001165704,0.001222938,0.001764539,0.001337109,0.00402845,0.002396693,0.001541379,0.009628576],"category_scores_gemma":[0.01142415,0.0005516504,0.001018578,0.001663002,0.004761733,0.007987723,0.003672378,0.003560761,0.001543809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002334389,"about_ca_system_score_gemma":0.00163086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001255723,"about_ca_topic_score_gemma":0.0006477574,"domain_scores_codex":[0.9950204,0.001245436,0.0001629218,0.0006856341,0.001884828,0.001000805],"domain_scores_gemma":[0.9874898,0.008528986,0.0005089561,0.001458721,0.001588023,0.0004255388],"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.00005170105,0.0000194991,0.0001147703,0.0001076448,0.00002115424,0.00006024749,0.00009319619,0.03430609,0.002570631,0.9517138,0.00205158,0.008889726],"study_design_scores_gemma":[0.00001174108,0.00004292229,0.000243532,0.00009520974,0.00002736332,0.0001770247,0.0000550191,0.187594,0.00443535,0.8001509,0.007109656,0.00005728239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0650223,0.003803256,0.8312726,0.003192773,0.0003058343,0.00009230649,0.001051651,0.0003841861,0.09487507],"genre_scores_gemma":[0.9127147,0.003856194,0.06770862,0.000774917,0.000779193,0.0003196576,0.0005599709,0.0003002747,0.01298663],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009628576,"threshold_uncertainty_score":0.03221077,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053024959","doi":"10.1109/tit.2004.842778","title":"Polyphase Sequences With Low Autocorrelation","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","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":"Simon Fraser University","funders":"","keywords":"Polyphase system; Maxima and minima; Autocorrelation; Mathematics; Sequence (biology); Autocorrelation matrix; Complementary sequences; Base (topology); Algorithm; Energy (signal processing); Combinatorics; Discrete mathematics; Mathematical analysis; Statistics; Physics","authors":[{"name":"Peter Borwein","is_ca":true},{"name":"Roger Ferguson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005474216477185372,"gpt":0.2073840663128367,"spread":0.2019098498356513,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006667087,0.0006205823,0.0005886562,0.001674017,0.001006387,0.001719332,0.0005291437,0.0007850163,0.005551686],"category_scores_gemma":[0.005797412,0.000266109,0.000474597,0.002144411,0.001511441,0.002259316,0.0007419169,0.001090622,0.002946975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004447297,"about_ca_system_score_gemma":0.0005256211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002916519,"about_ca_topic_score_gemma":0.0003199565,"domain_scores_codex":[0.9991475,0.0001259053,0.00007678034,0.0002184735,0.000335872,0.00009539142],"domain_scores_gemma":[0.9975231,0.001074438,0.0003775362,0.0004687225,0.0004609867,0.00009508722],"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.000358444,0.00006429759,0.002253814,0.0004522604,0.00003223603,0.0007247725,0.0005337877,0.01782326,0.08100303,0.5115722,0.005694531,0.3794873],"study_design_scores_gemma":[0.00007118573,0.0004063511,0.004294169,0.0002254516,0.00007783451,0.00416129,0.0003420322,0.1541097,0.1523257,0.5683553,0.1154496,0.0001813421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06007471,0.002006309,0.9183702,0.0004062955,0.0002092647,0.0001045491,0.0004631909,0.001146431,0.01721899],"genre_scores_gemma":[0.344537,0.001396885,0.638388,0.000316896,0.0002404191,0.0001659634,0.0007969756,0.0003486693,0.01380921],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005551686,"threshold_uncertainty_score":0.01857227,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164337876","doi":"10.1109/tit.2008.928992","title":"Full-Diversity Codes for MISO Systems Equipped With Linear or ML Detectors","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":83,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Toeplitz matrix; Space–time block code; Fading; Block code; Diversity gain; Algorithm; Transmit diversity; Mathematics; Transmission (telecommunications); Channel state information; Computer science; Topology (electrical circuits); Telecommunications; Wireless; Decoding methods; Combinatorics","authors":[{"name":"Jing Liu","is_ca":true},{"name":"Jian‐Kang Zhang","is_ca":true},{"name":"Kon Max Wong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02040944586600024,"gpt":0.2310633568536949,"spread":0.2106539109876947,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004934848,0.000526001,0.0003484599,0.0005534856,0.0003517631,0.001063975,0.000434749,0.0007399409,0.001976015],"category_scores_gemma":[0.003033119,0.0001544335,0.0001656185,0.0005628657,0.0006704208,0.001008258,0.001145867,0.0005195653,0.000486976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007195512,"about_ca_system_score_gemma":0.001157628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007789162,"about_ca_topic_score_gemma":0.001386622,"domain_scores_codex":[0.9993336,0.0001258648,0.00003044552,0.00007996138,0.0003303672,0.00009973577],"domain_scores_gemma":[0.9985688,0.0006216118,0.0002116423,0.0001566118,0.0003760502,0.00006528295],"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.0003437528,0.00005825649,0.001671034,0.0002865552,0.00004474648,0.0004497861,0.0004161595,0.2613824,0.03645928,0.5153798,0.003792825,0.1797154],"study_design_scores_gemma":[0.00002788974,0.0001571614,0.0008295163,0.00007685513,0.00001386104,0.0004631043,0.0001121892,0.8403625,0.01807421,0.1313404,0.008482755,0.00005946413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07910744,0.001127949,0.9019031,0.0005737071,0.00007618229,0.00005075038,0.0002540301,0.0001984486,0.01670836],"genre_scores_gemma":[0.880141,0.0007564216,0.1129715,0.000258564,0.00008568694,0.0000869736,0.0002395471,0.0000377744,0.005422417],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001976015,"threshold_uncertainty_score":0.006610394,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129568979","doi":"10.1109/tit.2010.2040888","title":"Optimal Frequency-Hopping Sequences With New Parameters","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Federation for the Humanities and Social Sciences","keywords":"Prime (order theory); Combinatorics; Algorithm; Discrete mathematics; Computer science; Mathematics","authors":[{"name":"Jin-Ho Chung","is_ca":false},{"name":"Kyeongcheol Yang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009472739349772318,"gpt":0.2108607350587515,"spread":0.2013879957089792,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001784646,0.001323876,0.0009969919,0.00142914,0.0006062285,0.001287111,0.00110263,0.00164368,0.005116338],"category_scores_gemma":[0.01539103,0.0006538735,0.0004915689,0.001330041,0.001027468,0.002651274,0.001514181,0.001702227,0.001475911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001085734,"about_ca_system_score_gemma":0.002002381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001326455,"about_ca_topic_score_gemma":0.00199654,"domain_scores_codex":[0.9980808,0.000655364,0.0001461947,0.0003472558,0.0005057884,0.000264509],"domain_scores_gemma":[0.9944879,0.003588921,0.0003495456,0.0006668501,0.000680602,0.000226223],"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.001239811,0.0002374725,0.001189997,0.0004727548,0.0001064399,0.0003415807,0.0003768732,0.582265,0.01587321,0.1513462,0.006667569,0.239883],"study_design_scores_gemma":[0.0001350736,0.0001782472,0.0003703641,0.0001083905,0.00004329853,0.0002853286,0.00007705882,0.9217916,0.004505952,0.06685308,0.005587014,0.00006457888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05322323,0.001452058,0.9303473,0.0007385543,0.0003906975,0.0001848839,0.0003880441,0.0006096404,0.01266562],"genre_scores_gemma":[0.5936849,0.001180109,0.3934727,0.0003243958,0.0003776374,0.0004358056,0.0006683388,0.0001993027,0.009656786],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005116338,"threshold_uncertainty_score":0.01711589,"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":"W2094848842","doi":"10.1109/tit.2015.2422294","title":"Hardness of Decoding Quantum Stabilizer Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Lockheed Martin Corporation","keywords":"Decoding methods; List decoding; Sequential decoding; Berlekamp–Welch algorithm; Quantum convolutional code; Algorithm; Mathematics; Concatenated error correction code; Degeneracy (biology); Code (set theory); Computer science; Linear code; Discrete mathematics; Block code","authors":[{"name":"Pavithran Iyer","is_ca":true},{"name":"David Poulin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01790631183185298,"gpt":0.2424243118143725,"spread":0.2245179999825195,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001685052,0.0006117171,0.001922808,0.0005827189,0.001290783,0.003729163,0.001606981,0.003060526,0.005379868],"category_scores_gemma":[0.01935189,0.0005148884,0.001001798,0.0008603172,0.003357496,0.005550038,0.002381537,0.00387204,0.001101754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00226208,"about_ca_system_score_gemma":0.002513262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002472575,"about_ca_topic_score_gemma":0.001370621,"domain_scores_codex":[0.9948304,0.001394961,0.0002584632,0.000957445,0.001922442,0.0006363894],"domain_scores_gemma":[0.9814522,0.01527707,0.0005979455,0.001482577,0.0008966592,0.0002935917],"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.0009101168,0.0002582674,0.00236575,0.0006923094,0.000106527,0.0004922806,0.0008241846,0.3489934,0.01294637,0.5648472,0.01580813,0.05175548],"study_design_scores_gemma":[0.0001055292,0.00005851363,0.0005259301,0.00004727808,0.00001730861,0.0001652416,0.0001668581,0.3950812,0.006411031,0.5943794,0.003001164,0.00004053102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4261713,0.001259028,0.5014516,0.01394773,0.0002715909,0.0002544236,0.002624951,0.001291813,0.05272755],"genre_scores_gemma":[0.9435031,0.00076426,0.04465801,0.0008627832,0.0002652358,0.0001823069,0.001524204,0.0003530483,0.007887075],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005379868,"threshold_uncertainty_score":0.01799738,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}