{"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"},"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01048131773468266,"gpt":0.2321744062873737,"spread":0.221693088552691,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006867711,0.0001309601,0.0001122628,0.0002378451,0.0003513303,0.0001843654,0.0004298205,0.00004643909,0.00003203304],"category_scores_gemma":[0.0000190143,0.00009261659,0.00007466841,0.0004193758,0.00014018,0.001838105,0.000004024537,0.0002541278,0.00007490088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003089788,"about_ca_system_score_gemma":0.00002591594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002602581,"about_ca_topic_score_gemma":0.000005167108,"domain_scores_codex":[0.9990715,0.0001415813,0.0002597538,0.0001368666,0.0002219298,0.0001683383],"domain_scores_gemma":[0.9989548,0.0002982474,0.0001017802,0.0005044638,0.00009242124,0.00004823185],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004174814,0.00002047209,0.000003886127,0.000005643796,0.00001874649,6.787895e-7,0.004323466,0.0001755965,0.00001868616,0.05449035,0.0001340997,0.9407666],"study_design_scores_gemma":[0.006974458,0.0006659149,0.001406841,0.000190167,0.0001214047,0.001313817,0.003139769,0.3171036,0.1077281,0.5269408,0.03228862,0.002126419],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003599062,0.00003048003,0.9916931,0.0006205517,0.000678534,0.0002816712,0.00000620588,0.0007491928,0.002341167],"genre_scores_gemma":[0.9816319,0.0001589125,0.0168505,0.0009665677,0.00001494525,0.00007415002,9.652571e-7,0.000007102183,0.0002950057],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9780328,"threshold_uncertainty_score":0.3776795,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002162533,0.0001785684,0.0001701808,0.0002207203,0.0002216671,0.00009122672,0.00007142869,0.0001186382,0.00001936354],"category_scores_gemma":[0.000006770702,0.0001836529,0.00007469609,0.0001219803,0.00004835572,0.0008475124,8.630408e-7,0.000165618,0.000007160446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006909486,"about_ca_system_score_gemma":0.00002310333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006305319,"about_ca_topic_score_gemma":0.000003219958,"domain_scores_codex":[0.9992282,0.00002207189,0.000302116,0.0001049909,0.0001316949,0.0002108957],"domain_scores_gemma":[0.999541,0.00008909875,0.00006385695,0.0001676023,0.00007686798,0.00006160847],"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.0003521068,0.00009565264,0.000002811929,0.00008649495,0.0001083003,0.000002145328,0.000760409,0.4795767,0.01016225,0.008514641,0.0003784305,0.4999601],"study_design_scores_gemma":[0.00211998,0.0007485817,0.0002525875,0.0004425502,0.0002435048,0.0001318167,0.0003311293,0.7359084,0.2051868,0.05210207,0.001428523,0.001104045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1247082,0.00002794839,0.8735734,0.00004325742,0.0003039272,0.0003962514,0.00003799612,0.0005379234,0.0003711118],"genre_scores_gemma":[0.9809972,0.00001263867,0.01859807,0.0002937211,0.00002983943,0.00001936029,0.00001557522,0.00001311141,0.00002046981],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.856289,"threshold_uncertainty_score":0.748915,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008280659,0.0001137179,0.000147042,0.0002091591,0.0006317331,0.0000817312,0.0002730033,0.00005317134,0.00001667139],"category_scores_gemma":[0.00002450026,0.0001113023,0.00005363997,0.0003629795,0.00006286569,0.001379083,0.000004761314,0.0001787458,0.00001312163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004741268,"about_ca_system_score_gemma":0.00004985033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000017945,"about_ca_topic_score_gemma":0.00001470912,"domain_scores_codex":[0.9990949,0.0001449011,0.0003375465,0.000112145,0.000117636,0.0001928964],"domain_scores_gemma":[0.998881,0.0006320137,0.00008806521,0.0002626699,0.00008382021,0.00005245393],"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.0005339042,0.00009762297,0.00007983009,0.0000586293,0.0000624484,0.000001692286,0.0212485,0.1556764,0.000190817,0.4201179,0.001442068,0.4004903],"study_design_scores_gemma":[0.008771189,0.0002511142,0.001598393,0.00032484,0.00002263792,0.00008691279,0.0006806886,0.9535387,0.0051784,0.01088507,0.01781376,0.0008483347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003606776,0.0000922399,0.9937153,0.0002925744,0.0003424683,0.0003444813,0.000003243543,0.0001139699,0.001488877],"genre_scores_gemma":[0.9903024,0.0009956417,0.007742696,0.0007286435,0.00002126835,0.0001079082,0.000002613772,0.000005082616,0.00009369409],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9866956,"threshold_uncertainty_score":0.4858844,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003312653,0.0001207262,0.00009130211,0.0001424371,0.0002576296,0.00008829095,0.0003294144,0.00008048855,0.00004439458],"category_scores_gemma":[0.000007684526,0.00009884317,0.00007907436,0.0001485015,0.00005712264,0.0007952858,6.165681e-7,0.0002578593,0.00004900857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007432503,"about_ca_system_score_gemma":0.0000107973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003057485,"about_ca_topic_score_gemma":0.000005775268,"domain_scores_codex":[0.9994137,0.00002928201,0.0002631932,0.0000493583,0.00009964652,0.0001448458],"domain_scores_gemma":[0.9992226,0.0002057228,0.00004371349,0.000423235,0.0000682246,0.00003645203],"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.0001690884,0.0001081889,2.709913e-7,0.0001022503,0.0001177705,8.247618e-8,0.01565024,0.1106131,0.0008484594,0.1783775,0.002944502,0.6910685],"study_design_scores_gemma":[0.001182682,0.0004559861,0.0002517491,0.0001995579,0.00009275619,0.00002423136,0.002175397,0.5821549,0.2509549,0.1160705,0.04551071,0.0009266047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008550455,0.00002519136,0.9915543,0.000529199,0.0002730726,0.0003550279,0.00004832701,0.0007273623,0.005632489],"genre_scores_gemma":[0.9980506,0.0001160287,0.001031616,0.0005413071,0.00001709729,0.0001871856,0.000006622665,0.000008748274,0.00004083743],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9971955,"threshold_uncertainty_score":0.4030707,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2103374230","doi":"10.1109/18.910581","title":"Analyzing the turbo decoder using the Gaussian approximation","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":339,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Partenariat Canadien Contre Le Cancer","keywords":"Turbo code; Convolutional code; Low-density parity-check code; Serial concatenated convolutional codes; Algorithm; Additive white Gaussian noise; Decoding methods; Concatenated error correction code; Mathematics; Gaussian; Computer science; Block code; White noise; Statistics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01874291578754073,"gpt":0.2630277063617985,"spread":0.2442847905742577,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001247592,0.0001467038,0.00009248326,0.0002360297,0.0008839897,0.0003411255,0.0007729814,0.00006938475,0.00003944604],"category_scores_gemma":[0.00002179015,0.00008947837,0.0001041283,0.0007810459,0.00007682105,0.0023712,0.000005384989,0.0003463942,0.00007068262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001101657,"about_ca_system_score_gemma":0.00005274997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002567817,"about_ca_topic_score_gemma":0.00001082437,"domain_scores_codex":[0.9988126,0.0002257436,0.000356972,0.0001280833,0.0002587131,0.0002178515],"domain_scores_gemma":[0.9986337,0.0003121291,0.0001976874,0.0007087658,0.0001096544,0.00003808677],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006275622,0.00007673321,0.00002788503,0.00002145314,0.00007564826,0.000001269273,0.01748629,0.1065136,0.0004062268,0.06627341,0.000300634,0.808754],"study_design_scores_gemma":[0.0002570268,0.00005959976,0.0001214233,0.00005968591,0.00004333854,0.0001562282,0.001453953,0.9439251,0.02459572,0.02689656,0.002109329,0.0003220306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004599509,0.00001682287,0.9897672,0.0008753533,0.0005684687,0.0003146486,0.000001655648,0.0005093469,0.003346975],"genre_scores_gemma":[0.98419,0.00002054651,0.0148207,0.0007782928,0.00003095351,0.00005302194,0.000001069692,0.000008331889,0.00009700626],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9795906,"threshold_uncertainty_score":0.6799024,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003554646,0.0001465276,0.0001094078,0.0001836689,0.000335798,0.00009433684,0.0003048823,0.0001166278,0.00005140819],"category_scores_gemma":[0.00001105665,0.0001279124,0.000101499,0.0002253462,0.00007272253,0.0008921325,0.0000020316,0.0003464021,0.00003608166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001336853,"about_ca_system_score_gemma":0.00002181264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007562169,"about_ca_topic_score_gemma":0.00001406305,"domain_scores_codex":[0.9991428,0.00004799972,0.00036324,0.00007304517,0.0001600013,0.0002129739],"domain_scores_gemma":[0.9988692,0.0005091571,0.00005282859,0.000463002,0.00007473938,0.0000311051],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007422284,0.00002039111,5.627678e-7,0.00004762724,0.00003339613,8.597436e-8,0.0007213442,0.7155098,0.0008387783,0.1923702,0.0002601786,0.09012341],"study_design_scores_gemma":[0.0006741035,0.00006676025,0.00002792302,0.0001119396,0.00004314246,0.000009410008,0.001028063,0.2859149,0.5078139,0.1940788,0.009766826,0.0004641853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002646626,0.00002774024,0.9914839,0.0001127606,0.0003364153,0.0004654977,0.00004899035,0.0007812476,0.004096881],"genre_scores_gemma":[0.9562828,0.00007117074,0.04299467,0.0001067772,0.00005291062,0.0003463009,0.00002191509,0.00002887228,0.00009458957],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9536362,"threshold_uncertainty_score":0.5216116,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001436826,0.0001639369,0.0001339197,0.0002695658,0.0001596299,0.00004328454,0.0002235724,0.00009937819,0.001187111],"category_scores_gemma":[0.000006962784,0.0001759486,0.0000772194,0.0002283909,0.00006937096,0.001129842,0.000001202639,0.0002873969,0.002074071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009533788,"about_ca_system_score_gemma":0.000004917965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001093012,"about_ca_topic_score_gemma":8.617278e-7,"domain_scores_codex":[0.9992259,0.00004737296,0.0003155856,0.00006537986,0.0001679217,0.0001779101],"domain_scores_gemma":[0.9992152,0.0001920866,0.00005222863,0.0004206919,0.00005371046,0.00006603508],"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.00003430173,0.0001156493,0.000001320856,0.00008235584,0.0001198009,6.699204e-7,0.002561614,0.6808904,0.002317199,0.01539345,0.004865028,0.2936182],"study_design_scores_gemma":[0.0009487402,0.0001326271,0.00004178489,0.0001272292,0.00005049087,0.00004278582,0.0003512524,0.571296,0.3614082,0.01183049,0.05279534,0.0009751111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003877225,0.00007663471,0.974176,0.000105445,0.0001999575,0.0002181265,0.00005595977,0.001802376,0.0194882],"genre_scores_gemma":[0.9951949,0.0004049451,0.003470812,0.000184322,0.000017684,0.0001289506,0.00001053126,0.00002540661,0.0005624401],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9913177,"threshold_uncertainty_score":0.9997259,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000230381,0.0001063455,0.00009351,0.00009688955,0.00009733036,0.00005159088,0.00006800442,0.000116725,0.00004496007],"category_scores_gemma":[0.0000430526,0.0000989972,0.00005091975,0.00004807186,0.00007120673,0.0003680701,6.788179e-7,0.0002086895,0.00002431958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001671666,"about_ca_system_score_gemma":0.000009082821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003086865,"about_ca_topic_score_gemma":0.000006799818,"domain_scores_codex":[0.9994468,0.00002156188,0.0002298645,0.00007635549,0.0001083007,0.0001171259],"domain_scores_gemma":[0.9993111,0.0003637296,0.00002758399,0.0001858878,0.0000589815,0.00005273531],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.004248462,0.0002140583,0.00003292349,0.000071735,0.000500565,0.00000117568,0.004644242,0.06610089,0.05969426,0.0213458,0.01384236,0.8293035],"study_design_scores_gemma":[0.00225571,0.0001771875,0.0002823028,0.0000654011,0.00007527069,0.00000804235,0.0001534109,0.2163767,0.6772507,0.09331235,0.00958684,0.0004560938],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09174324,0.000005180047,0.9028624,0.00006226286,0.0007283214,0.0002261317,0.0001803963,0.0004488223,0.003743204],"genre_scores_gemma":[0.992685,0.00001296068,0.006944801,0.0002396151,0.00003590706,0.00004236309,0.00001931421,0.000011383,0.000008682175],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9009417,"threshold_uncertainty_score":0.4036989,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000206864,0.0001921843,0.0001652917,0.0003422495,0.0001705687,0.00008035028,0.0001453411,0.0001187836,0.0006102581],"category_scores_gemma":[0.000006259482,0.0002021983,0.00009559884,0.0001732578,0.00004287851,0.003229564,0.000001773308,0.0002203633,0.000261378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008761088,"about_ca_system_score_gemma":0.00002726382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002926505,"about_ca_topic_score_gemma":0.000001213372,"domain_scores_codex":[0.9989698,0.00004325372,0.000499806,0.00006555736,0.0001880819,0.0002334785],"domain_scores_gemma":[0.9994062,0.00005571942,0.0001167836,0.0002402533,0.0001071011,0.00007393379],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004971835,0.00007820983,0.000008320499,0.0001112798,0.0002639097,0.000003248516,0.01332615,0.7778143,0.00754906,0.003543349,0.001163662,0.1956413],"study_design_scores_gemma":[0.0006909352,0.0001375679,0.00008494694,0.0001227894,0.00007760739,0.00004090917,0.0006827273,0.240753,0.7472233,0.003318576,0.006297372,0.0005703306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02730225,0.000004187861,0.9584883,0.000002714084,0.000673751,0.0002359546,0.00005466831,0.0009590494,0.01227917],"genre_scores_gemma":[0.9941567,0.00002137167,0.005494971,0.0002243721,0.00002431982,0.00003203053,0.00001855085,0.00001660352,0.000011073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9668545,"threshold_uncertainty_score":0.8245407,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009551932,0.0002179779,0.0001967105,0.0001433869,0.0009405921,0.0001237065,0.0001977092,0.00008936898,0.0008734089],"category_scores_gemma":[0.000004732369,0.0001545409,0.0002523044,0.0002694211,0.00008268736,0.001912152,0.000001786871,0.0003987908,0.0001178393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003310258,"about_ca_system_score_gemma":0.00007183019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003265604,"about_ca_topic_score_gemma":2.541544e-7,"domain_scores_codex":[0.9985105,0.0002636844,0.0005926357,0.00008411568,0.0002648743,0.0002842063],"domain_scores_gemma":[0.9990641,0.0002307173,0.0001604479,0.0003199127,0.0001030083,0.0001217431],"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.0001015337,0.00008210352,0.000001914268,0.00001738771,0.00006447043,1.865647e-8,0.004037524,0.0295093,0.00004627092,0.01620422,0.0001090126,0.9498262],"study_design_scores_gemma":[0.0008940637,0.0001374146,0.000007166768,0.00003940234,0.0001112541,0.000004303549,0.00207034,0.5170268,0.01558537,0.009786042,0.4540116,0.0003262664],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003236967,0.000003224786,0.9856135,0.0004053434,0.000516333,0.0003314651,0.0001121138,0.00007354635,0.009707519],"genre_scores_gemma":[0.8599054,0.00001427886,0.1364603,0.001915806,0.0006013219,0.0001153386,0.0002095386,0.0000427696,0.0007352361],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9495,"threshold_uncertainty_score":0.9563215,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007676086,0.0001720107,0.0001820743,0.001201393,0.0007001135,0.0002613934,0.0002593946,0.00009988058,0.00005398518],"category_scores_gemma":[0.000009680372,0.0001673945,0.0002940113,0.001605251,0.0001983762,0.001533445,0.000002870749,0.00019175,0.00001945561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002521688,"about_ca_system_score_gemma":0.00003130271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002936552,"about_ca_topic_score_gemma":0.00001586834,"domain_scores_codex":[0.9988389,0.0001402398,0.0004289489,0.0001939056,0.000187035,0.0002109669],"domain_scores_gemma":[0.9987926,0.0003827367,0.0001630264,0.0004300367,0.0001597656,0.00007184712],"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.0001882218,0.0001100713,0.00009123178,0.00002689297,0.0003319637,1.571312e-7,0.000396388,0.005791818,0.0002175743,0.8187492,0.00006567793,0.1740308],"study_design_scores_gemma":[0.002054972,0.0006791161,0.005125591,0.00003840227,0.0009675718,0.00003534003,0.001279067,0.04687446,0.009373914,0.9276987,0.004947906,0.0009249421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02354588,0.00001328922,0.974413,0.000142638,0.0003429413,0.0002911651,0.0000617412,0.0002811594,0.0009081253],"genre_scores_gemma":[0.9736856,0.00001635716,0.02582008,0.0002495967,0.00001811224,0.0001294622,0.00002912937,0.000005932793,0.00004578172],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9501397,"threshold_uncertainty_score":0.6826151,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004061841,0.0001545779,0.0001353092,0.0001782038,0.0005183918,0.0004139144,0.0008273032,0.0000477972,0.00009796574],"category_scores_gemma":[0.000005955246,0.0001419484,0.00006999894,0.0006993155,0.0000330609,0.003635482,0.000007755749,0.0002389854,0.001280281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005693547,"about_ca_system_score_gemma":0.00003140837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002946592,"about_ca_topic_score_gemma":9.895801e-7,"domain_scores_codex":[0.9989114,0.0001815099,0.0002718936,0.0001647666,0.0002106445,0.0002597228],"domain_scores_gemma":[0.9986321,0.0001509614,0.0000756325,0.0008004766,0.0001700861,0.0001706865],"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.00001081768,0.0001304316,0.000001029049,0.000007054503,0.00002162058,4.365419e-8,0.00656855,0.1647872,0.0004299444,0.4007551,0.00149081,0.4257974],"study_design_scores_gemma":[0.0003836958,0.0001626272,0.0002982661,0.00003407412,0.000009744941,0.000005999669,0.0003530956,0.9779976,0.004647646,0.01181003,0.003870559,0.0004266556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004025538,0.000006819737,0.9797907,0.0003004031,0.0002913161,0.0004148698,0.000001808084,0.0003330827,0.01483544],"genre_scores_gemma":[0.9762765,0.0000221144,0.02010754,0.0031403,0.00006178059,0.0002416244,0.000004964283,0.000008057861,0.0001370891],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.972251,"threshold_uncertainty_score":0.9994974,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006459296,0.0002005568,0.0001809555,0.0001356211,0.0005316735,0.0002284617,0.0001667883,0.00008213599,0.001473046],"category_scores_gemma":[0.000007102245,0.0001411384,0.0001836577,0.0002118108,0.00007076569,0.00310123,9.304488e-7,0.0002621152,0.0003479355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004123915,"about_ca_system_score_gemma":0.00006080339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000837357,"about_ca_topic_score_gemma":3.920742e-7,"domain_scores_codex":[0.9986271,0.0001249495,0.0006109602,0.00007340994,0.0003270811,0.0002365313],"domain_scores_gemma":[0.9991044,0.0002403928,0.0001629426,0.0002794026,0.000126267,0.00008659388],"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.0001123429,0.00006741681,0.000002340883,0.00003703073,0.00005467736,2.015179e-8,0.00330382,0.03788589,0.00005596086,0.04240489,0.00008548414,0.9159901],"study_design_scores_gemma":[0.002159908,0.0001214869,0.00001317026,0.0001084524,0.0001641161,0.000006216334,0.002445091,0.8397717,0.01223705,0.03555793,0.106974,0.0004408377],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004758765,0.000002416943,0.9819146,0.0003626015,0.0002769779,0.0004639699,0.00008845848,0.00008008325,0.01205208],"genre_scores_gemma":[0.9960093,0.000004550534,0.002832422,0.0005676176,0.0001850476,0.00008118304,0.0001114895,0.00001471416,0.0001936417],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9912506,"threshold_uncertainty_score":0.9994397,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007319591,0.0001080698,0.00008225474,0.0003090677,0.0003383169,0.00002343372,0.0002404928,0.00008311862,0.00004465597],"category_scores_gemma":[0.000008982876,0.00009816441,0.00004774547,0.0003368278,0.0000653308,0.001204895,0.000003724289,0.0003811695,0.00007235822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002114479,"about_ca_system_score_gemma":0.000007061447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001182985,"about_ca_topic_score_gemma":0.00002954398,"domain_scores_codex":[0.999298,0.00005290438,0.0003039016,0.00005605215,0.000131958,0.0001571724],"domain_scores_gemma":[0.9993582,0.0001957712,0.00005823684,0.0003119417,0.00004416296,0.00003163268],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001749884,0.00005200629,0.00001978045,0.00004003483,0.00003881539,4.622805e-7,0.01144852,0.3295158,0.001531896,0.01220779,0.0002268223,0.6447431],"study_design_scores_gemma":[0.00193484,0.0001823304,0.00386651,0.0003263839,0.00007409422,0.00007536141,0.0235504,0.05677904,0.8516791,0.04706942,0.01309094,0.001371588],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03602815,0.00002370395,0.9548784,0.00006349736,0.0003749658,0.0002261381,0.000007691789,0.0005175784,0.007879893],"genre_scores_gemma":[0.9969428,0.0002526357,0.002620642,0.00007641269,0.00001420674,0.00002773987,0.00000473273,0.000009755569,0.00005109388],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9609146,"threshold_uncertainty_score":0.4003029,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001915595,0.0001311888,0.0001493553,0.0003444892,0.0003432528,0.0001311047,0.0003377509,0.00009435708,0.00001944992],"category_scores_gemma":[0.00003153366,0.0001268878,0.00006697465,0.0003936064,0.00005640966,0.001446013,0.000007748404,0.000244881,0.00004622906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008178765,"about_ca_system_score_gemma":0.00003993618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004167631,"about_ca_topic_score_gemma":0.00007606457,"domain_scores_codex":[0.9989632,0.00009904148,0.0004220332,0.0001415457,0.0001423318,0.000231832],"domain_scores_gemma":[0.9987079,0.0005639244,0.0001003911,0.0003935909,0.0001513077,0.0000829179],"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.0002962455,0.0001780276,0.00004684549,0.0000610344,0.00004452581,9.875237e-7,0.01191145,0.02111581,0.0003918012,0.2443221,0.0002436916,0.7213875],"study_design_scores_gemma":[0.005171908,0.0004737086,0.003249351,0.000365656,0.00004308635,0.00005045742,0.001819812,0.7798545,0.1539122,0.03243186,0.02120891,0.001418557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02295917,0.00003466116,0.9747583,0.0004162883,0.0004271464,0.0003570656,0.000005381213,0.0001249198,0.000917042],"genre_scores_gemma":[0.9903883,0.0002161715,0.008071115,0.001095379,0.00001636342,0.00005537373,0.000004100756,0.000005624775,0.0001475558],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9674292,"threshold_uncertainty_score":0.5174333,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002038623,0.0001881832,0.0001965779,0.0001918933,0.0001012838,0.00004368898,0.0001100469,0.0002028699,0.0001002521],"category_scores_gemma":[0.00000818657,0.0002032309,0.00008650623,0.0003293608,0.00002946504,0.000971788,3.893373e-7,0.0002881405,0.00003295119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001969228,"about_ca_system_score_gemma":0.00001221669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.222318e-7,"about_ca_topic_score_gemma":0.000004532015,"domain_scores_codex":[0.9990476,0.00003990554,0.0004136642,0.00009278934,0.0001127727,0.0002932333],"domain_scores_gemma":[0.9993044,0.0002982622,0.00007012503,0.0001989537,0.00006541502,0.00006281431],"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.0002046966,0.00002870417,0.000001243127,0.00001328074,0.00002797154,1.098002e-7,0.0002574196,0.9398797,0.00001009978,0.01514783,0.0001293314,0.04429965],"study_design_scores_gemma":[0.001613845,0.00002599971,0.00001727633,0.00004824018,0.000015188,0.000001648942,0.0000837804,0.9940129,0.0007194087,0.001896672,0.001342002,0.0002230241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003505663,0.00003285825,0.9944865,0.00007578375,0.000567313,0.0006046162,0.0001439222,0.0004214439,0.0001618983],"genre_scores_gemma":[0.9837596,0.00008804425,0.01530447,0.0003919183,0.0000637873,0.0002687138,0.00007598328,0.00003178668,0.00001572698],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9802539,"threshold_uncertainty_score":0.8287517,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008571407,0.0001194864,0.0001207639,0.0004584196,0.0003642064,0.0001310927,0.0003645141,0.00006791636,0.00002499157],"category_scores_gemma":[0.0000479137,0.0001192321,0.00007366317,0.001079284,0.0000160098,0.001239985,0.00000178459,0.0002456164,0.000060655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001442772,"about_ca_system_score_gemma":0.00003684396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.707767e-7,"about_ca_topic_score_gemma":0.000007031877,"domain_scores_codex":[0.9990484,0.0001305038,0.0003431574,0.0001203609,0.0001558762,0.0002017406],"domain_scores_gemma":[0.998691,0.0006711858,0.0001097467,0.0003669561,0.0001131295,0.00004795943],"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.00008076928,0.00005949377,7.29371e-7,0.000002925307,0.000005424006,9.677875e-8,0.0008468637,0.201337,0.00001324073,0.2359505,0.00133428,0.5603687],"study_design_scores_gemma":[0.001041121,0.0004590991,0.0002393802,0.0001067413,0.000007309063,0.000004569409,0.0001217009,0.9668459,0.002288647,0.02207792,0.006527656,0.0002799137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004354136,0.0000206661,0.992286,0.000516352,0.001368753,0.0003501943,0.000002486124,0.0001696802,0.004850415],"genre_scores_gemma":[0.9921335,0.0001178996,0.004701131,0.002716468,0.00002810293,0.00006437841,0.000005019194,0.000004071783,0.0002294264],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9916981,"threshold_uncertainty_score":0.4862146,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008552307,0.0001974887,0.0001689732,0.0004126708,0.0004413185,0.0004378562,0.0003147778,0.0001341071,0.0000578307],"category_scores_gemma":[0.00003154862,0.0001883958,0.00008524754,0.0005103932,0.00008977687,0.00335772,0.000004530448,0.0002430639,0.00009652387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004156713,"about_ca_system_score_gemma":0.00005692072,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005579122,"about_ca_topic_score_gemma":0.000007241445,"domain_scores_codex":[0.9985161,0.0002423665,0.0004743111,0.0001994156,0.0003195804,0.0002482016],"domain_scores_gemma":[0.9988122,0.0003939949,0.0001617218,0.0003958128,0.0001653413,0.00007090435],"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.0001987343,0.0001745845,0.00001626583,0.00009759745,0.00005376734,0.000005778114,0.003664335,0.2466103,0.0008517776,0.2985643,0.000923286,0.4488393],"study_design_scores_gemma":[0.002085152,0.000302838,0.0004052242,0.0001131609,0.00006635098,0.00005568378,0.0003131957,0.8321711,0.06677075,0.08558915,0.01132388,0.0008034665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002149384,0.00006123917,0.9936622,0.0001813744,0.0005609161,0.000197994,0.00002467966,0.0002987706,0.002863491],"genre_scores_gemma":[0.9396105,0.00005427089,0.05814532,0.001439953,0.00005530168,0.00003355583,0.00002482463,0.00001436982,0.0006218866],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9374611,"threshold_uncertainty_score":0.7682559,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005330082,0.0002317763,0.0001689728,0.0002804679,0.0003546584,0.0001272695,0.0002148798,0.000218956,0.0001510674],"category_scores_gemma":[0.000009461178,0.0001799181,0.0001250343,0.000406032,0.00009963417,0.002922087,9.931342e-7,0.0004464531,0.0001654416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001109156,"about_ca_system_score_gemma":0.00001763616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004527418,"about_ca_topic_score_gemma":0.00000224987,"domain_scores_codex":[0.9986544,0.00005395267,0.0005951068,0.00006863409,0.0003217438,0.0003062268],"domain_scores_gemma":[0.9992894,0.0001582546,0.00007436826,0.0003534535,0.00005599468,0.00006851243],"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.00004565237,0.000009549512,2.795492e-7,0.00003201086,0.00002279886,3.101072e-8,0.0007097057,0.6412528,0.00003658805,0.004315461,0.00007371369,0.3535014],"study_design_scores_gemma":[0.0005066383,0.0000590507,0.00001042373,0.00004525255,0.0000380173,0.000007335758,0.0004213767,0.9532558,0.009537636,0.005202644,0.03068811,0.0002276714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01754318,0.000008993818,0.9757077,0.000345992,0.0006711673,0.0004327058,0.00002368805,0.0009593004,0.004307243],"genre_scores_gemma":[0.989981,0.00009162124,0.009456843,0.0002601199,0.00007494527,0.00005053959,0.00003011949,0.00002207743,0.00003275116],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9724378,"threshold_uncertainty_score":0.7336848,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004745659,0.0002003776,0.0002044325,0.0002591702,0.0004884361,0.00006270548,0.0003562808,0.0000635097,0.0001722006],"category_scores_gemma":[0.00001001457,0.0001961537,0.00007390811,0.0003456017,0.00006370062,0.0007814413,0.000002429273,0.0003899763,0.00006158256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003629452,"about_ca_system_score_gemma":0.00004312175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007419323,"about_ca_topic_score_gemma":0.000001612281,"domain_scores_codex":[0.9989212,0.0001212705,0.0004119491,0.0001105461,0.0001877278,0.0002472911],"domain_scores_gemma":[0.9986641,0.000535708,0.000123406,0.0005281427,0.0001036458,0.00004497766],"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.0001563618,0.00002328012,2.475105e-7,0.0000563804,0.00007657237,2.055042e-7,0.0006115972,0.9775185,0.000650559,0.003148852,0.000267144,0.01749032],"study_design_scores_gemma":[0.001138976,0.0004555219,8.887681e-7,0.00005626725,0.00003961825,0.00002630718,0.01148935,0.6731225,0.3043523,0.002105648,0.006734833,0.0004778756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002513976,0.0001647894,0.9926837,0.00005627319,0.0004743531,0.001165352,0.0001423299,0.001123584,0.001675607],"genre_scores_gemma":[0.9895766,0.0001227599,0.008340028,0.00004330318,0.00000570969,0.001545984,0.00003009731,0.0000379811,0.0002974938],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9870627,"threshold_uncertainty_score":0.7998917,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001342046,0.00009417493,0.00009086418,0.0000239066,0.0001345345,0.0000227201,0.00008430226,0.0000580942,0.00002228648],"category_scores_gemma":[0.00001070892,0.00008253601,0.00003418824,0.0000606361,0.0001111834,0.00000547633,0.000004582408,0.00009510548,0.00002971027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006081653,"about_ca_system_score_gemma":0.00002091923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002935303,"about_ca_topic_score_gemma":0.00000209458,"domain_scores_codex":[0.9994652,0.00005294595,0.0001734664,0.0001229909,0.00006993812,0.0001154819],"domain_scores_gemma":[0.9997007,0.00002440135,0.00003606262,0.0001229473,0.00004046987,0.00007547611],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.002092723,0.0001793066,0.001271824,0.0001730716,0.0003014513,0.000002329549,0.005465987,0.0194989,0.7712341,0.01016408,0.001536771,0.1880795],"study_design_scores_gemma":[0.00256633,0.002159754,0.002744848,0.00004055921,0.00006758585,0.00002706525,0.005347265,0.01266733,0.8740139,0.0009072214,0.09845048,0.001007646],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4254569,0.000131027,0.5732668,0.0001933938,0.00006961595,0.0001229881,0.0002416627,0.000008396717,0.0005092022],"genre_scores_gemma":[0.9979577,0.0003008432,0.0007530695,0.0008666877,0.00003025657,0.00001590546,0.00004359604,0.000004369047,0.00002754096],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5725138,"threshold_uncertainty_score":0.3365721,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004686448,0.0001627303,0.0001212605,0.000192352,0.0005884257,0.0002306331,0.000204114,0.00007913032,0.0001618749],"category_scores_gemma":[0.0000069144,0.0001200436,0.00006601343,0.0003412107,0.00006571579,0.002198623,0.000002622736,0.0001651198,0.00006784292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002207866,"about_ca_system_score_gemma":0.00003602511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004780562,"about_ca_topic_score_gemma":0.000006051209,"domain_scores_codex":[0.9990833,0.00007555229,0.0002662322,0.0001728651,0.0001663548,0.0002357106],"domain_scores_gemma":[0.9991089,0.0002418316,0.0001105184,0.000282904,0.0001325709,0.0001233038],"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.001056469,0.0003837942,0.0001342684,0.0002275597,0.0001702668,0.00003964452,0.0212545,0.0934521,0.00005631757,0.165069,0.00168405,0.7164721],"study_design_scores_gemma":[0.003116395,0.0007121832,0.0000521113,0.00009827826,0.0000425914,0.0009337861,0.0002506266,0.9724854,0.003057715,0.0116312,0.007108006,0.0005116719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00297751,0.00001894966,0.9953304,0.0001349048,0.0002148284,0.0004350283,0.00004274738,0.0002058466,0.0006398049],"genre_scores_gemma":[0.974528,0.00001083852,0.02422634,0.0004908282,0.0000269938,0.00006732277,0.000004142249,0.000009709253,0.0006358662],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9715505,"threshold_uncertainty_score":0.4895237,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002537197,0.000191519,0.0001880377,0.0002216105,0.0002339481,0.0001024093,0.000303135,0.0002191995,0.00005018833],"category_scores_gemma":[0.00002262029,0.0001624095,0.00007591109,0.0002128998,0.0002896517,0.0008665146,0.000002110793,0.0006749185,0.000110363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006020923,"about_ca_system_score_gemma":0.00002062247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000285762,"about_ca_topic_score_gemma":0.00001572858,"domain_scores_codex":[0.9992157,0.00001273202,0.0002972562,0.00009274052,0.000134662,0.0002468863],"domain_scores_gemma":[0.9989355,0.0002126043,0.00004571041,0.0005518992,0.0001650702,0.00008923738],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0008141389,0.0003116234,0.000007675865,0.0003627286,0.0003193583,7.295866e-7,0.003713784,0.09037763,0.01842126,0.4045556,0.0003770491,0.4807384],"study_design_scores_gemma":[0.001226957,0.0002717343,0.0001110749,0.00006778273,0.00004356128,0.00003825427,0.001252316,0.2156096,0.7670739,0.0102679,0.003382529,0.0006544318],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1633562,0.00000239588,0.8320621,0.000273533,0.0005861868,0.0003055944,0.00004072835,0.0009925518,0.002380715],"genre_scores_gemma":[0.9919102,0.0000148323,0.007632558,0.0001110661,0.00001963548,0.0002430138,0.00001093932,0.00002287455,0.00003493849],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.828554,"threshold_uncertainty_score":0.6622866,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094676669","doi":"10.1109/tit.2012.2218792","title":"Polar Codes for Classical-Quantum Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"ExxonMobil Research and Engineering Company; Defense Advanced Research Projects Agency; École Polytechnique Fédérale de Lausanne; Ministère du Développement Économique, de l’Innovation et de l’Exportation","keywords":"Classical capacity; Computer science; Quantum capacity; Quantum channel; Polar code; Channel capacity; Channel (broadcasting); Quantum; Puncturing; Decoding methods; Algorithm; Mathematics; Topology (electrical circuits); Theoretical computer science; Quantum information; Telecommunications; Physics; Quantum mechanics; Quantum network; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01878489496873109,"gpt":0.2653956083520281,"spread":0.246610713383297,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009619805,0.0001512562,0.0001345481,0.0003002995,0.0003094068,0.0001272063,0.0004440196,0.0001081133,0.00002452293],"category_scores_gemma":[0.00003256016,0.0001423622,0.0001258037,0.0002786947,0.00004509562,0.003659806,0.000003019901,0.0002044279,0.0002149483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008472576,"about_ca_system_score_gemma":0.00003758336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004208441,"about_ca_topic_score_gemma":7.467821e-7,"domain_scores_codex":[0.9989319,0.00008674691,0.0003171764,0.0001098964,0.0002102688,0.0003439666],"domain_scores_gemma":[0.9988019,0.0004085378,0.0001303896,0.0004221515,0.000123888,0.0001130645],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001008244,0.0002383849,0.000006952313,0.00007241771,0.00005246254,1.614455e-7,0.008921013,0.001661938,0.0006203869,0.7509344,0.003240333,0.2341507],"study_design_scores_gemma":[0.001492417,0.0009007237,0.0001099444,0.0001695121,0.00008140411,0.00008925891,0.001166325,0.2827327,0.4793935,0.130557,0.1019105,0.001396744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001061636,0.00001486012,0.9932668,0.0003545583,0.002337741,0.0003845144,0.00002400826,0.0009962532,0.001559696],"genre_scores_gemma":[0.9737867,0.000007252514,0.02481359,0.00086407,0.00007133831,0.0002085212,0.000004170902,0.00001082885,0.0002336053],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.972725,"threshold_uncertainty_score":0.5805361,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001013241,0.000107632,0.0001149463,0.0007063189,0.0002539216,0.0001365356,0.0002056854,0.0000749115,0.00007438535],"category_scores_gemma":[0.000006776864,0.0001033435,0.0001137013,0.001235499,0.00004100377,0.002762167,0.000003359964,0.0001827521,0.00007309335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001935571,"about_ca_system_score_gemma":0.00001759822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009839948,"about_ca_topic_score_gemma":0.00003330264,"domain_scores_codex":[0.9991215,0.00005108087,0.0002856123,0.0001325816,0.0002263323,0.0001829107],"domain_scores_gemma":[0.9992312,0.0001859359,0.00008092848,0.0003110112,0.00008043072,0.0001104728],"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.0001047684,0.0001244037,0.0000222571,0.00002686946,0.0002958839,0.000002856622,0.01656587,0.001226063,0.00004683584,0.8513578,0.00007825138,0.1301482],"study_design_scores_gemma":[0.006115261,0.001096318,0.01659196,0.00009108944,0.001730064,0.0002006437,0.008391244,0.3877341,0.157685,0.3687341,0.04810621,0.003523975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03896178,0.00003077828,0.9579967,0.0000664007,0.0002399965,0.00009669136,0.00005351712,0.0001632944,0.002390885],"genre_scores_gemma":[0.9977278,0.00004031368,0.001795449,0.0003981669,0.00001244631,0.000005974282,0.000009928183,0.000001889176,0.000008042483],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.958766,"threshold_uncertainty_score":0.4214225,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003671845,0.0001489561,0.0001250229,0.000223293,0.0003192646,0.0002209066,0.0004561363,0.0000724523,0.00003997255],"category_scores_gemma":[0.000006775467,0.0001287468,0.00009760531,0.0003140445,0.00003354623,0.001165421,0.000001699109,0.0002527917,0.0002386121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002923262,"about_ca_system_score_gemma":0.00004777836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003148363,"about_ca_topic_score_gemma":4.333302e-7,"domain_scores_codex":[0.9990175,0.000086252,0.0002906065,0.0001365689,0.0002425444,0.0002264653],"domain_scores_gemma":[0.9992757,0.0001132956,0.00009261652,0.0003725585,0.00006334238,0.00008248023],"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.0000539272,0.00006811701,1.287802e-7,0.000007200646,0.00001433549,0.000001388083,0.002405861,0.1335884,0.0001483582,0.1096183,0.0002464638,0.7538475],"study_design_scores_gemma":[0.0006758937,0.0004919697,0.0001469217,0.00004607923,0.00001073334,0.00006169025,0.000117467,0.8809379,0.02204633,0.09148586,0.003578773,0.0004003223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01212369,0.000007723604,0.9836619,0.0006942024,0.001208882,0.0001263462,0.00001061356,0.0004443915,0.001722219],"genre_scores_gemma":[0.988261,0.000006334371,0.009824309,0.001750263,0.0000673558,0.000006371026,0.000002756862,0.000003845008,0.00007779807],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9761373,"threshold_uncertainty_score":0.5250141,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001826396,0.0001054273,0.0001575954,0.0001824447,0.0001237351,0.00002557366,0.0001644872,0.00008424401,0.0001674581],"category_scores_gemma":[0.000006409231,0.0001090174,0.00008780955,0.00004086491,0.00009542472,0.0008780218,0.000001289739,0.0001019705,0.00002127722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002630553,"about_ca_system_score_gemma":0.00001438055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004155771,"about_ca_topic_score_gemma":0.000004467489,"domain_scores_codex":[0.9992687,0.00003583279,0.0003712827,0.00005622304,0.0001775283,0.00009044979],"domain_scores_gemma":[0.9992239,0.00004091648,0.0002147879,0.0003796798,0.0001104432,0.0000302962],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004755286,0.0001087749,0.00006548838,0.00008158782,0.0003978373,7.642415e-7,0.001678751,0.1851563,0.4764776,0.0003099351,0.0003155646,0.3349319],"study_design_scores_gemma":[0.0003115392,0.00004402885,0.0003463871,0.0001562687,0.00004195997,0.00000235354,0.0001354581,0.007466665,0.9901824,0.001166285,0.00004325435,0.0001034194],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3913626,0.00001510538,0.6036249,0.000005760569,0.0007761879,0.0001266032,0.00005373362,0.0001441898,0.003890957],"genre_scores_gemma":[0.9979008,0.00002347317,0.00201327,0.000009238775,0.00001698602,0.00001150136,0.00000517974,0.000009539134,0.00001004587],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6065382,"threshold_uncertainty_score":0.4445599,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003251027,0.0001578476,0.0001604697,0.0002574085,0.0001825072,0.00008137601,0.0001081963,0.000171136,0.00005745033],"category_scores_gemma":[0.00005213585,0.000159186,0.00004458426,0.0002866246,0.0001374798,0.0007131345,0.000001754072,0.0003827233,0.0001283681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007800837,"about_ca_system_score_gemma":0.000008187265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002004552,"about_ca_topic_score_gemma":0.000002111602,"domain_scores_codex":[0.9992718,0.00006212447,0.0002682292,0.00008662975,0.0001291222,0.0001820624],"domain_scores_gemma":[0.9992432,0.000285106,0.00003532572,0.0002781849,0.00009345188,0.00006471666],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002593944,0.0001608082,0.000005830459,0.0002127267,0.0003305846,0.000001823393,0.00212744,0.4214892,0.011254,0.1341513,0.00006996411,0.4299369],"study_design_scores_gemma":[0.0004630692,0.0001151679,0.00005727955,0.00004857678,0.00003753205,0.000032456,0.001243504,0.1714471,0.8170359,0.007564544,0.00161389,0.0003410149],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05359939,0.00005939806,0.9345279,0.00007185541,0.0003187127,0.0001773195,0.000008092049,0.0011335,0.01010385],"genre_scores_gemma":[0.9978679,0.0001779592,0.001783441,0.00005803767,0.000005195784,0.00004576007,0.00000257511,0.00001571166,0.00004338865],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9442685,"threshold_uncertainty_score":0.6491415,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001954118,0.0001553423,0.0001350623,0.0002488355,0.0005764663,0.0002161311,0.0005209818,0.00007133654,0.00002483164],"category_scores_gemma":[0.00007733105,0.0001080122,0.0001188823,0.0004083946,0.0001311622,0.002186523,0.000003773746,0.0002628461,0.0001128572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003106345,"about_ca_system_score_gemma":0.0001064683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005030461,"about_ca_topic_score_gemma":5.765781e-7,"domain_scores_codex":[0.9983274,0.0003949626,0.0006054246,0.00008123009,0.0003552687,0.0002356823],"domain_scores_gemma":[0.9980437,0.0009221987,0.0002866864,0.0005144383,0.0001767477,0.00005626805],"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.00002751851,0.0000167171,3.391305e-7,0.00001961301,0.0000204229,7.032398e-8,0.004867578,0.03288191,0.00000639028,0.7906913,0.00006077006,0.1714074],"study_design_scores_gemma":[0.001078747,0.0003794683,0.00007133206,0.00009458584,0.00002499187,0.00005196307,0.00493377,0.3947287,0.0239338,0.5334294,0.04075981,0.0005134052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003787214,0.00002994751,0.9902732,0.0001732432,0.001066185,0.000180222,0.00001662719,0.0001665027,0.004306826],"genre_scores_gemma":[0.99602,0.00003240387,0.003242065,0.0005414985,0.00001269254,0.00002732683,0.000002712118,0.00000501564,0.0001163335],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9922327,"threshold_uncertainty_score":0.4433771,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001070252,0.0001405506,0.0001330775,0.0001842862,0.001347774,0.0001414634,0.0005844617,0.00006616667,0.00005212874],"category_scores_gemma":[0.00001770463,0.0001324368,0.00009604813,0.0004156056,0.00007501279,0.001699953,0.000016327,0.0001926665,0.00007367114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001172718,"about_ca_system_score_gemma":0.00004751897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002856854,"about_ca_topic_score_gemma":0.0000283679,"domain_scores_codex":[0.9990215,0.000097166,0.0003338915,0.0001293693,0.0001882441,0.000229774],"domain_scores_gemma":[0.9985042,0.0005131052,0.0001090845,0.0004060427,0.0003721078,0.00009551169],"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.0003739393,0.0002131231,0.00001285302,0.00002455943,0.000122172,0.000001336133,0.01258684,0.04386168,0.0001379485,0.4258168,0.001365681,0.515483],"study_design_scores_gemma":[0.007446878,0.001207883,0.001340135,0.0002307503,0.0001353911,0.00007475638,0.004887524,0.7793854,0.08597059,0.01413228,0.1030839,0.002104568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002131879,0.00002276431,0.9949913,0.0002865963,0.000428429,0.0003651704,0.0001058902,0.0002051539,0.001462822],"genre_scores_gemma":[0.9937874,0.00006501011,0.004918679,0.001019998,0.00001797378,0.00003576329,0.0000337832,0.000004230476,0.000117159],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9916555,"threshold_uncertainty_score":0.9999523,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002014731,0.0001552853,0.0001056462,0.0002005971,0.0004068919,0.00003214127,0.00009539905,0.00009329323,0.0001194991],"category_scores_gemma":[0.0000162713,0.000127925,0.00008258328,0.0002487891,0.00003431374,0.0009084743,2.929021e-7,0.0001731836,0.0002602207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001224813,"about_ca_system_score_gemma":0.00001561498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000207458,"about_ca_topic_score_gemma":0.000001525406,"domain_scores_codex":[0.9992862,0.00003656906,0.0002945327,0.000076773,0.000125702,0.0001801696],"domain_scores_gemma":[0.9993471,0.0002751529,0.00005983069,0.0001777003,0.0001010716,0.00003917452],"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.00006723827,0.00001486304,2.44027e-7,0.00002604788,0.00002824568,4.797568e-8,0.001086869,0.9859203,0.0001266387,0.006032852,0.001418029,0.005278678],"study_design_scores_gemma":[0.001513671,0.0002964154,0.00000887712,0.0001011566,0.00004284148,0.00006752631,0.0008424491,0.8600785,0.111197,0.003676801,0.02158781,0.0005869428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003343308,0.000008091359,0.9920326,0.00004859597,0.00110774,0.0006810243,0.00003910209,0.0004494951,0.002290071],"genre_scores_gemma":[0.9972738,0.0000395469,0.001092127,0.0002679147,0.00006261661,0.0004502706,0.0000141377,0.00003038972,0.0007692033],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9939305,"threshold_uncertainty_score":0.5216631,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008209264","doi":"10.1109/tit.2012.2205663","title":"Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":105,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Tanner graph; Decoding methods; Computer science; Degree (music); Code (set theory); Graph; Set (abstract data type); Factor graph; Belief propagation; Error floor; Mathematics; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.018091293421844,"gpt":0.2731903225689815,"spread":0.2550990291471375,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001356799,0.0001331474,0.0001592313,0.0003889347,0.0002294752,0.00004325261,0.0003330924,0.00007841006,0.00001131016],"category_scores_gemma":[0.00002065721,0.0001257057,0.0001286447,0.000313176,0.00004414712,0.0009297507,0.00000307585,0.0001387407,0.00002199422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008215004,"about_ca_system_score_gemma":0.0000393111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004619081,"about_ca_topic_score_gemma":5.001916e-7,"domain_scores_codex":[0.9989141,0.00007200082,0.0004175959,0.00009854449,0.0002209549,0.0002768342],"domain_scores_gemma":[0.9988031,0.0004658248,0.0002237124,0.0003153601,0.0001257467,0.00006626434],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003204385,0.0001509839,0.000002573501,0.00007346152,0.00003372937,9.24413e-8,0.01239035,0.01241422,0.001074497,0.01639289,0.00009670442,0.9573385],"study_design_scores_gemma":[0.0004545592,0.0001456946,0.00004350014,0.0001165162,0.00002342236,0.00002038434,0.0007151364,0.5645738,0.4316196,0.001555006,0.0004867137,0.0002457339],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005831008,0.00001606889,0.9917361,0.00003573298,0.001020159,0.0004182025,0.00002902627,0.0002694865,0.0006442311],"genre_scores_gemma":[0.8571782,0.000003680587,0.1425661,0.00009301413,0.00001460758,0.0001065575,0.000001933239,0.000006882285,0.00002909387],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9570927,"threshold_uncertainty_score":0.5126131,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007157405,0.0001570238,0.0001949889,0.0002305605,0.0002544119,0.0001052212,0.0004263388,0.0000734706,0.00004248023],"category_scores_gemma":[0.00001364211,0.0001496012,0.00007221462,0.0007738812,0.00006527793,0.0008745457,0.000005087299,0.0003198923,0.00002227832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000134646,"about_ca_system_score_gemma":0.00005667395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002778362,"about_ca_topic_score_gemma":0.00001609913,"domain_scores_codex":[0.9986632,0.0001611668,0.0005743753,0.0001413641,0.0002054388,0.0002544139],"domain_scores_gemma":[0.9987446,0.0003565577,0.0001929242,0.0005236183,0.0001243823,0.00005793445],"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.0001205333,0.0001596555,0.000002917335,0.000006260165,0.00002082528,6.25928e-7,0.001690254,0.2957247,0.0002182791,0.2313327,0.000111504,0.4706117],"study_design_scores_gemma":[0.002089218,0.0007990248,0.0006563803,0.0004164503,0.00001539566,0.000006213216,0.0002975421,0.9788372,0.007867838,0.007458739,0.001109807,0.0004462147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003203962,0.00004380704,0.9893751,0.0003194216,0.0003991972,0.0003462349,0.000003666298,0.0001240296,0.006184577],"genre_scores_gemma":[0.9959317,0.0003453355,0.002136589,0.001498275,0.00001824821,0.00002520665,0.000003915209,0.000004192457,0.00003653858],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9927278,"threshold_uncertainty_score":0.6100558,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004860745,0.00009012502,0.0001406482,0.0002338164,0.0001224944,0.00002790353,0.0004704774,0.00005594076,0.00004121605],"category_scores_gemma":[0.00001224931,0.00008517,0.00008469763,0.0004444782,0.00005983273,0.001229488,0.000002680006,0.0001652595,0.00002618894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003218036,"about_ca_system_score_gemma":0.00003588323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001478282,"about_ca_topic_score_gemma":0.000001211552,"domain_scores_codex":[0.9990921,0.0001354494,0.000408452,0.00007317272,0.0001840427,0.0001068103],"domain_scores_gemma":[0.9988993,0.0001227295,0.0001931686,0.0005258028,0.000217153,0.00004184392],"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.00005754181,0.0001717266,0.000001104934,0.00002245733,0.00002947714,8.626488e-8,0.00823986,0.07578436,0.002648826,0.4637294,0.0001349351,0.4491802],"study_design_scores_gemma":[0.001595929,0.0007822613,0.0005741188,0.0002405145,0.00002846735,0.00001463014,0.0003900802,0.5527851,0.412784,0.02546584,0.004837916,0.0005012222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01108386,0.00001918008,0.9832116,0.0004418642,0.0002626018,0.0001355726,0.000007060342,0.00007333299,0.004764931],"genre_scores_gemma":[0.9954005,0.0001120924,0.003965321,0.0004155377,0.000006463037,0.000008860019,0.000001362269,0.000002014763,0.00008778995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9843167,"threshold_uncertainty_score":0.3473132,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009574367,0.0001961483,0.0001413458,0.0002219405,0.0005003656,0.0001258199,0.0003103247,0.000129194,0.001704574],"category_scores_gemma":[0.00003188527,0.0001700236,0.0001044293,0.000379862,0.0001322133,0.001371651,0.000002963004,0.0003891983,0.0002349605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001849987,"about_ca_system_score_gemma":0.00003120514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003966779,"about_ca_topic_score_gemma":0.000006164964,"domain_scores_codex":[0.9986126,0.0002372243,0.0005130903,0.0001015591,0.0002941553,0.0002413852],"domain_scores_gemma":[0.9986449,0.0002261716,0.00009319461,0.0008175038,0.000140001,0.00007815953],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001089571,0.000629967,0.0000184107,0.0002735689,0.000507566,5.174671e-7,0.02485497,0.2907066,0.0007607045,0.6281822,0.004871272,0.04908519],"study_design_scores_gemma":[0.002095905,0.0002366585,0.0001734152,0.0001387162,0.0001426935,0.00002005243,0.003073139,0.2151779,0.1887924,0.06044799,0.5284276,0.001273503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07782079,0.00003786374,0.9072878,0.0002821414,0.0007277015,0.0007057307,0.00009769601,0.001080176,0.01196008],"genre_scores_gemma":[0.9989473,0.00007829159,0.000206698,0.0003256019,0.00001279871,0.0002409016,0.00006371761,0.00001835636,0.0001063871],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9211264,"threshold_uncertainty_score":0.999208,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007547612,0.0003337759,0.00025153,0.0003782393,0.0006146493,0.0002733529,0.001061294,0.00011443,0.0001050994],"category_scores_gemma":[0.00000443987,0.0002632742,0.00008998843,0.0004744696,0.0001407143,0.002882619,0.00001066499,0.0004082618,0.00009999248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001221869,"about_ca_system_score_gemma":0.0002376845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004636192,"about_ca_topic_score_gemma":0.00001124604,"domain_scores_codex":[0.9976165,0.0002843662,0.0004727748,0.0004467329,0.0007892936,0.0003903871],"domain_scores_gemma":[0.9977238,0.0002014363,0.0001908916,0.001509619,0.0001677308,0.0002065648],"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.0003698326,0.0002791502,2.209975e-7,0.00002094687,0.00003250262,0.000006175139,0.0005973238,0.8354628,0.00001880876,0.03389608,0.0002113354,0.1291048],"study_design_scores_gemma":[0.003094454,0.0003289031,0.000001408187,0.0001541711,0.00003324141,0.00002383309,0.0003017697,0.9864451,0.003205988,0.0009907171,0.005062479,0.0003579881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006721205,0.00001045508,0.993987,0.0001193114,0.001019409,0.0005672753,0.0004517245,0.0002774289,0.002895279],"genre_scores_gemma":[0.9728691,0.000009045784,0.02600628,0.000740456,0.00002944634,0.0000468834,0.0001804809,0.00002130278,0.0000969985],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.972197,"threshold_uncertainty_score":0.9999819,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003521513,0.0002343129,0.0002137998,0.0002042997,0.0007324404,0.00007237069,0.0001652421,0.0001313418,0.0008881831],"category_scores_gemma":[0.0001838336,0.0002074203,0.0001345312,0.0004508836,0.0001600762,0.0008683476,0.000001797391,0.0001987568,0.0001659687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001282182,"about_ca_system_score_gemma":0.00008890184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004958038,"about_ca_topic_score_gemma":0.00002344225,"domain_scores_codex":[0.9984718,0.00007633649,0.0006863693,0.0002156005,0.0002650084,0.000284892],"domain_scores_gemma":[0.9978164,0.0008253548,0.0003258916,0.0004358986,0.0004326553,0.0001637312],"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.0003292096,0.000377014,0.000003316384,0.00003381669,0.00007927661,1.389832e-7,0.0011381,0.00219111,0.0001491485,0.9904005,0.0009181078,0.004380289],"study_design_scores_gemma":[0.007977375,0.0004521138,0.00274604,0.00009333104,0.0006696603,0.00005076271,0.002761361,0.1935937,0.01771373,0.7681073,0.004746852,0.001087782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008366199,9.270495e-7,0.9888704,0.0001963371,0.0001702392,0.001229921,0.003918603,0.0003445126,0.004432405],"genre_scores_gemma":[0.8631342,0.000002374995,0.1335839,0.0002434353,0.0000242052,0.001474175,0.0009943288,0.00002730864,0.0005160987],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8622976,"threshold_uncertainty_score":0.9724982,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006048746,0.0001588883,0.0001430517,0.0003056122,0.0003649613,0.0001996377,0.000474094,0.00007543617,0.00003948739],"category_scores_gemma":[0.00001104923,0.0001492331,0.0001748409,0.0002608846,0.00006702754,0.001758968,0.000001414419,0.0001402443,0.0001076876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000332985,"about_ca_system_score_gemma":0.00003690916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001700123,"about_ca_topic_score_gemma":8.550812e-7,"domain_scores_codex":[0.9989877,0.00008419213,0.0003496854,0.0001536929,0.0001815477,0.0002431567],"domain_scores_gemma":[0.9989093,0.0003714731,0.0001101412,0.0004215317,0.000102134,0.0000854521],"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.0002178368,0.0001061524,0.000001289993,0.00001535253,0.00002989086,5.039494e-7,0.001892182,0.003314307,0.0003401811,0.7058604,0.0001258913,0.288096],"study_design_scores_gemma":[0.002799605,0.001137888,0.0001386622,0.0001153542,0.00005844258,0.00004958999,0.0006880308,0.09954635,0.04869838,0.8349978,0.01094756,0.0008223322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002919569,0.00001273235,0.9922264,0.000399462,0.0005366539,0.0003321657,0.00004639212,0.0004138499,0.00311276],"genre_scores_gemma":[0.9807277,0.00001345448,0.017183,0.001906402,0.00001926797,0.00005902778,0.00000512701,0.000004584488,0.00008140289],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9778082,"threshold_uncertainty_score":0.608555,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001756214,0.0001393375,0.00009400107,0.0002011608,0.0003141801,0.00009854052,0.0001303454,0.00004746868,0.0007774393],"category_scores_gemma":[0.000001884575,0.000131304,0.000102232,0.0002167717,0.00002480407,0.001488289,8.004512e-7,0.0002088715,0.003906543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005759434,"about_ca_system_score_gemma":0.00006260433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002315848,"about_ca_topic_score_gemma":5.210585e-7,"domain_scores_codex":[0.9992236,0.00001855756,0.0003323979,0.00006940063,0.0001921615,0.0001639145],"domain_scores_gemma":[0.9994007,0.00005703482,0.0001291103,0.0002601246,0.00007903596,0.00007397978],"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.00003148033,0.00007473845,2.018845e-7,0.000005032382,0.00001976711,1.963985e-8,0.0005300663,0.01350267,0.00001737267,0.9261811,0.000135249,0.05950234],"study_design_scores_gemma":[0.001102433,0.0001245089,0.00001546283,0.00003424818,0.00002338085,0.000001157295,0.0006793468,0.001318858,0.01644334,0.9677965,0.01222141,0.0002393655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01082409,7.145527e-7,0.9661277,0.0002308366,0.0003078716,0.0002748554,0.0001547513,0.0001017137,0.02197748],"genre_scores_gemma":[0.9985277,0.000002329951,0.0003072463,0.0008297562,0.00003126001,0.0001573915,0.00007109901,0.000006980183,0.00006623731],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9877036,"threshold_uncertainty_score":0.996869,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100525102","doi":"10.1109/tit.2009.2018350","title":"Braided Block Codes","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"National Aeronautics and Space Administration; National Science Foundation","keywords":"Block code; Concatenated error correction code; Linear code; Expander code; Computer science; Decoding methods; Serial concatenated convolutional codes; Convolutional code; Tornado code; Block (permutation group theory); Sequential decoding; Theoretical computer science; Algorithm; Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.009182243179655785,"gpt":0.2404326014872944,"spread":0.2312503583076386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004903253,0.000135053,0.0001118034,0.0003267001,0.0002266416,0.0001558955,0.000525316,0.00007948111,0.00002924097],"category_scores_gemma":[0.00001703283,0.0001313453,0.00008564612,0.0003994885,0.00002849785,0.00228911,0.000001398228,0.0002343467,0.0003220407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000065051,"about_ca_system_score_gemma":0.00004449879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005023741,"about_ca_topic_score_gemma":0.000002287358,"domain_scores_codex":[0.9990503,0.00008315925,0.0003068236,0.0001254023,0.0002424479,0.0001918532],"domain_scores_gemma":[0.9990649,0.0001596405,0.000108537,0.0004975764,0.0001042291,0.00006517967],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005636815,0.0001312368,0.000001697903,0.00001253652,0.0000211685,0.000001637162,0.004560221,0.007823833,0.0008632194,0.1685925,0.001565256,0.8163703],"study_design_scores_gemma":[0.001298317,0.001260098,0.0004734843,0.0001777594,0.00003850068,0.0002191609,0.0005275774,0.1153206,0.6442378,0.2247241,0.01048103,0.001241603],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002179663,0.000004897796,0.9806467,0.0005637471,0.0004706374,0.0001761866,0.00000381113,0.001460941,0.01449339],"genre_scores_gemma":[0.9769516,0.000008242445,0.02019461,0.002538383,0.00001368716,0.00001975181,0.000001071919,0.000004107558,0.0002685392],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9747719,"threshold_uncertainty_score":0.5356105,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002469717,0.0001761253,0.0001466377,0.000311087,0.000205349,0.00003468896,0.000165342,0.000120803,0.0008128112],"category_scores_gemma":[0.00001625263,0.0001911872,0.00008168421,0.0003362162,0.00008907294,0.00104992,6.974633e-7,0.0003033635,0.001320336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009938331,"about_ca_system_score_gemma":0.00002800678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.822136e-7,"about_ca_topic_score_gemma":8.944074e-7,"domain_scores_codex":[0.9991225,0.00008782298,0.0003795678,0.000074024,0.0001518029,0.0001843026],"domain_scores_gemma":[0.9990347,0.0002455643,0.00006424329,0.0005011907,0.00008181402,0.00007245942],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003059186,0.00006992622,0.000002288979,0.00005829052,0.0001056264,3.503859e-7,0.001425703,0.7663029,0.002633149,0.1672866,0.0009044775,0.06118008],"study_design_scores_gemma":[0.001131485,0.0000993808,0.00001692655,0.0001066471,0.00006312801,0.00004183639,0.0008216238,0.1010603,0.7788792,0.05149436,0.06533813,0.0009469898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001248905,0.00003628739,0.937101,0.00004294235,0.000229831,0.0002836322,0.00003416356,0.001503783,0.05951947],"genre_scores_gemma":[0.9845549,0.0001621173,0.01456956,0.0001547885,0.00001018841,0.00009586004,0.00001879418,0.00003037429,0.0004034159],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.983306,"threshold_uncertainty_score":0.9994572,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001859841,0.000180405,0.0001451772,0.0002726116,0.0002999485,0.00004900256,0.0001538176,0.0000975426,0.00002815781],"category_scores_gemma":[0.00000461302,0.0001738474,0.00005399064,0.0003069188,0.00007290068,0.001541996,6.676632e-7,0.0002333129,0.00009259545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002524432,"about_ca_system_score_gemma":0.00003866975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002619535,"about_ca_topic_score_gemma":0.000005556983,"domain_scores_codex":[0.9992805,0.00001906193,0.0002801418,0.00008303273,0.0001386708,0.0001986246],"domain_scores_gemma":[0.9993514,0.00008862827,0.00007678058,0.0002702564,0.0001633206,0.00004960743],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002304407,0.00003722807,0.000001535212,0.00008724013,0.00005861955,5.445286e-8,0.0009413562,0.9696412,0.003333312,0.001715778,0.00005819156,0.02389506],"study_design_scores_gemma":[0.002000822,0.0007570723,0.00005816323,0.0003037527,0.00006732756,0.00005682753,0.0004708783,0.3208052,0.665607,0.003717515,0.005448663,0.0007067777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03110472,0.00001148563,0.9650267,0.00006178137,0.0001139474,0.0004906784,0.00003948652,0.001304471,0.001846723],"genre_scores_gemma":[0.976892,0.0002025682,0.02222956,0.00007966519,0.00001652551,0.0003780175,0.00002119211,0.00003196653,0.0001485145],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9457873,"threshold_uncertainty_score":0.708929,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119604283","doi":"10.1109/tit.2013.2251395","title":"On the Girth of Quasi-Cyclic Protograph LDPC Codes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Girth (graph theory); Low-density parity-check code; Mathematics; Tanner graph; Combinatorics; Upper and lower bounds; Discrete mathematics; Odd graph; Base (topology); Degree (music); Graph; Decoding methods; Chordal graph; Algorithm; 1-planar graph; Error floor","retraction":null,"screen_n_in":null,"score":{"opus":0.009495993991673227,"gpt":0.2240988473380092,"spread":0.2146028533463359,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006909975,0.0001446618,0.0001293599,0.0003555777,0.0002312381,0.0001197861,0.0007056858,0.00007272594,0.000147378],"category_scores_gemma":[0.00003601498,0.0001009815,0.0001202496,0.0005295725,0.0001051793,0.001515968,0.000003494702,0.0002823229,0.0003316481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003354402,"about_ca_system_score_gemma":0.00003810453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005338656,"about_ca_topic_score_gemma":0.000005313957,"domain_scores_codex":[0.9988109,0.0001878662,0.0003889538,0.000117566,0.0003180985,0.000176563],"domain_scores_gemma":[0.9982134,0.0006677457,0.0002160152,0.0006888994,0.0001689706,0.00004496071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007167336,0.0003723988,0.00001672147,0.00007860008,0.00007375521,2.476553e-7,0.009581912,0.002975225,0.001115942,0.6077703,0.002105017,0.3758382],"study_design_scores_gemma":[0.0007944753,0.001710477,0.0006921522,0.0003688295,0.00003170237,0.00002890192,0.001901975,0.06820802,0.5706623,0.3531726,0.001639,0.000789565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01891744,0.000002740466,0.9723917,0.0004424506,0.0002958877,0.001046801,0.000005817163,0.0004806738,0.006416513],"genre_scores_gemma":[0.9941199,0.000007514696,0.004273445,0.0008406134,0.000006311333,0.0006385617,7.779039e-7,0.000006996162,0.000105899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9752024,"threshold_uncertainty_score":0.4262776,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003840549,0.0001211829,0.0001363836,0.0007424483,0.0002008739,0.00006355447,0.0002612794,0.00007036724,0.0001025402],"category_scores_gemma":[0.000004573832,0.0001158974,0.0001372103,0.0007795656,0.000118827,0.00170795,0.000002239153,0.0001775094,0.00007639401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005111859,"about_ca_system_score_gemma":0.00006366192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003607865,"about_ca_topic_score_gemma":0.0000436909,"domain_scores_codex":[0.9989372,0.00008038507,0.0005143976,0.0001108689,0.0001818638,0.0001752459],"domain_scores_gemma":[0.9992371,0.0001724519,0.0001441076,0.0003409947,0.00006628755,0.00003911789],"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.0001128139,0.0002445493,0.00005832679,0.00002869862,0.00002793593,4.57759e-7,0.001185359,0.03881706,0.000337848,0.8699532,0.0002065631,0.08902722],"study_design_scores_gemma":[0.008129726,0.001494538,0.007005438,0.0003652743,0.0001658104,0.0002152639,0.007511236,0.06283263,0.1014723,0.794726,0.01409044,0.00199137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04609689,0.000006804148,0.9400319,0.00009143116,0.000638702,0.0001772159,0.00002798192,0.0001282229,0.01280078],"genre_scores_gemma":[0.9973793,0.000002827244,0.002367056,0.00008738285,0.00001428079,0.00004983324,0.00000517956,0.000003834918,0.00009027637],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9512824,"threshold_uncertainty_score":0.472616,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005658374,0.0001763018,0.000120983,0.000528398,0.001403277,0.0002470798,0.0006136305,0.00006883031,0.00002253566],"category_scores_gemma":[0.0000129166,0.000113672,0.0001161471,0.001414008,0.0002110613,0.003671123,0.00000245656,0.0002875249,0.0005660261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004597084,"about_ca_system_score_gemma":0.00008234866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001043368,"about_ca_topic_score_gemma":0.000002500851,"domain_scores_codex":[0.9985753,0.0001025054,0.0004199951,0.000110415,0.0004969783,0.0002947969],"domain_scores_gemma":[0.9986051,0.0003309751,0.00019326,0.0005515966,0.0002055791,0.0001134757],"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.00009678343,0.00006134387,0.00000329925,0.00001524259,0.00005723918,0.000001286076,0.005575554,0.01062837,0.000007518921,0.9187617,0.0005462263,0.0642454],"study_design_scores_gemma":[0.005924486,0.002228527,0.001827493,0.0001564747,0.00008432314,0.001435512,0.005531816,0.6726742,0.05432767,0.1184979,0.1347719,0.00253964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01090706,0.0000130025,0.9771042,0.0003766956,0.0007821544,0.0002428498,0.000007893441,0.000343584,0.01022254],"genre_scores_gemma":[0.9971371,0.00009400409,0.001342282,0.001205651,0.00001654343,0.00008095256,0.000001898132,0.000005911289,0.0001156624],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.98623,"threshold_uncertainty_score":0.9998968,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003999298,0.0001289597,0.00008317884,0.0003423093,0.0003146834,0.0001676315,0.0003267912,0.00005740798,0.0001482928],"category_scores_gemma":[0.000003052055,0.000105892,0.00006988101,0.0005050809,0.00007465006,0.004082225,0.00000117273,0.0001756257,0.0004159738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004350098,"about_ca_system_score_gemma":0.00005577301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002466767,"about_ca_topic_score_gemma":0.000003495021,"domain_scores_codex":[0.9991514,0.00008346261,0.0002375647,0.0001215717,0.0002363875,0.0001696],"domain_scores_gemma":[0.9992853,0.0001288823,0.0001045048,0.0003396885,0.000069313,0.00007226505],"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.0001360252,0.00008108745,0.000002632841,0.0000100531,0.00002637358,6.285648e-7,0.002794329,0.07223192,0.00006699227,0.361177,0.0000539152,0.563419],"study_design_scores_gemma":[0.006596832,0.002527437,0.0005438832,0.0004574838,0.0001463133,0.0003535077,0.00198616,0.60851,0.166492,0.1699548,0.03993253,0.002498942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006562,0.000006463986,0.9858391,0.0003596611,0.0002576761,0.0001947303,0.000006501891,0.0004131862,0.006360671],"genre_scores_gemma":[0.988748,0.000004825304,0.01008142,0.0009153798,0.00002445273,0.00005596689,0.000002435793,0.000004396455,0.0001631851],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.982186,"threshold_uncertainty_score":0.534664,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001613455,0.0001605638,0.0001632826,0.0002164065,0.0005199266,0.00001928132,0.000226612,0.00009805369,0.00003496014],"category_scores_gemma":[0.000008446002,0.0001368534,0.00005779827,0.0002066959,0.00008595497,0.0009712743,0.000002344221,0.0001856077,0.00004129431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00012704,"about_ca_system_score_gemma":0.00002650022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007961328,"about_ca_topic_score_gemma":0.00001030486,"domain_scores_codex":[0.9992755,0.00003531333,0.000287225,0.0000720406,0.0001603868,0.000169511],"domain_scores_gemma":[0.9991155,0.000250739,0.0000774687,0.0003570136,0.0001389267,0.00006035107],"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.001107712,0.0000428815,0.000004125194,0.0002280581,0.0001114803,8.264894e-7,0.002738048,0.9816427,0.0006305736,0.001061509,0.0002600519,0.01217201],"study_design_scores_gemma":[0.004255995,0.001626471,0.00005424022,0.0003779572,0.0001514956,0.0002118657,0.00449552,0.6368254,0.3288169,0.000644601,0.02100041,0.00153913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02194743,0.00002136686,0.975336,0.000009412262,0.0002003368,0.0005590289,0.0001097262,0.001242256,0.0005744462],"genre_scores_gemma":[0.987975,0.0001937772,0.01132517,0.00004269034,0.00001593278,0.0002378464,0.00001778505,0.00002294136,0.0001688776],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9660276,"threshold_uncertainty_score":0.5580718,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004583681,0.0001585821,0.0001083697,0.0003367813,0.0003227075,0.0002774684,0.0005675811,0.00008085315,0.0001351844],"category_scores_gemma":[0.000007595083,0.0001305968,0.00009244367,0.0005248056,0.0001300678,0.003124405,0.00000193194,0.0004027166,0.0001702715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000175137,"about_ca_system_score_gemma":0.0001253486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002137009,"about_ca_topic_score_gemma":0.00001440445,"domain_scores_codex":[0.9990749,0.00005295971,0.0002456673,0.0001559874,0.00024494,0.0002255102],"domain_scores_gemma":[0.9990287,0.0001925291,0.0001099055,0.0004686645,0.00006627184,0.0001339165],"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.0001422962,0.00005822491,0.00001519112,0.00001832252,0.00008512048,0.000002411588,0.005709974,0.03642891,0.001711237,0.679022,0.00009155505,0.2767148],"study_design_scores_gemma":[0.004805801,0.002848762,0.0005871483,0.000360256,0.000195697,0.0006929002,0.003589177,0.05157195,0.2971699,0.6257549,0.009124702,0.003298798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06228888,0.000003247078,0.9322631,0.0002511444,0.0007578555,0.0001389103,0.000004729199,0.0003488956,0.003943235],"genre_scores_gemma":[0.9072733,0.000004072301,0.09199411,0.0006081727,0.00001920006,0.00002578693,0.000001359819,0.000005516574,0.00006848892],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8449844,"threshold_uncertainty_score":0.5325583,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163750149","doi":"10.1109/tit.2005.856934","title":"Analysis of Low-Density Parity-Check Codes for the Gilbert–Elliott Channel","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Low-density parity-check code; Decoding methods; List decoding; Algorithm; Sequential decoding; Channel (broadcasting); Computer science; Concatenated error correction code; Theoretical computer science; Mathematics; Telecommunications; Block code","retraction":null,"screen_n_in":null,"score":{"opus":0.01269385825656941,"gpt":0.252619449542173,"spread":0.2399255912856036,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001217686,0.0001394795,0.0002191132,0.0005619123,0.00032145,0.00008446754,0.0006283661,0.00008953508,0.00002412165],"category_scores_gemma":[0.0000375473,0.0001104831,0.0002929816,0.001040126,0.00007927337,0.001273261,0.000004510103,0.0001910451,0.00002718666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007021743,"about_ca_system_score_gemma":0.00004232119,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003508911,"about_ca_topic_score_gemma":0.0001109205,"domain_scores_codex":[0.9988759,0.00008998458,0.0004502766,0.000140057,0.0002586324,0.0001851441],"domain_scores_gemma":[0.9978101,0.0009850021,0.0002462943,0.0006563226,0.0002582153,0.00004412905],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002520145,0.0003430057,0.00002354991,0.0001108486,0.001353186,2.154361e-7,0.01951444,0.465844,0.0003929099,0.07259789,0.0007871451,0.4387808],"study_design_scores_gemma":[0.0002586212,0.00009429632,0.0002698878,0.00002649013,0.0003364337,0.000003480206,0.0003939269,0.8739467,0.1195116,0.003803767,0.001138609,0.0002162323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003504484,0.00001375763,0.9942175,0.0005343502,0.0003103364,0.0003475907,0.00002897857,0.0003127385,0.0007303309],"genre_scores_gemma":[0.9881947,0.00003079333,0.01084111,0.0006390118,0.00001893069,0.00008614777,0.000004405513,0.000005734818,0.0001791403],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9846902,"threshold_uncertainty_score":0.4505372,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007538447,0.0001172996,0.0001512975,0.0002432497,0.0001280168,0.00008266221,0.0004052561,0.00005398369,0.00001412322],"category_scores_gemma":[0.00002163791,0.0001006668,0.00007912678,0.0003353271,0.00006236712,0.001018951,0.000004214125,0.0001684994,0.00007090665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003681852,"about_ca_system_score_gemma":0.0001023612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001000208,"about_ca_topic_score_gemma":0.000001176271,"domain_scores_codex":[0.9989688,0.0001086653,0.0003509928,0.0001090037,0.0002952997,0.0001671989],"domain_scores_gemma":[0.9990594,0.0001661042,0.0001415018,0.0003538385,0.000179133,0.00009997151],"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.0001039124,0.0001430887,0.000006910468,0.00006858875,0.00005124814,8.984035e-7,0.01533368,0.4100838,0.0001457005,0.1623303,0.0004287063,0.4113032],"study_design_scores_gemma":[0.000682395,0.0002003183,0.00003934663,0.00005821985,0.00000989368,0.00002237251,0.0006933925,0.9452866,0.02123633,0.02969787,0.001850854,0.0002224318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02607591,0.0000127086,0.9710243,0.000120197,0.001153286,0.0001096969,0.00001388206,0.0001738979,0.001316105],"genre_scores_gemma":[0.9833508,0.000003621555,0.01637972,0.0001875629,0.00001601394,0.000009610576,0.000001494194,0.000005017555,0.00004616346],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9572749,"threshold_uncertainty_score":0.4105071,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}